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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
ece4214492675315037a69b4f782e790e031a96c | 4fa118f6209450d4e8d058790e2967337811b2b5 | /src/for_mathlib/submodule.lean | ea6df418c05c9b5e072a9e09f0b2f7edfb0a5439 | [
"Apache-2.0"
] | permissive | leanprover-community/lean-perfectoid-spaces | 16ab697a220ed3669bf76311daa8c466382207f7 | 95a6520ce578b30a80b4c36e36ab2d559a842690 | refs/heads/master | 1,639,557,829,139 | 1,638,797,866,000 | 1,638,797,866,000 | 135,769,296 | 96 | 10 | Apache-2.0 | 1,638,797,866,000 | 1,527,892,754,000 | Lean | UTF-8 | Lean | false | false | 2,600 | lean | import ring_theory.noetherian
import ring_theory.algebra_operations
local attribute [instance] classical.prop_decidable
namespace submodule
open algebra
variables {R : Type*} {A : Type*} [comm_ring R] [comm_ring A] [algebra R A]
local attribute [instance] set.pointwise_mul_semiring
local attribute [instance] set.sin... |
57f3ee979956bc454f69759c7bf1ec9c3fd90b95 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/category_theory/concrete_category/basic.lean | a565d66e9e774c5370aad023cfd60be3f170258f | [
"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 | 8,147 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Johannes Hölzl, Reid Barton, Sean Leather, Yury Kudryashov
-/
import category_theory.types
import category_theory.epi_mono
/-!
# Concrete categories
A concrete catego... |
4690a2c94e190ee826bdd8fa86d279302726d73d | 618003631150032a5676f229d13a079ac875ff77 | /src/algebra/continued_fractions/continuants_recurrence.lean | 68ea94b4deab5489ed39a6a74f27ba92a4a3b87e | [
"Apache-2.0"
] | permissive | awainverse/mathlib | 939b68c8486df66cfda64d327ad3d9165248c777 | ea76bd8f3ca0a8bf0a166a06a475b10663dec44a | refs/heads/master | 1,659,592,962,036 | 1,590,987,592,000 | 1,590,987,592,000 | 268,436,019 | 1 | 0 | Apache-2.0 | 1,590,990,500,000 | 1,590,990,500,000 | null | UTF-8 | Lean | false | false | 3,429 | lean | /-
Copyright (c) 2019 Kevin Kappelmann. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Kappelmann
-/
import algebra.continued_fractions.translations
/-!
# Recurrence Lemmas for the `continuants` Function of Continued Fractions.
## Summary
Given a generalized co... |
3d72a667eea18a969bbf32d68c0b9f30f2815420 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/tactic/omega/nat/neg_elim.lean | 10923aeb461694929911d2ecc2a67ac0776c8318 | [
"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 | 4,168 | 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
pus... |
20465f00d003745207f8a69b402c44d87d45736a | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/topology/local_homeomorph.lean | d9dc464782000d32229d78bf2074f2bcc50c76f3 | [
"Apache-2.0"
] | permissive | waynemunro/mathlib | e3fd4ff49f4cb43d4a8ded59d17be407bc5ee552 | 065a70810b5480d584033f7bbf8e0409480c2118 | refs/heads/master | 1,693,417,182,397 | 1,634,644,781,000 | 1,634,644,781,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 47,444 | 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 data.equiv.local_equiv
import topology.opens
/-!
# Local homeomorphisms
This file defines homeomorphisms between open subsets of topological spaces. An... |
43565dc0947af20acccdd350e740d1a4d96333c0 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/1279.lean | 3062e5de05eb41642a1fa4d64557aedd7c8964fa | [
"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 | 2,613 | lean | inductive O
| int
| real
| bool
| unit
deriving Inhabited, BEq, Repr
-- only `Arrow.id` and `Arrow.comp` really matter for my problem
inductive Arrow : (_dom _cod : O) → Type
-- identity
| id : {α : O} → Arrow α α
-- `α → α` arrows
| unit : Arrow O.unit O.unit
| not : Arrow O.bool O.bool
| succᵢ : Arrow O... |
9f5b83471a783967c285c8ddd23ec48c1a17d60b | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/983.lean | 36a65ef8c770b86e4b645a0789aa6aa96a1f5358 | [
"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 | 706 | lean | import Lean
-- The `cases` tactic does not use `Lean.Meta.cases` under the hood,
-- so it is unaffected by this issue. We define a tactic
-- `mcases` that delegates to `Lean.Meta.cases`.
syntax (name := mcases) "mcases" ident : tactic
namespace Lean.Elab.Tactic
@[tactic mcases]
def evalMcases : Tactic
| `(tactic| mc... |
fa79ee5afb394eeeb721d7583bf9bd0c7ed47f38 | 952248371e69ccae722eb20bfe6815d8641554a8 | /src/proof_trace.lean | 9419af21c86aaad6ac8913151fae2288c2abebc6 | [] | no_license | robertylewis/lean_polya | 5fd079031bf7114449d58d68ccd8c3bed9bcbc97 | 1da14d60a55ad6cd8af8017b1b64990fccb66ab7 | refs/heads/master | 1,647,212,226,179 | 1,558,108,354,000 | 1,558,108,354,000 | 89,933,264 | 1 | 2 | null | 1,560,964,118,000 | 1,493,650,551,000 | Lean | UTF-8 | Lean | false | false | 10,831 | lean | import .datatypes .proof_reconstruction
namespace polya
open tactic
open proof_sketch
private meta def proof_sketch.trace_aux : string → proof_sketch → tactic string
| tab ⟨fact, reason, justifications⟩ :=
let line := tab ++ fact ++ " : " ++ reason ++ "\n" in
do js' ← justifications.mmap (proof_sketch.trace_au... |
c927a350b593e41382e194e5c73416bcdf5830c2 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/finsupp/fintype.lean | 9f776641e39f0377b964f562889036c2b0717086 | [
"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 | 1,124 | lean | /-
Copyright (c) 2022 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen, Alex J. Best
-/
import data.finsupp.defs
import data.fintype.basic
/-!
# Finiteness and infiniteness of `finsupp`
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes ... |
64d05687c54cb5aa62b9a75f407c479d854cfd6a | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/field_resolution.lean | ea5bcd42cc8f309eca6cc5e39790f8b3a471ab1a | [
"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 | 3,464 | lean | section structures
structure foo :=
(a : ℕ)
structure bar extends foo :=
(b : ℕ)
def foo.s : foo := {a := 37}
def bar.s : bar := {a := 17, b := 22}
-- (error) prefer "unknown identifier"
#check foo.c
-- true fields
#eval foo.s.a
#eval bar.s.a
#eval bar.s.b
-- anonymous field notation
#eval foo.s.1
#eval bar.s.1.1... |
9d245b28569b4e15413d9d0f9daa62d3d87a2fa5 | 42610cc2e5db9c90269470365e6056df0122eaa0 | /hott/types/prod.hlean | 38e4a08c7596928a558d99ce73ad9950e1ddc8bb | [
"Apache-2.0"
] | permissive | tomsib2001/lean | 2ab59bfaebd24a62109f800dcf4a7139ebd73858 | eb639a7d53fb40175bea5c8da86b51d14bb91f76 | refs/heads/master | 1,586,128,387,740 | 1,468,968,950,000 | 1,468,968,950,000 | 61,027,234 | 0 | 0 | null | 1,465,813,585,000 | 1,465,813,585,000 | null | UTF-8 | Lean | false | false | 9,690 | hlean | /-
Copyright (c) 2014 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
Ported from Coq HoTT
Theorems about products
-/
open eq equiv is_equiv is_trunc prod prod.ops unit
variables {A A' B B' C D : Type} {P Q : A → T... |
fe1d33a90f2b509844024aadba482d5c7f3a1f3e | 57fdc8de88f5ea3bfde4325e6ecd13f93a274ab5 | /data/set/intervals.lean | 8890813a9b2d28208aaf8d5ce03f1413c0101fc8 | [
"Apache-2.0"
] | permissive | louisanu/mathlib | 11f56f2d40dc792bc05ee2f78ea37d73e98ecbfe | 2bd5e2159d20a8f20d04fc4d382e65eea775ed39 | refs/heads/master | 1,617,706,993,439 | 1,523,163,654,000 | 1,523,163,654,000 | 124,519,997 | 0 | 0 | Apache-2.0 | 1,520,588,283,000 | 1,520,588,283,000 | null | UTF-8 | Lean | false | false | 3,179 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Johannes Hölzl
Intervals
Nameing conventions:
`i`: infinite
`o`: open
`c`: closed
Each interval has the name `I` + letter for left side + letter for right side
TODO: This is j... |
b88ac38c3cfd103a410842a7d32d5ec3046e3bcb | c31182a012eec69da0a1f6c05f42b0f0717d212d | /src/for_mathlib/Profinite/extend.lean | 06fa873dd253b222ca3ae422b14ac6cb0b277289 | [] | no_license | Ja1941/lean-liquid | fbec3ffc7fc67df1b5ca95b7ee225685ab9ffbdc | 8e80ed0cbdf5145d6814e833a674eaf05a1495c1 | refs/heads/master | 1,689,437,983,362 | 1,628,362,719,000 | 1,628,362,719,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,126 | lean | import topology.category.Profinite.as_limit
import for_mathlib.Fintype
noncomputable theory
namespace Profinite
open category_theory
open category_theory.limits
universes v u
variables {C : Type u} [category.{v} C] (F : Fintype.{v} ⥤ C)
/-- Change a cone with respect to a morphism from `Profinite`. -/
@[simps]
de... |
866d505d893f36621cad0ad6f51209f912248ffc | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebraic_topology/cech_nerve.lean | e6024e9ae55ca9497b6030d1be846dda48d3f3e7 | [
"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 | 16,461 | lean | /-
Copyright (c) 2021 Adam Topaz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Adam Topaz
-/
import algebraic_topology.simplicial_object
import category_theory.limits.shapes.wide_pullbacks
import category_theory.limits.shapes.finite_products
import category_theory.a... |
faa8316efff3a845b1b9b1ea97d07b08e4086590 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/analysis/normed_space/star/gelfand_duality.lean | 9c79754e4b49dce213a9e8ba6a59671ddb75411e | [
"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,881 | lean | /-
Copyright (c) 2022 Jireh Loreaux. All rights reserved.
Reeased under Apache 2.0 license as described in the file LICENSE.
Authors: Jireh Loreaux
-/
import analysis.normed_space.star.spectrum
import analysis.normed.group.quotient
import analysis.normed_space.algebra
import topology.continuous_function.units
import to... |
18b2c17eb676211448f0c2b7f326cdb362ca1c88 | 9db059bff49b1090a86ec0050ac6c577eb16ac67 | /src/meetings/basics.lean | a5e3a5790fe52f8a06fabb31d5d1d4d500f38b41 | [] | no_license | fpvandoorn/Harvard-tutoring | d64cd75c4c529009ee562c30e9cb245fe237e760 | a8846c08e32cdc7b91a7e28adfa5d9b2810088b0 | refs/heads/master | 1,680,870,428,641 | 1,617,022,194,000 | 1,617,022,194,000 | 330,297,467 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,293 | lean | import data.real.basic
import data.nat.prime
/-
Assuming you have Lean installed, you can follow along this by entering in the terminal:
```
leanproject get fpvandoorn/Harvard-tutoring
code Harvard-tutoring
```
and then open `src/meetings/basics.lean` (use `ctrl + P` and type `basics` to find this file).
### Agenda
- ... |
dc068d58dc063c1f57dfae517788686c3ebc755c | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/analysis/normed_space/operator_norm_auto.lean | 81ae8ed448e601401882a3b996dbd20bc7c08967 | [] | 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 | 52,817 | lean | /-
Copyright (c) 2019 Jan-David Salchow. 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
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.linear_algebra.finite_dimensional
import Mathlib.analysis... |
d7b0cb87cad5ae7d99fb90eafe9128fae2b36fe2 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /test/fresh_names.lean | a0c337039686571f8ce02048325fe0b3f551c80f | [
"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 | 992 | 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 tactic.fresh_names
open tactic
open native
example {α β γ δ ε θ} (a : α) (b : β) (c : γ) (d : δ) (e : ε) (f : θ) : true :=
begin
(do [a, b, c, d, e, f] ← ... |
5c6abc90a491c29b514d39c32c2bf3b05c3ca551 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/order/complete_lattice.lean | 32a017dad7375a08a3a0aea1895cf5f3058dfded | [
"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 | 60,704 | 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 data.bool.set
import data.nat.set
import data.ulift
import order.bounds.basic
import order.hom.basic
/-!
# Theory of complete lattices
> THIS FILE IS SYNCHRO... |
73d4e9a1f405f103bccdfe952824e449f8a5e3e9 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/traceClassScopes.lean | 18c153b77e42d7ce35aeaa6e211bbafdf4050dd6 | [
"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 | 382 | lean | import Lean
macro "t" t:interpolatedStr(term) : doElem =>
`(doElem| Macro.trace[Meta.debug] $t)
macro "tstcmd" : command => do
t "hello"
`(example : Nat := 1)
set_option trace.Meta.debug true in
tstcmd
open Lean Meta
macro "r" r:interpolatedStr(term) : doElem =>
`(doElem| trace[Meta.debug] $r)
set_option ... |
988609829dadfc853fb9cfba8e949a3c2c01f056 | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/topology/subset_properties.lean | e768b0e6f4a893325c7ef211f30d7c641f405cca | [
"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 | 59,026 | 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, Yury Kudryashov
-/
import topology.bases
import data.finset.order
import data.set.accumulate
/-!
# Properties of subsets of topological spaces
In this... |
7f4b58a9d8692d36ce80c95157464d18498e5b8f | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /src/Lean/Compiler/LCNF/Internalize.lean | 66816f935c89983d1eb983ab6810686812c88c82 | [
"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 | 6,097 | 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
-/
import Lean.Compiler.LCNF.Types
import Lean.Compiler.LCNF.Bind
import Lean.Compiler.LCNF.CompilerM
namespace Lean.Compiler.LCNF
private def refreshBinderN... |
ac4fc6edef3f2e196c95802c38370c3ffc6b2eae | 6cc23d886ccf271bfd0c9ca5d29cafb9c0be7bf5 | /src/LeanPlay/Extern.lean | 37bc10712e2c62cefed0b55fda332417575cbd5a | [] | no_license | Anderssorby/LeanPlay | d39b15dbc3441c2be5a4ea5adf8fe70c4648737b | 8fd63d98d02490060323f4c5117b9a7e8da50813 | refs/heads/main | 1,692,004,930,931 | 1,633,974,729,000 | 1,633,974,729,000 | 368,654,414 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 72 | lean | namespace LeanPlay
/- @[extern "bla"] -/
/- def foo2 (x : Nat) := x -/
|
5c2e884a6fe5648d6e5e6c92c326ede0fea20a81 | ea5678cc400c34ff95b661fa26d15024e27ea8cd | /sum_two_squares_prime.lean | 79c5d9df193781b6a10816b0046b27f49e4d84dc | [] | no_license | ChrisHughes24/leanstuff | dca0b5349c3ed893e8792ffbd98cbcadaff20411 | 9efa85f72efaccd1d540385952a6acc18fce8687 | refs/heads/master | 1,654,883,241,759 | 1,652,873,885,000 | 1,652,873,885,000 | 134,599,537 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,505 | lean | import data.nat.modeq data.nat.basic data.nat.prime data.int.basic tactic.norm_num tactic.ring
def int.prime : ℤ → Prop := λ x,nat.prime (int.nat_abs x)
theorem prime_dvd_mul {p m n : ℤ} (pp : int.prime p) : p ∣ m * n ↔ p ∣ m ∨ p ∣ n :=begin
have H:int.nat_abs p ∣int.nat_abs m * int.nat_abs n ↔ int.nat_abs p ∣ int... |
12a2c057f40f8e95f8763ccc17f69219fea3d917 | 491068d2ad28831e7dade8d6dff871c3e49d9431 | /library/theories/number_theory/bezout.lean | 1d941d018d115058eb4f688a147509f937871fd8 | [
"Apache-2.0"
] | permissive | davidmueller13/lean | 65a3ed141b4088cd0a268e4de80eb6778b21a0e9 | c626e2e3c6f3771e07c32e82ee5b9e030de5b050 | refs/heads/master | 1,611,278,313,401 | 1,444,021,177,000 | 1,444,021,177,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,804 | 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 ... |
774e42fe2f462c316b5e30927b7bd2d4cd8e4b9b | 02fbe05a45fda5abde7583464416db4366eedfbf | /tests/lean/run/mvar_beta_isdefeq.lean | eb87f7a04c62d1c04fab4cd682fc829d651220f8 | [
"Apache-2.0"
] | permissive | jasonrute/lean | cc12807e11f9ac6b01b8951a8bfb9c2eb35a0154 | 4be962c167ca442a0ec5e84472d7ff9f5302788f | refs/heads/master | 1,672,036,664,637 | 1,601,642,826,000 | 1,601,642,826,000 | 260,777,966 | 0 | 0 | Apache-2.0 | 1,588,454,819,000 | 1,588,454,818,000 | null | UTF-8 | Lean | false | false | 753 | lean | open tactic expr
set_option pp.all true
set_option trace.check true
-- ?m_1 =?= (λ x, ?m_1) unit.star
#eval do
m ← mk_meta_var `(Type),
let e :=
(lam `x binder_info.default (const ``unit []) m)
(const ``unit.star []),
is_def_eq m e
/-- similar to `mk_local_pis` but make meta variables instead of
local c... |
973f57ae205ff4853a66829b9a70d312fb4d5be7 | cd221f6f26a5eaa584034502e1f2667c8d5c069c | /src/hello_world.lean | e0fe1b53bf29a162213a67a463aafee9b4ffc27b | [] | no_license | NeilStrickland/lean_hello_world | 8487b02d463cb148c7ae5e44c7ad6bcced8922ab | f2cd1113e16a7e956e194a66cc3101b7ea324b34 | refs/heads/master | 1,587,743,393,549 | 1,550,847,133,000 | 1,550,847,133,000 | 172,084,162 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,551 | lean | theorem one_plus_one : 1 + 1 ≤ 2 :=
/-~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
This line states a theorem. Note that we need a colon between the
name of the theorem, and a := between the statement and the proof.
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~-/
b... |
ac0b2821c712c75cfcf67be9ec3294918049e439 | 08bd4ba4ca87dba1f09d2c96a26f5d65da81f4b4 | /src/Lean/Elab/PreDefinition/Basic.lean | 12323379d8371a20622ba520fcc6cec965999246 | [
"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",
"Apache-2.0",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | gebner/lean4 | d51c4922640a52a6f7426536ea669ef18a1d9af5 | 8cd9ce06843c9d42d6d6dc43d3e81e3b49dfc20f | refs/heads/master | 1,685,732,780,391 | 1,672,962,627,000 | 1,673,459,398,000 | 373,307,283 | 0 | 0 | Apache-2.0 | 1,691,316,730,000 | 1,622,669,271,000 | Lean | UTF-8 | Lean | false | false | 8,576 | 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.Compiler.NoncomputableAttr
import Lean.Util.CollectLevelParams
import Lean.Meta.AbstractNestedProofs
import Lean.Elab.RecAppSyntax
import Lean.E... |
6b5050976a5f538bd564ed21efe8654bc6fbe83c | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/data/nat/interval.lean | bc91571e011ce8eb99358d711561ac58a0a38b83 | [
"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 | 6,996 | 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
/-!
# Finite intervals of naturals
This file proves that `ℕ` is a `locally_finite_order` and calculates the cardinality of its
interva... |
ef51a2d1ea7bc97b9ec661640ef1631504a89531 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/interactive/rb_map_ts.lean | d597b5e7f7ec92281a0b372b1231b90b0936d049 | [
"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,164 | lean | meta def mytac :=
state_t (name_map nat) tactic
meta instance : monad mytac :=
state_t.monad _ _
meta instance : monad.has_monad_lift tactic mytac :=
monad.monad_transformer_lift (state_t (name_map nat)) tactic
meta instance (α : Type) : has_coe (tactic α) (mytac α) :=
⟨monad.monad_lift⟩
namespace mytac
meta def s... |
aa3c7ffc540128fddd9fdbf567e9322029b4a41f | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Compiler/IR/Boxing.lean | 75dc80277cc303e4d8036a1c4590f656e1da8c79 | [
"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 | 13,195 | 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
-/
import Lean.Runtime
import Lean.Compiler.ClosedTermCache
import Lean.Compiler.ExternAttr
import Lean.Compiler.IR.Basic
import Lean.Compiler.IR.CompilerM
imp... |
1a0c87fdc02fdeec94a842ff2c3225082be63ca6 | 9d2e3d5a2e2342a283affd97eead310c3b528a24 | /src/solutions/friday/topology.lean | b5aa78196652d7c8b7ccdaa8583f205876c0b34c | [] | 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 | 15,697 | lean | import topology.metric_space.basic
open_locale classical filter topological_space
namespace lftcm
open filter set
/-!
# Filters
## Definition of filters
-/
def principal {α : Type*} (s : set α) : filter α :=
{ sets := {t | s ⊆ t},
univ_sets := begin
-- sorry
tauto,
-- sorry
end,
sets_of_superset ... |
90cc08b1115edf369713ff10cbd8b4028bdd777b | 32025d5c2d6e33ad3b6dd8a3c91e1e838066a7f7 | /tests/lean/run/genindices.lean | 9b367cfe0726c40ff90055b3805ef49811098186 | [
"Apache-2.0"
] | permissive | walterhu1015/lean4 | b2c71b688975177402758924eaa513475ed6ce72 | 2214d81e84646a905d0b20b032c89caf89c737ad | refs/heads/master | 1,671,342,096,906 | 1,599,695,985,000 | 1,599,695,985,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 722 | lean | import Lean
universe u
inductive Pred : ∀ (α : Type u), List α → Type (u+1)
| foo {α : Type u} (l1 : List α) (l2 : List (Option α)) : Pred (Option α) l2 → Pred α l1
axiom goal : forall (α : Type u) (xs : List (List α)) (h : Pred (List α) xs), xs ≠ [] → xs = xs
open Lean
open Lean.Meta
def tst1 : MetaM Unit := do
c... |
8692a9c3e756ae0782db45fd5491c961330a5482 | e0f9ba56b7fedc16ef8697f6caeef5898b435143 | /src/algebra/ring.lean | c8d8814075bcbc382292ce7ae0c00f48e81f755a | [
"Apache-2.0"
] | permissive | anrddh/mathlib | 6a374da53c7e3a35cb0298b0cd67824efef362b4 | a4266a01d2dcb10de19369307c986d038c7bb6a6 | refs/heads/master | 1,656,710,827,909 | 1,589,560,456,000 | 1,589,560,456,000 | 264,271,800 | 0 | 0 | Apache-2.0 | 1,589,568,062,000 | 1,589,568,061,000 | null | UTF-8 | Lean | false | false | 30,819 | 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, Floris van Doorn, Amelia Livingston
-/
import algebra.group.with_one
import deprecated.group
import tactic.norm_cast
/-!
# Properties and homomorphism... |
e9ed1ca11ab81bb21181448c10a262d121c62031 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /src/Init/Control/Reader.lean | 53f67ab9fca4fe242c4b0e6544345665b309229c | [
"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 | 5,377 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
The Reader monad transformer for passing immutable State.
-/
prelude
import Init.Control.Lift
import Init.Control.Id
import Init.Control.Alternative
import I... |
b7632ba6545b91f0f7437c2381fb67011c116513 | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /tests/lean/linterMissingDocs.lean | 20c9629a03653c204590b942a75c2428ddf8b691 | [
"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 | 2,221 | lean | import Lean
set_option linter.all true
/-- A doc string -/
def hasDoc (x : Nat) := x
def noDoc (x : Nat) := x
private def auxDef (x : Nat) := x
namespace Foo
protected def noDoc2 (x : Nat) := x
end Foo
open Foo in
def openIn (x : Nat) := x
open Foo in
/-- A doc string -/
def openIn2 (x : Nat) := x
set_option pp... |
4e196844fde43d668d9dfaf5d89e0b44527bd07a | 4bcaca5dc83d49803f72b7b5920b75b6e7d9de2d | /stage0/src/Init/Data/Hashable.lean | 931725006d67c75f4c612794fb461ae94eedb88c | [
"Apache-2.0"
] | permissive | subfish-zhou/leanprover-zh_CN.github.io | 30b9fba9bd790720bd95764e61ae796697d2f603 | 8b2985d4a3d458ceda9361ac454c28168d920d3f | refs/heads/master | 1,689,709,967,820 | 1,632,503,056,000 | 1,632,503,056,000 | 409,962,097 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,100 | 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.UInt
import Init.Data.String
universe u
instance : Hashable Nat where
hash n := UInt64.ofNat n
instance [Hashable α] [Hashable ... |
5f8e639173b26f6b050a7489dbe0de10f6a21896 | 6b45072eb2b3db3ecaace2a7a0241ce81f815787 | /algebra/lattice/bounded_lattice_experiment.lean | ddf1aaa2c6889cde4855a0a49b1c9c83acbcad01 | [] | no_license | avigad/library_dev | 27b47257382667b5eb7e6476c4f5b0d685dd3ddc | 9d8ac7c7798ca550874e90fed585caad030bbfac | refs/heads/master | 1,610,452,468,791 | 1,500,712,839,000 | 1,500,713,478,000 | 69,311,142 | 1 | 0 | null | 1,474,942,903,000 | 1,474,942,902,000 | null | UTF-8 | Lean | false | false | 3,074 | 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
Defines bounded lattice type class hierarchy.
Includes the Prop and fun instances.
-/
import .basic_experiment
set_option old_structure_cmd true
universes u v
varia... |
e345ddf4846de779f7c71d6a0a7dd6883d2b4faa | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /stage0/src/Lean/Compiler/LCNF/Basic.lean | a62d1a3bf43c43729b1afb87dc574fb422f95ed6 | [
"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 | 18,945 | 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
-/
import Lean.Expr
namespace Lean.Compiler.LCNF
/-!
# Lean Compiler Normal Form (LCNF)
It is based on the [A-normal form](https://en.wikipedia.org/wiki/A-n... |
b93ad5b0b789ae37752e9db5c6137a6e703fed13 | 46125763b4dbf50619e8846a1371029346f4c3db | /src/measure_theory/lebesgue_measure.lean | e79d2091c3ce574495237b31fdbc73a4f625871e | [
"Apache-2.0"
] | permissive | thjread/mathlib | a9d97612cedc2c3101060737233df15abcdb9eb1 | 7cffe2520a5518bba19227a107078d83fa725ddc | refs/heads/master | 1,615,637,696,376 | 1,583,953,063,000 | 1,583,953,063,000 | 246,680,271 | 0 | 0 | Apache-2.0 | 1,583,960,875,000 | 1,583,960,875,000 | null | UTF-8 | Lean | false | false | 12,254 | 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
Lebesgue measure on the real line
-/
import measure_theory.measure_space measure_theory.borel_space
noncomputable theory
open classical set lattice filter
open nnreal (... |
2a49d6b5a28c700cb3aea0c039f2eba10a3f4996 | a4673261e60b025e2c8c825dfa4ab9108246c32e | /src/Lean/Util/FindExpr.lean | a060aa46ece0a7c911ead4fbfae2574050116ed6 | [
"Apache-2.0"
] | permissive | jcommelin/lean4 | c02dec0cc32c4bccab009285475f265f17d73228 | 2909313475588cc20ac0436e55548a4502050d0a | refs/heads/master | 1,674,129,550,893 | 1,606,415,348,000 | 1,606,415,348,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,272 | 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.Expr
namespace Lean
namespace Expr
namespace FindImpl
abbrev cacheSize : USize := 8192
structure State :=
(keys : Array Expr) -- Remark: o... |
19533a5fa3d35feecfe82f0727738a349b583de0 | e514e8b939af519a1d5e9b30a850769d058df4e9 | /src/tactic/rewrite_search/discovery/collector/default.lean | 32048f2a9108a38c249751bf76dc4e86fd9d86a1 | [] | no_license | semorrison/lean-rewrite-search | dca317c5a52e170fb6ffc87c5ab767afb5e3e51a | e804b8f2753366b8957be839908230ee73f9e89f | refs/heads/master | 1,624,051,754,485 | 1,614,160,817,000 | 1,614,160,817,000 | 162,660,605 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 33 | lean | import .bundle
import .everything |
8f7d68a8d705624a0758a6f8eb34043e27945921 | a6ea0e5de8b451a584e78d2a3a22466083fd8069 | /src/instructor/lecture_8.lean | ed4b8bf2faa8860bc60dd81ffaa963e726dcd018 | [] | no_license | simonejefferson03/cs2120f21 | cabf9bb8fd636cba947d3a33383a24a9efa51e1e | ee0edf0c5e6f66f28eafbc6787681065800eb7e5 | refs/heads/main | 1,692,061,780,990 | 1,631,910,003,000 | 1,631,910,003,000 | 399,946,493 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,758 | lean | /-
-/
theorem and_associatitive :
∀ (P Q R : Prop), (P ∧ Q) ∧ R → P ∧ (Q ∧ R) :=
begin
assume P Q R,
assume h,
have pq : P ∧ Q := and.elim_left h,
have p: P := and.elim_left pq,
have q: Q := and.elim_right pq,
have r: R := and.elim_right h,
exact and.intro p (and.intro q r ),
end
/-
The or connect... |
1a3a42fee288cd69ea3e89cf43a86a55444225ee | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/algebra/ring/prod.lean | 0b3cf15b55c83d906a9202abd40cf3339e974762 | [
"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 | 4,575 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Chris Hughes, Mario Carneiro, Yury Kudryashov
-/
import algebra.group.prod
import algebra.ring.basic
import data.equiv.ring
/-!
# Semiring, ring etc structures on `R ... |
b3ce8d819af432bd1de6a78afeb404f596af06c0 | 58840d1f4c8fba0ed6eb3a08b3c7491e28e2a4a2 | /SGDT/lift.lean | 11c7220c14bce43b66eb69892c59490e52e6ec57 | [] | no_license | jonsterling/lean4-sgdt | 7ba9f2ff2a21981f1d6517b86be1bee76e8d426e | 5858bfe96f2c5de8343c0f7befddd946ef6ce3e6 | refs/heads/master | 1,685,409,923,012 | 1,623,505,684,000 | 1,623,505,684,000 | 371,836,555 | 10 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,894 | lean | import sgdt.later
import sgdt.domain
def lift (A : Type u) : Type u :=
fix R =>
Sum A ([▷] R)
macro "[" a:term "]⊥" : term =>
`(lift $a:term)
namespace lift
def now (x : a) : [a]⊥ :=
ltr.fix.intro $ Sum.inl x
def step (x : ▷ [a]⊥) : [a]⊥ :=
ltr.fix.intro $ Sum.inr $ by
rw [dltr.red]
exact x
noncomput... |
1eb2b7d5dee924c563c71124f4562507b8041a4d | ee8cdbabf07f77e7be63a449b8483ce308d37218 | /lean/src/valid/mathd-algebra-37.lean | a41baedcd4891a6c1c3d7d89af38c44c82d8b3d5 | [
"MIT",
"Apache-2.0"
] | 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 | 378 | 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.real.basic
example (x y : ℝ) (h₀ : x + y = 7) (h₁ : 3 * x + y = 45) : x ^ 2 - y ^ 2 = 217 :=
begin
suffices: x = 19 ∧ y = -12,
{
rcases this with ⟨rfl, rf... |
89ed3e2c950e7ea92022280983126d75dded4b9f | bb31430994044506fa42fd667e2d556327e18dfe | /src/analysis/convex/cone/basic.lean | 599fea033385493db8a0a6bfb26e7283bbfe1a65 | [
"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 | 37,145 | lean | /-
Copyright (c) 2020 Yury Kudryashov All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov, Frédéric Dupuis
-/
import analysis.inner_product_space.projection
/-!
# Convex cones
In a `𝕜`-module `E`, we define a convex cone as a set `s` such that `a • x + b ... |
088d623729376e3362a54dc7c4b5585530ba3a4c | 59a4b050600ed7b3d5826a8478db0a9bdc190252 | /src/category_theory/sheaves.lean | 459bdd529d725bcdddf0f2b7a4f8000177b99408 | [] | 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 | 4,021 | lean | import category_theory.opposites
import category_theory.full_subcategory
import category_theory.universal.types
import category_theory.examples.topological_spaces
open category_theory
open category_theory.limits
open category_theory.examples.topological_spaces
universes u v u₁ v₁ u₂ v₂
section
variables (C : Type u₁... |
ea839757b00958fbc7a22529af6b1f5a30acd561 | 54deab7025df5d2df4573383df7e1e5497b7a2c2 | /data/set/default.lean | fbb49ecae6ef4308cfb97dd5c08b9bb0bd9ff0ea | [
"Apache-2.0"
] | permissive | HGldJ1966/mathlib | f8daac93a5b4ae805cfb0ecebac21a9ce9469009 | c5c5b504b918a6c5e91e372ee29ed754b0513e85 | refs/heads/master | 1,611,340,395,683 | 1,503,040,489,000 | 1,503,040,489,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 54 | lean | import data.set.lattice data.set.finite data.set.prod
|
00961b08ec27a1c0a07a3a59c1e8ad06778d66da | d1a52c3f208fa42c41df8278c3d280f075eb020c | /src/Init/Control/Except.lean | c0a42c1fa4246a16002423e53b8664a49c41c40d | [
"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 | 6,436 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jared Roesch, Sebastian Ullrich
The Except monad transformer.
-/
prelude
import Init.Control.Basic
import Init.Control.Id
import Init.Coe
namespace Except
variable {ε : Type u... |
68d3a7dae8c5f1c5d2f8d9331c3890b9e4fe653a | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/order/filter/basic.lean | 06fcaf2886a95676bc365a9a2a915529413fa3fa | [
"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 | 109,659 | 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`... |
6e364b76692557e6bcb7bd3e88f47b6906827f54 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/tactic/tfae.lean | 664e68d092282d7acb228c3185ebb1e86a5bf1cf | [
"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 | 4,961 | 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.
-/... |
41c48ae4f06e37052a322b07236d649cbb900a74 | ae1e94c332e17c7dc7051ce976d5a9eebe7ab8a5 | /stage0/src/Lean/Meta.lean | f7678f14d54820874677c8a046304e3f6c807e7f | [
"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 | 856 | 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
-/
import Lean.Meta.Basic
import Lean.Meta.LevelDefEq
import Lean.Meta.WHNF
import Lean.Meta.InferType
import Lean.Meta.FunInfo
import Lean.Meta.ExprDefEq
impo... |
3eff88757e22363983da7e3eba3dfcdf765f9500 | 8711b4976859218c98ea2129103249d693a4178b | /src/ontological_argument.lean | 2ed6b8595785003981cb0b1dfbfd31db10820b89 | [] | no_license | kendfrey/modal_logic | e2433c122ff7012aa743739283ceaa3451e41e79 | c07b5524de478cb57d796d0617b28990c7c77770 | refs/heads/master | 1,679,147,393,521 | 1,615,255,686,000 | 1,615,255,686,000 | 345,164,286 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,749 | lean | import modal_logic.basic
namespace ontological_argument
open modal_logic
open_locale modal_frame.universal
constant object : Type
variables [world.{0}] (w : World) (p q : object → MProp)
constant ex (x : object) : MProp
constant pos : (object → MProp) → MProp
axiom pos_of_imp_of_pos : w ⊩ □(λ v, ∀ x, v ⊩ ex x ⇒ p... |
7eb2d96c2766245b6d8a1d1a946612834f1fcc52 | b2fe74b11b57d362c13326bc5651244f111fa6f4 | /src/topology/uniform_space/basic.lean | 86f38180213cf94cabed3d0d11afde0647a07385 | [
"Apache-2.0"
] | permissive | midfield/mathlib | c4db5fa898b5ac8f2f80ae0d00c95eb6f745f4c7 | 775edc615ecec631d65b6180dbcc7bc26c3abc26 | refs/heads/master | 1,675,330,551,921 | 1,608,304,514,000 | 1,608,304,514,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 70,637 | 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, Patrick Massot
-/
import order.filter.lift
import topology.separation
/-!
# Uniform spaces
Uniform spaces are a generalization of metric spaces and top... |
51bbe3f018d79e0bfcaa9946a193886bcc4439f3 | 947b78d97130d56365ae2ec264df196ce769371a | /src/Lean/Compiler/InlineAttrs.lean | 92541a9ca95978795b767886b8a868d18351e1fa | [
"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 | 2,699 | 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
-/
import Lean.Attributes
import Lean.Compiler.Util
namespace Lean
namespace Compiler
inductive InlineAttributeKind
| inline | noinline | macroInline | inlin... |
9faac5e925a59ca46288e649d56888c4fe4d09fd | ea11767c9c6a467c4b7710ec6f371c95cfc023fd | /src/monoidal_categories/tensor_product.lean | aad0b68bacdc50e421439482acd08b827a96393e | [] | no_license | RitaAhmadi/lean-monoidal-categories | 68a23f513e902038e44681336b87f659bbc281e0 | 81f43e1e0d623a96695aa8938951d7422d6d7ba6 | refs/heads/master | 1,651,458,686,519 | 1,529,824,613,000 | 1,529,824,613,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,732 | 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
import categories.products.associator
import categories.natural_isomorphism
open categories
open categories.functor
open categories.products
open ... |
a8de82dc95dc3c9ad8ba2707553c401c25fb108d | 08bd4ba4ca87dba1f09d2c96a26f5d65da81f4b4 | /src/Lean/Expr.lean | e83b7ff970a2619c3a0d234dda3abdb39e07db34 | [
"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",
"Apache-2.0",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | gebner/lean4 | d51c4922640a52a6f7426536ea669ef18a1d9af5 | 8cd9ce06843c9d42d6d6dc43d3e81e3b49dfc20f | refs/heads/master | 1,685,732,780,391 | 1,672,962,627,000 | 1,673,459,398,000 | 373,307,283 | 0 | 0 | Apache-2.0 | 1,691,316,730,000 | 1,622,669,271,000 | Lean | UTF-8 | Lean | false | false | 62,331 | lean | /-
Copyright (c) 2018 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Data.KVMap
import Lean.Level
namespace Lean
/-- Literal values for `Expr`. -/
inductive Literal where
/-- Natural number literal -/
| natV... |
4610b5d9fb4a469b2879bf22bae5176c2ffe15f0 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/ring_theory/subring/basic.lean | 4df02ed3ade6b83a078965b3334fec0d37e9d9f4 | [
"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 | 48,699 | lean | /-
Copyright (c) 2020 Ashvni Narayanan. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Ashvni Narayanan
-/
import group_theory.subgroup.basic
import ring_theory.subsemiring.basic
/-!
# Subrings
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file re... |
83c3dc1f04f28a7de40f8d6128ab7415e1e59bcc | 5e3548e65f2c037cb94cd5524c90c623fbd6d46a | /src_icannos_totilas/applications_lineaires/cpge_applin_7.lean | ee33ef4d3802f992bf38d48a46444c6a1755b07e | [] | 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 | 341 | lean | import algebra.module.linear_map
import linear_algebra.basic
import data.real.basic
theorem cpge_applin_7
(R : Type*) (E : Type*) (F : Type*)
[field R]
[add_comm_group E] [module R E]
[add_comm_group F] [module R F]
(f : linear_map R E F) (A B : submodule R E):
f '' A ⊂ f '' B <-> (A + f.ker).carrier ⊂ (B + f.ker).... |
8a2d432bed46823dbbaa496ed4cd1aa3ccaf3730 | fffbc47930dc6615e66ece42324ce57a21d5b64b | /src/measure_theory/integration.lean | 541188273b37d0c593e46d9d44abf08515e53bcc | [
"Apache-2.0"
] | permissive | skbaek/mathlib | 3caae8ae413c66862293a95fd2fbada3647b1228 | f25340175631cdc85ad768a262433f968d0d6450 | refs/heads/master | 1,588,130,123,636 | 1,558,287,609,000 | 1,558,287,609,000 | 160,935,713 | 0 | 0 | Apache-2.0 | 1,544,271,146,000 | 1,544,271,146,000 | null | UTF-8 | Lean | false | false | 37,956 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Johannes Hölzl
Lebesgue integral on `ennreal`.
We define simple functions and show that each Borel measurable function on `ennreal` can be
approximated by a sequence ... |
d4fae629a1257e38eb6dc19ebe1fd17c8d9f5bd1 | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/field_theory/fixed.lean | fdd0023d0d1bc729c8c16a9ad273e869e96709d0 | [
"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 | 12,498 | lean | /-
Copyright (c) 2020 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import algebra.polynomial.group_ring_action
import deprecated.subfield
import field_theory.normal
import field_theory.separable
import field_theory.tower
import linear_algebra... |
610a1b8c044820de01fa9e2d0323f8d9423ce900 | 367134ba5a65885e863bdc4507601606690974c1 | /src/data/finset/fold.lean | 52e8b39eae6741d44cc4d6e34cde6012ac4b1d53 | [
"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 | 5,793 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
-/
import data.finset.basic
import data.multiset.fold
/-!
# The fold operation for a commutative associative operation over a finset.
-/
namespace finset
open multiset
... |
4685b6e5d589d9618f8f1fad70092f8abd62adb7 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/category_theory/adjunction/limits.lean | 8769609655f740c07ab1f78f920c58007c254990 | [
"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 | 12,786 | lean | /-
Copyright (c) 2019 Reid Barton. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Reid Barton, Johan Commelin
-/
import category_theory.adjunction.basic
import category_theory.limits.creates
/-!
# Adjunctions and limits
A left adjoint preserves colimits (`category_th... |
af55fc15790f5f418bcccfcf0b687cc5da2dbd35 | 4f065978c49388d188224610d9984673079f7d91 | /nested.lean | a339c14fb981bdca4e8f6352f66686181b980b73 | [] | no_license | kckennylau/Lean | b323103f52706304907adcfaee6f5cb8095d4a33 | 907d0a4d2bd8f23785abd6142ad53d308c54fdcb | refs/heads/master | 1,624,623,720,653 | 1,563,901,820,000 | 1,563,901,820,000 | 109,506,702 | 3 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 2,923 | lean | inductive nested : Type
| nest : list nested → nested
namespace nested
@[elab_as_eliminator] protected def cases_on' :
Π {C : nested → Sort*} (x : nested),
(Π (a : list nested), C (nest a)) → C x
| C (nest L) ih := ih L
@[simp] lemma cases_on'_def {C : nested → Sort*}
(L : list nested) (ih : Π (a : list nest... |
7807fd5f2033de8bd3f524535469c5b8a5755a16 | aa2345b30d710f7e75f13157a35845ee6d48c017 | /category_theory/whiskering.lean | cab0d6c36fc3f41b06db789f144401982f1d8196 | [
"Apache-2.0"
] | permissive | CohenCyril/mathlib | 5241b20a3fd0ac0133e48e618a5fb7761ca7dcbe | a12d5a192f5923016752f638d19fc1a51610f163 | refs/heads/master | 1,586,031,957,957 | 1,541,432,824,000 | 1,541,432,824,000 | 156,246,337 | 0 | 0 | Apache-2.0 | 1,541,434,514,000 | 1,541,434,513,000 | null | UTF-8 | Lean | false | false | 3,209 | lean | -- Copyright (c) 2018 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Scott Morrison
import category_theory.functor_category
namespace category_theory
universes u₁ v₁ u₂ v₂ u₃ v₃ u₄ v₄
variables (C : Type u₁) [𝒞 : category.{u₁ v₁} C]
... |
02f7aa7e46c668240bfe56c5e5b12c491cfa94f4 | 206422fb9edabf63def0ed2aa3f489150fb09ccb | /src/algebra/category/Module/basic.lean | ab424cf938fd0de6cb641a7336528fb7031f7f10 | [
"Apache-2.0"
] | permissive | hamdysalah1/mathlib | b915f86b2503feeae268de369f1b16932321f097 | 95454452f6b3569bf967d35aab8d852b1ddf8017 | refs/heads/master | 1,677,154,116,545 | 1,611,797,994,000 | 1,611,797,994,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,618 | lean | /-
Copyright (c) 2019 Robert A. Spencer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert A. Spencer, Markus Himmel
-/
import algebra.category.Group.basic
import category_theory.concrete_category
import category_theory.limits.shapes.kernels
import category_theory.... |
68665d86878bc237f854116cd1f772f034c55683 | 30b012bb72d640ec30c8fdd4c45fdfa67beb012c | /set_theory/cardinal.lean | f1b735ad1c800f12812dbf0377640194c3768b02 | [
"Apache-2.0"
] | permissive | kckennylau/mathlib | 21fb810b701b10d6606d9002a4004f7672262e83 | 47b3477e20ffb5a06588dd3abb01fe0fe3205646 | refs/heads/master | 1,634,976,409,281 | 1,542,042,832,000 | 1,542,319,733,000 | 109,560,458 | 0 | 0 | Apache-2.0 | 1,542,369,208,000 | 1,509,867,494,000 | Lean | UTF-8 | Lean | false | false | 29,760 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Johannes Hölzl, Mario Carneiro
Cardinal arithmetic.
Cardinals are represented as quotient over equinumerous types.
-/
import data.set.finite data.quot logic.schroeder_bernstein logic... |
055f1bd9fb16a65910ac7e18df748ba70428e2ae | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/topology/metric_space/algebra.lean | d591845e50bf14b735b737f5afe1e64e95b53e72 | [
"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 | 7,121 | lean | /-
Copyright (c) 2021 Heather Macbeth. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Heather Macbeth
-/
import topology.algebra.module
import topology.metric_space.lipschitz
/-!
# Compatibility of algebraic operations with metric space structures
In this file we def... |
aa7b35d0b489f46fc5cfec0118ae9e507735d373 | 297c4ceafbbaed2a59b6215504d09e6bf201a2ee | /dickson.lean | f2501f258894c8deb95eb65c7ecc4bf4361c624d | [] | no_license | minchaowu/Kruskal.lean3 | 559c91b82033ce44ea61593adcec9cfff725c88d | a14516f47b21e636e9df914fc6ebe64cbe5cd38d | refs/heads/master | 1,611,010,001,429 | 1,497,935,421,000 | 1,497,935,421,000 | 82,000,982 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,694 | lean | /-
Copyright (c) 2016 Minchao Wu. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Minchao Wu
-/
import tools.super
open classical nat function prod subtype super
noncomputable theory
theorem lt_or_eq_of_lt_succ {n m : ℕ} (H : n < succ m) : n < m ∨ n = m :=
lt_or_eq_... |
5b81f12166d414b037ab443cc1a2741c28d6fd06 | 30b012bb72d640ec30c8fdd4c45fdfa67beb012c | /analysis/topology/completion.lean | 718da0dc70d0163e44252ac58cc7c4dc337cd51e | [
"Apache-2.0"
] | permissive | kckennylau/mathlib | 21fb810b701b10d6606d9002a4004f7672262e83 | 47b3477e20ffb5a06588dd3abb01fe0fe3205646 | refs/heads/master | 1,634,976,409,281 | 1,542,042,832,000 | 1,542,319,733,000 | 109,560,458 | 0 | 0 | Apache-2.0 | 1,542,369,208,000 | 1,509,867,494,000 | Lean | UTF-8 | Lean | false | false | 55,283 | lean | /-
Copyright (c) 2018 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Johannes Hölzl
Hausdorff completions of uniform spaces; lifting the group and ring structure.
The goal is to construct a left-adjoint to the inclusion of complete Hau... |
27c7d98376db2596345c4986af3b55cbd1db19a6 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/ring_theory/derivation.lean | 69a1102635a3b5002ad75f4566658dcdd2d005a2 | [
"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 | 13,384 | lean | /-
Copyright © 2020 Nicolò Cavalleri. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nicolò Cavalleri
-/
import ring_theory.adjoin.basic
import algebra.lie.of_associative
/-!
# Derivations
This file defines derivation. A derivation `D` from the `R`-algebra `A` to th... |
2cc5d37162796b6648e199f7f6b940938b077745 | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /src/algebra/order/absolute_value.lean | b859e1bb078d390898c9917e586ff290674f5c4a | [
"Apache-2.0"
] | permissive | dexmagic/mathlib | ff48eefc56e2412429b31d4fddd41a976eb287ce | 7a5d15a955a92a90e1d398b2281916b9c41270b2 | refs/heads/master | 1,693,481,322,046 | 1,633,360,193,000 | 1,633,360,193,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,900 | lean | /-
Copyright (c) 2021 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Anne Baanen
-/
import algebra.order.field
/-!
# Absolute values
This file defines a bundled type of absolute values `absolute_value R S`.
## Main definitions
* `absol... |
9d0ee0618581d029739eaa30208825fd4894e6d0 | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /src/ring_theory/subsemiring.lean | be4fcbe7b15c9466f822799c9517c91a34c88201 | [
"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 | 22,469 | lean | /-
Copyright (c) 2020 Yury Kudryashov All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import ring_theory.prod
import group_theory.submonoid
import data.equiv.ring
/-!
# Bundled subsemirings
We define bundled subsemirings and some standard construct... |
1e05dc063fc0f9e5783b6c9ad4363fe0aee44326 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/measure_theory/function/egorov.lean | a982920ffed55c02150cc8d93e069d18519a5472 | [
"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 | 10,809 | lean | /-
Copyright (c) 2022 Kexing Ying. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kexing Ying
-/
import measure_theory.integral.set_integral
/-!
# Egorov theorem
This file contains the Egorov theorem which states that an almost everywhere convergent
sequence on a fin... |
4630ae8d758ada16c0fcc70075ba00a81fef86e2 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/measure_theory/borel_space.lean | 46be7ffa7f2514c91ea77adef3260deea75c7189 | [
"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 | 64,176 | 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, Yury Kudryashov
-/
import measure_theory.ae_measurable_sequence
import analysis.complex.basic
import analysis.normed_space.finite_dimension
import topology.G_delta
impo... |
326a0b6d49c460c908937736b13c262b1eda456d | 4bcaca5dc83d49803f72b7b5920b75b6e7d9de2d | /src/Lean/DocString.lean | 859df742bcffc32004cbdae13fa973ea37d7d9c4 | [
"Apache-2.0"
] | permissive | subfish-zhou/leanprover-zh_CN.github.io | 30b9fba9bd790720bd95764e61ae796697d2f603 | 8b2985d4a3d458ceda9361ac454c28168d920d3f | refs/heads/master | 1,689,709,967,820 | 1,632,503,056,000 | 1,632,503,056,000 | 409,962,097 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,470 | 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.MonadEnv
namespace Lean
private builtin_initialize docStringExt : MapDeclarationExtension String ← mkMapDeclarationExtension `docstring
def a... |
f2e954f546ae716a089a59ed0a55c7446a0e89d9 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/limits/shapes/finite_products_auto.lean | cd5f50fc42841926d945c81132318c056a4d27da | [] | 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 | 2,825 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.category_theory.limits.shapes.finite_limits
import Mathlib.category_theory.limits.shapes.bi... |
3f862f64a563c47c87f042d6327132cec063a61e | d642a6b1261b2cbe691e53561ac777b924751b63 | /src/topology/uniform_space/cauchy.lean | 69e7713b3451ea8c407a1096d1ac6e7ddb209064 | [
"Apache-2.0"
] | permissive | cipher1024/mathlib | fee56b9954e969721715e45fea8bcb95f9dc03fe | d077887141000fefa5a264e30fa57520e9f03522 | refs/heads/master | 1,651,806,490,504 | 1,573,508,694,000 | 1,573,508,694,000 | 107,216,176 | 0 | 0 | Apache-2.0 | 1,647,363,136,000 | 1,508,213,014,000 | Lean | UTF-8 | Lean | false | false | 16,340 | 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
Theory of Cauchy filters in uniform spaces. Complete uniform spaces. Totally bounded subsets.
-/
import topology.uniform_space.basic
open filter topolo... |
ebb79278564527dcf37058bf1e75b561f59e1a75 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/ring_theory/polynomial/rational_root.lean | e84e81b7f0a2c5e55e79a277091222225c08cbbf | [
"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 | 5,009 | lean | /-
Copyright (c) 2020 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen
-/
import ring_theory.polynomial.scale_roots
import ring_theory.localization
/-!
# Rational root theorem and integral root theorem
This file contains the rational root theo... |
8c23a0422fc0ae2398da9704749d3edfbba6b359 | 26ac254ecb57ffcb886ff709cf018390161a9225 | /src/ring_theory/subsemiring.lean | 0fcfe63f6acc885ad1ca1e8bc68eba369f0b65ad | [
"Apache-2.0"
] | permissive | eric-wieser/mathlib | 42842584f584359bbe1fc8b88b3ff937c8acd72d | d0df6b81cd0920ad569158c06a3fd5abb9e63301 | refs/heads/master | 1,669,546,404,255 | 1,595,254,668,000 | 1,595,254,668,000 | 281,173,504 | 0 | 0 | Apache-2.0 | 1,595,263,582,000 | 1,595,263,581,000 | null | UTF-8 | Lean | false | false | 24,624 | lean | /-
Copyright (c) 2020 Yury Kudryashov All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import ring_theory.prod
import group_theory.submonoid
import data.equiv.ring
/-!
# Bundled subsemirings
We define bundled subsemirings and some standard construct... |
93b61225f194359de0d20c33e709a30d9c94f8d6 | 799b5de27cebaa6eaa49ff982110d59bbd6c6693 | /mechanized/reduction.lean | b3fe688f3f8b28635a04a7a51eb3aca7ffecf9f9 | [
"MIT"
] | permissive | philnguyen/soft-contract | 263efdbc9ca2f35234b03f0d99233a66accda78b | 13e7d99e061509f0a45605508dd1a27a51f4648e | refs/heads/master | 1,625,975,131,435 | 1,617,775,585,000 | 1,617,775,704,000 | 17,326,137 | 33 | 7 | MIT | 1,613,722,535,000 | 1,393,714,126,000 | Racket | UTF-8 | Lean | false | false | 3,498 | lean | import definitions metafunctions assumptions
-- Reduction
inductive r: s → s → Prop
-- simple
| n : ∀ {ρ κ σ n},
r ⟨E.ev (e.n n) ρ , κ, σ⟩
⟨E.rt (A.V (V.n n)), κ, σ⟩
| s : ∀ {ρ κ σ},
r ⟨E.ev e.s ρ , κ, σ⟩
⟨E.rt (A.V V.s), κ, σ⟩ -- not allocated in store yet... |
ac11d1f79785be5163d5e268dacf71bf40e3c85f | 94e33a31faa76775069b071adea97e86e218a8ee | /src/field_theory/adjoin.lean | 3f4411f26157248bd3bd618a14906f60e508ef0f | [
"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 | 37,862 | lean | /-
Copyright (c) 2020 Thomas Browning, Patrick Lutz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Thomas Browning, Patrick Lutz
-/
import field_theory.intermediate_field
import field_theory.separable
import ring_theory.tensor_product
/-!
# Adjoining Elements to Fie... |
9b5df9893648675f5a1f41245641b3cb2dd016b3 | 3c9dc4ea6cc92e02634ef557110bde9eae393338 | /src/Init/Control/Reader.lean | 0a5e94a0065a03200fd84847c3542c27fc8f4f36 | [
"Apache-2.0"
] | permissive | shingtaklam1324/lean4 | 3d7efe0c8743a4e33d3c6f4adbe1300df2e71492 | 351285a2e8ad0cef37af05851cfabf31edfb5970 | refs/heads/master | 1,676,827,679,740 | 1,610,462,623,000 | 1,610,552,340,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 966 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
The Reader monad transformer for passing immutable State.
-/
prelude
import Init.Control.Basic
import Init.Control.Id
import Init.Control.Except
namespace Re... |
624037e9df85042f79220596b467f68854bc20dd | 7b66d83f3b69dae0a3dfb684d7ebe5e9e3f3c913 | /src/exercises_sources/wednesday/afternoon/topological_spaces.lean | 2ec5fcb6751c296a86e1e9a7cdc1d2ad7a48a8c2 | [] | permissive | dpochekutov/lftcm2020 | 58a09e10f0e638075b97884d3c2612eb90296adb | cdfbf1ac089f21058e523db73f2476c9c98ed16a | refs/heads/master | 1,669,226,265,076 | 1,594,629,725,000 | 1,594,629,725,000 | 279,213,346 | 1 | 0 | MIT | 1,594,622,757,000 | 1,594,615,843,000 | null | UTF-8 | Lean | false | false | 7,307 | lean | import tactic
import data.set.finite
/-
# (Re)-Building topological spaces in Lean
Mathlib has a large library of results on topological spaces, including various construcions,
separation axioms, Tychonoff's theorem, sheaves, Stone-Čech compactification, Heine-Cantor, to name
but a few.
See https://leanprover-communi... |
6b0c887823e468fe6cdfb57414fbbb1c6158601f | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/topology/continuous_function/bounded.lean | fba034246cecd549020643692d05af8dd421648b | [
"Apache-2.0"
] | permissive | hikari0108/mathlib | b7ea2b7350497ab1a0b87a09d093ecc025a50dfa | a9e7d333b0cfd45f13a20f7b96b7d52e19fa2901 | refs/heads/master | 1,690,483,608,260 | 1,631,541,580,000 | 1,631,541,580,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 42,464 | 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, Mario Carneiro, Yury Kudryashov, Heather Macbeth
-/
import analysis.normed_space.operator_norm
import topology.continuous_function.algebra
/-!
# Bounded continuo... |
e40412553eacaee97b9cdfb1f24a135340b55997 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/lambda_lift_after_erase_trivial.lean | 03e25eeb40d3b5cb888999de16ffb18a9ee53326 | [
"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 | 128 | lean | structure box (α : Type) :=
(val : α)
set_option trace.compiler.lambda_lifting true
def f1 : box (ℕ → ℕ) :=
box.mk id
|
4bca1e79e9fff0b8366c83f69e54473d5d11c210 | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /stage0/src/Lean/Compiler/LCNF/JoinPoints.lean | 0c0505e4fa85a29e6b0f3165a60c89554fdd5f81 | [
"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 | 8,474 | lean | /-
Copyright (c) 2022 Henrik Böving. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Henrik Böving
-/
import Lean.Compiler.LCNF.CompilerM
import Lean.Compiler.LCNF.PassManager
namespace Lean.Compiler.LCNF
namespace JoinPointFinder
/--
Info about a join point candidat... |
7008457ba3e6e1cad3e955cf877305c201474b92 | 92b50235facfbc08dfe7f334827d47281471333b | /library/data/nat/pairing.lean | ce2690cfc8b3fdcab67795759251d6b42aa145f4 | [
"Apache-2.0"
] | permissive | htzh/lean | 24f6ed7510ab637379ec31af406d12584d31792c | d70c79f4e30aafecdfc4a60b5d3512199200ab6e | refs/heads/master | 1,607,677,731,270 | 1,437,089,952,000 | 1,437,089,952,000 | 37,078,816 | 0 | 0 | null | 1,433,780,956,000 | 1,433,780,955,000 | null | UTF-8 | Lean | false | false | 2,571 | 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
Elegant pairing function.
-/
import data.nat.sqrt data.nat.div
open prod decidable
namespace nat
definition mkpair (a b : nat) : nat :=
if a < b then b*b + a... |
cf39882fb9efac217c575937a9c049b39470c482 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Meta/Tactic/LinearArith/Nat/Basic.lean | 250e3aa77159f7cd78618432d4514a6b43e10acf | [
"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 | 5,671 | 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
-/
import Lean.Meta.Check
import Lean.Meta.Offset
import Lean.Meta.KExprMap
namespace Lean.Meta.Linear.Nat
deriving instance Repr for Nat.Linear.Expr
derivin... |
0c2458d3d8b73757149580ea37f163a3303bd71b | 5d166a16ae129621cb54ca9dde86c275d7d2b483 | /tests/lean/dsimp_whnf.lean | fe395c0aba2a9086a858cf1340d5538f274d11b6 | [
"Apache-2.0"
] | permissive | jcarlson23/lean | b00098763291397e0ac76b37a2dd96bc013bd247 | 8de88701247f54d325edd46c0eed57aeacb64baf | refs/heads/master | 1,611,571,813,719 | 1,497,020,963,000 | 1,497,021,515,000 | 93,882,536 | 1 | 0 | null | 1,497,029,896,000 | 1,497,029,896,000 | null | UTF-8 | Lean | false | false | 105 | lean | open tactic
example (a b : nat) : ((a + 1, b).1) = a + 1 :=
by do
dsimp,
trace_state,
reflexivity
|
1234d39e25d2b8568d47ff80a680b14798f45927 | dfbd4b284cc03e870b12af5532c592e0ad8d02f1 | /M1F/2017-18/Example_Sheet_02/solutions.lean | 3b5d8d44eeb3de68dcc5889618d8905925ccaf84 | [] | no_license | Shamrock-Frost/xena | 7a1e27df933f9321584e6256c0319e5a1afb9a38 | 9eb0c2c23363b963a2ebb2ea5bb37cc7dd602b1a | refs/heads/master | 1,626,672,528,677 | 1,509,140,744,000 | 1,509,140,744,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,614 | lean | import xenalib.M1Fstuff
-- automatic coercions to reals
section M1F_Sheet02
-- #check arbitrary
-- #print arbitrary
-- #check default
-- #print default
-- ask about this
/-
example : arbitrary = default :=
begin
unfold eq,
end
-/
-- set_option pp.all true
def countable_union_from_zero {α : Type} (X : nat → ... |
e7acc1198969e91cc376ee961d3152d60ba0adef | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/algebra/module/submodule.lean | c1cdfcc386bc5a623b7dcb55b3d87c0c459531d8 | [
"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 | 6,865 | lean | /-
Copyright (c) 2015 Nathaniel Thomas. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nathaniel Thomas, Jeremy Avigad, Johannes Hölzl, Mario Carneiro
-/
import algebra.module.basic
/-!
# Submodules of a module
In this file we define
* `submodule R M` : a subset of ... |
deeb6e9c5abbc80d567318fdded6011cf0701eef | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/order/rel_iso.lean | cd45ebfd43e6f5579d8925f62ef5c71cf097146f | [
"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 | 23,767 | 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 logic.embedding
import order.rel_classes
import data.fin
open function
universes u v w
variables {α : Type*} {β : Type*} {γ : Type*}
{r : α → α → Prop} {s ... |
23fed1a001c0e574c4b1123b19e057d2a7cbf5b2 | 5e3548e65f2c037cb94cd5524c90c623fbd6d46a | /AMC_2021_A_4.lean | 8adbc3b487b7bf831b8bead10a5dae51ce91133c | [] | 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 | 315 | lean | import number_theory.divisors
theorem AMC_2021_A_4 (add substract happy purple snake:finset ℕ)
(h1:happy⊂snake)
(h2:purple⊂snake)
(h3: ∀(i:ℕ), i∈ purple → ¬(i∈substract))
(h4:∀(i:ℕ),¬(i∈substract)→¬(i∈add))
(h5:happy⊂add): ∀(i:ℕ),i∈happy → ¬(i∈purple)
:=
begin
sorry
end |
6822dde5af7433ccfffb90bc4547d2d6334ed123 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/lean/run/kernel2.lean | 5df67b10293f76c279f95b8134ae285b4f213758 | [
"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 | 1,163 | lean | import Init.Lean
open Lean
def checkDefEq (a b : Name) : MetaIO Unit := do
env ← MetaIO.getEnv;
let a := mkConst a;
let b := mkConst b;
let r := Kernel.isDefEq env {} a b;
IO.println (toString a ++ " =?= " ++ toString b ++ " := " ++ toString r)
def whnf (a : Name) : MetaIO Unit := do
env ← MetaIO.getEnv;
let a := mkC... |
3c21edcc1fbca5e03754f812d71a60860b0f34ce | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Compiler/IR/ElimDeadBranches.lean | 60f08ce73159f5c9271b12de7db67b95a4798ddd | [
"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 | 11,978 | 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
-/
import Lean.Compiler.IR.Format
import Lean.Compiler.IR.Basic
import Lean.Compiler.IR.CompilerM
namespace Lean.IR.UnreachableBranches
/-- Value used in the... |
53a8da9abfdd4941def33a4a86769385d791e54c | fe25de614feb5587799621c41487aaee0d083b08 | /stage0/src/Lean/Compiler/InitAttr.lean | ce923cb5d66a525ddb1cb19c9e352c213b21b95d | [
"Apache-2.0"
] | permissive | pollend/lean4 | e8469c2f5fb8779b773618c3267883cf21fb9fac | c913886938c4b3b83238a3f99673c6c5a9cec270 | refs/heads/master | 1,687,973,251,481 | 1,628,039,739,000 | 1,628,039,739,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,277 | 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
-/
import Lean.Environment
import Lean.Attributes
namespace Lean
private def getIOTypeArg : Expr → Option Expr
| Expr.app (Expr.const `IO _ _) arg _ => som... |
13cb7a6ae1be829c496dde457f2e3876b54821de | 6907139ba860f4234626534235c23704e718e777 | /mod5/lean/submission.lean | b0fa5b22aa4b0e2fddc11ffe4a5bc9095d158b87 | [] | no_license | maxhaslbeck/ProvingForFun-July2019 | 101e86ba92ad7e6c2522c0b71d868a61d2e3a864 | ea3cf3a41168da50e785621c4ee6612895bdf599 | refs/heads/master | 1,593,676,734,031 | 1,568,277,853,000 | 1,568,277,853,000 | 201,464,853 | 1 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 308 | lean | -- Solution by Chris Hughes https://github.com/ChrisHughes24
import data.zmod.basic tactic.fin_cases
theorem mod_power_five (n : ℕ) : n % 10 = (n ^ 5) % 10 :=
have h : ∀ (n : zmod 10), n = n ^ 5, from dec_trivial,
(zmod.eq_iff_modeq_nat' (show 0 < 10, from dec_trivial)).1 $
by rw [h n, nat.cast_pow]
|
ec0258df0a65f6b173ad5f232adaa6f990b61292 | 32c054a763e4aa96bcb6e8bc87775e0f403a1804 | /src/proptest_run.lean | b931f9a04ee1397051dec79478ecad9ec22c2c9e | [
"LicenseRef-scancode-generic-cla",
"MIT"
] | permissive | Claudiusgonzo/AliveInLean | 7fac3f82722c27acc5551260ea12a36519f6e24e | a21bfb90dee0c6c6e00a955b6de92c631198c5ba | refs/heads/master | 1,635,381,727,801 | 1,555,783,536,000 | 1,555,783,536,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,053 | lean | -- Copyright (c) Microsoft Corporation. All rights reserved.
-- Licensed under the MIT license.
import system.io
import .smtexpr
import .smtcompile
import .spec.spec
import .proptest
import .spec.lemmas
open tactic
open spec
axiom inteq: (3:int) = 3
axiom inteq2: (3:int) = 1+2
axiom forall1 : ∀ (x:int), x = x
axiom ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.