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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
23513e59cc5d19df909c0ac3700a3cf3acc7bf2f | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/252.lean | 585d5fceb967d32bd9c9c526b61f7b3f70578679 | [
"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 | 327 | lean | open nat
inductive tree (A : Type) :=
leaf : A β tree A,
node : tree A β tree A β tree A
check tree.node
definition size {A : Type} (t : tree A) : nat :=
tree.rec (Ξ» a, 1) (Ξ» tβ tβ nβ nβ, nβ + nβ) t
check size
eval size (tree.node (tree.node (tree.leaf 0) (tree.leaf 1))
(tree.leaf 0))
|
db17603495b9222c74515426b7e15322e7242d94 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /test/finish3.lean | 65ca0f4b415f23207d3569cee0d0de0a9cdfec46 | [
"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,036 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
-/
import tactic.finish
/-!
# Examples for `finish`
Those come from the tutorial.
-/
open auto
section
variables p q r s : Prop
-- commutativity of β§ and β¨
ex... |
33c5a1081d003d71ac6f51cc94467625b18d585a | d6124c8dbe5661dcc5b8c9da0a56fbf1f0480ad6 | /test/out/script/type.lean | 41fe1c909f4bdcf3ce49600c7f908c503aa616ff | [
"Apache-2.0"
] | permissive | xubaiw/lean4-papyrus | c3fbbf8ba162eb5f210155ae4e20feb2d32c8182 | 02e82973a5badda26fc0f9fd15b3d37e2eb309e0 | refs/heads/master | 1,691,425,756,824 | 1,632,122,825,000 | 1,632,123,075,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,636 | lean | import Papyrus.Script.Type
open Papyrus Script
-- # Floating Point Types
#check llvm type half
#check llvm type bfloat
#check llvm type float
#check llvm type double
#check llvm type x86_fp80
#check llvm type fp128
#check llvm type ppc_fp128
-- # Special Types
#check llvm type void
#check llvm type label
#check ll... |
229056efd51b99636d5eb2bd3822a2218a3d7633 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebraic_topology/topological_simplex.lean | 87a07cc883be3c026913443f66180037535ede2f | [
"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 | 3,255 | lean | /-
Copyright (c) 2021 Adam Topaz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Adam Topaz
-/
import algebraic_topology.simplex_category
import topology.category.Top.basic
import topology.instances.nnreal
/-!
# Topological simplices
We define the nat... |
adb0a3a80352f99ab5663cb676117236640536f9 | a4673261e60b025e2c8c825dfa4ab9108246c32e | /stage0/src/Lean/Elab/Quotation.lean | e21187fc4086a7374981363965099ae9bc00c87c | [
"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 | 15,478 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
Elaboration of syntax quotations as terms and patterns (in `match_syntax`). See also `./Hygiene.lean` for the basic
hygiene workings and data types.
-/
import... |
5b295f4480c6415588bebf8158976eee46f6c569 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/tactic/monotonicity/interactive.lean | 7d0091697c6ebc02b7b500ee9dca659dcaea0f64 | [
"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 | 23,578 | 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 control.traversable.derive
import control.traversable.lemmas
import data.dlist
import tactic.monotonicity.basic
variables {a b c p : Prop}
namespace tactic.interac... |
fe99ac853bae6ab9b28f491bd8e8660424caa331 | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/simp31.lean | f3fc883aebb5d8c9ce4a8f34c55751bcb28cdaf8 | [
"Apache-2.0"
] | permissive | codyroux/lean0.1 | 1ce92751d664aacff0529e139083304a7bbc8a71 | 0dc6fb974aa85ed6f305a2f4b10a53a44ee5f0ef | refs/heads/master | 1,610,830,535,062 | 1,402,150,480,000 | 1,402,150,480,000 | 19,588,851 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,037 | lean | rewrite_set simple
add_rewrite Nat::add_comm Nat::add_left_comm Nat::add_assoc Nat::add_zeror : simple
variables a b c : Nat
(*
function indent(s)
for i = 1, s:depth()-1 do
io.write(" ")
end
end
local m = simplifier_monitor(function(s, e)
print("Visit, depth: " .. s:d... |
bc69a08ae89d983f00e40c74f5bb18b6dac01eaf | 4727251e0cd73359b15b664c3170e5d754078599 | /src/tactic/ring.lean | 82a18559f2a72230089b64eb05f352afdfd485ed | [
"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 | 30,715 | 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 tactic.norm_num
/-!
# `ring`
Evaluate expressions in the language of commutative (semi)rings.
Based on <http://www.cs.ru.nl/~freek/courses/tt-2014/read/10.1.... |
be211b8b3fdd4d6938a90c37ea5a3018f09459d8 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/linear_algebra/multilinear/finite_dimensional.lean | aa328791e6c389e284492f43e9b1f0a9e2438bf1 | [
"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,762 | lean | /-
Copyright (c) 2022 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import linear_algebra.multilinear.basic
import linear_algebra.free_module.finite.matrix
/-! # Multilinear maps over finite dimensional spaces
> THIS FILE IS SYNCHRONIZED ... |
ddd254b9945763f22e2cb83d1ab332306e9a0b92 | bb31430994044506fa42fd667e2d556327e18dfe | /src/algebra/group/units.lean | 67e2461a0891796d27a8cfcfe1fecf23aba2c52e | [
"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 | 20,022 | lean | /-
Copyright (c) 2017 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Mario Carneiro, Johannes HΓΆlzl, Chris Hughes, Jens Wagemaker, Jon Eugster
-/
import algebra.group.basic
import logic.unique
import tactic.nontriviality
/-!
# Units (i.e., invert... |
58a82c3beebc03771353102cf0244e81fdfe95ba | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/category_theory/monoidal/skeleton.lean | d708628898324ef901ee896525892e655701f772 | [
"Apache-2.0"
] | permissive | jjgarzella/mathlib | 96a345378c4e0bf26cf604aed84f90329e4896a2 | 395d8716c3ad03747059d482090e2bb97db612c8 | refs/heads/master | 1,686,480,124,379 | 1,625,163,323,000 | 1,625,163,323,000 | 281,190,421 | 2 | 0 | Apache-2.0 | 1,595,268,170,000 | 1,595,268,169,000 | null | UTF-8 | Lean | false | false | 1,748 | lean | /-
Copyright (c) 2021 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta
-/
import category_theory.monoidal.functor
import category_theory.monoidal.braided
import category_theory.monoidal.transport
import category_theory.skeletal
/-!
# The monoi... |
d9be232f154f40464662c15c0f60aa6f56dc3d90 | 26bff4ed296b8373c92b6b025f5d60cdf02104b9 | /tests/lean/run/nested_begin.lean | 44533be5d01df17a6539482b68be49b89872140a | [
"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 | 1,272 | lean | import logic data.nat.basic
open nat
inductive vector (A : Type) : nat β Type :=
| vnil : vector A zero
| vcons : Ξ {n : nat}, A β vector A n β vector A (succ n)
namespace vector
definition no_confusion2 {A : Type} {n : nat} {P : Type} {vβ vβ : vector A n} : vβ = vβ β vector.no_confusion_type P vβ vβ :=
assume H... |
476f527fc033e22831508d8d032d38d526d27b66 | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /tests/lean/run/group5.lean | 9cb0f67c0fa2efda4cfd3f48f941bc13c4f37cae | [
"Apache-2.0"
] | permissive | chubbymaggie/lean | 0d06ae25f9dd396306fb02190e89422ea94afd7b | d2c7b5c31928c98f545b16420d37842c43b4ae9a | refs/heads/master | 1,611,313,622,901 | 1,430,266,839,000 | 1,430,267,083,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,000 | 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
-- algebra.group
-- =============
-- Various structures with 1, *, inv, including groups.
import logic.eq
import data.unit data.sigma data.prod... |
68a388ac6dc691711ef7bc942789a4a99285182e | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/topology/instances/complex.lean | 75703c48bfa49c422f04193a06a7939e68594674 | [
"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 | 6,119 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
Topology of the complex numbers.
-/
import data.complex.basic topology.metric_space.basic topology.instances.real
noncomputable theory
open filter metric
open_locale to... |
7667e44ebc934c992d91f95c1c179ed2028eac03 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/number_theory/bernoulli_polynomials.lean | 73b8263a760859f8e47a640b626c37ddba9b757f | [
"Apache-2.0"
] | permissive | jcommelin/mathlib | d8456447c36c176e14d96d9e76f39841f69d2d9b | ee8279351a2e434c2852345c51b728d22af5a156 | refs/heads/master | 1,664,782,136,488 | 1,663,638,983,000 | 1,663,638,983,000 | 132,563,656 | 0 | 0 | Apache-2.0 | 1,663,599,929,000 | 1,525,760,539,000 | Lean | UTF-8 | Lean | false | false | 9,987 | lean | /-
Copyright (c) 2021 Ashvni Narayanan. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Ashvni Narayanan, David Loeffler
-/
import data.polynomial.algebra_map
import data.polynomial.derivative
import data.nat.choose.cast
import number_theory.bernoulli
/-!
# Bernoulli p... |
17c71ba97f8c1d0e2d9d4b9cd87bc940d334809f | 205f0fc16279a69ea36e9fd158e3a97b06834ce2 | /EXAMS/key-in-class-quiz-bi-or.lean | 98c8b5bc635d00cb9bb0ec81ef7b5071ddcc1786 | [] | 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 | 3,280 | lean | /-
Prove P β¨ Q β Q β¨ P.
-/
theorem
or_commutes :
β P Q: Prop, P β¨ Q β Q β¨ P
:=
begin
/-
Introduce the assumptions that P and Q
are arbitrary propositions.
-/
assume P Q: Prop,
/-
To prove a bi-implication, we prove the
implications in each direction. That is,
we break the overall goal into subgoals,
one fo... |
9d06a24891acf3a84f6e9f5194d51baa103ddce3 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/set_theory/cofinality.lean | 555e4ed2ac144ea0995b449968071658fbf12aba | [
"Apache-2.0"
] | permissive | dupuisf/mathlib | 62de4ec6544bf3b79086afd27b6529acfaf2c1bb | 8582b06b0a5d06c33ee07d0bdf7c646cae22cf36 | refs/heads/master | 1,669,494,854,016 | 1,595,692,409,000 | 1,595,692,409,000 | 272,046,630 | 0 | 0 | Apache-2.0 | 1,592,066,143,000 | 1,592,066,142,000 | null | UTF-8 | Lean | false | false | 22,027 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
-/
import set_theory.cardinal_ordinal
/-!
# Cofinality on ordinals, regular cardinals
-/
noncomputable theory
open function cardinal set
open_locale classical
universes... |
549d53b7c744a1408f150dd2b6d98d6fd947b60b | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/1361.lean | a87d1e75920ea0fb80260e11d46cafde9e92350a | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 1,223 | lean | namespace Ex1
inductive Multiset (Ξ±: Type): Type
def Finset (Ξ± : Type) := @Subtype (Multiset Ξ±) (Ξ» _ => True)
def Finset.insert (a : Ξ±): Finset Ξ± β Finset Ξ± := sorry
def Finset.empty : Finset Ξ± := sorry
structure Foo (G: Fin 0) (m: Nat) where
n: Nat
f: Fin m
inductive Bar {G: Fin 0} : {m: Nat} β Finset (Foo G m... |
c50efe4d92bdcd3c5da9305c6bcf4573bc83d11c | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/data/equiv/mul_add.lean | c8c00a666e307c48c551cbd3eb6cd30b17c97a44 | [
"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 | 21,568 | 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, Callum Sutton, Yury Kudryashov
-/
import algebra.group.hom
import algebra.group.type_tags
import algebra.group.units_hom
import algebra.group_with_zero
/-!
# Multiplic... |
29a6af4afa84affe415842c8a047cd2f3c557d05 | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/pr1.lean | 439c0650a1d919110a9e9f5d67e7051c2ae547ad | [
"Apache-2.0"
] | permissive | codyroux/lean0.1 | 1ce92751d664aacff0529e139083304a7bbc8a71 | 0dc6fb974aa85ed6f305a2f4b10a53a44ee5f0ef | refs/heads/master | 1,610,830,535,062 | 1,402,150,480,000 | 1,402,150,480,000 | 19,588,851 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 112 | lean | (* import("tactic.lua") *)
theorem T (C A B : Bool) : C -> A -> B -> A.
exact.
done.
print environment 1. |
8958c59f82777627bd564fc247aa871e0cc8cf3f | 9467cef9baa3ce9e7357f85743477488d73a6128 | /graphs.hlean | bebc2c6d13bb50108c9314dedb994ce59830ab4f | [] | no_license | EgbertRijke/HoTT_Lean | 5982de03e9bce4ce6f5fe0caa78ef938505681dd | a28a6bf25f7dafdcd3d2181fd6148fd0720f0847 | refs/heads/master | 1,610,309,632,029 | 1,422,251,273,000 | 1,422,251,273,000 | 29,821,165 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,920 | hlean | open sigma eq
namespace graphs
-- We begin by defining the fundamental structure of the graph model
-- The context in the graph model are the graphs themselves
structure ctx :=
( vertex : Type)
( edge : vertex β vertex β Type)
-- The families in the graph model are families of graphs
structure fam (G : ctx) :=
... |
1c68445ecee9115bba991783ae675c6f1095c2cf | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/lean/run/subst1.lean | 8b2d822a039da9715776c40ee3dbdf77f63277e6 | [
"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 | 672 | lean | new_frontend
set_option trace.Meta.Tactic.subst true
theorem tst1 (x y z : Nat) : y = z β x = x β x = y β x = z :=
begin
intros h1 h2 h3;
subst x;
assumption
end
theorem tst2 (x y z : Nat) : y = z β x = z + y β x = z + z :=
begin
intros h1 h2;
subst h1;
subst h2;
exact rfl
end
def BV (n : Nat) : Type ... |
65c873e8b84f2384ad071a76a0c0ae7f1bdf11b4 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/CommandExtOverlap.lean | 62ffc698dbd0a8936d4bd104a7a0636c6c657bca | [
"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 | 319 | lean | syntax (name := mycheck) "#check" sepBy(term, ",") : command
open Lean
macro_rules (kind := mycheck)
| `(#check $es,*) =>
let cmds := es.getElems.map $ fun e => mkNode `Lean.Parser.Command.check #[mkAtom "#check", e]
pure $ mkNullNode cmds
#check true
#check true, true
#check true, 1, 3, fun (x : Nat) => x + 1
|
8c2726f6ae2131b9d60caca072acdf884eb33bea | ca1ad81c8733787aba30f7a8d63f418508e12812 | /clfrags/src/hilbert/wr/proofs/dc_neg.lean | 212f98ea47289ca762ad426a3638706493ed6195 | [] | no_license | greati/hilbert-classical-fragments | 5cdbe07851e979c8a03c621a5efd4d24bbfa333a | 18a21ac6b2e890060eb4ae65752fc0245394d226 | refs/heads/master | 1,591,973,117,184 | 1,573,822,710,000 | 1,573,822,710,000 | 194,334,439 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,317 | lean | import hilbert.wr.dc_neg
import hilbert.wr.proofs.dc
namespace clfrags
namespace hilbert
namespace wr
namespace dc_neg
theorem dcnβ_dc {a b c d e f : Prop} (hβ : dc e f (dc c d (dc b a (neg a))))
: dc e f (dc c d b) :=
have hβ : dc (dc e f c... |
a9d5f3f86e92ee020111061316fb4789b4032a8b | f5f7e6fae601a5fe3cac7cc3ed353ed781d62419 | /src/data/analysis/filter.lean | bb90047a333c300b910fa4aba4f0069661312f98 | [
"Apache-2.0"
] | permissive | EdAyers/mathlib | 9ecfb2f14bd6caad748b64c9c131befbff0fb4e0 | ca5d4c1f16f9c451cf7170b10105d0051db79e1b | refs/heads/master | 1,626,189,395,845 | 1,555,284,396,000 | 1,555,284,396,000 | 144,004,030 | 0 | 0 | Apache-2.0 | 1,533,727,664,000 | 1,533,727,663,000 | null | UTF-8 | Lean | false | false | 11,824 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
Computational realization of filters (experimental).
-/
import order.filter
open set filter
/-- A `cfilter Ξ± Ο` is a realization of a filter (base) on `Ξ±`,
represent... |
3d99fb187071e7674da32dfe3586334edce18a5f | ae1e94c332e17c7dc7051ce976d5a9eebe7ab8a5 | /stage0/src/Lean/Elab/PreDefinition/Basic.lean | 53e67e9522362460dbe6b0bd0143fad2e277941b | [
"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 | 6,850 | 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.Util.SCC
import Lean.Meta.AbstractNestedProofs
import Lean.Elab.Term
import Lean.Elab.DefView
import Lean.Elab.PreDefinition.MkInhabitant
names... |
7f32e9ea3fdadcc940dbeabce2abd04170be3dd8 | f4bff2062c030df03d65e8b69c88f79b63a359d8 | /world_plans/supinf_experiments.lean | 71165e70cbf9784d00407f198ac79e2d3385d05e | [
"Apache-2.0"
] | permissive | adastra7470/real-number-game | 776606961f52db0eb824555ed2f8e16f92216ea3 | f9dcb7d9255a79b57e62038228a23346c2dc301b | refs/heads/master | 1,669,221,575,893 | 1,594,669,800,000 | 1,594,669,800,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,395 | lean | import data.real.basic -- Lean has a good API for reals so I'm happy to use them.
import algebra.pointwise -- for addition on set β
import for_mathlib.add_comm_monoid
local attribute [instance] set.add_comm_monoid
/-
Goal : prove the following theorem.
Sup(X+Y)=Sup(X)+Sup(Y).
Goal after that: state and prove Richard ... |
71866a55ec10f82cf6f0bbe380048f0759544761 | d5ecf6c46a2f605470a4a7724909dc4b9e7350e0 | /group_theory/subgroup.lean | dd2edc80c1f7e2060f2f66edff348b238fe11e6a | [
"Apache-2.0"
] | permissive | MonoidMusician/mathlib | 41f79df478987a636b735c338396813d2e8e44c4 | 72234ef1a050eea3a2197c23aeb345fc13c08ff3 | refs/heads/master | 1,583,672,205,771 | 1,522,892,143,000 | 1,522,892,143,000 | 128,144,032 | 0 | 0 | Apache-2.0 | 1,522,892,144,000 | 1,522,890,892,000 | Lean | UTF-8 | Lean | false | false | 9,719 | 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
-/
import data.finset algebra.big_operators data.equiv data.set data.nat.basic set_theory.cardinal
open set function finset
universes u v w
variables {Ξ± : Type u} {Ξ² ... |
08625635ad603c2728f76d513c36bb0a8fbd269d | 6065973b1fa7bbacba932011c9e2f32bf7bdd6c1 | /src/data/complex/is_R_or_C.lean | 5c23343e3a11934acbcb25c28c1c41dcc240671b | [
"Apache-2.0"
] | permissive | khmacdonald/mathlib | 90a0fa2222369fa69ed2fbfb841b74d2bdfd66cb | 3669cb35c578441812ad30fd967d21a94b6f387e | refs/heads/master | 1,675,863,801,090 | 1,609,761,876,000 | 1,609,761,876,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 30,262 | lean | /-
Copyright (c) 2020 FrΓ©dΓ©ric Dupuis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: FrΓ©dΓ©ric Dupuis
-/
import analysis.normed_space.basic
import analysis.complex.basic
/-!
# `is_R_or_C`: a typeclass for β or β
This file defines the typeclass `is_R_or_C` intended t... |
4beae984afddae7e8fd49337339ec7b6920469d5 | 6b02ce66658141f3e0aa3dfa88cd30bbbb24d17b | /stage0/src/Lean/Elab/PreDefinition/Structural.lean | d3876530c862e473104f6823f4b6ca98bd1b2ad4 | [
"Apache-2.0"
] | permissive | pbrinkmeier/lean4 | d31991fd64095e64490cb7157bcc6803f9c48af4 | 32fd82efc2eaf1232299e930ec16624b370eac39 | refs/heads/master | 1,681,364,001,662 | 1,618,425,427,000 | 1,618,425,427,000 | 358,314,562 | 0 | 0 | Apache-2.0 | 1,618,504,558,000 | 1,618,501,999,000 | null | UTF-8 | Lean | false | false | 22,884 | 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.Util.ForEachExpr
import Lean.Meta.ForEachExpr
import Lean.Meta.RecursorInfo
import Lean.Meta.Match.Match
import Lean.Elab.PreDefinition.Basic
na... |
8176cb4c01bf97b41d29356c6c3531b95f29307c | 9a0b1b3a653ea926b03d1495fef64da1d14b3174 | /data/nat/basic.lean | 6bccb466cb877f1a0027d7eb8fcdf04dc86b2c4e | [
"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 | 25,626 | lean | /-
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, Leonardo de Moura, Jeremy Avigad, Mario Carneiro
Basic operations on the natural numbers.
-/
import logic.basic algebra.order data.option
universe u
namespace na... |
c0440c6057baa2b47579825ad98512918cfff61a | 4fa161becb8ce7378a709f5992a594764699e268 | /src/category_theory/monoidal/of_has_finite_products.lean | 0b452942e816bc5b345b3351aa2de20c39000177 | [
"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 | 4,834 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Simon Hudon
-/
import category_theory.monoidal.category
import category_theory.limits.shapes.binary_products
import category_theory.limits.types
/-!
# The natural mono... |
7c95c272f846690afe04b8c2aae00c1fa47e794c | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/compiler/binomial.lean | 8622c5122e3ba58b6ea05387c5c0f3c199a35253 | [
"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 | 676 | lean | import Init.Data.BinomialHeap
abbrev Heap := BinomialHeap Nat (fun a b => a < b)
def mkHeap (n m : Nat) : Heap :=
let hs : List Heap := n.fold (fun i hs =>
let h : Heap := BinomialHeap.empty;
let h : Heap := m.fold (fun j h =>
let v := n*m - j*n - i;
h.insert v) h;
h :: hs)
[];
hs.foldl (fun hβ hβ => ... |
6e273f292ad8576d9bf68cd45bdc851b8e561c32 | 6b7c9c6393bac7cb1c64582a1c62597e24f5bb80 | /src/tactic/gptf/basic.lean | 251c26c833f050af5981f4a3654af14aabd97d54 | [
"Apache-2.0"
] | permissive | alreadydone/lean-gptf | 56a7d9cbd9400af72fb143d60c8774b8cfbc09cb | b4ab1eb2da0178f3dcdc49771d9fed6b50e35d98 | refs/heads/master | 1,679,371,993,063 | 1,614,479,778,000 | 1,614,479,778,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,486 | lean | /-
Copyright (c) 2021 Jesse Michael Han. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Jesse Michael Han, Ed Ayers
Core logic of the `gptf` tactic
-/
import system.io
import tactic
import tactic.gptf.utils.util
import basic.control
meta structure ModelAPI (input_... |
d110cae3f784ad174adff163d012a76a8e28e385 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/empty_thm.lean | 1af981a5c6b347f2abbfbb4520346607b76fc1cc | [
"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 | 158 | lean | import logic
open tactic
definition simple := apply _root_.trivial
tactic_hint simple
theorem foo : true
theorem foo2 (a : Prop) : a :
theorem foo3 : true
|
bb0761e116da7fc9aad365470b8deadf2df3c694 | c777c32c8e484e195053731103c5e52af26a25d1 | /archive/imo/imo2019_q2.lean | ca6781c82a7e5623454f3ad6269793edd35e63f8 | [
"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 | 26,501 | lean | /-
Copyright (c) 2022 Joseph Myers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Joseph Myers
-/
import geometry.euclidean.angle.sphere
import geometry.euclidean.sphere.second_inter
/-!
# IMO 2019 Q2
In triangle `ABC`, point `Aβ` lies on side `BC` and point `Bβ` li... |
15bb643b6c6834b247fce726ee9abbd9e61794fb | 92c6b42948d74fe325c2d88530f1d36da388b2f7 | /src/sexp.lean | 7690529a874888ce4f3ace27640ad14f34fe592c | [
"MIT"
] | permissive | riaqn/smtlean | 8ad65055b6c1600cd03b9e345059a3b24419b6d5 | c11768cfb43cd634340b552f5039cba094701a87 | refs/heads/master | 1,584,569,627,940 | 1,535,314,713,000 | 1,535,314,713,000 | 135,333,334 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 4,740 | lean | import data.buffer.parser
import .common
universe u
attribute [reducible]
def symbol := string
inductive literal : Type
| num : nat β literal
| str : string β literal
instance : has_to_string literal :=
β¨ Ξ» lit, match lit with
| literal.num n := "<SOME NAT>"
| literal.str s := "\"" ++ s ++ "\""
end
β©
-- list repre... |
1222ad186382327669e16bdef4c5148a9da2df55 | 367134ba5a65885e863bdc4507601606690974c1 | /src/category_theory/limits/shapes/kernels.lean | 1e3ba29caebd638a9a2a26ce73d90527a9b8e3fa | [
"Apache-2.0"
] | permissive | kodyvajjha/mathlib | 9bead00e90f68269a313f45f5561766cfd8d5cad | b98af5dd79e13a38d84438b850a2e8858ec21284 | refs/heads/master | 1,624,350,366,310 | 1,615,563,062,000 | 1,615,563,062,000 | 162,666,963 | 0 | 0 | Apache-2.0 | 1,545,367,651,000 | 1,545,367,651,000 | null | UTF-8 | Lean | false | false | 27,074 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Markus Himmel
-/
import category_theory.limits.shapes.zero
/-!
# Kernels and cokernels
In a category with zero morphisms, the kernel of a morphism `f : X βΆ Y` is
the ... |
5aafa0ac319c3d1b1e1a2c92083120b342cd8137 | 75cbd886877138cccf93fb0ef52fb0eb9c519305 | /src/maps.lean | 997d0668b498dfddcb5130a1fa0ebe4c8d606383 | [] | no_license | kmill/lean-graphs | 973ad2bb652032c2ef6087995af60294a561dab5 | bd3139daf81c0f41ce5ade951195858cdf038bd2 | refs/heads/master | 1,667,752,580,941 | 1,592,947,279,000 | 1,592,947,279,000 | 274,511,081 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 13,138 | lean | -- combinatorial maps
--import data.multiset
import data.list.perm
import data.fintype.basic
import data.equiv.basic
import group_theory.perm.cycles
import myequiv
import tactic
namespace maps
open function
open equiv
universe u
-- A two-dimension combinatorial map is a collection D of darts, a
-- permutation Ο wh... |
1dc6ee3a0d9fda2776d68f03d2e47f58516f9b37 | d436468d80b739ba7e06843c4d0d2070e43448e5 | /src/algebra/field.lean | 4a3e9d4703a39cfe67308dc64babfb6cd27ad4bc | [
"Apache-2.0"
] | permissive | roro47/mathlib | 761fdc002aef92f77818f3fef06bf6ec6fc1a28e | 80aa7d52537571a2ca62a3fdf71c9533a09422cf | refs/heads/master | 1,599,656,410,625 | 1,573,649,488,000 | 1,573,649,488,000 | 221,452,951 | 0 | 0 | Apache-2.0 | 1,573,647,693,000 | 1,573,647,692,000 | null | UTF-8 | Lean | false | false | 8,907 | lean | /-
Copyright (c) 2017 Johannes HΓΆlzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes HΓΆlzl, Mario Carneiro
-/
import algebra.ring logic.basic
open set
universe u
variables {Ξ± : Type u}
-- Default priority sufficient as core version has custom-set lower prior... |
58188be0d13d45d96bfe60034b1a6fd50250ab7c | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /src/topology/algebra/group.lean | 38859e23432da362db7a24d7eed0c376f508bf1a | [
"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 | 17,321 | 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
Theory of topological groups.
-/
import order.filter.pointwise
import group_theory.quotient_group
import topology.algebra.monoid
import... |
c7392f6fa5536a48afdc6ebb21f722c6e61b3730 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/group_theory/perm/cycle/basic.lean | 804eba5fc61eb7faaa9ce89eb37df0ba8bddce8c | [
"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 | 59,962 | lean | /-
Copyright (c) 2019 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import data.finset.noncomm_prod
import group_theory.perm.sign
import logic.equiv.fintype
/-!
# Cyclic permutations
## Main definitions
In the following, `f : equiv.perm... |
ba737aac35d9b6b11bec6a362b72102a781b93a9 | f1a12d4db0f46eee317d703e3336d33950a2fe7e | /lia/cooper/correctness.lean | 3726b8daea95eab75aa46b6c24ae1e7e1e5e727f | [
"Apache-2.0"
] | permissive | avigad/qelim | bce89b79c717b7649860d41a41a37e37c982624f | b7d22864f1f0a2d21adad0f4fb3fc7ba665f8e60 | refs/heads/master | 1,584,548,938,232 | 1,526,773,708,000 | 1,526,773,708,000 | 134,967,693 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 46,076 | lean | import .qe
open lia
lemma I_atom_le (i : int) (ks zs : list int) :
I (A' (atom.le i ks)) zs β (i β€ list.dot_prod ks zs) := iff.refl _
lemma I_atom_dvd (d i ks zs) :
I (A' (atom.dvd d i ks)) zs β (has_dvd.dvd d (i + list.dot_prod ks zs)) := iff.refl _
lemma I_atom_ndvd (d i ks zs) :
I (A' (atom.ndvd d i ks)... |
9e750e2ce7aa62048d415ce715260d233653f249 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/hott/constr_tac.hlean | 23a04519242ddd742308622d2239b3a1d1c23947 | [
"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 | 527 | hlean | open prod
example (a b c : Type) : a β b β c β a Γ b Γ c :=
begin
intro Ha Hb Hc,
repeat (split | assumption)
end
example (a b : Type) : a β sum a b :=
begin
intro Ha,
left,
assumption
end
example (a b : Type) : b β sum a b :=
begin
intro Ha,
right,
assumption
end
open nat
example (a : nat) : a > 0... |
a6c6799f1109adfb6e0a8db7496b8da57560e511 | 367134ba5a65885e863bdc4507601606690974c1 | /docs/tutorial/category_theory/calculating_colimits_in_Top.lean | ef71048d200d33fcc3cb8fc7847a4399cc891b56 | [
"Apache-2.0"
] | permissive | kodyvajjha/mathlib | 9bead00e90f68269a313f45f5561766cfd8d5cad | b98af5dd79e13a38d84438b850a2e8858ec21284 | refs/heads/master | 1,624,350,366,310 | 1,615,563,062,000 | 1,615,563,062,000 | 162,666,963 | 0 | 0 | Apache-2.0 | 1,545,367,651,000 | 1,545,367,651,000 | null | UTF-8 | Lean | false | false | 3,598 | lean | import topology.category.Top.limits
import category_theory.limits.shapes
import topology.instances.real
import topology.tactic
/-! This file contains some demos of using the (co)limits API to do topology. -/
noncomputable theory
open category_theory
open category_theory.limits
def R : Top := Top.of β
def I : Top :=... |
890f51cbb3001bf15a2d965ac64468daeb181d47 | 618003631150032a5676f229d13a079ac875ff77 | /src/group_theory/abelianization.lean | 3c45fff95f2b746852ad2d1e5ee3cf402e473474 | [
"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 | 1,934 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Michael Howes
The functor Grp β Ab which is the left adjoint
of the forgetful functor Ab β Grp.
-/
import group_theory.quotient_group
universes u v
variables (Ξ± : Type u) [gr... |
8e632e144cbb2f93ff885b835a6cc10d00a2b2d5 | e38e95b38a38a99ecfa1255822e78e4b26f65bb0 | /src/certigrad/aevb/graph.lean | c4f9fedff1d62029b209e97077923d71bb82610a | [
"Apache-2.0"
] | permissive | ColaDrill/certigrad | fefb1be3670adccd3bed2f3faf57507f156fd501 | fe288251f623ac7152e5ce555f1cd9d3a20203c2 | refs/heads/master | 1,593,297,324,250 | 1,499,903,753,000 | 1,499,903,753,000 | 97,075,797 | 1 | 0 | null | 1,499,916,210,000 | 1,499,916,210,000 | null | UTF-8 | Lean | false | false | 3,865 | lean | /-
Copyright (c) 2017 Daniel Selsam. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Daniel Selsam
The actual graph produced by the naive variational auto-encoder code in aevb/prog.lean.
Note: we include this file as an optimization, to avoid repeatedly simplifying the... |
7aab7857e6838009e9d5933b32e4d27578c659be | dd24e6c3b8dc14dc504f8a906fc04c51e4312e6b | /src/mywork/lecture_1b.lean | 897572d167042a1eedbe1c0e9ad206b46207a454 | [] | no_license | njeyasingh/CS-2120 | dd781a90dd0645b74e61cee1813483fb7cb4a111 | b3356f665a246f295b3f1e6d61901bfca331810d | refs/heads/main | 1,693,294,711,274 | 1,635,188,659,000 | 1,635,188,659,000 | 399,945,420 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,987 | lean | # Truth and Reasoning
## Truth
We do better on the whole when we act on what is _true_ than when we don't.
## Reasoning
- Cognitive paths to truths
- Important styles of reasoning include inductive, abductive, deductive.
- Inductive:
- The sun has always come up in the morning, so (generalizing from these obs... |
f6fa8fbd927d841138e0acb24eab7719f0327a24 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/rat/big_operators.lean | d1ca121dbdf3cc3612aabd6849e8ba9f7d45c963 | [
"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,380 | lean | /-
Copyright (c) 2019 Johannes HΓΆlzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes HΓΆlzl, Mario Carneiro
-/
import data.rat.cast
import algebra.big_operators.basic
/-! # Casting lemmas for rational numbers involving sums and products
-/
open_locale big_ope... |
c0276baec36b64f7c51bc002a4089c018a75c6db | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/analysis/normed_space/star/exponential.lean | 1c07409b88ab5aeec95c124415f8b87a21d30012 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 1,996 | 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 analysis.normed_space.exponential
/-! # The exponential map from selfadjoint to unitary
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file r... |
781f7532554588bb96e162fef712d98109786a5b | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/tactic/ring.lean | db225e74a45123e295627a7238ca4021395614db | [
"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 | 29,916 | 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 tactic.norm_num
import data.int.range
/-!
# `ring`
Evaluate expressions in the language of commutative (semi)rings.
Based on <http://www.cs.ru.nl/~freek/cour... |
b0801647dab1074ead433459e2c4aa868ec6debd | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/data/pnat/factors.lean | c0d98690df2804c1c26db25ccae33c7a28b9e564 | [
"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 | 13,966 | lean | /-
Copyright (c) 2019 Neil Strickland. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Neil Strickland
-/
import data.pnat.basic
import data.multiset.sort
import data.int.gcd
import algebra.group
/-- The type of multisets of prime numbers. Unique factorization
gives a... |
3c596c69d37093209c4da39ff4502e53b2d172b3 | 36c7a18fd72e5b57229bd8ba36493daf536a19ce | /library/data/rat/basic.lean | bf9c2dab2de6f9fb81c0ca100a34366de6985cab | [
"Apache-2.0"
] | permissive | YHVHvx/lean | 732bf0fb7a298cd7fe0f15d82f8e248c11db49e9 | 038369533e0136dd395dc252084d3c1853accbf2 | refs/heads/master | 1,610,701,080,210 | 1,449,128,595,000 | 1,449,128,595,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 24,183 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad
The rational numbers as a field generated by the integers, defined as the usual quotient.
-/
import data.int algebra.field
open int quot eq.ops
open algebra
record prerat... |
90a66da238a64841946a89af04af42a1168a6028 | 6065973b1fa7bbacba932011c9e2f32bf7bdd6c1 | /src/measure_theory/measure_space.lean | 2d065db49eb8599db17f11f19b98d3c6e2dca241 | [
"Apache-2.0"
] | permissive | khmacdonald/mathlib | 90a0fa2222369fa69ed2fbfb841b74d2bdfd66cb | 3669cb35c578441812ad30fd967d21a94b6f387e | refs/heads/master | 1,675,863,801,090 | 1,609,761,876,000 | 1,609,761,876,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 93,452 | lean | /-
Copyright (c) 2017 Johannes HΓΆlzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes HΓΆlzl, Mario Carneiro
-/
import measure_theory.outer_measure
import order.filter.countable_Inter
import data.set.accumulate
/-!
# Measure spaces
Given a measurable space `Ξ±`... |
30c20e70e4074db23ffd2d941b9f86865dc7f855 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tests/lean/run/lean3_zulip_issues_1.lean | 9e9cad56930dba91002f469f7bb45c3366c4f491 | [
"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 | 1,319 | lean | example : Prop := β n, (n:Nat) + n = n.succ
example : Prop := β n, n.succ = (n:Nat) + n
example : Prop := β n, (n:Nat) + n.succ = n
example : Prop := β n, n.succ + (n:Nat) = n
example : Prop := β n, (n.succ:Nat) + n = n
example : Prop := β n, (n:Nat).succ + n = n
def fib: Nat β Nat
| 0 => 0
| 1 => 1
| n + 2 => fib n +... |
6a9482617fa5ca0eb6d55084e9929b484816f69c | d0664585e88edfefe384f2b01de54487029040bb | /exercises/entourages_from_pseudometric.lean | eda745c0a49d2f8eaf2286d5dc69ae9573023ed4 | [] | no_license | ImperialCollegeLondon/uniform-structures | acf0a092d764925564595c59e7347e066d2a78ab | a41a170ef125b36bdac1e2201f54affa958d0349 | refs/heads/master | 1,668,088,958,039 | 1,592,495,127,000 | 1,592,495,127,000 | 269,964,470 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,390 | lean | -- import the definitions of uniform space via entourages
import uniform_structure.entourages
-- import the definition of pseudometric space
import pseudometric_space
-- In this exercise we will show that a pseudometric on a set X
-- gives rise to a collection of entourages for X
-- This is a question about pseudo... |
edf94b29da1f65d87dbb3cfa31d4ae99394a6b4d | 367134ba5a65885e863bdc4507601606690974c1 | /src/ring_theory/polynomial/cyclotomic.lean | 5f8487efc809d87e0c0995a6849aefd4b4a0e849 | [
"Apache-2.0"
] | permissive | kodyvajjha/mathlib | 9bead00e90f68269a313f45f5561766cfd8d5cad | b98af5dd79e13a38d84438b850a2e8858ec21284 | refs/heads/master | 1,624,350,366,310 | 1,615,563,062,000 | 1,615,563,062,000 | 162,666,963 | 0 | 0 | Apache-2.0 | 1,545,367,651,000 | 1,545,367,651,000 | null | UTF-8 | Lean | false | false | 30,740 | lean | /-
Copyright (c) 2020 Riccardo Brasca. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Riccardo Brasca
-/
import field_theory.splitting_field
import ring_theory.roots_of_unity
import algebra.polynomial.big_operators
import number_theory.arithmetic_function
import data.p... |
e1fadcc96c067ce9ec737def815d3ff3313e44b1 | bb31430994044506fa42fd667e2d556327e18dfe | /src/geometry/euclidean/circumcenter.lean | f03398d2a09fce64f6f59b01d91bd8bf0abb635e | [
"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 | 44,142 | lean | /-
Copyright (c) 2020 Joseph Myers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Joseph Myers
-/
import geometry.euclidean.basic
import linear_algebra.affine_space.finite_dimensional
import tactic.derive_fintype
/-!
# Circumcenter and circumradius
This file proves ... |
f89eb4464ea0831a734002ade9620f735e2ac0a3 | 367134ba5a65885e863bdc4507601606690974c1 | /src/topology/algebra/normed_group.lean | fbc3cf1117fb4456ed8f0ba7be053821ce92a478 | [
"Apache-2.0"
] | permissive | kodyvajjha/mathlib | 9bead00e90f68269a313f45f5561766cfd8d5cad | b98af5dd79e13a38d84438b850a2e8858ec21284 | refs/heads/master | 1,624,350,366,310 | 1,615,563,062,000 | 1,615,563,062,000 | 162,666,963 | 0 | 0 | Apache-2.0 | 1,545,367,651,000 | 1,545,367,651,000 | null | UTF-8 | Lean | false | false | 1,431 | 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 topology.algebra.group_completion
import topology.metric_space.completion
/-!
# Completion of normed groups
In this file we show that the completion of a nor... |
8482e133da8c01c1e7884d4e514f2040905dfb56 | 17d3c61bf162bf88be633867ed4cb201378a8769 | /tests/lean/run/basic_monitor1.lean | 5e602a5e7750a4e78ca32712e0d484d78e760275 | [
"Apache-2.0"
] | permissive | u20024804/lean | 11def01468fb4796fb0da76015855adceac7e311 | d315e424ff17faf6fe096a0a1407b70193009726 | refs/heads/master | 1,611,388,567,561 | 1,485,836,506,000 | 1,485,836,625,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 291 | lean | meta def basic_monitor : vm_monitor nat :=
{ init := 0, step := Ξ» s, return (trace ("step " ++ s^.to_string) (Ξ» u, s+1)) >> failure }
run_command vm_monitor.register `basic_monitor
set_option debugger true
def f : nat β nat
| 0 := 0
| (a+1) := f a
vm_eval trace "a" (Ξ» u, f 4)
|
b8ae839f1f4cade30ec7f0a2e340e046c3890e2c | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/tactic/reserved_notation_auto.lean | 1fb6601dd2878fd9ad5bf4e5e6482e5f2651d2df | [] | 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 | 275 | lean | /-
Copyright (c) 2020 Bryan Gin-ge Chen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bryan Gin-ge Chen
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.PostPort
namespace Mathlib
end Mathlib |
d0c7c523de8fbf1478ec34383d58130831b77eb6 | 618003631150032a5676f229d13a079ac875ff77 | /src/tactic/monotonicity/lemmas.lean | 17e8a8d131b9bdcebc09790e212501ceaf5bdaf0 | [
"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 | 1,737 | lean | /-
Copyright (c) 2019 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Simon Hudon
-/
import tactic.monotonicity.basic
variables {Ξ± : Type*}
@[mono]
lemma mul_mono_nonneg {x y z : Ξ±} [ordered_semiring Ξ±]
(h' : 0 β€ z)
(h : x β€ y)
: x * z β€ y * z :=
by ap... |
a7cfbeee05457ef301469f3f06a195e25d61aaf3 | ec62863c729b7eedee77b86d974f2c529fa79d25 | /12/b.lean | 6629149290820b87956ea2bf8cef4e2f1a00bbab | [] | no_license | rwbarton/advent-of-lean-4 | 2ac9b17ba708f66051e3d8cd694b0249bc433b65 | 417c7e2718253ba7148c0279fcb251b6fc291477 | refs/heads/main | 1,675,917,092,057 | 1,609,864,581,000 | 1,609,864,581,000 | 317,700,289 | 24 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,195 | lean | structure Ship :=
x : Int
y : Int
dx : Int
dy : Int
instance : Inhabited Ship := β¨β¨0,0,1,0β©β©
def fakeCos (n : Int) : Int :=
match (((n / 90) % 4 + 4) % 4 : Int) with
| 0 => 1
| 1 => 0
| 2 => -1
| 3 => 0
| _ => panic! "impossible"
def fakeSin (n : Int) : Int := fakeCos (90 - n)
def move (s : Ship) : Char β Int β Shi... |
ae1e48612e4a137fefa27307a118b2941e591c03 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/algebraic_topology/simplicial_set.lean | 762b3a27540fb88a799b60b0445733ed6348d8b6 | [
"Apache-2.0"
] | permissive | stjordanis/mathlib | 51e286d19140e3788ef2c470bc7b953e4991f0c9 | 2568d41bca08f5d6bf39d915434c8447e21f42ee | refs/heads/master | 1,631,748,053,501 | 1,627,938,886,000 | 1,627,938,886,000 | 228,728,358 | 0 | 0 | Apache-2.0 | 1,576,630,588,000 | 1,576,630,587,000 | null | UTF-8 | Lean | false | false | 5,148 | lean | /-
Copyright (c) 2021 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Scott Morrison, Adam Topaz
-/
import algebraic_topology.simplicial_object
import category_theory.yoneda
import category_theory.limits.types
import category_theory.limit... |
d6c5cb82a998fcc86f48d7b4e986e76fefbae7ea | b3fced0f3ff82d577384fe81653e47df68bb2fa1 | /src/data/set/basic.lean | 1782832b7584c07bd2c0a68560eddb8a9d7ab5b4 | [
"Apache-2.0"
] | permissive | ratmice/mathlib | 93b251ef5df08b6fd55074650ff47fdcc41a4c75 | 3a948a6a4cd5968d60e15ed914b1ad2f4423af8d | refs/heads/master | 1,599,240,104,318 | 1,572,981,183,000 | 1,572,981,183,000 | 219,830,178 | 0 | 0 | Apache-2.0 | 1,572,980,897,000 | 1,572,980,896,000 | null | UTF-8 | Lean | false | false | 57,193 | 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.basic tactic.finish data.subtype logic.unique
open function
/- set coercion to a type -/
namespace set
instance {Ξ± : Type*} : has_coe_... |
ea4e20b83eca143d247e531a51f8fbf7d5afa7de | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /src/Lean/Compiler/ConstFolding.lean | 350663d9a0e62a9acc8464da22b9b17611f2775b | [
"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 | 7,586 | 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.Expr
import Lean.Compiler.Util
/-! Constant folding for primitives that have special runtime support. -/
namespace Lean.Compiler
abbrev BinFo... |
4e43f81664b19419f0e461f349d813ba0370c9fa | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/dynamics/ergodic/measure_preserving.lean | f493ce9c1f168768a1aaaf1db77dca1f93fb2701 | [
"Apache-2.0"
] | permissive | AntoineChambert-Loir/mathlib | 64aabb896129885f12296a799818061bc90da1ff | 07be904260ab6e36a5769680b6012f03a4727134 | refs/heads/master | 1,693,187,631,771 | 1,636,719,886,000 | 1,636,719,886,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,825 | lean | /-
Copyright (c) 2021 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import measure_theory.measure.measure_space
/-!
# Measure preserving maps
We say that `f : Ξ± β Ξ²` is a measure preserving map w.r.t. measures `ΞΌ : measure Ξ±` and
... |
f2e0cc5ad36d3cc28b8662817fcd568f03b067f3 | 2c096fdfecf64e46ea7bc6ce5521f142b5926864 | /src/Init/WFTactics.lean | c32bd34a2bbdc0a97f7d4a3fa1c5209574c69dab | [
"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 | Kha/lean4 | 1005785d2c8797ae266a303968848e5f6ce2fe87 | b99e11346948023cd6c29d248cd8f3e3fb3474cf | refs/heads/master | 1,693,355,498,027 | 1,669,080,461,000 | 1,669,113,138,000 | 184,748,176 | 0 | 0 | Apache-2.0 | 1,665,995,520,000 | 1,556,884,930,000 | Lean | UTF-8 | Lean | false | false | 2,605 | lean | /-
Copyright (c) 2022 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
prelude
import Init.SizeOf
import Init.WF
/-- Unfold definitions commonly used in well founded relation definitions.
This is primarily intended for internal... |
1b15c5ad957a4cdb9ba9b3b98e16e0cfca099255 | dc253be9829b840f15d96d986e0c13520b085033 | /algebra/product_group.hlean | b95d8603a3c3308e2b25861e79795f40422ac24f | [
"Apache-2.0"
] | permissive | cmu-phil/Spectral | 4ce68e5c1ef2a812ffda5260e9f09f41b85ae0ea | 3b078f5f1de251637decf04bd3fc8aa01930a6b3 | refs/heads/master | 1,685,119,195,535 | 1,684,169,772,000 | 1,684,169,772,000 | 46,450,197 | 42 | 13 | null | 1,505,516,767,000 | 1,447,883,921,000 | Lean | UTF-8 | Lean | false | false | 4,616 | 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, Egbert Rijke, Favonia
Constructions with groups
-/
import algebra.group_theory hit.set_quotient types.list types.sum .subgroup .quotient_group
open eq algebra is... |
52d0a1f771ffcc87e0aecf31536bd4ad5a9c88a9 | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /06_Inductive_Types.org.42.lean | 5cb8a01cd4bac10cf620e1d9fe6ed76714afff19 | [] | no_license | cjmazey/lean-tutorial | ba559a49f82aa6c5848b9bf17b7389bf7f4ba645 | 381f61c9fcac56d01d959ae0fa6e376f2c4e3b34 | refs/heads/master | 1,610,286,098,832 | 1,447,124,923,000 | 1,447,124,923,000 | 43,082,433 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 135 | lean | /- page 91 -/
import standard
namespace hide
-- BEGIN
inductive eq {A : Type} (a : A) : A β Prop :=
refl : eq a a
-- END
end hide
|
9d7336530193664f3ef50a957f96f1f1bf745e8b | e898bfefd5cb60a60220830c5eba68cab8d02c79 | /uexp/src/uexp/rules/MergeFilter.lean | b70e9f52599654342636094cd6e0749bc6a00c17 | [
"BSD-2-Clause"
] | permissive | kkpapa/Cosette | 9ed09e2dc4c1ecdef815c30b5501f64a7383a2ce | fda8fdbbf0de6c1be9b4104b87bbb06cede46329 | refs/heads/master | 1,584,573,128,049 | 1,526,370,422,000 | 1,526,370,422,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 890 | lean | import ..sql
import ..tactics
import ..u_semiring
import ..extra_constants
import ..ucongr
import ..TDP
set_option profiler true
open Expr
open Proj
open Pred
open SQL
open tree
notation `int` := datatypes.int
variable integer_10: const datatypes.int
theorem rule:
forall ( Ξ scm_dept: Schema) (rel_dept: relation s... |
0e42bdb8e49424df9433a4abe6dc3ab66dcfd2db | a156d865507798f08f46a2f6ca204d9727f4734d | /src/tactic/metadata.lean | 2b5d5e4ac9b3c934db916f026c83429d1808c6ff | [] | no_license | jesse-michael-han/formalabstracts | 4e2fc8c107a3388823ffbd1671dd1e54108ea394 | 63a949de7989f17c791c40e580c3011516af57e0 | refs/heads/master | 1,625,470,495,408 | 1,551,315,841,000 | 1,551,316,547,000 | 136,272,424 | 0 | 0 | null | 1,528,259,798,000 | 1,528,259,798,000 | null | UTF-8 | Lean | false | false | 4,297 | lean | /-
Copyright (c) 2018 Koundinya Vajjha. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Koundinya Vajjha
Generating meta data for a formal abstract.
-/
import .depends
import init.meta.interactive
open tactic expr interactive nat native name list environment
meta s... |
344d22752d535a7b4c922e0c1316407e7de5ff4a | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/combinatorics/simple_graph/prod.lean | 2a1dd54310f7a1e21baf9831b5952adf2db20a8a | [
"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,020 | lean | /-
Copyright (c) 2022 George Peter Banyard, YaΓ«l Dillies, Kyle Miller. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: George Peter Banyard, YaΓ«l Dillies, Kyle Miller
-/
import combinatorics.simple_graph.connectivity
/-!
# Graph products
This file defines the box prod... |
048c7733f6726afaca1e288071e5fc2cc9da375a | 3618c6e11aa822fd542440674dfb9a7b9921dba0 | /scratch/choose_letters.lean | 457fbb8ff5a8c9820a85c1a1e75e981b7c36fe9d | [] | no_license | ChrisHughes24/single_relation | 99ceedcc02d236ce46d6c65d72caa669857533c5 | 057e157a59de6d0e43b50fcb537d66792ec20450 | refs/heads/master | 1,683,652,062,698 | 1,683,360,089,000 | 1,683,360,089,000 | 279,346,432 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,779 | lean | import for_mathlib.coprod.free_group data.list.min_max order.lexicographic
open free_group multiplicative
variables {ΞΉ : Type} [decidable_eq ΞΉ] [inhabited ΞΉ] (r : free_group ΞΉ)
variables (T : set ΞΉ) [decidable_pred T]
-- Want `x` to have least occurences in `w`
-- `t` with smallest `exp_sum`, tie break is large sum ... |
612f6bc4afabb51c821c27166a601985ccae6e79 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/ring_theory/witt_vector/domain.lean | 2f908ee64d019da1e4cc169c8493b5a304b144e3 | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 3,732 | lean | /-
Copyright (c) 2022 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
-/
import ring_theory.witt_vector.identities
/-!
# Witt vectors over a domain
This file builds to the proof `witt_vector.is_domain`,
an instance that says if `R` i... |
27f5f533ce6a78199479efadc91c820914e26f6e | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/forInPArray.lean | 4217c5589434b6a8cd22a27bb23cda797b68e6c8 | [
"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 | 820 | lean | import Lean.Data.PersistentArray
def check (x : IO Nat) (expected : IO Nat) : IO Unit := do
unless (β x) == (β expected) do
throw $ IO.userError "unexpected result"
def f1 (xs : Lean.PArray Nat) (top : Nat) : IO Nat := do
let mut sum := 0
for x in xs do
if x % 2 == 0 then
IO.println s!"x: {x}"
sum := sum ... |
dac410b5d127fc1d9fc27fe8b48b7f5f30a351f5 | f1b175e38ffc5cc1c7c5551a72d0dbaf70786f83 | /data/finsupp.lean | fd8fb33722d6d053fee6ee146a3313ea58882c40 | [
"Apache-2.0"
] | permissive | mjendrusch/mathlib | df3ae884dd5ce38c7edf452bcbfd3baf4e3a6214 | 5c209edb7eb616a26f64efe3500f2b1ba95b8d55 | refs/heads/master | 1,585,663,284,800 | 1,539,062,055,000 | 1,539,062,055,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 37,937 | 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
Type of functions with finite support.
Functions with finite support provide the basis for the following concrete instances:
* β ββ Ξ±: Polynomials (where Ξ± is a ring... |
b1983c188c6707a6f24d171538d92e605b8a52ed | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/data/multiset/powerset.lean | 199cf2ec4d733d598d53e5427a6ae041b65bf786 | [
"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 | 9,262 | 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 data.multiset.basic
/-!
# The powerset of a multiset
-/
namespace multiset
open list
variables {Ξ± : Type*}
/-! ### powerset -/
/-- A helper function for t... |
61ce329f1ec0d11351d6e5a4b72de2215a927379 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/data/zmod/defs.lean | a8a6a3732836cd7fd2af36d7079b93f530dc6a3b | [
"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 | 6,760 | lean | /-
Copyright (c) 2022 Eric Rodriguez. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Eric Rodriguez
-/
import algebra.ne_zero
import data.nat.modeq
import data.fintype.lattice
/-!
# Definition of `zmod n` + basic results.
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> ... |
6922c707b4d1cdc41a40d350a4a527a2bd12dc02 | d29d82a0af640c937e499f6be79fc552eae0aa13 | /src/group_theory/order_of_element.lean | e3d3ab575c4ec55c8e016645238b9d1643d7f39f | [
"Apache-2.0"
] | permissive | AbdulMajeedkhurasani/mathlib | 835f8a5c5cf3075b250b3737172043ab4fa1edf6 | 79bc7323b164aebd000524ebafd198eb0e17f956 | refs/heads/master | 1,688,003,895,660 | 1,627,788,521,000 | 1,627,788,521,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 38,894 | 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, Julian Kuelshammer
-/
import algebra.pointwise
import group_theory.coset
import dynamics.periodic_pts
import algebra.iterate_hom
/-!
# Order of an element
This file d... |
90de9f5c448ed0d33577c332a66c6040350ab6bd | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/tactic/omega/nat/sub_elim.lean | 5d0569eb711c7594ba5d81e66da82b779307d6c0 | [
"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 | 5,684 | lean | /-
Copyright (c) 2019 Seul Baek. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Seul Baek
-/
/-
Subtraction elimination for linear natural number arithmetic.
Works by repeatedly rewriting goals of the preform `P[t-s]` into
`P[x] β§ (t = s + x β¨ (t β€ s β§ x = 0))`, where... |
b5532a5d9bfc6907bd7544ca7060828a81bb65d2 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/algebra/category/CommRing/adjunctions.lean | d05c6c0c6064513a2612609a8f3fdbd86ae8f07f | [
"Apache-2.0"
] | permissive | jjgarzella/mathlib | 96a345378c4e0bf26cf604aed84f90329e4896a2 | 395d8716c3ad03747059d482090e2bb97db612c8 | refs/heads/master | 1,686,480,124,379 | 1,625,163,323,000 | 1,625,163,323,000 | 281,190,421 | 2 | 0 | Apache-2.0 | 1,595,268,170,000 | 1,595,268,169,000 | null | UTF-8 | Lean | false | false | 1,541 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Johannes HΓΆlzl
-/
import algebra.category.CommRing.basic
import data.mv_polynomial
/-!
Multivariable polynomials on a type is the left adjoint of the
forgetful functor... |
d21d9b915d28ea731872597ecc3b70a68dec3b07 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/order/disjointed.lean | 9b60b8f70bdea892271786aa3b2ec74b475f1dcc | [
"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 | 6,082 | lean | /-
Copyright (c) 2017 Johannes HΓΆlzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes HΓΆlzl, YaΓ«l Dillies
-/
import order.partial_sups
/-!
# Consecutive differences of sets
This file defines the way to make a sequence of elements into a sequence of disjoint e... |
88362a168f5577d6ef7c4e4615a545bf96064cca | 048b0801f6dafb6486ca4f22bd0957671c3002ff | /src/util/io.lean | 5db20f91b9a36b4e2e1d0e7c49c93987f008af70 | [
"Apache-2.0"
] | permissive | Scikud/lean-gym | e0782e36389ecfa1605a0c12dc95f67014a0fa05 | a1ca851b7c09eca1f72be2d059e3ed5536348b0b | refs/heads/main | 1,693,940,033,482 | 1,633,522,864,000 | 1,633,522,864,000 | 419,793,692 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,074 | lean | /-
Copyright (c) 2021 OpenAI. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Stanislas Polu
Helper functions to work with the io monad.
-/
import system.io
import tactic.gptf.utils.util
section io
open interaction_monad interaction_monad.result
namespace io
/-- v... |
e774d240b2a2e52c5c4a87589e1e1f712dab3c61 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /stage0/src/Init/Data/Nat.lean | a2c806b9eabc45fbef346adec6b4f34ea61d3896 | [
"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 | 333 | 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.Nat.Basic
import Init.Data.Nat.Div
import Init.Data.Nat.Gcd
import Init.Data.Nat.Bitwise
import Init.Data.Nat.Control
import Init.D... |
33e5c83eb300007959a204279423a85122f17d08 | 02005f45e00c7ecf2c8ca5db60251bd1e9c860b5 | /src/order/order_iso_nat.lean | 1c13726b3b700472fb89ab949a32ba8c38d55166 | [
"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 | 6,011 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
-/
import data.nat.basic
import data.equiv.denumerable
import data.set.finite
import order.rel_iso
import logic.function.iterate
namespace rel_embedding
variables {Ξ± : ... |
5b2f865da4afb87ab346d9bc097180477bc9b8dd | d8820d2c92be8052d13f9c8f8c483a6e15c5f566 | /src/M40002/M40002_C4.lean | d4603ec3ba1acb08236564597019d65f7e04749c | [] | no_license | JasonKYi/M4000x_LEAN_formalisation | 4a19b84f6d0fe2e214485b8532e21cd34996c4b1 | 6e99793f2fcbe88596e27644f430e46aa2a464df | refs/heads/master | 1,599,755,414,708 | 1,589,494,604,000 | 1,589,494,604,000 | 221,759,483 | 8 | 1 | null | 1,589,494,605,000 | 1,573,755,201,000 | Lean | UTF-8 | Lean | false | false | 12,923 | lean | -- M40002 (Analysis I) Chapter 4. Series
import M40002.M40002_C3
namespace M40002
-- Definition of convergent sums
def partial_sum_to (a : β β β) (n : β) := finset.sum (finset.range n) a
notation `β` a := partial_sum_to a
def sum_converges_to (a : β β β) (l : β) := (partial_sum_to a) β l
notation a ` ββ ` l := sum_... |
de618cabb3ee0aa2f8eaffc42822f9532103aea3 | 648d81761ea888cc089e98077fce63a63e28e11f | /LeanErrorLocation.lean | dd69a96e832d98a844f8d0d9de40fe508ae1c830 | [
"MIT"
] | permissive | zygi/lean-error-location | a578d5bc3f0b4d63037035ffe7041a7f949512f9 | 6a5a169b8fc80b2d5a30dded3adfa2ff684ecd92 | refs/heads/master | 1,679,507,973,901 | 1,616,213,777,000 | 1,616,213,777,000 | 349,624,081 | 0 | 0 | null | 1,616,213,778,000 | 1,616,213,576,000 | Lean | UTF-8 | Lean | false | false | 2,255 | lean | import Lean.Elab.Term
import AssertCmd
namespace LeanErrorLocation
open Lean
open Lean.Elab.Term
-- This library exports two macros:
-- 1) `__lineNum__` : gets replaced with an instance of the CodeLocation structure below.
-- 2) `withCL[...]` : expects an argument `(f: CodeLocation -> Ξ±)` and replaces it with `(f __l... |
c9776cc1972db69a64da12e793ae32b0563ff523 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/polynomial/cardinal.lean | a398efb2fb04b20840d98eeaf255fcf55cba812b | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 1,068 | lean | /-
Copyright (c) 2021 Chris Hughes, Junyan Xu. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Junyan Xu
-/
import data.polynomial.basic
import set_theory.cardinal.ordinal
/-!
# Cardinality of Polynomial Ring
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> A... |
03c72dba755147372da8697d8de7c01842717bff | 94e33a31faa76775069b071adea97e86e218a8ee | /src/topology/vector_bundle/prod.lean | b0f43c8ed41d78860b717cd4845eafdf0e051a93 | [
"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 | 11,463 | lean | /-
Copyright Β© 2022 Heather Macbeth. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Heather Macbeth, Floris van Doorn
-/
import topology.vector_bundle.basic
/-!
# Direct sum of two vector bundles
If `Eβ : B β Type*` and `Eβ : B β Type*` define two topological vector... |
d02159d0490d1aa2909537ac15da7001b4cf7ee6 | 22e97a5d648fc451e25a06c668dc03ac7ed7bc25 | /src/category_theory/connected.lean | 11d8ba3cb8447f19cf2e8593b86f1075e8e64ec1 | [
"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 | 8,800 | 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.const
import category_theory.discrete_category
import category_theory.eq_to_hom
/-!
# Connected category
Define a connected category as a _nonemp... |
9b7b02533f8d971b8cfc79524e3586583bff8985 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/funext_issue.lean | e2631918764aea4a271f57cf182829b7fd37c4a5 | [
"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 | 119 | lean | universes u
example (Ξ± : Type u) (p : Prop) (a b : Ξ±) (h : p β a = b) : (Ξ» x : p, a) = (Ξ» x : p, b) :=
funext h
|
419ac69f0b09e903eaa33d1bd0bb86ec3005837a | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /src/builtin/dia.lean | 5d22841ed15f6b24f3c43e9b69995eda043cc561 | [
"Apache-2.0"
] | permissive | codyroux/lean0.1 | 1ce92751d664aacff0529e139083304a7bbc8a71 | 0dc6fb974aa85ed6f305a2f4b10a53a44ee5f0ef | refs/heads/master | 1,610,830,535,062 | 1,402,150,480,000 | 1,402,150,480,000 | 19,588,851 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,127 | lean | import macros
theorem bool_inhab : inhabited Bool
:= inhabited_intro true
-- Excluded middle from eps_ax, boolext, funext, and subst
theorem em_new (p : Bool) : p β¨ Β¬ p
:= let u := @eps Bool bool_inhab (Ξ» x, x = true β¨ p),
v := @eps Bool bool_inhab (Ξ» x, x = false β¨ p) in
have Hu : u = true β¨ p,
from @... |
7bb0d4f92e135929b06d1eb1906c920108a97e01 | caa1512363b76923d0e9cdb716122a5c26c3c6bc | /src/eigenvectors/algebraically_closed.lean | 55ee7eae6adb3d80b816f002454859c91712786e | [] | no_license | apurvanakade/cvx | deb20e425ce478159a98e1ffc0d37f9c88a89280 | b47784831339df5a3e45f5cddd84edc545f95808 | refs/heads/master | 1,687,403,288,536 | 1,555,930,740,000 | 1,555,930,740,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,337 | lean |
import analysis.complex.polynomial
import ring_theory.principal_ideal_domain
import linear_algebra.dimension
open polynomial
open vector_space cardinal principal_ideal_domain submodule
-- TODO: move
lemma polynomial.not_is_unit_X_sub_C {Ξ± : Type} [integral_domain Ξ±] [decidable_eq Ξ±]: β a : Ξ±, Β¬ is_unit (X - C a) :=... |
e51399b0a60ef5f8a07388447d3063754db384b7 | 50b3917f95cf9fe84639812ea0461b38f8f0dbe1 | /blog/video.lean | 3a1d6b7b24f2bd928e8dd51438248bf1c3e64599 | [] | no_license | roro47/xena | 6389bcd7dcf395656a2c85cfc90a4366e9b825bb | 237910190de38d6ff43694ffe3a9b68f79363e6c | refs/heads/master | 1,598,570,061,948 | 1,570,052,567,000 | 1,570,052,567,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 200 | lean | #exit
Type
β β β€
group G
ring R
modular_form f
...
Ο : β
β : Type
β = {0, 1, 2, 3, ...}
β s : β, ΞΆ(s) = 0 β s β β€ β¨ Re(s) = 1/2
|
3207f869a9e023c0e2e879618bd595718448a2be | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/analysis/normed/group/pointwise.lean | 8cb7806fbb3daed2a385c9fe16423006cf204f0c | [
"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 | 7,811 | lean | /-
Copyright (c) 2021 SΓ©bastien GouΓ«zel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: SΓ©bastien GouΓ«zel, YaΓ«l Dillies
-/
import analysis.normed.group.basic
import topology.metric_space.hausdorff_distance
/-!
# Properties of pointwise addition of sets in normed group... |
4ecf7a319ed53c7281f3d8893d35d2da37c68fbf | 4bcaca5dc83d49803f72b7b5920b75b6e7d9de2d | /src/Lean/Widget/InteractiveCode.lean | 92112ca9bcf3590001f6de593e1e9738d03634a9 | [
"Apache-2.0"
] | permissive | subfish-zhou/leanprover-zh_CN.github.io | 30b9fba9bd790720bd95764e61ae796697d2f603 | 8b2985d4a3d458ceda9361ac454c28168d920d3f | refs/heads/master | 1,689,709,967,820 | 1,632,503,056,000 | 1,632,503,056,000 | 409,962,097 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,939 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Wojciech Nawrocki
-/
import Lean.PrettyPrinter
import Lean.Server.Rpc.Basic
import Lean.Widget.TaggedText
/-! RPC infrastructure for storing and formatting code fragments, in ... |
37f4cf865fa49f0f9a3d9c7200f7b09839aa225e | 969dbdfed67fda40a6f5a2b4f8c4a3c7dc01e0fb | /src/algebra/group_power/lemmas.lean | 41c7d40f74f870c0fa613acf5a7a974060dc89c3 | [
"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 | 32,639 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Robert Y. Lewis
-/
import algebra.group_power.basic
import algebra.invertible
import algebra.opposites
import data.list.basic
import data.int.cast
import data.equiv.basic... |
addf2527dca53b4362a17c8a22ba97f60fe5d38d | c31182a012eec69da0a1f6c05f42b0f0717d212d | /src/combinatorial_lemma/lem97.lean | 4992df83fcf79e7f8a3293377c81bd8bd978132b | [] | no_license | Ja1941/lean-liquid | fbec3ffc7fc67df1b5ca95b7ee225685ab9ffbdc | 8e80ed0cbdf5145d6814e833a674eaf05a1495c1 | refs/heads/master | 1,689,437,983,362 | 1,628,362,719,000 | 1,628,362,719,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 13,985 | lean | import algebra.group.basic
import analysis.convex.cone
import linear_algebra.dual
import algebra.ordered_ring
import ring_theory.finiteness
import linear_algebra.free_module
import for_mathlib.Gordan
/-!
# Lemma 9.7 of [Analytic]
In this file we state and prove 9.7 of [Analytic]. The proof in the pdf is short, but
... |
8c613dbdfbe763108df51f7a85fa5b7a1dd878e8 | fe84e287c662151bb313504482b218a503b972f3 | /src/group_theory/self_map.lean | 5298680e1804dce1d9394eb7f8376d4ffadbc189 | [] | no_license | NeilStrickland/lean_lib | 91e163f514b829c42fe75636407138b5c75cba83 | 6a9563de93748ace509d9db4302db6cd77d8f92c | refs/heads/master | 1,653,408,198,261 | 1,652,996,419,000 | 1,652,996,419,000 | 181,006,067 | 4 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 1,968 | lean | /-
Copyright (c) 2019 Neil Strickland. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Neil Strickland
We define the monoid of self-maps of a type, and show that
monoid homomorphisms `M β (self_map X)` give actions of `M` on `X`.
-/
import algebra.group group_theory.g... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.