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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
c0cc2e346e8e827b437dcb7ce350cf4a9f7ac97d | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/auto_quote1.lean | 572e48127407234d30f396ec12683fed5a5679b7 | [
"Apache-2.0"
] | permissive | leanprover-community/lean | 12b87f69d92e614daea8bcc9d4de9a9ace089d0e | cce7990ea86a78bdb383e38ed7f9b5ba93c60ce0 | refs/heads/master | 1,687,508,156,644 | 1,684,951,104,000 | 1,684,951,104,000 | 169,960,991 | 457 | 107 | Apache-2.0 | 1,686,744,372,000 | 1,549,790,268,000 | C++ | UTF-8 | Lean | false | false | 2,072 | lean | example (a b c : nat) : a = b → b = c → c = a :=
by {
intros,
apply eq.symm,
apply eq.trans,
assumption,
assumption
}
example (a b c : nat) : a = b → b = c → c = a :=
by intros; apply eq.symm; apply eq.trans; repeat {assumption}
example (p q r : Prop) : p → q → r → p ∧ q ∧ r ∧ p ∧ q :=
by intros; repeat {as... |
92e8f0b8fbd911588b88806996765b9515c5750a | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/run/e16.lean | 84a112a8155449e17e31fc8d0661066caefe415f | [
"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 | 543 | lean | prelude
inductive nat : Type
| zero : nat
| succ : nat → nat
namespace nat end nat open nat
inductive list (A : Type*) : Type*
| nil {} : list
| cons : A → list → list
namespace list end list open list
check nil
check nil.{1}
check @nil.{1} nat
check @nil nat
check cons zero nil
inductive vector (A : Type*) : nat... |
03830f62b11fe5a5f89caad692c3131ec7bf751f | 9cba98daa30c0804090f963f9024147a50292fa0 | /old/metrology/spaces.lean | 4fbfd19a7520c1b84d8f3c9c4b665f11f78f5a23 | [] | no_license | kevinsullivan/phys | dcb192f7b3033797541b980f0b4a7e75d84cea1a | ebc2df3779d3605ff7a9b47eeda25c2a551e011f | refs/heads/master | 1,637,490,575,500 | 1,629,899,064,000 | 1,629,899,064,000 | 168,012,884 | 0 | 3 | null | 1,629,644,436,000 | 1,548,699,832,000 | Lean | UTF-8 | Lean | false | false | 2,780 | lean | /-
The dimensions.lean file implements the concept of physical dimensions
as we've understood it from, e.g., the SI system of dimensions and units.
Our insight is that that approach leaves too much structure behind. What
we do here, instead, it implement the concept of physical spaces. So, for
example, the vector space... |
f445390d6347f0ba552273c059f76f4ba7acb050 | 4b846d8dabdc64e7ea03552bad8f7fa74763fc67 | /tests/lean/run/whenIO.lean | 008f01b00ac5f1bff5776f49213b2112f28c24aa | [
"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 | 179 | lean | import system.io
open io
def iowhen (b : bool) (a : io unit) : io unit :=
if b = tt then a else return ()
#eval iowhen tt (put_str "hello\n")
#eval iowhen ff (put_str "error\n")
|
8bc8891db6c1928e85b1171a04effc8b651e7929 | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /src/probability_theory/independence.lean | 1c265637afd3eea86c6bbe74b666d5c1ee7642cb | [
"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 | 17,253 | lean | /-
Copyright (c) 2021 Rémy Degenne. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Rémy Degenne
-/
import measure_theory.measure.measure_space
import measure_theory.pi_system
import algebra.big_operators.intervals
import data.finset.intervals
/-!
# Independence of set... |
84d08e688999b4c05ca5ee65ffc6ac485ce842ba | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/order/rel_classes.lean | 263bf5e1487cff55d215e97c18f0327a3668566f | [
"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 | 29,757 | lean | /-
Copyright (c) 2020 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Mario Carneiro, Yury G. Kudryashov
-/
import logic.is_empty
import logic.relation
import order.basic
/-!
# Unbundled relation classes
> THIS FILE IS SYNCHRONIZED WITH M... |
d62666885fa82f804fc64e9747f47b917f585329 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/measure_theory/measure/haar/inner_product_space.lean | 8d7fed18e4f47795e4294e58abe46a86a4a9c175 | [
"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 | 3,074 | lean | /-
Copyright (c) 2022 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.inner_product_space.orientation
import measure_theory.measure.lebesgue.eq_haar
/-!
# Volume forms and measures on inner product spaces
> THIS ... |
70b5475463228bacdbb84d880748100c585068ab | 205f0fc16279a69ea36e9fd158e3a97b06834ce2 | /src/14.Inductive_Definitions/Data_Types/mylist.lean | f2d3d40277ee0d0677ca004deed5dd307a1b7f5c | [] | no_license | kevinsullivan/cs-dm-lean | b21d3ca1a9b2a0751ba13fcb4e7b258010a5d124 | a06a94e98be77170ca1df486c8189338b16cf6c6 | refs/heads/master | 1,585,948,743,595 | 1,544,339,346,000 | 1,544,339,346,000 | 155,570,767 | 1 | 3 | null | 1,541,540,372,000 | 1,540,995,993,000 | Lean | UTF-8 | Lean | false | false | 4,811 | lean | /-
We can import definitions from another
file. Here we import our definitions from
the mynat.lean file. The dot (.) tells
Lean to look for that file in the same
directory as this file.
-/
import .mynat
/-
Open the mynat namespace (in that file)
so that we don't have to prefix names
with mynat.
-/
open mynat
-- C... |
f83b0cd7d615e06b3ba76e9aa9c252b61d2f0ee5 | 9e90bb7eb4d1bde1805f9eb6187c333fdf09588a | /src/stump/to_epsilon.lean | b7404be32d7da4be33fe5ef0ee0d3da99062a75f | [
"Apache-2.0"
] | permissive | alexjbest/stump-learnable | 6311d0c3a1a1a0e65ce83edcbb3b4b7cecabb851 | f8fd812fc646d2ece312ff6ffc2a19848ac76032 | refs/heads/master | 1,659,486,805,691 | 1,590,454,024,000 | 1,590,454,024,000 | 266,173,720 | 0 | 0 | Apache-2.0 | 1,590,169,884,000 | 1,590,169,883,000 | null | UTF-8 | Lean | false | false | 14,841 | lean | /-
Copyright © 2019, Oracle and/or its affiliates. All rights reserved.
-/
import topology.sequences
import .setup_definition
/-!
# `extend_to_epsilon`
This file proves a property of values of measures on intervals.
Given a (probability) measure μ on ℝ, for every ε > 0, given
a real number t such that μ(0,t] > ε w... |
401cd387192d5cedb390c93f3a42dc45f4be2684 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/algebra/order/nonneg.lean | e0d7c627300e7c23c757a50101c2e008cac59917 | [
"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 | 15,948 | lean | /-
Copyright (c) 2021 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
-/
import algebra.order.archimedean
import order.lattice_intervals
import order.complete_lattice_intervals
/-!
# The type of nonnegative elements
This file defines... |
f185e94b8e06772c383c9fb352d381eab7c4a2e6 | 137c667471a40116a7afd7261f030b30180468c2 | /src/analysis/calculus/tangent_cone.lean | bb44709768540b80c33d7eb8a45a78e135a9aa17 | [
"Apache-2.0"
] | permissive | bragadeesh153/mathlib | 46bf814cfb1eecb34b5d1549b9117dc60f657792 | b577bb2cd1f96eb47031878256856020b76f73cd | refs/heads/master | 1,687,435,188,334 | 1,626,384,207,000 | 1,626,384,207,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 18,768 | 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.convex.basic
import analysis.normed_space.bounded_linear_maps
import analysis.specific_limits
/-!
# Tangent cone
In this file, we define two p... |
90cba0a079fe82c42ea61f2eb7971ae91b8d0789 | 37a833c924892ee3ecb911484775a6d6ebb8984d | /src/category_theory/graphs/category.lean | 6db2b0627883630f058c03f9249fb377d163ad84 | [] | no_license | silky/lean-category-theory | 28126e80564a1f99e9c322d86b3f7d750da0afa1 | 0f029a2364975f56ac727d31d867a18c95c22fd8 | refs/heads/master | 1,589,555,811,646 | 1,554,673,665,000 | 1,554,673,665,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,241 | lean | -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Stephen Morgan and Scott Morrison
import category_theory.category
import category_theory.graphs
namespace category_theory
open category_theory.graphs
universes u v
variable {... |
ccac0f22ab4ba9fdd814370cff47d1b965f51ddd | 7541ac8517945d0f903ff5397e13e2ccd7c10573 | /src/category_theory/products/associator.lean | bcf034a8ccb887a3dc8d8c95e53b13a1ddd1c1d6 | [] | no_license | ramonfmir/lean-category-theory | 29b6bad9f62c2cdf7517a3135e5a12b340b4ed90 | be516bcbc2dc21b99df2bcb8dde0d1e8de79c9ad | refs/heads/master | 1,586,110,684,637 | 1,541,927,184,000 | 1,541,927,184,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,592 | 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.products
import category_theory.equivalence
open category_theory
namespace category_theory.prod
universes u₁ v₁ u₂ v₂ u₃... |
9c95781c0a8d6b1361420755c1ef816c1eec39aa | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /test/monotonicity.lean | e9538ac3d8105d86161706c1515a5035a7078540 | [
"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 | 8,589 | lean | /-
Copyright (c) 2019 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
-/
import tactic.monotonicity
import tactic.norm_num
import algebra.order.ring
import measure_theory.measure.lebesgue
import data.list.defs
open list tactic tactic.interactiv... |
33bf6be2d7b752af5b3bf6fbb3d725eb4c558a6f | 28b6e1a13d35e9b450f65c001660f4ec4713aa10 | /Search/Algorithm/BestFirst.lean | 11d4690b97a1e8ce8daa29b54e83c58a0473b33c | [
"Apache-2.0"
] | permissive | dselsam/search | 14e3af3261a7a70f8e5885db9722b186f96fe1f5 | 67003b859d2228d291a3873af6279c1f61430c64 | refs/heads/master | 1,684,700,794,306 | 1,614,294,810,000 | 1,614,294,810,000 | 339,578,823 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,944 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Daniel Selsam
-/
import Search.Transform.Classic
import Search.Heuristic
import Search.SaveRestore
namespace Search
namespace Algorithm
namespace BestFirst
variable {m : Type ... |
281742544aa5723d0e4c606b774dbd624c1c4759 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/category_theory/functor/category.lean | bf73ec5a9f3f1c6b3fd4ebc313564eb3b6f765ac | [
"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 | 5,396 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Tim Baumann, Stephen Morgan, Scott Morrison, Floris van Doorn
-/
import category_theory.natural_transformation
import category_theory.isomorphism
/-!
# The category of functors and na... |
b39fbf169826121ce1c41032ffd87f99d9a221ef | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/category_theory/instances/kleisli.lean | 3f6b6d76fc833ead1cdb156e0f21f469065fdf29 | [
"Apache-2.0"
] | permissive | fpvandoorn/mathlib | b21ab4068db079cbb8590b58fda9cc4bc1f35df4 | b3433a51ea8bc07c4159c1073838fc0ee9b8f227 | refs/heads/master | 1,624,791,089,608 | 1,556,715,231,000 | 1,556,715,231,000 | 165,722,980 | 5 | 0 | Apache-2.0 | 1,552,657,455,000 | 1,547,494,646,000 | Lean | UTF-8 | Lean | false | false | 1,186 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Simon Hudon
The Kleisli construction on the Type category
-/
import category_theory.category
universes u v
namespace category_theory
def Kleisli (m) [monad.{u v} m] := Type u
def Klei... |
4d8885029c838238aa9fc0b386f27efff8a7c6e1 | d642a6b1261b2cbe691e53561ac777b924751b63 | /src/analysis/calculus/times_cont_diff.lean | 5182bb6fcda03abd2f9565f716cbca5035928f64 | [
"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 | 39,741 | 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.fderiv
/-!
# Higher differentiability
A function is `C^1` on a domain if it is differentiable there, and its derivative is continuou... |
d2addccc9e3d621d532061bf1132b1e3ccd80e6f | c46a17c860913da8a635099f06be3a2416f6cdab | /middleschool.lean | 42d09ecaa43c16ebf211cce57e73cda7566e8b3a | [] | no_license | vladfi1/vfds | 4ed0b7fd810218c74eef933364b9aa6be4cc2551 | 664b0d1c8126c93b379115ffe5da7b943f3375d5 | refs/heads/master | 1,585,024,431,435 | 1,535,567,828,000 | 1,535,567,828,000 | 142,457,395 | 0 | 1 | null | 1,532,805,351,000 | 1,532,617,692,000 | Lean | UTF-8 | Lean | false | false | 5,237 | lean | -- inductive player : Type | a | b | c
open list
#print nat.no_confusion_type
#print nat.no_confusion
def adjacent_pred {α : Type} (p : α -> α -> Prop) : list α -> Prop
| [] := true
| [x] := true
| (x :: y :: tail) := p x y ∧ adjacent_pred (y :: tail)
def allp : list Prop -> Prop
| [] := true
| (x::xs) := x ∧ allp ... |
1a6b64890e2636ec873e25df123f6701fab08e4d | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/field_theory/separable.lean | 8e30edea7ffd78bfc1842834c1f7044b629f76d6 | [
"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 | 22,430 | 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.big_operators
import field_theory.minimal_polynomial
import field_theory.splitting_field
import field_theory.tower
/-!
# Separable polynomials
We... |
1f63cb01ee1cec51a00d57d0bae5073ef6faa032 | 98a293ccd858a15396cba300c1d91bc9d39bda52 | /src/mergeSort.lean | 0eac86520785df126df3eba1af2c44c5e1531709 | [] | no_license | Othmanh/merge-Sort | da3a9e2ddd987b99bdd725edd6a288c1e19d3598 | 424433f71e5f87b0a2351ee434901d499d5fc675 | refs/heads/main | 1,687,662,137,031 | 1,627,494,456,000 | 1,627,494,456,000 | 375,764,779 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,179 | lean | import tactic.linarith
import tactic.induction
import data.nat.basic
import data.list.sort
open nat
/- This lemma applies the strong induction principle on the lenght of a list. -/
@[elab_as_eliminator]
lemma list.strong_length_induction {α} {C : list α → Sort*}
(rec : ∀ xs : list α, (∀ ys : list α, ys.leng... |
67aa3b5959403d548df6cfdeee083d49a87c8e15 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/measure_theory/l1_space.lean | eaf79fabadaaf6f2df480b446a8ffc7d686d4fa0 | [
"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 | 39,859 | 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.ae_eq_fun
/-!
# Integrable functions and `L¹` space
In the first part of this file, the predicate `integrable` is defined and basic properties o... |
3c8f54dae3be1dbee7e2f0483a96067c77d33cb8 | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /src/Lean/Elab/Tactic/Config.lean | b2f30d517c82fee938f8a4fdf4e26b7f72c1ebf6 | [
"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 | 1,237 | 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.Eval
import Lean.Elab.Tactic.Basic
import Lean.Elab.SyntheticMVars
import Lean.Linter.MissingDocs
namespace Lean.Elab.Tactic
open Meta
mac... |
9ef7b45311040ddafb5e438141ab05f06dec5115 | b70447c014d9e71cf619ebc9f539b262c19c2e0b | /hott/algebra/bundled.hlean | cb6942964e4928dbab989be2ad091fca5ba2fb1c | [
"Apache-2.0"
] | permissive | ia0/lean2 | c20d8da69657f94b1d161f9590a4c635f8dc87f3 | d86284da630acb78fa5dc3b0b106153c50ffccd0 | refs/heads/master | 1,611,399,322,751 | 1,495,751,007,000 | 1,495,751,007,000 | 93,104,167 | 0 | 0 | null | 1,496,355,488,000 | 1,496,355,487,000 | null | UTF-8 | Lean | false | false | 5,629 | hlean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
Bundled structures
-/
import algebra.group
open algebra pointed is_trunc
namespace algebra
structure Semigroup :=
(carrier : Type) (struct : semigroup carrier)
attribut... |
dd18100229ac2cd6cc5d5dd097f0532aa4e9a071 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Compiler/LCNF/Simp/SimpM.lean | 59ae4baa69ccd99bb3b2d1d3727d86dc7b5b3c30 | [
"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 | 9,104 | 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.ImplementedByAttr
import Lean.Compiler.LCNF.Renaming
import Lean.Compiler.LCNF.ElimDead
import Lean.Compiler.LCNF.AlphaEqv
import Lean.... |
531e39e80d1b658fc17d957e078c757bea7a8e44 | 54c9ed381c63410c9b6af3b0a1722c41152f037f | /Lib4/PostPort.lean | 15dcecba130f4be86a7a722f815ef7924a5a9ac7 | [
"Apache-2.0"
] | permissive | dselsam/binport | 0233f1aa961a77c4fc96f0dccc780d958c5efc6c | aef374df0e169e2c3f1dc911de240c076315805c | refs/heads/master | 1,687,453,448,108 | 1,627,483,296,000 | 1,627,483,296,000 | 333,825,622 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 200 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Daniel Selsam
-/
import PostPort.Coe
import PostPort.Pow
|
1d5cc410266d38f06155834e9504da29f5bfdfe3 | 491068d2ad28831e7dade8d6dff871c3e49d9431 | /tests/lean/run/rewriter15.lean | a437423d50fbe76bc02cddb4b042069e7a9fe664 | [
"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 | 156 | lean | import data.nat
open nat
set_option rewriter.syntactic true
example (x : nat) (H1 : x = 0) : x + 0 + 0 = 0 :=
begin
rewrite *add_zero,
rewrite H1
end
|
0fde3f64322c83f92e3fd9964e68a976da715d9c | f3849be5d845a1cb97680f0bbbe03b85518312f0 | /library/init/data/option/instances.lean | da7b33cb010074521d415644eea5d8d103a39f96 | [
"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 | 1,200 | lean | /-
Copyright (c) 2017 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.option.basic
import init.meta.tactic
universes u v
@[inline] def option_bind {α : Type u} {β : Type v} : option α → (α → option β... |
529e0557606ccfa6b10b05335c9bd70c046c1034 | ae1e94c332e17c7dc7051ce976d5a9eebe7ab8a5 | /src/Lean/PrettyPrinter/Delaborator/Builtins.lean | 13d253bcc6e97ea42d2dfd251d67bb7a521b6394 | [
"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 | 22,199 | lean | /-
Copyright (c) 2020 Sebastian Ullrich. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
-/
import Lean.PrettyPrinter.Delaborator.Basic
import Lean.Parser
namespace Lean.PrettyPrinter.Delaborator
open Lean.Meta
open Lean.Parser.Term
@[builtinDelab f... |
b9e974fcdcc5d7f85cf511d2762cfdbd7c145a12 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/topology/shrinking_lemma.lean | 31c7f0514b6d4694ea089371ccd04a66ee9cc096 | [
"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 | 12,196 | lean | /-
Copyright (c) 2021 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov, Reid Barton
-/
import topology.separation
/-!
# The shrinking lemma
In this file we prove a few versions of the shrinking lemma. The lemma says that in a normal
top... |
fa1fe2fc4149708a549cddf8c4d286a3f8e52e6b | a4673261e60b025e2c8c825dfa4ab9108246c32e | /stage0/src/Lean/Compiler/IR/Basic.lean | d6a586be6fb5ce4f01286623665022baa82496fa | [
"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 | 25,770 | 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.Data.KVMap
import Lean.Data.Name
import Lean.Data.Format
import Lean.Compiler.ExternAttr
/-
Implements (extended) λPure and λRc proposed in the ... |
ce3809da7ea6c1d45b15717321084a5437a7c737 | 64874bd1010548c7f5a6e3e8902efa63baaff785 | /library/data/sum.lean | 3296b87ac90be311981e0ef46923ffb7223efa9f | [
"Apache-2.0"
] | permissive | tjiaqi/lean | 4634d729795c164664d10d093f3545287c76628f | d0ce4cf62f4246b0600c07e074d86e51f2195e30 | refs/heads/master | 1,622,323,796,480 | 1,422,643,069,000 | 1,422,643,069,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,017 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: data.sum
Authors: Leonardo de Moura, Jeremy Avigad
The sum type, aka disjoint union.
-/
import logic.connectives
open inhabited eq.ops
namespace sum
notation A ⊎ B := sum A ... |
f5d4daee76ee14574a6e0d3e1e523bf7158b6189 | a46270e2f76a375564f3b3e9c1bf7b635edc1f2c | /5.8.1-4.6.7.lean | 63d4863f0afa94b5fb87dcd477aaec58168c077d | [
"CC0-1.0"
] | permissive | wudcscheme/lean-exercise | 88ea2506714eac343de2a294d1132ee8ee6d3a20 | 5b23b9be3d361fff5e981d5be3a0a1175504b9f6 | refs/heads/master | 1,678,958,930,293 | 1,583,197,205,000 | 1,583,197,205,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 51 | lean | example (x : ℤ) : x * 0 = 0 := begin
simp
end
|
729696c4bce746635707b7333858de04c715fedd | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /stage0/src/Lean/Meta/Tactic/Rewrite.lean | 0be0607ad4a855fb4e5c6609b4835e4d3bc65895 | [
"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 | 2,729 | 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.AppBuilder
import Lean.Meta.MatchUtil
import Lean.Meta.KAbstract
import Lean.Meta.Check
import Lean.Meta.Tactic.Apply
namespace Lean.Meta
... |
882d9d1be740be458755a868347225b00d2c1154 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/t6.lean | ee7ff2b9d5069b5ef178c2cdd9663c10b0edf044 | [
"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 | 370 | lean | prelude
precedence `+` : 65
precedence `++` : 100
constant N : Type.{1}
constant f : N → N → N
constant a : N
#check
let g x y := f x y,
infix + := g,
b : N := a+a,
c := b+a,
h (x : N) := x+x,
postfix ++ := h,
d := c++,
... |
30f881a73c09b9cc30f8ef6b484125c06a98e5c0 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/measure_theory/measure/lebesgue.lean | 0249bbb9a3c6c0f096ad6fa92c5bc6babdd55bb2 | [
"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 | 24,978 | 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, Sébastien Gouëzel, Yury Kudryashov
-/
import dynamics.ergodic.measure_preserving
import linear_algebra.determinant
import linear_algebra.matrix.diagonal
import linear_a... |
c1c377109b453d8d34dfc89065b343b1a6a38edf | f3849be5d845a1cb97680f0bbbe03b85518312f0 | /tests/lean/run/reserve.lean | 7ee6a52e16a04d4021a83d33b025717d24f8ca5f | [
"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 | 178 | lean | reserve infix `=?=`:50
reserve infixr `&&&`:25
notation a `=?=` b := eq a b
notation a `&&&` b := and a b
set_option pp.notation false
#check λ a b : num, a =?= b &&& b =?= a
|
ffa04e367cbda22995a3aa8e521997f98bc70178 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/meta/converter/conv.lean | 622ec654b71ca5015ac6edac40093280f513aede | [] | 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 | 774 | 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
Converter monad for building simplifiers.
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.meta.tactic
import Mathlib.Lean3Lib.init.meta.simp_tactic
imp... |
94d2446dfb213218de931e9389d25b0055a4b9bf | ae1e94c332e17c7dc7051ce976d5a9eebe7ab8a5 | /src/Leanpkg/Proc.lean | f62c07c2c86f0fe5535e68c3e461830a4ffe1d0e | [
"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 | 730 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner, Sebastian Ullrich
-/
namespace Leanpkg
def execCmd (args : IO.Process.SpawnArgs) : IO Unit := do
let envstr := String.join <| args.env.toList.map fun (k, v) =>... |
8004dcde0357140c95432177e0f0388175b10820 | 9b9a16fa2cb737daee6b2785474678b6fa91d6d4 | /src/category_theory/whiskering.lean | 13dbbf7a8ef2b2f1539ebb77af84dab8e24e74f4 | [
"Apache-2.0"
] | permissive | johoelzl/mathlib | 253f46daa30b644d011e8e119025b01ad69735c4 | 592e3c7a2dfbd5826919b4605559d35d4d75938f | refs/heads/master | 1,625,657,216,488 | 1,551,374,946,000 | 1,551,374,946,000 | 98,915,829 | 0 | 0 | Apache-2.0 | 1,522,917,267,000 | 1,501,524,499,000 | Lean | UTF-8 | Lean | false | false | 5,580 | 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.isomorphism
import category_theory.functor_category
namespace category_theory
universes u₁ v₁ u₂ v₂ u₃ v₃ u₄ v₄
section
variables (C : T... |
fd7d57b792b141fc88c5086ea528f76e45518c62 | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/data/option/defs.lean | 36ebc54d059bf18f687e4eb9c1b6cea58524efa9 | [
"Apache-2.0"
] | permissive | rmitta/mathlib | 8d90aee30b4db2b013e01f62c33f297d7e64a43d | 883d974b608845bad30ae19e27e33c285200bf84 | refs/heads/master | 1,585,776,832,544 | 1,576,874,096,000 | 1,576,874,096,000 | 153,663,165 | 0 | 2 | Apache-2.0 | 1,544,806,490,000 | 1,539,884,365,000 | Lean | UTF-8 | Lean | false | false | 3,583 | 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.
-/
namespace option
variables {α : Type*} {β : Type*}
instance has_mem : has_mem α (option α) := ⟨λ a b, b = some a⟩
@[simp] theorem mem... |
7454ec3a7d3bf807d9cec9e3a979d2caa39462ad | bb31430994044506fa42fd667e2d556327e18dfe | /src/data/bool/count.lean | a1d3d07f72dddca8ac93dbadb71041f8d0da96ff | [
"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 | 4,360 | lean | /-
Copyright (c) 2022 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import data.nat.parity
/-!
# List of booleans
In this file we prove lemmas about the number of `ff`s and `tt`s in a list of booleans. First we
prove that the numb... |
c4eeb58a69d222cfca19ff100b292db7b1dbe6f8 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/rw_set2.lean | 71377a296594c44af8eb2292dfe355b6eaa2a76c | [
"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 | 35 | lean | import data.nat
print [simp] nat
|
4c3f952006672dbdba41cf1ec30d535cbd4ca2b2 | 94637389e03c919023691dcd05bd4411b1034aa5 | /src/inClassNotes/type_library/list.lean | 48c565748db3837c72a5ef9d0f976a667b548f3f | [] | no_license | kevinsullivan/complogic-s21 | 7c4eef2105abad899e46502270d9829d913e8afc | 99039501b770248c8ceb39890be5dfe129dc1082 | refs/heads/master | 1,682,985,669,944 | 1,621,126,241,000 | 1,621,126,241,000 | 335,706,272 | 0 | 38 | null | 1,618,325,669,000 | 1,612,374,118,000 | Lean | UTF-8 | Lean | false | false | 610 | lean | namespace hidden
universe u
inductive list (α : Type u) : Type u
| nil {} : list
| cons (h : α) (t : list) : list
#check list
#check list nat
#check list string
#check list bool
def l : list nat := list.nil
def t : list nat :=
list.cons
(3)
(list.cons
(4)
(list.cons
5
list.ni... |
1419b1c2586d0fbe7bebd0cd0dea1b0bf48cdb09 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/category_theory/discrete_category.lean | 3f2cfa4fcb498c1a28b9af72e2616a9ee73e7b45 | [
"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,217 | 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, Floris van Doorn
-/
import category_theory.eq_to_hom
import data.ulift
/-!
# Discrete categories
We define `discrete α := α` for any type `α`, and use... |
953b407d85058a97126c0c87fb7be0937235f415 | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /stage0/src/Lean/Parser/Basic.lean | edd32307a3c203f48e899f7966cd58ff1fcae45e | [
"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 | 75,445 | 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
-/
/-!
# Basic Lean parser infrastructure
The Lean parser was developed with the following primary goals in mind:
* flexibility: Lean's g... |
52c25b8051b6b7881d8d2f5e46d5bcce1c37b6bb | 4727251e0cd73359b15b664c3170e5d754078599 | /src/topology/sheaves/functors.lean | 0ca023927481e8a8202ee581677d073f72eadc8e | [
"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 | 2,429 | lean | /-
Copyright (c) 2021 Junyan Xu. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Junyan Xu
-/
import topology.sheaves.sheaf_condition.pairwise_intersections
/-!
# functors between categories of sheaves
Show that the pushforward of a sheaf is a sheaf, and define
the p... |
4864d6a9b888a83c584db39d694377e797abbdaf | a51edd9a1700339fa6dc7dc428eb5dfa3994b8bc | /src/misc/vm_check.lean | de144ea4f7d51b41ffb21a34a15636331273a515 | [] | no_license | avigad/formal_logic | 83f5c0534b3e9e7da53eff01bb82289daad65555 | 59d7fe7cb7a7927fb72d89d4fd40965bcd769349 | refs/heads/master | 1,585,302,642,116 | 1,541,000,469,000 | 1,541,000,469,000 | 146,376,915 | 1 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 907 | lean | axiom vm_checked {P : Prop} : P
open tactic
/-- Uses the vm to cerify a goal of the form t = tt, where t is a closed boolean term -/
meta def vm_check_tt : tactic unit := do
tgt ← target,
match tgt with
| `(%%t = tt) := do et ← eval_expr bool t,
match et with
| tt := applyc ``v... |
c971421d2b2b8b6e2d3bd8e53f8b5da0905b6f66 | 026eca3e4f104406f03192524c0ebed8b40e468b | /library/init/data/nat/lemmas.lean | fef406cde1b067e4c7d2861efd016404383c7977 | [
"Apache-2.0"
] | permissive | jpablo/lean | 99bebe8f1c3e3df37e19fc4af27d4261efa40bc6 | bec8f0688552bc64f9c08fe0459f3fb20f93cb33 | refs/heads/master | 1,679,677,848,004 | 1,615,913,211,000 | 1,615,913,211,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 47,278 | 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, Jeremy Avigad
-/
prelude
import init.data.nat.basic init.data.nat.div init.meta init.algebra.functions
universes u
namespace nat
attribute [pre_smt] nat_zero... |
636e4a9aeb1d7baae3ab00b1b4d0ec4e6ff0e138 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /library/logic/connectives.lean | 820c86030fd3e8fe2881c9c56d25b189499eb03e | [
"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 | 5,051 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Haitao Zhang
The propositional connectives. See also init.datatypes and init.logic.
-/
open eq.ops
variables {a b c d : Prop}
/- implies -/
... |
467c6c5b29523516f8682d7f76eb9155dcc00cad | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/run/meta_tac7.lean | c6ff543b1da15f346ad85af88cd7d4390c785f2b | [
"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 | 196 | lean | open nat tactic
example (a b c : Prop) (Ha : a) (Hb : b) (Hc : c) : b :=
by do trace_state, assumption
definition ex1 (a b c : Prop) : a → b → c → b :=
by do intros, assumption
print ex1
|
eb6580e83f9dbed75e4e5695ef77e0eadb69479c | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /stage0/src/Lean/Elab/PreDefinition/WF/PackMutual.lean | d748b70fbbc935c1a20865570aa408a0d1a566df | [
"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 | 8,585 | 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.PreDefinition.Basic
namespace Lean.Elab.WF
open Meta
/-- Combine different function domains `ds` using `PSum`s -/
private def mkNewDomain... |
2dac0122a16622f3ef6f7d96e84b5a373188d753 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/order/category/Preorder.lean | 75cb06958c7419d87c98321e418e1d1eb3fdf863 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 2,546 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import category_theory.category.Cat
import category_theory.category.preorder
import category_theory.concrete_category.bundled_hom
import order.hom.basic
/-!
# Catego... |
328a7fb20516a417f86eaf7fb7da3e8746961734 | 690889011852559ee5ac4dfea77092de8c832e7e | /src/topology/uniform_space/completion.lean | 644ded44bc9eb641768f59937c05a3ca5da71753 | [
"Apache-2.0"
] | permissive | williamdemeo/mathlib | f6df180148f8acc91de9ba5e558976ab40a872c7 | 1fa03c29f9f273203bbffb79d10d31f696b3d317 | refs/heads/master | 1,584,785,260,929 | 1,572,195,914,000 | 1,572,195,913,000 | 138,435,193 | 0 | 0 | Apache-2.0 | 1,529,789,739,000 | 1,529,789,739,000 | null | UTF-8 | Lean | false | false | 24,891 | 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.
The goal is to construct a left-adjoint to the inclusion of complete Hausdorff uniform spaces
into all uniform... |
6dc845bc3dccd63f7f88b692f6061ac493292098 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/anonymous_param.lean | 1873ab3a1d790147a7160c1e7c416a08366c66cb | [
"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 | #check λ _, nat
#check λ (_ _ : nat), nat
#check λ _ _ : nat, nat
#check (λ _, 0 : nat → nat)
def f (_ : nat) : nat :=
0
|
05215ed649d39e8bf21b182b4f1c562319458beb | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Data/Lsp/TextSync.lean | 96b796d8b7f690990e9cce1441225e196fc9aef5 | [
"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,837 | lean | /-
Copyright (c) 2020 Marc Huisinga. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Marc Huisinga, Wojciech Nawrocki
-/
import Lean.Data.Json
import Lean.Data.Lsp.Basic
/-! Section "Text Document Synchronization" of the LSP spec. -/
namespace Lean
namespace Lsp
ope... |
3bb1db2a42610614548d96a024b2b5d99346c5c6 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebra/triv_sq_zero_ext.lean | 29181f505e0752fd6240ecd68b13bda3dc78669c | [
"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 | 16,678 | 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.algebra.basic
import linear_algebra.prod
/-!
# Trivial Square-Zero Extension
Given a module `M` over a ring `R`, the trivial square-zero extension of `M` over... |
df6cd6f586854b0cb4fea03d5657744c07b54cb3 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/notation5.lean | 59646ea799578c89a0e1c1a0bb74a194766a4c61 | [
"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 | 118 | lean | import data.num
notation `((` := 1
precedence `(` : 30
notation `))` := 1
notation `,,` := 1
precedence `,` : 10
|
3ccfec2064e3b3ebb7c001d0b420404106bf6e6b | 6094e25ea0b7699e642463b48e51b2ead6ddc23f | /tests/lean/axioms_of.lean | 2ff97f5227895d1477b4721e5c869ce763e8c3d1 | [
"Apache-2.0"
] | permissive | gbaz/lean | a7835c4e3006fbbb079e8f8ffe18aacc45adebfb | a501c308be3acaa50a2c0610ce2e0d71becf8032 | refs/heads/master | 1,611,198,791,433 | 1,451,339,111,000 | 1,451,339,111,000 | 48,713,797 | 0 | 0 | null | 1,451,338,939,000 | 1,451,338,939,000 | null | UTF-8 | Lean | false | false | 243 | lean | import data.finset data.rat
print axioms nat.add
print "-----"
print axioms int.add
print "-----"
print axioms rat.add
print "-----"
print axioms finset.union
print "-----"
print axioms finset.mem
print "-----"
print axioms finset.union.comm
|
39b0e45e63c56b9a5e3e3a82e26d25470aa2ae0b | 491068d2ad28831e7dade8d6dff871c3e49d9431 | /tests/lean/run/tree3.lean | cc2f84bcc889c8ed4509c9a064c61f3fbf420023 | [
"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 | 2,512 | lean | import logic data.prod
open eq.ops prod tactic
inductive tree (A : Type) :=
| leaf : A → tree A
| node : tree A → tree A → tree A
inductive one.{l} : Type.{max 1 l} :=
star : one
set_option pp.universes true
namespace tree
namespace manual
section
universe variables l₁ l₂
variable {A : Type.{l₁}}
va... |
12ee6bf8846fab9f9b075319efba0e6433a76850 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/group_theory/commutator.lean | 8ad98a85d3bc5c169b2d5c86af26cd29a4a60a48 | [
"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,983 | lean | /-
Copyright (c) 2021 Jordan Brown, Thomas Browning, Patrick Lutz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jordan Brown, Thomas Browning, Patrick Lutz
-/
import data.bracket
import group_theory.subgroup.basic
import tactic.group
/-!
# Commutators of Subgroups
... |
1f190bd9d38793aeed36e68fc962a0387a2c28fc | ebf7140a9ea507409ff4c994124fa36e79b4ae35 | /src/hints/category_theory/exercise1/hint1.lean | 518f7dfe6161007dc382d0da6f698744c30e7eca | [] | no_license | fundou/lftcm2020 | 3e88d58a92755ea5dd49f19c36239c35286ecf5e | 99d11bf3bcd71ffeaef0250caa08ecc46e69b55b | refs/heads/master | 1,685,610,799,304 | 1,624,070,416,000 | 1,624,070,416,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 718 | lean | import category_theory.isomorphism
import category_theory.yoneda
open category_theory
open opposite
variables {C : Type*} [category C]
def iso_of_hom_iso_attempt_1 (X Y : C) (h : yoneda.obj X ≅ yoneda.obj Y) : X ≅ Y :=
-- We're trying to construct an isomorphism, so our first task is to write a stub for the structur... |
88f0b7908d5708446192cd819333bad0c1fe77a1 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/analysis/asymptotics/theta.lean | f5cca8f17b8c1b12a76961335a9b126840f54a36 | [
"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 | 8,957 | lean | /-
Copyright (c) 2022 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov
-/
import analysis.asymptotics.asymptotics
/-!
# Asymptotic equivalence up to a constant
In this file we define `asymptotics.is_Theta l f g` (notation: `f =Θ[l... |
d7f8ec1e01c5dbe0be9c28f03fed469d3ece45f1 | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/category_theory/equivalence.lean | 008fecb5bc77443cf4f4463e615987a747515498 | [
"Apache-2.0"
] | permissive | rmitta/mathlib | 8d90aee30b4db2b013e01f62c33f297d7e64a43d | 883d974b608845bad30ae19e27e33c285200bf84 | refs/heads/master | 1,585,776,832,544 | 1,576,874,096,000 | 1,576,874,096,000 | 153,663,165 | 0 | 2 | Apache-2.0 | 1,544,806,490,000 | 1,539,884,365,000 | Lean | UTF-8 | Lean | false | false | 14,346 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Tim Baumann, Stephen Morgan, Scott Morrison, Floris van Doorn
-/
import category_theory.fully_faithful
import category_theory.whiskering
import category_theory.natural_isomorphism
impo... |
2a7724ed354aaa0db3d0298a197e1f2325221fbe | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/lean/lcnfTypes.lean | ef514d113a6bc8b6cea0305984f2350b0fc581df | [
"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,767 | lean | import Lean
notation "◾" => lcErased
notation "⊤" => lcAny
open Lean Compiler Meta
def test (declName : Name) : MetaM Unit := do
IO.println s!"{declName} : {← ppExpr (← getDeclLCNFType declName)}"
inductive Vec (α : Type u) : Nat → Type u
| nil : Vec α 0
| cons : α → Vec α n → Vec α (n+1)
def Vec.zip : Vec α... |
6fe496890089c54b98af62e2e3c7cb7b74e75e97 | 6e41ee3ac9b96e8980a16295cc21f131e731884f | /hott/algebra/group.hlean | b5a869c55764078830771c4b0b894b68b52b44a9 | [
"Apache-2.0"
] | permissive | EgbertRijke/lean | 3426cfa0e5b3d35d12fc3fd7318b35574cb67dc3 | 4f2e0c6d7fc9274d953cfa1c37ab2f3e799ab183 | refs/heads/master | 1,610,834,871,476 | 1,422,159,801,000 | 1,422,159,801,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 18,215 | hlean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: algebra.group
Authors: Jeremy Avigad, Leonardo de Moura
Various multiplicative and additive structures. Partially modeled on Isabelle's library.
-/
import algebra.binary
open eq trun... |
90873f187b08c564bef0e6712c1af5bbe0342977 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebra/lie/of_associative.lean | 99e834dfe38d8f53f35b2f834de10b814cd7930c | [
"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 | 9,960 | 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.basic
import algebra.lie.subalgebra
import algebra.lie.submodule
import algebra.algebra.subalgebra.basic
/-!
# Lie algebras of associative algebras
Thi... |
a567d5028ef5d81575d0b98292d76292b9360483 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/topology/metric_space/gluing.lean | 15e54523b73a8eced67aede077ca121cd96448c8 | [
"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 | 32,225 | 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 topology.metric_space.isometry
/-!
# Metric space gluing
Gluing two metric spaces along a common subset. Formally, we are given
```
Φ
Z ---> X
... |
aa70765c3ee8647061f6a36638623432637038d3 | 46125763b4dbf50619e8846a1371029346f4c3db | /src/topology/constructions.lean | 02707ef244e0571744929ff9bb43ebf7494723c0 | [
"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 | 30,185 | 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 topology.maps
/-!
# Constructions of new topological spaces from old ones
This file constructs products, sums, subtypes and q... |
acff1801aeb8579f0ee72c9f51230a9e887e0282 | 4e3bf8e2b29061457a887ac8889e88fa5aa0e34c | /lean/love12_basic_mathematical_structures_demo.lean | 06bc0bf4781a341cbadaacc0a5ea16a455229211 | [] | no_license | mukeshtiwari/logical_verification_2019 | 9f964c067a71f65eb8884743273fbeef99e6503d | 16f62717f55ed5b7b87e03ae0134791a9bef9b9a | refs/heads/master | 1,619,158,844,208 | 1,585,139,500,000 | 1,585,139,500,000 | 249,906,380 | 0 | 0 | null | 1,585,118,728,000 | 1,585,118,727,000 | null | UTF-8 | Lean | false | false | 6,197 | lean | /- LoVe Demo 12: Basic Mathematical Structures -/
import .love05_inductive_predicates_demo
namespace LoVe
/- Type Classes -/
-- The `inhabited` typeclass for types that contain at least one element
#check inhabited
-- `nonempty` lives in `Prop`, whereas `inhabited` lives in `Type`
#check nonempty
-- Recall: `hea... |
679c9b6852254079b283ef11910fe8411b79328c | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/with_cases1.lean | 88da6116689b5e2b230d71a07e83076581caca8d | [
"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 | 1,402 | lean | example (n : nat) (m : nat) : n > m → m < n :=
begin
with_cases { revert m, induction n },
case nat.zero : m' { show 0 > m' → m' < 0, admit },
case nat.succ : n' ih m' { show nat.succ n' > m' → m' < nat.succ n', admit }
end
example (n : nat) (m : nat) : n > m → m < n :=
begin
with_cases { revert m, induction n... |
cae83f519ab510d866c52073d0c2c353f1ccbb52 | 853df553b1d6ca524e3f0a79aedd32dde5d27ec3 | /src/ring_theory/algebraic.lean | 48abe2914247975cff1057c07089c7fdfb3c7cb1 | [
"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 | 4,654 | lean | /-
Copyright (c) 2019 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import linear_algebra.finite_dimensional
import ring_theory.integral_closure
/-!
# Algebraic elements and algebraic extensions
An element of an R-algebra is algebr... |
c78a10cdfe7fd32309c14b7666a793b4d88ae9e5 | 3ed5a65c1ab3ce5d1a094edce8fa3287980f197b | /src/herstein/ex2_3/Q_03.lean | 062ca8675de239e631088e37cd3aad74964d81a8 | [] | 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 | 844 | lean | import algebra.group algebra.group_power
variables {G: Type*}
theorem Q_03 [hG: group G]:
(∀ a b: G, (a * b) ^ 2 = a ^ 2 * b ^ 2) → comm_group G :=
λ h, begin
have lem: ∀ a b: G, a * (a * b) * b = a * (b * a) * b,
from λ a b, calc a * (a * b) * b
= a * a * (b * b) : by rw [←mul_assoc, mul_assoc]
... |
05da6531ebabcca88f109e5a9e1c10fe88f9686c | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/topology/bases.lean | c0049e831da344cbd6197c2710796a13950f55a5 | [
"Apache-2.0"
] | permissive | fpvandoorn/mathlib | b21ab4068db079cbb8590b58fda9cc4bc1f35df4 | b3433a51ea8bc07c4159c1073838fc0ee9b8f227 | refs/heads/master | 1,624,791,089,608 | 1,556,715,231,000 | 1,556,715,231,000 | 165,722,980 | 5 | 0 | Apache-2.0 | 1,552,657,455,000 | 1,547,494,646,000 | Lean | UTF-8 | Lean | false | false | 10,502 | 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
Bases of topologies. Countability axioms.
-/
import topology.order data.set.countable
open set filter lattice classical
namespace topological_space
/... |
64484a04779bd65eea2b77e5e68f1b5f19c33573 | bb31430994044506fa42fd667e2d556327e18dfe | /src/number_theory/cyclotomic/discriminant.lean | f268b04516fcd5969f8ad7cbe0de31f8c57c2fca | [
"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 | 11,500 | lean | /-
Copyright (c) 2022 Riccardo Brasca. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Riccardo Brasca
-/
import number_theory.cyclotomic.primitive_roots
import ring_theory.discriminant
/-!
# Discriminant of cyclotomic fields
We compute the discriminant of a `p ^ n`-t... |
80b27f6d77f105b42170111e899cb34e428af901 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/analysis/normed_space/hahn_banach.lean | 799ee2f8b85d3e1243cf1a43271fcd6b74cc2825 | [
"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 | 6,501 | lean | /-
Copyright (c) 2020 Yury Kudryashov All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov, Heather Macbeth
-/
import analysis.convex.cone
import analysis.normed_space.is_R_or_C
import analysis.normed_space.extend
/-!
# Hahn-Banach theorem
In this file we p... |
58e55cf3460be496c38622b3a16ae78d5048c9ec | 4727251e0cd73359b15b664c3170e5d754078599 | /src/category_theory/limits/preserves/functor_category.lean | a267cd407e0df511cb70ef67046371e13f39334f | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 4,489 | 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.functor_category
import category_theory.limits.preserves.shapes.binary_products
import category_theory.limits.yoneda
import category_theory.... |
04972b25704451d74ac4b8594bf2e44a7bd4613f | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/data/set/basic.lean | 173d157289d0c2990174cdb935e4e8ee3a8bb820 | [
"Apache-2.0"
] | permissive | fpvandoorn/mathlib | b21ab4068db079cbb8590b58fda9cc4bc1f35df4 | b3433a51ea8bc07c4159c1073838fc0ee9b8f227 | refs/heads/master | 1,624,791,089,608 | 1,556,715,231,000 | 1,556,715,231,000 | 165,722,980 | 5 | 0 | Apache-2.0 | 1,552,657,455,000 | 1,547,494,646,000 | Lean | UTF-8 | Lean | false | false | 52,575 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad, Leonardo de Moura
-/
import tactic.finish data.subtype tactic.interactive
open function
/- set coercion to a type -/
namespace set
instance {α : Type*} : has_coe_to_sort... |
38f1f56ebee51ea94d807c113bc044b1f00291f4 | 618003631150032a5676f229d13a079ac875ff77 | /src/topology/dense_embedding.lean | a76820dc1893b2dfd0f90a56b18e57d8bf7edb5f | [
"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 | 14,559 | lean | /-
Copyright (c) 2019 Reid Barton. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro, Patrick Massot
-/
import topology.separation
/-!
# Dense embeddings
This file defines three properties of functions:
* `dense_range f` means `f` ha... |
5b11911767697772ae3cbf07943095031bfc94f9 | 26bff4ed296b8373c92b6b025f5d60cdf02104b9 | /hott/algebra/groupoid.hlean | 591c9b7b411406eaa0e948c1ed97e99e68bf5fd1 | [
"Apache-2.0"
] | permissive | guiquanz/lean | b8a878ea24f237b84b0e6f6be2f300e8bf028229 | 242f8ba0486860e53e257c443e965a82ee342db3 | refs/heads/master | 1,526,680,092,098 | 1,427,492,833,000 | 1,427,493,281,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,054 | hlean | /-
Copyright (c) 2014 Jakob von Raumer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: algebra.groupoid
Author: Jakob von Raumer
Ported from Coq HoTT
-/
import .precategory.iso .group
open eq is_trunc iso category path_algebra nat unit
namespace category
structu... |
a4c9e4e072e378a24e9501120525f40b441a9ec1 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/interactive/goalIssue.lean | 76554d1ad133332a31e6ba505a56b444117e31b1 | [
"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 | 261 | lean | theorem foo1 (x : Nat) : 0 + x = x := by
first
| skip; have : x + x = x + x := rfl; done
--^ $/lean/plainGoal
| simp
theorem foo2 (x : Nat) : 0 + x = x := by
induction x with
| zero => done
--^ $/lean/plainGoal
| succ => done
|
67f04fae7e2a1a66d7edb5ff89ab4f8b2008f75d | 80b18137872dad7c3df334b9069d70935b4224f3 | /src/analysis/calculus/fderiv.lean | 5ddc72d845f5490c673fe5b99d37ba90f14cafa0 | [
"Apache-2.0"
] | permissive | Jack-Pumpkinhead/mathlib | 1bcf5692d355dc397847791c137158f01b407535 | da8b23f907f750528539bffa604875b98717fb93 | refs/heads/master | 1,621,299,949,262 | 1,585,480,767,000 | 1,585,480,767,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 84,309 | lean | /-
Copyright (c) 2019 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Sébastien Gouëzel, Yury Kudryashov
-/
import analysis.asymptotics analysis.calculus.tangent_cone
/-!
# The Fréchet derivative
Let `E` and `F` be normed spaces, `f : E ... |
780addb28257f0586df10d690ced801225b430ba | 626e312b5c1cb2d88fca108f5933076012633192 | /src/analysis/convex/specific_functions.lean | 27d5e4f76cfc70b42746bdbfd5de4871086d03fb | [
"Apache-2.0"
] | permissive | Bioye97/mathlib | 9db2f9ee54418d29dd06996279ba9dc874fd6beb | 782a20a27ee83b523f801ff34efb1a9557085019 | refs/heads/master | 1,690,305,956,488 | 1,631,067,774,000 | 1,631,067,774,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,261 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov, Sébastien Gouëzel
-/
import analysis.calculus.mean_value
import analysis.special_functions.pow
/-!
# Collection of convex functions
In this file we prove that the f... |
9db26c4c0c0a46d063e1c204503c72d80f053db6 | 9dd3f3912f7321eb58ee9aa8f21778ad6221f87c | /library/init/meta/format.lean | d45ecaf2042ea0343ab33d67954764b08a81364a | [
"Apache-2.0"
] | permissive | bre7k30/lean | de893411bcfa7b3c5572e61b9e1c52951b310aa4 | 5a924699d076dab1bd5af23a8f910b433e598d7a | refs/heads/master | 1,610,900,145,817 | 1,488,006,845,000 | 1,488,006,845,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,570 | 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.options
universes u v
inductive format.color
| red | green | orange | blue | pink | cyan | grey
meta constant format : Type
meta... |
c0cb0b7e447caf6fbf59406d186978e1b06d30b5 | bb31430994044506fa42fd667e2d556327e18dfe | /src/field_theory/fixed.lean | f8192a036843837c9c31ac053475f02dd4715bb4 | [
"Apache-2.0"
] | permissive | sgouezel/mathlib | 0cb4e5335a2ba189fa7af96d83a377f83270e503 | 00638177efd1b2534fc5269363ebf42a7871df9a | refs/heads/master | 1,674,527,483,042 | 1,673,665,568,000 | 1,673,665,568,000 | 119,598,202 | 0 | 0 | null | 1,517,348,647,000 | 1,517,348,646,000 | null | UTF-8 | Lean | false | false | 14,408 | 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.group_ring_action.invariant
import algebra.polynomial.group_ring_action
import field_theory.normal
import field_theory.separable
import field_theory.tower
/-!
... |
3123ad51b5dd355b437322bcf981f301a6ba9f8b | d1bbf1801b3dcb214451d48214589f511061da63 | /src/linear_algebra/basic.lean | 2b62d813b23a4d217167250c524d8882faf12408 | [
"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 | 107,669 | 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, Kevin Buzzard, Yury Kudryashov
-/
import algebra.big_operators.pi
import algebra.module.pi
import algebra.module.prod
import algebra.module.submodule
im... |
7239b4b5f1c35ed7f8873cb2c6f8e8197c2b353e | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/char_p/two.lean | c69cce8d5f6c3ba99befed9797e32dfd83518f6b | [
"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 | 3,337 | lean | /-
Copyright (c) 2021 Eric Wieser. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Eric Wieser
-/
import algebra.char_p.basic
/-!
# Lemmas about rings of characteristic two
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding P... |
9e237075668cdfc63b46b4d643645250ce446e19 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/analysis/calculus/specific_functions.lean | 43480bbf2259a894865803e9591d3b0f2b5fa6ee | [
"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 | 18,942 | 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
-/
import analysis.calculus.iterated_deriv
import analysis.inner_product_space.euclidean_dist
/-!
# Infinitely smooth bump function
In this file we construct sev... |
e3a902bcbc8c6bc35f8d58a98d5d06c8b87542c6 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/topology/sheaves/sheaf.lean | d97c773eeecf1ee9cdf3ffaab57b16c526e3e459 | [
"Apache-2.0"
] | permissive | AntoineChambert-Loir/mathlib | 64aabb896129885f12296a799818061bc90da1ff | 07be904260ab6e36a5769680b6012f03a4727134 | refs/heads/master | 1,693,187,631,771 | 1,636,719,886,000 | 1,636,719,886,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,686 | 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 topology.sheaves.sheaf_condition.equalizer_products
import category_theory.full_subcategory
/-!
# Sheaves
We define sheaves on a topological space, with valu... |
88c5da3e0d8b4a06d7996c50ebd7fdd2a7f4f37b | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tests/lean/run/structuralIssue2.lean | 797da1daa235d96bbfaf5cc7d36a07db4d1667a7 | [
"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 | 744 | lean | namespace List
@[simp] theorem filter_nil {p : α → Bool} : filter p [] = [] := by
simp [filter, filterAux, reverse, reverseAux]
theorem cons_eq_append (a : α) (as : List α) : a :: as = [a] ++ as := rfl
theorem filter_cons (a : α) (as : List α) :
filter p (a :: as) = if p a then a :: filter p as else filter p as ... |
547f0f735cbb56f4b5468daf8f9dd6823a335464 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/number_theory/primorial.lean | 99f8a7ae25b6fff273fde028befdcd2666978a3d | [
"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 | 6,733 | lean | /-
Copyright (c) 2020 Patrick Stevens. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Stevens
-/
import tactic.ring_exp
import data.nat.parity
import data.nat.choose.sum
/-!
# Primorial
This file defines the primorial function (the product of primes less than... |
22c631d6dc9f08a6ab41780dc9cd21308a5d8d03 | 205f0fc16279a69ea36e9fd158e3a97b06834ce2 | /src/14.Inductive_Definitions/Data_Types/mynat.lean | bd87ec3faa6412703da4b1842c1ff777f819c61f | [] | no_license | kevinsullivan/cs-dm-lean | b21d3ca1a9b2a0751ba13fcb4e7b258010a5d124 | a06a94e98be77170ca1df486c8189338b16cf6c6 | refs/heads/master | 1,585,948,743,595 | 1,544,339,346,000 | 1,544,339,346,000 | 155,570,767 | 1 | 3 | null | 1,541,540,372,000 | 1,540,995,993,000 | Lean | UTF-8 | Lean | false | false | 5,823 | lean | namespace mynat
/-
Our own implementation of nat
-/
inductive mynat : Type
| zero : mynat
| succ : mynat → mynat
/-
Convenient names for first few terms -/
def zero := mynat.zero
def one := mynat.succ zero
def two := mynat.succ one
def three :=
mynat.succ
(mynat.succ
(mynat.succ
... |
e806d8cbdb354d4cf061572313867ac640df0aad | 07f5f86b00fed90a419ccda4298d8b795a68f657 | /library/data/rbtree/find.lean | 95444205d5ba9394499c544451aaaad0bf871463 | [
"Apache-2.0"
] | permissive | VBaratham/lean | 8ec5c3167b4835cfbcd7f25e2173d61ad9416b3a | 450ca5834c1c35318e4b47d553bb9820c1b3eee7 | refs/heads/master | 1,629,649,471,814 | 1,512,060,373,000 | 1,512,060,469,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,226 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import data.rbtree.basic
universe u
/- TODO(Leo): remove after we cleanup stdlib simp lemmas -/
local attribute [-simp] or.comm or.left_comm or.assoc and.c... |
c1a379443fce491585b73bf4127abc1d1462b26a | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /stage0/src/Lean/Meta/Tactic/Cases.lean | 860332baddd53742b0076da8d10adb95676aa0d5 | [
"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 | 16,234 | 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.AppBuilder
import Lean.Meta.Tactic.Induction
import Lean.Meta.Tactic.Injection
import Lean.Meta.Tactic.Assert
import Lean.Meta.Tactic.Subst... |
ef083011e99c8608e668d35a67deacec3340fc91 | 8cd4726d66eec7673bcc0325fed07d5ba5bf17c4 | /hw3b.lean | 4679cbdbbd66cdcfdcce8275613008303c397ead | [] | no_license | justinqcai/CS2102 | 8c5fddedffa6147fedd4b6ee7d5d39fc21f0ddab | d309f0db3f1df52eb77206ee1e8665a3b49d7a0c | refs/heads/master | 1,590,108,991,894 | 1,557,610,044,000 | 1,557,610,044,000 | 186,064,169 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,654 | lean | /-
Justin Cai, jc5pz
CS 2102 Spring 2019 Homework #3b
The first part of your homework this week is to make
a new copy of the *blank* homework #2 assignment in
your "work" directory, now called "hw3a.lean", then
complete the questions that you did *not* complete
last week. To rename the file after copying it, click
on... |
554d3c2b21273f65805dda2ce801f3d1310ed1dd | cbb817439c51008d66b37ce6b1964fea61434d35 | /theorem-proving-in-lean/src/chap_2.lean | a09b3e5f2692f748e258a09ab0940378aa5da97d | [] | no_license | tomhoule/theorem-proving-in-lean-exercises | a07f99d4f6b41ce003e8a0274c7bc46359fa62b2 | 60ccc71b8a6df6924e7cc90aab713b804f78da9f | refs/heads/master | 1,663,582,321,828 | 1,590,352,467,000 | 1,590,352,476,000 | 257,107,936 | 3 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,106 | lean | def Do_Twice : ((ℕ → ℕ) → (ℕ → ℕ)) → (ℕ → ℕ) → (ℕ → ℕ) := λ doubler, λ original, doubler $ doubler original
-- Exercise 1
def do_twice (f : ℕ → ℕ) (x : ℕ) : ℕ := f (f x)
def double (n : ℕ) : ℕ := n * 2
-- test
def doubling_two_twice : ℕ := do_twice double 2
#reduce doubling_two_twice
#reduce Do_Twice do_twice dou... |
2fc8e78249cd3e2a9ce36d30fc3f3d7eda4380ec | 6dafe3cbeb81b4a792fbf679e64eccb29225af1c | /equiv_relns_partitions.lean | 63c229fc89214a192cc5b451782d8eadcd93668a | [] | no_license | Shiney/xena | 9bdf22f0036baa7b22753e1e0b8101ca367551b6 | 8ff8f04d79b29a7a33bfefa318fd552388d0b989 | refs/heads/master | 1,623,652,579,961 | 1,586,444,931,000 | 1,586,444,931,000 | 254,480,076 | 0 | 0 | null | 1,586,466,973,000 | 1,586,466,973,000 | null | UTF-8 | Lean | false | false | 4,344 | lean | import data.equiv.basic
structure partition (X : Type) :=
(C : set (set X))
(Hnonempty : ∀ c ∈ C, c ≠ ∅)
(Hcover : ∀ x, ∃ c ∈ C, x ∈ c)
(Hunique : ∀ c d ∈ C, c ∩ d ≠ ∅ → c = d)
def partition.ext {X : Type} (P Q : partition X) (H : P.C = Q.C) : P = Q :=
begin
cases P, cases Q,
rwa partition.mk.inj_eq,
end
def eq... |
6845aac84a6201a6f32654327b523bf11acdaba0 | 439bc6c3e74a118aa51df633b8e1f24415804d86 | /yoneda.lean | 91f11b7726240dc747a9356b0dec82c0ada8029d | [] | no_license | jcommelin/lt2019_slides | 4ca498db02b5187c5778c21b985126d52d260696 | 3234cd92920d3d4321cc2cef78b48e5fa55be413 | refs/heads/master | 1,586,718,101,957 | 1,546,930,855,000 | 1,546,930,855,000 | 162,697,592 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 463 | lean | variables {C : Type u₁} [𝒞 : category.{v₁} C]
include 𝒞
def yoneda : C ⥤ ((Cᵒᵖ) ⥤ (Type v₁)) :=
{ obj := λ X,
{ obj := λ Y : C, Y ⟶ X,
map := λ Y Y' f g, f ≫ g,
map_comp' :=
begin
intros X_1 Y Z f g,
ext1, dsimp at *,
erw [category.assoc]
end,
map_id' :=
begin
intro... |
6e9d5cc0d6868ee4454c6433fc6d140bfeb36e47 | 32da3d0f92cab08875472ef6cacc1931c2b3eafa | /src/measure_theory/pi.lean | a21472892ca8e66042dc4086e1a494f2539d1691 | [
"Apache-2.0"
] | permissive | karthiknadig/mathlib | b6073c3748860bfc9a3e55da86afcddba62dc913 | 33a86cfff12d7f200d0010cd03b95e9b69a6c1a5 | refs/heads/master | 1,676,389,371,851 | 1,610,061,127,000 | 1,610,061,127,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 11,432 | lean | /-
Copyright (c) 2020 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
-/
import measure_theory.prod
/-!
# Product measures
In this file we define and prove properties about finite products of measures
(and at some point, countable pr... |
3aaa5b9cef8917740a596547a6b4f63a817891d1 | 0c1546a496eccfb56620165cad015f88d56190c5 | /library/init/propext.lean | 3d251c0644d6fed68a2a386beafa626fbdb57f34 | [
"Apache-2.0"
] | permissive | Solertis/lean | 491e0939957486f664498fbfb02546e042699958 | 84188c5aa1673fdf37a082b2de8562dddf53df3f | refs/heads/master | 1,610,174,257,606 | 1,486,263,620,000 | 1,486,263,620,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 933 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
prelude
import init.logic
constant propext {a b : Prop} : (a ↔ b) → a = b
/- Additional congruence lemmas. -/
universe variables u v
lemma forall_congr_eq... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.