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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
fd57d1b89bbda874343ca2ea7ea290d92e7199bb | 5ae26df177f810c5006841e9c73dc56e01b978d7 | /src/data/list/basic.lean | f003a6813b1a04fc92fcb741b85c399e9d3f3b37 | [
"Apache-2.0"
] | permissive | ChrisHughes24/mathlib | 98322577c460bc6b1fe5c21f42ce33ad1c3e5558 | a2a867e827c2a6702beb9efc2b9282bd801d5f9a | refs/heads/master | 1,583,848,251,477 | 1,565,164,247,000 | 1,565,164,247,000 | 129,409,993 | 0 | 1 | Apache-2.0 | 1,565,164,817,000 | 1,523,628,059,000 | Lean | UTF-8 | Lean | false | false | 212,887 | lean | /-
Copyright (c) 2014 Parikshit Khanna. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Parikshit Khanna, Jeremy Avigad, Leonardo de Moura, Floris van Doorn, Mario Carneiro
Basic properties of lists.
-/
import
tactic.interactive tactic.mk_iff_of_inductive_prop
logi... |
9dc188e4ae6a7a7d6c423ef6491eefb963e72808 | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/tactic/finish.lean | 9d01571d0d6b8176748a944fdbb7648e0a313be5 | [
"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 | 15,410 | lean | /-
Copyright (c) 2017 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
These tactics do straightforward things: they call the simplifier, split conjunctive assumptions,
eliminate existential quantifiers on the left, and look for contradictio... |
936936e393432060d8418462b62d3adcf36d0468 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/lean/331.lean | a35c1d53bc7c917c9b49e55dc854c2835d08ae41 | [
"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 | 110 | lean | structure Foo where
foo : Nat
def baz {x : _} := Foo.mk x -- works fine
def qux {x : _} : Foo := Foo.mk x
|
aef80b13008d70f3ae3f0de71a378e64cd2cb009 | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/algebra/algebra/subalgebra.lean | 8374a4fb5eb6c01b06d30d58e7285731042b0bb2 | [
"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 | 35,639 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Yury Kudryashov
-/
import algebra.algebra.operations
/-!
# Subalgebras over Commutative Semiring
In this file we define `subalgebra`s and the usual operations on them (`map`, `... |
a7aa4f98c5343372ca8422556c5fad21d0e9927b | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/multiset/interval.lean | 8e36ee02b2efb885ccbc7b6d17d226cb11a446d6 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 2,785 | lean | /-
Copyright (c) 2022 Eric Wieser. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Eric Wieser
-/
import data.finset.locally_finite
import data.dfinsupp.interval
import data.dfinsupp.multiset
import data.nat.interval
/-!
# Finite intervals of multisets
> THIS FILE IS ... |
e44721ff7e60d3ef0d7994a4423e254265ccc5df | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tests/lean/run/mutwf1.lean | 59d6f2e67d127f582e81f5f06dbf2805b6cb2cdd | [
"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 | 624 | lean | -- set_option trace.Elab.definition.wf true in
mutual
def f : Nat → α → α → α
| 0, a, b => a
| n, a, b => g a n b |>.1
def g : α → Nat → α → (α × α)
| a, 0, b => (a, b)
| a, n, b => (h a b n, a)
def h : α → α → Nat → α
| a, b, 0 => b
| a, b, n+1 => f n a b
end
termination_by
invImage
... |
b49edc18af6ac7281195bc315a9272ee28350cef | 271e26e338b0c14544a889c31c30b39c989f2e0f | /src/Init/Lean/Compiler/IR/Basic.lean | 549e31b39cdbfd6f0bd1162293fab5dd14912a96 | [
"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 | 25,712 | 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.Data.Array
import Init.Lean.Data.KVMap
import Init.Lean.Data.Name
import Init.Lean.Data.Format
import Init.Lean.Compiler.ExternAttr
/-
I... |
c51d0068eccdd8fa3dd599ef067ad94d9b91b4a5 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/multiset/functor.lean | eac8ae74d286ba87b3811b07e462cee16d3e37f7 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 4,365 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Johannes Hölzl, Simon Hudon, Kenny Lau
-/
import data.multiset.bind
import control.traversable.lemmas
import control.traversable.instances
/-!
# Functoriality of `multise... |
1988f836cb9e1dd49ac32f1f72c2c7c2b40368f8 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/padics/padic_numbers_auto.lean | f969f941c3e9cc34bb0046ce432df333ea7f1adf | [] | 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 | 23,325 | lean | /-
Copyright (c) 2018 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.padics.padic_norm
import Mathlib.analysis.normed_space.basic
import Mathlib.PostPor... |
37121056a8ae6746e9fe146b634be257e90da2c7 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tests/lean/notationPrecheck.lean | 5bee76f17d9ec7bcde53f95915d5a6f929a83c1d | [
"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 | 131 | lean | notation "a" => fun x => a
syntax "b" term : term
notation "c" => b x
set_option quotPrecheck false
notation "d" => b x
#check d
|
996085a3ff3f9cad3c57463d32466c1c2136f01a | e151e9053bfd6d71740066474fc500a087837323 | /src/hott/types/2_adj/two_adj.lean | c46ed7b63f99fa9e5ac3fba9e217424a2e717bed | [
"Apache-2.0"
] | permissive | daniel-carranza/hott3 | 15bac2d90589dbb952ef15e74b2837722491963d | 913811e8a1371d3a5751d7d32ff9dec8aa6815d9 | refs/heads/master | 1,610,091,349,670 | 1,596,222,336,000 | 1,596,222,336,000 | 241,957,822 | 0 | 0 | Apache-2.0 | 1,582,222,839,000 | 1,582,222,838,000 | null | UTF-8 | Lean | false | false | 18,262 | lean | /-
Authors: Daniel Carranza, Jonathon Chang, Ryan Sandford
Under the supervision of Chris Kapulkin
Theorems about two half-adjoint equivalences,
including a proof that two left half-adjoint
and two right half-adjoint equivalences are propositions
and that the two full-adjoint equivalence is equivalent to a non-... |
cdc3a68e0d3e4de41c97062fde43a0521da94e37 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/continued_fractions/basic.lean | 8c04dd961e079dd515feedae5c8dcd6047dcd853 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 13,358 | lean | /-
Copyright (c) 2019 Kevin Kappelmann. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Kappelmann
-/
import data.seq.seq
import algebra.field.defs
/-!
# Basic Definitions/Theorems for Continued Fractions
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes t... |
d76927766c5b8d3f6364e8cce7c8bdb2bfeba7f5 | 618003631150032a5676f229d13a079ac875ff77 | /src/topology/algebra/continuous_functions.lean | 28df0e9230cf38b4126e260f90f92e5b4af0a74d | [
"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 | 2,226 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import topology.algebra.ring
universes u v
local attribute [elab_simple] continuous.comp
@[to_additive continuous_add_submonoid]
instance continuous_submonoid (α :... |
8905f4ad40200e1e7f41d1145155ba95a8f86ddd | 94096349332b0a0e223a22a3917c8f253cd39235 | /src/game/world1/level3.lean | 2ac47ba1e131e0d7173b54a8caa207f3bab16152 | [] | no_license | robertylewis/natural_number_game | 26156e10ef7b45248549915cc4d1ab3d8c3afc85 | b210c05cd627242f791db1ee3f365ee7829674c9 | refs/heads/master | 1,598,964,725,038 | 1,572,602,236,000 | 1,572,602,236,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,211 | lean | /-
We just restarted Lean behind the scenes,
so let's re-import the natural numbers, but this time without
addition and multiplication.
-/
import mynat.definition -- import Peano's definition of the natural numbers {0,1,2,3,4,...}
namespace mynat -- hide
/- Axiom : zero_ne_succ (a : mynat) :
zero ≠ succ(a)
-/
/- Axi... |
431c9d3edd558187af27f983717e6cb4d081f622 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/data/set/basic.lean | 51db3ffca196adda9c057ddb641890b7f289db81 | [
"Apache-2.0"
] | permissive | stjordanis/mathlib | 51e286d19140e3788ef2c470bc7b953e4991f0c9 | 2568d41bca08f5d6bf39d915434c8447e21f42ee | refs/heads/master | 1,631,748,053,501 | 1,627,938,886,000 | 1,627,938,886,000 | 228,728,358 | 0 | 0 | Apache-2.0 | 1,576,630,588,000 | 1,576,630,587,000 | null | UTF-8 | Lean | false | false | 110,458 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura
-/
import logic.unique
import order.boolean_algebra
/-!
# Basic properties of sets
Sets in Lean are homogeneous; all their elements have the same type... |
53bb8b178baf57b31f7f434b40ed0b8399d61c0a | 9dd3f3912f7321eb58ee9aa8f21778ad6221f87c | /tests/lean/let_elim_issue.lean | 915f2aa0a2f4328856a9de08a49b2e82462b4035 | [
"Apache-2.0"
] | permissive | bre7k30/lean | de893411bcfa7b3c5572e61b9e1c52951b310aa4 | 5a924699d076dab1bd5af23a8f910b433e598d7a | refs/heads/master | 1,610,900,145,817 | 1,488,006,845,000 | 1,488,006,845,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 119 | lean | import system.io
def tst : io unit :=
put_str "hello\n"
>> put_str "world\n"
>> put_str "from Lean\n"
vm_eval tst
|
8c5447300520c517611cb12b5642d2f1b95b8e69 | 4fa161becb8ce7378a709f5992a594764699e268 | /src/geometry/manifold/real_instances.lean | 7433a65cb09330494943308cd175ef6476d55413 | [
"Apache-2.0"
] | permissive | laughinggas/mathlib | e4aa4565ae34e46e834434284cb26bd9d67bc373 | 86dcd5cda7a5017c8b3c8876c89a510a19d49aad | refs/heads/master | 1,669,496,232,688 | 1,592,831,995,000 | 1,592,831,995,000 | 274,155,979 | 0 | 0 | Apache-2.0 | 1,592,835,190,000 | 1,592,835,189,000 | null | UTF-8 | Lean | false | false | 14,407 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import geometry.manifold.smooth_manifold_with_corners
import linear_algebra.finite_dimensional
import analysis.normed_space.real_inner_product
/-!
# Constructi... |
31a913ea2aa14469af2044d69cde25b2fdda5cf5 | a4673261e60b025e2c8c825dfa4ab9108246c32e | /src/Lean/Parser/Extra.lean | 76b26a19eaa83ed3ad8e3988e1a72d16d7741fe3 | [
"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 | 3,703 | 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.Extension
-- necessary for auto-generation
import Lean.PrettyPrinter.Parenthesizer
import Lean.PrettyPrinter.Formatter... |
9b9c3486d932cb7b8259e6b4ac47d1859685a208 | 97c8e5d8aca4afeebb5b335f26a492c53680efc8 | /ground_zero/HITs/generalized.lean | 5278aebd190f5a4a517d2943e6159a51742c602b | [] | no_license | jfrancese/lean | cf32f0d8d5520b6f0e9d3987deb95841c553c53c | 06e7efaecce4093d97fb5ecc75479df2ef1dbbdb | refs/heads/master | 1,587,915,151,351 | 1,551,012,140,000 | 1,551,012,140,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,538 | lean | import ground_zero.types.heq
open ground_zero.types.dep_path (pathover_of_eq)
/-
Generalized circle or one-step truncation.
* https://homotopytypetheory.org/2015/07/28/constructing-the-propositional-truncation-using-nonrecursive-hits/
* https://arxiv.org/pdf/1512.02274
-/
namespace ground_zero.HITs
universes u ... |
d4734297ac465d1489bbc2788a21caf2a46d3851 | 43390109ab88557e6090f3245c47479c123ee500 | /src/M1F/problem_bank/0106/S0106.lean | b678482ceebe1d241fbc78852e2d2598fddbe3c4 | [
"Apache-2.0"
] | permissive | Ja1941/xena-UROP-2018 | 41f0956519f94d56b8bf6834a8d39473f4923200 | b111fb87f343cf79eca3b886f99ee15c1dd9884b | refs/heads/master | 1,662,355,955,139 | 1,590,577,325,000 | 1,590,577,325,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,915 | lean | inductive zfc : Type
| empty : zfc
| insert : zfc → zfc → zfc
instance : has_emptyc zfc := ⟨zfc.empty⟩
instance : has_insert zfc zfc := ⟨zfc.insert⟩
instance : has_zero zfc := ⟨{}⟩
instance : has_one zfc := ⟨{0}⟩
def succ (a : zfc) : zfc := has_insert.insert a a
def zfc_add : zfc → zfc → zfc
| m 0 := m
| m (zfc.in... |
dd98c4b0651b691c95364c59569b165d93daaa8a | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/lake/Lake/Util/DRBMap.lean | b94ac2621406297e147375d8368dead883f42e40 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 5,712 | 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, Mac Malone
-/
import Lean.Data.RBMap
import Lake.Util.Compare
namespace Lake
open Lean RBNode
/-!
This module includes a dependently typed adaption of the `... |
31abeeacd86ccbb0237a221460a005b00b48304f | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /src/Lean/LocalContext.lean | 9defcfc2263a29d80e73db0f4054194b189eb9ed | [
"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 | 15,089 | 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 Std.Data.PersistentArray
import Lean.Expr
import Lean.Hygiene
namespace Lean
inductive LocalDecl where
| cdecl (index : Nat) (fvarId : FVarId) (u... |
39400da4d816a12c374dbe1ff5d0f35197b49a9e | 0845ae2ca02071debcfd4ac24be871236c01784f | /library/init/data/ordering/basic.lean | fc550154da6c0f2fc1449e25513e3577676eb4c4 | [
"Apache-2.0"
] | permissive | GaloisInc/lean4 | 74c267eb0e900bfaa23df8de86039483ecbd60b7 | 228ddd5fdcd98dd4e9c009f425284e86917938aa | refs/heads/master | 1,643,131,356,301 | 1,562,715,572,000 | 1,562,715,572,000 | 192,390,898 | 0 | 0 | null | 1,560,792,750,000 | 1,560,792,749,000 | null | UTF-8 | Lean | false | false | 1,656 | 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.repr
universes u v
inductive Ordering
| lt | Eq | gt
instance : HasRepr Ordering :=
⟨(fun s => match s with | Ordering.lt => "lt... |
8218f0357dc6894990953dd61b2bb86aa98b9f62 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/run/seclvl.lean | d89eb84bba5ce2e0f4bd7a00c7b8c2ebb1fc1781 | [
"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 | 303 | lean | section
variables (A B C : Type)
definition foo := A → B
check foo A B
check foo B C
check foo A A
end
constants A B C : Type
check foo A B
check foo B C
check foo A A
section
variables (A B C : Type)
definition foo2 := A → B
check foo2 A B
check foo2 B C
check foo2 A A
end
|
c9dfb3add281afce0e2cbcd228be91151365e751 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/lean/run/quasi_pattern_unification_approx_issue.lean | 04d5527bccf07e8c0a3ab9a717c0b85d6d6d8f71 | [
"Apache-2.0"
] | permissive | mhuisi/lean4 | 28d35a4febc2e251c7f05492e13f3b05d6f9b7af | dda44bc47f3e5d024508060dac2bcb59fd12e4c0 | refs/heads/master | 1,621,225,489,283 | 1,585,142,689,000 | 1,585,142,689,000 | 250,590,438 | 0 | 2 | Apache-2.0 | 1,602,443,220,000 | 1,585,327,814,000 | C | UTF-8 | Lean | false | false | 1,491 | lean | variables {δ σ : Type}
def foo1 : StateT δ (StateT σ Id) σ :=
monadLift (get : StateT σ Id σ)
/-
In Lean3, we used to use the quasi-pattern approximation during elaboration.
The example above demonstrates why it produces counterintuitive behavior.
We have the `Monad-lift` application:
@monadLift ?m ?n ?c ?α (get : St... |
c1d2dd2d024f932eeabb61c51a2fef4d8d754ea1 | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/measure_theory/measure/haar_lebesgue.lean | 4cb27e0e76a273f10b71abc4ff7d3e651aaa363e | [
"Apache-2.0"
] | permissive | waynemunro/mathlib | e3fd4ff49f4cb43d4a8ded59d17be407bc5ee552 | 065a70810b5480d584033f7bbf8e0409480c2118 | refs/heads/master | 1,693,417,182,397 | 1,634,644,781,000 | 1,634,644,781,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 14,290 | 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, Sébastien Gouëzel
-/
import measure_theory.measure.lebesgue
import measure_theory.measure.haar
import linear_algebra.finite_dimensional
/-!
# Relationship between ... |
2cda4db02af56fe7afa2c6acb0bdceae3e352f40 | 4e0d7c3132ce31edc5829849735dd25db406b144 | /lean/love03_forward_proofs_demo.lean | 6ea6eff54dccca67cbdaaaf89296ff01ab00dd48 | [] | 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,927 | lean | import .love01_definitions_and_statements_demo
/-! # LoVe Demo 3: Forward Proofs
When developing a proof, often it makes sense to work __forward__: to start with
what we already know and proceed step by step towards our goal. Structured
proofs are a style that supports this reasoning. -/
set_option pp.beta true
n... |
9a646bf91646a1b0bf6e9632a7eab69d9ebeaeda | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/psumAtWF.lean | 398b1f03e33c9d37b1ceef0ecb82d71e20d97958 | [
"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 | 265 | lean | mutual
def fn (f : α → α) (a : α) (n : Nat) : α :=
match n with
| 0 => a
| n+1 => gn f (f (f a)) (f a) n
def gn (f : α → α) (a b : α) (n : Nat) : α :=
match n with
| 0 => b
| n+1 => fn f (f b) n
end
termination_by
fn n => n
gn n => n
|
d23585f973b540fcadb1ceffd24d350019fd9494 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/meta/converter/conv_auto.lean | 7202864cdcd92b22fdb5056ba14e81f5858b389f | [] | 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 | 783 | 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... |
299388aaa752da88f7e9375239a7d1c89302e1f7 | 26ac254ecb57ffcb886ff709cf018390161a9225 | /test/tactics.lean | 2a713614108078419d382df6f856cfae95ee604a | [
"Apache-2.0"
] | permissive | eric-wieser/mathlib | 42842584f584359bbe1fc8b88b3ff937c8acd72d | d0df6b81cd0920ad569158c06a3fd5abb9e63301 | refs/heads/master | 1,669,546,404,255 | 1,595,254,668,000 | 1,595,254,668,000 | 281,173,504 | 0 | 0 | Apache-2.0 | 1,595,263,582,000 | 1,595,263,581,000 | null | UTF-8 | Lean | false | false | 15,078 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon, Scott Morrison
-/
import tactic.interactive
import tactic.finish
import tactic.ext
import tactic.lift
import tactic.apply
import tactic.reassoc_axiom
import tactic.tfae
impo... |
c7ea52d62a1ce5b2aabb7e672efe81d70fb6bf2d | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/ring_theory/noetherian.lean | 93d40c639dfc9467913d20d44132f6a99ef5800f | [
"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 | 19,461 | 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.linear_combination
import ring_theory.ideal_operations
import ring_theory.subring
o... |
60435abbdcf7ce6959cbbe7236de56004ff8e327 | 076f5040b63237c6dd928c6401329ed5adcb0e44 | /instructor-notes/2019.09.10_001.lean | 04f7a3cc85f7502517c48718b1921fabf7d9b4cc | [] | no_license | kevinsullivan/uva-cs-dm-f19 | 0f123689cf6cb078f263950b18382a7086bf30be | 09a950752884bd7ade4be33e9e89a2c4b1927167 | refs/heads/master | 1,594,771,841,541 | 1,575,853,850,000 | 1,575,853,850,000 | 205,433,890 | 4 | 9 | null | 1,571,592,121,000 | 1,567,188,539,000 | Lean | UTF-8 | Lean | false | false | 4,489 | lean | /-
2102. Sept 10, 2019
A terms is an expression that represents
a value of some type. Today we introduce
several kinds of terms and how each kind
of term is evaluted to compute the value
it represents. The kinds of terms that we
see now are the following:
- literal
- identifier ("variable")
- lambda ("function")
... |
86f142f61b534f417c41399022016122dd7d0d49 | 12ba6fe891179eac82e287c24c8812a046221563 | /src/shadows.lean | a1ea237785291c5262ce66036d36439fdcf0ce93 | [] | no_license | b-mehta/combinatorics | eca586b4cb7b5e1fd22ec3288f5a2cb4ed6ce4dd | 2a8b30709d35f124f3fc9baa5652d231389e9f63 | refs/heads/master | 1,653,708,057,336 | 1,626,885,184,000 | 1,626,885,184,000 | 228,850,404 | 19 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 20,061 | 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 data.finset
import data.fintype.basic
import logic.function.iterate
import to_mathlib
import basic
/-!
# Shadows
This file defines shadows of a set family and p... |
58c5d83d6503bd09a858ec1b7e9f340fa62d375c | 592ee40978ac7604005a4e0d35bbc4b467389241 | /Library/generated/mathscheme-lean/BooleanRing.lean | db774a70e3ab0e872d6cbfc88189b98f623a6833 | [] | no_license | ysharoda/Deriving-Definitions | 3e149e6641fae440badd35ac110a0bd705a49ad2 | dfecb27572022de3d4aa702cae8db19957523a59 | refs/heads/master | 1,679,127,857,700 | 1,615,939,007,000 | 1,615,939,007,000 | 229,785,731 | 4 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 15,680 | lean | import init.data.nat.basic
import init.data.fin.basic
import data.vector
import .Prelude
open Staged
open nat
open fin
open vector
section BooleanRing
structure BooleanRing (A : Type) : Type :=
(times : (A → (A → A)))
(one : A)
(lunit_one : (∀ {x : A} , (times one x) = x))
(runit_one ... |
1f9358f82a96ad8d41a35c548c21fdc95595efc6 | 2bafba05c98c1107866b39609d15e849a4ca2bb8 | /src/week_6/solutions/Part_B_sequences_again.lean | 3fd5cb66b7cc68a69211de822b9d461c576a834a | [
"Apache-2.0"
] | permissive | ImperialCollegeLondon/formalising-mathematics | b54c83c94b5c315024ff09997fcd6b303892a749 | 7cf1d51c27e2038d2804561d63c74711924044a1 | refs/heads/master | 1,651,267,046,302 | 1,638,888,459,000 | 1,638,888,459,000 | 331,592,375 | 284 | 24 | Apache-2.0 | 1,669,593,705,000 | 1,611,224,849,000 | Lean | UTF-8 | Lean | false | false | 14,791 | lean | import data.real.basic
import order.filter.at_top_bot
import topology.instances.real
/-
## Sequences, revisited
Recall that in week 3 we made these definitions:
-/
local notation `|` x `|` := abs x
/-- `l` is the limit of the sequence `a` of reals -/
definition is_limit (a : ℕ → ℝ) (l : ℝ) : Prop :=
∀ ε > 0, ∃ N, ... |
b81da57ad28c93bf841a136f2acebffba08ce767 | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch3/ex0319.lean | 11cd8541be8de5b03961d9b66e0ce7a8fe780af4 | [] | no_license | Ailrun/Theorem_Proving_in_Lean | ae6a23f3c54d62d401314d6a771e8ff8b4132db2 | 2eb1b5caf93c6a5a555c79e9097cf2ba5a66cf68 | refs/heads/master | 1,609,838,270,467 | 1,586,846,743,000 | 1,586,846,743,000 | 240,967,761 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 289 | lean | variables p q : Prop
theorem and_swap : p ∧ q ↔ q ∧ p :=
iff.intro
(assume h : p ∧ q,
show q ∧ p, from ⟨h.right, h.left⟩)
(assume h : q ∧ p,
show p ∧ q, from ⟨h.right, h.left⟩)
variable h : p ∧ q
example : q ∧ p := iff.mp (and_swap p q) h
|
1cd3fbc085cadf348d4eaf22549b20a1cfa55020 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/topology/continuous_function/zero_at_infty.lean | 20f7f763be3cb65e6df109de43583c433d7275ee | [
"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 | 22,648 | lean | /-
Copyright (c) 2022 Jireh Loreaux. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jireh Loreaux
-/
import topology.continuous_function.bounded
import topology.continuous_function.cocompact_map
/-!
# Continuous functions vanishing at infinity
The type of continuous ... |
54683b0f115a3e0faac4efb523a99a25dccd378e | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/run/ematch_loop.lean | 6353bf55c5e10fa645971549bff66b83f05b5ff1 | [
"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,533 | lean | constant f : nat → nat
constant p : nat → Prop
/- The following axiom produces a matching loop -/
axiom fax : ∀ x, f (: f x :) = nat.succ x
axiom px : ∀ x, p x
attribute [ematch] fax
set_option trace.smt.ematch true
lemma ex1 (a b c : nat) : f a = b → p a :=
begin [smt]
intros, repeat {ematch},
ematch_using [px]... |
0c42359c9e4ccbc77cab52022936d09d7cc552d0 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/ring_theory/witt_vector/witt_polynomial.lean | 59523dec970eda2d2bf842d73bdff3e1b20a1d11 | [
"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,764 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Robert Y. Lewis
-/
import algebra.char_p.invertible
import data.fintype.big_operators
import data.mv_polynomial.variables
import data.mv_polynomial.comm_ring
import da... |
e555766c9d9d5e6c87dbb61858a028c6c64b1ec1 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/analysis/normed/group/completion.lean | 8e3ba8389dc67528b457d10d84110340f5270081 | [
"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 | 1,338 | lean | /-
Copyright (c) 2021 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import analysis.normed.group.basic
import topology.algebra.group_completion
import topology.metric_space.completion
/-!
# Completion of a normed group
In this file ... |
2e64a539996ffdd6aec5906b108be5abe57a1cf9 | 92b50235facfbc08dfe7f334827d47281471333b | /library/logic/axioms/prop_decidable.lean | 3ba6df7cdafc83e3da440bb420bbb573848446f7 | [
"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 | 873 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
Excluded middle + Hilbert implies every proposition is decidable.
-/
import logic.axioms.prop_complete logic.axioms.hilbert data.sum
open decidable inhabited n... |
9f1a9418ec24d58fcb128166505139a5822225e9 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/lie/matrix.lean | afd6b6dc5c42f356b6e539da24033438f424dde8 | [
"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,464 | 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.of_associative
import linear_algebra.matrix.reindex
import linear_algebra.matrix.to_linear_equiv
/-!
# Lie algebras of matrices
> THIS FILE IS SYNCHRON... |
96ceaf09ba351c832c633e4ece8c912fde220fef | b00eb947a9c4141624aa8919e94ce6dcd249ed70 | /stage0/src/Lean/Parser/Module.lean | b853ef4cf2f3e13e6fc7425619cb7f41e5fdbe2c | [
"Apache-2.0"
] | permissive | gebner/lean4-old | a4129a041af2d4d12afb3a8d4deedabde727719b | ee51cdfaf63ee313c914d83264f91f414a0e3b6e | refs/heads/master | 1,683,628,606,745 | 1,622,651,300,000 | 1,622,654,405,000 | 142,608,821 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,625 | 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.Message
import Lean.Parser.Command
namespace Lean
namespace Parser
namespace Module
def «prelude» := leading_parser "prelu... |
1b77bc91c4e492c189c38a97333a68904edf99ab | 02005f45e00c7ecf2c8ca5db60251bd1e9c860b5 | /src/data/real/cardinality.lean | c5227fbe270075bf528f996a3a38ac793575158b | [
"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 | 9,433 | lean | /-
Copyright (c) 2019 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
-/
import set_theory.cardinal_ordinal
import analysis.specific_limits
import data.rat.denumerable
import data.set.intervals.image_preimage
/-!
# The cardinality of ... |
4de7074da5f5f89e01013db0cbdd729b099acfbb | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/computability/partrec.lean | 09e005f0a2e4b8e53a74b0e3bd3612d02b12c06f | [
"Apache-2.0"
] | permissive | ilitzroth/mathlib | ea647e67f1fdfd19a0f7bdc5504e8acec6180011 | 5254ef14e3465f6504306132fe3ba9cec9ffff16 | refs/heads/master | 1,680,086,661,182 | 1,617,715,647,000 | 1,617,715,647,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 28,910 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import computability.primrec
import data.nat.psub
import data.pfun
/-!
# The partial recursive functions
The partial recursive functions are defined similarly to th... |
7f65507fee26b34312cb2ba3c5671a12fd906c6d | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/mv_polynomial/rename.lean | 95a4074a2268264f913a56bd6c032aaea34c7ecd | [
"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 | 11,084 | 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, Johan Commelin, Mario Carneiro
-/
import data.mv_polynomial.basic
/-!
# Renaming variables of polynomials
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to... |
76864518bb35460033ff616d06f489f6cc0bfa30 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /hott/types/nat/sub.hlean | 24ba1f618ef34d51e9619819865a4ac48a71c7c4 | [
"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 | 19,631 | hlean | /-
Copyright (c) 2014 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Jeremy Avigad
Subtraction on the natural numbers, as well as min, max, and distance.
-/
import .order
open eq.ops algebra eq
namespace nat
/- subtraction -/
pro... |
46f80bd7436fb63406c1f0c988fbd8c983eb2120 | 4a092885406df4e441e9bb9065d9405dacb94cd8 | /src/for_mathlib/topology.lean | 1eddcfb8aef26c77dbba6cf780c4b306bf7c5f12 | [
"Apache-2.0"
] | permissive | semorrison/lean-perfectoid-spaces | 78c1572cedbfae9c3e460d8aaf91de38616904d8 | bb4311dff45791170bcb1b6a983e2591bee88a19 | refs/heads/master | 1,588,841,765,494 | 1,554,805,620,000 | 1,554,805,620,000 | 180,353,546 | 0 | 1 | null | 1,554,809,880,000 | 1,554,809,880,000 | null | UTF-8 | Lean | false | false | 2,702 | lean | import topology.opens
import topology.uniform_space.cauchy
import topology.algebra.group
import for_mathlib.function
import for_mathlib.filter
open topological_space
-- predicates we need for topological rings
-- We need to think whether we could directly use the class t2_space (which is not using opens though)
def... |
640e49b7422629e3356ebc58fd81f1ef940b31b4 | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /src/tactic/zify.lean | f8e7678535c75d429dc77b30d6d8e8eaaf5ec526 | [
"Apache-2.0"
] | permissive | kmill/mathlib | ea5a007b67ae4e9e18dd50d31d8aa60f650425ee | 1a419a9fea7b959317eddd556e1bb9639f4dcc05 | refs/heads/master | 1,668,578,197,719 | 1,593,629,163,000 | 1,593,629,163,000 | 276,482,939 | 0 | 0 | null | 1,593,637,960,000 | 1,593,637,959,000 | null | UTF-8 | Lean | false | false | 5,339 | lean | /-
Copyright (c) 2020 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
-/
import tactic.norm_cast
import data.int.basic
/-!
# A tactic to shift `ℕ` goals to `ℤ`
It is often easier to work in `ℤ`, where subtraction is well behaved, than... |
a4a9f0d09a817ef3ee35eef81a36db0662730b64 | bf532e3e865883a676110e756f800e0ddeb465be | /algebra/archimedean.lean | 0bbf764051540eb99f778aaaac89e63b125c2dae | [
"Apache-2.0"
] | permissive | aqjune/mathlib | da42a97d9e6670d2efaa7d2aa53ed3585dafc289 | f7977ff5a6bcf7e5c54eec908364ceb40dafc795 | refs/heads/master | 1,631,213,225,595 | 1,521,089,840,000 | 1,521,089,840,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,211 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
Archimedean groups and fields.
-/
import algebra.group_power data.rat data.int.order
local infix ` • `:73 := add_monoid.smul
variables {α : Type*}
class floor_ring (... |
783bc47672e042a3b801fd9d187643fbc643d88f | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /stage0/src/Lean/Compiler/LCNF/SpecInfo.lean | 41409a3d58e8f5c15a6d84a408c3ba5214b504d9 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | tobiasgrosser/lean4 | ce0fd9cca0feba1100656679bf41f0bffdbabb71 | ebdbdc10436a4d9d6b66acf78aae7a23f5bd073f | refs/heads/master | 1,673,103,412,948 | 1,664,930,501,000 | 1,664,930,501,000 | 186,870,185 | 0 | 0 | Apache-2.0 | 1,665,129,237,000 | 1,557,939,901,000 | Lean | UTF-8 | Lean | false | false | 6,040 | 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.Specialize
import Lean.Compiler.LCNF.FixedArgs
import Lean.Compiler.LCNF.InferType
namespace Lean.Compiler.LCNF
/--
Each parameter is... |
34cdc23c6a6426476e0eb72fabe0bb01b801c662 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/topology/local_extr.lean | bdbbe6da9b0e88e6b35ffbc09d40c03267f8ff42 | [
"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 | 19,825 | lean | /-
Copyright (c) 2019 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import order.filter.extr
import topology.continuous_on
/-!
# Local extrema of functions on topological spaces
## Main definitions
This file defines special versi... |
a33f3f2c6c918cc13ece388e7fe090c9f84f32db | bb31430994044506fa42fd667e2d556327e18dfe | /src/number_theory/modular_forms/slash_invariant_forms.lean | b9f183db102fcbf81925f00cf94a4e5b4ca30be1 | [
"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 | 6,366 | lean | /-
Copyright (c) 2022 Chris Birkbeck. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Birkbeck
-/
import number_theory.modular_forms.slash_actions
/-!
# Slash invariant forms
This file defines functions that are invariant under a `slash_action` which forms the b... |
d81e1078b67464f86571e0dd700cfa28a2a67eea | 26ac254ecb57ffcb886ff709cf018390161a9225 | /src/data/polynomial/field_division.lean | aeb41504be8dba3d83204c3b843e973ce9c2ebd1 | [
"Apache-2.0"
] | permissive | eric-wieser/mathlib | 42842584f584359bbe1fc8b88b3ff937c8acd72d | d0df6b81cd0920ad569158c06a3fd5abb9e63301 | refs/heads/master | 1,669,546,404,255 | 1,595,254,668,000 | 1,595,254,668,000 | 281,173,504 | 0 | 0 | Apache-2.0 | 1,595,263,582,000 | 1,595,263,581,000 | null | UTF-8 | Lean | false | false | 10,740 | 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.ring_division
/-!
# Theory of univariate polynomials
This file starts looking like the ring the... |
cd5d1a3aed8e4d014285957cad3649cbef5ed299 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/analysis/quaternion.lean | 4fa0224f1e4721aa6de6562d69bd0abc7e69251b | [
"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 | 7,416 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov, Eric Wieser
-/
import algebra.quaternion
import analysis.inner_product_space.basic
import analysis.inner_product_space.pi_L2
import topology.algebra.algebra
/-!
# Qu... |
3ecfa499d6c2dfb59d5b8f9c8d77e59af4da56bc | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /src/Init/Lean/Elab/Tactic/Induction.lean | 5e9b3dfb41e60e1afd37218979d3dc211f4aacbe | [
"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 | 13,824 | 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, Sebastian Ullrich
-/
prelude
import Init.Lean.Meta.RecursorInfo
import Init.Lean.Meta.Tactic.Induction
import Init.Lean.Meta.Tactic.Cases
import Init.Lean.Ela... |
4bc0fd15186a5c727b7ceb511a298f9ad871b7c2 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/data/monoid_algebra.lean | f66c12249d2f69599757948d54a1606f11adf92f | [
"Apache-2.0"
] | permissive | gebner/mathlib | eab0150cc4f79ec45d2016a8c21750244a2e7ff0 | cc6a6edc397c55118df62831e23bfbd6e6c6b4ab | refs/heads/master | 1,625,574,853,976 | 1,586,712,827,000 | 1,586,712,827,000 | 99,101,412 | 1 | 0 | Apache-2.0 | 1,586,716,389,000 | 1,501,667,958,000 | Lean | UTF-8 | Lean | false | false | 13,037 | 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, Scott Morrison
-/
import data.finsupp
/-!
# Monoid algebras
When the domain of a `finsupp` has a multiplicative or additive structure, we can define
a convolution pro... |
fabf3d75f9245ccc2bb5f56633363060ead04b7c | 5d166a16ae129621cb54ca9dde86c275d7d2b483 | /library/init/meta/lean/parser.lean | 84a198b15a0e25bc825d79d32a3b06dda5f800c2 | [
"Apache-2.0"
] | permissive | jcarlson23/lean | b00098763291397e0ac76b37a2dd96bc013bd247 | 8de88701247f54d325edd46c0eed57aeacb64baf | refs/heads/master | 1,611,571,813,719 | 1,497,020,963,000 | 1,497,021,515,000 | 93,882,536 | 1 | 0 | null | 1,497,029,896,000 | 1,497,029,896,000 | null | UTF-8 | Lean | false | false | 3,033 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
-/
prelude
import init.meta.tactic
namespace lean
-- TODO: make inspectable (and pure)
meta constant parser_state : Type
meta constant parser_state.env :... |
4d3711e8bfc6b1c3962e60f3437d5a693274f2a7 | 9a0b1b3a653ea926b03d1495fef64da1d14b3174 | /tidy/rewrite_all.lean | 6f574ba1382260afb5c13eab0153a9095258683d | [
"Apache-2.0"
] | permissive | khoek/mathlib-tidy | 8623b27b4e04e7d598164e7eaf248610d58f768b | 866afa6ab597c47f1b72e8fe2b82b97fff5b980f | refs/heads/master | 1,585,598,975,772 | 1,538,659,544,000 | 1,538,659,544,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,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 tidy.lib.mllist
import tidy.lib.pretty_print
import tidy.lib.tactic
open tactic
meta structure rewrite_all_cfg extends rewrite_cfg :=
(discharger : tacti... |
1e36cba222dcec69f6b4cadf6e7f911e24b95579 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/algebra/char_zero.lean | 0481a48d675947afb247d9d639004197bc4e910a | [
"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 | 3,570 | 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 data.nat.cast
import tactic.wlog
/-- Typeclass for monoids with characteristic zero.
... |
79f0549d9895a9beb7ae511b9016fbc679349b45 | 42610cc2e5db9c90269470365e6056df0122eaa0 | /hott/algebra/group_theory.hlean | 4f8bd88c88fec7db6a3ab132ac07d30f501de866 | [
"Apache-2.0"
] | permissive | tomsib2001/lean | 2ab59bfaebd24a62109f800dcf4a7139ebd73858 | eb639a7d53fb40175bea5c8da86b51d14bb91f76 | refs/heads/master | 1,586,128,387,740 | 1,468,968,950,000 | 1,468,968,950,000 | 61,027,234 | 0 | 0 | null | 1,465,813,585,000 | 1,465,813,585,000 | null | UTF-8 | Lean | false | false | 11,010 | hlean | /-
Copyright (c) 2015 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
Basic group theory
This file will be rewritten in the future, when we develop are more systematic notation for
describing homomorphisms
-/
import algebra.category... |
0da108bf2d962901792ed1e64759f97687027eb9 | 05b503addd423dd68145d68b8cde5cd595d74365 | /src/category_theory/full_subcategory.lean | d8d039551b2f6019c3c3a6fd691fe78571dfaf64 | [
"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 | 3,406 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Reid Barton
-/
import category_theory.fully_faithful
namespace category_theory
universes v u₁ u₂ -- declare the `v`'s first; see `category_theory.category` for an exp... |
49cd63630784e8efb696266abfd5c8cb42b42ec1 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/ind_issue.lean | be25c6e509bd34a510eb62aece9787886d1e3015 | [
"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 | 178 | lean | def stack := list nat
instance : has_append stack :=
by unfold stack; apply_instance
example (s : stack) : s ++ [] = s :=
begin
induction s,
refl, apply list.append_nil
end
|
bc69dda044247fc77f7adafae0ce3b1b09f06e40 | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/topology/metric_space/lipschitz.lean | 1f662dbd422fe67e6a200ba46a5afe61a3b38894 | [
"Apache-2.0"
] | permissive | agjftucker/mathlib | d634cd0d5256b6325e3c55bb7fb2403548371707 | 87fe50de17b00af533f72a102d0adefe4a2285e8 | refs/heads/master | 1,625,378,131,941 | 1,599,166,526,000 | 1,599,166,526,000 | 160,748,509 | 0 | 0 | Apache-2.0 | 1,544,141,789,000 | 1,544,141,789,000 | null | UTF-8 | Lean | false | false | 11,404 | lean | /-
Copyright (c) 2018 Rohan Mitta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Rohan Mitta, Kevin Buzzard, Alistair Tucker, Johannes Hölzl, Yury Kudryashov
-/
import logic.function.iterate
import topology.metric_space.basic
import category_theory.endomorphism
import... |
94a7eba5de520bff6edca15b144dba400a732df6 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/analysis/special_functions/exponential.lean | 1fdf68e1062d660ce20c3a7f296690c40776bcb2 | [
"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,457 | lean | /-
Copyright (c) 2021 Anatole Dedecker. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anatole Dedecker
-/
import analysis.normed_space.exponential
import analysis.calculus.fderiv_analytic
import data.complex.exponential
import topology.metric_space.cau_seq_filter
/-!... |
7b262da538daeb395fcab40788afbb630917bfb6 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/record4.lean | 93b5f2f6009aa57d9f8f0be0f5a5ff70dc2188eb | [
"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 | 345 | lean | import logic data.unit
set_option structure.eta_thm true
structure point (A : Type) (B : Type) :=
mk :: (x : A) (y : B)
check point.eta
example (p : point num num) : point.mk (point.x p) (point.y p) = p :=
point.eta p
inductive color :=
red | green | blue
structure color_point (A : Type) (B : Type) extends point ... |
40573520818dd17c5b62765cf4c06b5f563f99d6 | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /stage0/src/Init/Classical.lean | d23be233c9bfca6ea146b10008f89078ffeaffc8 | [
"Apache-2.0"
] | permissive | WojciechKarpiel/lean4 | 7f89706b8e3c1f942b83a2c91a3a00b05da0e65b | f6e1314fa08293dea66a329e05b6c196a0189163 | refs/heads/master | 1,686,633,402,214 | 1,625,821,189,000 | 1,625,821,258,000 | 384,640,886 | 0 | 0 | Apache-2.0 | 1,625,903,617,000 | 1,625,903,026,000 | null | UTF-8 | Lean | false | false | 5,363 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import Init.Core
import Init.NotationExtra
universe u v
/- Classical reasoning support -/
namespace Classical
axiom choice {α : Sort u} : Nonemp... |
87d6da26f06a7490965d67af2c27237925ac33a4 | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/category_theory/subobject/lattice.lean | 740693a55704f458822a7e3125b6a97a55b5abd3 | [
"Apache-2.0"
] | permissive | ilitzroth/mathlib | ea647e67f1fdfd19a0f7bdc5504e8acec6180011 | 5254ef14e3465f6504306132fe3ba9cec9ffff16 | refs/heads/master | 1,680,086,661,182 | 1,617,715,647,000 | 1,617,715,647,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 15,668 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta, Scott Morrison
-/
import category_theory.subobject.factor_thru
/-!
# The lattice of subobjects
We provide the `semilattice_inf_top (subobject X)` instance when `[has_pu... |
ae1d4e5dfdd163fcd30015a432dba3baebebb2b7 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/group_theory/coset.lean | 7abe2d26fd57f5c08324d0bd2c910f42ed32f9e6 | [
"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 | 24,477 | lean | /-
Copyright (c) 2018 Mitchell Rowett. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mitchell Rowett, Scott Morrison
-/
import algebra.quotient
import group_theory.group_action.basic
import tactic.group
/-!
# Cosets
This file develops the basic theory of left and r... |
d705ededc1139f84975803f4f01007a7a2636bf1 | 4950bf76e5ae40ba9f8491647d0b6f228ddce173 | /src/analysis/calculus/times_cont_diff.lean | b29ab053a49e0ff35ff0a234c28f1ebe35d14a1d | [
"Apache-2.0"
] | permissive | ntzwq/mathlib | ca50b21079b0a7c6781c34b62199a396dd00cee2 | 36eec1a98f22df82eaccd354a758ef8576af2a7f | refs/heads/master | 1,675,193,391,478 | 1,607,822,996,000 | 1,607,822,996,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 134,165 | 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.mean_value
/-!
# Higher differentiability
A function is `C^1` on a domain if it is differentiable there, and its derivative is contin... |
56f63b01bb781af3446a01e4598fc95b0de9b921 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /stage0/src/Lean/Meta/Offset.lean | bed0af22c937c549b6c52f58e8d68c1df5f6b018 | [
"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 | 5,589 | 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.LBool
import Lean.Meta.InferType
import Lean.Meta.AppBuilder
namespace Lean.Meta
private abbrev withInstantiatedMVars (e : Expr) (k : Exp... |
f7681a37b8df405b3b80c777bab955d7a325021e | 159fed64bfae88f3b6a6166836d6278f953bcbf9 | /Structure/ProductStructure.lean | 22c08c731b434a3a6b13f89edeeaec9e9eb18647 | [
"MIT"
] | permissive | SReichelt/lean4-experiments | 3e56830c8b2fbe3814eda071c48e3c8810d254a8 | ff55357a01a34a91bf670d712637480089085ee4 | refs/heads/main | 1,683,977,454,907 | 1,622,991,121,000 | 1,622,991,121,000 | 340,765,677 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,191 | lean | -- An abstract formalization of "isomorphism is equality up to relabeling"
-- -------------------------------------------------------------------------
--
-- See `README.md` for more info.
--
-- Definitions related to `productStructure`.
import Structure.Basic
import Structure.UniverseFunctor
open Morphisms
open H... |
52dda06d758f96f28ca894aad486f8acc9703949 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/analysis/calculus/deriv/comp.lean | 44c390d99966fa8807b96e6e473e6f90f8c495bf | [
"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 | 11,899 | lean | /-
Copyright (c) 2019 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner, Sébastien Gouëzel, Yury Kudryashov, Yuyang Zhao
-/
import analysis.calculus.deriv.basic
import analysis.calculus.fderiv.comp
import analysis.calculus.fderiv.restrict_scal... |
754d6731bc300596e8a42ec21196552d4dd0f962 | bb31430994044506fa42fd667e2d556327e18dfe | /src/data/nat/factorial/cast.lean | 9acc2393ce578cf99d8f4382fdf92935c545186b | [
"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 | 2,235 | lean | /-
Copyright (c) 2021 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies
-/
import ring_theory.polynomial.pochhammer
/-!
# Cast of factorials
This file allows calculating factorials (including ascending and descending ones) as elements of a
sem... |
e23e7f728d43343177d3d84be813134d8768ab1b | 4fa161becb8ce7378a709f5992a594764699e268 | /src/category_theory/graded_object.lean | 12cc0c2132dcd13f12e6767860d5b600ba618be6 | [
"Apache-2.0"
] | permissive | laughinggas/mathlib | e4aa4565ae34e46e834434284cb26bd9d67bc373 | 86dcd5cda7a5017c8b3c8876c89a510a19d49aad | refs/heads/master | 1,669,496,232,688 | 1,592,831,995,000 | 1,592,831,995,000 | 274,155,979 | 0 | 0 | Apache-2.0 | 1,592,835,190,000 | 1,592,835,189,000 | null | UTF-8 | Lean | false | false | 6,812 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.shift
import category_theory.concrete_category
/-!
# The category of graded objects
For any type `β`, a `β`-graded object over some category ... |
9d9c6142e223409be395afad60369a03f107b587 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/group_theory/transfer.lean | 5c6f26d461f7bc3c18379ef822efac9b49f01402 | [
"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,957 | lean | /-
Copyright (c) 2022 Thomas Browning. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Thomas Browning
-/
import group_theory.complement
import group_theory.group_action.basic
import group_theory.index
/-!
# The Transfer Homomorphism
In this file we construct the tra... |
0494f6a9f2e145b083f7d4624a9cc11c2ff29f35 | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /src/order/bounds.lean | 0368d98706c3c7f521f64905f022e53a6bf47fa3 | [
"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 | 35,193 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Yury Kudryashov
-/
import data.set.intervals.basic
/-!
# Upper / lower bounds
In this file we define:
* `upper_bounds`, `lower_bounds` : the set of upper bounds (re... |
e064485fc914a393aa443395ccdc9759c8cec895 | 969dbdfed67fda40a6f5a2b4f8c4a3c7dc01e0fb | /src/topology/metric_space/basic.lean | 8755732adffb1b529d1105b5bef4e7e19257217f | [
"Apache-2.0"
] | permissive | SAAluthwela/mathlib | 62044349d72dd63983a8500214736aa7779634d3 | 83a4b8b990907291421de54a78988c024dc8a552 | refs/heads/master | 1,679,433,873,417 | 1,615,998,031,000 | 1,615,998,031,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 93,966 | lean | /-
Copyright (c) 2015, 2017 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Metric spaces.
Authors: Jeremy Avigad, Robert Y. Lewis, Johannes Hölzl, Mario Carneiro, Sébastien Gouëzel
Many definitions and theorems expected on metric spaces are already introduced o... |
968be9a63f2cd9de7a79135ffaddaa7c01defab3 | e0f9ba56b7fedc16ef8697f6caeef5898b435143 | /src/measure_theory/outer_measure.lean | c4b8eaff2d025efa39ca0543d947c82f60839ad3 | [
"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 | 19,827 | 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
Outer measures -- overapproximations of measures
-/
import analysis.specific_limits
import measure_theory.measurable_space
noncomputable theory
open s... |
b522b7ce20ac585db574c47970f96012bb2cdc9d | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/congr_tactic.lean | 8ab1282d657c1e96cf19a99b38ace03dab9798bf | [
"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,032 | lean | /-
Copyright (c) 2017 Daniel Selsam. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Daniel Selsam
-/
open tactic
namespace test1
-- Recursive with props and subsingletons
constants (α β γ : Type) (P : α → Prop) (Q : β → Prop) (SS : α → Type)
(SS_ss : ∀ (x : ... |
eb95eb40ec94b764f99648bbaf0411f3ce3f7923 | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /src/field_theory/adjoin.lean | 61f58be05301589d440326d8877ee4de7e2eb10a | [
"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 | 33,369 | lean | /-
Copyright (c) 2020 Thomas Browning, Patrick Lutz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Thomas Browning, Patrick Lutz
-/
import field_theory.intermediate_field
import field_theory.splitting_field
import field_theory.separable
import ring_theory.adjoin_root... |
e78093494348c2445140b92fb30bc49878c4142b | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/ring_theory/ring_hom/integral.lean | 35bd3121d56013067abf1cd08a100a87199df5ff | [
"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 | 1,112 | lean | /-
Copyright (c) 2021 Andrew Yang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Andrew Yang
-/
import ring_theory.ring_hom_properties
/-!
# The meta properties of integral ring homomorphisms.
-/
namespace ring_hom
open_locale tensor_product
open tensor_product ... |
d4c5b3113fd050cc127ef4eed9fa95552e177526 | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/category_theory/limits/limits.lean | b6b361ce916647316238192f255c65699a30a7be | [
"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 | 56,185 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Reid Barton, Mario Carneiro, Scott Morrison, Floris van Doorn
-/
import category_theory.adjunction.basic
import category_theory.limits.cones
import category_theory.reflects_isomorphism... |
7d16db183a54fbd344726e6a8beb81846db06afa | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/ring_theory/int/basic.lean | 69b7fc9c70cf77e549fe136d8ab875ec364dc8c9 | [
"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 | 14,372 | lean | /-
Copyright (c) 2018 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Jens Wagemaker, Aaron Anderson
-/
import ring_theory.coprime
import ring_theory.unique_factorization_domain
/-!
# Divisibility over ℕ and ℤ
This file collects results... |
2e826d7a5a04e6fbbabc9dee56c08e8e95cebb29 | c17c60327eee1622a8d7defa5af340e08619107f | /src/snippets/definitions/theoremes.lean | 396bd83f80f2bf46dc72b3ac18ca28fd0f01291d | [] | no_license | FredericLeRoux/dEAduction-lean2 | 277e3aad5102ff155fb04b188dbd01568ceea005 | bf7d7d88c2511ecfda5a98ed96e4ca3bc7ae1151 | refs/heads/master | 1,667,931,697,036 | 1,593,174,880,000 | 1,593,174,880,000 | 275,150,842 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 84 | lean |
import data.set
import data.real
alias union.sous_ensembles : set.subset_Union
|
02c5549be7b1aa22da11005d135633dbe77d9ed7 | 64874bd1010548c7f5a6e3e8902efa63baaff785 | /tests/lean/run/class_bug2.lean | 247e40a97ec442bd3c8d731be4dd75c3af2af07b | [
"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 | 859 | lean | import logic
inductive category (ob : Type) (mor : ob → ob → Type) : Type :=
mk : Π (comp : Π⦃A B C : ob⦄, mor B C → mor A B → mor A C)
(id : Π {A : ob}, mor A A),
(Π {A B C D : ob} {f : mor A B} {g : mor B C} {h : mor C D},
comp h (comp g f) = comp (comp h g) f) →
(Π {A B... |
cbedc25e7c138a0689564952a64da976d0ff50ea | f3a5af2927397cf346ec0e24312bfff077f00425 | /src/game/world7/level5.lean | 8d45fbb59738517e6d5835a71e1f118ef2958731 | [
"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 | 1,139 | lean | /-
# Advanced proposition world.
## Level 5: `iff_trans` easter eggs.
Let's try `iff_trans` again. Try proving it in other ways.
### A trick.
Instead of using `cases` on `h : P ↔ Q` you can just access the proofs of `P → Q` and `Q → P`
directly with `h.1` and `h.2`. So you can solve this level with
```
intros h... |
890bc677709f3e9d3dd2e12243d52d6278af9046 | d450724ba99f5b50b57d244eb41fef9f6789db81 | /src/mywork/lecture_1a.lean | b4822684a29e02b918b5e40c264cc8025235c8fd | [] | no_license | jakekauff/CS2120F21 | 4f009adeb4ce4a148442b562196d66cc6c04530c | e69529ec6f5d47a554291c4241a3d8ec4fe8f5ad | refs/heads/main | 1,693,841,880,030 | 1,637,604,848,000 | 1,637,604,848,000 | 399,946,698 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,112 | lean | -- import definitions of real and rational numbers from mathlib
import data.real.basic
namespace cs2120
/-
The first part of this lesson is in the file, lecture_1.md.
Please start there then return here when you're done with
that document.
-/
/-
NUMBER SYSTEMS
-/
/-
Mathematicians think about operations on many ki... |
207138c5d4c09f3fc7ffb05e9c68bc1d92ba9cac | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/topology/metric_space/contracting.lean | d7c1b89460515d1840d0cd68e02437c5cae87316 | [
"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 | 15,231 | lean | /-
Copyright (c) 2019 Rohan Mitta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Rohan Mitta, Kevin Buzzard, Alistair Tucker, Johannes Hölzl, Yury Kudryashov
-/
import analysis.specific_limits
import data.setoid.basic
import dynamics.fixed_points.topology
/-!
# Contr... |
7952279768de009b368600aa42616e7d07f1c13a | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebraic_geometry/presheafed_space.lean | 7262b6fb9c9769e54186a91200522fccd84ab116 | [
"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 | 14,516 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import topology.sheaves.presheaf
import category_theory.adjunction.fully_faithful
/-!
# Presheafed spaces
Introduces the category of topological spaces equipped wit... |
3364d3593e320777a5ea40d2b05075be2e43422f | 22e97a5d648fc451e25a06c668dc03ac7ed7bc25 | /src/category_theory/products/basic.lean | ee11d71cd1e27441b03ed92f4d0789bb03edc462 | [
"Apache-2.0"
] | permissive | keeferrowan/mathlib | f2818da875dbc7780830d09bd4c526b0764a4e50 | aad2dfc40e8e6a7e258287a7c1580318e865817e | refs/heads/master | 1,661,736,426,952 | 1,590,438,032,000 | 1,590,438,032,000 | 266,892,663 | 0 | 0 | Apache-2.0 | 1,590,445,835,000 | 1,590,445,835,000 | null | UTF-8 | Lean | false | false | 5,451 | 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.eq_to_hom
namespace category_theory
universes v₁ v₂ v₃ v₄ u₁ u₂ u₃ u₄ -- declare the `v`'s first; see `category_theory.catego... |
a3fdc80d3cc53d539291f9145f91a4de06fcb3e6 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/1302.lean | a235a88bd8e29690157aa77b8320e0af8362d45e | [
"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 | 153 | lean | open list fin
#eval map (λ i, true) [1]
#eval map (λ i, true) [1, 2, 3]
#eval map (λ (i : fin 2), true) [fin.mk 0 dec_trivial, fin.mk 1 dec_trivial]
|
210f50191ecae6b6b42db15ebd2dbe312d73c833 | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch2/ex0802.lean | e02ab806d787831d6823c7468fc53b750f4c7f6f | [] | no_license | Ailrun/Theorem_Proving_in_Lean | ae6a23f3c54d62d401314d6a771e8ff8b4132db2 | 2eb1b5caf93c6a5a555c79e9097cf2ba5a66cf68 | refs/heads/master | 1,609,838,270,467 | 1,586,846,743,000 | 1,586,846,743,000 | 240,967,761 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 90 | lean | open list
#check list
#check @cons
#check @nil
#check @head
#check @tail
#check @append
|
d54e7a2b1b7f47f4c6907c68fa92f9cabeb4f00f | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/tactic/rcases.lean | 49365588decfbe39f3af15445d21b10c4bb21be7 | [
"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 | 14,437 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.dlist tactic.cache
open lean lean.parser
namespace tactic
/-
These synonyms for `list` are used to clarify the meanings of the many
usages of lists in ... |
494bdb13b82c77d211f8c3c3a59241c2f39d49cc | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/analysis/asymptotics/superpolynomial_decay.lean | f0dcbfd933e46c14ca1e58e549a9dc738917a5af | [
"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,036 | lean | /-
Copyright (c) 2021 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import analysis.asymptotics.asymptotics
import analysis.normed_space.ordered
import data.polynomial.eval
import topology.algebra.order.liminf_limsup
/-!
# Super-Polynomial F... |
6553b1ee536094db22c54f6a22a4230b91c7cfe7 | f3be49eddff7edf577d3d3666e314d995f7a6357 | /TBA/Solutions/Exercise4.lean | ff5458963c78141dc182984a8636f9f532ab6855 | [] | no_license | IPDSnelting/tba-2021 | 8b930bcd2f4aae44a2ddc86e72b77f84e6d46e82 | b6390e55b768423d3266969e81d19290129c5914 | refs/heads/master | 1,686,754,693,583 | 1,625,135,602,000 | 1,625,136,365,000 | 355,124,341 | 50 | 7 | null | 1,625,133,762,000 | 1,617,699,824,000 | Lean | UTF-8 | Lean | false | false | 4,761 | lean | /- TACTICS -/
namespace TBA
-- definitions from last week
-- NOTE: We renamed it from `Nat'` for consistency. The new namespace makes sure we don't use the
-- standard library `Nat`.
inductive Nat : Type
| zero : Nat
| succ (n : Nat) : Nat
open Nat
def add (m n : Nat) : Nat :=
match n with
| zero => m
|... |
44d578a2016550a53e98cc3c627d819ac9afcbf1 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/hott/rewriter1.hlean | bd440b0a9447738a348280fa4e00d8f08e91b737 | [
"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 | 658 | hlean | import algebra.group
open algebra
constant f {A : Type} : A → A → A
theorem test1 {A : Type} [s : add_comm_group A] (a b c : A) : f (a + 0) (f (a + 0) (a + 0)) = f a (f (0 + a) a) :=
begin
rewrite [
add_zero at {1, 3}, -- rewrite 1st and 3rd occurrences
{0 + _}add.comm] -- apply commutativity to (0 + _)
e... |
80629480ef7a939a37898f597aca75cdf348e286 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/holes.lean | 9e6249a2c7507d0cb8a73ceab4d32fa7988e15e8 | [
"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 | 359 | lean |
def f (x : Nat) : Nat :=
id (_ x)
def g {α β : Type} (a : α) : α :=
a
def f3 (x : Nat) : Nat :=
let y := g x + g x;
y + _ + ?hole
def f4 {α β} (a : α) := a
def f5 {α} {β : _} (a : α) := a
def f6 (a : Nat) :=
let f {α β} (a : α) := a;
f a
partial def f7 (x : Nat) :=
f7 x
partial def f8 (x : Nat) :=
let rec aux ... |
7d259cd2cefde7e5aed96a5cfd6cae75d7ccf214 | c61b91f85121053c627318ad8fcde30dfb8637d2 | /Chapter5/5-8.lean | 0209ce20a608fe605bbdc1db682c268ea787146d | [] | no_license | robkorn/theorem-proving-in-lean-exercises | 9e2256360eaf6f8df6cdd8fd656e63dfb04c8cdb | 9c51da587105ee047a9db55d52709d881a39be7a | refs/heads/master | 1,585,403,341,988 | 1,540,142,619,000 | 1,540,142,619,000 | 148,431,678 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 881 | lean |
-- Exercise # 1
theorem and_com {p q : Prop} : p ∧ q ↔ q ∧ p :=
begin
apply iff.intro,
all_goals {intro h, constructor, {exact h.right}, {exact h.left}}
end
section
universe u
variables (α β : Type u)
example (α : Type u) (a b : α) (p : α → Prop) (h1 :a = b) (h2 : p a) : p b :=
by {rw h1 at h2, assumption}... |
0d8da816d21244454cf1e51ebf4f2fd316714d5e | 020c82b947b28c4d255384a0466715fbb44e5c1e | /src/fifteen.lean | b21592bc02fe479acd2452f2fe9debe6fed760ce | [] | no_license | SnobbyDragon/leanfifteen | 79ceb751749fa0185c4f9e60ffa2f128e64fbc3c | 4583ab44e1de89a25e693e5e611472a9ba1147b6 | refs/heads/main | 1,675,887,746,364 | 1,609,534,902,000 | 1,609,534,902,000 | 325,708,959 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,974 | lean | import tactic
namespace fifteen
/-
You take a deep breath
And you walk through the doors
It's the morning of your very first day
...
-/
section defenestration -- definitions
-- why in the world did I use an enumerated type instead of fin 4 × fin 4?
-- unfortunately this way is not easily scalable to other di... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.