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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
7a9a62aa26fb68418abf43975bdd3f52824cc002 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/lemma.lean | 31fffea0bad16160ec50402c2d4ecc584e0932b9 | [
"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 | 254 | lean | macro mods:declModifiers "lemma" n:declId sig:declSig val:declVal : command => `($mods:declModifiers theorem $n $sig $val)
lemma fooSimple (n : Nat) : Prop :=
if n = 0 then True else False
lemma fooPat : Nat → Prop
| 0 => True
| n+1 => False
|
79180e4b308a7b3def20f9bbf69cb1f9e644a59c | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/combinatorics/additive/salem_spencer.lean | 7b6fc3d940e27f75595cb020d665e1e2689820c6 | [
"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 | 18,156 | lean | /-
Copyright (c) 2021 Yaël Dillies, Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies, Bhavik Mehta
-/
import algebra.hom.freiman
import analysis.asymptotics.asymptotics
import analysis.convex.strict_convex_space
/-!
# Salem-Spencer sets and Ro... |
12e4c44578d63ca9cb05c864a23502db92a510a9 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/analysis/analytic/composition.lean | e7d04555e7627420923c15e6904650f28fc01ff1 | [
"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 | 58,624 | lean | /-
Copyright (c) 2020 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel, Johan Commelin
-/
import analysis.analytic.basic
import combinatorics.composition
/-!
# Composition of analytic functions
in this file we prove that the composi... |
ca1c963b55982d64018e52a4212a6025f11cba4c | 9dd3f3912f7321eb58ee9aa8f21778ad6221f87c | /tests/lean/notation8.lean | 04a7152b62a19132405056eadeddf1a9ed941ecd | [
"Apache-2.0"
] | permissive | bre7k30/lean | de893411bcfa7b3c5572e61b9e1c52951b310aa4 | 5a924699d076dab1bd5af23a8f910b433e598d7a | refs/heads/master | 1,610,900,145,817 | 1,488,006,845,000 | 1,488,006,845,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 119 | lean | constant f : nat → nat → nat
constant g : nat → nat
check f (1 + g 1) $ g 2 + 2
check f (g 1) $ f (1 + 1) $ g 2
|
88dc44eb47bdcfcf3d767ac84811675c0eec7c58 | 84a9fc5d67b057efbf3a74e2eaa539d7f9badc27 | /lib/data/pow.lean | eb4c7dea6404d4aa4e5d202e2c736ad3a35ac194 | [] | no_license | agentultra/lean-modexp | 2606769ea3f1c4417d0b4c3d448c655ed97a3f67 | f59a433db8aa7b62d9ae26f0037b4f23cfb7afed | refs/heads/master | 1,610,731,162,684 | 1,502,413,558,000 | 1,502,413,558,000 | 99,747,888 | 0 | 0 | null | 1,502,238,319,000 | 1,502,238,319,000 | null | UTF-8 | Lean | false | false | 2,329 | lean |
universe u
section pow
open nat
variable {α : Type u}
section basics
variables [has_one α] [has_mul α]
def pow (b : α) : ℕ → α
| 0 := 1
| (succ n) := pow n * b
local infix `^` := pow
@[simp] lemma pow_zero (b : α) : b^0 = 1 := rfl
end basics
local infix `^` := pow
section comm_monoid
variables [comm... |
aa9302808d0178197eda287be3cfe54ca873a31e | 4fa161becb8ce7378a709f5992a594764699e268 | /src/data/nat/choose.lean | d2af6c931e9bae1a6894165cdf58454b550169ae | [
"Apache-2.0"
] | permissive | laughinggas/mathlib | e4aa4565ae34e46e834434284cb26bd9d67bc373 | 86dcd5cda7a5017c8b3c8876c89a510a19d49aad | refs/heads/master | 1,669,496,232,688 | 1,592,831,995,000 | 1,592,831,995,000 | 274,155,979 | 0 | 0 | Apache-2.0 | 1,592,835,190,000 | 1,592,835,189,000 | null | UTF-8 | Lean | false | false | 6,198 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Bhavik Mehta, Patrick Stevens
-/
import tactic.linarith
import algebra.big_operators
open nat
open_locale big_operators
lemma nat.prime.dvd_choose_add {p a b : ℕ} (hap :... |
868d2f284604674b6d17e55363965e3402398935 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/set_theory/cardinal/ordinal.lean | 6dffdf258ff18cbf3d5b83349ed181eb0650f49e | [
"Apache-2.0"
] | permissive | ramonfmir/mathlib | c5dc8b33155473fab97c38bd3aa6723dc289beaa | 14c52e990c17f5a00c0cc9e09847af16fabbed25 | refs/heads/master | 1,661,979,343,526 | 1,660,830,384,000 | 1,660,830,384,000 | 182,072,989 | 0 | 0 | null | 1,555,585,876,000 | 1,555,585,876,000 | null | UTF-8 | Lean | false | false | 47,850 | 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, Floris van Doorn
-/
import data.finsupp.multiset
import order.bounded
import set_theory.ordinal.principal
import tactic.linarith
/-!
# Cardinals and o... |
708b74f9376f0d9f5f5d24208bf0b368b0a1aa5e | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/analysis/normed/group/infinite_sum.lean | 79d5aa4ad15c57fcf7fb9798296599eda7464b0d | [
"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 | 8,522 | lean | /-
Copyright (c) 2021 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel, Heather Macbeth, Johannes Hölzl, Yury Kudryashov
-/
import analysis.normed.group.basic
import topology.instances.nnreal
/-!
# Infinite sums in (semi)normed group... |
3ab961c3cbad05d887828171c91c2c740966cfdb | 3fed20a6f59e2663e48ee3bfc33dbc79256b4a50 | /src/test.lean | 99948834abedc93555bf117cc4fc612f817d252e | [] | no_license | arademaker/alc-lean | 575203dae75f466cc686831d8b0d230fc3c00ced | 46d5b582d4272493a26d6d47c0bfa0622c52aae4 | refs/heads/master | 1,622,696,540,378 | 1,618,442,995,000 | 1,618,442,995,000 | 37,130,780 | 4 | 3 | null | 1,618,365,416,000 | 1,433,853,111,000 | Lean | UTF-8 | Lean | false | false | 2,992 | lean | import alc
namespace test
open ALC
open ALC.Concept
inductive ac : Type
| man : ac
| woman : ac
inductive ar : Type
| hasChild : ar
@[reducible]
def ic : VarConcept → set ℕ
| 1 := ({2,4} : set ℕ)
| 2 := ({1,3} : set ℕ)
@[reducible]
def ir : VarRole → set (ℕ × ℕ)
| _ := ({(1,2),(4,3)} : set (ℕ × ... |
202a48b105aa25e58e5fa822c6d1e13daa83a7cf | 9d2e3d5a2e2342a283affd97eead310c3b528a24 | /src/hints/thursday/afternoon/category_theory/exercise3/hint7.lean | 8af891402cbb9914355657e743e46fda97e77058 | [] | permissive | Vtec234/lftcm2020 | ad2610ab614beefe44acc5622bb4a7fff9a5ea46 | bbbd4c8162f8c2ef602300ab8fdeca231886375d | refs/heads/master | 1,668,808,098,623 | 1,594,989,081,000 | 1,594,990,079,000 | 280,423,039 | 0 | 0 | MIT | 1,594,990,209,000 | 1,594,990,209,000 | null | UTF-8 | Lean | false | false | 781 | lean | import for_mathlib.category_theory -- This imports some simp lemmas that I realised belong in mathlib while writing this exercise.
open category_theory
variables {C : Type*} [category C]
variables {D : Type*} [category D]
lemma equiv_preserves_mono {X Y : C} (f : X ⟶ Y) [mono f] (e : C ≌ D) :
mono (e.functor.map ... |
58c4a0a97a949843fac305d86c67633ada284c32 | 130c49f47783503e462c16b2eff31933442be6ff | /tests/lean/run/trans.lean | 90913f80fb7336cf747a87b31ac3fb4c02613eba | [
"Apache-2.0"
] | permissive | Hazel-Brown/lean4 | 8aa5860e282435ffc30dcdfccd34006c59d1d39c | 79e6732fc6bbf5af831b76f310f9c488d44e7a16 | refs/heads/master | 1,689,218,208,951 | 1,629,736,869,000 | 1,629,736,896,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 597 | lean | class Trans (r : α → β → Prop) (s : β → γ → Prop) (t : outParam (α → γ → Prop)) where
trans : r a b → s b c → t a c
export Trans (trans)
instance : Trans (α := Nat) (β := Nat) (γ := Nat) (.≤.) (.≤.) (.≤.) where
trans := Nat.le_trans
instance : Trans (α := Int) (β := Int) (γ := Int) (.≤.) (.≤.) (.≤.) where
tran... |
273cfa611c5d3aeecf55bf6d450520383e8d6c14 | ce89339993655da64b6ccb555c837ce6c10f9ef4 | /bluejam/topprover/31.lean | 748c6d62abc4eebe7b160f4377ef36a3e8cf406a | [] | no_license | zeptometer/LearnLean | ef32dc36a22119f18d843f548d0bb42f907bff5d | bb84d5dbe521127ba134d4dbf9559b294a80b9f7 | refs/heads/master | 1,625,710,824,322 | 1,601,382,570,000 | 1,601,382,570,000 | 195,228,870 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,915 | lean | def binom: ℕ → ℕ → ℕ
| _ 0 := 1
| 0 _ := 0
| (m + 1) (n + 1) := binom m (n + 1) + binom m n
def binom_sum: ℕ → ℕ → ℕ
| n 0 := binom n 0
| n (k + 1) := binom_sum n k + binom n (k + 1)
lemma is_zero: ∀ k, binom 0 (k + 1) = 0 :=
begin
intros,
induction k,
simp [binom],
assumption
end
lemma binom_sum... |
50990385dc46fa6a9f2035b27d7580b6b50f2e48 | 6b10c15e653d49d146378acda9f3692e9b5b1950 | /examples/logic/unnamed_14.lean | 3f26dcb9b9839b5ffdf7cf8c97bead35094de150 | [] | 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 | 314 | lean | variables A B : Prop
variable α : Type*
variable P : α → Prop
-- if A then B
#check A → B
-- A and B
#check A ∧ B
-- A or B
#check A ∨ B
-- not A
#check ¬ A
-- A if and only if B
#check A ↔ B
#check true
#check false
-- for every x, P x
#check ∀ x, P x
-- for some x, P x
#check ∃ x, P x |
4027e8e5fb78eb9819993b2be98ac6b67aaf3337 | 1b8f093752ba748c5ca0083afef2959aaa7dace5 | /src/category_theory/universal/zero.lean | cae7d23acb7b60d7b74295a2eb25207af06814aa | [] | no_license | khoek/lean-category-theory | 7ec4cda9cc64a5a4ffeb84712ac7d020dbbba386 | 63dcb598e9270a3e8b56d1769eb4f825a177cd95 | refs/heads/master | 1,585,251,725,759 | 1,539,344,445,000 | 1,539,344,445,000 | 145,281,070 | 0 | 0 | null | 1,534,662,376,000 | 1,534,662,376,000 | null | UTF-8 | Lean | false | false | 2,208 | lean | import category_theory.limits.terminal
open category_theory
universes u v
namespace category_theory.limits
variables {C : Type u} [𝒞 : category.{u v} C]
include 𝒞
structure is_zero (t : C) :=
(lift : ∀ (s : C), s ⟶ t)
(uniq_lift' : ∀ (s : C) (m : s ⟶ t), m = lift s . obviously)
(desc : ∀ (s : C), t ⟶ s)
(uniq_de... |
b6e69ef721c2abb8abacd3c640c49c9fac413698 | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/data/real/cau_seq_completion.lean | 6356d1d92246ec0c17f2c78aec387a8f35374122 | [
"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 | 9,474 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Robert Y. Lewis
Generalizes the Cauchy completion of (ℚ, abs) to the completion of a
commutative ring with absolute value.
-/
import data.real.cau_seq
namespace cau_... |
ea851515c1e8a809a8c99620b275e4e67b525125 | 367134ba5a65885e863bdc4507601606690974c1 | /src/tactic/omega/int/main.lean | 3f4a19eda0a36c2ad0016d3578524007e96fa9f2 | [
"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 | 6,288 | lean | /-
Copyright (c) 2019 Seul Baek. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Seul Baek
-/
/-
Main procedure for linear integer arithmetic.
-/
import tactic.omega.prove_unsats
import tactic.omega.int.dnf
open tactic
namespace omega
namespace int
open_locale omega... |
bc93e86b09cbf474fedff06bc39f385f0bf8469c | 359199d7253811b032ab92108191da7336eba86e | /src/homework/q_5_f.lean | 94aa3b1012172ae746cb38785d6a34e65f72eaea | [] | no_license | arte-et-marte/my_cs2120f21 | 0bc6215cb5018a3b7c90d9d399a173233f587064 | 91609c3609ad81fda895bee8b97cc76813241e17 | refs/heads/main | 1,693,298,928,348 | 1,634,931,202,000 | 1,634,931,202,000 | 399,946,705 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 399 | lean | theorem q_5_f : ∀ (P Q: Prop), ¬(P ∧ Q) → ¬P ∨ ¬Q :=
begin
assume P Q,
assume h,
have p_or_np := classical.em P,
have q_or_nq := classical.em Q,
cases p_or_np with p np,
cases q_or_nq with q nq,
-- case 1:
have pandq := and.intro p q,
have f := h pandq,
exact false.elim f,
-- case 2:
exact or.in... |
5470967e24834a6023e7e03832cbc66eab86ce9e | 00de0c30dd1b090ed139f65c82ea6deb48c3f4c2 | /src/linear_algebra/projection.lean | e0de3fe415614cea330d922d525a90af1115c392 | [
"Apache-2.0"
] | permissive | paulvanwamelen/mathlib | 4b9c5c19eec71b475f3dd515cd8785f1c8515f26 | 79e296bdc9f83b9447dc1b81730d36f63a99f72d | refs/heads/master | 1,667,766,172,625 | 1,590,239,595,000 | 1,590,239,595,000 | 266,392,625 | 0 | 0 | Apache-2.0 | 1,590,257,277,000 | 1,590,257,277,000 | null | UTF-8 | Lean | false | false | 7,698 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Yury Kudryashov
-/
import linear_algebra.basic
/-!
# Projection to a subspace
In this file we define
* `linear_proj_of_is_compl (p q : submodule R E) (h : is_compl p q)`: the project... |
24e8a383639a5efac8710290db467620eb9506ed | bd12a817ba941113eb7fdb7ddf0979d9ed9386a0 | /src/category_theory/category.lean | 74fece41d1b6c3a5b239f9b867eeaebb01835efa | [
"Apache-2.0"
] | permissive | flypitch/mathlib | 563d9c3356c2885eb6cefaa704d8d86b89b74b15 | 70cd00bc20ad304f2ac0886b2291b44261787607 | refs/heads/master | 1,590,167,818,658 | 1,557,762,121,000 | 1,557,762,121,000 | 186,450,076 | 0 | 0 | Apache-2.0 | 1,557,762,289,000 | 1,557,762,288,000 | null | UTF-8 | Lean | false | false | 6,273 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Stephen Morgan, Scott Morrison, Johannes Hölzl, Reid Barton
Defines a category, as a typeclass parametrised by the type of objects.
Introduces notations
`X ⟶ Y` for the morphism spa... |
81a39a3e8aaa680994c4760ba8065c8c51b01a71 | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /stage0/src/Init/Data/Int/Basic.lean | b06174ea6a84beae37cd0fe8ebce749c9f9274a8 | [
"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 | tobiasgrosser/lean4 | ce0fd9cca0feba1100656679bf41f0bffdbabb71 | ebdbdc10436a4d9d6b66acf78aae7a23f5bd073f | refs/heads/master | 1,673,103,412,948 | 1,664,930,501,000 | 1,664,930,501,000 | 186,870,185 | 0 | 0 | Apache-2.0 | 1,665,129,237,000 | 1,557,939,901,000 | Lean | UTF-8 | Lean | false | false | 4,656 | 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
The integers, with addition, multiplication, and subtraction.
-/
prelude
import Init.Coe
import Init.Data.Nat.Div
import Init.Data.List.Basic
open Nat
... |
1852ad34301e829c134d6649539e56142f49b99e | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/ring_theory/ideal/basic.lean | 6ac7c326b72ff180f037b87f2c197d4d27b60de0 | [
"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 | 36,098 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Chris Hughes, Mario Carneiro
-/
import algebra.associated
import linear_algebra.basic
import order.zorn
import order.atoms
import order.compactly_generated
/-!
# Ideals over a r... |
5e9beeb27697b67fd147999363db3b566e550c79 | 53f7fd7840fe4979de24f9611c89f2ee1b4fc5dc | /src/tactic.lean | 9e589ab6255482e5d48f1dcfe6693a8b7a70582e | [] | no_license | cipher1024/search-trees | 6d1925283c6ce47d84bdf41ca40d8317ff2e64d7 | 0e0ea0ee59f0b0499ebad1ef6f34f09ec9666cde | refs/heads/master | 1,673,300,158,759 | 1,603,984,112,000 | 1,603,984,112,000 | 308,132,998 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,678 | lean |
import tactic.default
universes u v
-- #check @option.elim
-- def option.elim {α β} (x : β) (f : α → β) : option α → β
-- | none := x
-- | (some y) := f y
-- #exit
namespace list
def mfilter_map {m} [applicative m] {α β} (f : α → m (option β)) : list α → m (list.{v} β)
| [] := pure []
| (x :: xs) :=
(λ a, option.e... |
6f9e1e920c1cc290f93370f06112706dcb3bce5c | 4727251e0cd73359b15b664c3170e5d754078599 | /src/linear_algebra/matrix/to_lin.lean | bfceaddb01a3af4208933931b54f3afd943bf862 | [
"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 | 29,179 | lean | /-
Copyright (c) 2019 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Patrick Massot, Casper Putz, Anne Baanen
-/
import data.matrix.block
import linear_algebra.matrix.finite_dimensional
import linear_algebra.std_basis
import ring_theory.... |
2dfe961faab73323e9f1fa02335be7ebaef79ac5 | e4a7c8ab8b68ca0e53d2c21397320ea590fa01c6 | /test/field.lean | 5ff7d282fef2ad6260e520e23bac4b8be6737828 | [] | no_license | lean-forward/field | 3ff5dc5f43de40f35481b375f8c871cd0a07c766 | 7e2127ad485aec25e58a1b9c82a6bb74a599467a | refs/heads/master | 1,590,947,010,909 | 1,563,811,881,000 | 1,563,811,881,000 | 190,415,651 | 1 | 0 | null | 1,563,643,371,000 | 1,559,746,688,000 | Lean | UTF-8 | Lean | false | false | 1,140 | lean | import tactic.polya.field
open polya.field tactic tactic.polya.field
def i : num := 0
def j : num := 1
def t1 : nterm ℚ := i * (1 / 2 : ℚ) + i * (1 / 2 : ℚ) - i * (1 : ℚ)
def t2 : nterm ℚ := i * 1 - i
--def t : nterm ℚ := ( i * (1 / 2) + i * (1 / 2) ) * i⁻¹
def t : nterm ℚ := i * i⁻¹
run_cmd ( trace t.norm )
theore... |
c9c145a2a1d475175f5d61bf506a7300ed3b51fc | c5b07d17b3c9fb19e4b302465d237fd1d988c14f | /src/demo.lean | 5daeb11b79c9bc5992c0bbac313c53cd5c22e4ba | [
"MIT"
] | permissive | skaslev/papers | acaec61602b28c33d6115e53913b2002136aa29b | f15b379f3c43bbd0a37ac7bb75f4278f7e901389 | refs/heads/master | 1,665,505,770,318 | 1,660,378,602,000 | 1,660,378,602,000 | 14,101,547 | 0 | 1 | MIT | 1,595,414,522,000 | 1,383,542,702,000 | Lean | UTF-8 | Lean | false | false | 1,448 | lean | import isos.bool
import isos.option
import isos.list
import sampler
def out {A} [has_repr A] (a : io A) : io unit :=
do
x <- a,
io.put_str_ln $ repr x
open sample
#eval out $ gen_fseq 50 $ fin 40000
#eval out $ gen_fseqₛ 50 $ bounded_ogf_iso₁ bool.ogf_iso 0
#eval out $ gen_fseqₛ 50 $ X.sized_ogf list bool 3
#ev... |
d1e81f10b0580d3dc0a6c187d2ca414ccc841811 | 367134ba5a65885e863bdc4507601606690974c1 | /src/data/multiset/functor.lean | 47c8193f8b6ac9c94bc5bb758a3470c41d3e5a31 | [
"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 | 4,265 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro, Johannes Hölzl, Simon Hudon, Kenny Lau
-/
import data.multiset.basic
import control.traversable.lemmas
import control.traversable.instances
/-!
# Functoriality of `multise... |
6a7ee6930b8988e934890310a84a65ea9f3af271 | 3bd26f8e9c7eeb6ae77ac4ba709b5b3c65b8d7cf | /mono_epi.lean | 43214a93e4cfd6e5b5884914283e02519247d4c9 | [] | no_license | koba-e964/lean-work | afac5677efef6905fce29cac44f36f309c3bcd62 | 6ab0506b9bd4e5a2e1ba6312d4ac6bdaf6ae1594 | refs/heads/master | 1,659,773,150,740 | 1,659,289,453,000 | 1,659,289,453,000 | 100,273,655 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,852 | lean | namespace mono_epi
variables {A B: Type}
def is_inj (f: A -> B) :=
forall x1 x2, f x1 = f x2 -> x1 = x2
def is_surj (f: A -> B) :=
forall y, exists x, y = f x
def is_mono (f: A -> B) :=
forall (X: Type) (g1 g2: X -> A), f ∘ g1 = f ∘ g2 -> g1 = g2
def is_epi (f: A -> B) :=
forall (X: Type) (g1 g2: B -> X), ... |
21540e7184e43bacc57202e1fda40bc83749b4c7 | 5c7fe6c4a9d4079b5457ffa5f061797d42a1cd65 | /src/library/src_ordered_field_lemmas.lean | 95c1e58a8b52a5f593435ed88113b2cd0ed2a440 | [] | no_license | gihanmarasingha/mth1001_tutorial | 8e0817feeb96e7c1bb3bac49b63e3c9a3a329061 | bb277eebd5013766e1418365b91416b406275130 | refs/heads/master | 1,675,008,746,310 | 1,607,993,443,000 | 1,607,993,443,000 | 321,511,270 | 3 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 14,856 | lean | import .src_ordered_field tactic
namespace mth1001
namespace myreal
section ordered
variables {R : Type} [myordered_field R]
open_locale classical
open myordered_field
lemma pos_one : pos (1 : R) :=
begin
rcases trichotomy (1 : R) with ⟨hpo, _, _ ⟩ | ⟨_, hoe, _ ⟩ | ⟨hnpo, hnoe, hpno⟩ ,
{ exact hpo, },
{ e... |
44f9182f7b7a396fc88172d7f062da1aea305783 | 097294e9b80f0d9893ac160b9c7219aa135b51b9 | /instructor/types/option/dm_option_preliminary.lean | c1721d6e7075af1522d88e3067c80e10d497b92d | [] | no_license | AbigailCastro17/CS2102-Discrete-Math | cf296251be9418ce90206f5e66bde9163e21abf9 | d741e4d2d6a9b2e0c8380e51706218b8f608cee4 | refs/heads/main | 1,682,891,087,358 | 1,621,401,341,000 | 1,621,401,341,000 | 368,749,959 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 405 | lean | namespace hidden
inductive dm_option (α : Type): Type
| none : dm_option
| some (a : α) : dm_option
/-
Heres an example of a representation in Lean of
a partial function, p, from ℕ to ℕ, such that
p(n) = 0 if n=0 and p(n) is undefined otherwise.
-/
def p : ℕ → dm_option ℕ
| nat.zero := dm_option.some nat.z... |
47d55e63217902c5cee29491970ee38f1de6b006 | f4bff2062c030df03d65e8b69c88f79b63a359d8 | /src/game/series/tempLevel04.lean | 02c093c10e0f69edcfd491ccadebb77b17da5aa9 | [
"Apache-2.0"
] | permissive | adastra7470/real-number-game | 776606961f52db0eb824555ed2f8e16f92216ea3 | f9dcb7d9255a79b57e62038228a23346c2dc301b | refs/heads/master | 1,669,221,575,893 | 1,594,669,800,000 | 1,594,669,800,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 359 | lean | import game.series.L01defs
variable X : Type --hide
/-
Idea 04: root test
-/
/- Lemma
If $A$ and $B$ are sets of any type $X$, then
$$ A \subseteq A\cup B.$$
-/
theorem subset_union_left (A B : set X) : A ⊆ A ∪ B :=
begin
--change ∀ (x : α), x ∈ A → x ∈ A ∪ B, --they may want to do this
intros x hx,
l... |
fa36fa16394f9482cbe08c5c78faf7c8a08a473c | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /src/Lean/Elab/BuiltinTerm.lean | 6f005ac32eca4284b59d3d7ff8ea9ed2437cc317 | [
"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 | EdAyers/lean4 | 57ac632d6b0789cb91fab2170e8c9e40441221bd | 37ba0df5841bde51dbc2329da81ac23d4f6a4de4 | refs/heads/master | 1,676,463,245,298 | 1,660,619,433,000 | 1,660,619,433,000 | 183,433,437 | 1 | 0 | Apache-2.0 | 1,657,612,672,000 | 1,556,196,574,000 | Lean | UTF-8 | Lean | false | false | 13,517 | 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.Elab.Term
import Lean.Elab.Eval
namespace Lean.Elab.Term
open Meta
@[builtinTermElab «prop»] def elabProp : TermElab := fun _ _ =>
return mk... |
81176f5c97c8dc2dcd095b0f1d1541b473f3462d | 2fbe653e4bc441efde5e5d250566e65538709888 | /src/linear_algebra/nonsingular_inverse.lean | c46991a428ff33990462b90c88aa93b2ca777df6 | [
"Apache-2.0"
] | permissive | aceg00/mathlib | 5e15e79a8af87ff7eb8c17e2629c442ef24e746b | 8786ea6d6d46d6969ac9a869eb818bf100802882 | refs/heads/master | 1,649,202,698,930 | 1,580,924,783,000 | 1,580,924,783,000 | 149,197,272 | 0 | 0 | Apache-2.0 | 1,537,224,208,000 | 1,537,224,207,000 | null | UTF-8 | Lean | false | false | 12,430 | lean | /-
Copyright (c) 2019 Tim Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Tim Baanen.
Inverses for nonsingular square matrices.
-/
import algebra.big_operators
import data.matrix.basic
import linear_algebra.determinant
/-!
# Nonsingular inverses
In thi... |
59d95be38cb641b3b6c821d3748abdf736e19ee3 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/algebra/category/Module/abelian.lean | ebb1f0aa591da704ba4fe8763cf68bc6887ae74d | [
"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 | 4,129 | lean | /-
Copyright (c) 2020 Markus Himmel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel
-/
import linear_algebra.isomorphisms
import algebra.category.Module.kernels
import algebra.category.Module.limits
import category_theory.abelian.exact
/-!
# The category... |
9b62d69d260b3b06aaa6998b9ec9d2b16364c7c6 | ba4794a0deca1d2aaa68914cd285d77880907b5c | /src/game/world9/level1.lean | ca2eae6c1301a69b6022e293fab103a0d557f094 | [
"Apache-2.0"
] | permissive | ChrisHughes24/natural_number_game | c7c00aa1f6a95004286fd456ed13cf6e113159ce | 9d09925424da9f6275e6cfe427c8bcf12bb0944f | refs/heads/master | 1,600,715,773,528 | 1,573,910,462,000 | 1,573,910,462,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,513 | lean | import game.world8.level13 -- hide
import game.world3.level9
namespace mynat -- hide
/-
# Advanced Multiplication World
## Level 1: `mul_pos`
Welcome to Advanced Multiplication World! Before attempting this
world you should have completed seven other worlds, including
Multiplication World and Advanced Addition World... |
25cf590e6fe024fc9c30d7be51465956b79a5c19 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/analysis/filter_auto.lean | ba1aa02e490b94734d3aa92475fe05ffd6f983b7 | [] | 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 | 9,279 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
Computational realization of filters (experimental).
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.order.filter.cofinite
import Mathlib.... |
b9637196e63b62ef742e09dd1162db9060373df3 | 5e3548e65f2c037cb94cd5524c90c623fbd6d46a | /src_icannos_totilas/aops/2012-USAMO-Problem_4.lean | 0a1928fbc9a10a4b64f7145984a84186ba5c315c | [] | 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 | 170 | lean | import data.nat.factorial
import data.pnat.basic
theorem USAMO_Problem_4_2012 (f : pnat -> pnat) :
(∀ n : pnat, f(pnat.factorial n) = nat.factorial f(n) )
:= sorry |
51b8a6743a31fbd421e99589ffce8101c2e346ac | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/order/complete_boolean_algebra.lean | 01e1f01f043267ea03afc74176b237cf750f4bd2 | [
"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 | 14,306 | 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, Yaël Dillies
-/
import order.complete_lattice
import order.directed
import logic.equiv.set
/-!
# Frames, completely distributive lattices and Boolean algebras
In this... |
7ef76b3fec170ac5494fdec565ec0e7ccda82fba | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/category_theory/monoidal/of_has_finite_products.lean | 7a4575e527e21981436ce5b307ad90bb3e144ba4 | [
"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 | 11,757 | 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
/-!
# The nat... |
7fb20117684a32af3a42f0a748757835b5eb7615 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/topology/algebra/module.lean | 0d63cffad8e1ae47e939d8deca39993faa330c60 | [
"Apache-2.0"
] | permissive | lacker/mathlib | f2439c743c4f8eb413ec589430c82d0f73b2d539 | ddf7563ac69d42cfa4a1bfe41db1fed521bd795f | refs/heads/master | 1,671,948,326,773 | 1,601,479,268,000 | 1,601,479,268,000 | 298,686,743 | 0 | 0 | Apache-2.0 | 1,601,070,794,000 | 1,601,070,794,000 | null | UTF-8 | Lean | false | false | 47,608 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jan-David Salchow, Sébastien Gouëzel, Jean Lo, Yury Kudryashov
-/
import topology.algebra.ring
import topology.uniform_space.uniform_embedding
import ring_theory.algebra
import line... |
92c4f5f7cf2130b0880c2080c7565d84e60b5a84 | acc85b4be2c618b11fc7cb3005521ae6858a8d07 | /tactic/rcases.lean | 31f5f5c16977887903f76f185e837a454618c9db | [
"Apache-2.0"
] | permissive | linpingchuan/mathlib | d49990b236574df2a45d9919ba43c923f693d341 | 5ad8020f67eb13896a41cc7691d072c9331b1f76 | refs/heads/master | 1,626,019,377,808 | 1,508,048,784,000 | 1,508,048,784,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,404 | 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.dlist
open lean lean.parser
namespace tactic
inductive rcases_patt : Type
| one : name → rcases_patt
| many : list (list rcases_patt) → rcases_patt
#p... |
faf834852054d74bfc94ad535aaecc599e2b5e70 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/lean/run/subtype_inj.lean | 28582904d88b8b90d6f8e7de49646a2d499fbae1 | [
"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 | EdAyers/lean4 | 57ac632d6b0789cb91fab2170e8c9e40441221bd | 37ba0df5841bde51dbc2329da81ac23d4f6a4de4 | refs/heads/master | 1,676,463,245,298 | 1,660,619,433,000 | 1,660,619,433,000 | 183,433,437 | 1 | 0 | Apache-2.0 | 1,657,612,672,000 | 1,556,196,574,000 | Lean | UTF-8 | Lean | false | false | 182 | lean | theorem subtype_inj (A: Type) (p: A → Prop) (a b: A) (pa: p a) (pb: p b) : (⟨a, pa⟩: {a//p a}) = (⟨b, pb⟩: {b//p b}) → a = b := by
intro eq
injection eq
assumption
|
ce8935912274a01ad21b9d8e02223c0d39b93bc3 | e09201d437062e1f95e6e5360aab0c9f947901aa | /src/regular/pumping_lemma.lean | 605ff674598d272d5150ffccca9bde628fae975f | [] | no_license | VArtem/lean-regular-languages | 34f4b093f28ef2f09ba7e684e642a0f97c901560 | e877243188253d0ac17ccf0ae2da7bf608686ff0 | refs/heads/master | 1,683,590,111,306 | 1,622,307,234,000 | 1,622,307,234,000 | 284,232,653 | 7 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,015 | lean | import automata.dfa
import regular.regex
import data.list.basic
import regular.list_lemmas
open DFA list
namespace pumping
variables {S : Type} {Q : Type} {L : set (list S)} [fintype S] [fintype Q] [decidable_eq Q]
variables {w : list S}
lemma dfa_word_split (d : DFA S Q) (st : Q) (w : list S):
(fintype.card Q)... |
b97664b5d9f660f633bf7face9a5070490e7ce84 | 0c6b99c0daded009943e570c13367c8cc7d3bcae | /chapter6/chapter6.lean | e8cbcb1735680fd8453167ff8eec4e4a19dadc1d | [] | no_license | TateKennington/logic-and-proof-exercises | e3c5c5b12b6238b47b0c5acf8717923bd471a535 | acca8882026e7b643453eb096d3021cd043005bd | refs/heads/main | 1,687,638,489,616 | 1,626,858,474,000 | 1,626,858,474,000 | 371,871,374 | 4 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 492 | lean | open classical
variables A B P Q: Prop
example: ¬(¬A ∨ B) → A :=
assume h,
have ¬A → false, from
assume nA,
have ¬A ∨ B, from or.inl nA,
h this,
by_contradiction this
example: (¬P ∧ ¬Q) → ¬(P ∨ Q) :=
assume h,
assume h_or,
show false, from
have nP: ¬P, from and.left h,
have nQ: ¬Q, fr... |
f2803c83e9aff4c8bed86700661ba07fe2743c93 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/algebra/group/prod.lean | 2afe2225d5021fec2d7078820e623334da54cdc3 | [
"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 | 10,017 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon, Patrick Massot, Yury Kudryashov
-/
import algebra.group.hom
import data.equiv.mul_add
import data.prod
/-!
# Monoid, group etc structures on `M × N`
In this file we def... |
721591d2661f2a523b63d01a0a2b9802c08ea09d | 737dc4b96c97368cb66b925eeea3ab633ec3d702 | /stage0/src/Lean/Data.lean | de84c8f7331178a9aa07d9a41b1005b40f273811 | [
"Apache-2.0"
] | permissive | Bioye97/lean4 | 1ace34638efd9913dc5991443777b01a08983289 | bc3900cbb9adda83eed7e6affeaade7cfd07716d | refs/heads/master | 1,690,589,820,211 | 1,631,051,000,000 | 1,631,067,598,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 594 | lean | /-
Copyright (c) 2020 Sebastian Ullrich. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
-/
import Lean.Data.Format
import Lean.Data.Parsec
import Lean.Data.Json
import Lean.Data.Xml
import Lean.Data.JsonRpc
import Lean.Data.KVMap
import Lean.Data.LBoo... |
9f57c70e19b2c3ec45f8ba0b3597cdbd8bec778a | 15457aa8f007f15bd4343ddc208925e54b867944 | /src/a.lean | 67dd9e9dab4a3ce2968b177ac757d2514c99b92d | [] | no_license | alexjbest/pole-test | d7c599f96fbf879abd6ac562c55a46036f743c9d | a8458dea5dfa337d85bf50c4698eae668759a487 | refs/heads/master | 1,691,966,250,606 | 1,632,236,826,000 | 1,632,236,826,000 | 408,866,643 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 122 | lean | open tactic
lemma a1 : true :=
begin
sleep 20000,
trivial
end
lemma a2 : true :=
begin
sleep 10000,
trivial
end
|
d405d6929ea777401932d2f614944ff17a8cdfef | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/tactic/suggest.lean | e17723827fe58ab252c4d4d32967cccd3a428807 | [] | 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 | 9,841 | lean | /-
Copyright (c) 2019 Lucas Allen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Lucas Allen and Scott Morrison
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.mllist
import Mathlib.tactic.solve_by_elim
import Mathlib.PostPort
unive... |
20b94c9fde7be9137cfb6e064a6a8d2c69478c0b | 32317185abf7e7c963f4c67c190aec61af6b3628 | /library/algebra/ring_power.lean | bcde5a2eafdacfda35b2dbf76d2f2e3c22acb3e3 | [
"Apache-2.0"
] | permissive | Andrew-Zipperer-unorganized/lean | 198a2317f21198cd8d26e7085e484b86277f17f7 | dcb35008e1474a0abebe632b1dced120e5f8c009 | refs/heads/master | 1,622,526,520,945 | 1,453,576,559,000 | 1,454,612,842,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,856 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad
Properties of the power operation in various structures, including ordered rings and fields.
-/
import .group_power .ordered_field
open nat
variable {A : Type}
section s... |
f180f0a69b5ff863d7c02d5cfa2803f28637bbee | bb31430994044506fa42fd667e2d556327e18dfe | /src/algebra/smul_with_zero.lean | e37fcce9ff05c9b41e84d17fb6128931ba0bb42a | [
"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 | 7,516 | lean | /-
Copyright (c) 2021 Damiano Testa. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Damiano Testa
-/
import algebra.group_power.basic
import algebra.ring.opposite
import group_theory.group_action.opposite
import group_theory.group_action.prod
/-!
# Introduce `smul_wit... |
615ad0d565d81ab44c5cf7a1f3f9388753e76c0a | ee8cdbabf07f77e7be63a449b8483ce308d37218 | /lean/src/valid/mathd-numbertheory-200.lean | 10b7238abf08900aa1c758993fbe065317b6c32f | [
"Apache-2.0",
"MIT"
] | permissive | zeta1999/miniF2F | 6d66c75d1c18152e224d07d5eed57624f731d4b7 | c1ba9629559c5273c92ec226894baa0c1ce27861 | refs/heads/main | 1,681,897,460,642 | 1,620,646,361,000 | 1,620,646,361,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 238 | lean | /-
Copyright (c) 2021 OpenAI. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kunhao Zheng
-/
import data.nat.basic
import data.real.basic
example : 139 % 11 = 7 :=
begin
norm_num,
end
|
5b1eb686dafc7fe030c5befa59b2e4aa2dba2d55 | 367134ba5a65885e863bdc4507601606690974c1 | /src/category_theory/monoidal/functor.lean | 9c15f78506d26987b16233b3f7c19f8fbb97b499 | [
"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 | 12,529 | 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, Bhavik Mehta
-/
import category_theory.monoidal.category
import category_theory.adjunction.basic
/-!
# (Lax) monoidal functors
A lax monoidal fu... |
ed1ca50097767b825d9988f48ff8f86e3bcb9456 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/run/simp_univ_metavars.lean | 74aa45569eab99351809b87d86d70657b9a69bbd | [
"Apache-2.0"
] | permissive | GaloisInc/lean | aa1e64d604051e602fcf4610061314b9a37ab8cd | f1ec117a24459b59c6ff9e56a1d09d9e9e60a6c0 | refs/heads/master | 1,592,202,909,807 | 1,504,624,387,000 | 1,504,624,387,000 | 75,319,626 | 2 | 1 | Apache-2.0 | 1,539,290,164,000 | 1,480,616,104,000 | C++ | UTF-8 | Lean | false | false | 2,608 | lean | meta def blast : tactic unit := using_smt $ return ()
structure { u v } Category :=
(Obj : Type u )
(Hom : Obj -> Obj -> Type v)
(identity : Π X : Obj, Hom X X)
(compose : Π ⦃X Y Z : Obj⦄, Hom X Y → Hom Y Z → Hom X Z)
(left_identity : ∀ ⦃X Y : Obj⦄ (f : Hom X Y), compose (identity _) f = f)
structure Func... |
ae7e589c198b3a3740b90fa0301d011d5fcdc5b0 | 5d95c8513fa8592ce314d1f40c23ad5eecfe1e34 | /src/util/meta/exceptional.lean | 360f2d4a31d8634c248900851a5ed7cf7ce1098d | [
"Apache-2.0"
] | permissive | solovay/lean-universal | 6b792513ced2fe82218e7828400743375dd59e24 | 417ed5e1b030e547912cbfefe34df9d3d01c2b65 | refs/heads/master | 1,598,052,603,315 | 1,565,981,123,000 | 1,565,981,123,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 476 | lean | -- Copyright © 2019 François G. Dorais. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
namespace exceptional
meta def orelse (α : Type) : exceptional α → exceptional α → exceptional α
| (success x) _ := success x
| (exception _ _) (success x) := success x
| (exception _ m... |
9ecccfd4d8ccbcbe8c263f2685e6336a724d9d3b | f618aea02cb4104ad34ecf3b9713065cc0d06103 | /src/data/equiv/basic.lean | b3d89e07f747bcc26979c9236b62dc8e59f77c1e | [
"Apache-2.0"
] | permissive | joehendrix/mathlib | 84b6603f6be88a7e4d62f5b1b0cbb523bb82b9a5 | c15eab34ad754f9ecd738525cb8b5a870e834ddc | refs/heads/master | 1,589,606,591,630 | 1,555,946,393,000 | 1,555,946,393,000 | 182,813,854 | 0 | 0 | null | 1,555,946,309,000 | 1,555,946,308,000 | null | UTF-8 | Lean | false | false | 33,432 | 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, Mario Carneiro
In the standard library we cannot assume the univalence axiom.
We say two types are equivalent if they are isomorphic.
Two equivalent types h... |
144a00ba66aff09ad78fdcc6953f1559e31038d2 | 33340b3a23ca62ef3c8a7f6a2d4e14c07c6d3354 | /lia/qfree_sqe.lean | 060c34ca881679f5ed9e7356461b6dfad9550fa8 | [] | no_license | lclem/cooper | 79554e72ced343c64fed24b2d892d24bf9447dfe | 812afc6b158821f2e7dac9c91d3b6123c7a19faf | refs/heads/master | 1,607,554,257,488 | 1,578,694,133,000 | 1,578,694,133,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,816 | lean | import .sqe .qfree
open list
lemma nqfree_map_unify {z} :
∀ {p : formula}, nqfree p → nqfree (p.map (atom.unify z))
| ⊤' h := by unfold formula.map
| ⊥' h := by unfold formula.map
| (A' _) h := by unfold formula.map
| (p ∧' q) h :=
begin
unfold formula.map, cases h, constructor;
apply nq... |
ae29e511470a03c3e732853b181ffae79bee05bb | 367134ba5a65885e863bdc4507601606690974c1 | /src/geometry/manifold/instances/real.lean | f080d84ec789d7cefaf2db0e57572b7657845714 | [
"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 | 15,930 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import geometry.manifold.algebra.smooth_functions
import linear_algebra.finite_dimensional
import analysis.normed_space.inner_product
/-!
# Constructing exampl... |
276ce14573fc5c2166398ca2e4ec6b1f235868fe | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/ring_theory/adjoin_root.lean | dbe6d765ad5f17a7e7621b0f06b57fadc5407373 | [
"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 | 16,339 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Chris Hughes
-/
import data.polynomial.field_division
import linear_algebra.finite_dimensional
import ring_theory.adjoin.basic
import ring_theory.power_basis
import rin... |
0eeb42e787acffd921447dd1239439efa830a6c5 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/ring_theory/witt_vector/verschiebung.lean | 164eb82bbd13d90ba41819b72754fb9a1df9b7e6 | [
"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 | 5,941 | 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.basic
import ring_theory.witt_vector.is_poly
/-!
## The Verschiebung operator
## References
* [Hazewinkel, *Witt Vectors*][Haze09]... |
589931076e0ebc29a5c0e967893ce0f3b8df29ca | cf39355caa609c0f33405126beee2739aa3cb77e | /library/smt/default.lean | b8b2afb7bd81dba6b6147867d3063a8cdacbb05d | [
"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 | 197 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Daniel Selsam
-/
import smt.arith smt.array smt.prove
|
1968e18e33422afe7cee16eeb600c0e26c83d37e | 853df553b1d6ca524e3f0a79aedd32dde5d27ec3 | /src/order/filter/basic.lean | 1f948f34a5455f243b9cb77df255a02cd6a34e2c | [
"Apache-2.0"
] | permissive | DanielFabian/mathlib | efc3a50b5dde303c59eeb6353ef4c35a345d7112 | f520d07eba0c852e96fe26da71d85bf6d40fcc2a | refs/heads/master | 1,668,739,922,971 | 1,595,201,756,000 | 1,595,201,756,000 | 279,469,476 | 0 | 0 | null | 1,594,696,604,000 | 1,594,696,604,000 | null | UTF-8 | Lean | false | false | 95,374 | 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, Jeremy Avigad
-/
import order.zorn
import order.copy
import data.set.finite
import tactic.monotonicity
/-!
# Theory of filters on sets
## Main definitions
* `filter`... |
1eea1d7d0351119e6b36362cb324ad7bd9b1d07b | cf798a5faaa43a993adcc42d1a99d5eab647e00b | /Induction.lean | a9e1153ab9d7fffd539b0bf87c37a92ddd7998eb | [] | no_license | myuon/lean-software-foundations | dbbcd37e3552b58c6e139370b16b25c69a42799b | a1a08810f2664493c920742c2d66a3131fb3ae75 | refs/heads/master | 1,610,261,785,986 | 1,459,922,839,000 | 1,459,922,839,000 | 50,269,716 | 4 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 3,480 | lean | import Basics
open bool nat
-- Exercise: 2 stars (andb_true_elim2)
theorem andb_true_elim2 : ∀ (b c : bool), b && c = tt → c = tt
| tt c := λp, by rewrite tt_band at p; apply p
| ff c := λp, by contradiction
theorem plus_0_l : ∀ (n : nat), 0 + n = n
| zero := rfl
| (succ n) := calc
0 + succ n = succ (0 + n) : rfl
... |
568e5b1abfd422b67e7b21760e9c1f6a77883e82 | 947b78d97130d56365ae2ec264df196ce769371a | /tests/lean/file_not_found.lean | 20f87dc7da03a8997872839b4e30e44617ca7b6c | [
"Apache-2.0"
] | permissive | shyamalschandra/lean4 | 27044812be8698f0c79147615b1d5090b9f4b037 | 6e7a883b21eaf62831e8111b251dc9b18f40e604 | refs/heads/master | 1,671,417,126,371 | 1,601,859,995,000 | 1,601,860,020,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 568 | lean | prelude
import Init.System.IO
new_frontend
open IO.FS
def usingIO {α} (x : IO α) := x
#eval (discard $ IO.FS.Handle.mk "non-existent-file.txt" Mode.read : IO Unit)
#eval usingIO do
condM (IO.fileExists "readonly.txt")
(pure ())
(IO.FS.withFile "readonly.txt" Mode.write $ fun _ => pure ());
IO.setAccessRight... |
2c603cb047f05144143e342b68ae6f1967ee5d4c | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/tactic/omega/nat/neg_elim.lean | 56825206d10d7314c72257053bab77752762dcf8 | [
"Apache-2.0"
] | permissive | lacker/mathlib | f2439c743c4f8eb413ec589430c82d0f73b2d539 | ddf7563ac69d42cfa4a1bfe41db1fed521bd795f | refs/heads/master | 1,671,948,326,773 | 1,601,479,268,000 | 1,601,479,268,000 | 298,686,743 | 0 | 0 | Apache-2.0 | 1,601,070,794,000 | 1,601,070,794,000 | null | UTF-8 | Lean | false | false | 4,161 | lean | /- Copyright (c) 2019 Seul Baek. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Seul Baek
Negation elimination. -/
import tactic.omega.nat.form
namespace omega
namespace nat
open_locale omega.nat
/-- push_neg p returns the result of normalizing ¬ p by
pushing th... |
48162b383ef5c5c522c5fb48c805e5b51ccef235 | ae1e94c332e17c7dc7051ce976d5a9eebe7ab8a5 | /tests/lean/server/edits.lean | a02855da212cba1d50f919dc2369a1dd21379bc2 | [
"Apache-2.0"
] | permissive | dupuisf/lean4 | d082d13b01243e1de29ae680eefb476961221eef | 6a39c65bd28eb0e28c3870188f348c8914502718 | refs/heads/master | 1,676,948,755,391 | 1,610,665,114,000 | 1,610,665,114,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,313 | lean | import Lean.Data.Lsp
open IO Lean Lsp
#exit
#eval (do
Ipc.runWith (←IO.appPath) #["--server"] do
let hIn ← Ipc.stdin
hIn.write (←FS.readBinFile "init_vscode_1_47_2.log")
hIn.flush
discard $ Ipc.readResponseAs 0 InitializeResult
Ipc.writeNotification ⟨"initialized", InitializedParams.mk⟩
hIn.... |
6a80d414abe9982b050238ebdbefe1ae9d2df3b6 | 6e9cd8d58e550c481a3b45806bd34a3514c6b3e0 | /src/field_theory/finite.lean | 2eb69f049e8e1dca5077f32c1cb200308695e51e | [
"Apache-2.0"
] | permissive | sflicht/mathlib | 220fd16e463928110e7b0a50bbed7b731979407f | 1b2048d7195314a7e34e06770948ee00f0ac3545 | refs/heads/master | 1,665,934,056,043 | 1,591,373,803,000 | 1,591,373,803,000 | 269,815,267 | 0 | 0 | Apache-2.0 | 1,591,402,068,000 | 1,591,402,067,000 | null | UTF-8 | Lean | false | false | 10,068 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Joey van Langen, Casper Putz
-/
import data.equiv.ring
import data.zmod.basic
import linear_algebra.basis
import ring_theory.integral_domain
/-!
# Finite fields
This fil... |
6d106f33ae8a15f5c26095c755c3a4ef5893c097 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/run/help_cmd.lean | 40e247fee6f5b9b7f3960c73f58562b01d98aa99 | [
"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 | 43 | lean | help options
help commands
print options
|
64bad0bf9f4bf3953575994b08f26b87966b0014 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/control/applicative.lean | ffa4df13e1e840d5e7cb548d2841b08382be9442 | [
"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,862 | lean | /-
Copyright (c) 2017 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
-/
import algebra.group.defs
import control.functor
/-!
# `applicative` instances
This file provides `applicative` instances for concrete functors:
* `id`
* `functor.comp`
*... |
882ea3f1e21fb9c688f95b1942905ace9c9cf03f | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch3/ex0201.lean | fbcd65f215bc2ae6d0d8c6bdbd0959d963902b24 | [] | no_license | Ailrun/Theorem_Proving_in_Lean | ae6a23f3c54d62d401314d6a771e8ff8b4132db2 | 2eb1b5caf93c6a5a555c79e9097cf2ba5a66cf68 | refs/heads/master | 1,609,838,270,467 | 1,586,846,743,000 | 1,586,846,743,000 | 240,967,761 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 77 | lean | constants p q : Prop
theorem t1 : p → q → p := λ hp : p, λ hq : q, hp
|
e4e35fc9fe67ce6706690cb6b12dd5314b8b4df1 | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /src/Lean/ParserCompiler.lean | 2811a8386d36f6bf69e661057885be5d7bc298bc | [
"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 | tobiasgrosser/lean4 | ce0fd9cca0feba1100656679bf41f0bffdbabb71 | ebdbdc10436a4d9d6b66acf78aae7a23f5bd073f | refs/heads/master | 1,673,103,412,948 | 1,664,930,501,000 | 1,664,930,501,000 | 186,870,185 | 0 | 0 | Apache-2.0 | 1,665,129,237,000 | 1,557,939,901,000 | Lean | UTF-8 | Lean | false | false | 7,515 | lean | /-
Copyright (c) 2020 Sebastian Ullrich. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
-/
import Lean.Meta.ReduceEval
import Lean.KeyedDeclsAttribute
import Lean.ParserCompiler.Attribute
import Lean.Parser.Extension
/-!
Gadgets for compiling parser ... |
3d173b440630b1b5ac2fec1bc4b1f584fe95994e | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/category_theory/adhesive.lean | e9762d9c6f4e490f6fa7780acb32dada08fde081 | [
"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 | 12,548 | lean | /-
Copyright (c) 2022 Andrew Yang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Andrew Yang
-/
import category_theory.extensive
import category_theory.limits.shapes.kernel_pair
/-!
# Adhesive categories
## Main definitions
- `category_theory.is_pushout.is_van_kamp... |
e30827696129dde1c65c5c6d9af7011530d592b5 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/order/jordan_holder.lean | f0110da75c6b08f4836d17bb60bab8974426a8c2 | [
"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,889 | lean | /-
Copyright (c) 2021 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import order.lattice
import data.list.sort
import data.equiv.fin
import data.equiv.functor
/-!
# Jordan-Hölder Theorem
This file proves the Jordan Hölder theorem for a `... |
4b549e0b5f050691a7ca4c8c8e9d79f5d1b236d7 | 7cdf3413c097e5d36492d12cdd07030eb991d394 | /world_experiments/world7/level12.lean | f9a9248df2e1f9fd3a95891066544e41a62a1e81 | [] | no_license | alreadydone/natural_number_game | 3135b9385a9f43e74cfbf79513fc37e69b99e0b3 | 1a39e693df4f4e871eb449890d3c7715a25c2ec9 | refs/heads/master | 1,599,387,390,105 | 1,573,200,587,000 | 1,573,200,691,000 | 220,397,084 | 0 | 0 | null | 1,573,192,734,000 | 1,573,192,733,000 | null | UTF-8 | Lean | false | false | 974 | lean | import mynat.definition -- hide
import mynat.add -- hide
import game.world2.level11 -- hide
namespace mynat -- hide
/-
# World 2 -- Addition World
## Level 12 -- `eq_zero_of_add_right_eq_self`
You have : the usual stuff.
* `succ_inj (a b : mynat) : succ(a) = succ(b) → a = b`
will be useful for this one.
You ... |
b2b46d4314dad1dfcceb56f236b71e9b18449156 | 5fbbd711f9bfc21ee168f46a4be146603ece8835 | /lean/natural_number_game/advanced_addition/10.lean | eea79fadeec8f882ce78711d6c599ea3a50ce048 | [
"LicenseRef-scancode-warranty-disclaimer"
] | no_license | goedel-gang/maths | 22596f71e3fde9c088e59931f128a3b5efb73a2c | a20a6f6a8ce800427afd595c598a5ad43da1408d | refs/heads/master | 1,623,055,941,960 | 1,621,599,441,000 | 1,621,599,441,000 | 169,335,840 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 157 | lean | lemma add_left_eq_zero {a b : mynat} (H : a + b = 0) : b = 0 :=
begin
cases b with d,
refl,
rw add_succ at H,
exfalso,
exact succ_ne_zero _ H,
end
|
9c6fde16692ba11c8744735b892c904f8261376f | 680b0d1592ce164979dab866b232f6fa743f2cc8 | /hott/types/fiber.hlean | 24a9f8e6c857ed24074942598c813b8e212e4b9e | [
"Apache-2.0"
] | permissive | syohex/lean | 657428ab520f8277fc18cf04bea2ad200dbae782 | 081ad1212b686780f3ff8a6d0e5f8a1d29a7d8bc | refs/heads/master | 1,611,274,838,635 | 1,452,668,188,000 | 1,452,668,188,000 | 49,562,028 | 0 | 0 | null | 1,452,675,604,000 | 1,452,675,602,000 | null | UTF-8 | Lean | false | false | 4,613 | hlean | /-
Copyright (c) 2015 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Floris van Doorn
Ported from Coq HoTT
Theorems about fibers
-/
import .sigma .eq .pi .pointed
structure fiber {A B : Type} (f : A → B) (b : B) :=
(point : A)
(point_eq : f poin... |
c37d0976d35a81b79bab25e2e912cc0bccb3f165 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/measure_theory/pi_auto.lean | ac1a05264ea602bc55ca95fc6529602a1f7a97cf | [] | 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 | 21,452 | lean | /-
Copyright (c) 2020 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.measure_theory.prod
import Mathlib.PostPort
universes u_1 u_2 u_3 u_4
namespace Math... |
eecec0790e8983b3ac452eab26858c7d74b80398 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/algebra/category/Group/colimits.lean | eba8807d36ce57db5022ae4934f98b5a9b28e842 | [
"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 | 9,723 | 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 algebra.category.Group.preadditive
import group_theory.quotient_group
import category_theory.limits.concrete_category
import category_theory.limits.shapes.kern... |
b119a0657f5657c87b7b893b07e60de3d0937839 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /stage0/src/Lean/Elab/Quotation.lean | 5eda0123019d5af77fff98db58ce1c7c7c3b7ee1 | [
"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 | 24,974 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
Elaboration of syntax quotations as terms and patterns (in `match_syntax`). See also `./Hygiene.lean` for the basic
hygiene workings and data types.
-/
import... |
889114abb14b9864d79315e9ccb12e3b665b748c | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/category_theory/limits/shapes/kernels.lean | 6d2bb59ea823d027f11ac454a492204c6c16da72 | [
"Apache-2.0"
] | permissive | gebner/mathlib | eab0150cc4f79ec45d2016a8c21750244a2e7ff0 | cc6a6edc397c55118df62831e23bfbd6e6c6b4ab | refs/heads/master | 1,625,574,853,976 | 1,586,712,827,000 | 1,586,712,827,000 | 99,101,412 | 1 | 0 | Apache-2.0 | 1,586,716,389,000 | 1,501,667,958,000 | Lean | UTF-8 | Lean | false | false | 9,704 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Markus Himmel
-/
import category_theory.limits.shapes.zero
import category_theory.limits.shapes.equalizers
/-!
# Kernels and cokernels
In a category with zero morphis... |
6c2d0eb6d2743abb54d5ffa02c7ca1e3103d8ddb | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /04_Quantifiers_and_Equality.org.19.lean | b3f2ffd176db4ba8480f1a303cdf849ad447744e | [] | 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 | 981 | lean | /- page 54 -/
import standard
import data.nat
open nat
-- BEGIN
example (x y : ℕ) : (x + y) * (x + y) = x * x + y * x + x * y + y * y :=
calc
(x + y) * (x + y) = (x + y) * x + (x + y) * y : mul.left_distrib
... = x * x + y * x + (x + y) * y : mul.right_distrib
... = x * x + y * x + (x * y + y * y) ... |
c0ab351dc0b32dadd1a19a9c442808a138570176 | 556aeb81a103e9e0ac4e1fe0ce1bc6e6161c3c5e | /src/starkware/cairo/common/cairo_secp/verification/verification/signature_recover_public_key_ec_mul_inner_soundness.lean | 095ab61e98373cf0df5254cf786defef39671ac7 | [] | permissive | starkware-libs/formal-proofs | d6b731604461bf99e6ba820e68acca62a21709e8 | f5fa4ba6a471357fd171175183203d0b437f6527 | refs/heads/master | 1,691,085,444,753 | 1,690,507,386,000 | 1,690,507,386,000 | 410,476,629 | 32 | 9 | Apache-2.0 | 1,690,506,773,000 | 1,632,639,790,000 | Lean | UTF-8 | Lean | false | false | 27,534 | lean | /-
File: signature_recover_public_key_ec_mul_inner_soundness.lean
Autogenerated file.
-/
import starkware.cairo.lean.semantics.soundness.hoare
import .signature_recover_public_key_code
import ..signature_recover_public_key_spec
import .signature_recover_public_key_fast_ec_add_soundness
import .signature_recover_public... |
b00dfa3133983b77234f0e87f243deda6e0357a7 | a721fe7446524f18ba361625fc01033d9c8b7a78 | /src/principia/mylist/sorting.lean | 0541f993979568aa8eac14d60e757643c8a1d879 | [] | no_license | Sterrs/leaning | 8fd80d1f0a6117a220bb2e57ece639b9a63deadc | 3901cc953694b33adda86cb88ca30ba99594db31 | refs/heads/master | 1,627,023,822,744 | 1,616,515,221,000 | 1,616,515,221,000 | 245,512,190 | 2 | 0 | null | 1,616,429,050,000 | 1,583,527,118,000 | Lean | UTF-8 | Lean | false | false | 18,585 | lean | import .mylist
import ..mynat.nat_sub
-- Sorting algorithms and permutations on lists of naturals
-- can probably be generalised to some type class thing
-- TODO: encode/state criterion for a sorting algorithm to
-- be stable, and prove it
-- more algorithms, obviously
namespace hidden
namespace mylist
open mynat
... |
bf6795808ac5d4038f05b2baa502422be74a6eb0 | bb31430994044506fa42fd667e2d556327e18dfe | /src/data/finset/n_ary.lean | 2ce67aac5c1c99e14748cffb7a864347ffe187c2 | [
"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 | 16,572 | lean | /-
Copyright (c) 2022 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.prod
/-!
# N-ary images of finsets
This file defines `finset.image₂`, the binary image of finsets. This is the finset version of
`set.image2`. This i... |
bd60aa2d90d1852d616c53256c36185b1160c777 | d450724ba99f5b50b57d244eb41fef9f6789db81 | /src/instructor/lectures/lecture_22.lean | 38b8ec969473f39f9efa477490803ff93982784e | [] | no_license | jakekauff/CS2120F21 | 4f009adeb4ce4a148442b562196d66cc6c04530c | e69529ec6f5d47a554291c4241a3d8ec4fe8f5ad | refs/heads/main | 1,693,841,880,030 | 1,637,604,848,000 | 1,637,604,848,000 | 399,946,698 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,115 | lean | import tactic.ring
/-
State formally and prove the proposition
that congruence mod n is an equivalence
relation. Follow the steps below.
-/
/-
First, we need to define congruence mod n.
Technically it is defined not only on the
natural numbers but on the integers.
Here's the English language definition:
Given a nat... |
3b2ee2ff7db752608ff2f5b33e887f099a58e8b8 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/data/nat/factorization/prime_pow.lean | ba7ee36067bb911d6faf94473a263d7f9bd0022d | [
"Apache-2.0"
] | permissive | ramonfmir/mathlib | c5dc8b33155473fab97c38bd3aa6723dc289beaa | 14c52e990c17f5a00c0cc9e09847af16fabbed25 | refs/heads/master | 1,661,979,343,526 | 1,660,830,384,000 | 1,660,830,384,000 | 182,072,989 | 0 | 0 | null | 1,555,585,876,000 | 1,555,585,876,000 | null | UTF-8 | Lean | false | false | 5,471 | lean | /-
Copyright (c) 2022 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta
-/
import algebra.is_prime_pow
import data.nat.factorization.basic
/-!
# Prime powers and factorizations
This file deals with factorizations of prime powers.
-/
variables... |
e51078a3f7fdca58776858b3e046690f04cb0e0d | ae1e94c332e17c7dc7051ce976d5a9eebe7ab8a5 | /tests/lean/run/forInPArray.lean | 17e8a1078b0b70f1d1754099f9cbea4a4c01de21 | [
"Apache-2.0"
] | permissive | dupuisf/lean4 | d082d13b01243e1de29ae680eefb476961221eef | 6a39c65bd28eb0e28c3870188f348c8914502718 | refs/heads/master | 1,676,948,755,391 | 1,610,665,114,000 | 1,610,665,114,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 840 | lean | #lang lean4
import Std
def check (x : IO Nat) (expected : IO Nat) : IO Unit := do
unless (← x) == (← expected) do
throw $ IO.userError "unexpected result"
def f1 (xs : Std.PArray Nat) (top : Nat) : IO Nat := do
let mut sum := 0
for x in xs do
if x % 2 == 0 then
IO.println s!"x: {x}"
sum := sum + x
if su... |
7533cd2ed289806a6ccf8569b5e8a8e5aa2dcb2f | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/category_theory/category/Cat.lean | cf80ad14a584608cf8a1392d03022436ef23a1d1 | [
"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 | 3,188 | lean | /-
Copyright (c) 2019 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import category_theory.concrete_category.bundled
import category_theory.discrete_category
import category_theory.types
import category_theory.bicategory.strict
/-!... |
5bda0b2f9787edca8a7405d5d9af7157dbbd9139 | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /stage0/src/Init/Data/Option/Basic.lean | 9952cf42695210ed0dd6db334235b25617e3cb80 | [
"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 | 2,106 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import Init.Core
import Init.Control.Basic
import Init.Coe
namespace Option
def toMonad [Monad m] [Alternative m] : Option α → m α
| none =>... |
6bbaa0bb647ef038596f7de9f255ade22db9d93d | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/measure_theory/group/geometry_of_numbers.lean | 63dea545779a21c77e60564b3ccaa40cec97ab17 | [
"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,091 | lean | /-
Copyright (c) 2021 Alex J. Best. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Alex J. Best
-/
import analysis.convex.measure
import measure_theory.group.fundamental_domain
import measure_theory.measure.lebesgue.eq_haar
/-!
# Geometry of numbers
> THIS FILE IS SY... |
6f472ef0466bf1f596c85b42c881aaee6aa5775d | 59a4b050600ed7b3d5826a8478db0a9bdc190252 | /src/category_theory/universal/limits_are_limit_cones.lean | 43cf01828c21a94f882cebcd14ac01a28c3b570a | [] | no_license | rwbarton/lean-category-theory | f720268d800b62a25d69842ca7b5d27822f00652 | 00df814d463406b7a13a56f5dcda67758ba1b419 | refs/heads/master | 1,585,366,296,767 | 1,536,151,349,000 | 1,536,151,349,000 | 147,652,096 | 0 | 0 | null | 1,536,226,960,000 | 1,536,226,960,000 | null | UTF-8 | Lean | false | false | 1,013 | lean | import category_theory.universal.cones
import category_theory.limits.terminal
open category_theory
namespace category_theory.limits
universes u v
variables {J : Type v} [small_category J] {C : Type u} [𝒞 : category.{u v} C]
include 𝒞
variable {F : J ⥤ C}
def limit_cone_of_limit {t : cone F} (L : is_limit t) : ... |
0655020cf58067944b59821e973631da05fbaf41 | ac1c2a2f522b0fdf854095ba00f882ca849669e7 | /library/init/meta/environment.lean | 55dd3539e5dc8500c207d997a54a9905ea22c99c | [
"Apache-2.0"
] | permissive | abliss/lean | b8b336abc8d50dbb0726dcff9dd16793c23bfbe1 | fb24cc99573c153f97a1951ee94bbbdda300b6be | refs/heads/master | 1,611,536,584,520 | 1,497,811,981,000 | 1,497,811,981,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,049 | 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.meta.declaration init.meta.exceptional init.data.option.basic
import init.meta.rb_map
meta constant environment : Type
namespace envir... |
1c4da65838deb07b7c57bc833c6c9151f96457cd | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/order/liminf_limsup.lean | 6d1d199cf67ccaea219ea697fad09e9947d01897 | [
"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 | 25,521 | lean | /-
Copyright (c) 2018 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel, Johannes Hölzl, Rémy Degenne
-/
import order.filter.cofinite
/-!
# liminfs and limsups of functions and filters
Defines the Liminf/Limsup of a function taking v... |
8566def2cc4d6afe6ad73ea6f632fcb7aebc2c1b | 735bb6d9c54e20a6bdc031c27bff1717e68886b9 | /data/seq/computation.lean | 809f30e8db62dbd31bb22bcce8efb55ace80e6d3 | [] | no_license | digama0/library_dev | 3ea441564c4d7eca54a562b701febaa4db6a1061 | 56520d5d1dda46d87c98bf3acdf850672fdab00f | refs/heads/master | 1,611,047,574,219 | 1,500,469,648,000 | 1,500,469,648,000 | 87,738,883 | 0 | 0 | null | 1,491,771,880,000 | 1,491,771,879,000 | null | UTF-8 | Lean | false | false | 34,512 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
Coinductive formalization of unbounded computations.
-/
import data.stream pending
universes u v w
/-
coinductive computation (α : Type u) : Type u
| return : α ... |
709f41d517a4e0422eaf858706b48eee4858f650 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/ring_theory/discriminant.lean | 21a559720dab7f00fc6662ae2cfa9e185730a746 | [
"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 | 16,422 | lean | /-
Copyright (c) 2021 Riccardo Brasca. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Riccardo Brasca
-/
import ring_theory.trace
import ring_theory.norm
import number_theory.number_field.basic
/-!
# Discriminant of a family of vectors
Given an `A`-algebra `B` and `... |
6d38cccaeec65e2179442295b2f195bfc6d5a430 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/multiset/bind.lean | 57946c5c01ecb383c5b4138afdb61490d2029620 | [
"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 | 9,679 | 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 algebra.big_operators.multiset.basic
/-!
# Bind operation for multisets
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corre... |
9bc8b4107ee6ec78f34f650505cc9dbe83a2f77a | ac076ebc286fa9b7a67171f6cd11eb98b263d6ef | /src/list_equiv.lean | 9fdeb3c231ca74038c683c512aa968ceb50d5391 | [] | no_license | Shamrock-Frost/jordan-holder | e891e489d00f8ff9e29c47b3083f22cac7804efb | bab3daccd70a4f3c5b25731b899a2cd72d7b8376 | refs/heads/master | 1,594,962,465,041 | 1,576,197,432,000 | 1,576,197,432,000 | 205,951,913 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,375 | lean | import .category_theory .SES
universe u
def equiv_group_lists (L₁ L₂ : list Group) :=
list.length L₁ = list.length L₂ ∧
∃ L, list.perm L L₁
∧ (list.foldr (∧) true
$ list.zip_with (λ K K' : Group, nonempty (K ≅ K')) L L₂)
def termwise_iso_symm
: ∀ {xs ys : list Group},
list.length xs = list.lengt... |
884181ee2f6184da2677524da29924be488a6c15 | 2eab05920d6eeb06665e1a6df77b3157354316ad | /src/set_theory/ordinal_notation.lean | f1668831052839b8d692e2fb561b3ef68a1baf22 | [
"Apache-2.0"
] | permissive | ayush1801/mathlib | 78949b9f789f488148142221606bf15c02b960d2 | ce164e28f262acbb3de6281b3b03660a9f744e3c | refs/heads/master | 1,692,886,907,941 | 1,635,270,866,000 | 1,635,270,866,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 35,964 | 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 set_theory.ordinal_arithmetic
/-!
# Ordinal notation
Constructive ordinal arithmetic for ordinals below `ε₀`.
We define a type `onote`, with constructors `... |
3191b9c8058409943d144228980c9f3f7975db54 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/ring_theory/ore_localization/ore_set.lean | 10fecbb77e85c677bca396ba24f894fd168dce99 | [
"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 | 3,861 | lean | /-
Copyright (c) 2022 Jakob von Raumer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jakob von Raumer, Kevin Klinge
-/
import group_theory.subgroup.basic
/-!
# (Right) Ore sets
This defines right Ore sets on arbitrary monoids.
## References
* https://ncatlab.org... |
6f8268f24b4065bdd4e7e2950a57fcd8af187cee | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/matrix2.lean | 024135ce62d69e0f08b26d9ad500c0b532b1d276 | [
"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 | 833 | lean | import logic
constant matrix.{l} : Type.{l} → Type.{l}
constant same_dim {A : Type} : matrix A → matrix A → Prop
constant add1 {A : Type} (m1 m2 : matrix A) {H : same_dim m1 m2} : matrix A
open eq
theorem same_dim_eq_args {A : Type} {m1 m2 m1' m2' : matrix A} (H1 : m1 = m1') (H2 : m2 = m2') (H : same_dim m1 m2) : same... |
5ee6d76c00f6e515d14977c7950a68bb97852a7e | 94e33a31faa76775069b071adea97e86e218a8ee | /src/group_theory/p_group.lean | 465062b3829f7526ffea5f006a7c8f5e5d569051 | [
"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 | 12,012 | lean | /-
Copyright (c) 2018 . All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Thomas Browning
-/
import data.zmod.basic
import group_theory.index
import group_theory.group_action.conj_act
import group_theory.group_action.quotient
import group_theory.perm.cycle.... |
f67f06c2fc067c0e5afda3b1fe44e4ff2690adf8 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Init/Data/Nat/Linear.lean | 4fa179874e142f104d1f911e56c7909ecfb4bbd0 | [
"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 | 29,995 | lean | /-
Copyright (c) 2022 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import Init.Coe
import Init.Classical
import Init.SimpLemmas
import Init.Data.Nat.Basic
import Init.Data.List.Basic
import Init.Data.Prod
namespace... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.