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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
29c7d291ae87f3247942bc0f48fb57ed725dba0f | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /src/topology/metric_space/basic.lean | 0a7ca69bf35cb3f3822d0d7921e0e6e9016a887c | [
"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 | 76,119 | 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... |
63a249e2090a4af79651c250583ae2f16b8eee40 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/measure_theory/function/lp_order.lean | 88775c495f921cffa7a285d3f481edf2fad947fd | [
"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,451 | lean | /-
Copyright (c) 2021 Rémy Degenne. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Rémy Degenne
-/
import analysis.normed.order.lattice
import measure_theory.function.lp_space
/-!
# Order related properties of Lp spaces
### Results
- `Lp E p μ` is an `ordered_add_co... |
22c5801602e9f80f97b7044a416366f335870e5a | 5ae26df177f810c5006841e9c73dc56e01b978d7 | /src/algebra/Mon/default.lean | be78f3d415a83b08490e0cd9e918d93d1aa3382d | [
"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 | 208 | 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 algebra.Mon.basic
import algebra.Mon.colimits
|
451c25b8d22df7b3521412099222a04410f38861 | 7cdf3413c097e5d36492d12cdd07030eb991d394 | /src/game/world4/level6.lean | 8a129479c8be4312ac7e3b2ce0b107174f01ce4e | [] | no_license | alreadydone/natural_number_game | 3135b9385a9f43e74cfbf79513fc37e69b99e0b3 | 1a39e693df4f4e871eb449890d3c7715a25c2ec9 | refs/heads/master | 1,599,387,390,105 | 1,573,200,587,000 | 1,573,200,691,000 | 220,397,084 | 0 | 0 | null | 1,573,192,734,000 | 1,573,192,733,000 | null | UTF-8 | Lean | false | false | 497 | lean | import game.world4.level5 -- hide
namespace mynat -- hide
/-
# World 4 : Power World
## Level 6: `mul_pow`
You might find the tip at the end of 3-9 useful in this one.
-/
/- Lemma
For all naturals $a$, $b$, $n$, we have $(ab) ^ n = a ^ nb ^ n$.
-/
lemma mul_pow (a b n : mynat) : (a * b) ^ n = a ^ n * b ^ n :=
be... |
07a79186a9af3f7a6537d11c03ca610f8887652a | a5e2e6395319779f21675263bc0e486be5bc03bd | /bench/stlc.lean | f88269dcd5923da3776bada8e822d95877cb3516 | [
"MIT"
] | permissive | AndrasKovacs/smalltt | 10f0ec55fb3f487e9dd21a740fe1a899e0cdb790 | c306f727ba3c92abe6ef75013da5a5dade6b15c8 | refs/heads/master | 1,689,497,785,394 | 1,680,893,106,000 | 1,680,893,106,000 | 112,098,494 | 483 | 26 | MIT | 1,640,720,815,000 | 1,511,713,805,000 | Lean | UTF-8 | Lean | false | false | 6,310 | lean |
-- Church-coded STLC
--------------------------------------------------------------------------------
def Ty : Type 1
:= ∀ (Ty : Type)
(nat top bot : Ty)
(arr prod sum : Ty → Ty → Ty)
, Ty
def nat : Ty := λ _ nat _ _ _ _ _ => nat
def top : Ty := λ _ _ top _ _ _ _ => top
def bot : Ty := λ ... |
0b1ccaf88b814210a238707e0fbba310514bd82b | 92b50235facfbc08dfe7f334827d47281471333b | /tests/lean/run/fibrant_class2.lean | b84da99e4f94bb64f25a69bbdb4a51a8d03b4e2c | [
"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 | 1,145 | lean | inductive fibrant [class] (T : Type) : Type :=
fibrant_mk : fibrant T
axiom pi_fibrant {A : Type} {B : A → Type} [C1 : fibrant A] [C2 : Πx : A, fibrant (B x)] :
fibrant (Πx : A, B x)
attribute pi_fibrant [instance]
inductive path {A : Type} [fA : fibrant A] (a : A) : A → Type :=
idpath : path a a
axiom path_fibran... |
5b44640ab30b02327bd4b8fcd7ed7d4b215ffc0f | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/algebraic_geometry/locally_ringed_space.lean | bd21fd6c32dbac72e197e8153a1a4256b27dd6ed | [
"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 | 7,555 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import algebraic_geometry.sheafed_space
import algebra.category.CommRing.limits
import algebra.category.CommRing.colimits
import algebraic_geometry.stalks
import dat... |
059effff35cd0ab2de30782f1a7732836d27ddcb | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/run/lift.lean | 97e0c11eec99ca17c1067e601a5217ad5267625e | [
"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 | 451 | lean | open nat
namespace test
inductive {u} lift (A : Type u) : Type (u+1)
| up : A → lift
namespace lift
definition down {A : Type} (a : lift A) : A :=
lift.rec (λ a, a) a
theorem down_up {A : Type} (a : A) : down (up a) = a :=
rfl
theorem up_down {A : Type} (a' : lift A) : up (down a') = a' :=
lift.induction_on a' (λ ... |
d0f86be41b60b3bb4dcd57111607b1766121423b | 36c7a18fd72e5b57229bd8ba36493daf536a19ce | /library/data/nat/div.lean | b7d58b627ebf1adb16705a0bd8403ef20ad2ec81 | [
"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 | 26,206 | 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
Definitions and properties of div and mod. Much of the development follows Isabelle's library.
-/
import data.nat.sub
open eq.ops well_founded decidabl... |
4102703c775b390eee54f10b04ebcce8d3b98f71 | 46125763b4dbf50619e8846a1371029346f4c3db | /src/ring_theory/noetherian.lean | cb6b033f18584e5bcbdaf00f97562d9140d6279f | [
"Apache-2.0"
] | permissive | thjread/mathlib | a9d97612cedc2c3101060737233df15abcdb9eb1 | 7cffe2520a5518bba19227a107078d83fa725ddc | refs/heads/master | 1,615,637,696,376 | 1,583,953,063,000 | 1,583,953,063,000 | 246,680,271 | 0 | 0 | Apache-2.0 | 1,583,960,875,000 | 1,583,960,875,000 | null | UTF-8 | Lean | false | false | 21,675 | lean | /-
Copyright (c) 2018 Mario Carneiro and Kevin Buzzard. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Kevin Buzzard
-/
import data.equiv.algebra
import linear_algebra.finsupp
import ring_theory.ideal_operations
import ring_theory.subring
import linear... |
bf51006ce15ed8e42a28877175dc08e466220a08 | 5fbbd711f9bfc21ee168f46a4be146603ece8835 | /lean/natural_number_game/advanced_proposition/02.lean | 45386007f6e58398ad6e4b0aca6acf513a56a749 | [
"LicenseRef-scancode-warranty-disclaimer"
] | no_license | goedel-gang/maths | 22596f71e3fde9c088e59931f128a3b5efb73a2c | a20a6f6a8ce800427afd595c598a5ad43da1408d | refs/heads/master | 1,623,055,941,960 | 1,621,599,441,000 | 1,621,599,441,000 | 169,335,840 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 115 | lean | lemma and_symm (P Q : Prop) : P ∧ Q → Q ∧ P :=
begin
intro h,
cases h with p q,
split,
cc,
cc,
end
|
4aa4e95a8979662f2eb3b38ce296d4bff1d66ef6 | 95dcf8dea2baf2b4b0a60d438f27c35ae3dd3990 | /src/category_theory/instances/rings.lean | 2b35d42cec487e4dc503f66cdd3a0ec04517439d | [
"Apache-2.0"
] | permissive | uniformity1/mathlib | 829341bad9dfa6d6be9adaacb8086a8a492e85a4 | dd0e9bd8f2e5ec267f68e72336f6973311909105 | refs/heads/master | 1,588,592,015,670 | 1,554,219,842,000 | 1,554,219,842,000 | 179,110,702 | 0 | 0 | Apache-2.0 | 1,554,220,076,000 | 1,554,220,076,000 | null | UTF-8 | Lean | false | false | 5,207 | lean | /- Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Johannes Hölzl
Introduce CommRing -- the category of commutative rings.
Currently only the basic setup.
-/
import category_theory.instances.monoids
import category_t... |
c46f55f3da4c6ab6828da90bcac65f9bf815cebd | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/topology/uniform_space/completion.lean | a30e657654ffd20840ae24c66869c99b38f0c0d8 | [
"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 | 23,248 | lean | /-
Copyright (c) 2018 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Johannes Hölzl
-/
import topology.uniform_space.abstract_completion
/-!
# Hausdorff completions of uniform spaces
The goal is to construct a left-adjoint to the inclu... |
f19a42d7afed8b263de5a611d7af620f45d99df5 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/linear_algebra/free_module/finite/basic.lean | ac6fd5cb3642dcc6a546c60921de93ebfcc94fa0 | [
"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 | 3,350 | lean | /-
Copyright (c) 2021 Riccardo Brasca. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Riccardo Brasca
-/
import linear_algebra.free_module.basic
import linear_algebra.matrix.to_lin
import ring_theory.finiteness
/-!
# Finite and free modules
We provide some instances... |
317581272b6a746d258c43e59fd36284f2d5c246 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/equiv/ring.lean | d848d5c649c236a339ab536af66370250348df39 | [] | 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 | 16,303 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.equiv.mul_add
import Mathlib.algebra.field
import Math... |
8835b07c1b475b550632c427ea1a5f14b8333edc | 28be2ab6091504b6ba250b367205fb94d50ab284 | /levels/solutions/idea_subtraction.lean | e4ce4fab0ec0db6b050e01c65dd5a8d95841fb99 | [
"Apache-2.0"
] | permissive | postmasters/natural_number_game | 87304ac22e5e1c5ac2382d6e523d6914dd67a92d | 38a7adcdfdb18c49c87b37831736c8f15300d821 | refs/heads/master | 1,649,856,819,031 | 1,586,444,676,000 | 1,586,444,676,000 | 255,006,061 | 0 | 0 | Apache-2.0 | 1,586,664,599,000 | 1,586,664,598,000 | null | UTF-8 | Lean | false | false | 715 | lean | -- if you're looking for the first level, try "world1_addition.lean"
/- to be written
(feel free to write it, anyone!)
The natural numbers has this hideous "computer science natural number `subtraction`" which is far less well behaved than integer subtraction -- they define it so that `2 - 7 = 0` and more generally... |
877ceac84a78467f3d6c1349d6038676988b149f | 491068d2ad28831e7dade8d6dff871c3e49d9431 | /tests/lean/run/tree2.lean | 2d641efb0bade352748f982b57120c58f2a1f982 | [
"Apache-2.0"
] | permissive | davidmueller13/lean | 65a3ed141b4088cd0a268e4de80eb6778b21a0e9 | c626e2e3c6f3771e07c32e82ee5b9e030de5b050 | refs/heads/master | 1,611,278,313,401 | 1,444,021,177,000 | 1,444,021,177,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,080 | lean | import logic data.prod
open eq.ops prod tactic
inductive tree (A : Type) :=
| leaf : A → tree A
| node : tree A → tree A → tree A
inductive one.{l} : Type.{max 1 l} :=
star : one
set_option pp.universes true
namespace tree
namespace manual
section
universe variables l₁ l₂
variable {A : Type.{l₁}}
va... |
b84820c4639dbbff1d83ba0b7e0ffa9dd6acfcea | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/data/holor.lean | b3e102a96ed62379a01b91d93e8a8017717558e8 | [
"Apache-2.0"
] | permissive | rmitta/mathlib | 8d90aee30b4db2b013e01f62c33f297d7e64a43d | 883d974b608845bad30ae19e27e33c285200bf84 | refs/heads/master | 1,585,776,832,544 | 1,576,874,096,000 | 1,576,874,096,000 | 153,663,165 | 0 | 2 | Apache-2.0 | 1,544,806,490,000 | 1,539,884,365,000 | Lean | UTF-8 | Lean | false | false | 14,345 | lean | /-
Copyright (c) 2018 Alexander Bentkamp. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Alexander Bentkamp
-/
import algebra.pi_instances
/-!
# Basic properties of holors
Holors are indexed collections of tensor coefficients. Confusingly,
they are often called tenso... |
d0b899fe50de716282452f30d046dbf972857634 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/ring_theory/ideal/prod.lean | 35c80b432c4d5d22f9055093553975d53ad9d4ec | [
"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 | 7,704 | lean | /-
Copyright (c) 2020 Markus Himmel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel
-/
import ring_theory.ideal.operations
/-!
# Ideals in product rings
For commutative rings `R` and `S` and ideals `I ≤ R`, `J ≤ S`, we define `ideal.prod I J` as the
pro... |
44ea53a51873f6110e28dbe57d73e1e92fb2a99b | 37a833c924892ee3ecb911484775a6d6ebb8984d | /src/category_theory/concrete.lean | 0a3ab0453b6b3eee77a092880023107a1248cea8 | [] | no_license | silky/lean-category-theory | 28126e80564a1f99e9c322d86b3f7d750da0afa1 | 0f029a2364975f56ac727d31d867a18c95c22fd8 | refs/heads/master | 1,589,555,811,646 | 1,554,673,665,000 | 1,554,673,665,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 493 | lean | -- Copyright (c) 2018 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Scott Morrison
import category_theory.equivalence
import category_theory.types
namespace category_theory
universes u v
class concrete (C : Type u) [category.{u v} C] :=
(f... |
46dbb32c5f330abb705a763d28f05efc273fe160 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/data/rbtree/main.lean | f8a148a4a12f165b3074208b5be7b252fba4880a | [
"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,373 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import data.rbtree.find
import data.rbtree.insert
import data.rbtree.min_max
import order.rel_classes
universes u
namespace rbnode
variables {α : Type u} ... |
9bd02acd4878dcd52eed210dfb74212007bf4d24 | 097294e9b80f0d9893ac160b9c7219aa135b51b9 | /instructor/types/annotation_styles.lean | 978fa72983e672db962c24864c8179a3cb9a126f | [] | no_license | AbigailCastro17/CS2102-Discrete-Math | cf296251be9418ce90206f5e66bde9163e21abf9 | d741e4d2d6a9b2e0c8380e51706218b8f608cee4 | refs/heads/main | 1,682,891,087,358 | 1,621,401,341,000 | 1,621,401,341,000 | 368,749,959 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 447 | lean | def z' : ℕ := (nat.zero : ℕ)
def z'' := (nat.zero : ℕ)
def z''' : ℕ := nat.zero
def z := 0
/-
If you want a rational zero or a real
zero, you'd have to say so explicitly.
Note: to make this code work without
errors requires importing definitions
from mathlib. We won't do this right
now, so you will see red squiggle ... |
d1dfacf20488a1aef03b04ba402e1cf5ad59b38d | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/order/filter/countable_Inter.lean | 29aa9e318bbe16adebe46623dfebd4d98aff31e3 | [
"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 | 8,565 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov
-/
import order.filter.basic
import data.set.countable
/-!
# Filters with countable intersection property
In this file we define `countable_Inter_filter` to be... |
4492a90346892008c66cd0357cd5e50579cd7c7b | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/group_theory/free_abelian_group.lean | cdce658dbf39877496acb32d5044a883232254bc | [
"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 | 19,408 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import algebra.group.pi
import group_theory.free_group
import group_theory.abelianization
import algebra.module.basic
/-!
# Free abelian groups
The free abelian group on a t... |
c63ab9c440eeb3de7f23af10fedab1e02fdc158f | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/fin_enum_auto.lean | 1019c9265f50480ea3f4f6d1dc0ec8124f3536a4 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,888 | lean | /-
Copyright (c) 2019 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Simon Hudon
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.control.monad.basic
import Mathlib.data.fintype.basic
import Mathlib.PostPort
universes u_1 l ... |
476a5c3decff168a0a90959bbeb8678e97be562a | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/algebra/big_operators/ring.lean | c763dd2de327802558e7e2a16d1809d0325a23db | [
"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 | 7,044 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
-/
import algebra.big_operators.basic
import data.finset.pi
import data.finset.powerset
/-!
# Results about big operators with values in a (semi)ring
We prove results... |
39b56b0b6c15455e28e26c14af0e60780b069ed3 | ce89339993655da64b6ccb555c837ce6c10f9ef4 | /ukikagi/top61.lean | 77c6802fe0d68fff46fe084c8c2fbe5f0015006a | [] | no_license | zeptometer/LearnLean | ef32dc36a22119f18d843f548d0bb42f907bff5d | bb84d5dbe521127ba134d4dbf9559b294a80b9f7 | refs/heads/master | 1,625,710,824,322 | 1,601,382,570,000 | 1,601,382,570,000 | 195,228,870 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 194 | lean | example: ∀ (x y: option nat) (n: nat),
x = some n -> x = y \/ x = none -> x = y
:=
begin
intros x y n h1 h2,
cases h2 with h21 h22,
exact h21,
rw [h22] at h1,
injection h1
end
|
60877735e3943e57e749f62073a90c7837135a29 | 46125763b4dbf50619e8846a1371029346f4c3db | /src/field_theory/mv_polynomial.lean | 5fc5b0c1d60d80d20914d68f4c53aebe8c1e85ca | [
"Apache-2.0"
] | permissive | thjread/mathlib | a9d97612cedc2c3101060737233df15abcdb9eb1 | 7cffe2520a5518bba19227a107078d83fa725ddc | refs/heads/master | 1,615,637,696,376 | 1,583,953,063,000 | 1,583,953,063,000 | 246,680,271 | 0 | 0 | Apache-2.0 | 1,583,960,875,000 | 1,583,960,875,000 | null | UTF-8 | Lean | false | false | 9,337 | lean | /-
Copyright (c) 2019 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Johannes Hölzl
Multivariate functions of the form `α^n → α` are isomorphic to multivariate polynomials in
`n` variables.
-/
import linear_algebra.finsupp_vector_space field_theory.fini... |
75d2f40f81c99407d6065bf038f9181c927b8c42 | c31182a012eec69da0a1f6c05f42b0f0717d212d | /src/locally_constant/SemiNormedGroup.lean | 8782333ec11c9177c19cb87b8f86e4df739f2407 | [] | 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 | 2,511 | lean | import topology.category.Profinite
import category_theory.filtered
import locally_constant.analysis
import for_mathlib.SemiNormedGroup
/-!
# The functor of locally constant maps
The functor sending a seminormed group `V` and a profinite type `S` to the seminormed group
of locally constant maps from `S` to `V` (with... |
ec9cdefa3863c012dea7a45d7393568c890d1ade | c09f5945267fd905e23a77be83d9a78580e04a4a | /src/topology/order.lean | 0ad00811f0397d905a88cbe5102b979a6a2a942a | [
"Apache-2.0"
] | permissive | OHIHIYA20/mathlib | 023a6df35355b5b6eb931c404f7dd7535dccfa89 | 1ec0a1f49db97d45e8666a3bf33217ff79ca1d87 | refs/heads/master | 1,587,964,529,965 | 1,551,819,319,000 | 1,551,819,319,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 32,234 | 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
Order on topological structures. Lattice structure, Galois connection, and applications.
-/
import topology.basic
open set filter lattice classical
loc... |
629f34ef087d3ec0a59209efd9a12cd0ec4e90fc | 5d166a16ae129621cb54ca9dde86c275d7d2b483 | /library/init/algebra/field.lean | a5e2a4b848876e904e46652ac7d8b7c339e102cf | [
"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 | 18,300 | lean | /-
Copyright (c) 2014 Robert Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Lewis, Leonardo de Moura
Structures with multiplicative and additive components, including division rings and fields.
The development is modeled after Isabelle's library.
-/
prel... |
cfe1428ad82ea35732c7cfe07edd7fde2241e87f | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/set/intervals/default.lean | e12ebb309fd3553c79d06259fa4b73aeaaa3f478 | [] | 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 | 200 | lean | import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.set.intervals.disjoint
import Mathlib.data.set.intervals.unordered_interval
import Mathlib.PostPort
namespace Mathlib
|
30a89bf62d8a9be739272c172316c85c8a5440e1 | 159fed64bfae88f3b6a6166836d6278f953bcbf9 | /Structure/SortStructure.lean | a210856891cb5e649c3df2a4202edf96f0f8320e | [
"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 | 8,572 | lean | -- An abstract formalization of "isomorphism is equality up to relabeling"
-- -------------------------------------------------------------------------
--
-- See `README.md` for more info.
--
-- This file extends `Basic.lean` with definitions that are related to `Equiv` from mathlib.
import Structure.Basic
import S... |
e4529fc4498f3521be698cea0f5fb8dee1ec1471 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/algebra/euclidean_domain/basic.lean | fde4f36389841b023afe5c11d0dba32cc58c8d58 | [
"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 | 10,053 | lean | /-
Copyright (c) 2018 Louis Carlin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Louis Carlin, Mario Carneiro
-/
import algebra.euclidean_domain.defs
import algebra.ring.divisibility
import algebra.ring.regular
import algebra.group_with_zero.divisibility
import algeb... |
033e63616cbd6c6ec8747f4a21668a0d037b671c | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/number_theory/padics/padic_norm.lean | 461e20a1bf44404e167264a6eeff7deb7f3c6130 | [
"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 | 27,984 | 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 ring_theory.int.basic
import algebra.field_power
import ring_theory.multiplicity
import data.real.cau_seq
import tactic.ring_exp
import tactic.basic
/-!
# p... |
73ef1099920f78c8adec23f491c565f61649d88d | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/elab1.lean | 83d6b9ef52040d9128ea620c5ba0a7309706109a | [
"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 | 375 | lean | definition foo.subst := @eq.subst
definition boo.subst := @eq.subst
definition foo.add := @add
definition boo.add := @add
set_option pp.all true
open foo boo
print raw subst -- subst is overloaded
print raw add -- add is overloaded
check @subst
check @@subst
open eq
check subst
constants a b : nat
constant H1... |
8afeb796663b2be1b387fcc2f7a98c0793f97d36 | 76df16d6c3760cb415f1294caee997cc4736e09b | /lean/src/test_sorry.lean | 7eaa9983766ec812342dc729da5d366807a1b457 | [
"MIT"
] | permissive | uw-unsat/leanette-popl22-artifact | 70409d9cbd8921d794d27b7992bf1d9a4087e9fe | 80fea2519e61b45a283fbf7903acdf6d5528dbe7 | refs/heads/master | 1,681,592,449,670 | 1,637,037,431,000 | 1,637,037,431,000 | 414,331,908 | 6 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 31 | lean | def test_sorry : unit := sorry
|
c42df62d85423ab0001010bb12944e709d98d756 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/algebra/order/interval.lean | 77cdf30d29b8e80f6365b58c95f497c49a7e0dfd | [
"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 | 15,169 | lean | /-
Copyright (c) 2022 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies
-/
import algebra.big_operators.order
import algebra.group.prod
import data.option.n_ary
import data.set.pointwise.basic
import order.interval
import tactic.positivity
/-!
... |
c1cc4d897e1abca1f7b8450695336f43c62dd152 | 86f6f4f8d827a196a32bfc646234b73328aeb306 | /examples/logic/unnamed_1377.lean | a947da0e4b098e6926b092f87be6b565e067cec6 | [] | no_license | jamescheuk91/mathematics_in_lean | 09f1f87d2b0dce53464ff0cbe592c568ff59cf5e | 4452499264e2975bca2f42565c0925506ba5dda3 | refs/heads/master | 1,679,716,410,967 | 1,613,957,947,000 | 1,613,957,947,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 278 | lean | import data.real.basic
def fn_ub (f : ℝ → ℝ) (a : ℝ) : Prop := ∀ x, f x ≤ a
def fn_has_ub (f : ℝ → ℝ) := ∃ a, fn_ub f a
open_locale classical
variable (f : ℝ → ℝ)
-- BEGIN
example (h : ¬ monotone f) : ∃ x y, x ≤ y ∧ f y < f x :=
sorry
-- END |
6744c2a47809ca525c9ee84277d477090d27d2cd | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/category/equiv_functor/instances.lean | d4486585094626455d58a0b285716fb079f6413b | [
"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 | 557 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Scott Morrison
-/
import category.equiv_functor
import tactic.equiv_rw
/-!
# `equiv_functor` instances
We derive some `equiv_functor` instances, to enable `equiv_rw` to rewrite under ... |
6ef61b5de88ecc40a4cd1895670579deb05cdee3 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/668.lean | e121876af10836a21fd75f1a7dc492b2ee3e2681 | [
"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 | 373 | lean | set_option pp.coercions true
namespace Nat
constant Nat : Type₁
constant num2Nat : num → Nat
attribute num2Nat [coercion]
definition foo : Nat := (0:num)
end Nat
constant Int : Type₁
namespace Int
open Nat
constant Nat2Int : Nat → Int
attribute Nat2Int [coercion]
definition foo : Int := (0:num)
end I... |
aef8a0ba580d3ebab97a803b18c3e21197cfb5bf | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/algebra/algebra/subalgebra/basic.lean | 620ae80cf9b58307dd5e4251ce53899ede901adc | [
"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 | 46,381 | 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.basic
import data.set.Union_lift
import linear_algebra.finsupp
import ring_theory.ideal.operations
/-!
# Subalgebras over Commutative S... |
504855d22581026f99934659cf26c1fb991c1e3a | 9ee042bf34eebe0464f0f80c0db14ceb048dab10 | /stage0/src/Lean/Elab/PreDefinition/WF/TerminationBy.lean | 9b703f169ae349ea6c8dc9601ef84344015977c6 | [
"Apache-2.0"
] | permissive | dexmagic/lean4 | 7507e7b07dc9f49db45df5ebd011886367dc2a6c | 48764b60d5bac337eaff4bf8a3d63a216e1d9e03 | refs/heads/master | 1,692,156,265,016 | 1,633,276,980,000 | 1,633,339,480,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,653 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Parser.Command
namespace Lean.Elab.WF
inductive TerminationBy where
| none
| one (stx : Syntax)
| many (map : NameMap Syntax)
def expan... |
a214dee27476c65c6a25c82d5276de663bd1ec01 | 618003631150032a5676f229d13a079ac875ff77 | /src/data/set/intervals/disjoint.lean | afb6ac96bb82eab13e5dddc2ce208c92158921b5 | [
"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,353 | 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, Yury Kudryashov
-/
import data.set.lattice
/-!
# Extra lemmas about intervals
This file contains lemmas about intervals that cannot be included into `data.set.int... |
b1cf33e29a17669f353599556ed51a897c5209fd | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/tactic/converter/apply_congr.lean | af385c2c92d3552f66046102b28527b3c4ef673f | [
"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 | 3,346 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Lucas Allen, Scott Morrison
-/
import tactic.interactive
import tactic.converter.interactive
/-!
## Introduce the `apply_congr` conv mode tactic.
`apply_congr` will apply congruence... |
e1ceda8af7afded388ec51ca838257d35b490c62 | c213e436cb87414954d055137f2a847a9674d7d2 | /src/measure_theory/bochner_integration.lean | cab8809e69351117d1013c02435cec7d9348d4b3 | [
"Apache-2.0"
] | permissive | dsanjen/mathlib | 642d270c3d209cfdfb097c2ddc9dd36c102fae9f | a3844c85c606acca5922408217d55891b760fad6 | refs/heads/master | 1,606,199,308,451 | 1,576,274,676,000 | 1,576,274,676,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 54,239 | lean | /-
Copyright (c) 2019 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou
-/
import measure_theory.simple_func_dense
import analysis.normed_space.bounded_linear_maps
/-!
# Bochner integral
The Bochner integral extends the definition of the Le... |
2a50fd57c51768f0594f0219370791f955186640 | 947b78d97130d56365ae2ec264df196ce769371a | /src/Lean/Elab/DefView.lean | 3c40b4ed28e64eea733a0e705db963c9056ab80a | [
"Apache-2.0"
] | permissive | shyamalschandra/lean4 | 27044812be8698f0c79147615b1d5090b9f4b037 | 6e7a883b21eaf62831e8111b251dc9b18f40e604 | refs/heads/master | 1,671,417,126,371 | 1,601,859,995,000 | 1,601,860,020,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,330 | 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
-/
import Std.ShareCommon
import Lean.Util.CollectLevelParams
import Lean.Util.FoldConsts
import Lean.Elab.CollectFVars
import Lean.Elab.Com... |
39f0744bd9c214cdf78218597332236b54eccc2e | 4fa161becb8ce7378a709f5992a594764699e268 | /src/data/zsqrtd/gaussian_int.lean | 06476200a27c6d516ab6a8d4f3e037a1973f63c0 | [
"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 | 12,652 | lean | /-
Copyright (c) 2019 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Chris Hughes
-/
import data.zsqrtd.basic
import data.complex.basic
import ring_theory.principal_ideal_domain
import number_theory.quadratic_reciprocity
/-!
# Gaussian integers
The Gaussi... |
f0a50fc98e4068286633dc784631a34bf8f8e25a | b561a44b48979a98df50ade0789a21c79ee31288 | /src/Lean/Elab/Macro.lean | 708869a65565045280387807ef6de21126b91c8a | [
"Apache-2.0"
] | permissive | 3401ijk/lean4 | 97659c475ebd33a034fed515cb83a85f75ccfb06 | a5b1b8de4f4b038ff752b9e607b721f15a9a4351 | refs/heads/master | 1,693,933,007,651 | 1,636,424,845,000 | 1,636,424,845,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,677 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Elab.MacroArgUtil
namespace Lean.Elab.Command
open Lean.Syntax
open Lean.Parser.Term hiding macroArg
open Lean.Parser.Command
@[builtinMacro L... |
eeedd47db10b849eab149068cae367d9af443b86 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/algebra/monoid_algebra/basic.lean | c045905d7fe03345772d5bcf91fd29d0fb58365b | [
"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 | 64,519 | 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 G. Kudryashov, Scott Morrison
-/
import algebra.big_operators.finsupp
import algebra.hom.non_unital_alg
import linear_algebra.finsupp
/-!
# Monoid algebras
When ... |
0180f330a33623a598034f9d3ed89ffdba89f829 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/group_theory/nilpotent.lean | 03361124d58f0b3390b04f3d479d19235d1ec67c | [
"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 | 16,022 | lean | /-
Copyright (c) 2021 Kevin Buzzard. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Buzzard, Ines Wright
-/
import group_theory.general_commutator
import group_theory.quotient_group
/-!
# Nilpotent groups
An API for nilpotent groups, that is, groups for which... |
d81003272f9656773b3067ea57147be471ed3d0d | 491068d2ad28831e7dade8d6dff871c3e49d9431 | /hott/algebra/category/functor.hlean | 649b69b637af740222f69b795422c4897bcb4c16 | [
"Apache-2.0"
] | permissive | davidmueller13/lean | 65a3ed141b4088cd0a268e4de80eb6778b21a0e9 | c626e2e3c6f3771e07c32e82ee5b9e030de5b050 | refs/heads/master | 1,611,278,313,401 | 1,444,021,177,000 | 1,444,021,177,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,910 | 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, Jakob von Raumer
-/
import .iso types.pi
open function category eq prod prod.ops equiv is_equiv sigma sigma.ops is_trunc funext iso
open pi
structure functor (C ... |
85ef435d6b58ba8046867cf441cf0ede34e8147d | f3849be5d845a1cb97680f0bbbe03b85518312f0 | /library/tools/super/clause.lean | e39ee2970d18033d5d1d1043d05ee43befa715fb | [
"Apache-2.0"
] | permissive | bjoeris/lean | 0ed95125d762b17bfcb54dad1f9721f953f92eeb | 4e496b78d5e73545fa4f9a807155113d8e6b0561 | refs/heads/master | 1,611,251,218,281 | 1,495,337,658,000 | 1,495,337,658,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,641 | lean | /-
Copyright (c) 2016 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner
-/
import init.meta.tactic .utils .trim
open expr list tactic monad decidable
namespace super
meta def is_local_not (local_false : expr) (e : expr) : option expr :=
matc... |
96aa77b57aecf28825e443da34a6c24b7695c87b | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/catchThe.lean | 5e690b971cb65efb079d6020313a9fce44478aec | [
"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 | 850 | lean | import Lean.Meta
open Lean
open Lean.Meta
universe u v w
abbrev M := ExceptT String MetaM
def testM {α} [BEq α] [ToString α] (x : M α) (expected : α) : MetaM Unit := do
let r ← x
match r with
| Except.ok a => unless a == expected do throwError m!"unexpected result {a}"
| Except.error e => throwError m!"... |
41f0ccf801393403825490a12c407449f34d40e6 | 626e312b5c1cb2d88fca108f5933076012633192 | /src/group_theory/group_action/prod.lean | 1c5c5f5f7954c6f6caa3d43391dc575c26bd11cf | [
"Apache-2.0"
] | permissive | Bioye97/mathlib | 9db2f9ee54418d29dd06996279ba9dc874fd6beb | 782a20a27ee83b523f801ff34efb1a9557085019 | refs/heads/master | 1,690,305,956,488 | 1,631,067,774,000 | 1,631,067,774,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,368 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon, Patrick Massot, Eric Wieser
-/
import algebra.group.prod
/-!
# Prod instances for additive and multiplicative actions
This file defines instances for binary product of addi... |
fdcc7fe22d732977d86c129f5c4f743dd30e7c86 | 958488bc7f3c2044206e0358e56d7690b6ae696c | /lean/disjunction.lean | dc88e0d48dda49d7f30531874b228bcb8ac064ca | [] | no_license | possientis/Prog | a08eec1c1b121c2fd6c70a8ae89e2fbef952adb4 | d4b3debc37610a88e0dac3ac5914903604fd1d1f | refs/heads/master | 1,692,263,717,723 | 1,691,757,179,000 | 1,691,757,179,000 | 40,361,602 | 3 | 0 | null | 1,679,896,438,000 | 1,438,953,859,000 | Coq | UTF-8 | Lean | false | false | 821 | lean | lemma L1 : ∀ (p q:Prop), p → p ∨ q :=
λ p q hp, or.intro_left q hp
--#check L1
lemma L2 : ∀ (p q:Prop), q → p ∨ q :=
λ p q hq, or.intro_right p hq
--#check L2
--#check or.elim -- Either a b -> (a -> c) -> (b _> c) -> c
lemma L3 : ∀ (p q:Prop), p ∨ q → q ∨ p :=
λ p q h, or.elim h (or.intro_right q) (or.intro_... |
9be42395e307f761efa3d841b1b7cd0755404972 | 398b53a5e02ce35196531591f84bb2f6b034ce5a | /aata/chapter1.lean | ec937751340bfe218fa4d9c2c28192ed931ac865 | [
"MIT"
] | permissive | crockeo/math-exercises | 64f07a9371a72895bbd97f49a854dcb6821b18ab | cf9150ef9e025f1b7929ba070a783e7a71f24f31 | refs/heads/master | 1,607,910,221,030 | 1,581,231,762,000 | 1,581,231,762,000 | 234,595,189 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,371 | lean | import data.set.basic
import data.nat.basic
import logic.basic
open set
open nat
universe u
-- Exercise 1
-- Exercise 2
-- Exercise 3
-- I know I shouldn't, but I'm skipping these because I want to learn how to
-- prove things I can't just show using a normal programming language.
-- Exercise 4
section
lemm... |
4c81c371bb8d6098a88bc405314adb08154f371d | 88fb7558b0636ec6b181f2a548ac11ad3919f8a5 | /tests/lean/run/dsimplify1.lean | 21a3a4ca69dedbbaa1163a21dd2255986951dd62 | [
"Apache-2.0"
] | permissive | moritayasuaki/lean | 9f666c323cb6fa1f31ac597d777914aed41e3b7a | ae96ebf6ee953088c235ff7ae0e8c95066ba8001 | refs/heads/master | 1,611,135,440,814 | 1,493,852,869,000 | 1,493,852,869,000 | 90,269,903 | 0 | 0 | null | 1,493,906,291,000 | 1,493,906,291,000 | null | UTF-8 | Lean | false | false | 659 | lean | open tactic
example (f : nat → nat → nat) (p : nat → Prop) (a b : nat) : f ((a + 1, b).1) b = f (a+1) (a, b).2 :=
by do
t ← target,
new_t ← dsimplify (λ e, failed) (λ e, do new_e ← whnf e, return (new_e, tt)) t,
expected ← to_expr `(f (nat.succ a) b = f (nat.succ a) b),
guard (new_t = expected),
reflexivity
... |
ebd958ea33643d4cb513e64354051e14b13b03b6 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/ring_theory/fractional_ideal.lean | 676ec477949c026c6977cbeda8847a66e995c999 | [
"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 | 53,536 | lean | /-
Copyright (c) 2020 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen, Filippo A. E. Nuccio
-/
import algebra.big_operators.finprod
import ring_theory.integral_closure
import ring_theory.localization.integer
import ring_theory.localization.submo... |
3a5f0cac49c35fa48f8e9335f3730602623a44ec | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/data/prod.lean | 7418659c3c986f6e73699a02c784b4582ada5b7a | [
"Apache-2.0"
] | permissive | vaibhavkarve/mathlib | a574aaf68c0a431a47fa82ce0637f0f769826bfe | 17f8340912468f49bdc30acdb9a9fa02eeb0473a | refs/heads/master | 1,621,263,802,637 | 1,585,399,588,000 | 1,585,399,588,000 | 250,833,447 | 0 | 0 | Apache-2.0 | 1,585,410,341,000 | 1,585,410,341,000 | null | UTF-8 | Lean | false | false | 3,462 | 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
Extends theory on products
-/
variables {α : Type*} {β : Type*} {γ : Type*} {δ : Type*}
@[simp] theorem prod.forall {p : α × β → Prop} : (∀ x, p x) ↔ (∀ a b, p (a, b)... |
534771fab4f5dfc08327ec8bbc32a89620e8377f | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/padics/padic_norm_auto.lean | 42c038c4e82b2bedc8e5b56b83fc331da9636ced | [] | 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 | 18,255 | 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.ring_theory.int.basic
import Mathlib.algebra.field_power
import Mathlib.ring_theory.multi... |
5a6b34ed79f94dfbfedb88301701e2e96ae9cfd4 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/representation_theory/maschke.lean | cb4e0aa7bf7c4c33136fe60e67cc1a488b8c396b | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 6,346 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import algebra.monoid_algebra.basic
import algebra.char_p.invertible
import algebra.regular.basic
import linear_algebra.basis
/-!
# Maschke's theorem
We prove **Mas... |
5e959e42b5b72b7db640be3dbfcd2e90e86f4984 | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/analysis/convex/basic.lean | 95a8bdc83b75a9552285d5294ee69e1b399fae80 | [
"Apache-2.0"
] | permissive | abentkamp/mathlib | d9a75d291ec09f4637b0f30cc3880ffb07549ee5 | 5360e476391508e092b5a1e5210bd0ed22dc0755 | refs/heads/master | 1,682,382,954,948 | 1,622,106,077,000 | 1,622,106,077,000 | 149,285,665 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 63,691 | lean | /-
Copyright (c) 2019 Alexander Bentkamp. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Alexander Bentkamp, Yury Kudriashov
-/
import data.set.intervals.ord_connected
import data.set.intervals.image_preimage
import data.complex.module
import linear_algebra.affine_spac... |
1d702c973fdfb3d16b12bdf7f100515a1556f1b0 | 3af272061d36e7f3f0521cceaa3a847ed4e03af9 | /src/Sym.lean | 25532d23def3f88d300fd2315e4803e25c6f5378 | [] | no_license | semorrison/kbb | fdab0929d21dca880d835081814225a95f946187 | 229bd06e840bc7a7438b8fee6802a4f8024419e3 | refs/heads/master | 1,585,351,834,355 | 1,539,848,241,000 | 1,539,848,241,000 | 147,323,315 | 2 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 38,568 | lean | -- https://github.com/kckennylau/Lean/blob/master/Sym.lean
import data.fintype data.equiv.basic group_theory.subgroup
namespace list
@[simp] lemma length_attach {α} (L : list α) :
L.attach.length = L.length :=
length_pmap
@[simp] lemma nth_le_attach {α} (L : list α) (i) (H : i < L.attach.length) :
(L... |
b48583b952b9ad5fe59e72fe992ead8904422e8b | a7dd8b83f933e72c40845fd168dde330f050b1c9 | /src/logic/basic.lean | 6be5987ccde43e250869dc3cb552650a12525200 | [
"Apache-2.0"
] | permissive | NeilStrickland/mathlib | 10420e92ee5cb7aba1163c9a01dea2f04652ed67 | 3efbd6f6dff0fb9b0946849b43b39948560a1ffe | refs/heads/master | 1,589,043,046,346 | 1,558,938,706,000 | 1,558,938,706,000 | 181,285,984 | 0 | 0 | Apache-2.0 | 1,568,941,848,000 | 1,555,233,833,000 | Lean | UTF-8 | Lean | false | false | 27,719 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura
Theorems that require decidability hypotheses are in the namespace "decidable".
Classical versions are in the namespace "classical".
Note: in the pres... |
64bc999bc95bd7ba34d3cfcacd036af58756faff | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/linear_algebra/matrix/to_lin.lean | db4430875871b5c8f22329612e3806c2aff342a9 | [
"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 | 28,661 | 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, Patrick Massot, Casper Putz, Anne Baanen
-/
import data.matrix.block
import linear_algebra.matrix.finite_dimensional
import linear_algebra.std_basis
import ring_theory.... |
62218c3aea285fc3c9fbe6209353f7a1f9617fea | d4df7c538bbc0b06771d7b7a6f46fbadebb8c5eb | /src/monad_transformers/state_t.lean | 46fe69ab8c54059a3dd12f203c7281beddab34e4 | [] | no_license | breakerzirconia/LeanTransformers | 11bb924b59ac589d0c6b39586d27cccc8f9e939c | 3c52441b8990bab7d8cf1817df6e04f657a14e1c | refs/heads/main | 1,682,610,526,027 | 1,620,477,129,000 | 1,620,477,129,000 | 365,507,838 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,668 | lean | import monad_transformers.monad_trans
----------------------------
-- Definition + instances --
----------------------------
structure StateT (s : Type) (m : Type → Type) (a : Type) := (run : s → m (a × s))
open StateT
instance {s : Type} {m : Type → Type} [functor m] : functor (StateT s m) := {
map := λ α β f st... |
edaafe96456996dddf9d71e73260df55bbfad74f | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/group_theory/perm/cycle/type.lean | 5dfacba2f3c545540a1b2d06cfe14613e38d339d | [
"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 | 28,179 | lean | /-
Copyright (c) 2020 Thomas Browning. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Thomas Browning
-/
import algebra.gcd_monoid.multiset
import combinatorics.partition
import data.list.rotate
import group_theory.perm.cycle.basic
import ring_theory.int.basic
import ... |
48402b2825a01fc5639170b19c97994ec9528bf9 | ff5230333a701471f46c57e8c115a073ebaaa448 | /tests/lean/1898.lean | 1a329b76a2ebcccd6f116f13a1727953a5886a49 | [
"Apache-2.0"
] | permissive | stanford-cs242/lean | f81721d2b5d00bc175f2e58c57b710d465e6c858 | 7bd861261f4a37326dcf8d7a17f1f1f330e4548c | refs/heads/master | 1,600,957,431,849 | 1,576,465,093,000 | 1,576,465,093,000 | 225,779,423 | 0 | 3 | Apache-2.0 | 1,575,433,936,000 | 1,575,433,935,000 | null | UTF-8 | Lean | false | false | 42 | lean | def X (R : Type) [H : comm_ring R] := H.0
|
ca275b335119868b558c259b73a569656ecf27a8 | dfd42d30132c2867977fefe7edae98b6dc703aeb | /src/experiment.lean | a1ebbf2ec66feef7530038d3d9369b24592545a8 | [] | no_license | justadzr/lean-2021 | 1e42057ac75c794c94b8f148a27a24150c685f68 | dfc6b30de2f27bdba5fbc51183e2b84e73a920d1 | refs/heads/master | 1,689,652,366,522 | 1,630,313,809,000 | 1,630,313,809,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,858 | lean | import analysis.complex.isometry
import analysis.complex.real_deriv
import analysis.calculus.conformal
noncomputable theory
open complex linear_isometry linear_isometry_equiv continuous_linear_map
finite_dimensional linear_map
section A
variables (𝕜 : Type*) [nondiscrete_normed_field 𝕜]
variables {𝕜' : Ty... |
f80b0bf23a4ae058c633d5c43fa570629f66a130 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/category_theory/monad/adjunction.lean | 3aa80891db0b47c377773890b081e6e4589bd865 | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 8,135 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Bhavik Mehta
-/
import category_theory.adjunction.reflective
import category_theory.monad.algebra
namespace category_theory
open category
universes v₁ v₂ u₁ u₂ -- mor... |
475420b6aa9cfd9d6a9f46b3a9b4dc64623fae77 | af6139dd14451ab8f69cf181cf3a20f22bd699be | /library/tools/super/factoring.lean | b16f614fb6dba3ad321d5867161a78c718bc4da1 | [
"Apache-2.0"
] | permissive | gitter-badger/lean-1 | 1cca01252d3113faa45681b6a00e1b5e3a0f6203 | 5c7ade4ee4f1cdf5028eabc5db949479d6737c85 | refs/heads/master | 1,611,425,383,521 | 1,487,871,140,000 | 1,487,871,140,000 | 82,995,612 | 0 | 0 | null | 1,487,905,618,000 | 1,487,905,618,000 | null | UTF-8 | Lean | false | false | 1,653 | lean | /-
Copyright (c) 2016 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner
-/
import .clause .prover_state .subsumption
open tactic expr monad
namespace super
variable gt : expr → expr → bool
meta def inst_lit (c : clause) (i : nat) (e : expr)... |
52c4662b572c053bca19fb1421ffdb4d306e5465 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/category_theory/category/basic.lean | 8c389c5f0c5c92269c1588dc3ef9911188c9d596 | [
"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 | 11,112 | 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, Johannes Hölzl, Reid Barton
-/
import combinatorics.quiver.basic
/-!
# Categories
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> https://github.com/lean... |
1f2e0c09ea9b3ef701ba523f87194a8dc5de99a6 | 367134ba5a65885e863bdc4507601606690974c1 | /src/algebra/group/ulift.lean | 299aaceb8b2e87a023c65f8203f4a26c0bf438f5 | [
"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,464 | 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 data.equiv.mul_add
/-!
# `ulift` instances for groups and monoids
This file defines instances for group, monoid, semigroup and related structures on `ulift` ... |
cf012ec5e052bf39ac7007b64668bc65673ec1a0 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/575c.lean | 379d2f83ec5b12e8b79e5406eb437dda77509fd0 | [
"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 | 314 | lean | def modeq (n a b : ℕ) := a % n = b % n
notation a ` ≡ `:50 b ` [MOD `:50 n `]`:0 := modeq n a b
@[symm] protected theorem modeq.symm {a b n} :
a ≡ b [MOD n] → b ≡ a [MOD n] :=
eq.symm
example (a b m n : ℕ) (h : a ≡ b [MOD m * n]) : a ≡ b [MOD m] :=
begin
success_if_fail { cc },
sorry
end
|
848cc958393b3fd5d056da0b9ab8c0821f587bfd | 92b50235facfbc08dfe7f334827d47281471333b | /library/data/set/classical_inverse.lean | 37f350a46f1577e2f07f19ec5eec934a1d9b4296 | [
"Apache-2.0"
] | permissive | htzh/lean | 24f6ed7510ab637379ec31af406d12584d31792c | d70c79f4e30aafecdfc4a60b5d3512199200ab6e | refs/heads/master | 1,607,677,731,270 | 1,437,089,952,000 | 1,437,089,952,000 | 37,078,816 | 0 | 0 | null | 1,433,780,956,000 | 1,433,780,955,000 | null | UTF-8 | Lean | false | false | 2,754 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad, Andrew Zipperer
Using classical logic, defines an inverse function.
-/
import .function .map
import logic.axioms.classical
open eq.ops
namespace set
variables {X Y : Ty... |
a8deafc1ddeca282c69579ac044b7db859a7bc37 | ea11767c9c6a467c4b7710ec6f371c95cfc023fd | /src/monoidal_categories/util/data/nonempty_list.lean | 943b03f170d6ad963b38096f343882396a4fe2f9 | [] | no_license | RitaAhmadi/lean-monoidal-categories | 68a23f513e902038e44681336b87f659bbc281e0 | 81f43e1e0d623a96695aa8938951d7422d6d7ba6 | refs/heads/master | 1,651,458,686,519 | 1,529,824,613,000 | 1,529,824,613,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,666 | lean | namespace util.data.nonempty_list
universe u
variable {α : Type u}
-- structure nonempty_list (α : Type u) :=
-- (head : α)
-- (tail : list α)
inductive nonempty_list (α : Type u)
| singleton : α → nonempty_list
| cons : α → nonempty_list → nonempty_list
namespace nonempty_list
-- def singleton : α → nonempty_... |
045dca2f40444398abd8761999761227238c08d5 | 406917967313cd8926a5a79666c51fad41d8670f | /lib/Statvfs.lean | cc08aeb1d5d26247353c53fa70e64e01f0c351b4 | [
"MIT"
] | permissive | hargoniX/lean4-statvfs | a3c15f51e2714f9fd5a77725fc618831838b46ae | 458370ad201d2c2820189a474fd8701ff7a940c5 | refs/heads/main | 1,693,550,798,436 | 1,634,894,543,000 | 1,634,894,543,000 | 417,835,011 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,500 | lean | /-
Copyright (c) 2021 Henrik Böving. All rights reserved.
Released under MIT license as described in the file LICENSE.
Authors: Henrik Böving
-/
open System
/--
Initialize the statvfs environment.
This function does the following things:
1. register (`Statvfs`)`g_statvfs_external_class` class
This func... |
d9c9fa4a688c35cb87551960c6bd1d8fff599c28 | 7cdf3413c097e5d36492d12cdd07030eb991d394 | /src/game/world5/level1.lean | 54c406d23e79c76825abd72ed3c73f01621d4f51 | [] | no_license | alreadydone/natural_number_game | 3135b9385a9f43e74cfbf79513fc37e69b99e0b3 | 1a39e693df4f4e871eb449890d3c7715a25c2ec9 | refs/heads/master | 1,599,387,390,105 | 1,573,200,587,000 | 1,573,200,691,000 | 220,397,084 | 0 | 0 | null | 1,573,192,734,000 | 1,573,192,733,000 | null | UTF-8 | Lean | false | false | 4,137 | lean | -- World name : Function world
/-
# Function world.
If you have beaten Addition World, then you have got
quite good at manipulating equalities in Lean using the `rw` tactic.
But there are plenty of levels later on which will require you
to manipulate functions, and `rw` is not the tool for you here.
To manipulate ... |
a4e6664bff6674baf3a429d821eaf7ca4a01b17c | 969dbdfed67fda40a6f5a2b4f8c4a3c7dc01e0fb | /src/topology/instances/ennreal.lean | 6449aaac22134cdf790f8e3558bb81f3122bca5b | [
"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 | 47,890 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Johannes Hölzl
-/
import topology.instances.nnreal
/-!
# Extended non-negative reals
-/
noncomputable theory
open classical set filter metric
open_locale classical topological_space e... |
584c34b1fa1a806c33eeadcf9a4f6ed0182e3852 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/490.lean | 394b72274308b301b48fb735e3da257602873674 | [
"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 | 120 | lean | structure foo.{l} : Type.{l+2} :=
(elim : Type.{l} → Type.{l})
set_option pp.universes true
check foo.elim
check foo
|
a92a39314bd104a9951a96ed880e2b0d633cf1d3 | 947b78d97130d56365ae2ec264df196ce769371a | /tests/compiler/binomial.lean | b8d5d48b5863ce6a3f53a7c6981c0b6172a42c35 | [
"Apache-2.0"
] | permissive | shyamalschandra/lean4 | 27044812be8698f0c79147615b1d5090b9f4b037 | 6e7a883b21eaf62831e8111b251dc9b18f40e604 | refs/heads/master | 1,671,417,126,371 | 1,601,859,995,000 | 1,601,860,020,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 685 | lean | import Std.Data.BinomialHeap
open Std
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 ... |
4046f6ba8f29cb25a14c9bcded82f9428e504130 | 57fdc8de88f5ea3bfde4325e6ecd13f93a274ab5 | /data/set/function.lean | 20440c950cd412f0f4cf6573689a3b049196e006 | [
"Apache-2.0"
] | permissive | louisanu/mathlib | 11f56f2d40dc792bc05ee2f78ea37d73e98ecbfe | 2bd5e2159d20a8f20d04fc4d382e65eea775ed39 | refs/heads/master | 1,617,706,993,439 | 1,523,163,654,000 | 1,523,163,654,000 | 124,519,997 | 0 | 0 | Apache-2.0 | 1,520,588,283,000 | 1,520,588,283,000 | null | UTF-8 | Lean | false | false | 9,638 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad, Andrew Zipperer, Haitao Zhang, Minchao Wu
Functions over sets.
-/
import data.set.basic
open function
namespace set
universes u v w x
variables {α : Type u} {β : Type v}... |
87b145e3fa3fee9665f921d4c88c082e7677a726 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/data/fintype/card.lean | 3faa0026a84c495605022ffe04fe21ec918a4697 | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 9,606 | 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.fintype.basic
import algebra.big_operators.ring
import algebra.big_operators.option
/-!
Results about "big operations" over a `fintype`, and consequent
r... |
4c8371e45c6332a331eb75c548f984bd2808f8c0 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/category_theory/preadditive/injective.lean | 93388285bfa9faebeb82e7fb04cd1f37dcd377ca | [
"Apache-2.0"
] | permissive | ramonfmir/mathlib | c5dc8b33155473fab97c38bd3aa6723dc289beaa | 14c52e990c17f5a00c0cc9e09847af16fabbed25 | refs/heads/master | 1,661,979,343,526 | 1,660,830,384,000 | 1,660,830,384,000 | 182,072,989 | 0 | 0 | null | 1,555,585,876,000 | 1,555,585,876,000 | null | UTF-8 | Lean | false | false | 9,463 | lean | /-
Copyright (c) 2022 Jujian Zhang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jujian Zhang, Kevin Buzzard
-/
import algebra.homology.exact
import category_theory.types
import category_theory.preadditive.projective
import category_theory.limits.shapes.biproducts
... |
9621e1d432ac0508ce28814e9c372a3539c1fe07 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/algebra/free_monoid.lean | ee518132f2aa631417d19ccb57476068b4d1c419 | [] | 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 | 5,237 | lean | /-
Copyright (c) 2019 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon, Yury Kudryashov
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.equiv.basic
import Mathlib.data.list.basic
import Mathlib.algebra.star.basi... |
00c1167053d78f950edda680455b55c997e8eb3d | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/order/conditionally_complete_lattice_auto.lean | b091882a43d782d643cc9d0782664825f2072310 | [] | 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 | 39,670 | lean | /-
Copyright (c) 2018 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.nat.enat
import Mathlib.data.set.intervals.ord_connected
import Mathlib.PostPort... |
1f76319cc7ba07f78e36eca617f01d935cf4ca2c | ae1e94c332e17c7dc7051ce976d5a9eebe7ab8a5 | /tests/lean/run/fieldIssue.lean | a81cd8330640ea4f023278270f70d426edbe113d | [
"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 | 318 | lean | #lang lean4
structure SCore (α : Type) :=
(x : α) (y : Nat)
inductive M
| leaf : Nat → M
| node : SCore M → M
abbrev S := SCore M
/- We use `s : S` for convenience here -/
def SCore.doubleY (s : S) : Nat :=
2 * s.y
def f (s : S) : Nat :=
s.doubleY
def g : M → Nat
| M.leaf n => n
| M.node s => s.doubleY
|
e7eac40b0739904a0927fb1bf322740a4459a7e1 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/measure_theory/measure/outer_measure.lean | c098e9403dfac70494d786213945871a4c32165c | [
"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 | 65,508 | 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 analysis.specific_limits.basic
import measure_theory.pi_system
import data.fin.vec_notation
import topology.algebra.infinite_sum
/-!
# Outer M... |
43bcaadaef1eae9e078816f0beb0676c33c52193 | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /library/data/vector.lean | bdce5a2df34fab16cefb6667dcf0207bde54c179 | [
"Apache-2.0"
] | permissive | codyroux/lean | 7f8dff750722c5382bdd0a9a9275dc4bb2c58dd3 | 0cca265db19f7296531e339192e9b9bae4a31f8b | refs/heads/master | 1,610,909,964,159 | 1,407,084,399,000 | 1,416,857,075,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,105 | lean | -- Copyright (c) 2014 Floris van Doorn. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Author: Floris van Doorn, Leonardo de Moura
import data.nat.basic data.empty data.prod
open nat eq.ops prod
inductive vector (T : Type) : ℕ → Type :=
nil {} : vector T 0,
cons : T ... |
4729f25659fad9241624677d913b131b48d31578 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/eq10.lean | a55137b9fdfcb2c8799bce299296bfac21b173ae | [
"Apache-2.0"
] | permissive | leanprover-community/lean | 12b87f69d92e614daea8bcc9d4de9a9ace089d0e | cce7990ea86a78bdb383e38ed7f9b5ba93c60ce0 | refs/heads/master | 1,687,508,156,644 | 1,684,951,104,000 | 1,684,951,104,000 | 169,960,991 | 457 | 107 | Apache-2.0 | 1,686,744,372,000 | 1,549,790,268,000 | C++ | UTF-8 | Lean | false | false | 1,328 | lean |
inductive formula
| eqf : nat → nat → formula
| andf : formula → formula → formula
| impf : formula → formula → formula
| notf : formula → formula
| orf : formula → formula → formula
| allf : (nat → formula) → formula
namespace formula
definition implies (a b : Prop) : Prop := a → b
definition denote : formula... |
ec3a1ad520835eaf2b9957dded416d10528ba9a5 | bb31430994044506fa42fd667e2d556327e18dfe | /src/ring_theory/congruence.lean | a79ed4a5a51b9ac48bdc47a46864be5d3bf38f81 | [
"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 | 10,918 | 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 algebra.group_ring_action.basic
import algebra.hom.ring
import algebra.ring.inj_surj
import group_theory.congruence
/-!
# Congruence relations on rings
This file ... |
8b01083cd0fa8862bb6df04b1fc9bc962149aef6 | 9060db28f6353f040da7481ea5ebcdac426589ff | /fabstract/Wiles_A_and_Taylor_R_FermatLast/fabstract.lean | 77f4c3f2bc0287dc0a3dd175ef480b2feef2af28 | [] | no_license | picrin/formalabstracts | 9ccd859fb34a9194fa5ded77ab1bc734ababe194 | 8ebd529598cfc8b6bd02530dd21b7bf3156de174 | refs/heads/master | 1,609,476,202,073 | 1,500,070,922,000 | 1,500,070,922,000 | 97,234,461 | 0 | 0 | null | 1,500,037,389,000 | 1,500,037,389,000 | null | UTF-8 | Lean | false | false | 644 | lean | import ...meta_data
namespace Wiles_A_and_Taylor_R_FermatLast
-- the statement of Fermat's Last Theorem
axiom fermat_last_theorem :
∀ (x y z n : nat), x > 0 → y > 0 → n > 2 → x ^ n + y ^ n ≠ z ^ n
definition fabstract : meta_data := {
authors := ["Andrew Wiles", "Richard Tylor"],
doi := ["10.2307/2118559",... |
88fa6a84c7be003d64e36afbcaa21677ebf7e0ff | 08bd4ba4ca87dba1f09d2c96a26f5d65da81f4b4 | /src/Lean/Util/Profile.lean | 3dd82c86d58d07c786eae88c3f1d5bd6ef91ff61 | [
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"Apache-2.0",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | gebner/lean4 | d51c4922640a52a6f7426536ea669ef18a1d9af5 | 8cd9ce06843c9d42d6d6dc43d3e81e3b49dfc20f | refs/heads/master | 1,685,732,780,391 | 1,672,962,627,000 | 1,673,459,398,000 | 373,307,283 | 0 | 0 | Apache-2.0 | 1,691,316,730,000 | 1,622,669,271,000 | Lean | UTF-8 | Lean | false | false | 1,055 | lean | /-
Copyright (c) 2019 Sebastian Ullrich. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Sebastian Ullrich
-/
import Lean.Data.Options
namespace Lean
/-- Print and accumulate run time of `act` when option `profiler` is set to `true`. -/
@[extern "lean_profileit"]
def p... |
4f3f9127d03316d9dd83ddc8316a87a7cd5f2f5b | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /tests/lean/unknownTactic.lean | 0fdd4d3be3bf8440239ff12204b982f0b01f3015 | [
"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 | 261 | lean | theorem ex1 (x : Nat) : x = x → x = x := by
intro
aexact (rfl)
#print "---"
theorem ex2 (x : Nat) : x = x → x = x :=
have x = x by foo
fun h => h
#print "---"
theorem ex3 (x : Nat) : x = x → x = x :=
have x = x by foo (aaa bbb)
fun h => h
|
091ea8c4ad42a7fe69b5c255073a11bca2792a88 | e0b0b1648286e442507eb62344760d5cd8d13f2d | /stage0/src/Lean/PrettyPrinter/Delaborator/Basic.lean | 0e9595b12db5c0aa7aa1665f8d6543cec6799f5c | [
"Apache-2.0"
] | permissive | MULXCODE/lean4 | 743ed389e05e26e09c6a11d24607ad5a697db39b | 4675817a9e89824eca37192364cd47a4027c6437 | refs/heads/master | 1,682,231,879,857 | 1,620,423,501,000 | 1,620,423,501,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 15,995 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
-/
/-!
The delaborator is the first stage of the pretty printer, and the inverse of the
elaborator: it turns fully elaborated `Expr` core terms back into surf... |
89a3e780381b8fab49fe4010b8a3d1970edb9348 | 5ae26df177f810c5006841e9c73dc56e01b978d7 | /src/tactic/localized.lean | 346178ecea65ea9613c396a3b423c19da278a463 | [
"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 | 3,138 | lean | /-
This consists of two user-commands which allow you to declare notation and commands localized to a namespace.
* Declare notation which is localized to a namespace using:
```
localized "infix ` ⊹ `:60 := my_add" in my.add
```
* After this command it will be available in the same section/namespace/file, just as if yo... |
ff8f8be1a8b92fe85acfb96bedc69534f9a20a9a | 4727251e0cd73359b15b664c3170e5d754078599 | /src/linear_algebra/charpoly/to_matrix.lean | b350386871b1605052aa047c31f0c23232b3c663 | [
"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,197 | lean | /-
Copyright (c) 2021 Riccardo Brasca. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Riccardo Brasca
-/
import linear_algebra.charpoly.basic
import linear_algebra.matrix.basis
/-!
# Characteristic polynomial
## Main result
* `linear_map.charpoly_to_matrix f` : `c... |
faba5c07d7cf3891860bef9c012d55364a623762 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/data/nat/order/basic.lean | fcd6864736eced7e37826eb59a8d7b0d9ec33165 | [
"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 | 24,165 | lean | /-
Copyright (c) 2014 Floris van Doorn (c) 2016 Microsoft Corporation. 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
-/
import algebra.order.ring.canonical
import data.nat.basic
/-!
# The natural numb... |
545cefaa21ea81865d21fb70cff7ab5c481419dd | 86ee6b815fda4c9a5aa42e17b61336a913552e60 | /src/groupoids/words.lean | 60b53db9ea1c7a81bc0557866f924ef3fc7178d2 | [
"Apache-2.0"
] | permissive | fgdorais/lean-groupoids | 6487f6d84427a757708fd4e795038ab159cc4f2c | 54d1582f8d6ae642fc818e7672ac1c49fe7733e5 | refs/heads/master | 1,587,778,056,386 | 1,551,055,383,000 | 1,551,055,383,000 | 172,408,995 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,468 | lean | /-
Copyright © 2019 François G. Dorais. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
-/
import .basic
namespace groupoid
universes u v
variables {α : Type u} (γ : α → α → Sort v)
inductive expr : α → α → Sort (max (u+1) v)
| id {} (x : α) : expr x x
| inv {x y : α} : expr ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.