blob_id stringlengths 40 40 | directory_id stringlengths 40 40 | path stringlengths 7 139 | content_id stringlengths 40 40 | detected_licenses listlengths 0 16 | license_type stringclasses 2
values | repo_name stringlengths 7 55 | snapshot_id stringlengths 40 40 | revision_id stringlengths 40 40 | branch_name stringclasses 6
values | visit_date int64 1,471B 1,694B | revision_date int64 1,378B 1,694B | committer_date int64 1,378B 1,694B | github_id float64 1.33M 604M ⌀ | star_events_count int64 0 43.5k | fork_events_count int64 0 1.5k | gha_license_id stringclasses 6
values | gha_event_created_at int64 1,402B 1,695B ⌀ | gha_created_at int64 1,359B 1,637B ⌀ | gha_language stringclasses 19
values | src_encoding stringclasses 2
values | language stringclasses 1
value | is_vendor bool 1
class | is_generated bool 1
class | length_bytes int64 3 6.4M | extension stringclasses 4
values | content stringlengths 3 6.12M |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
c0d57a18f014d0dd51c8857c82bd23f5d7ec241c | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /src/Init/Data/Format/Macro.lean | 72910a493a0459eabf8307453ca3634d957298e8 | [
"Apache-2.0"
] | permissive | WojciechKarpiel/lean4 | 7f89706b8e3c1f942b83a2c91a3a00b05da0e65b | f6e1314fa08293dea66a329e05b6c196a0189163 | refs/heads/master | 1,686,633,402,214 | 1,625,821,189,000 | 1,625,821,258,000 | 384,640,886 | 0 | 0 | Apache-2.0 | 1,625,903,617,000 | 1,625,903,026,000 | null | UTF-8 | Lean | false | false | 404 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
prelude
import Init.Data.Format.Basic
import Init.Data.ToString.Macro
namespace Std
syntax:max "f!" interpolatedStr(term) : term
macro_rules
| `(f! $int... |
21055987513bb22b64c0403134592482f63bbb04 | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/linear_algebra/affine_space/affine_map.lean | 8993df84d9187aa0c203e4887aced85ec71079b6 | [
"Apache-2.0"
] | permissive | ilitzroth/mathlib | ea647e67f1fdfd19a0f7bdc5504e8acec6180011 | 5254ef14e3465f6504306132fe3ba9cec9ffff16 | refs/heads/master | 1,680,086,661,182 | 1,617,715,647,000 | 1,617,715,647,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 19,250 | lean | /-
Copyright (c) 2020 Joseph Myers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Joseph Myers
-/
import linear_algebra.affine_space.basic
import linear_algebra.tensor_product
import linear_algebra.prod
import linear_algebra.pi
import data.set.intervals.unordered_inte... |
5d19cf0649e0d3e17cfb8b574ed20c86ad33a508 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/tactic/linarith/frontend.lean | 5ea2c37df8738cc3956997502048709c37747808 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 18,580 | lean | /-
Copyright (c) 2018 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
-/
import tactic.linarith.verification
import tactic.linarith.preprocessing
/-!
# `linarith`: solving linear arithmetic goals
`linarith` is a tactic for solving goa... |
2f486308c6ce727cd52cdcfa40dce4de860d5dd1 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/coe1.lean | 55ff6dfa6ee0f46c470202744d850c775eb5a4d8 | [
"Apache-2.0"
] | permissive | soonhokong/lean | cb8aa01055ffe2af0fb99a16b4cda8463b882cd1 | 38607e3eb57f57f77c0ac114ad169e9e4262e24f | refs/heads/master | 1,611,187,284,081 | 1,450,766,737,000 | 1,476,122,547,000 | 11,513,992 | 2 | 0 | null | 1,401,763,102,000 | 1,374,182,235,000 | C++ | UTF-8 | Lean | false | false | 603 | lean | prelude
constant A : Type.{1}
constant B : Type.{1}
constant f : A → B
attribute f [coercion]
constant g : B → B → B
constants a1 a2 a3 : A
constants b1 b2 b3 : B
check g a1 b1
set_option pp.coercions true
check g a1 b1
constant eq {A : Type} : A → A → Type.{0}
check eq a1 a2
check eq a1 b1
set_option pp.implicit tru... |
e8b3e7d2db4468c130868cd2962f8584483ea0ad | 3ed5a65c1ab3ce5d1a094edce8fa3287980f197b | /src/herstein/ex1_1/Q_02.lean | 577b7b5d693da61f51b41f5aceea7ea91cf36358 | [] | no_license | group-study-group/herstein | 35d32e77158efa2cc303c84e1ee5e3bc80831137 | f5a1a72eb56fa19c19ece0cb3ab6cf7ffd161f66 | refs/heads/master | 1,586,202,191,519 | 1,548,969,759,000 | 1,548,969,759,000 | 157,746,953 | 0 | 0 | null | 1,542,412,901,000 | 1,542,302,366,000 | Lean | UTF-8 | Lean | false | false | 370 | lean | import data.set.basic
variable α: Type*
variables A B C: set α
open set
theorem Q2a: A ∩ B = B ∩ A :=
ext $ λ x,
⟨λ ⟨ha, hb⟩, ⟨hb, ha⟩,
λ ⟨hb, ha⟩, ⟨ha, hb⟩⟩
theorem Q2b: (A ∩ B) ∩ C = A ∩ (B ∩ C) :=
ext $ λ x,
⟨λ ⟨⟨ha, hb⟩, hc⟩, ⟨ha, ⟨hb, hc⟩⟩,
λ ⟨ha, ⟨hb, hc⟩⟩, ⟨⟨ha, hb⟩, hc⟩⟩
|
00ed31d4f54bcca79e7a945c6126a3fed91157c8 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /hott/algebra/bundled.hlean | 12026213545ad369bde9575a2fe7a329a63eb092 | [
"Apache-2.0"
] | permissive | soonhokong/lean-osx | 4a954262c780e404c1369d6c06516161d07fcb40 | 3670278342d2f4faa49d95b46d86642d7875b47c | refs/heads/master | 1,611,410,334,552 | 1,474,425,686,000 | 1,474,425,686,000 | 12,043,103 | 5 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 2,080 | hlean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
Bundled structures
-/
import algebra.group
open algebra
namespace algebra
structure Semigroup :=
(carrier : Type) (struct : semigroup carrier)
attribute Semigroup.carri... |
25359049dab08e33ab1a03d0be77f12d595e0ec4 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/elabissues/ProjNotation.lean | 4296395f791c0836aafec9315bf0c07dbcdc6519 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 411 | lean | /- Underapplying a projection notation applies the 'this' argument to the wrong parameter.
It should either fail or (preferably) construct an explicit lambda. -/
-- Char → Bool
#check fun c => ['a', 'b'].elem c
-- List (List Char) → Bool
#check ['a', 'b'].elem
-- works
#check fun (s : String) => s.split (fun c => [... |
f5b4c61c9f8ce55c7bd680f257d1e76e3b3759d1 | 02005f45e00c7ecf2c8ca5db60251bd1e9c860b5 | /src/data/zmod/basic.lean | 1bb56443545f3023eb61bd08aef5d9850a21f84a | [
"Apache-2.0"
] | permissive | anthony2698/mathlib | 03cd69fe5c280b0916f6df2d07c614c8e1efe890 | 407615e05814e98b24b2ff322b14e8e3eb5e5d67 | refs/heads/master | 1,678,792,774,873 | 1,614,371,563,000 | 1,614,371,563,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 29,403 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Chris Hughes
-/
import data.int.modeq
import algebra.char_p.basic
import data.nat.totient
import ring_theory.ideal.operations
/-!
# Integers mod `n`
Definition of the integers mod n, a... |
b7799c1219673a9ab4d53de8a76fb890b083122b | 07c6143268cfb72beccd1cc35735d424ebcb187b | /src/category_theory/graded_object.lean | 51941a7a58c00467310fdbc01a8739c191197a36 | [
"Apache-2.0"
] | permissive | khoek/mathlib | bc49a842910af13a3c372748310e86467d1dc766 | aa55f8b50354b3e11ba64792dcb06cccb2d8ee28 | refs/heads/master | 1,588,232,063,837 | 1,587,304,803,000 | 1,587,304,803,000 | 176,688,517 | 0 | 0 | Apache-2.0 | 1,553,070,585,000 | 1,553,070,585,000 | null | UTF-8 | Lean | false | false | 6,912 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.shift
import category_theory.limits.shapes.zero
import category_theory.concrete_category
/-!
# The category of graded objects
For any type `β... |
2f13ac3c6d89fa07fde4b13e3d54d757452bca89 | 7a468d7c7c0949ab8b191bb62ff6d4d2af9f3917 | /test/p_implies_p.lean | b4a7a81cbf31625a8faa939388ee9f34dd897ab2 | [
"Apache-2.0"
] | permissive | seanpm2001/LeanProver_SMT2_Interface | c15b2fba021c406d965655b182eef54a14121b82 | 7ff0ce248b68ea4db2a2d4966a97b5786da05ed7 | refs/heads/master | 1,688,599,220,366 | 1,547,825,187,000 | 1,547,825,187,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 84 | lean | import smt2
lemma p_implies_p (P : Prop) : P → P :=
begin
intros,
z3
end
|
952cc2b082b478a4fe46cd18cdf55432966c9c0a | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/user_recursor.lean | ef6dab08f5f0530b53ec82bf1cab8b18d7f8ef25 | [
"Apache-2.0"
] | permissive | soonhokong/lean | cb8aa01055ffe2af0fb99a16b4cda8463b882cd1 | 38607e3eb57f57f77c0ac114ad169e9e4262e24f | refs/heads/master | 1,611,187,284,081 | 1,450,766,737,000 | 1,476,122,547,000 | 11,513,992 | 2 | 0 | null | 1,401,763,102,000 | 1,374,182,235,000 | C++ | UTF-8 | Lean | false | false | 402 | lean | import data.finset
check @and.rec
definition and.rec2 [recursor 4] {p r : Prop} (H₁ : p → r) (H₂ : p ∧ p) : r :=
and.rec_on H₂ (λ h₁ h₁, H₁ h₁)
set_option pp.all true
check ∃ x : nat, x = x
print [recursor] and.rec2
print [recursor] or.rec
print [recursor] and.rec
print [recursor] nat.rec
print [recursor] finset.ind... |
56c2431fa5e136f3c2a708fdf46e77165d8d4330 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /stage0/src/Init/Lean/Data/Format.lean | e0ae98b510ab623ad9a75b95e66ac54d0dd6802e | [
"Apache-2.0"
] | permissive | mhuisi/lean4 | 28d35a4febc2e251c7f05492e13f3b05d6f9b7af | dda44bc47f3e5d024508060dac2bcb59fd12e4c0 | refs/heads/master | 1,621,225,489,283 | 1,585,142,689,000 | 1,585,142,689,000 | 250,590,438 | 0 | 2 | Apache-2.0 | 1,602,443,220,000 | 1,585,327,814,000 | C | UTF-8 | Lean | false | false | 7,801 | lean | /-
Copyright (c) 2018 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
prelude
import Init.Data.Array
import Init.Lean.Data.Options
universes u v
namespace Lean
inductive Format
| nil : Format
| line : Format
... |
96b1cdb58e71a3b04add2dbe9e4e1e4659672af2 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/data/list/default.lean | aeda587b9cf86f349a076b8a3ffca4c6098cbf24 | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 712 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
-/
import data.list.alist
import data.list.basic
import data.list.chain
import data.list.defs
import data.list.dedup
import data.list.forall2
import data.list.func... |
0a297037c8aaaf89fa9a33fb3036e5ec19216553 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/topology/algebra/valuation.lean | a89243493d4c3b1fa7f783da7bb08667dc9e14fe | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 6,320 | lean | /-
Copyright (c) 2021 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot
-/
import topology.algebra.nonarchimedean.bases
import topology.algebra.uniform_filter_basis
import ring_theory.valuation.basic
/-!
# The topology on a valued ring
> ... |
03aadefd3b6be7a4a384bd88a1339176b967dbd8 | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/tactic/tfae.lean | cf491060b42fce10569690c3e8afee052c24015e | [
"Apache-2.0"
] | permissive | vaibhavkarve/mathlib | a574aaf68c0a431a47fa82ce0637f0f769826bfe | 17f8340912468f49bdc30acdb9a9fa02eeb0473a | refs/heads/master | 1,621,263,802,637 | 1,585,399,588,000 | 1,585,399,588,000 | 250,833,447 | 0 | 0 | Apache-2.0 | 1,585,410,341,000 | 1,585,410,341,000 | null | UTF-8 | Lean | false | false | 5,001 | lean | /-
Copyright (c) 2018 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Reid Barton, Simon Hudon
"The Following Are Equivalent" (tfae) :
Tactic for proving the equivalence of a set of proposition
using various implications between them.
-/... |
15b3474309d3f7021fc4393640fbdb757b38e1cb | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/ring_theory/witt_vector/mul_p.lean | 750ab4c8d9e65b1495722e9cc98b86f9148a7307 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 2,882 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import ring_theory.witt_vector.is_poly
/-!
## Multiplication by `n` in the ring of Witt vectors
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this fi... |
bdf06e380c7728642d653a0d350bf339880ca4e9 | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/linear_algebra/affine_space/finite_dimensional.lean | 15ae7242e0116752479161ff024e3208bf1dee01 | [
"Apache-2.0"
] | permissive | agjftucker/mathlib | d634cd0d5256b6325e3c55bb7fb2403548371707 | 87fe50de17b00af533f72a102d0adefe4a2285e8 | refs/heads/master | 1,625,378,131,941 | 1,599,166,526,000 | 1,599,166,526,000 | 160,748,509 | 0 | 0 | Apache-2.0 | 1,544,141,789,000 | 1,544,141,789,000 | null | UTF-8 | Lean | false | false | 4,692 | lean | /-
Copyright (c) 2020 Joseph Myers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Joseph Myers.
-/
import linear_algebra.affine_space.independent
import linear_algebra.finite_dimensional
noncomputable theory
open_locale big_operators
open_locale classical
/-!
# Finit... |
bda55bf96ad46d74c0b3d671b415f038a4a2b913 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/analysis/normed_space/is_R_or_C.lean | 8bb5398339dde1753ced80eb2f14b1ad50a51248 | [
"Apache-2.0"
] | permissive | AntoineChambert-Loir/mathlib | 64aabb896129885f12296a799818061bc90da1ff | 07be904260ab6e36a5769680b6012f03a4727134 | refs/heads/master | 1,693,187,631,771 | 1,636,719,886,000 | 1,636,719,886,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,294 | lean | /-
Copyright (c) 2021 Kalle Kytölä. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kalle Kytölä
-/
import analysis.normed_space.operator_norm
import analysis.complex.basic
/-!
# Normed spaces over R or C
This file is about results on normed spaces over the fields `ℝ`... |
aefeaf51a32deb8b63ae3b0432e0cd12ea87e51d | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/order/galois_connection.lean | 9f179810090f82fbd82da264ca5e58c2880b0185 | [
"Apache-2.0"
] | permissive | robertylewis/mathlib | 3d16e3e6daf5ddde182473e03a1b601d2810952c | 1d13f5b932f5e40a8308e3840f96fc882fae01f0 | refs/heads/master | 1,651,379,945,369 | 1,644,276,960,000 | 1,644,276,960,000 | 98,875,504 | 0 | 0 | Apache-2.0 | 1,644,253,514,000 | 1,501,495,700,000 | Lean | UTF-8 | Lean | false | false | 30,292 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
-/
import order.complete_lattice
import order.order_dual
/-!
# Galois connections, insertions and coinsertions
Galois connections are order theoretic adjoints, i.e. a p... |
50a6a41e2e0c6074de28c35312a191cfcc1d3f3c | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/category_theory/limits/shapes/finite_limits.lean | 6519a88c978ff052eee062529fa92ba3acc554bf | [
"Apache-2.0"
] | permissive | agjftucker/mathlib | d634cd0d5256b6325e3c55bb7fb2403548371707 | 87fe50de17b00af533f72a102d0adefe4a2285e8 | refs/heads/master | 1,625,378,131,941 | 1,599,166,526,000 | 1,599,166,526,000 | 160,748,509 | 0 | 0 | Apache-2.0 | 1,544,141,789,000 | 1,544,141,789,000 | null | UTF-8 | Lean | false | false | 7,361 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import data.fintype.basic
import category_theory.limits.shapes.products
import category_theory.limits.shapes.equalizers
import category_theory.limits.shapes.pullbacks... |
2b60bdc3ebdc30acdaac38bb1e8e4317130604fe | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/tactic/tauto.lean | 29f6139de87508de9b112dcb4b9fbfda8464b8de | [
"Apache-2.0"
] | permissive | vaibhavkarve/mathlib | a574aaf68c0a431a47fa82ce0637f0f769826bfe | 17f8340912468f49bdc30acdb9a9fa02eeb0473a | refs/heads/master | 1,621,263,802,637 | 1,585,399,588,000 | 1,585,399,588,000 | 250,833,447 | 0 | 0 | Apache-2.0 | 1,585,410,341,000 | 1,585,410,341,000 | null | UTF-8 | Lean | false | false | 9,793 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
-/
import logic.basic tactic.solve_by_elim tactic.hint
namespace tactic
open expr
open tactic.interactive ( casesm constructor_matching )
/--
find all assumptions of the ... |
5455fdbbb94496b6900fe7d9b7ff84c314aa32d5 | 36c7a18fd72e5b57229bd8ba36493daf536a19ce | /library/theories/number_theory/bezout.lean | dd7cf7385e4ecd1c9eb1aafda194991d3a013b05 | [
"Apache-2.0"
] | permissive | YHVHvx/lean | 732bf0fb7a298cd7fe0f15d82f8e248c11db49e9 | 038369533e0136dd395dc252084d3c1853accbf2 | refs/heads/master | 1,610,701,080,210 | 1,449,128,595,000 | 1,449,128,595,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,988 | lean | /-
Copyright (c) 2015 William Peterson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: William Peterson, Jeremy Avigad
Extended gcd, Bezout's theorem, chinese remainder theorem.
-/
import data.nat.div data.int .primes
/- Bezout's theorem -/
section Bezout
open nat ... |
452fc68b2ed22d4863981846b99f4e5a507100c2 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/simp1.lean | 29372b2590112d18562ed0ba15193bdf91f13493 | [
"Apache-2.0"
] | permissive | leanprover-community/lean | 12b87f69d92e614daea8bcc9d4de9a9ace089d0e | cce7990ea86a78bdb383e38ed7f9b5ba93c60ce0 | refs/heads/master | 1,687,508,156,644 | 1,684,951,104,000 | 1,684,951,104,000 | 169,960,991 | 457 | 107 | Apache-2.0 | 1,686,744,372,000 | 1,549,790,268,000 | C++ | UTF-8 | Lean | false | false | 255 | lean | constants (A : Type.{1}) (f : A → A → A) (x y z : A) (g : A → A)
attribute [simp]
lemma foo : f x y = y := sorry
attribute [simp]
lemma bar : g y = z := sorry
open tactic
example : g (f x y) = z := by simp
example : g (f x (f x y)) = z := by simp
|
1c70f5c848188daf7ed568a918a7f1c918ee77ae | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/algebra/ordered_monoid_lemmas.lean | 876cc74b5aa0a7aa1859dbc5e8335946fe54d94f | [
"Apache-2.0"
] | permissive | abentkamp/mathlib | d9a75d291ec09f4637b0f30cc3880ffb07549ee5 | 5360e476391508e092b5a1e5210bd0ed22dc0755 | refs/heads/master | 1,682,382,954,948 | 1,622,106,077,000 | 1,622,106,077,000 | 149,285,665 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 20,638 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Mario Carneiro, Johannes Hölzl, Damiano Testa
-/
import algebra.group.defs
import order.basic
/-!
This file begins the splitting of the ordering assump... |
d73f45cb2ca8d5899114a8630ad4fe321ab99362 | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/coercion2.lean | 634b019cb379125ce78f02acbc751ff2b43f4a30 | [
"Apache-2.0"
] | permissive | codyroux/lean0.1 | 1ce92751d664aacff0529e139083304a7bbc8a71 | 0dc6fb974aa85ed6f305a2f4b10a53a44ee5f0ef | refs/heads/master | 1,610,830,535,062 | 1,402,150,480,000 | 1,402,150,480,000 | 19,588,851 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 626 | lean | variable T : Type
variable R : Type
variable t2r : T -> R
coercion t2r
variable g : R -> R -> R
variable a : T
print g a a
variable b : R
print g a b
print g b a
set_option lean::pp::coercion true
print g a a
print g a b
print g b a
set_option lean::pp::coercion false
variable S : Type
variable s : S
variable r : S
var... |
b16ecf9381a3c5e275e095807365bbb5d3ea3e30 | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/data/semiquot.lean | b5666916f7657e4cd0db6872a80c4a81641b815c | [
"Apache-2.0"
] | permissive | rmitta/mathlib | 8d90aee30b4db2b013e01f62c33f297d7e64a43d | 883d974b608845bad30ae19e27e33c285200bf84 | refs/heads/master | 1,585,776,832,544 | 1,576,874,096,000 | 1,576,874,096,000 | 153,663,165 | 0 | 2 | Apache-2.0 | 1,544,806,490,000 | 1,539,884,365,000 | Lean | UTF-8 | Lean | false | false | 6,943 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
A data type for semiquotients, which are classically equivalent to
nonempty sets, but are useful for programming; the idea is that
a semiquotient set `S` represents som... |
e161ad3ac5aede1fe6b5c33830dff63f0d7d46f4 | 5e3548e65f2c037cb94cd5524c90c623fbd6d46a | /src_icannos_totilas/topologie-espaces-normés/cpge_ten_06.lean | 680e89cd0ca14df61edefa5a0f38a36d74a1a37f | [] | no_license | ahayat16/lean_exos | d4f08c30adb601a06511a71b5ffb4d22d12ef77f | 682f2552d5b04a8c8eb9e4ab15f875a91b03845c | refs/heads/main | 1,693,101,073,585 | 1,636,479,336,000 | 1,636,479,336,000 | 415,000,441 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 985 | lean | import data.set.basic
import topology.basic
import algebra.module.basic
import algebra.module.submodule
import order.complete_lattice
import analysis.normed_space.basic
-- Soient A, B deux parties non vides d'un espace vectoriel normé E telles que
-- d(A, B) = inf_xy d(x, y) > 0
-- Montrer qu'il existe deux ouvert... |
3c319ee17ff2c42a4c6dd37169636e5f5cf7688c | 200b12985a863d01fbbde6abfc9326bb82424a8b | /src/propLogic/Ex006.lean | 0f23034a3da5d0a40f440383121b12c860af5a79 | [] | no_license | SvenWille/LeanLogicExercises | 38eacd36733ac48e5a7aacf863c681c9a9a48271 | 2dbc920feadd63bbc50f87e69646c0081db26eba | refs/heads/master | 1,629,676,667,365 | 1,512,161,459,000 | 1,512,161,459,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 533 | lean |
theorem Ex006(a b c : Prop): a ∨ b → a ∨ c → a ∨ (b ∧ c) :=
assume H1:a ∨ b,
assume H2:a ∨ c,
show a ∨ (b ∧ c), from or.elim H1
(
assume H :a,
show a ∨ (b ∧ c), from or.inl H
)
(
assume H: b,
show a ∨ (b ∧ c), from or.elim H2
(
assume HH:a,
show a ... |
5c9c000568338f7cbaa3de7420522ed0f6d61238 | 82b86ba2ae0d5aed0f01f49c46db5afec0eb2bd7 | /tests/lean/run/macro2.lean | 2d22f99498805174cfde054bb5e3d7449802205e | [
"Apache-2.0"
] | permissive | banksonian/lean4 | 3a2e6b0f1eb63aa56ff95b8d07b2f851072d54dc | 78da6b3aa2840693eea354a41e89fc5b212a5011 | refs/heads/master | 1,673,703,624,165 | 1,605,123,551,000 | 1,605,123,551,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 340 | lean | notation:50 a "**" b:50 => b * a * b
notation "~" a => a+a
namespace Foo
notation "~~" a => a+a
end Foo
syntax:60 term "+++" term:59 : term
syntax "<|" term "|>" : term
macro_rules
| `($a +++ $b) => `($a + $b + $b)
macro_rules
| `(<| $x |>) => `($x +++ 1 ** 2)
#check <| 2 |>
#check <| ~2 |>
#check <| ~~2 |>
#... |
ac39c217d84a1306350edacf9e77768d764f194b | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/MonadEnv.lean | 6e3b4011e642f42b6e0920820f98dc904c9679e5 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 6,393 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Environment
import Lean.Exception
import Lean.Declaration
import Lean.Log
import Lean.AuxRecursor
import Lean.Compiler.Old
namespace Lean
def ... |
ac96e66c896beac3d281e601ee57c7cf98e0c57c | 4727251e0cd73359b15b664c3170e5d754078599 | /src/group_theory/group_action/prod.lean | dc845b81552d2e9cea3c7b0684b24490e472575a | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 4,482 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon, Patrick Massot, Eric Wieser
-/
import algebra.group.prod
import group_theory.group_action.defs
/-!
# Prod instances for additive and multiplicative actions
This file define... |
52536e8b280a73ec64a449fd68c5b4e57cc35936 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/data/pnat/intervals.lean | ee8b1488dbf75cd8e0465ad6c60f45e350a9657d | [
"Apache-2.0"
] | permissive | jjgarzella/mathlib | 96a345378c4e0bf26cf604aed84f90329e4896a2 | 395d8716c3ad03747059d482090e2bb97db612c8 | refs/heads/master | 1,686,480,124,379 | 1,625,163,323,000 | 1,625,163,323,000 | 281,190,421 | 2 | 0 | Apache-2.0 | 1,595,268,170,000 | 1,595,268,169,000 | null | UTF-8 | Lean | false | false | 815 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import data.pnat.basic
import data.finset.intervals
namespace pnat
/-- `Ico l u` is the set of positive natural numbers `l ≤ k < u`. -/
def Ico (l u : ℕ+) : finset ... |
d6b54452f095c32e89012c2af561b7bfba8b31e2 | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /stage0/src/Init/Meta.lean | 827504d16c584d88539310e149c8a6ab91796371 | [
"Apache-2.0"
] | permissive | WojciechKarpiel/lean4 | 7f89706b8e3c1f942b83a2c91a3a00b05da0e65b | f6e1314fa08293dea66a329e05b6c196a0189163 | refs/heads/master | 1,686,633,402,214 | 1,625,821,189,000 | 1,625,821,258,000 | 384,640,886 | 0 | 0 | Apache-2.0 | 1,625,903,617,000 | 1,625,903,026,000 | null | UTF-8 | Lean | false | false | 31,992 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura and Sebastian Ullrich
Additional goodies for writing macros
-/
prelude
import Init.Data.Array.Basic
namespace Lean
@[extern c inline "lean_box(LEAN_VERSION_... |
41a62bae4f6ee768eb618e2d19b547b7d23721e0 | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/deprecated/subfield.lean | 8f7c3cd5207f9fb5471749c184c30d4bd875524d | [
"Apache-2.0"
] | permissive | ilitzroth/mathlib | ea647e67f1fdfd19a0f7bdc5504e8acec6180011 | 5254ef14e3465f6504306132fe3ba9cec9ffff16 | refs/heads/master | 1,680,086,661,182 | 1,617,715,647,000 | 1,617,715,647,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,470 | lean | /-
Copyright (c) 2018 Andreas Swerdlow. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Andreas Swerdlow
-/
import deprecated.subring
import algebra.group_with_zero.power
variables {F : Type*} [field F] (S : set F)
class is_subfield extends is_subring S : Prop :=
(inv... |
7a0eb3ed5487736f092f7fa7c699a689d99997c2 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/topology/covering.lean | 58f758a2ee4edd9811f162b82920a100092357a5 | [
"Apache-2.0"
] | permissive | kbuzzard/mathlib | 2ff9e85dfe2a46f4b291927f983afec17e946eb8 | 58537299e922f9c77df76cb613910914a479c1f7 | refs/heads/master | 1,685,313,702,744 | 1,683,974,212,000 | 1,683,974,212,000 | 128,185,277 | 1 | 0 | null | 1,522,920,600,000 | 1,522,920,600,000 | null | UTF-8 | Lean | false | false | 7,175 | lean | /-
Copyright (c) 2022 Thomas Browning. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Thomas Browning
-/
import topology.is_locally_homeomorph
import topology.fiber_bundle.basic
/-!
# Covering Maps
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file... |
d53e00c848b70e89d8b375a9ab20f6e9b2237ca1 | 2bafba05c98c1107866b39609d15e849a4ca2bb8 | /src/week_8/Part_B_H0.lean | a6638a05bffcd247188145ca253cd8d0e4f7dd94 | [
"Apache-2.0"
] | permissive | ImperialCollegeLondon/formalising-mathematics | b54c83c94b5c315024ff09997fcd6b303892a749 | 7cf1d51c27e2038d2804561d63c74711924044a1 | refs/heads/master | 1,651,267,046,302 | 1,638,888,459,000 | 1,638,888,459,000 | 331,592,375 | 284 | 24 | Apache-2.0 | 1,669,593,705,000 | 1,611,224,849,000 | Lean | UTF-8 | Lean | false | false | 9,700 | lean | import week_8.Part_A_G_modules
/-
# Making the API for H⁰(G,M)
If G is a group and M is a G-module then H⁰(G,M), or `H0 G M`, is the abelian
group of G-invariant elements of `M`. We make the definition so we have
to make the interface too. We show that `H0 G M` is an abelian group,
define a coercion to `M` sending `... |
d726ea6cd8f75dbcad7de31774092a97687229de | c777c32c8e484e195053731103c5e52af26a25d1 | /src/data/pi/interval.lean | c77e21f3ce2bd3f172af61b33df583940db44388 | [
"Apache-2.0"
] | permissive | kbuzzard/mathlib | 2ff9e85dfe2a46f4b291927f983afec17e946eb8 | 58537299e922f9c77df76cb613910914a479c1f7 | refs/heads/master | 1,685,313,702,744 | 1,683,974,212,000 | 1,683,974,212,000 | 128,185,277 | 1 | 0 | null | 1,522,920,600,000 | 1,522,920,600,000 | null | UTF-8 | Lean | false | false | 2,629 | lean | /-
Copyright (c) 2021 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies
-/
import data.finset.locally_finite
import data.fintype.big_operators
/-!
# Intervals in a pi type
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file r... |
76c31b58c39f224dfc3326fc67b015dc61226c4a | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/data/fintype/basic.lean | 00a4340293b348238e471a738e1f5efe0f198ee5 | [
"Apache-2.0"
] | permissive | troyjlee/mathlib | e18d4b8026e32062ab9e89bc3b003a5d1cfec3f5 | 45e7eb8447555247246e3fe91c87066506c14875 | refs/heads/master | 1,689,248,035,046 | 1,629,470,528,000 | 1,629,470,528,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 75,683 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.array.lemmas
import data.finset.pi
import data.finset.powerset
import data.sym.basic
import group_theory.perm.basic
import order.well_founded
import tacti... |
b26c87d7c15556bebe8acc7283c4b63d6e7f4288 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/algebra/direct_limit.lean | 517d53ba56463622d61c2fdd90c0286d24f659fa | [
"Apache-2.0"
] | permissive | Lix0120/mathlib | 0020745240315ed0e517cbf32e738d8f9811dd80 | e14c37827456fc6707f31b4d1d16f1f3a3205e91 | refs/heads/master | 1,673,102,855,024 | 1,604,151,044,000 | 1,604,151,044,000 | 308,930,245 | 0 | 0 | Apache-2.0 | 1,604,164,710,000 | 1,604,163,547,000 | null | UTF-8 | Lean | false | false | 27,980 | lean | /-
Copyright (c) 2019 Kenny Lau, Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Chris Hughes
-/
import data.finset.order
import linear_algebra.direct_sum_module
import ring_theory.free_comm_ring
import ring_theory.ideal.operations
/-!
# Direct ... |
8f798d16cd04403ca9ca28bb4c7c711c8609a742 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/computability/primrec_auto.lean | 3b0ca666c20e7f443c556679fe22a753056414aa | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 39,886 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.equiv.list
import Mathlib.logic.function.iterate
import Mathlib.PostPort
universes u_1... |
976fc006e88405f9c4a3b76d1040bd80a4a0c3a7 | 6b10c15e653d49d146378acda9f3692e9b5b1950 | /examples/logic/unnamed_101.lean | ae6342fe63e1e76f094ed4fa592220aa661f6489 | [] | no_license | gebner/mathematics_in_lean | 3cf7f18767208ea6c3307ec3a67c7ac266d8514d | 6d1462bba46d66a9b948fc1aef2714fd265cde0b | refs/heads/master | 1,655,301,945,565 | 1,588,697,505,000 | 1,588,697,505,000 | 261,523,603 | 0 | 0 | null | 1,588,695,611,000 | 1,588,695,610,000 | null | UTF-8 | Lean | false | false | 121 | lean | variable A : Prop
-- BEGIN
example : A → A :=
by { intro h, apply h }
example : A → A :=
by intro h; apply h
-- END |
600b1dda08fe9948d1bcc667e3bc78f8b98a183f | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /tests/playground/matchEqs.lean | a96ddc14d4e141bff94c195750c9d56df2c2a470 | [
"Apache-2.0"
] | permissive | WojciechKarpiel/lean4 | 7f89706b8e3c1f942b83a2c91a3a00b05da0e65b | f6e1314fa08293dea66a329e05b6c196a0189163 | refs/heads/master | 1,686,633,402,214 | 1,625,821,189,000 | 1,625,821,258,000 | 384,640,886 | 0 | 0 | Apache-2.0 | 1,625,903,617,000 | 1,625,903,026,000 | null | UTF-8 | Lean | false | false | 5,447 | lean | import Lean
namespace Lean.Meta.Match
private def isMatchValue (e : Expr) : Bool :=
e.isNatLit || e.isCharLit || e.isStringLit
partial def mkEquationsFor (matchDeclName : Name) : MetaM Unit := do
let constInfo ← getConstInfo matchDeclName
let us := constInfo.levelParams.map mkLevelParam
let some matchInfo ←... |
4711f7eb211e1418e6e504543663a68d245a72e5 | 205f0fc16279a69ea36e9fd158e3a97b06834ce2 | /EXAMS/exam1_key.lean | d868d0c4a048faf8d6815f2c53262803baffb449 | [] | no_license | kevinsullivan/cs-dm-lean | b21d3ca1a9b2a0751ba13fcb4e7b258010a5d124 | a06a94e98be77170ca1df486c8189338b16cf6c6 | refs/heads/master | 1,585,948,743,595 | 1,544,339,346,000 | 1,544,339,346,000 | 155,570,767 | 1 | 3 | null | 1,541,540,372,000 | 1,540,995,993,000 | Lean | UTF-8 | Lean | false | false | 9,808 | lean |
/-
POINTS: Welcome to the first CS2102 exam. The exam has 11 questions
and one extra credit question. The first two questions are worth 5
points each. The rest (but for the extra credit) are worth 10 points
each, making a total of 100. The extra credit is worth an addition
5 points.
ORGANIZATION: The sections... |
a32744634216cd4ff7d39a2949707bedead522a8 | f1b175e38ffc5cc1c7c5551a72d0dbaf70786f83 | /data/real/basic.lean | 0e54d4eae0f92de267dac71f2fcc51fb1451f6f0 | [
"Apache-2.0"
] | permissive | mjendrusch/mathlib | df3ae884dd5ce38c7edf452bcbfd3baf4e3a6214 | 5c209edb7eb616a26f64efe3500f2b1ba95b8d55 | refs/heads/master | 1,585,663,284,800 | 1,539,062,055,000 | 1,539,062,055,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 27,068 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
The (classical) real numbers ℝ. This is a direct construction
from Cauchy sequences.
-/
import order.conditionally_complete_lattice data.real.cau_seq_completion
algeb... |
60366dc253919307228138f3d98ae775e16bb34b | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/algebra/invertible.lean | 20be5f67ab14bc0cb9968755c813be25290a4e6d | [
"Apache-2.0"
] | permissive | agjftucker/mathlib | d634cd0d5256b6325e3c55bb7fb2403548371707 | 87fe50de17b00af533f72a102d0adefe4a2285e8 | refs/heads/master | 1,625,378,131,941 | 1,599,166,526,000 | 1,599,166,526,000 | 160,748,509 | 0 | 0 | Apache-2.0 | 1,544,141,789,000 | 1,544,141,789,000 | null | UTF-8 | Lean | false | false | 8,295 | lean | /-
Copyright (c) 2020 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Anne Baanen
A typeclass for the two-sided multiplicative inverse.
-/
import algebra.char_zero
import algebra.char_p
/-!
# Invertible elements
This file defines a typeclass `invertible ... |
99d8db2efd49c8d50ed6ed33d4d2dc0f4c444fbc | 690889011852559ee5ac4dfea77092de8c832e7e | /src/ring_theory/algebra.lean | 87a8cafdac33d8eb25c42082db9f372d09dc2032 | [
"Apache-2.0"
] | permissive | williamdemeo/mathlib | f6df180148f8acc91de9ba5e558976ab40a872c7 | 1fa03c29f9f273203bbffb79d10d31f696b3d317 | refs/heads/master | 1,584,785,260,929 | 1,572,195,914,000 | 1,572,195,913,000 | 138,435,193 | 0 | 0 | Apache-2.0 | 1,529,789,739,000 | 1,529,789,739,000 | null | UTF-8 | Lean | false | false | 19,349 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
Algebra over Commutative Ring (under category)
-/
import data.polynomial data.mv_polynomial
import data.complex.basic
import linear_algebra.tensor_product
import ring_theory.sub... |
494387b752cd0ce343af520a8043de5d208e89d5 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/tactic/ring2.lean | 044ea34dd20a9b75dfcd6ab5e2d7ac22dca55a3e | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 21,003 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import tactic.ring
import data.num.lemmas
import data.tree
/-!
# ring2
An experimental variant on the `ring` tactic that uses computational
reflection instead of pr... |
3cb2866db4e986761fae9c0b59cfbf25402ce7c8 | bb31430994044506fa42fd667e2d556327e18dfe | /src/data/list/nodup.lean | fc3b413305d01d8131b6d2915692c6fce9658604 | [
"Apache-2.0"
] | permissive | sgouezel/mathlib | 0cb4e5335a2ba189fa7af96d83a377f83270e503 | 00638177efd1b2534fc5269363ebf42a7871df9a | refs/heads/master | 1,674,527,483,042 | 1,673,665,568,000 | 1,673,665,568,000 | 119,598,202 | 0 | 0 | null | 1,517,348,647,000 | 1,517,348,646,000 | null | UTF-8 | Lean | false | false | 14,509 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Kenny Lau
-/
import data.list.lattice
import data.list.pairwise
import data.list.forall2
import data.set.pairwise
/-!
# Lists with no duplicates
> THIS FILE IS SYNCHR... |
f1a884eff883def5e5cdfd9f6cdcbf6fb09093dc | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /src/Init/Lean/Meta/Tactic/Apply.lean | ffbc3d22d3aaffafbf36d5a6d88e5e755ffa51b5 | [
"Apache-2.0"
] | permissive | mhuisi/lean4 | 28d35a4febc2e251c7f05492e13f3b05d6f9b7af | dda44bc47f3e5d024508060dac2bcb59fd12e4c0 | refs/heads/master | 1,621,225,489,283 | 1,585,142,689,000 | 1,585,142,689,000 | 250,590,438 | 0 | 2 | Apache-2.0 | 1,602,443,220,000 | 1,585,327,814,000 | C | UTF-8 | Lean | false | false | 3,884 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import Init.Lean.Util.FindMVar
import Init.Lean.Meta.Message
import Init.Lean.Meta.ExprDefEq
import Init.Lean.Meta.SynthInstance
import Init.Lean.Me... |
95b73dcdc4a5ab8f918fb8009ff7ec30d6047819 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/number_theory/bernoulli.lean | 200b340cf7b648b16e8709f8bbb9dd50fd8e87e1 | [
"Apache-2.0"
] | permissive | robertylewis/mathlib | 3d16e3e6daf5ddde182473e03a1b601d2810952c | 1d13f5b932f5e40a8308e3840f96fc882fae01f0 | refs/heads/master | 1,651,379,945,369 | 1,644,276,960,000 | 1,644,276,960,000 | 98,875,504 | 0 | 0 | Apache-2.0 | 1,644,253,514,000 | 1,501,495,700,000 | Lean | UTF-8 | Lean | false | false | 17,005 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Kevin Buzzard
-/
import algebra.big_operators.nat_antidiagonal
import algebra.geom_sum
import data.fintype.card
import ring_theory.power_series.well_known
import tactic... |
9bc7a6d5e0cec2e2bd0ee5a3aece0d761d8d9cd6 | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /11_Tactic-Style_Proofs.org.49.lean | 678b46f99f4dac616001f3f9154314f3d68cbe3a | [] | no_license | cjmazey/lean-tutorial | ba559a49f82aa6c5848b9bf17b7389bf7f4ba645 | 381f61c9fcac56d01d959ae0fa6e376f2c4e3b34 | refs/heads/master | 1,610,286,098,832 | 1,447,124,923,000 | 1,447,124,923,000 | 43,082,433 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 238 | lean | import standard
open sigma nat
example (x y : nat) (H : (fun (a : nat), pr1 ⟨a, y⟩) x = 0) : x = 0 :=
begin
esimp at H,
exact H
end
example (x y : nat) (H : x = 0) : (fun (a : nat), pr1 ⟨a, y⟩) x = 0 :=
begin
esimp,
exact H
end
|
25b5cb8cd95c0ec7fffa095862236c928ce5497b | 01ae0d022f2e2fefdaaa898938c1ac1fbce3b3ab | /categories/currying/currying_1.lean | 931e91bc8319670187ba4121e6b1c575d9697e56 | [] | no_license | PatrickMassot/lean-category-theory | 0f56a83464396a253c28a42dece16c93baf8ad74 | ef239978e91f2e1c3b8e88b6e9c64c155dc56c99 | refs/heads/master | 1,629,739,187,316 | 1,512,422,659,000 | 1,512,422,659,000 | 113,098,786 | 0 | 0 | null | 1,512,424,022,000 | 1,512,424,022,000 | null | UTF-8 | Lean | false | false | 2,093 | lean | -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Scott Morrison
import ..natural_transformation
import ..equivalence
import ..products.bifunctors
open categories
open categories.isomorphism
open categories.functor
open catego... |
608f74b21ead039ee17698c6708f7eb4fcc624e2 | cf39355caa609c0f33405126beee2739aa3cb77e | /library/init/meta/tactic.lean | 2a8abaed3e81020db9f651f0dfa2a46be6214795 | [
"Apache-2.0"
] | permissive | leanprover-community/lean | 12b87f69d92e614daea8bcc9d4de9a9ace089d0e | cce7990ea86a78bdb383e38ed7f9b5ba93c60ce0 | refs/heads/master | 1,687,508,156,644 | 1,684,951,104,000 | 1,684,951,104,000 | 169,960,991 | 457 | 107 | Apache-2.0 | 1,686,744,372,000 | 1,549,790,268,000 | C++ | UTF-8 | Lean | false | false | 76,457 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.function init.data.option.basic init.util
import init.control.combinators init.control.monad init.control.alternative init.control.monad... |
34e8915446d6526b9b092c9ee09414635db643d4 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/group_theory/is_free_group.lean | 8a86d700a2247bd92ed93164da33a27346e72de7 | [
"Apache-2.0"
] | permissive | jjgarzella/mathlib | 96a345378c4e0bf26cf604aed84f90329e4896a2 | 395d8716c3ad03747059d482090e2bb97db612c8 | refs/heads/master | 1,686,480,124,379 | 1,625,163,323,000 | 1,625,163,323,000 | 281,190,421 | 2 | 0 | Apache-2.0 | 1,595,268,170,000 | 1,595,268,169,000 | null | UTF-8 | Lean | false | false | 5,830 | lean | /-
Copyright (c) 2021 David Wärn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Wärn, Eric Wieser
-/
import group_theory.free_group
/-!
# Free groups structures on arbitrary types
This file defines the universal property of free groups, and proves some things a... |
c4c7ee3041a98f1a1cd7886662f24b78dc1cac03 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /stage0/src/Lean/Meta/Coe.lean | 82131807a6e8cb6ca1b1a60b728c24aef332b347 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | cipher1024/lean4 | 6e1f98bb58e7a92b28f5364eb38a14c8d0aae393 | 69114d3b50806264ef35b57394391c3e738a9822 | refs/heads/master | 1,642,227,983,603 | 1,642,011,696,000 | 1,642,011,696,000 | 228,607,691 | 0 | 0 | Apache-2.0 | 1,576,584,269,000 | 1,576,584,268,000 | null | UTF-8 | Lean | false | false | 1,459 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Meta.WHNF
import Lean.Meta.Transform
namespace Lean.Meta
/--
Return true iff `declName` is one of the auxiliary definitions/projections
us... |
2872163a37ca70e75203b4dfde746901c8a55d44 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/analysis/convex/strict.lean | bd63c97e0952d550c08659f56b18b9081afbc6c4 | [
"Apache-2.0"
] | permissive | jcommelin/mathlib | d8456447c36c176e14d96d9e76f39841f69d2d9b | ee8279351a2e434c2852345c51b728d22af5a156 | refs/heads/master | 1,664,782,136,488 | 1,663,638,983,000 | 1,663,638,983,000 | 132,563,656 | 0 | 0 | Apache-2.0 | 1,663,599,929,000 | 1,525,760,539,000 | Lean | UTF-8 | Lean | false | false | 16,017 | lean | /-
Copyright (c) 2021 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies
-/
import analysis.convex.basic
import topology.algebra.order.basic
/-!
# Strictly convex sets
This file defines strictly convex sets.
A set is strictly convex if the ope... |
ceccf90c18cfaccb9da1bbc3eee6ca6d1a2465a6 | 07c76fbd96ea1786cc6392fa834be62643cea420 | /hott/algebra/category/constructions/set.hlean | d3a5d501d5be308c5232ca9e05e046551dbc2cf5 | [
"Apache-2.0"
] | permissive | fpvandoorn/lean2 | 5a430a153b570bf70dc8526d06f18fc000a60ad9 | 0889cf65b7b3cebfb8831b8731d89c2453dd1e9f | refs/heads/master | 1,592,036,508,364 | 1,545,093,958,000 | 1,545,093,958,000 | 75,436,854 | 0 | 0 | null | 1,480,718,780,000 | 1,480,718,780,000 | null | UTF-8 | Lean | false | false | 3,493 | hlean | /-
Copyright (c) 2015 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Jakob von Raumer
Category of sets
-/
import ..functor.basic ..category types.equiv types.lift
open eq category equiv iso is_equiv is_trunc function sigma
namesp... |
446014fdd56f4c73197d2447db64f6759dda662b | c777c32c8e484e195053731103c5e52af26a25d1 | /src/analysis/calculus/fderiv/basic.lean | de89c70222e5294e8ef013fe08838f054c652308 | [
"Apache-2.0"
] | permissive | kbuzzard/mathlib | 2ff9e85dfe2a46f4b291927f983afec17e946eb8 | 58537299e922f9c77df76cb613910914a479c1f7 | refs/heads/master | 1,685,313,702,744 | 1,683,974,212,000 | 1,683,974,212,000 | 128,185,277 | 1 | 0 | null | 1,522,920,600,000 | 1,522,920,600,000 | null | UTF-8 | Lean | false | false | 146,067 | lean | /-
Copyright (c) 2019 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Sébastien Gouëzel, Yury Kudryashov
-/
import analysis.asymptotics.asymptotic_equivalent
import analysis.calculus.tangent_cone
import analysis.normed_space.bounded_linear_... |
50755b59f700b09fa80a1538b533bb48d48258ee | ec5a7ae10c533e1b1f4b0bc7713e91ecf829a3eb | /ijcar16/examples/example2.lean | 8dda0b456c8445d60272ff953bf6cc3bd7ec9ce0 | [
"MIT"
] | permissive | leanprover/leanprover.github.io | cf248934af7c7e9aeff17cf8df3c12c5e7e73f1a | 071a20d2e059a2c3733e004c681d3949cac3c07a | refs/heads/master | 1,692,621,047,417 | 1,691,396,994,000 | 1,691,396,994,000 | 19,366,263 | 18 | 27 | MIT | 1,693,989,071,000 | 1,399,006,345,000 | Lean | UTF-8 | Lean | false | false | 4,289 | lean | import data.real
open real
namespace example2
/- Assume we have an exp (exponential) function, and state basic properties using axioms. -/
constant exp : ℝ → ℝ
/- The annotation (: t :) is used to indicate that `t` is a pattern for the E-matching procedure. -/
axiom exp_add : ∀ x y : ℝ, (: exp (x + y) :) = exp x * ex... |
9b71daaf67f44a3532eab0884940658a7e6d1559 | 7bf54883c04ff2856c37f76a79599ceb380c1996 | /mathlib/quartic_solution.lean | 5da2b5716b44a4e819265f7eab16bbc6356c4652 | [] | no_license | anonymousLeanDocsHosting/lean-polynomials | 4094466bf19acc0d1a47b4cabb60d8c21ddb2b00 | 361ef4cb7b68ef47d43b85cfa2d13f2ea0a47613 | refs/heads/main | 1,691,112,899,935 | 1,631,819,522,000 | 1,631,819,522,000 | 405,448,439 | 0 | 2 | null | null | null | null | UTF-8 | Lean | false | false | 14,514 | lean | import algebra.invertible
import tactic.linarith
import order.filter.at_top_bot
import algebra.cubic_solution
section field
variables {F : Type*}
def quartic_expression [field F] (x a b c d e : F) : F :=
((x * x * x * x * a) + (x * x * x * b) + (x * x * c) + (x * d) + e)
def depressed_quartic_squ_coefficient [fiel... |
af9b14fc896a3f191a65bef6d7a9cc1b825fa751 | 367134ba5a65885e863bdc4507601606690974c1 | /src/analysis/normed_space/units.lean | f0083bfb740051fab555757a243d2a5c71cb849c | [
"Apache-2.0"
] | permissive | kodyvajjha/mathlib | 9bead00e90f68269a313f45f5561766cfd8d5cad | b98af5dd79e13a38d84438b850a2e8858ec21284 | refs/heads/master | 1,624,350,366,310 | 1,615,563,062,000 | 1,615,563,062,000 | 162,666,963 | 0 | 0 | Apache-2.0 | 1,545,367,651,000 | 1,545,367,651,000 | null | UTF-8 | Lean | false | false | 11,057 | lean | /-
Copyright (c) 2020 Heather Macbeth. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Heather Macbeth
-/
import analysis.specific_limits
import analysis.asymptotics.asymptotics
/-!
# The group of units of a complete normed ring
This file contains the basic theory for... |
e86714ba4d47583e0182b1f7a6c08a6545b00475 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/measure_theory/decomposition/jordan.lean | 85d3be72c102744a86dcdadfb1ecb7d13a638f73 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 25,274 | lean | /-
Copyright (c) 2021 Kexing Ying. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kexing Ying
-/
import measure_theory.decomposition.signed_hahn
import measure_theory.measure.mutually_singular
/-!
# Jordan decomposition
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> An... |
b1c549ffbe128976ded5b5d139e7db2820b2be41 | 35b83be3126daae10419b573c55e1fed009d3ae8 | /_target/deps/mathlib/data/nat/sqrt.lean | 9ccc838b7b611aecab5423ac17725cc6e947c256 | [] | no_license | AHassan1024/Lean_Playground | ccb25b72029d199c0d23d002db2d32a9f2689ebc | a00b004c3a2eb9e3e863c361aa2b115260472414 | refs/heads/master | 1,586,221,905,125 | 1,544,951,310,000 | 1,544,951,310,000 | 157,934,290 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,802 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Johannes Hölzl, Mario Carneiro
An efficient binary implementation of a (sqrt n) function that
returns s s.t.
s*s ≤ n ≤ s*s + s + s
-/
import data.nat.bas... |
dd466e26c6295e40c1e05f95551ea1e1b657db96 | 7b02c598aa57070b4cf4fbfe2416d0479220187f | /archive/smash_old.hlean | fff8b186ca2413845c7954b2f6069114c2aa56df | [
"Apache-2.0"
] | permissive | jdchristensen/Spectral | 50d4f0ddaea1484d215ef74be951da6549de221d | 6ded2b94d7ae07c4098d96a68f80a9cd3d433eb8 | refs/heads/master | 1,611,555,010,649 | 1,496,724,191,000 | 1,496,724,191,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,339 | hlean | /- below are some old tries to compute (A ∧ S¹) directly -/
exit
/- smash A S¹ = red_susp A -/
definition red_susp_of_smash_pcircle [unfold 2] (x : smash A S¹*) : red_susp A :=
begin
induction x using smash.elim,
{ induction b, exact base, exact equator a },
{ exact base },
{ exact base },
... |
f8c55ef2e0b52f1739e75a6b5b3a808d4e9df70b | 36c7a18fd72e5b57229bd8ba36493daf536a19ce | /hott/algebra/ordered_ring.hlean | 7bbd266e9f2d408f8e20cb1249c884ce90b82eef | [
"Apache-2.0"
] | permissive | YHVHvx/lean | 732bf0fb7a298cd7fe0f15d82f8e248c11db49e9 | 038369533e0136dd395dc252084d3c1853accbf2 | refs/heads/master | 1,610,701,080,210 | 1,449,128,595,000 | 1,449,128,595,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 22,088 | hlean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
Here an "ordered_ring" is partially ordered ring, which is ordered with respect to both a weak
order and an associated strict order. Our numeric structures (int, rat, and... |
e6ef49365364dce1a19604882dd7673a008e4efd | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /archive/sensitivity.lean | 330db71772701278167fd079162d46ac09d31c78 | [
"Apache-2.0"
] | permissive | robertylewis/mathlib | 3d16e3e6daf5ddde182473e03a1b601d2810952c | 1d13f5b932f5e40a8308e3840f96fc882fae01f0 | refs/heads/master | 1,651,379,945,369 | 1,644,276,960,000 | 1,644,276,960,000 | 98,875,504 | 0 | 0 | Apache-2.0 | 1,644,253,514,000 | 1,501,495,700,000 | Lean | UTF-8 | Lean | false | false | 15,635 | lean | /-
Copyright (c) 2019 Reid Barton, Johan Commelin, Jesse Han, Chris Hughes, Robert Y. Lewis,
Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Reid Barton, Johan Commelin, Jesse Han, Chris Hughes, Robert Y. Lewis, Patrick Massot
-/
import tactic.fin_cases... |
48de51c6c4766776582c8c78f9283ce62b0999a0 | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /src/tactic/interactive_expr.lean | f6d5cce9cbce6bbfbe471ca25dc26691b250189f | [
"Apache-2.0"
] | permissive | kmill/mathlib | ea5a007b67ae4e9e18dd50d31d8aa60f650425ee | 1a419a9fea7b959317eddd556e1bb9639f4dcc05 | refs/heads/master | 1,668,578,197,719 | 1,593,629,163,000 | 1,593,629,163,000 | 276,482,939 | 0 | 0 | null | 1,593,637,960,000 | 1,593,637,959,000 | null | UTF-8 | Lean | false | false | 12,064 | lean | /-
Copyright (c) 2020 E.W.Ayers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: E.W.Ayers
-/
/-!
# Widgets used for tactic state and term-mode goal display
The vscode extension supports the display of interactive widgets.
Default implementation of these widgets are i... |
1c0030bacda85d880d3ae409598b67b3650f6802 | b074a51e20fdb737b2d4c635dd292fc54685e010 | /src/category_theory/monoidal/types.lean | 2fca1d5e431a08b14a17f00ab03efd85a518864e | [
"Apache-2.0"
] | permissive | minchaowu/mathlib | 2daf6ffdb5a56eeca403e894af88bcaaf65aec5e | 879da1cf04c2baa9eaa7bd2472100bc0335e5c73 | refs/heads/master | 1,609,628,676,768 | 1,564,310,105,000 | 1,564,310,105,000 | 99,461,307 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 886 | lean | -- Copyright (c) 2018 Michael Jendrusch. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Michael Jendrusch, Scott Morrison
import category_theory.types
import category_theory.monoidal.category
open category_theory
open tactic
universes u v
namespace category_th... |
4e590f9047281739fbc4aef966ef184aa145cabc | 1446f520c1db37e157b631385707cc28a17a595e | /stage0/src/Init/Data/Basic.lean | 8382655db948de68dc7a3606516683a05707d94d | [
"Apache-2.0"
] | permissive | bdbabiak/lean4 | cab06b8a2606d99a168dd279efdd404edb4e825a | 3f4d0d78b2ce3ef541cb643bbe21496bd6b057ac | refs/heads/master | 1,615,045,275,530 | 1,583,793,696,000 | 1,583,793,696,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 412 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import Init.Data.Nat.Basic
import Init.Data.Fin.Basic
import Init.Data.List.Basic
import Init.Data.Char.Basic
import Init.Data.String.Basic
import I... |
e5bbd8d836f54d5125ffaca70e16c86d9013ee49 | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /tests/lean/run/t3.lean | ff469a268ff91eebf2d914ffe66601f21af1b9d6 | [
"Apache-2.0"
] | permissive | codyroux/lean | 7f8dff750722c5382bdd0a9a9275dc4bb2c58dd3 | 0cca265db19f7296531e339192e9b9bae4a31f8b | refs/heads/master | 1,610,909,964,159 | 1,407,084,399,000 | 1,416,857,075,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 351 | lean | constant int : Type.{1}
constant nat : Type.{1}
namespace int
constant plus : int → int → int
end int
namespace nat
constant plus : nat → nat → nat
end nat
open int nat
constants a b : int
check plus a b
constant f : int → int → int
constant g : nat → nat → int
notation A `+`:65 B:65 := f A (g B B)
constant n : n... |
1825ba8c23e3fe896e0754a79d2b2ac734309dc8 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/tropical/lattice.lean | 83b1d1606b71d6d80dcf71752680102f2808e219 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 2,399 | lean | /-
Copyright (c) 2021 Yakov Pechersky. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yakov Pechersky
-/
import algebra.tropical.basic
import order.conditionally_complete_lattice.basic
/-!
# Order on tropical algebraic structure
This file defines the orders induced ... |
e61e22bf5895984e3c49c22240bf4e03a8fedc74 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/category_theory/idempotents/functor_categories.lean | baf4b966076a876ac75e8bf2cc584779e0312f33 | [
"Apache-2.0"
] | permissive | jcommelin/mathlib | d8456447c36c176e14d96d9e76f39841f69d2d9b | ee8279351a2e434c2852345c51b728d22af5a156 | refs/heads/master | 1,664,782,136,488 | 1,663,638,983,000 | 1,663,638,983,000 | 132,563,656 | 0 | 0 | Apache-2.0 | 1,663,599,929,000 | 1,525,760,539,000 | Lean | UTF-8 | Lean | false | false | 6,243 | lean | /-
Copyright (c) 2022 Joël Riou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Joël Riou
-/
import category_theory.idempotents.karoubi
/-!
# Idempotent completeness and functor categories
In this file we define an instance `functor_category_is_idempotent_complete` ... |
01376a681215dbbcfea608d18c2516ebda12e1ea | 5ae26df177f810c5006841e9c73dc56e01b978d7 | /test/ext.lean | cdab4a42adb180a0cee17e95382ffe63bb3c04e6 | [
"Apache-2.0"
] | permissive | ChrisHughes24/mathlib | 98322577c460bc6b1fe5c21f42ce33ad1c3e5558 | a2a867e827c2a6702beb9efc2b9282bd801d5f9a | refs/heads/master | 1,583,848,251,477 | 1,565,164,247,000 | 1,565,164,247,000 | 129,409,993 | 0 | 1 | Apache-2.0 | 1,565,164,817,000 | 1,523,628,059,000 | Lean | UTF-8 | Lean | false | false | 4,221 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
-/
import tactic.core
import tactic.ext
import tactic.solve_by_elim
import data.set.basic data.stream.basic
@[extensionality] lemma unit.ext (x y : unit) : x = y :=
begin
... |
94ebd73f07deb57c8d7814142eef2ef152eb0c09 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/number_theory/arithmetic_function.lean | 8b0ba3e3df1bfa348bf64a669f32e7b314990df9 | [
"Apache-2.0"
] | permissive | stjordanis/mathlib | 51e286d19140e3788ef2c470bc7b953e4991f0c9 | 2568d41bca08f5d6bf39d915434c8447e21f42ee | refs/heads/master | 1,631,748,053,501 | 1,627,938,886,000 | 1,627,938,886,000 | 228,728,358 | 0 | 0 | Apache-2.0 | 1,576,630,588,000 | 1,576,630,587,000 | null | UTF-8 | Lean | false | false | 32,424 | lean | /-
Copyright (c) 2020 Aaron Anderson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson
-/
import algebra.big_operators.ring
import number_theory.divisors
import algebra.squarefree
import algebra.invertible
/-!
# Arithmetic Functions and Dirichlet Convolut... |
5329e5d6b6662452b61a760b73e21dcbb2f7c292 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/localization/construction.lean | e0d318df534db37d1e937036ceeeaae552797bcf | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 13,916 | lean | /-
Copyright (c) 2022 Joël Riou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Joël Riou
-/
import category_theory.morphism_property
import category_theory.category.Quiv
/-!
# Construction of the localized category
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any ... |
6140d9159f183b66584198cc6521b32f92199b11 | c9ba4946202cfd1e2586e71960dfed00503dcdf4 | /src/object_k/object_var.lean | 7c656fdec4544b04e095b3f05510393600ca9c6a | [] | no_license | ammkrn/learning_semantics_of_k | f55f669b369e32ef8407c16521b21ac5c106dc4d | c1487b538e1decc0f1fd389cd36bc36d2da012ab | refs/heads/master | 1,588,081,593,954 | 1,552,449,093,000 | 1,552,449,093,000 | 175,315,800 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,351 | lean | import .object_sort
import meta_k.meta_sort
-- ##########################################
-- ##### object_variable ##############
@[derive decidable_eq]
inductive object_variable : Type
| mk : string → object_sort → object_variable
open object_variable
notation `~Variable` := object_variable
notation `~Varia... |
e0546bd971078f3847c875ae6df327461678df04 | e030b0259b777fedcdf73dd966f3f1556d392178 | /library/init/funext.lean | 6e6fe7f9fe186657b639e5ca853b9bf3e42fb1aa | [
"Apache-2.0"
] | permissive | fgdorais/lean | 17b46a095b70b21fa0790ce74876658dc5faca06 | c3b7c54d7cca7aaa25328f0a5660b6b75fe26055 | refs/heads/master | 1,611,523,590,686 | 1,484,412,902,000 | 1,484,412,902,000 | 38,489,734 | 0 | 0 | null | 1,435,923,380,000 | 1,435,923,379,000 | null | UTF-8 | Lean | false | false | 2,127 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad
Extensional equality for functions, and a proof of function extensionality from quotients.
-/
prelude
import init.data.quot init.logic
universe variables u v
nam... |
38d2d5c25d91db9e9d967173f6ebe76a9d184043 | 9028d228ac200bbefe3a711342514dd4e4458bff | /src/measure_theory/measurable_space.lean | eb7eb2c7bf50165f1040eabf0e9abe39d8c91ec5 | [
"Apache-2.0"
] | permissive | mcncm/mathlib | 8d25099344d9d2bee62822cb9ed43aa3e09fa05e | fde3d78cadeec5ef827b16ae55664ef115e66f57 | refs/heads/master | 1,672,743,316,277 | 1,602,618,514,000 | 1,602,618,514,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 55,316 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro
-/
import data.set.disjointed
import data.set.countable
import data.indicator_function
import data.equiv.encodable.lattice
import order.filter.basic
/-!... |
e40b19e70e641ee7aa68615775c92ebde9347a90 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/tactic/binder_matching.lean | 0d86b04a3bc3405e6a750881b513b931e94ad274 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 15,630 | lean | /-
Copyright (c) 2020 Jannis Limperg. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jannis Limperg
-/
import data.option.defs
import meta.expr
/-!
# Matching expressions with leading binders
This module defines a family of tactics for matching expressions with lead... |
666423775d3dcdbba3ffa87e6f055ebf6d036490 | d6124c8dbe5661dcc5b8c9da0a56fbf1f0480ad6 | /test/run/ir/functionRef.lean | 058932627f47786e6164d0e7783c7e0c8463529f | [
"Apache-2.0"
] | permissive | xubaiw/lean4-papyrus | c3fbbf8ba162eb5f210155ae4e20feb2d32c8182 | 02e82973a5badda26fc0f9fd15b3d37e2eb309e0 | refs/heads/master | 1,691,425,756,824 | 1,632,122,825,000 | 1,632,123,075,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,511 | lean |
import Papyrus
open Papyrus
def assertBEq [Repr α] [BEq α] (expected actual : α) : IO PUnit := do
unless expected == actual do
throw <| IO.userError s!"expected '{repr expected}', got '{repr actual}'"
-- empty function
#eval LlvmM.run do
let name := "foo"
let voidTypeRef ← VoidTypeRef.get
let fnTy ← Fun... |
2b7956f10686987e10a891b1b2d4afe91417d781 | 626e312b5c1cb2d88fca108f5933076012633192 | /src/algebra/floor.lean | 19f35510a017c2cfe0aaf1cc36c7d8b04e8ca843 | [
"Apache-2.0"
] | permissive | Bioye97/mathlib | 9db2f9ee54418d29dd06996279ba9dc874fd6beb | 782a20a27ee83b523f801ff34efb1a9557085019 | refs/heads/master | 1,690,305,956,488 | 1,631,067,774,000 | 1,631,067,774,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 15,548 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Kevin Kappelmann
-/
import tactic.linarith
import tactic.abel
import algebra.ordered_group
import data.set.intervals.basic
/-!
# Floor and ceil
## Summary
We define ... |
7c095776ffe705b5116e2a10f218080f71969059 | 3dd1b66af77106badae6edb1c4dea91a146ead30 | /tests/lean/t5.lean | 5e54c7258581ec9f4a89b788de35e851daeaed82 | [
"Apache-2.0"
] | permissive | silky/lean | 79c20c15c93feef47bb659a2cc139b26f3614642 | df8b88dca2f8da1a422cb618cd476ef5be730546 | refs/heads/master | 1,610,737,587,697 | 1,406,574,534,000 | 1,406,574,534,000 | 22,362,176 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 243 | lean | variable N : Type.{1}
variable f : N → N
variable a : N
definition g (a : N) : N := f a
check g
namespace foo
definition h : N := f a
check h
definition q [private] : N := f a
check q
end
check foo.h
check q -- Error q is now hidden
|
0008e47b17450dde58f30b7ae9e2a9e74f20fe8b | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/tactic/rewrite_search/frontend.lean | 9c5398a8e1ad1229f8a839fadc9b9c9b34eb254e | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 4,051 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Keeley Hoek, Scott Morrison
-/
import tactic.rewrite_search.explain
import tactic.rewrite_search.discovery
import tactic.rewrite_search.search
/-!
# `rewrite_search`: solving goals b... |
62012f05a786c582de7fb560620ce5774d81a258 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/blast_cc5.lean | 84c24309f59edfb6b46722433ed140e9eeefe284 | [
"Apache-2.0"
] | permissive | soonhokong/lean | cb8aa01055ffe2af0fb99a16b4cda8463b882cd1 | 38607e3eb57f57f77c0ac114ad169e9e4262e24f | refs/heads/master | 1,611,187,284,081 | 1,450,766,737,000 | 1,476,122,547,000 | 11,513,992 | 2 | 0 | null | 1,401,763,102,000 | 1,374,182,235,000 | C++ | UTF-8 | Lean | false | false | 587 | lean | set_option blast.strategy "cc"
example (a b c : Prop) : (a ↔ b) → ((a ∧ (c ∨ b)) ↔ (b ∧ (c ∨ a))) :=
by blast
/-
example (a b c : Prop) : (a ↔ b) → ((a ∧ (c ∨ (b ↔ a))) ↔ (b ∧ (c ∨ (a ↔ b)))) :=
by blast
example (a₁ a₂ b₁ b₂ : Prop) : (a₁ ↔ b₁) → (a₂ ↔ b₂) → (a₁ ∧ a₂ ∧ a₁ ∧ a₂ ↔ b₁ ∧ b₂ ∧ b₁ ∧ b₂) :=
by blast
defin... |
c093106131b5e392c8a467bf406e99fda31da29d | 1fd908b06e3f9c1252cb2285ada1102623a67f72 | /init/meta/rewrite.lean | 3ed401a847b7523fb897df00bf8cd8aef95077ca | [
"Apache-2.0"
] | permissive | avigad/hott3 | 609a002849182721e7c7ae536d9f1e2956d6d4d3 | f64750cd2de7a81e87d4828246d1369d59f16f43 | refs/heads/master | 1,629,027,243,322 | 1,510,946,717,000 | 1,510,946,717,000 | 103,570,461 | 0 | 0 | null | 1,505,415,620,000 | 1,505,415,620,000 | null | UTF-8 | Lean | false | false | 3,636 | lean | /-
Copyright (c) 2017 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner, Jeremy Avigad
-/
import ..path
open tactic expr
namespace hott
-- accumulates a list of metavariables that should be instantiated by class inference, and returns it
met... |
6665e6a08fcd38ffabb91457ab33686f944c72cc | c8af905dcd8475f414868d303b2eb0e9d3eb32f9 | /src/data/cpi/concretion/congruence.lean | e0d4a028bd6b1d014ba400de3c9a3c4d6ed3d13c | [
"BSD-3-Clause"
] | permissive | continuouspi/lean-cpi | 81480a13842d67ff5f3698643210d8ed5dd08de4 | 443bf2cb236feadc45a01387099c236ab2b78237 | refs/heads/master | 1,650,307,316,582 | 1,587,033,364,000 | 1,587,033,364,000 | 207,499,661 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,265 | lean | import data.cpi.concretion.basic
namespace cpi
namespace concretion
variables {ℍ : Type} {ω : context} [∀ Γ, setoid (species ℍ ω Γ)]
/-- Structural congruence between concretions. -/
inductive equiv : ∀ {Γ} {b y}, concretion ℍ ω Γ b y → concretion ℍ ω Γ b y → Prop
| refl {Γ} {b y} {F : concretion ℍ ω Γ b y} : equiv... |
9652b019f2ecca9eed95d691ac9948f56c9b63b5 | df561f413cfe0a88b1056655515399c546ff32a5 | /2-addition-world/l3.lean | a1e1244046f8c8ed433291a79e42f5acdb764e78 | [] | no_license | nicholaspun/natural-number-game-solutions | 31d5158415c6f582694680044c5c6469032c2a06 | 1e2aed86d2e76a3f4a275c6d99e795ad30cf6df0 | refs/heads/main | 1,675,123,625,012 | 1,607,633,548,000 | 1,607,633,548,000 | 318,933,860 | 3 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 164 | lean | lemma succ_add (a b : mynat) : succ a + b = succ (a + b) :=
begin
induction b with k Pk,
rw add_zero, rw add_zero, refl,
rw add_succ, rw add_succ, rw Pk, refl,
end |
ab47c98c1d915deb8329962d3d1e1e18519f8ea4 | d53312f14e4be505a8abcc1969b73308b038f020 | /06-formalizacija-dokazov/lambda.lean | bd980ad2a34499a9b4f74227615cea5f54e0be5d | [] | no_license | lunar-starlight/teorija-programskih-jezikov | 18ccdfaa9200c10c2b1ec14624419532dd671d25 | bfdf69114a6b13b1ae5735e8749b543f722e5965 | refs/heads/master | 1,667,393,466,506 | 1,577,651,158,000 | 1,577,651,158,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,194 | lean | inductive ty : Type
| unit : ty
| bool : ty
| arrow : ty -> ty -> ty
def ident := string
inductive tm : Type
| var : ident -> tm
| unit : tm
| true : tm
| false : tm
| app : tm -> tm -> tm
| lam : ident -> tm -> tm
| if_then_else : tm -> tm -> tm -> tm
def subst : ident -> tm -> tm -> tm
| x e (tm.var y) :=
if x... |
66a86908027fd6e6f790abc2b5c9e7bc6bff253d | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tests/lean/run/optParam.lean | abcfa2dec19957040847c65dc78242f74c4723ed | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | cipher1024/lean4 | 6e1f98bb58e7a92b28f5364eb38a14c8d0aae393 | 69114d3b50806264ef35b57394391c3e738a9822 | refs/heads/master | 1,642,227,983,603 | 1,642,011,696,000 | 1,642,011,696,000 | 228,607,691 | 0 | 0 | Apache-2.0 | 1,576,584,269,000 | 1,576,584,268,000 | null | UTF-8 | Lean | false | false | 327 | lean | def p (x : Nat := 0) : Nat × Nat :=
(x, x)
theorem ex1 : p.1 = 0 :=
rfl
theorem ex2 : (p (x := 1) |>.2) = 1 :=
rfl
def c {α : Type} [Inhabited α] : α × α :=
(arbitrary, arbitrary)
theorem ex3 {α} [Inhabited α] : c.1 = arbitrary (α := α) :=
rfl
theorem ex4 {α} [Inhabited α] : c.2 = arbitrary (α := α) :=
rfl
|
15c03e03cdb9888df2021c9314728fe0a695a257 | 48eee836fdb5c613d9a20741c17db44c8e12e61c | /src/algebra/identities/basic.lean | 2bc7a4ad3e379444619955ac99f3ec6d7b16e056 | [
"Apache-2.0"
] | permissive | fgdorais/lean-universal | 06430443a4abe51e303e602684c2977d1f5c0834 | 9259b0f7fb3aa83a9e0a7a3eaa44c262e42cc9b1 | refs/heads/master | 1,592,479,744,136 | 1,589,473,399,000 | 1,589,473,399,000 | 196,287,552 | 1 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 9,270 | lean | -- Copyright © 2019 François G. Dorais. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
import util.identities
variables {α : Sort*} {β : Sort*} {γ : Sort*} {δ : Sort*} {ε : Sort*} {η : Sort*}
namespace algebra.identity
@[identity]
protected abbreviation op_commutative (o... |
9be659849b46056969300c0395defe8ff2e8d49d | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/measure_theory/integral/interval_integral.lean | e33e59b0144fc012168e5f95d9df6234e47644f7 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 62,254 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov, Patrick Massot, Sébastien Gouëzel
-/
import data.set.intervals.disjoint
import measure_theory.integral.set_integral
import measure_theory.measure.lebesgue.basic... |
6929e921fba26256a13f541a74fac1f272381be6 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/interactive/rb_map_ts.lean | 89aa26bc61d6af3956c8f9e06cd0372264eb874a | [
"Apache-2.0"
] | permissive | leanprover-community/lean | 12b87f69d92e614daea8bcc9d4de9a9ace089d0e | cce7990ea86a78bdb383e38ed7f9b5ba93c60ce0 | refs/heads/master | 1,687,508,156,644 | 1,684,951,104,000 | 1,684,951,104,000 | 169,960,991 | 457 | 107 | Apache-2.0 | 1,686,744,372,000 | 1,549,790,268,000 | C++ | UTF-8 | Lean | false | false | 2,271 | lean | meta def mytac :=
state_t (name_map nat) tactic
section
local attribute [reducible] mytac
meta instance : monad mytac := by apply_instance
meta instance : monad_state (name_map nat) mytac := by apply_instance
meta instance : has_monad_lift tactic mytac := by apply_instance
end
meta instance (α : Type) : has_coe (tact... |
a1552a6beff5656984d5bfbe95ee05edb124e309 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/data/nat/gcd.lean | 95b497ac939650342f0040ef8121bf90ef3e054d | [
"Apache-2.0"
] | permissive | stjordanis/mathlib | 51e286d19140e3788ef2c470bc7b953e4991f0c9 | 2568d41bca08f5d6bf39d915434c8447e21f42ee | refs/heads/master | 1,631,748,053,501 | 1,627,938,886,000 | 1,627,938,886,000 | 228,728,358 | 0 | 0 | Apache-2.0 | 1,576,630,588,000 | 1,576,630,587,000 | null | UTF-8 | Lean | false | false | 17,936 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura
-/
import data.nat.pow
/-!
# Definitions and properties of `gcd`, `lcm`, and `coprime`
-/
namespace nat
/-! ### `gcd` -/
theorem gcd_dvd (m n : ℕ) ... |
c662d8f5dd5a275b67c9eca5d2d5aa162f83833b | 1dd482be3f611941db7801003235dc84147ec60a | /src/algebra/archimedean.lean | aae19e4f41140173204ee7a83ad3f7ce907a87a9 | [
"Apache-2.0"
] | permissive | sanderdahmen/mathlib | 479039302bd66434bb5672c2a4cecf8d69981458 | 8f0eae75cd2d8b7a083cf935666fcce4565df076 | refs/heads/master | 1,587,491,322,775 | 1,549,672,060,000 | 1,549,672,060,000 | 169,748,224 | 0 | 0 | Apache-2.0 | 1,549,636,694,000 | 1,549,636,694,000 | null | UTF-8 | Lean | false | false | 10,994 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
Archimedean groups and fields.
-/
import algebra.group_power data.rat tactic.linarith
local infix ` • ` := add_monoid.smul
variables {α : Type*}
class floor_ring (α)... |
d20c80ca241ee15191018aafa3fb793561f7b02f | f57570f33b51ef0271f8c366142363d5ae8fff45 | /src/formalizing_logic.lean | 6744c2c69eb2b253eaba652ec65d21c5752aa638 | [] | no_license | maxd13/lean-logic | 4083cb3fbb45b423befca7fda7268b8ba85ff3a6 | ddcab46b77adca91b120a5f37afbd48794da8b52 | refs/heads/master | 1,692,257,681,488 | 1,631,740,832,000 | 1,631,740,832,000 | 246,324,437 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 345 | lean | import data.set.finite data.set.countable order.bounded_lattice init.data.list
tactic computability.primrec formal_system propositional_logic
-- tactic.tidy tactic.find
--.philosophy.Interpretation_PeterChen_ER
-- We formalize several logical systems.
open set lattice logic
universe u
--local attribute [instance] ... |
3acb9c2bb6f052b44e4ee404d1d5e387313d3b4d | 94e33a31faa76775069b071adea97e86e218a8ee | /src/category_theory/monoidal/of_chosen_finite_products.lean | 9e822085b515c5ed07a6cb7792461d5fb8a235e0 | [
"Apache-2.0"
] | permissive | urkud/mathlib | eab80095e1b9f1513bfb7f25b4fa82fa4fd02989 | 6379d39e6b5b279df9715f8011369a301b634e41 | refs/heads/master | 1,658,425,342,662 | 1,658,078,703,000 | 1,658,078,703,000 | 186,910,338 | 0 | 0 | Apache-2.0 | 1,568,512,083,000 | 1,557,958,709,000 | Lean | UTF-8 | Lean | false | false | 16,186 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Simon Hudon
-/
import category_theory.monoidal.braided
import category_theory.limits.shapes.binary_products
import category_theory.limits.shapes.terminal
import categor... |
ef4e98ef78cdb81c533e363e0d69410a5c0c1782 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/analysis/special_functions/japanese_bracket.lean | 30ab3a86d24a36f465c8cf91c7e547829a5535f8 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 8,125 | lean | /-
Copyright (c) 2022 Moritz Doll. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Moritz Doll
-/
import analysis.special_functions.integrals
import analysis.special_functions.pow
import measure_theory.integral.layercake
import tactic.positivity
/-!
# Japanese Bracket... |
56fade833459be4e5c2ba4a2c1e5be74c5d7e5f1 | 07f5f86b00fed90a419ccda4298d8b795a68f657 | /library/init/meta/tactic.lean | 3f9069e4be8e35425382fd4e85d2882a98a0c091 | [
"Apache-2.0"
] | permissive | VBaratham/lean | 8ec5c3167b4835cfbcd7f25e2173d61ad9416b3a | 450ca5834c1c35318e4b47d553bb9820c1b3eee7 | refs/heads/master | 1,629,649,471,814 | 1,512,060,373,000 | 1,512,060,469,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 46,901 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.function init.data.option.basic init.util
import init.category.combinators init.category.monad init.category.alternative init.category.m... |
a999a22bbaac3afda9e0cef4d0a7d5b9836bc2e1 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/max_memory.lean | ea508d40d0d2fb6ca891afd3c7f16785790d5b42 | [
"Apache-2.0"
] | permissive | leanprover-community/lean | 12b87f69d92e614daea8bcc9d4de9a9ace089d0e | cce7990ea86a78bdb383e38ed7f9b5ba93c60ce0 | refs/heads/master | 1,687,508,156,644 | 1,684,951,104,000 | 1,684,951,104,000 | 169,960,991 | 457 | 107 | Apache-2.0 | 1,686,744,372,000 | 1,549,790,268,000 | C++ | UTF-8 | Lean | false | false | 25 | lean | set_option max_memory 40
|
8cca8e78e6d14d1e029dd81a8362ff3a52363477 | b00eb947a9c4141624aa8919e94ce6dcd249ed70 | /stage0/src/Init/WF.lean | bc8300ffa50fa5e09e52dbab13f4618e97379d66 | [
"Apache-2.0"
] | permissive | gebner/lean4-old | a4129a041af2d4d12afb3a8d4deedabde727719b | ee51cdfaf63ee313c914d83264f91f414a0e3b6e | refs/heads/master | 1,683,628,606,745 | 1,622,651,300,000 | 1,622,654,405,000 | 142,608,821 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 11,156 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
prelude
import Init.SizeOf
import Init.Data.Nat.Basic
universes u v
set_option codegen false
inductive Acc {α : Sort u} (r : α → α → Prop) : α → Prop wher... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.