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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
f5d6022d9b603ed2b6d5faea71aa670f9cfc6310 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/category_theory/monad/limits.lean | 200af5a3187be03fcb188a626a00e059694cc6ab | [
"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 | 9,184 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott MorrisoE
-/
import category_theory.monad.adjunction
import category_theory.adjunction.limits
namespace category_theory
open category
open category_theory.limits
universes v₁ v₂... |
fb8faa59c5e5283f6e659ade41ba81b6e3d34b75 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/data/list/pairwise.lean | 3c421fadda14c6aef51963cbbb9ed857525981ef | [
"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 | 18,226 | 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.list.count
import data.list.lex
import data.list.sublists
import data.set.pairwise
/-!
# Pairwise relations on a list
This file provides basic results a... |
859021137dfc43340d68bd477c38cc71ad087349 | f3849be5d845a1cb97680f0bbbe03b85518312f0 | /library/init/meta/simp_tactic.lean | 074aa4def53faa7f57e407f65e859089ffa82c2c | [
"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 | 18,661 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.meta.tactic init.meta.attribute init.meta.constructor_tactic
import init.meta.relation_tactics init.meta.occurrences
import init.data.op... |
42ec7b0d70e4f01214f1d21fbee7edcb2b040991 | a4673261e60b025e2c8c825dfa4ab9108246c32e | /stage0/src/Lean/Meta/Instances.lean | 8cef2d283a1f7178f7f83761be63463c2f20c85a | [
"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 | 4,911 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Meta.DiscrTree
namespace Lean.Meta
structure InstanceEntry where
keys : Array DiscrTree.Key
val : Expr
globalName? : Opti... |
79cd7d9aadd95f395db3fcb985469daaae5dbb4a | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/lake/test/75/foo/lakefile.lean | bc5ee700dbf4120e91898817399d1ca63cd01008 | [
"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 | 201 | lean | import Lake
open Lake DSL
package foo {
-- add package configuration options here
}
lean_lib Foo {
-- add library configuration options here
}
@[default_target]
lean_exe foo {
root := `Main
}
|
93e3ee4527dfebba4ee781af9cd25272c506943c | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebra/group/inj_surj.lean | 0430e4f1b468cd1e72f1414fb90b0d35754d331f | [
"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 | 21,339 | 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 algebra.group.defs
import logic.function.basic
/-!
# Lifting algebraic data classes along injective/surjective maps
This file provides definitions that are m... |
a425280231a780f68ddb5108cefe3e5add932e87 | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/data/fintype/card.lean | 0e6de1c6fdd177cee61e09859adc4e7f48e14543 | [
"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 | 4,437 | 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.fintype
import algebra.big_operators
/-!
Results about "big operations" over a `fintype`, and consequent
results about cardinalities of certain types.
#... |
da609519ff0bbe70540a92caec998b2db5a794db | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/bad_structures.lean | 91170032f7edab125b597faf39e38ac722cf7239 | [
"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 | 339 | lean | prelude namespace foo structure {l} prod (A : Type l) (B : Type l) :=
(pr1 : A) (pr2 : B)
structure {l} prod (A : Type l) (B : Type l) : Type :=
(pr1 : A) (pr2 : B)
structure {l} prod (A : Type l) (B : Type l) : Type l :=
(pr1 : A) (pr2 : B)
structure {l} prod2 (A : Type l) (B : Type l) : Type (max 1 l) :=
(pr1 : A)... |
7032f894485377718d9232fc08d410812a2145d8 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/using_smt3.lean | da8cd68c8b7d9806c49c688b32913278b5edce10 | [
"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 | 566 | lean | open tactic
lemma ex1 : let x := 1 in ∀ y, x = y → y = 1 :=
by using_smt $ smt_tactic.intros >> get_local `x >>= (fun a, trace a)
open tactic_result
meta def fail_if_success {α : Type} (t : smt_tactic α) : smt_tactic unit :=
⟨λ ss ts, match t.run ss ts with
| success _ _ := failed ts
| exception _ _ _ := success... |
639de6c7d6f50111533afcf1f1dc5265d1bf756d | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/dynamics/fixed_points/topology.lean | 665a645538719f090da7a92e5e0d001f6c742303 | [
"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,256 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov, Johannes Hölzl
-/
import dynamics.fixed_points.basic
import topology.separation
/-!
# Topological properties of fixed points
Currently this file contains two lemmas... |
2441bbcc80a0c622a0a21957caac2359719b444d | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/group_theory/submonoid/membership.lean | 43c9032f135f2ba721c87f1fe77cc586e08140bc | [
"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 | 7,434 | 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, Kenny Lau, Johan Commelin, Mario Carneiro, Kevin Buzzard,
Amelia Livingston, Yury Kudryashov
-/
import group_theory.submonoid.operations
import algebra.big_operators.ba... |
b012bf253b12d35433721b21c19fe8477bd9df8b | abd85493667895c57a7507870867b28124b3998f | /src/data/finsupp.lean | e8e91f8a243ff934b63af6ea9e91509b18a7a6a7 | [
"Apache-2.0"
] | permissive | pechersky/mathlib | d56eef16bddb0bfc8bc552b05b7270aff5944393 | f1df14c2214ee114c9738e733efd5de174deb95d | refs/heads/master | 1,666,714,392,571 | 1,591,747,567,000 | 1,591,747,567,000 | 270,557,274 | 0 | 0 | Apache-2.0 | 1,591,597,975,000 | 1,591,597,974,000 | null | UTF-8 | Lean | false | false | 68,426 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Scott Morrison
-/
import algebra.module
/-!
# Type of functions with finite support
For any type `α` and a type `β` with zero, we define the type `finsupp α β` of fi... |
7933678c54d5734b9db9d680f14cce280214a182 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/linear_algebra/ray.lean | e6637cf101f870284934309dc10b44a9d814beac | [
"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 | 21,726 | lean | /-
Copyright (c) 2021 Joseph Myers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Joseph Myers
-/
import linear_algebra.basic
/-!
# Rays in modules
This file defines rays in modules.
## Main definitions
* `same_ray`: two vectors belong to the same ray if they are ... |
b18d24604550e70f73077860afeda3d13aeca63b | 618003631150032a5676f229d13a079ac875ff77 | /src/algebra/category/Group/colimits.lean | bb20d907cfa72f5081ab337af15024a227c64dbf | [
"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 | 8,547 | 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.category.Group.basic
import category_theory.limits.limits
import category_theory.limits.concrete_category
/-!
# The category of additive commutative g... |
60d329f17f51f7c19ed89aa5f7d7a2c162bf1f46 | 94637389e03c919023691dcd05bd4411b1034aa5 | /src/profNotes/tactic_mode_introduction.lean | 28a6f97a27075076a66532c0e244d6da427746dd | [] | no_license | kevinsullivan/complogic-s21 | 7c4eef2105abad899e46502270d9829d913e8afc | 99039501b770248c8ceb39890be5dfe129dc1082 | refs/heads/master | 1,682,985,669,944 | 1,621,126,241,000 | 1,621,126,241,000 | 335,706,272 | 0 | 38 | null | 1,618,325,669,000 | 1,612,374,118,000 | Lean | UTF-8 | Lean | false | false | 966 | lean | -- boolean and
-- c-style
def band_c (b1 b2 : bool) : bool :=
match b1 with
| tt := match b2 with
| tt := tt
| ff := ff
end
| ff := ff
end
-- cases/equations
def band_eqs : bool → bool → bool
| tt tt := tt
| _ _ := ff
-- lambda
def band_lambda : bool → bool → ... |
b7555b5031ccd4749710e05df9dfc6659174cb03 | 367134ba5a65885e863bdc4507601606690974c1 | /src/topology/maps.lean | 05787697b6f92940b0bc8d57c2fb4c7b06ecb0a9 | [
"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 | 17,249 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro, Patrick Massot
-/
import topology.order
/-!
# Specific classes of maps between topological spaces
This file introduces the following properties of a m... |
fc08f082d704f776e37a2dc9c533af4a6b182548 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/category/Ring/colimits.lean | c14f79f0734f1b63054fce376399657c5fa37b5b | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 13,417 | 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.category.Ring.basic
import category_theory.limits.has_limits
import category_theory.concrete_category.elementwise
/-!
# The category of commutative ri... |
0284df997bc95af521c5b1844721253472a9c954 | 79cc757e5e5b09c7a522f717a6c490d321d36469 | /src/mywork/mylecture14.lean | 78c846a20ec7cb9c93b3fad0692f8260281fe324 | [] | no_license | LukeMathe/cs2120f21 | 534c3b8868dcfdea98a9d22513180c8a062794c6 | d51940b174569a8782e62ae027b108b5f099a9aa | refs/heads/main | 1,693,418,664,935 | 1,634,585,653,000 | 1,634,585,653,000 | 403,762,076 | 0 | 0 | null | 1,630,963,485,000 | 1,630,963,485,000 | null | UTF-8 | Lean | false | false | 526 | lean | axioms
(Person: Type)
(Likes : Person → Person → Prop)
example :
¬ (∀ p : Person, Likes p p) ↔
∃ p : Person, ¬ Likes p p :=
begin
apply iff.intro _ _,
assume h,
have f := classical.em (∃ p : Person, ¬ Likes p p),
cases f,
apply f,
have contra : ∀ (p : Person), Likes p p := _,
... |
29ae16a998303fdb17e411c057f7326ce7603089 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/group_theory/group_action/basic.lean | d3e5fd0d59cb61b7b0cc697a0b57e9e3d00948cb | [
"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 | 14,135 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import group_theory.group_action.defs
import group_theory.group_action.group
import data.setoid.basic
import data.set.pointwise.smul
import group_theory.subgroup.basic
/... |
bda350c1cb51306577879b59c1dc0b568f93a0b4 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/elabissues/equation_compiler_slow_with_many_constructors2.lean | 1eb191aa35c6e9090e8751b6f0c0d5bcd8b21bb5 | [
"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 | 5,547 | lean | /-
Same setup as in 'equation_compiler_slow_with_many_constructors.lean',
except here we have a function `infer` that takes a single `Proof` object
and that matches on all constructors, each applied only to variables.
Despite the favorable matching regime, the function `infer` still takes ~200ms
to elaborate.
-/
namesp... |
939f5e0c1cbabb553db57666a4a0e194ab4a7478 | f3849be5d845a1cb97680f0bbbe03b85518312f0 | /tests/lean/run/section4.lean | 8151d0222453ce6bc5b30847f288ee015ac26640 | [
"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 | 639 | lean | set_option pp.universes true
set_option pp.implicit true
section
universe k
parameter A : Type
section
universe variable l
universe variable u
parameter B : Type
definition foo (a : A) (b : B) := b
inductive mypair
| mk : A → B → mypair
#print mypair.rec
#check mypair.mk
d... |
b1b44f3168c2d94ccca11f3c37fbc21dd6bbfe03 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/limits/shapes/kernels.lean | 862a36f2f68cf3a7f464579513ef7f6b292d3079 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 38,817 | 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.preserves.shapes.zero
/-!
# Kernels and cokernels
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file... |
392bf62b2d0254e5b10be60290cb78c855096433 | bb31430994044506fa42fd667e2d556327e18dfe | /src/order/initial_seg.lean | 16841b0aeddbe3b60ed93a8393ede04b38abfc25 | [
"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 | 18,221 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Floris van Doorn
-/
import order.rel_iso.set
import order.well_founded
/-!
# Initial and principal segments
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes ... |
a4cd109cf2985e7e1db2ddd983e86b91f63385e9 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/number_theory/zsqrtd/basic.lean | c3971b6486a8a828411c733f702120806333b6f4 | [
"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 | 31,894 | 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 algebra.associated
import tactic.ring
/-! # ℤ[√d]
The ring of integers adjoined with a square root of `d : ℤ`.
After defining the norm, we show that it is a... |
adda890818addf40a8275a002abf455ef94897d5 | 9dd3f3912f7321eb58ee9aa8f21778ad6221f87c | /tests/lean/run/struct_value.lean | 477a77ce4c536a2c7cce4ba15e8b0479b44782dc | [
"Apache-2.0"
] | permissive | bre7k30/lean | de893411bcfa7b3c5572e61b9e1c52951b310aa4 | 5a924699d076dab1bd5af23a8f910b433e598d7a | refs/heads/master | 1,610,900,145,817 | 1,488,006,845,000 | 1,488,006,845,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 747 | lean | check { prod . fst := 10, snd := 20 }
check ({ fst := 10, snd := 20 } : nat × nat)
definition p : nat × nat :=
{ snd := 20, fst := 10 }
print p
definition attr : user_attribute :=
{ name := `foo, descr := "hello world" }
print attr
definition p2 :=
{ p with fst := 20 }
print p2
structure point :=
(x : nat) (y :... |
7438ef99e9da32bfe6067d8fa3e8f66162f54332 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/option/defs_auto.lean | 8091e503ba4396dfdbee5db3db7782ca281b0d2b | [] | 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,514 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
Extra definitions on option.
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.PostPort
universes u_1 u_2 u v w
namespace Mathlib
namesp... |
7f95a0bb57c5c74ac272ee1143b4ccdd10faeb85 | 5c5878e769950eabe897ad08485b3ba1a619cea9 | /src/categories/util/Two.lean | 295daeaf6176d1c4ec9c5806d81ecbfed8946b3c | [
"Apache-2.0"
] | permissive | semorrison/lean-category-theory-pr | 39dc2077fcb41b438e61be1685e4cbca298767ed | 7adc8d91835e883db0fe75aa33661bc1480dbe55 | refs/heads/master | 1,583,748,682,010 | 1,535,111,040,000 | 1,535,111,040,000 | 128,731,071 | 1 | 2 | Apache-2.0 | 1,528,069,880,000 | 1,523,258,452,000 | Lean | UTF-8 | Lean | false | false | 843 | lean | -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Scott Morrison
import ..tactics
import data.fintype
universes u v
@[derive decidable_eq]
inductive Two : Type u
| _0 : Two
| _1 : Two
open Two
section
open tactic
@[tidy] me... |
16b4858e902ac4bfb7f6144f183030ca9559d3df | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/analysis/normed_space/finite_dimension.lean | 655a9ca8323526ba4640db2ee12ffc4ca295ba9c | [
"Apache-2.0"
] | permissive | robertylewis/mathlib | 3d16e3e6daf5ddde182473e03a1b601d2810952c | 1d13f5b932f5e40a8308e3840f96fc882fae01f0 | refs/heads/master | 1,651,379,945,369 | 1,644,276,960,000 | 1,644,276,960,000 | 98,875,504 | 0 | 0 | Apache-2.0 | 1,644,253,514,000 | 1,501,495,700,000 | Lean | UTF-8 | Lean | false | false | 38,573 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import analysis.normed_space.affine_isometry
import analysis.normed_space.operator_norm
import analysis.asymptotics.asymptotic_equivalent
import linear_algebra.... |
7707c5ed762d5c310e8c4e67e5206cf40ad4a3b8 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/tactic/localized.lean | 119dd22d92ef51e359e2d9e5d881ad60ade86ad7 | [
"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 | 5,304 | lean | /-
Copyright (c) 2019 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
-/
import tactic.core meta.rb_map
/-!
# Localized notation
This consists of two user-commands which allow you to declare notation and commands localized to a
name... |
4495375518f4fa56541b44d6edddc44195b4cb97 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/ring_theory/ideal/over.lean | 325c3d47912b7b245a894adf05db8c0a568c1b46 | [
"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 | 10,668 | lean | /-
Copyright (c) 2020 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Anne Baanen
-/
import ring_theory.algebraic
import ring_theory.localization
/-!
# Ideals over/under ideals
This file concerns ideals lying over other ideals.
Let `f : R →+* S` be a ring... |
315d1c63752b72c5f4dc59d0a0684907c5d60724 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/data/finset/order.lean | ad0fd6c6fe576c4cfe303445fea2d42524f175da | [
"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 | 732 | lean | import data.finset.basic
universes u v w
variables {α : Type u}
theorem directed.finset_le {r : α → α → Prop} [is_trans α r]
{ι} (hι : nonempty ι) {f : ι → α} (D : directed r f) (s : finset ι) :
∃ z, ∀ i ∈ s, r (f i) (f z) :=
show ∃ z, ∀ i ∈ s.1, r (f i) (f z), from
multiset.induction_on s.1 (let ⟨z⟩ := hι in ⟨z,... |
40cb2406db77e15187e754253b799cf7ce8b1cc7 | 46125763b4dbf50619e8846a1371029346f4c3db | /src/topology/metric_space/gromov_hausdorff.lean | df1fb3ae1082a90174e35af1862d55d7e80b73f3 | [
"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 | 56,033 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Sébastien Gouëzel
-/
import topology.metric_space.closeds set_theory.cardinal topology.metric_space.gromov_hausdorff_realized
topology.metric_space.completion
/-!
# Gromov-Hausdorf... |
2e153725daeb0956a3c5621920eec4825993cf99 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/category_theory/bicategory/free.lean | 6528cd11f2bf2ca75b8d2ad6e17dac818cf5aaa8 | [
"Apache-2.0"
] | permissive | ramonfmir/mathlib | c5dc8b33155473fab97c38bd3aa6723dc289beaa | 14c52e990c17f5a00c0cc9e09847af16fabbed25 | refs/heads/master | 1,661,979,343,526 | 1,660,830,384,000 | 1,660,830,384,000 | 182,072,989 | 0 | 0 | null | 1,555,585,876,000 | 1,555,585,876,000 | null | UTF-8 | Lean | false | false | 13,054 | lean | /-
Copyright (c) 2022 Yuma Mizuno. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yuma Mizuno
-/
import category_theory.bicategory.functor
/-!
# Free bicategories
We define the free bicategory over a quiver. In this bicategory, the 1-morphisms are freely
generated by... |
f477260699296ec88bf00e4cc87ae1c34d459622 | e2fc96178628c7451e998a0db2b73877d0648be5 | /src/classes/context_free/basics/pumping.lean | 34a818c861dd5b90ea893eb53d9b3b2a1348c5af | [
"BSD-2-Clause"
] | permissive | madvorak/grammars | cd324ae19b28f7b8be9c3ad010ef7bf0fabe5df2 | 1447343a45fcb7821070f1e20b57288d437323a6 | refs/heads/main | 1,692,383,644,884 | 1,692,032,429,000 | 1,692,032,429,000 | 453,948,141 | 7 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 455 | lean | import classes.context_free.basics.definition
import utilities.list_utils
/-- Pumping lemma for context-free languages. -/
lemma CF_pumping {T : Type} {L : language T} (cf : is_CF L) :
∃ n : ℕ, ∀ w ∈ L, list.length w ≥ n → (
∃ u v x y z : list T,
(w = u ++ v ++ x ++ y ++ z) ∧
(v ++ y).length > 0 ... |
dc89328422a42909f1a5691103eaef89a04025ed | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /stage0/src/Lean/Meta/DiscrTreeTypes.lean | bacbeb219d87a5574b249419465b87225e33a2a8 | [
"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 | 1,088 | 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
namespace Lean.Meta
/- See file `DiscrTree.lean` for the actual implementation and documentation. -/
namespace DiscrTree
inductive Key ... |
6c1ad29ddb3b371e26166d308429c17668e5fa71 | 271e26e338b0c14544a889c31c30b39c989f2e0f | /stage0/src/Init/Lean/Elab/Util.lean | 9cf1f509c860419d24dd64e61d1d0e6b699b36ec | [
"Apache-2.0"
] | permissive | dgorokho/lean4 | 805f99b0b60c545b64ac34ab8237a8504f89d7d4 | e949a052bad59b1c7b54a82d24d516a656487d8a | refs/heads/master | 1,607,061,363,851 | 1,578,006,086,000 | 1,578,006,086,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,471 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import Init.Lean.Util.Trace
import Init.Lean.Parser
namespace Lean
namespace Elab
def checkSyntaxNodeKind (env : Environment) (k : Name) : ExceptT... |
a16fecd7e432f9de2452d7fe81a2658557cccdee | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/algebra/category/Group/adjunctions.lean | ae533632bd5109e63028f974d66d28232e18d04a | [] | 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 | 1,386 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.algebra.category.Group.basic
import Mathlib.group_theory.free_abelian_group... |
dda9672fcfcbc8cd6cd430a9ef457e330d46a3fa | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /src/group_theory/specific_groups/alternating.lean | 61abe4dee4bc7e1b024371ea56a4f9db31e7c550 | [
"Apache-2.0"
] | permissive | dexmagic/mathlib | ff48eefc56e2412429b31d4fddd41a976eb287ce | 7a5d15a955a92a90e1d398b2281916b9c41270b2 | refs/heads/master | 1,693,481,322,046 | 1,633,360,193,000 | 1,633,360,193,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 15,098 | lean | /-
Copyright (c) 2021 Aaron Anderson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson
-/
import group_theory.perm.fin
import tactic.interval_cases
/-!
# Alternating Groups
The alternating group on a finite type `α` is the subgroup of the permutation gr... |
9ef5f8e69a6b666aa770d2b9233577b668f7e004 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/set/lattice.lean | d29f105c838955a1fb58b6c3cce4652e0af68801 | [
"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 | 66,571 | 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, Johannes Hölzl, Mario Carneiro
-/
import order.complete_boolean_algebra
import order.directed
import order.galois_connection
/-!
# The set lattice
> ... |
51ad164ed6793cc36fd3d6b503ea3c8f70952dfa | 43390109ab88557e6090f3245c47479c123ee500 | /src/Topology/Material/Sutherland_Chapter_12.lean | ad237c7284150b491b13f0a08166680c7140ed8c | [
"Apache-2.0"
] | permissive | Ja1941/xena-UROP-2018 | 41f0956519f94d56b8bf6834a8d39473f4923200 | b111fb87f343cf79eca3b886f99ee15c1dd9884b | refs/heads/master | 1,662,355,955,139 | 1,590,577,325,000 | 1,590,577,325,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,156 | lean | import analysis.topology.topological_space
import analysis.topology.continuity
import data.set.basic
import logic.basic
import Topology.Material.connected_spaces
import analysis.real
--import Topology.Material.Path_Homotopy
open set filter lattice classical
local attribute [instance] prop_decidable
unive... |
6bc201a67e417942542ce19629dfa11df5c505ca | 4727251e0cd73359b15b664c3170e5d754078599 | /src/logic/equiv/local_equiv.lean | b6bed0f350ce1759ca6a7e8be5d491f22773b665 | [
"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 | 34,515 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import data.set.function
import logic.equiv.basic
/-!
# Local equivalences
This files defines equivalences between subsets of given types.
An element `e` of `... |
e2397454a7c8da881646808ef3ebac73e176b4be | 02005f45e00c7ecf2c8ca5db60251bd1e9c860b5 | /src/analysis/normed_space/basic.lean | 834cd60fac49298378a7b6ba3fcd1676f704cd22 | [
"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 | 58,285 | 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.instances.nnreal
import topology.algebra.module
import topology.metric_space.antilipschitz
/-!
# Normed spaces
-/
variables {α : Typ... |
31df95b2f7274aa38b4a3d4b957f78ca95daa27c | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/data/nat/enat.lean | 8b60c77e4892f91d924d0afec37f851b3ed08bba | [
"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 | 12,650 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
Natural numbers with infinity, represented as roption ℕ.
-/
import data.pfun algebra.ordered_group
import tactic.norm_cast tactic.norm_num
open roption
def enat : Type :=... |
2732e6c55486b79351f2ecf5200f0f744a6fc082 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/topology/uniform_space/compact.lean | 9fddded9518093bd61ce1debdf0cba0ed910e535 | [
"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 | 10,396 | lean | /-
Copyright (c) 2020 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Yury Kudryashov
-/
import topology.uniform_space.uniform_convergence
import topology.separation
/-!
# Compact separated uniform spaces
## Main statements
* `compact_... |
492fd6ac137e0ed82ace259d8aecadb1d4feeecf | 02005f45e00c7ecf2c8ca5db60251bd1e9c860b5 | /src/data/finset/basic.lean | b3de0ae2e7994b36f29ca93d23cbd55691963f1f | [
"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 | 111,901 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Jeremy Avigad, Minchao Wu, Mario Carneiro
-/
import data.multiset.finset_ops
import tactic.monotonicity
import tactic.apply
import tactic.nth_rewrite
/-!
# F... |
9c777fa2fa0543bd52e34e4e9491c805e12489ad | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /stage0/src/Lean/Data/Lsp/CodeActions.lean | d3020d310524f6ee5defa52958a8c571798c8125 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | tobiasgrosser/lean4 | ce0fd9cca0feba1100656679bf41f0bffdbabb71 | ebdbdc10436a4d9d6b66acf78aae7a23f5bd073f | refs/heads/master | 1,673,103,412,948 | 1,664,930,501,000 | 1,664,930,501,000 | 186,870,185 | 0 | 0 | Apache-2.0 | 1,665,129,237,000 | 1,557,939,901,000 | Lean | UTF-8 | Lean | false | false | 7,747 | lean | /-
Copyright (c) 2022 E.W.Ayers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: E.W.Ayers
-/
import Lean.Data.Json
import Lean.Data.Lsp.Basic
import Lean.Data.Lsp.Diagnostics
namespace Lean.Lsp
open Json
/-- The kind of a code action.
Kinds are a hierarchical list... |
17a135974a3ea801dde358237ab96837a0acc387 | 037dba89703a79cd4a4aec5e959818147f97635d | /src/2019/solutions/sheet4.lean | 7a65835b6e928dc7deac150e18977953f40d1d56 | [] | no_license | ImperialCollegeLondon/M40001_lean | 3a6a09298da395ab51bc220a535035d45bbe919b | 62a76fa92654c855af2b2fc2bef8e60acd16ccec | refs/heads/master | 1,666,750,403,259 | 1,665,771,117,000 | 1,665,771,117,000 | 209,141,835 | 115 | 12 | null | 1,640,270,596,000 | 1,568,749,174,000 | Lean | UTF-8 | Lean | false | false | 1,316 | lean | import data.real.basic
open function
definition pals {X Y Z : Type} (f : X → Y) (g : X → Z) := ∃ h : Y → Z, bijective h ∧ g = h ∘ f
lemma Q5 (X Y Z: Type) (f : X → Y) (g : X → Z) (hf : surjective f) (hg : surjective g) : pals f g ↔ ∀ a b : X, (f a = f b) ↔ (g a = g b) :=
begin
split,
{ -- if pals then equiv reln... |
c02d21ed706c087366c63130bca7118e4e592034 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/analysis/normed_space/mazur_ulam.lean | 07c94350d1be1746ef6352650c8889cc803f93b5 | [
"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,832 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import topology.instances.real_vector_space
import analysis.normed_space.affine_isometry
import linear_algebra.affine_space.midpoint
/-!
# Mazur-Ulam Theorem
Mazu... |
64504dc61618ed4f8b5ef6eaecc9376d84ee35cb | b00eb947a9c4141624aa8919e94ce6dcd249ed70 | /src/Lean/Elab/Util.lean | c46776668625ca49b460410cd10497b12b85f985 | [
"Apache-2.0"
] | permissive | gebner/lean4-old | a4129a041af2d4d12afb3a8d4deedabde727719b | ee51cdfaf63ee313c914d83264f91f414a0e3b6e | refs/heads/master | 1,683,628,606,745 | 1,622,651,300,000 | 1,622,654,405,000 | 142,608,821 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,022 | 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.Util.Trace
import Lean.Parser.Syntax
import Lean.Parser.Extension
import Lean.KeyedDeclsAttribute
import Lean.Elab.Exception
namespace Lean
de... |
27ba7eecf3b978467b257258dae1f7551070aecd | 86f6f4f8d827a196a32bfc646234b73328aeb306 | /examples/sets_functions_and_relations/unnamed_387.lean | e962202fe8537a4a56fb6e436a6c01348835d0b5 | [] | 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 | 277 | lean | import tactic
open set
variable {α : Type*}
variables (s t u : set α)
-- BEGIN
example : s ∩ (s ∪ t) = s :=
sorry
example : s ∪ (s ∩ t) = s :=
sorry
example : (s \ t) ∪ t = s ∪ t :=
sorry
example : (s \ t) ∪ (t \ s) = (s ∪ t) \ (s ∩ t) :=
sorry
-- END |
572362062e89a2276040744ae8c0783d803b7156 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /stage0/src/Lean/Elab/PreDefinition/WF/Rel.lean | b1db984edd2dfe03c0de4143b2a448457827fac9 | [
"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 | 947 | 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.SyntheticMVars
import Lean.Elab.PreDefinition.Basic
namespace Lean.Elab.WF
open Meta
open Term
def elabWFRel (unaryPreDef : PreDefinition... |
044489983df50e5807256ca09d3fc350cf44edab | 97f752b44fd85ec3f635078a2dd125ddae7a82b6 | /hott/init/equiv.hlean | 4a93d9f291965bdb9beeb2ffe9e8a1e361387d2c | [
"Apache-2.0"
] | permissive | tectronics/lean | ab977ba6be0fcd46047ddbb3c8e16e7c26710701 | f38af35e0616f89c6e9d7e3eb1d48e47ee666efe | refs/heads/master | 1,532,358,526,384 | 1,456,276,623,000 | 1,456,276,623,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 17,032 | hlean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad, Jakob von Raumer, Floris van Doorn
Ported from Coq HoTT
-/
prelude
import .path .function
open eq function lift
/- Equivalences -/
-- This is our definition of... |
267a8306ab465e8e4f7a3d11fbcba078cecd667b | 4fa161becb8ce7378a709f5992a594764699e268 | /src/data/setoid/partition.lean | 6c0d4b0ad9458b36aaf17681bac8c92d998ae053 | [
"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 | 9,003 | lean | import data.setoid.basic
import data.set.lattice
/-!
# Equivalence relations: partitions
This file comprises properties of equivalence relations viewed as partitions.
## Tags
setoid, equivalence, iseqv, relation, equivalence relation, partition, equivalence class
-/
namespace setoid
variables {α : Type*}
/-- If ... |
ad259fc1ceef2cc3f5f454b86998647441778cc6 | 3f7026ea8bef0825ca0339a275c03b911baef64d | /src/tactic/lift.lean | 516b8dec5402629dab45a7e9875f20573424637e | [
"Apache-2.0"
] | permissive | rspencer01/mathlib | b1e3afa5c121362ef0881012cc116513ab09f18c | c7d36292c6b9234dc40143c16288932ae38fdc12 | refs/heads/master | 1,595,010,346,708 | 1,567,511,503,000 | 1,567,511,503,000 | 206,071,681 | 0 | 0 | Apache-2.0 | 1,567,513,643,000 | 1,567,513,643,000 | null | UTF-8 | Lean | false | false | 7,164 | lean | /-
Copyright (c) 2019 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
-/
import tactic.rcases
/-!
# lift tactic
This file defines the lift tactic, allowing the user to lift elements from one type to another
under a specified condition... |
4c266ad173572221be47208a51603ae092e78696 | 08bd4ba4ca87dba1f09d2c96a26f5d65da81f4b4 | /src/Lean/Meta/Tactic/Simp/Rewrite.lean | 33b25082aa3ea3e98f953318ab484d50eeef542a | [
"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 | 10,956 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Meta.ACLt
import Lean.Meta.Match.MatchEqsExt
import Lean.Meta.AppBuilder
import Lean.Meta.SynthInstance
import Lean.Meta.Tactic.Simp.Types
impor... |
c6bc09023c1a3fd69fb6f72bc15a948955d54208 | 9338c56dfd6ceacc3e5e63e32a7918cfec5d5c69 | /src/Kenny/sites/basic.lean | 72b8e6452d813e771b091b26d354512505de89c0 | [] | no_license | Project-Reykjavik/lean-scheme | 7322eefce504898ba33737970be89dc751108e2b | 6d3ec18fecfd174b79d0ce5c85a783f326dd50f6 | refs/heads/master | 1,669,426,172,632 | 1,578,284,588,000 | 1,578,284,588,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,825 | lean | import category_theory.limits.limits
universes v w u
namespace category_theory
inductive pullback_diagram : Type v
| base_left | base_right | target
namespace pullback_diagram
inductive hom : pullback_diagram → pullback_diagram → Type v
| id_base_left : hom base_left base_left
| id_base_right : hom base_right base... |
a1dc2adef574fb451d53060b8bcba8408cf1c825 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/group_theory/free_group.lean | d466c401c27f9114ac04bf5d0f93690b345717c0 | [
"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 | 42,576 | 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 data.fintype.basic
import data.list.sublists
import group_theory.subgroup.basic
/-!
# Free groups
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file... |
14e927b477290fa263918d4e3043c0e092ca1728 | 9dd3f3912f7321eb58ee9aa8f21778ad6221f87c | /tests/lean/1299.lean | 08cfbff87398be39ad3bdab47df44ec9a9b5abf2 | [
"Apache-2.0"
] | permissive | bre7k30/lean | de893411bcfa7b3c5572e61b9e1c52951b310aa4 | 5a924699d076dab1bd5af23a8f910b433e598d7a | refs/heads/master | 1,610,900,145,817 | 1,488,006,845,000 | 1,488,006,845,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 368 | lean | open tactic expr
def d1 : true = true := by do
trace (("a", "a")),
prt ← to_expr `(true = true),
add_decl (declaration.ax `new_ax [] prt),
l ← to_expr `(new_ax),
apply l
check d1
print d1
theorem d2 : true = true := by do
trace (("a", "a")),
prt ← to_expr `(true = true),
add_decl (declaration.ax `new_ax2 [] prt),
l ... |
b0a2a6ced6ef88634c9cd9c45b2abb604e358a11 | e9dbaaae490bc072444e3021634bf73664003760 | /src/Problems/2012/IMO_2012_P1.lean | 94eb33005b74ea326052298377bd1167b373c81c | [
"Apache-2.0"
] | permissive | liaofei1128/geometry | 566d8bfe095ce0c0113d36df90635306c60e975b | 3dd128e4eec8008764bb94e18b932f9ffd66e6b3 | refs/heads/master | 1,678,996,510,399 | 1,581,454,543,000 | 1,583,337,839,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 613 | lean | import Geo.Geo.Core
namespace Geo
open Triangle
def IMO_2012_P1 : Prop :=
∀ (A B C : Point),
let J := (excircles ⟨A, B, C⟩).A.origin;
∀ (K L M : Point),
tangentAt (excircles ⟨A, B, C⟩).A (Seg.mk B C) M → -- note how this is still a Seg
tangentAt (excircles ⟨A, B, C⟩).A (Line.mk A B) K →
tangentAt (excircles ⟨A, B, C... |
47af0dd440f613030ef2144a82f763500d003838 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/nat/totient.lean | bd601d3273d33979668dc2fcab84ee94d7bf8eab | [
"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 | 15,420 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import algebra.char_p.two
import data.nat.factorization.basic
import data.nat.periodic
import data.zmod.basic
/-!
# Euler's totient function
> THIS FILE IS SYNCHRONIZED... |
4578f84acc368a65f2db9ae74dbb31a5fe6b1b25 | caa1512363b76923d0e9cdb716122a5c26c3c6bc | /src/cone.lean | e5c03ac460df4ae0934609b362dcd9356058a56e | [] | 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 | 2,494 | lean |
import linear_algebra.basic
import data.real.basic
import data.set.basic
import tactic.interactive
import .inner_product_space
noncomputable theory
local attribute [instance] classical.prop_decidable
section basic
variables
{α : Type*}
[has_scalar ℝ α]
{ι : Sort _}
(A : set α) (B : set α) (x : α)
open... |
c8cf485aa65506e08059b3babbe7ecb785829152 | aa5a655c05e5359a70646b7154e7cac59f0b4132 | /src/Lean/Elab/MutualDef.lean | 8bb1147b472d2eba8457418cd10bf4e3acf0da54 | [
"Apache-2.0"
] | permissive | lambdaxymox/lean4 | ae943c960a42247e06eff25c35338268d07454cb | 278d47c77270664ef29715faab467feac8a0f446 | refs/heads/master | 1,677,891,867,340 | 1,612,500,005,000 | 1,612,500,005,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 28,171 | 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.Parser.Term
import Lean.Meta.Closure
import Lean.Meta.Check
import Lean.Elab.Command
import Lean.Elab.DefView
import Lean.Elab.PreDefinition
imp... |
195ff49c6dc39eb8cd11174574ae9a53e1f59aec | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/data/seq/seq.lean | 52f364712c2ea9e542b777802731829b6f73a6aa | [
"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 | 28,505 | 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.list.basic
import data.stream
import data.lazy_list
import data.seq.computation
universes u v w
/-
coinductive seq (α : Type u) : Type u
| nil : seq α
| ... |
51fe13ef14bcc6a9b9c6a388521f9016bd6beec8 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/core_auto.lean | a5098fe803144f21910e856be05ee761efd0fd96 | [] | 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,576 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
notation, basic datatypes and type classes
-/
import Mathlib.PrePort
universes u l v w u_1 u_2 u₁ u₂ u₃
namespace Mathlib
/- Reserving notation. We do thi... |
f1803584e0b87529fdd1a61c8beb94345139f6e9 | 586535ff9853f5b85dc5fdeb5b78f1ad2d573a6e | /src/compiler.lean | 1372e0a95caa588d233e8a0f57dcfec5ffa2c75e | [
"Apache-2.0"
] | permissive | Kha/rc-correctness | fede4ae228c5f04985cf332e718a5a433230b150 | be5a521f1b0528ccbc685619b265cd11ea854edf | refs/heads/master | 1,595,967,325,275 | 1,568,889,756,000 | 1,568,889,756,000 | 209,523,947 | 0 | 0 | Apache-2.0 | 1,568,888,337,000 | 1,568,888,336,000 | null | UTF-8 | Lean | false | false | 2,370 | lean | import type_system
namespace rc_correctness
open rc_correctness.expr
open rc_correctness.fn_body
open rc_correctness.ob_lin_type
def inc_𝕆 (x : var) (V : finset var) (F : fn_body) (βₗ : var → ob_lin_type) : fn_body :=
if βₗ x = 𝕆 ∧ x ∉ V then F else inc x; F
def dec_𝕆_var (x : var) (F : fn_body) (βₗ : var → ob_l... |
695bc9247674f594003b9779b385320a8451a925 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/monotone.lean | fa130a41be1f025b3aac702af36e9dac40e7e1ee | [
"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,670 | lean | class Preorder (α : Type u) extends LE α where
le_refl (a : α) : a ≤ a
le_trans {a b c : α} : a ≤ b → b ≤ c → a ≤ c
instance {α : Type u} {β : α → Type v} [(a : α) → Preorder (β a)] : Preorder ((a : α) → β a) where
le f g := ∀ a, f a ≤ g a
le_refl f := fun a => Preorder.le_refl (f a)
le_trans := fun h₁ h... |
72a62933f910af95ee589b07991132b47ee82807 | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/category_theory/conj.lean | a398d505fe0375fff533da46b789faf7607607ab | [
"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 | 5,861 | lean | /-
Copyright (c) 2019 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import category_theory.isomorphism data.equiv.basic category_theory.endomorphism algebra.group_power
/-!
# Conjugate morphisms by isomorphisms
An isomorphism `α ... |
c743df9d65905bda4d38e1f4b3d2fe8363e1b694 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /doc/metaprogramming-arith.lean | ee1b6c5d92b1585d70a3c6e1fff4429de433a669 | [
"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,992 | lean | inductive Arith : Type
| add : Arith → Arith → Arith -- e + f
| mul : Arith → Arith → Arith -- e * f
| int : Int → Arith -- constant
| symbol : String → Arith -- variable
declare_syntax_cat arith
syntax num : arith -- int for Arith.int
syntax str : arith -- strings for Arith.symbol
syntax:60 arith:60 "+... |
e0f0940d1ed62c302d2390f2dfd0b1f961db37ab | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/nat/bitwise.lean | 730cffbe8a5b61a1640211e66bfd5eccc604bb1d | [
"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 | 9,684 | 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 data.list.basic
import data.nat.bits
import tactic.linarith
/-!
# Bitwise operations on natural numbers
In the first half of this file, we provide theorems for... |
5ec5d137b770e7ac5693273c9bbebf7d40afc3a1 | 2eab05920d6eeb06665e1a6df77b3157354316ad | /src/topology/separation.lean | 0b584b05ac7b665a5fe08c0ceeb5df186b9a6efd | [
"Apache-2.0"
] | permissive | ayush1801/mathlib | 78949b9f789f488148142221606bf15c02b960d2 | ce164e28f262acbb3de6281b3b03660a9f744e3c | refs/heads/master | 1,692,886,907,941 | 1,635,270,866,000 | 1,635,270,866,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 60,593 | 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 topology.subset_properties
import topology.connected
/-!
# Separation properties of topological spaces.
This file defines the predicate `sepa... |
7aad3da3b605e85dcf0b802658643258eea07bf0 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/dynamics/ergodic/conservative.lean | 0835c3ff44a0019dd7ccff048e2cc4f48fea9ebd | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 10,038 | 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.constructions.borel_space
import dynamics.ergodic.measure_preserving
import combinatorics.pigeonhole
/-!
# Conservative systems
In this file... |
545e288869c5a414c08aaa4bb57988325c0472b5 | 9ee042bf34eebe0464f0f80c0db14ceb048dab10 | /src/Lean/Widget/InteractiveCode.lean | b3c326374297bc678381bba5cc57c5696f440e36 | [
"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 | 4,950 | 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 ... |
8cb90d7f0cf5f71987f908472584db0e24f63239 | f1b175e38ffc5cc1c7c5551a72d0dbaf70786f83 | /order/filter.lean | 1041d9d07836e736bdec8c87cd30e23764c0a6f6 | [
"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 | 88,228 | 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
Theory of filters on sets.
-/
import order.galois_connection order.zorn
import data.set.finite data.list
import category.applicative
open lattice set
universes u v w x... |
f6da461a61209d39ef685e3525ced3087473e53f | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/calcErrors.lean | ea77cb9e36abad41ec7999f92380934246d1fb1e | [
"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,566 | lean | theorem ex1 (a b c : Nat) (h₁ : a = b) (h₂ : b = c) : a + b = 0 + c + b :=
calc a + b = b + b := by rw [h₁]
_ = 0 + c + b := rfl
theorem ex2 (a b c : Nat) (h₁ : a = b) (h₂ : b = c) : a + b = 0 + c + b :=
calc a + b = b + b := by rw [h₁]
0 + c + b = 0 + c + b := rfl
theorem ex3 ... |
27bc6004c85391e51bf912ade7dba4b2d290baa0 | c31182a012eec69da0a1f6c05f42b0f0717d212d | /src/facts/default.lean | 9dff2337c085a3e3ca23cf64aa37695c9ff238a7 | [] | 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 | 63 | lean | import facts.int
import facts.nnreal
import facts.normed_group
|
5aecf7291cb6f4eeabe17fe9d2bec389c710af53 | 75db7e3219bba2fbf41bf5b905f34fcb3c6ca3f2 | /tests/lean/run/tactic28.lean | 27c1104da80827f883f2ae4f232f5c39c5c4761a | [
"Apache-2.0"
] | permissive | jroesch/lean | 30ef0860fa905d35b9ad6f76de1a4f65c9af6871 | 3de4ec1a6ce9a960feb2a48eeea8b53246fa34f2 | refs/heads/master | 1,586,090,835,348 | 1,455,142,203,000 | 1,455,142,277,000 | 51,536,958 | 1 | 0 | null | 1,455,215,811,000 | 1,455,215,811,000 | null | UTF-8 | Lean | false | false | 955 | lean | import logic data.num
open tactic inhabited
namespace foo
inductive sum (A : Type) (B : Type) : Type :=
| inl : A → sum A B
| inr : B → sum A B
theorem inl_inhabited {A : Type} (B : Type) (H : inhabited A) : inhabited (sum A B)
:= inhabited.destruct H (λ a, inhabited.mk (sum.inl B a))
theorem inr_inhabited (A : Ty... |
5766663356ff39d942fd882f54a055b341e5a402 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/ring_theory/free_ring.lean | 026bd954c7a206257f17e3889f8f589486ffb0cb | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 2,550 | lean | /-
Copyright (c) 2019 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Johan Commelin
-/
import group_theory.free_abelian_group
/-!
# Free rings
The theory of the free ring over a type.
## Main definitions
* `free_ring α` : the free (not commuta... |
01c3af83976d5f59653289e523c28c2cf711db46 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/ring_theory/adjoin_root.lean | d81149c511d7aea5db68493750c2d8dd4721017b | [
"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 | 5,435 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Chris Hughes
Adjoining roots of polynomials
-/
import data.polynomial.field_division
import ring_theory.adjoin
import ring_theory.principal_ideal_domain
/-!
# Adjoini... |
0f7479277d1be25d7737d98e8eea0b98a10d7dac | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/hott/rw_eta.hlean | bac3a80275eee053f05729400b3322a6051a1ca2 | [
"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 | 824 | hlean | open eq is_equiv funext
constant f : nat → nat → nat
example : (λ x y : nat, f x y) = f :=
rfl
namespace hide
variables {A : Type} {B : A → Type} {C : Πa, B a → Type}
definition homotopy2 [reducible] (f g : Πa b, C a b) : Type :=
Πa b, f a b = g a b
notation f `∼2`:50 g := homotopy2 f g
definition eq_of_homotopy2... |
4d2b5ae26ff24a8276a32ccd6d2749b5edff5ac0 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/analysis/convex/function.lean | ae15ab10353c8893db4d509057dd77db45858f0e | [
"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 | 40,405 | lean | /-
Copyright (c) 2019 Alexander Bentkamp. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Alexander Bentkamp, François Dupuis
-/
import analysis.convex.basic
import tactic.field_simp
import tactic.linarith
import tactic.ring
/-!
# Convex and concave functions
This fil... |
21ebc1c4d5cdddc4e2103c1daf438c3d6f9478e1 | fa7fdeb61bbfde3f3bfa7b0d6980c642d7e1aeb8 | /test/rewrite_search.lean | 8892651c47fc76ab3b6c221dfdb8e1a5571cbb51 | [] | no_license | khoek/lean-rewrite-search | b189bb5c29be74989584d14aef5e66b5772d706c | bb3d2643aa98b983b8c58c6ac959c14b79d3c1eb | refs/heads/master | 1,586,715,667,500 | 1,580,824,884,000 | 1,580,824,884,000 | 162,676,245 | 0 | 1 | null | 1,580,824,897,000 | 1,545,374,365,000 | Lean | UTF-8 | Lean | false | false | 13,208 | lean | -- Copyright (c) 2018 Keeley Hoek. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Keeley Hoek, Scott Morrison
import tactic.rewrite_search
namespace tactic.rewrite_search.testing
axiom foo' : [6] = [7]
axiom bar' : [[5],[5]] = [[6],[6]]
example : [[7],[6]] = [... |
620901a7bc4e1101ef660a3b5020ae56efe212a4 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/replace_tac.lean | dffc8d69aa5a48eebc04c1e24a0bf713034dcee7 | [
"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 | 925 | lean | import data.list
open nat list
example (H : false) : (1 : ℕ) + 1 = (2 : ℕ) :=
begin
replace (1 : ℕ) with (succ 0) at {1},
end
example (H : false) : (1 : ℕ) + 1 = (2 : ℕ) :=
begin
replace (1 : ℕ) with (succ 1),
end
definition foo (n : ℕ) : ℕ := n
definition bar := foo
example (h : true) : foo 2 = bar 2 :=
begin
... |
740db892a9568fe26a476372433f9e3410c0ac1a | efa51dd2edbbbbd6c34bd0ce436415eb405832e7 | /20170116_POPL/meta/has_to_string.lean | fdf34972506246c7d349961cbac5b2089101b490 | [
"Apache-2.0"
] | permissive | leanprover/presentations | dd031a05bcb12c8855676c77e52ed84246bd889a | 3ce2d132d299409f1de269fa8e95afa1333d644e | refs/heads/master | 1,688,703,388,796 | 1,686,838,383,000 | 1,687,465,742,000 | 29,750,158 | 12 | 9 | Apache-2.0 | 1,540,211,670,000 | 1,422,042,683,000 | Lean | UTF-8 | Lean | false | false | 3,671 | lean | /-
Lean tactics can also be used to synthesize code.
The tactic mk_dec_eq_instance is an example of such tactic.
Here, we implement a small tactic that synthesizes a
term of type (has_to_string Enum) for an enumeration type.
-/
open tactic expr
/- When we execute (vm_eval e), if there is an instance of (has_to_string ... |
01ca0b040c1e08c22f457e758eb1d69251de144b | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/linear_algebra/char_poly/basic.lean | b3286b85d90c9f69e32a6cb90cf9ca1a3e0639e1 | [
"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 | 3,820 | 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 tactic.apply_fun
import ring_theory.matrix_algebra
import ring_theory.polynomial_algebra
import linear_algebra.matrix.nonsingular_inverse
import tactic.squeeze... |
8632960c869d6655e91aee2d3cd899d1776e17c2 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/hott/inv_bug.hlean | aa0f1db177037639238929fd16642c5f79006197 | [
"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 | 462 | hlean | open nat
open eq.ops
inductive even : nat → Type :=
| even_zero : even zero
| even_succ_of_odd : ∀ {a}, odd a → even (succ a)
with odd : nat → Type :=
| odd_succ_of_even : ∀ {a}, even a → odd (succ a)
example : even 1 → empty :=
begin
intro He1,
cases He1 with [a, Ho0],
cases Ho0
end
example : even 3 →... |
80a66d219247eb587a423c7b3d72f4a37f8cabdc | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/number_theory/class_number/admissible_absolute_value.lean | 8324f2ed74cab4d264ee4cea640039ba3c29eaae | [
"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 | 5,750 | lean | /-
Copyright (c) 2021 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen
-/
import data.real.basic
import combinatorics.pigeonhole
import algebra.order.euclidean_absolute_value
/-!
# Admissible absolute values
This file defines a structure `absolu... |
dcd8f0765162e49c70d9e0b27506ddd27151c09e | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/measure_theory/function/conditional_expectation/condexp_L1.lean | 1f5729691234e18024555823d802c32fefcbabfe | [
"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 | 26,519 | lean | /-
Copyright (c) 2021 Rémy Degenne. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Rémy Degenne
-/
import measure_theory.function.conditional_expectation.condexp_L2
/-! # Conditional expectation in L1
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this f... |
dcd3f4ffa6658990f4b69950efec970f03a82601 | 4fa161becb8ce7378a709f5992a594764699e268 | /src/field_theory/minimal_polynomial.lean | b3d64e0da4dce97766538f8784b870af5830d8e4 | [
"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 | 8,796 | lean | /-
Copyright (c) 2019 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Johan Commelin
-/
import ring_theory.integral_closure
/-!
# Minimal polynomials
This file defines the minimal polynomial of an element x of an A-algebra B,
under the assu... |
0715e92551852103e660e008f58d2a0e3184d30f | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /test/find_unused_decl1.lean | 68a889e439b6642a4bbb72ea0d350fc7c3a00ae2 | [
"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 | 785 | lean |
import .find_unused_decl2
def this_is_unused := ()
@[main_declaration]
def main_thing := used_somewhere_else
run_cmd do
ds ← tactic.all_unused [none],
let es := [`this_is_unused],
guard (ds.keys = es) <|>
fail!"wrong declarations: {ds.keys},\nexpected: {es}"
run_cmd do
ds ← tactic.all_unused ["test/fin... |
9cc65901bce9e4aaf76fc84b22c204e0f95fe09c | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/control/functor.lean | 9c5e29d498b958261e312e9b711041cd405a229a | [] | 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 | 682 | lean | /-
Copyright (c) Luke Nelson and Jared Roesch. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Luke Nelson, Jared Roesch, Sebastian Ullrich, Leonardo de Moura
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.core
import Mathlib.Lean3Lib.init.function
import Mathli... |
a02f39fdcba5df16d5b9d364bcf9b8536360742b | 6e8de6b43162bef473b4a0bd93b71db886df98ce | /src/affine_space/classical.lean | 7e5f71c7a50b03643dd2ffe3980b37b1cd0d3189 | [
"Unlicense"
] | permissive | adamtopaz/comb_geom | 38ec6fde8d2543f56227ec50cdfb86cac6ac33c1 | e16b629d6de3fbdea54a528755e7305dfb51e902 | refs/heads/master | 1,668,613,552,530 | 1,593,199,940,000 | 1,593,199,940,000 | 269,824,442 | 6 | 0 | Unlicense | 1,593,119,545,000 | 1,591,404,975,000 | Lean | UTF-8 | Lean | false | false | 1,463 | lean | import linear_algebra.affine_space
import ..pregeom.basic
import ..projective_space.classical
import data.set
/-!
# Affine spaces
Given a vector space `V`, we define the structure of an affine space on `V`.
This is denoted by `affine_geom k V`.
# Implementation
This is constructed in the "classical" way by restrict... |
c02691fed025a57817b44cc02a7058be0ccd5fa6 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/CompilerProvokeFloatLet.lean | 13d8e5324273fed9aeda24ed44f5642b43693f9c | [
"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 | 256 | lean | set_option trace.Compiler.floatLetIn true in
def provokeFloatLet (x y : Nat) (cond : Bool) : Nat :=
let a := x ^ y
let b := x + y
let c := x - y
let dual := x * y
if cond then
match dual with
| 0 => a
| _ + 1 => c
else
b + dual
|
59861ddff6d1e4abab3d2098a6c2e3d1a275ae15 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/lean/run/parray1.lean | fe2112fdcee2d08a3de0c5b92ef96b34f3b99058 | [
"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 | 367 | lean | import Std.Data.PersistentArray
def check [BEq α] (as : List α) : Bool :=
as.toPersistentArray.foldr (.::.) [] == as
def tst1 : IO Unit := do
assert! check [1, 2, 3]
assert! check ([] : List Nat)
assert! check (List.iota 17)
assert! check (List.iota 533)
assert! check (List.iota 1000)
assert! check (Lis... |
5f65a17ce91666c59a8973bc21f5ca8d4282a740 | 6b45072eb2b3db3ecaace2a7a0241ce81f815787 | /data/int/basic.lean | 96b4fc4576ecf32776f5f13692097676b32e3c13 | [] | no_license | avigad/library_dev | 27b47257382667b5eb7e6476c4f5b0d685dd3ddc | 9d8ac7c7798ca550874e90fed585caad030bbfac | refs/heads/master | 1,610,452,468,791 | 1,500,712,839,000 | 1,500,713,478,000 | 69,311,142 | 1 | 0 | null | 1,474,942,903,000 | 1,474,942,902,000 | null | UTF-8 | Lean | false | false | 3,775 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
The integers, with addition, multiplication, and subtraction.
-/
import ..nat.sub
open nat
namespace int
theorem of_nat_add_neg_succ_of_nat_of_lt {m n : ℕ} (h : m < suc... |
35e83c8c87768b36141eb15bd350fba421df4607 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/order/monoid/cancel/defs.lean | d6c15af4ced82f3e64d3d6083d1848d82a1021e1 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 4,080 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Mario Carneiro, Johannes Hölzl
-/
import algebra.order.monoid.defs
/-!
# Ordered cancellative monoids
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> An... |
96cf90f88db92cc3bf133e36959d2647d88cf486 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/tc_loop.lean | 3bec3c7196f9285f38dc8047efa5a3c44525e001 | [
"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 | 306 | lean | open tactic
#check (do { trace "foo", trace_state } : tactic unit)
axiom Sorry {A : Sort*} : A
#check
λ (A : Sort*) (a b c d : A) (H₁ : a = b) (H₂ : c = b) (H₃ : d = c),
have a = c, by do { trace "have-expr...", trace_state, transitivity, assumption, symmetry, assumption },
show a = d, from Sorry
|
ec55336ae88ab03d81023bb55a2e76c3e514be36 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/order/bounded_order.lean | c04634f8e9f6fe68ad4c7f1072fa41600663fb89 | [
"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 | 21,730 | 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 order.lattice
import data.option.basic
/-!
# ⊤ and ⊥, bounded lattices and variants
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> https://github.com/leanprove... |
1b56c00917dc5815d252dfbd0f2e29bf5f183123 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/measure_theory/integral/divergence_theorem.lean | 03385590b4f6f342b019f00103bf0ea9282316c3 | [
"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,248 | 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 analysis.box_integral.divergence_theorem
import analysis.box_integral.integrability
import measure_theory.integral.interval_integral
import data.set.interval... |
3fc82c94c38142489b1c39eeb28c0e01e8c6fd9f | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/run/test_perm_ac1.lean | f840a14eb3acf7ff53822e767b56e1966793c492 | [
"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 | 1,653 | lean | exit
open expr decidable tactic nat
meta_definition is_poly_bin_app : expr → option name
| (app (app (app (app (const op ls) A) s) lhs) rhs) := some op
| _ := none
meta_definition is_add (e : expr) : bool :=
match (is_poly_bin_app e) with
| (some op) := to_bool (op = `add)
| none := ff
end
meta_definition pe... |
6c3760a71b79ca48c471058ebd33287d2f8e5f50 | b70447c014d9e71cf619ebc9f539b262c19c2e0b | /hott/homotopy/EM.hlean | 6d44bdfc06a8a133ace01b234af9f28b0bb7d5fd | [
"Apache-2.0"
] | permissive | ia0/lean2 | c20d8da69657f94b1d161f9590a4c635f8dc87f3 | d86284da630acb78fa5dc3b0b106153c50ffccd0 | refs/heads/master | 1,611,399,322,751 | 1,495,751,007,000 | 1,495,751,007,000 | 93,104,167 | 0 | 0 | null | 1,496,355,488,000 | 1,496,355,487,000 | null | UTF-8 | Lean | false | false | 18,508 | hlean | /-
Copyright (c) 2016 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
Eilenberg MacLane spaces
-/
import hit.groupoid_quotient homotopy.hopf homotopy.freudenthal homotopy.homotopy_group
open algebra pointed nat eq category group is_... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.