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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1cdc1b9f7598e411cb2a6eb8f970427dd0e27af6 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/analysis/ODE/picard_lindelof.lean | 9d470e9397d304d22bef7e79eea647740b4ac3ff | [
"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 | 19,997 | lean | /-
Copyright (c) 2021 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov, Winston Yin
-/
import analysis.special_functions.integrals
import topology.metric_space.contracting
/-!
# Picard-Lindelöf (Cauchy-Lipschitz) Theorem
In this f... |
53e47f591318b35c0599e8c1cd0ea5a0e69c6120 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/data/pfunctor/multivariate/W.lean | e3da749fdbf36eb5a51dc986b2e9f5726c5768c2 | [
"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,494 | lean | /-
Copyright (c) 2018 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad, Simon Hudon
-/
import data.pfunctor.multivariate.basic
/-!
# The W construction as a multivariate polynomial functor.
W types are well-founded tree-like structures. They... |
38baccb70de7949fb0f0f629535b8df1484da437 | 46125763b4dbf50619e8846a1371029346f4c3db | /src/data/nat/cast.lean | b71d519538f8216fd71670fb0c523cace5068c66 | [
"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 | 4,936 | lean | /-
Copyright (c) 2014 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
Natural homomorphism from the natural numbers into a monoid with one.
-/
import tactic.interactive algebra.order algebra.ordered_group algebra.ring
import tactic.norm_c... |
91491bfdd9c766c374418318f815e494e7503c4d | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/data/nat/bitwise.lean | 639ce91794a1068a445fcf7ff8903caf1bf43304 | [] | 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 | 7,244 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.data.nat.lemmas
import Mathlib.Lean3Lib.init.meta.well_founded_tactics
universes u
namespace Mathlib
n... |
2db13c80c05c562814e5b388523502ddbb4e140d | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/analysis/convex/join.lean | 1080ba9973642cf3cda6905794523ba594fb126b | [
"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 | 10,205 | 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 analysis.convex.combination
/-!
# Convex join
This file defines the convex join of two sets. The convex join of `s` and `t` is the union of the
segments with one... |
b2061da11e8f4534dc154fc66a3ce466aa4340a5 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/propagateExpectedType.lean | 44b313e357211903eb1cc0711465ebb1c1b5a076 | [
"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 | 1,474 | lean | variable {α : Type _} (r : α → α → Prop) (π : α → α)
inductive rel : α → α → Prop
| of {x y} : r x y → rel x y
| compat {x y} : rel x y → rel (π x) (π y)
| refl (x) : rel x x
| symm {x y} : rel x y → rel y x
| trans {x y z} : rel x y → rel y z → rel x z
def thing : Setoid α := ⟨rel r π, ⟨rel.refl, rel.symm, rel.trans... |
14bfa81ec541e33cc3f0d8680004afa2fe77a0fb | 08bd4ba4ca87dba1f09d2c96a26f5d65da81f4b4 | /src/Init/Data/Nat/Linear.lean | 667af7dfce7795d40eceada3e54ca36b70944152 | [
"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 | 30,031 | 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... |
8162d17257155c5e1b55236aed72e8d9b5f18530 | 07c6143268cfb72beccd1cc35735d424ebcb187b | /src/topology/basic.lean | 371f24725434eb337924272508b50c4448c2ed29 | [
"Apache-2.0"
] | permissive | khoek/mathlib | bc49a842910af13a3c372748310e86467d1dc766 | aa55f8b50354b3e11ba64792dcb06cccb2d8ee28 | refs/heads/master | 1,588,232,063,837 | 1,587,304,803,000 | 1,587,304,803,000 | 176,688,517 | 0 | 0 | Apache-2.0 | 1,553,070,585,000 | 1,553,070,585,000 | null | UTF-8 | Lean | false | false | 35,661 | 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, Jeremy Avigad
-/
import order.filter order.filter.bases
/-!
# Basic theory of topological spaces.
The main definition is the type class `topological ... |
47070a1ab3945449451dd697e87ac9a71ce1903f | f3849be5d845a1cb97680f0bbbe03b85518312f0 | /tests/lean/mismatch.lean | 0bd9d1e6aedd2af6d8660bbfd68ea7c7721d10af | [
"Apache-2.0"
] | permissive | bjoeris/lean | 0ed95125d762b17bfcb54dad1f9721f953f92eeb | 4e496b78d5e73545fa4f9a807155113d8e6b0561 | refs/heads/master | 1,611,251,218,281 | 1,495,337,658,000 | 1,495,337,658,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 83 | lean | -- definition id {A : Type} {a : A} := a
definition o : num := 1
#check @id nat o
|
d29daecd3435f75e3c22253a320ad335e83a5076 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/system/io.lean | ccfdcad74a86a36c2082fcf7346969d06601a096 | [] | 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 | 6,986 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Luke Nelson, Jared Roesch and Leonardo de Moura
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.Lean3Lib.system.io_interface
universes u_1
nam... |
3299bf7fb4917863ddfed4b91bb71f40bd474e06 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /script/reformat.lean | 54cf2b7e5264e406bb4c10fa1f266968236e9826 | [
"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 | 2,919 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner
-/
import Lean
open Lean Elab PrettyPrinter
partial def getCommands (cmds : Syntax) : StateT (Array Syntax) Id Unit := do
if cmds.getKind == nullKind || cmds.ge... |
d210ef39fc83abf2632c6e2a6e1d153dbf496349 | b3fced0f3ff82d577384fe81653e47df68bb2fa1 | /src/data/real/ennreal.lean | e0e6188efd3e3de078a8bddb5fffc6b309eab169 | [
"Apache-2.0"
] | permissive | ratmice/mathlib | 93b251ef5df08b6fd55074650ff47fdcc41a4c75 | 3a948a6a4cd5968d60e15ed914b1ad2f4423af8d | refs/heads/master | 1,599,240,104,318 | 1,572,981,183,000 | 1,572,981,183,000 | 219,830,178 | 0 | 0 | Apache-2.0 | 1,572,980,897,000 | 1,572,980,896,000 | null | UTF-8 | Lean | false | false | 30,799 | 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
Extended non-negative reals
-/
import data.real.nnreal order.bounds data.set.intervals tactic.norm_num
noncomputable theory
open classical set lattice
open_locale class... |
6f54593b8689552806baeef2c1f744c85957df6f | 367134ba5a65885e863bdc4507601606690974c1 | /src/set_theory/pgame.lean | ce4c4d79fb858c95e592de70b9f8300a14371d25 | [
"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 | 39,616 | lean | /-
Copyright (c) 2019 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Reid Barton, Mario Carneiro, Isabel Longbottom, Scott Morrison
-/
import logic.embedding
import data.nat.cast
import data.fin
/-!
# Combinatorial (pre-)games.
The basic theory of com... |
60fe7e6c7f8d85e8405401bc624884f010fc815a | 02005f45e00c7ecf2c8ca5db60251bd1e9c860b5 | /src/linear_algebra/bilinear_form.lean | 10ff9f0d2bb0bc7d2751ddd1e7f370d6e1fc95da | [
"Apache-2.0"
] | permissive | anthony2698/mathlib | 03cd69fe5c280b0916f6df2d07c614c8e1efe890 | 407615e05814e98b24b2ff322b14e8e3eb5e5d67 | refs/heads/master | 1,678,792,774,873 | 1,614,371,563,000 | 1,614,371,563,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 42,119 | lean | /-
Copyright (c) 2018 Andreas Swerdlow. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Andreas Swerdlow
-/
import linear_algebra.matrix
import linear_algebra.tensor_product
import linear_algebra.nonsingular_inverse
/-!
# Bilinear form
This file defines a bilinear for... |
5c6bbcd21450f99f42afa58c94845bd7693486b8 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/order/ring/defs.lean | ce724e4260d582a4d842d5c62d08ed1cd9f7974f | [
"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 | 41,996 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Mario Carneiro, Yaël Dillies
-/
import algebra.order.group.defs
import algebra.order.monoid.cancel.defs
import algebra.order.monoid.canonical.defs
imp... |
775c60d16823bdd3578723d6598fe1a82b8aaa7c | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/category_theory/limits/shapes/images.lean | bdc4534eaa0faf7bb30a45b554bce0489d7bb017 | [
"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 | 30,025 | 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.equalizers
import category_theory.limits.shapes.pullbacks
import category_theory.limits.shapes.strong_epi
/-!
# C... |
d6d4f93360d4a2fd00aa5dabf68e51dc720009f2 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/linear_algebra/dual_auto.lean | 774cd2fa8e63b4528c33b9965b08ad14cde3ff07 | [] | 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 | 15,329 | lean | /-
Copyright (c) 2019 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Fabian Glöckle
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.linear_algebra.finite_dimensional
import Mathlib.tactic.apply_fun
import Ma... |
30ce20f8906e77f37f31e6db0391ff9a9b91a09d | 3f7026ea8bef0825ca0339a275c03b911baef64d | /src/analysis/calculus/times_cont_diff.lean | 262884527030c372383257437b3f2fdf8eb36179 | [
"Apache-2.0"
] | permissive | rspencer01/mathlib | b1e3afa5c121362ef0881012cc116513ab09f18c | c7d36292c6b9234dc40143c16288932ae38fdc12 | refs/heads/master | 1,595,010,346,708 | 1,567,511,503,000 | 1,567,511,503,000 | 206,071,681 | 0 | 0 | Apache-2.0 | 1,567,513,643,000 | 1,567,513,643,000 | null | UTF-8 | Lean | false | false | 37,008 | 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 analysis.calculus.deriv
/-!
# Higher differentiability
A function is `C^1` on a domain if it is differentiable there, and its derivative is continuous... |
c3060e55d1f92818a1e284d27f9900135fdbdead | cf39355caa609c0f33405126beee2739aa3cb77e | /library/init/data/sum/default.lean | c287b8ee71f2699e6730a59e16138784ab45ad6b | [
"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 | 199 | 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.sum.basic
|
1ce876321935cadd9842691a1efc1c0da45eadc7 | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/category_theory/endomorphism.lean | 4d2508d2968d2f7586893f181991892fe5995a56 | [
"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 | 3,775 | lean | /-
Copyright (c) 2019 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov, Scott Morrison, Simon Hudon
Definition and basic properties of endomorphisms and automorphisms of an object in a category.
-/
import category_theory.groupoid
import ... |
1fa779e70779a58f52dd7f193410433a29bfa2bc | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /08_Building_Theories_and_Proofs.org.16.lean | 707032fe186df56bb83d86c5abd4fe7b9db8df7a | [] | 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 | 245 | lean | import standard
definition id (A : Type) (a : A) : A := a
definition pr2 (A : Type) (a b : A) : A := b
-- mark pr2 as reducible
attribute pr2 [reducible]
-- mark id and pr2 as irreducible
attribute id [irreducible]
attribute pr2 [irreducible]
|
4763033121bd380626792cd49ca08d95d12243eb | 217bb195841a8be2d1b4edd2084d6b69ccd62f50 | /library/init/control/default.lean | fc6b0c2504eb77a6587d9038ec2dd009a247ee7d | [
"Apache-2.0"
] | permissive | frank-lesser/lean4 | 717f56c9bacd5bf3a67542d2f5cea721d4743a30 | 79e2abe33f73162f773ea731265e456dbfe822f9 | refs/heads/master | 1,589,741,267,933 | 1,556,424,200,000 | 1,556,424,281,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 428 | 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.control.applicative init.control.functor init.control.alternative
import init.control.monad init.control.lift
import init.control.state ... |
b7c1bdeae911d779f0394ef126b6d854f5f2f949 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/vm_check_bug.lean | 129047de9d6a4ea97bd33d3f0e2925313fbfc52c | [
"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 | 136 | lean | def f : nat → nat → nat
| (x+1) (y+1) := f (x+100000000) y
| (x+1) 0 := x
| 0 (y+1) := 1
| 0 0 := 1
#eval f 1 1000
|
0a4ca1c12070d7f8c5d2712108be5565c6c16704 | f3a5af2927397cf346ec0e24312bfff077f00425 | /src/game/world6/level5.lean | c46ade35b1204eacc7ae8815b9b884b163a97c33 | [
"Apache-2.0"
] | permissive | ImperialCollegeLondon/natural_number_game | 05c39e1586408cfb563d1a12e1085a90726ab655 | f29b6c2884299fc63fdfc81ae5d7daaa3219f9fd | refs/heads/master | 1,688,570,964,990 | 1,636,908,242,000 | 1,636,908,242,000 | 195,403,790 | 277 | 84 | Apache-2.0 | 1,694,547,955,000 | 1,562,328,792,000 | Lean | UTF-8 | Lean | false | false | 2,401 | lean | /-
# Proposition world.
## Level 5 : `P → (Q → P)`.
In this level, our goal is to construct an implication, like in level 2.
```
⊢ P → (Q → P)
```
So $P$ and $Q$ are propositions, and our goal is to prove
that $P\implies(Q\implies P)$.
We don't know whether $P$, $Q$ are true or false, so initially
this seems like ... |
db337c9f1e950483641305d5253f410e96956299 | efa51dd2edbbbbd6c34bd0ce436415eb405832e7 | /20150803_CADE/examples/ex8.lean | e4a9c7d8354810a10b509566c94751dd7215a2e5 | [
"Apache-2.0"
] | permissive | leanprover/presentations | dd031a05bcb12c8855676c77e52ed84246bd889a | 3ce2d132d299409f1de269fa8e95afa1333d644e | refs/heads/master | 1,688,703,388,796 | 1,686,838,383,000 | 1,687,465,742,000 | 29,750,158 | 12 | 9 | Apache-2.0 | 1,540,211,670,000 | 1,422,042,683,000 | Lean | UTF-8 | Lean | false | false | 494 | lean | import data.nat
open nat
theorem add_comm (x y : ℕ) : x + y = y + x :=
begin
induction x with x ih,
show 0 + y = y + 0, by rewrite zero_add,
show succ x + y = y + succ x,
begin
cases y with y,
{rewrite zero_add},
{rewrite [succ_add, ih]}
end
end
variables a b c d : na... |
76c6c1b079bfae1e76367cee6f6fe7af9660f4b0 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/group_theory/archimedean.lean | d5732aa7bbd2b22d0f8d3b1ef0c2f5304b57035c | [
"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 | 3,298 | lean | /-
Copyright (c) 2020 Heather Macbeth, Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Heather Macbeth, Patrick Massot
-/
import algebra.order.archimedean
import group_theory.subgroup.basic
/-!
# Archimedean groups
This file proves a few facts about or... |
8faa0850be9482d3a450c9c7cb4f6f36069b433e | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/number_theory/legendre_symbol/gauss_eisenstein_lemmas.lean | 7bb9f0735124f707a960ec0b4800803c34963a6d | [
"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 | 13,713 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import field_theory.finite.basic
import data.zmod.basic
/-!
# Lemmas of Gauss and Eisenstein
This file contains code for the proof of the Lemmas of Gauss and Eisenstein... |
25e2de2dbccd9933eec2518216ae44b020832726 | 37da0369b6c03e380e057bf680d81e6c9fdf9219 | /hott/algebra/category/constructions/rezk.hlean | b0d987668b788a3f654c69cc05b731da9f1d787a | [
"Apache-2.0"
] | permissive | kodyvajjha/lean2 | 72b120d95c3a1d77f54433fa90c9810e14a931a4 | 227fcad22ab2bc27bb7471be7911075d101ba3f9 | refs/heads/master | 1,627,157,512,295 | 1,501,855,676,000 | 1,504,809,427,000 | 109,317,326 | 0 | 0 | null | 1,509,839,253,000 | 1,509,655,713,000 | C++ | UTF-8 | Lean | false | false | 17,526 | hlean | /-
Copyright (c) 2016 Jakob von Raumer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jakob von Raumer
The Rezk completion
-/
import hit.two_quotient types.trunc types.arrow algebra.category.functor.exponential_laws
open eq category equiv trunc_two_quotient is_tru... |
4a4730367d91fbf54cacda1546c724b13d09f642 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/analysis/normed_space/indicator_function.lean | a27af2a3975c7bbb550db0dd074c785e208c66bb | [
"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 | 1,353 | lean | /-
Copyright (c) 2020 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou, Yury Kudryashov
-/
import analysis.normed.group.basic
import algebra.indicator_function
/-!
# Indicator function and norm
This file contains a few simple lemmas about `... |
b66b2102646734b5ec4c132dc33f151524ad6862 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/category_theory/category/pairwise.lean | dfe5822c437831a3221c071ab2f1e9d33ab520e6 | [
"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,281 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.limits.preserves.basic
import category_theory.limits.lattice
/-!
# The category of "pairwise intersections".
Given `ι : Type v`, we build th... |
759b9a8f7cee36c5cac0abc6e4228e2155a5f1d1 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/topology/homotopy/homotopy_group.lean | 021f8748bc56134af759eccc1853e386e63a379b | [
"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 | 20,895 | lean | /-
Copyright (c) 2021 Roberto Alvarez. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Roberto Alvarez
-/
import algebraic_topology.fundamental_groupoid.fundamental_group
import group_theory.eckmann_hilton
import logic.equiv.transfer_instance
import algebra.group.ext
... |
805b4062679951c36a645094877f304e1a38d561 | da23b545e1653cafd4ab88b3a42b9115a0b1355f | /src/tidy/rewrite_search/default.lean | 35b68493514b0cf96e77961752c85607f72583c6 | [] | no_license | minchaowu/lean-tidy | 137f5058896e0e81dae84bf8d02b74101d21677a | 2d4c52d66cf07c59f8746e405ba861b4fa0e3835 | refs/heads/master | 1,585,283,406,120 | 1,535,094,033,000 | 1,535,094,033,000 | 145,945,792 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 172 | lean | -- "init.lean" provides the fallback strategy and tracer for the engine.
import .init
-- 'tactic.lean' provides the tactics
import .tactic
import .tracer
import .strategy |
57db1ba7bcef168daa0522bd7fffad7732cd0896 | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/algebra/ordered_group.lean | f50797c6f030f7031d133e40335553473e4a6747 | [
"Apache-2.0"
] | permissive | troyjlee/mathlib | e18d4b8026e32062ab9e89bc3b003a5d1cfec3f5 | 45e7eb8447555247246e3fe91c87066506c14875 | refs/heads/master | 1,689,248,035,046 | 1,629,470,528,000 | 1,629,470,528,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 45,495 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Mario Carneiro, Johannes Hölzl
-/
import algebra.ordered_monoid
import order.rel_iso
import order.order_dual
/-!
# Ordered groups
This file develops ... |
aa7d70fdd12cb603e7d8286b20e1f028b9c72276 | 853df553b1d6ca524e3f0a79aedd32dde5d27ec3 | /src/field_theory/minimal_polynomial.lean | 763aea391985ee6393571e22a0cad788eb0c7bcf | [
"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 | 8,793 | lean | /-
Copyright (c) 2019 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Johan Commelin
-/
import ring_theory.integral_closure
/-!
# Minimal polynomials
This file defines the minimal polynomial of an element x of an A-algebra B,
under the assu... |
911078cf11f33d0efd1ff21be614d085bb07ce9b | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/record9.lean | 1fe1fa379ad331204a029456715c2ee48e284742 | [
"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 | 122 | lean | import logic
constant fibrant : Type → Prop
structure Fib : Type :=
{type : Type} (pred : fibrant type)
check Fib.mk
|
e394567c22f377fc55516536e696f00b92bd7b13 | e0f9ba56b7fedc16ef8697f6caeef5898b435143 | /src/computability/turing_machine.lean | 99428a51eba81f51b5fb729f6a010fec249631ad | [
"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 | 109,213 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
-/
import algebra.order
import data.fintype.basic
import data.pfun
import tactic.apply_fun
/-!
# Turing machines
This file defines a sequence of simple machine language... |
0f70a3461ec3957a9ceb205263051fe38890466b | 7b45c8e0208f477057ab640555177a616446a1b4 | /balanced_tree.lean | 08dcbf5dab24ccd7363fb370a553a456417bffc6 | [] | no_license | martarozek/LV-balanced-tree | b979726e9de2432cfa1ec5fa241e5ea9054b0cf7 | 8971c196ebcded9d1072b3ff90f96e844db8e827 | refs/heads/master | 1,586,495,495,261 | 1,544,185,015,000 | 1,544,185,015,000 | 160,819,848 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,122 | lean | inductive color : Type
| red : color
| black : color
export color (red black)
def color.repr : color → string
| red := "R"
| black := "B"
instance : has_repr (color) := ⟨color.repr⟩
namespace rb_tree
/- Leaf nodes do not hold values. They are considered to be black.
The following implementation represents set... |
82c95bffc98fcbc7972d7981ac4fd975cce7309b | ad0c7d243dc1bd563419e2767ed42fb323d7beea | /group_theory/abelianization.lean | ea520502931c43656cf76498543a54f66f85189c | [
"Apache-2.0"
] | permissive | sebzim4500/mathlib | e0b5a63b1655f910dee30badf09bd7e191d3cf30 | 6997cafbd3a7325af5cb318561768c316ceb7757 | refs/heads/master | 1,585,549,958,618 | 1,538,221,723,000 | 1,538,221,723,000 | 150,869,076 | 0 | 0 | Apache-2.0 | 1,538,229,323,000 | 1,538,229,323,000 | null | UTF-8 | Lean | false | false | 3,018 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
The functor Grp → Ab which is the left adjoint
of the forgetful functor Ab → Grp.
-/
import group_theory.quotient_group
universes u v
variables (α : Type u) [gr... |
4493b30ff24caba1b90cee6f6ff6da22c4e03ffd | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/lean/run/coeIssues4.lean | 505cd6cb0bd87828cde37a000bd4f6233c34ffcf | [
"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 | 542 | lean | def f : List Int → Bool := fun _ => true
def ex3 : IO Bool :=
do
xs ← pure [1, 2, 3];
pure $ f xs -- Works
inductive Expr
| val : Nat → Expr
| app : Expr → Expr → Expr
instance : Coe Nat Expr := ⟨Expr.val⟩
def foo : Expr → Expr := fun e => e
new_frontend
def ex1 : Bool :=
f [1, 2, 3] -- Works
def ex2 : Bool :=
... |
0d922346c17f7613b8d6f9e705c655f356df28e1 | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /src/Init/Meta.lean | 938de8a907e4de8a02333b433a185cb22bca236c | [
"Apache-2.0"
] | permissive | collares/lean4 | 861a9269c4592bce49b71059e232ff0bfe4594cc | 52a4f535d853a2c7c7eea5fee8a4fa04c682c1ee | refs/heads/master | 1,691,419,031,324 | 1,618,678,138,000 | 1,618,678,138,000 | 358,989,750 | 0 | 0 | Apache-2.0 | 1,618,696,333,000 | 1,618,696,333,000 | null | UTF-8 | Lean | false | false | 29,474 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura and Sebastian Ullrich
Additional goodies for writing macros
-/
prelude
import Init.Data.Array.Basic
namespace Lean
@[extern c inline "lean_box(LEAN_VERSION_... |
761c157adecc9254ba906581e8fba0a158b31ec9 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/booltst.lean | 6086ef83a06712d29766690c9da50593fa5aab3d | [
"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 | 21 | lean | open bool
#check ff
|
9e52dd9b6baa7a5d5ec22a551d543d4135334698 | 4bcaca5dc83d49803f72b7b5920b75b6e7d9de2d | /stage0/src/Lean/Meta/Injective.lean | d41049a59313df6b3370271b4114bb097ac6906d | [
"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 | 6,789 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Meta.Transform
import Lean.Meta.Tactic.Injection
import Lean.Meta.Tactic.Apply
import Lean.Meta.Tactic.Cases
import Lean.Meta.Tactic.Subst
impor... |
ed48e9dfac6fcafd2126ed6eb537ab3508e350f1 | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/measure_theory/bochner_integration.lean | a0ebb26372f8c090e9cf2fa78fb5a977f8495409 | [
"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 | 61,428 | lean | /-
Copyright (c) 2019 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou
-/
import measure_theory.simple_func_dense
import analysis.normed_space.bounded_linear_maps
import topology.sequences
/-!
# Bochner integral
The Bochner integral extends... |
398141274e9e1b84eb92b8cf195155f69869b4f1 | 99b5e6372af1f404777312358869f95be7de84a3 | /src/hott/init/meta/induction.lean | acdfbe366992620cb139bace4df2d5f4b3c080af | [
"Apache-2.0"
] | permissive | forked-from-1kasper/hott3 | 8fa064ab5e8c9d6752a783d74ab226ddc5b5232a | 2db24de7a361a7793b0eae4ca5c3fd4d4a0fc691 | refs/heads/master | 1,584,867,131,028 | 1,530,766,841,000 | 1,530,766,841,000 | 139,797,034 | 0 | 0 | Apache-2.0 | 1,530,766,961,000 | 1,530,766,961,000 | null | UTF-8 | Lean | false | false | 17,485 | lean | /-
Copyright (c) 2017 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Floris van Doorn
A tactic to infer truncatedness better than type-class inference.
-/
import .basic_tactics
namespace expr
/-- gives the arity of the type, i.e. the number of pi's ... |
8b338ec9dd6bb53483b779b4d0535ba760ee3dcb | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/category_theory/limits/colimit_limit.lean | 74cffb1fe330be67bb3e3a36d9135622d54e31ef | [
"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 | 4,356 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.limits.types
import category_theory.currying
import category_theory.limits.functor_category
/-!
# The morphism comparing a colimit of limits w... |
6f443f67f0f3674f8bab98d19f5574c3048c6e79 | 271e26e338b0c14544a889c31c30b39c989f2e0f | /stage0/src/Init/Lean/Meta/WHNF.lean | 52ba57d35e36b5dfe5007f542661588068543be0 | [
"Apache-2.0"
] | permissive | dgorokho/lean4 | 805f99b0b60c545b64ac34ab8237a8504f89d7d4 | e949a052bad59b1c7b54a82d24d516a656487d8a | refs/heads/master | 1,607,061,363,851 | 1,578,006,086,000 | 1,578,006,086,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,113 | 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
-/
prelude
import Init.Lean.AuxRecursor
import Init.Lean.Util.WHNF
import Init.Lean.Meta.Basic
import Init.Lean.Meta.LevelDefEq
namespace Lean
namespace Meta
... |
7e2af6d9ada11e6e2b2d24cada907eca2ec45de6 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/order/filter/basic.lean | ae3ad6fe2e83a66e3831df1e62b4986fdd32f8ee | [
"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 | 111,840 | 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`... |
3f8b233b45d10e6665f8364f0bd9be692ee01e82 | 649957717d58c43b5d8d200da34bf374293fe739 | /src/ring_theory/noetherian.lean | c41c17dc9f29e5248cd098b0439f7531d31e9f51 | [
"Apache-2.0"
] | permissive | Vtec234/mathlib | b50c7b21edea438df7497e5ed6a45f61527f0370 | fb1848bbbfce46152f58e219dc0712f3289d2b20 | refs/heads/master | 1,592,463,095,113 | 1,562,737,749,000 | 1,562,737,749,000 | 196,202,858 | 0 | 0 | Apache-2.0 | 1,562,762,338,000 | 1,562,762,337,000 | null | UTF-8 | Lean | false | false | 19,826 | lean | /-
Copyright (c) 2018 Mario Carneiro and Kevin Buzzard. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Kevin Buzzard
-/
import data.equiv.algebra
import linear_algebra.finsupp
import ring_theory.ideal_operations
import ring_theory.subring
open set lat... |
74da1182a505a003adbb70ac8a7752792a7062b3 | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /src/Lean/Meta/Instances.lean | 7fb8445a6e728bdf282e4f0522da997f34db0b6d | [
"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 | 5,757 | 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.ScopedEnvExtension
import Lean.Meta.GlobalInstances
import Lean.Meta.DiscrTree
namespace Lean.Meta
structure InstanceEntry where
keys ... |
1887d4987b5868610faa2c3362a57eaa10ca129b | 129628888508a22919f176e3ba2033c3b52fa859 | /src/eisenstein.lean | 8f5ee6b20843e8abe814a69aeab0a45e59a63544 | [
"Apache-2.0"
] | permissive | ImperialCollegeLondon/P11-Galois-Theory | 1aa35b6aa71c08aec6da3296ba404bf246db8df3 | ced2caa52300feb633316b3120c40ca957c8e8ff | refs/heads/master | 1,671,253,848,362 | 1,600,080,687,000 | 1,600,080,687,000 | 160,926,153 | 4 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,679 | lean | import data.polynomial
-- import data.nat.prime
import ring_theory.ideals
import ring_theory.ideal_operations
import ring_theory.unique_factorization_domain
universe u
open polynomial ideal
variables {α : Type u} [integral_domain α]
/-- An eisenstein prime is a prime ideal for which
the conditions of eisenstei... |
143aba7d1d6182a91ccafd852fdeaf216f2d0bcd | 618003631150032a5676f229d13a079ac875ff77 | /src/topology/metric_space/isometry.lean | f4df1d2def4c3b807db4a6f98673bae13fefeb84 | [
"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 | 16,033 | lean | /-
Copyright (c) 2018 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Isometries of emetric and metric spaces
Authors: Sébastien Gouëzel
-/
import topology.bounded_continuous_function
import topology.opens
/-!
# Isometries
We define isometries, i.e., maps be... |
a676729a92d95cc88ac19c4a59b20d7c152b0a7e | 92b50235facfbc08dfe7f334827d47281471333b | /library/data/finset/basic.lean | 88b80d5c7a315b6849ede10a58aa17478fc8aa98 | [
"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 | 25,147 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura, Jeremy Avigad
Finite sets.
-/
import data.fintype.basic data.nat data.list.perm data.subtype algebra.binary
open nat quot list subtype binary function eq.ops
... |
dfb48beff9c9cdc254111360c4be7f99c06979d2 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /stage0/src/Lean/Compiler/Util.lean | d1f084e1eb525ad1808f9b3379dad9daf74ee0b3 | [
"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 | 4,381 | 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.Match.MatcherInfo
namespace Lean.Compiler
/--
Return `true` if `mdata` should be preserved.
Right now, we don't preserve any `MData`, but... |
eb71e13719ccc7b9eb75ffad05eef5236b94a16f | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/category_theory/monoidal/End.lean | b321dbf99e446389328f88af03ff3ae59bfcc931 | [
"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 | 2,369 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.monoidal.functor
/-!
# Endofunctors as a monoidal category.
We give the monoidal category structure on `C ⥤ C`,
and show that when `C` itself... |
5aa9f35b3a932d9462f691a83801160a06fb1b94 | c45b34bfd44d8607a2e8762c926e3cfaa7436201 | /uexp/src/uexp/rules/transitiveInferenceJoin3wayAgg.lean | e9a2aefef5c91fd842a789c9e67ba223a7249bce | [
"BSD-2-Clause"
] | permissive | Shamrock-Frost/Cosette | b477c442c07e45082348a145f19ebb35a7f29392 | 24cbc4adebf627f13f5eac878f04ffa20d1209af | refs/heads/master | 1,619,721,304,969 | 1,526,082,841,000 | 1,526,082,841,000 | 121,695,605 | 1 | 0 | null | 1,518,737,210,000 | 1,518,737,210,000 | null | UTF-8 | Lean | false | false | 2,918 | lean | import ..sql
import ..tactics
import ..u_semiring
import ..extra_constants
import ..ucongr
import ..TDP
open Expr
open Proj
open Pred
open SQL
open tree
open binary_operators
notation `int` := datatypes.int
variable integer_1: const datatypes.int
variable integer_7: const datatypes.int
theorem rule:
forall ( Γ scm... |
83352c0ee4a8455c19c20628a25c9e1cbc0bde41 | 02fbe05a45fda5abde7583464416db4366eedfbf | /tests/lean/json.lean | b0160c268ae124c1a2fc18cdd52e8f84b094b3eb | [
"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 | 227 | lean | #eval to_string $ json.parse $ "[0.7]"
#eval to_string $ json.parse $ "{\"hello\": 0.4, \"world\": [null, true, false, 1,2,3, \"this is a \\\" string with an annoying quote in it. \"]}"
#eval to_string $ json.parse $ "spurgles" |
71892a357138e0b6b750e599b1402e10c280b88e | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/longestParsePrio.lean | b1f1cc2f2a98372ff151d5d1c2815f1325c2f7f1 | [
"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 | 152 | lean | syntax "have" ":" term : tactic
example : False := by
have : True := by simp [ -- should *not* parse the shorter `have` syntax and then fail on `:=`
|
398a7fa01805a2e4fcfdbb49446dba791977709c | 4b846d8dabdc64e7ea03552bad8f7fa74763fc67 | /tests/lean/unification_hints1.lean | e8284433d3fc89ce5813f1268be5afd3dfda2d46 | [
"Apache-2.0"
] | permissive | pacchiano/lean | 9324b33f3ac3b5c5647285160f9f6ea8d0d767dc | fdadada3a970377a6df8afcd629a6f2eab6e84e8 | refs/heads/master | 1,611,357,380,399 | 1,489,870,101,000 | 1,489,870,101,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,203 | lean | --
open list nat
namespace toy
constants (A : Type) (f h : A → A) (x y z : A)
attribute [irreducible]
noncomputable definition g (x y : A) : A := f z
#unify (g x y), (f z)
@[unify]
noncomputable definition toy_hint (x y : A) : unification_hint :=
{ pattern := g x y ≟ f z,
constraints := [] }
#unify (g x y), (f z)... |
daa675cd211b872a272b9d0d2997c4931ba1e76e | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/measure_theory/measurable_space.lean | fd124a1b8b4735a7288ed8a064c05e65412ca177 | [
"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 | 63,420 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro
-/
import data.prod.tprod
import group_theory.coset
import logic.equiv.fin
import measure_theory.measurable_space_def
import order.filter.small_sets
imp... |
e663570f7ffffb7d50a7101b3b36920b430c11f3 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/data/nat/cast.lean | 8770bb783e33b08f71729069f27653671ecd263e | [
"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 | 9,179 | lean | /-
Copyright (c) 2014 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
Natural homomorphism from the natural numbers into a monoid with one.
-/
import algebra.ordered_field
import data.nat.basic
namespace nat
variables {α : Type*}
sectio... |
47aa758a93504f3777f6a256171602fbb1fc1b8e | 367134ba5a65885e863bdc4507601606690974c1 | /src/category_theory/opposites.lean | 1a8ca6c6ff483385301b3c78e062604319b7503d | [
"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,553 | 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 category_theory.types
import category_theory.equivalence
import data.opposite
universes v₁ v₂ u₁ u₂ -- declare the `v`'s first; see `category_... |
51b22e5a0fc68d233d26527414efc8cb324b5a06 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/data/option/defs.lean | 347cf0f73a34ee0c297af46e00bbcb13f859a243 | [
"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 | 6,944 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
/-!
# Extra definitions on `option`
This file defines more operations involving `option α`. Lemmas about them are located in other
files under `data.option.`.
Other... |
8339cb5bad59435f1874c6802bb12bae14e69be2 | 5d95c8513fa8592ce314d1f40c23ad5eecfe1e34 | /src/util/meta/parser.lean | 65b735c9eb6e98a47482246587179f4ec3826109 | [
"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 | 583 | lean | -- Copyright © 2019 François G. Dorais. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
meta def lean.parser.of_exceptional {α} : exceptional α → lean.parser α
| (exceptional.success x) := pure x
| (exceptional.exception _ m) := failure
meta instance (α) : has_coe_to_sort ... |
6a3bb842e3d1b77e72b27cedd33303eafbd30374 | 968e2f50b755d3048175f176376eff7139e9df70 | /examples/prop_logic_lean_summary/unnamed_199.lean | fbeb4b986792b488a958c47246062f73b1ea6d53 | [] | no_license | gihanmarasingha/mth1001_sphinx | 190a003269ba5e54717b448302a27ca26e31d491 | 05126586cbf5786e521be1ea2ef5b4ba3c44e74a | refs/heads/master | 1,672,913,933,677 | 1,604,516,583,000 | 1,604,516,583,000 | 309,245,750 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 150 | lean | variables p q : Prop
-- BEGIN
example (h₁ : p) (h₂ : q) : p ∧ q :=
begin
exact and.intro h₁ h₂ -- Or `exact ⟨h₁, h₂⟩`.
end
-- END |
2b6de73ce0c095d314d6c0de8a5f332e9baa702a | 367134ba5a65885e863bdc4507601606690974c1 | /src/category_theory/monad/bundled.lean | 547cd46b9d0a1af7f5c3822b939544832b7fba72 | [
"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 | 888 | lean | /-
Copyright (c) 2020 Adam Topaz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Adam Topaz
-/
import category_theory.monad.basic
import category_theory.eq_to_hom
/-!
# Bundled Monads
We define bundled (co)monads as a structure consisting of a functor `func : C ⥤ C` ... |
a2848d94cd29356e61bfdd4d2b2bbaec5f6035d7 | 91b8df3b248df89472cc0b753fbe2bac750aefea | /experiments/lean/src/ddl/host/lemmas.lean | cd3f43b64e8d7af614e9792a65630d8765e604f1 | [
"Apache-2.0",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | yeslogic/fathom | eabe5c4112d3b4d5ec9096a57bb502254ddbdf15 | 3960a9466150d392c2cb103c5cb5fcffa0200814 | refs/heads/main | 1,685,349,769,736 | 1,675,998,621,000 | 1,675,998,621,000 | 28,993,871 | 214 | 11 | Apache-2.0 | 1,694,044,276,000 | 1,420,764,938,000 | Rust | UTF-8 | Lean | false | false | 2,262 | lean | import ddl.binary.formation
import ddl.binary.repr
import ddl.host.formation
import ddl.host.evaluation
import ddl.host.typing
namespace ddl.host
open ddl
variables {ℓ α : Type} [decidable_eq ℓ]
-- WELL-FORMEDNESS
-- https://softwarefoundations.cis.upenn.edu/plf-current/Records.html#lab348
lemma has_typ... |
6ba5ce7c339823eebc3fedd37e76745293833405 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/measure_theory/measure/finite_measure_weak_convergence.lean | 7f16b36478e8ae776068875dc2325706f577b65d | [
"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 | 69,493 | lean | /-
Copyright (c) 2021 Kalle Kytölä. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kalle Kytölä
-/
import measure_theory.measure.measure_space
import measure_theory.integral.set_integral
import measure_theory.integral.average
import topology.continuous_function.bounded... |
1445ee4d6c6989b1ae82a578e3a78617a14aa3fc | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Parser/Term.lean | 47d0853c0ead6a2d570af8ebb28827195c3907b2 | [
"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 | 32,132 | 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, Sebastian Ullrich
-/
import Lean.Parser.Attr
import Lean.Parser.Level
namespace Lean
namespace Parser
namespace Command
def commentBody : Parser :=
{ fn := ... |
afb3aa8d1aa32bbf82a285e6386af11ffea9b4e2 | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /src/Lean/Elab/Deriving/DecEq.lean | 45b831fa2495c8f161d1b2d5a75dc189c50a6493 | [
"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 | 4,983 | 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.Meta.Transform
import Lean.Meta.Inductive
import Lean.Elab.Deriving.Basic
import Lean.Elab.Deriving.Util
namespace Lean.Elab.Deriving.DecEq
ope... |
40cb0d7e6999353e2cb3609d0782a715b6a8d5e5 | 0d7f5899c0475f9e105a439896d9377f80c0d7c3 | /src/lang.lean | 078663cf1e0e001174dab378eaf1b1b5b5e98750 | [] | no_license | adamtopaz/UnivAlg | 127038f320e68cdf3efcd0c084c9af02fdb8da3d | 2458d47a6e4fd0525e3a25b07cb7dd518ac173ef | refs/heads/master | 1,670,320,985,286 | 1,597,350,882,000 | 1,597,350,882,000 | 280,585,500 | 4 | 0 | null | 1,597,350,883,000 | 1,595,048,527,000 | Lean | UTF-8 | Lean | false | false | 2,268 | lean | import .ftuple
/-!
# Languages and raw algebras.
A language is just a dependent type `ℕ → Type*`.
We wrap this in a structure in order to avoid writing `@L` in certain cases, but we immediately introduce a coersion to functions which allows us to write `L n`.
The idea is that `L n` is the type of `n`-ary functions ... |
c7da68b83c1128a597b4bc632d2a7f00aa93ecb8 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /stage0/src/Lean/Elab/Tactic/Conv/Pattern.lean | fb72c8b18bd9971d0ef6b86048eb6cdd64043d95 | [
"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 | 2,916 | 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.Tactic.Simp
import Lean.Elab.Tactic.Conv.Basic
import Lean.HeadIndex
namespace Lean.Elab.Tactic.Conv
open Meta
private def getContext : M... |
eea7f135fe3f96357cea00c5dfb52ff7a35f057f | 07c76fbd96ea1786cc6392fa834be62643cea420 | /hott/init/equiv.hlean | 2471f5121d42d06b54bb47d40752167915ad5296 | [
"Apache-2.0"
] | permissive | fpvandoorn/lean2 | 5a430a153b570bf70dc8526d06f18fc000a60ad9 | 0889cf65b7b3cebfb8831b8731d89c2453dd1e9f | refs/heads/master | 1,592,036,508,364 | 1,545,093,958,000 | 1,545,093,958,000 | 75,436,854 | 0 | 0 | null | 1,480,718,780,000 | 1,480,718,780,000 | null | UTF-8 | Lean | false | false | 23,099 | hlean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad, Jakob von Raumer, Floris van Doorn
Ported from Coq HoTT
-/
prelude
import .path .function
open eq function lift
/- Equivalences -/
-- This is our definition of... |
5720c639eca631ddd23357c3422f4787a0ec1f01 | b82c5bb4c3b618c23ba67764bc3e93f4999a1a39 | /src/formal_ml/list_filter_map.lean | e51ab3efc8e83550cb09bd6eaa8ec20c124de974 | [
"Apache-2.0"
] | permissive | nouretienne/formal-ml | 83c4261016955bf9bcb55bd32b4f2621b44163e0 | 40b6da3b6e875f47412d50c7cd97936cb5091a2b | refs/heads/master | 1,671,216,448,724 | 1,600,472,285,000 | 1,600,472,285,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,989 | lean | /-
Copyright 2020 Google LLC
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
di... |
8e67e11ad8b3c8f109d334aad472750ec1602e28 | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /02_Dependent_Type_Theory.org.31.lean | eee90c809162d9626c66245bee289853f4047b84 | [] | 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 | 366 | lean | /- page 27 -/
import standard
import data.list
open list
check list -- Type → Type
check @cons -- Π {T : Type}, T → list T → list T
check @nil -- Π {T : Type}, list T
check @head -- Π {T : Type} [h : inhabited T], list T → T
check @tail -- Π {T : Type}, list T → list T
check @append -- Π {T : Type}... |
8d22fd20d781f15ba0abcfc0818a640d43d26b11 | 246309748072bf9f8da313401699689ebbecd94d | /src/order/rel_iso.lean | 7ff0dcf28bed3df151f2b88811f416aa9b9c1172 | [
"Apache-2.0"
] | permissive | YJMD/mathlib | b703a641e5f32a996f7842f7c0043bab2b462ee2 | 7310eab9fa8c1b1229dca42682f1fa6bfb7dbbf9 | refs/heads/master | 1,670,714,479,314 | 1,599,035,445,000 | 1,599,035,445,000 | 292,279,930 | 0 | 0 | null | 1,599,050,561,000 | 1,599,050,560,000 | null | UTF-8 | Lean | false | false | 18,203 | 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 ... |
580e99617181b395ce5944c3be900c4c67f803e0 | 206422fb9edabf63def0ed2aa3f489150fb09ccb | /src/analysis/analytic/basic.lean | 0b7621231847bd56e0973615837d08f98ed54531 | [
"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 | 46,620 | 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, Yury Kudryashov
-/
import analysis.calculus.formal_multilinear_series
import analysis.specific_limits
/-!
# Analytic functions
A function is analytic in one dim... |
23e678ca3a2a9273d9967941a3bbf14cff643128 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /library/init/meta/decl_cmds.lean | 14650987cfbcdbe61e39391249fc2df020539327 | [
"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,025 | 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.tactic init.meta.rb_map
open tactic
private meta def apply_replacement (replacements : name_map name) (e : expr) : expr :=
e.repla... |
433b5ab9cb64d60ee1b584d272b1c3f378729bba | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/hott/trunc_1.hlean | 2a2b52a59af995a43197eec170bfe328b16db040 | [
"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 | 1,111 | hlean | open is_trunc
namespace hide
inductive trunc (n : trunc_index) (A : Type) : Type :=
tr {} : A → trunc n A
axiom is_trunc_tr (n : trunc_index) (A : Type) : is_trunc n (trunc n A)
attribute is_trunc_tr [instance]
namespace trunc
definition trunc_rec_on {n : trunc_index} {A : Type} {P : trunc n A → Type} (aa : trunc ... |
1e64392dae5515df9f0c06d89a1ae668ac08da99 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/linear_algebra/affine_space/affine_map.lean | ae8d5b4653927a882a87dd4d125299ce8fa110db | [
"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 | 19,246 | lean | /-
Copyright (c) 2020 Joseph Myers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Joseph Myers
-/
import linear_algebra.affine_space.basic
import linear_algebra.tensor_product
import linear_algebra.prod
import linear_algebra.pi
import data.set.intervals.unordered_inte... |
504c236349f4285729099d0de656c1db762b8f06 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/run/induction_on.lean | f8016f980f1570443ce261667b892665c9728846 | [
"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 | 130 | lean | set_option pp.all true
structure p1 :=
(x : nat)
check @p1.induction_on
inductive p2
| mk : nat → p2
check @p2.induction_on
|
ec94824f6be817bb847ced55086e8b33aa38b490 | 05b503addd423dd68145d68b8cde5cd595d74365 | /src/algebra/category/Module/basic.lean | d00f25cb1c66467e377d6c051e4212f204f3cae8 | [
"Apache-2.0"
] | permissive | aestriplex/mathlib | 77513ff2b176d74a3bec114f33b519069788811d | e2fa8b2b1b732d7c25119229e3cdfba8370cb00f | refs/heads/master | 1,621,969,960,692 | 1,586,279,279,000 | 1,586,279,279,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,845 | 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.module
import algebra.punit_instances
import algebra.category.Group.basic
import category_theory.concrete_category
import category... |
762f549599cd83297b998c6fec290225b4430341 | 3ed5a65c1ab3ce5d1a094edce8fa3287980f197b | /src/herstein/ex1_1/Q_03.lean | c142565c27c3d8bcfd0a0e17ea2f4d42f212d40f | [] | no_license | group-study-group/herstein | 35d32e77158efa2cc303c84e1ee5e3bc80831137 | f5a1a72eb56fa19c19ece0cb3ab6cf7ffd161f66 | refs/heads/master | 1,586,202,191,519 | 1,548,969,759,000 | 1,548,969,759,000 | 157,746,953 | 0 | 0 | null | 1,542,412,901,000 | 1,542,302,366,000 | Lean | UTF-8 | Lean | false | false | 365 | lean | import data.set.basic
variable α: Type*
variables A B C: set α
open set
theorem Q_03: A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C) :=
ext $ λ x,
⟨λ h,
⟨or.elim h or.inl (λ hbc, or.inr hbc.1),
or.elim h or.inl (λ hbc, or.inr hbc.2)⟩,
λ ⟨hab, hac⟩, or.elim hab or.inl
(λ hb, or.elim hac or.inl
(λ hc, or.inr ⟨h... |
c4aae19dfe8f9d89d173d69b90d22e70eb105516 | fecda8e6b848337561d6467a1e30cf23176d6ad0 | /src/logic/function/basic.lean | a6b869b7a9509177c0a3b9980f7242f2cf6217d2 | [
"Apache-2.0"
] | permissive | spolu/mathlib | bacf18c3d2a561d00ecdc9413187729dd1f705ed | 480c92cdfe1cf3c2d083abded87e82162e8814f4 | refs/heads/master | 1,671,684,094,325 | 1,600,736,045,000 | 1,600,736,045,000 | 297,564,749 | 1 | 0 | null | 1,600,758,368,000 | 1,600,758,367,000 | null | UTF-8 | Lean | false | false | 18,862 | lean | /-
Copyright (c) 2016 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro
-/
import logic.basic
import data.option.defs
/-!
# Miscellaneous function constructions and lemmas
-/
universes u v w
namespace function
section
var... |
a43ad04ed00618e5fb86af417d10c5822f435e3d | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /library/data/nat/basic.lean | 604f3a30f02a8c4307162cd8d29bb6146024ed2e | [
"Apache-2.0"
] | permissive | chubbymaggie/lean | 0d06ae25f9dd396306fb02190e89422ea94afd7b | d2c7b5c31928c98f545b16420d37842c43b4ae9a | refs/heads/master | 1,611,313,622,901 | 1,430,266,839,000 | 1,430,267,083,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 12,398 | lean | /-
Copyright (c) 2014 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: data.nat.basic
Authors: Floris van Doorn, Leonardo de Moura, Jeremy Avigad
Basic operations on the natural numbers.
-/
import logic.connectives data.num algebra.binary algebra.ring
... |
7a61470658dda6d318dd358baab301b9c14ce7e4 | d1bbf1801b3dcb214451d48214589f511061da63 | /src/algebra/group_power/basic.lean | 489a3e2faf9796bc716cdc8dfdefb30b57837b58 | [
"Apache-2.0"
] | permissive | cheraghchi/mathlib | 5c366f8c4f8e66973b60c37881889da8390cab86 | f29d1c3038422168fbbdb2526abf7c0ff13e86db | refs/heads/master | 1,676,577,831,283 | 1,610,894,638,000 | 1,610,894,638,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 23,311 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Robert Y. Lewis
-/
import algebra.ordered_ring
import deprecated.group
/-!
# Power operations on monoids and groups
The power operation on monoids and groups.
We separa... |
d44aa83a9da5ac45de5178cdab5ec764476b0af6 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/lie/submodule.lean | cf38862aee3698ab25f78a38a8e0520adb0106f7 | [
"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 | 38,542 | lean | /-
Copyright (c) 2021 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import algebra.lie.subalgebra
import ring_theory.noetherian
/-!
# Lie submodules of a Lie algebra
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file re... |
1143c560b47479897f0344262d966cee9d35ae8d | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/algebra/lie/solvable.lean | 60309f96f767427b9ac0b6cbd9c9d8f462a082a7 | [
"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 | 14,024 | lean | /-
Copyright (c) 2021 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import algebra.lie.ideal_operations
import algebra.lie.abelian
import order.preorder_hom
/-!
# Solvable Lie algebras
Like groups, Lie algebras admit a natural concept of ... |
b7a8d0bc34c4eac05e8470ddb401442209ca2d14 | a11f4536efad51bc2b648123619720f3b9318c0f | /src/square_perfect.lean | f6c4362278313438febcbe8133a58084cd5be1a3 | [] | no_license | ezrasitorus/codewars_lean | 909471d43f5130669a90b8e11afc37aec2f21d8f | 6d1abcc1253403511f4cfd767c645596175e4fd3 | refs/heads/master | 1,672,659,589,352 | 1,603,281,507,000 | 1,603,281,507,000 | 288,579,451 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 382 | lean | import tactic
theorem expand : ∀ n : ℕ, (n + 1) ^ 2 = n ^ 2 + 2 * n + 1 :=
-- Tedious way
begin
intro n,
rw nat.pow_two,
rw mul_add,
rw add_mul,
rw ← nat.pow_two,
rw one_mul,
rw mul_one,
rw ← add_assoc,
rw two_mul,
rw ← add_assoc,
end
-- Neater way to do it
example : ∀ n : ℕ, (... |
6a5cc4afb45d2bd5193909358f48249dc7406817 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/lean/conv1.lean | 0d0e68511f50d96ecdd80da8a044f7711e0e0939 | [
"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 | 3,233 | lean | set_option pp.analyze false
def p (x y : Nat) := x = y
example (x y : Nat) : p (x + y) (y + x + 0) := by
conv =>
whnf
congr
. rfl
. whnf; rfl
trace_state
rw [Nat.add_comm]
rfl
example (x y : Nat) : p (x + y) (y + x + 0) := by
conv =>
whnf
rhs
whnf
trace_state
rw [Nat.add_com... |
277d0af6ca0e6b7212b9350ab55c323f3229f5fc | 94e33a31faa76775069b071adea97e86e218a8ee | /src/representation_theory/Action.lean | fc08329d7322fd4540b036dbfbad710f5109c8eb | [
"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 | 18,444 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import algebra.category.Group.basic
import category_theory.single_obj
import category_theory.limits.functor_category
import category_theory.limits.preserves.basic
imp... |
fa222f510c99df804a3b7ac8930ebbbf31e6ddef | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/category_theory/monad/coequalizer.lean | 03a4b95527c3718aead39191c734e289fb825fc0 | [
"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 | 3,828 | lean | /-
Copyright (c) 2020 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta
-/
import category_theory.limits.shapes.reflexive
import category_theory.limits.preserves.shapes.equalizers
import category_theory.limits.preserves.limits
import category_t... |
1e68cc0deec6ae45b2956504b9c0f51f3788e917 | fecda8e6b848337561d6467a1e30cf23176d6ad0 | /src/data/polynomial/eval.lean | 22db40e4105babe0f70b480228059de1e713becc | [
"Apache-2.0"
] | permissive | spolu/mathlib | bacf18c3d2a561d00ecdc9413187729dd1f705ed | 480c92cdfe1cf3c2d083abded87e82162e8814f4 | refs/heads/master | 1,671,684,094,325 | 1,600,736,045,000 | 1,600,736,045,000 | 297,564,749 | 1 | 0 | null | 1,600,758,368,000 | 1,600,758,367,000 | null | UTF-8 | Lean | false | false | 19,229 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Johannes Hölzl, Scott Morrison, Jens Wagemaker
-/
import data.polynomial.induction
import data.polynomial.degree.basic
import deprecated.ring
/-!
# Theory of univariate po... |
ce1797fd71d012b803ccf7397068ea1e0ea03ebf | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/norm1.lean | 51cd346a2e8d61efe94a9de5fd1099a27719557c | [
"Apache-2.0"
] | permissive | codyroux/lean0.1 | 1ce92751d664aacff0529e139083304a7bbc8a71 | 0dc6fb974aa85ed6f305a2f4b10a53a44ee5f0ef | refs/heads/master | 1,610,830,535,062 | 1,402,150,480,000 | 1,402,150,480,000 | 19,588,851 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 893 | lean | variable N : Type
variable P : N -> N -> N -> Bool
variable a : N
variable g : N -> N
variable H : (N -> N -> N) -> N
eval fun f : N -> N, (fun x y : N, g x) (f a)
eval fun (a : N) (f : N -> N) (g : (N -> N) -> N -> N) (h : N -> N -> N),
(fun (x : N) (y : N) (z : N), h x y) (g (fun x : N, f (f x)) (f a)) (f a)
ev... |
19b49d7ec4fc299a741a9298ab11cc0d846aa840 | 4e0d7c3132ce31edc5829849735dd25db406b144 | /lean/love08_operational_semantics_exercise_sheet.lean | 489e035f1fee12938ccf1a7947589024fd24f235 | [] | no_license | gonzalgu/logical_verification_2020 | a0013a6c22ea254e9f4d245f2948f0f4d44df4bb | 724d0457dff2c3ff10f9ab2170388f4c5e958b75 | refs/heads/master | 1,660,886,374,533 | 1,589,859,641,000 | 1,589,859,641,000 | 256,069,971 | 0 | 0 | null | 1,586,997,430,000 | 1,586,997,429,000 | null | UTF-8 | Lean | false | false | 10,444 | lean | import .love08_operational_semantics_demo
/-! # LoVe Exercise 8: Operational Semantics -/
set_option pp.beta true
namespace LoVe
/-! ## Question 1: Program Equivalence
For this question, we introduce the notion of program equivalence: `S₁ ≈ S₂`. -/
def big_step_equiv (S₁ S₂ : stmt) : Prop :=
∀s t, (S₁, s) ⟹ t ... |
1bb55e4afded8e606d4df22a04a2b1e4c1f17628 | 13133fade54057ee588bc056e4eaa14a24773d23 | /Proofs/binomial_modified.lean | 0c5fd8edc557db29340f10d9e49932f51041e585 | [] | no_license | lkloh/lean-project-15815 | 444cbdca1d1a2dfa258c76c41a6ff846392e13d1 | 2cb657c0e41baa318193f7dce85974ff37d80883 | refs/heads/master | 1,611,402,038,933 | 1,432,020,760,000 | 1,432,020,760,000 | 33,372,120 | 0 | 0 | null | 1,431,932,928,000 | 1,428,078,840,000 | Lean | UTF-8 | Lean | false | false | 2,390 | lean | import data.nat
open nat
definition binomial : nat → nat → nat
| binomial 0 0 := 1
| binomial 0 (succ k) := 0
| binomial (succ n) 0 := 1
| binomial (succ n) (succ k) := binomial n k + binomial n (succ k)
-- ****************************************************************** --
-- "(Suc n choose Suc k) = (n choose k... |
b7e8b8e054a185c578159e721e7da712ca72c8fd | 1a9d3677cccdaaccacb163507570e75d34043a38 | /src/week_5/Part_B_topology.lean | da63b7680e44243492fd8751411a9eec97f76f06 | [
"Apache-2.0"
] | permissive | alreadydone/formalising-mathematics | 687d386a72065795e784e270f5c05ea3948b67dd | 65869362cd7a2ac74dd1a97c7f9471835726570b | refs/heads/master | 1,680,260,936,332 | 1,616,563,371,000 | 1,616,563,371,000 | 348,780,769 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,254 | lean | import topology.subset_properties
variables (X Y : Type) [topological_space X] [topological_space Y] (f : X → Y)
open filter set
open_locale filter -- for 𝓟
open_locale topological_space -- for 𝓝
/-
## Neighbourhood filters
If `α` is a topological space and `a : α` then `𝓝 a` is the following
filter on `α`: `... |
f53ea2e9f78ed437e1b3b1a1cfed01999118a297 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/1169.lean | 41c5ec0fc3964e501f6779068f25cf1ac7522b4f | [
"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 | 110 | lean | inductive Foo (n: Nat)
| mk: n = 0 → Foo n
example (h: Foo x): x + 1 = 1 := by
cases h
subst x
rfl
|
370ad12888362209806d4bcd0c1a4938314bce98 | aa5a655c05e5359a70646b7154e7cac59f0b4132 | /stage0/src/Init/Meta.lean | 534c8674e28b7295a437c53696128a6169adc6f1 | [
"Apache-2.0"
] | permissive | lambdaxymox/lean4 | ae943c960a42247e06eff25c35338268d07454cb | 278d47c77270664ef29715faab467feac8a0f446 | refs/heads/master | 1,677,891,867,340 | 1,612,500,005,000 | 1,612,500,005,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 28,227 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura and Sebastian Ullrich
Additional goodies for writing macros
-/
prelude
import Init.Data.Array.Basic
namespace Lean
@[extern c inline "lean_box(LEAN_VERSION_... |
eacd5df1991dd1b46241257a1e3431dea05b0793 | e0f9ba56b7fedc16ef8697f6caeef5898b435143 | /src/set_theory/cardinal.lean | 7c9c706ea5e0dee25370e818eebca595d7492135 | [
"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 | 45,209 | 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
-/
import data.set.countable
import set_theory.schroeder_bernstein
import data.fintype.card
/-!
# Cardinal Numbers
We define cardinal numbers as a quoti... |
e4c795c4c4b2daa85d5250300e9da0af22a5fb25 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /library/init/data/nat/gcd.lean | 4c2f01320ec99ae9b66e448a29f79c4bce0a696d | [
"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 | 1,638 | 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, Mario Carneiro
Definitions and properties of gcd, lcm, and coprime.
-/
prelude
import init.data.nat.lemmas init.meta.well_founded_tactics
open well_f... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.