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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
a1842e1eaa4279b5d389e159b7c87a2f7d809553 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/lean/binsearch.lean | f15e091f3be0d47f4dd46371b4139a749e880459 | [
"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 | 439 | lean | def mkAssocArray : Nat → Array (Nat × Bool) → Array (Nat × Bool)
| 0, as => as
| i+1, as => mkAssocArray i (as.push (i, i % 2 == 0))
def tst (n : Nat) : IO Unit :=
do
let as := mkAssocArray n Array.empty;
IO.println as;
let as := as.qsort (fun a b => a.1 < b.1);
(2*n).forM $ fun i => do
let entry := as.binSearch ... |
e97e0199d29e8aed7dc653ef9e7c8fc7eb67e9da | 94e33a31faa76775069b071adea97e86e218a8ee | /src/measure_theory/group/fundamental_domain.lean | 5c6d9641c328de51da577380389bab4201d23ab4 | [
"Apache-2.0"
] | permissive | urkud/mathlib | eab80095e1b9f1513bfb7f25b4fa82fa4fd02989 | 6379d39e6b5b279df9715f8011369a301b634e41 | refs/heads/master | 1,658,425,342,662 | 1,658,078,703,000 | 1,658,078,703,000 | 186,910,338 | 0 | 0 | Apache-2.0 | 1,568,512,083,000 | 1,557,958,709,000 | Lean | UTF-8 | Lean | false | false | 17,351 | lean | /-
Copyright (c) 2021 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov
-/
import measure_theory.group.action
import measure_theory.group.pointwise
import measure_theory.integral.set_integral
/-!
# Fundamental domain of a group acti... |
4c7e7b81ee628d1c2f8adc2036f9972849185494 | abc24f6c7fc917103329a1d2b75463d93511f4ab | /src/integrals.lean | b250ff3c71da9897dd707a2fbc6e74c0e87a3b7f | [] | no_license | mmasdeu/euler | 5073bb6b747aaca1a95692027de1f390b7648c28 | a323d777dee611f2a06cc81e2f2567cd9522a381 | refs/heads/main | 1,682,109,127,673 | 1,620,655,192,000 | 1,620,655,192,000 | 323,932,638 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 14,188 | lean | import tactic
import measure_theory.interval_integral
import measure_theory.lebesgue_measure
import measure_theory.set_integral
import analysis.calculus.deriv
import analysis.special_functions.exp_log
import analysis.special_functions.trigonometric
import data.finset
noncomputable theory
open_locale classical
open_loc... |
9e9dc1c379262ed2ae7321a5307331f7bcd24f17 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/def_complete_bug.lean | 1a1b7111e3f7bfb77b8380c8667543a6425bf57f | [
"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 | 400 | lean | definition g : list nat → list nat → nat
| [] (y::ys) := y
| [] ys := 0
| (x1::x2::xs) ys := g xs ys
| (x::xs) (y::ys) := g xs ys + y
| (x::xs) [] := g xs []
#print g._main.equations._eqn_1
#print g._main.equations._eqn_2
#print g._main.equations._eqn_3
#print g._main.equat... |
c6f68d16271aa51a0fb6c85142dd1e605f052590 | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/topology/sheaves/sheaf_condition/pairwise_intersections.lean | 098146619b7d0fb1b7852efcb38dada29c0e40b8 | [
"Apache-2.0"
] | permissive | waynemunro/mathlib | e3fd4ff49f4cb43d4a8ded59d17be407bc5ee552 | 065a70810b5480d584033f7bbf8e0409480c2118 | refs/heads/master | 1,693,417,182,397 | 1,634,644,781,000 | 1,634,644,781,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 13,948 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import topology.sheaves.sheaf
import category_theory.limits.preserves.basic
import category_theory.category.pairwise
/-!
# Equivalent formulations of the sheaf cond... |
7111d119b70d3dce1d31535a6257e7ffbda69e87 | 27a31d06bcfc7c5d379fd04a08a9f5ed3f5302d4 | /src/Lean/Elab/AuxDef.lean | 33cce375b0137664e18061fb56184e1469eae66d | [
"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 | joehendrix/lean4 | 0d1486945f7ca9fe225070374338f4f7e74bab03 | 1221bdd3c7d5395baa451ce8fdd2c2f8a00cbc8f | refs/heads/master | 1,640,573,727,861 | 1,639,662,710,000 | 1,639,665,515,000 | 198,893,504 | 0 | 0 | Apache-2.0 | 1,564,084,645,000 | 1,564,084,644,000 | null | UTF-8 | Lean | false | false | 1,363 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner
-/
import Lean.Elab.Command
namespace Lean.Elab.Command
open Lean.Parser.Command
open Lean.Parser.Term
/--
Declares an auxiliary definition with an automatically... |
975b74ae52bcaec18ec9fdd1b894b59d8c8935b2 | ea916b7f42baf59c02ca82e274a87b3e45397968 | /src/super/eqn_lemmas.lean | 84c982a7c68996009f71505a5534bcc44f2a4ea1 | [] | no_license | robertylewis/super2 | 2926383b166e43ebd815b81ae8fba976393a160c | 8ba522fd609d25752cd3d9b478bc48b6453e3c1e | refs/heads/master | 1,670,062,676,962 | 1,597,795,530,000 | 1,597,795,530,000 | 289,744,671 | 0 | 0 | null | 1,598,207,476,000 | 1,598,207,476,000 | null | UTF-8 | Lean | false | false | 2,318 | lean | import super.utils super.clause
open tactic expr
namespace super
meta def get_eqn_lemma_clauses (n : name) : tactic (list clause) := do
els ← get_eqn_lemmas_for tt n,
els.mmap clause.of_const
meta def mk_inst_equations_core : expr → expr → tactic (list expr) | lhs rhs := do
type ← infer_type lhs,
(type_args, tgt) ←... |
93db1b0df1690c9ee5dd8bba49d0b9ccb3c8bb80 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/compiler/closure_bug5.lean | 41a8aea45ab61e7300ba2e1080b06217d81c585a | [
"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 | 540 | lean | def f (x : Nat) : Nat × (Nat → String) :=
let x1 := x + 1;
let x2 := x + 2;
let x3 := x + 3;
let x4 := x + 4;
let x5 := x + 5;
let x6 := x + 6;
let x7 := x + 7;
let x8 := x + 8;
let x9 := x + 9;
let x10 := x + 10;
let x11 := x + 11;
let x12 := x + 12;
let x13 := x + 13;
let x14 := x + 14;
let x15 := x + 15;
let x16 := ... |
ac258b074d0eb33eb29fea8549288309f26e331e | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/algebra/group/hom_auto.lean | 5123eefd60b2242e9f58606a76a4b3b1b3fba537 | [] | 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 | 40,409 | lean | /-
Copyright (c) 2018 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Kevin Buzzard, Scott Morrison, Johan Commelin, Chris Hughes,
Johannes Hölzl, Yury Kudryashov
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mat... |
53c7ad3bbe93334ce7abc52730af36387f9d6f62 | 592ee40978ac7604005a4e0d35bbc4b467389241 | /Library/generated/mathscheme-lean/Ringoid1Sig.lean | 07549a680f042324e3ead30195e996cd4cc280f0 | [] | no_license | ysharoda/Deriving-Definitions | 3e149e6641fae440badd35ac110a0bd705a49ad2 | dfecb27572022de3d4aa702cae8db19957523a59 | refs/heads/master | 1,679,127,857,700 | 1,615,939,007,000 | 1,615,939,007,000 | 229,785,731 | 4 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,531 | lean | import init.data.nat.basic
import init.data.fin.basic
import data.vector
import .Prelude
open Staged
open nat
open fin
open vector
section Ringoid1Sig
structure Ringoid1Sig (A : Type) : Type :=
(times : (A → (A → A)))
(one : A)
(plus : (A → (A → A)))
open Ringoid1Sig
structure Sig (... |
302d0bfcdc68aa0324a0ffa8ff1138d49df91c72 | ee8cdbabf07f77e7be63a449b8483ce308d37218 | /lean/src/valid/mathd-algebra-22.lean | 5bfa8df6a5fb52a8e84a70698c455334bd8ddff6 | [
"MIT",
"Apache-2.0"
] | permissive | zeta1999/miniF2F | 6d66c75d1c18152e224d07d5eed57624f731d4b7 | c1ba9629559c5273c92ec226894baa0c1ce27861 | refs/heads/main | 1,681,897,460,642 | 1,620,646,361,000 | 1,620,646,361,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 972 | lean | /-
Copyright (c) 2021 OpenAI. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kunhao Zheng
-/
import data.real.basic
import analysis.special_functions.exp_log
lemma log_inj_on_pos : set.inj_on real.log (set.Ioi 0) :=
real.strict_mono_incr_on_log.inj_on
lemma eq_one_o... |
abf0cbc67bc35b255d04c8118da604c965e56be9 | e030b0259b777fedcdf73dd966f3f1556d392178 | /library/init/coe.lean | 53c67b496bfd9085dc232d764ca080596e80460f | [
"Apache-2.0"
] | permissive | fgdorais/lean | 17b46a095b70b21fa0790ce74876658dc5faca06 | c3b7c54d7cca7aaa25328f0a5660b6b75fe26055 | refs/heads/master | 1,611,523,590,686 | 1,484,412,902,000 | 1,484,412,902,000 | 38,489,734 | 0 | 0 | null | 1,435,923,380,000 | 1,435,923,379,000 | null | UTF-8 | Lean | false | false | 5,383 | 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
-/
/-
The elaborator tries to insert coercions automatically.
Only instances of has_coe type class are considered in the process.
Lean also provides a "lifti... |
b85e9b8ca365af7e1375ebfa5256eb02f43dc207 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/793a.lean | b23173eef5854dcc55b4cf78091e1ecd1a39d57c | [
"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 | 195 | lean | import data.rat
open rat
check (4.0:rat)
check (2.3:rat)
check (1.00:rat)
check (10.213:rat)
check -(0.3:rat)
check (10.213:rat)
check (2.3:rat)
check (1.0:rat)
eval (λ v, (1.0:rat)) (2:nat)
|
4b32fa97fbb60b70b300eefbe8f6d0be87aafcf2 | 3dd1b66af77106badae6edb1c4dea91a146ead30 | /tests/lean/run/nat_bug.lean | 7d5db5dc55048db0385fcb7912a85aa33e51c9e5 | [
"Apache-2.0"
] | permissive | silky/lean | 79c20c15c93feef47bb659a2cc139b26f3614642 | df8b88dca2f8da1a422cb618cd476ef5be730546 | refs/heads/master | 1,610,737,587,697 | 1,406,574,534,000 | 1,406,574,534,000 | 22,362,176 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 865 | lean | import logic decidable
using decidable
inductive nat : Type :=
| zero : nat
| succ : nat → nat
theorem induction_on {P : nat → Prop} (a : nat) (H1 : P zero) (H2 : ∀ (n : nat) (IH : P n), P (succ n)) : P a
:= nat_rec H1 H2 a
definition pred (n : nat) := nat_rec zero (fun m x, m) n
theorem pred_zero : pred zero = zero... |
7d87d786c255de97fb1a88b26b85d1a2da3becc6 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/analysis/normed_space/weak_dual.lean | 84d4943e49221ede46a46db57e24c53af091be46 | [
"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 | 7,016 | lean | /-
Copyright (c) 2021 Kalle Kytölä. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kalle Kytölä
-/
import topology.algebra.module.weak_dual
import analysis.normed_space.dual
import analysis.normed_space.operator_norm
/-!
# Weak dual of normed space
Let `E` be a norme... |
797e9becfd1446e8e60ac96fe95ed3eff8220fcb | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/tst11.lean | 25676cc6161164b1d999e36cad5f0083f51ce103 | [
"Apache-2.0"
] | permissive | codyroux/lean0.1 | 1ce92751d664aacff0529e139083304a7bbc8a71 | 0dc6fb974aa85ed6f305a2f4b10a53a44ee5f0ef | refs/heads/master | 1,610,830,535,062 | 1,402,150,480,000 | 1,402,150,480,000 | 19,588,851 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 353 | lean | import tactic
definition xor (x y : Bool) : Bool := (not x) = y
infixr 50 ⊕ : xor
print xor true false
variable a : Bool
print a ⊕ a ⊕ a
check @subst
theorem EM2 (a : Bool) : a \/ (not a) :=
case (fun x : Bool, x \/ (not x)) (by simp) (by simp) a
check EM2
check EM2 a
theorem xor_neq (a b : Bool) : (a ⊕ b) ↔ ((¬ a) ... |
34ef65aa1490144bd7f7d81f811c33df5e860927 | 86f6f4f8d827a196a32bfc646234b73328aeb306 | /examples/logic/unnamed_2254.lean | 96431011bb44fd9e2b52aa940a5e0c69dd82696f | [] | 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 | 181 | lean | import data.real.basic
-- BEGIN
example {a : ℝ} (h : 1 < a) : a < a * a :=
begin
convert (mul_lt_mul_right _).2 h,
{ rw [one_mul] },
exact lt_trans zero_lt_one h
end
-- END |
2204df65d2f134558c9a0dc2a0d3e71b4824558f | f0f12a5b81106a798deda31dca238c11997a605e | /Playlean4/Group/Action.lean | 1beb424bd49065387d8a42ae0dd159595369decd | [
"MIT"
] | permissive | thejohncrafter/playlean4 | fe7119d492aab07048f78333eeda9862f6471740 | 81df180a71b8d84d0f45bc98db367aad203cf5df | refs/heads/master | 1,683,152,783,765 | 1,621,879,382,000 | 1,621,879,382,000 | 366,563,501 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,813 | lean |
import Playlean4.Group.Basic
import Playlean4.Group.Subgroup
namespace Group
open Group
section
variable (G : Type) (law : G → G → G) [grp : Group G law]
local infixl:70 " * " => id' law
@[appUnexpander id'] def normal.UnexpandGMul : Lean.PrettyPrinter.Unexpander
| `(id' law $x $y) => `($x * $y)
| _ => throw ... |
73d83643785de2f90bb9257f28c6e640b519498a | 6f510b1ed724f95a55b7d26a8dcd13e1264123dd | /src/auto.lean | 5ec70e910b9d3b95e91c51e0953ec72f3678340a | [] | no_license | jcommelin/oberharmersbach2019 | adaf2e54ba4eff7c178c933978055ff4d6b0593b | d2cdf780a10baa8502a9b0cae01c7efa318649a6 | refs/heads/master | 1,587,558,516,731 | 1,550,558,213,000 | 1,550,558,213,000 | 170,372,753 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 476 | lean | import tactic.interactive tactic.tidy
namespace tactic
namespace interactive
open interactive interactive.types
@[tidy] meta def auto_aux : tactic unit :=
`[solve_by_elim [fact_ne_zero
,nat.dvd_right_of_dvd_add_of_dvd_left
,prime.not_dvd_one
,prime.pos
,... |
54b452db5cf1d47ff9a9cf7001d4b5a687e8eebc | df561f413cfe0a88b1056655515399c546ff32a5 | /4-power-world/l4.lean | 1b10870c7e5905a4cd678783ae96e3173db24eb9 | [] | no_license | nicholaspun/natural-number-game-solutions | 31d5158415c6f582694680044c5c6469032c2a06 | 1e2aed86d2e76a3f4a275c6d99e795ad30cf6df0 | refs/heads/main | 1,675,123,625,012 | 1,607,633,548,000 | 1,607,633,548,000 | 318,933,860 | 3 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 138 | lean | lemma one_pow (m : mynat) : (1 : mynat) ^ m = 1 :=
begin
induction m with k Pk,
exact pow_zero 1,
rw pow_succ,
rw Pk,
exact one_mul 1,
end |
82b27f9ff482a2703677b05cf1d3fdf5004c6ab8 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/topology/sheaves/forget.lean | 4d1543b4af09e8a4d3b102d88449ae2e6e003a18 | [
"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,273 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.limits.preserves.shapes.products
import topology.sheaves.sheaf_condition.sites
/-!
# Checking the sheaf condition on the underlying presheaf o... |
a41143798242637ada04a269d301bd13a49365c5 | e0f9ba56b7fedc16ef8697f6caeef5898b435143 | /src/number_theory/sum_four_squares.lean | 429d200e7fbcf8d3b3076cbc56dd2808d02865c2 | [
"Apache-2.0"
] | permissive | anrddh/mathlib | 6a374da53c7e3a35cb0298b0cd67824efef362b4 | a4266a01d2dcb10de19369307c986d038c7bb6a6 | refs/heads/master | 1,656,710,827,909 | 1,589,560,456,000 | 1,589,560,456,000 | 264,271,800 | 0 | 0 | Apache-2.0 | 1,589,568,062,000 | 1,589,568,061,000 | null | UTF-8 | Lean | false | false | 11,939 | lean | /-
Copyright (c) 2019 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
## Lagrange's four square theorem
The main result in this file is `sum_four_squares`,
a proof that every natural number is the sum of four square numbers.
# Implementatio... |
aa7fdf7004d9a2f8db84e3df1f66d487041184ee | 0c1546a496eccfb56620165cad015f88d56190c5 | /tests/lean/run/whenIO.lean | 9e36074a4e0cbc8260b8026c0f65750b5d467bd4 | [
"Apache-2.0"
] | permissive | Solertis/lean | 491e0939957486f664498fbfb02546e042699958 | 84188c5aa1673fdf37a082b2de8562dddf53df3f | refs/heads/master | 1,610,174,257,606 | 1,486,263,620,000 | 1,486,263,620,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 177 | lean | import system.io
definition when (b : bool) (a : io unit) : io unit :=
if b = tt then a else return ()
vm_eval when tt (put_str "hello\n")
vm_eval when ff (put_str "error\n")
|
7329b538cae31a9f996d77e11458e8d0f6a9fed0 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /test/conv/apply_congr.lean | 7d218a566936caafb49167916bdcf5142ea8286f | [
"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 | 3,166 | lean | /-
Copyright (c) 2019 Lucas Allen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Lucas Allen, Scott Morrison
-/
import algebra.big_operators.basic
import data.finsupp.basic
import tactic.converter.apply_congr
import tactic.interactive
example (f g : ℤ → ℤ) (S : fins... |
4858702ddb7c796a11f557a4c9c0e6f4e0279700 | af6139dd14451ab8f69cf181cf3a20f22bd699be | /library/init/meta/converter.lean | ceba133b0907058377f4bae891cf3ed5c7827df5 | [
"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 | 8,940 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
Converter monad for building simplifiers.
-/
prelude
import init.meta.tactic init.meta.simp_tactic
import init.meta.congr_lemma init.meta.match_tactic
open ta... |
c5b8ebfbaeb1f15c418284323058e2e2b02b3558 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/number_theory/cyclotomic/rat.lean | d02a490ee2967b20eebea6052c8bc5cc7a4b5569 | [
"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 | 7,927 | lean | /-
Copyright (c) 2022 Riccardo Brasca. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Riccardo Brasca
-/
import number_theory.cyclotomic.discriminant
import ring_theory.polynomial.eisenstein
/-!
# Ring of integers of `p ^ n`-th cyclotomic fields
We compute the ring o... |
f5718712f47c22adf2c1ca3622bc451521106088 | 1b8f093752ba748c5ca0083afef2959aaa7dace5 | /src/category_theory/limits/terminal.lean | 6bd176d60e117f91012a77e7365a562446b74bee | [] | no_license | khoek/lean-category-theory | 7ec4cda9cc64a5a4ffeb84712ac7d020dbbba386 | 63dcb598e9270a3e8b56d1769eb4f825a177cd95 | refs/heads/master | 1,585,251,725,759 | 1,539,344,445,000 | 1,539,344,445,000 | 145,281,070 | 0 | 0 | null | 1,534,662,376,000 | 1,534,662,376,000 | null | UTF-8 | Lean | false | false | 3,031 | lean | -- Copyright (c) 2018 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Scott Morrison, Reid Barton, Mario Carneiro
import category_theory.limits.shape
import category_theory.filtered
open category_theory
namespace category_theory.limits
universe... |
b892ddf8dad614e04de01b5e1de7517a78a730fd | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/linear_algebra/multilinear.lean | beb9f9970a0b2bd7bf6a1b0ea2002157c9353ecf | [
"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 | 33,814 | lean | /-
Copyright (c) 2020 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import linear_algebra.basic
import tactic.omega
import data.fintype.sort
/-!
# Multilinear maps
We define multilinear maps as maps from `Π(i : ι), M₁ i` to `M... |
9b60307381bedea9d5960fdd18e41f4b0c3a7053 | 2eab05920d6eeb06665e1a6df77b3157354316ad | /src/topology/algebra/uniform_ring.lean | 799c3a73ffe61039d5743a00d816d0a2978bf242 | [
"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 | 7,612 | 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
Theory of topological rings with uniform structure.
-/
import topology.algebra.group_completion
import topology.algebra.ring
open classical set filter ... |
0ce343bd92b0e318700312275eab10392d95ef1a | efce24474b28579aba3272fdb77177dc2b11d7aa | /src/homotopy_theory/formal/cofibrations/arrow.lean | 3965a18b07b986b64c1fb0c0c741f78ace1f800c | [
"Apache-2.0"
] | permissive | rwbarton/lean-homotopy-theory | cff499f24268d60e1c546e7c86c33f58c62888ed | 39e1b4ea1ed1b0eca2f68bc64162dde6a6396dee | refs/heads/lean-3.4.2 | 1,622,711,883,224 | 1,598,550,958,000 | 1,598,550,958,000 | 136,023,667 | 12 | 6 | Apache-2.0 | 1,573,187,573,000 | 1,528,116,262,000 | Lean | UTF-8 | Lean | false | false | 4,172 | lean | import .precofibration_category
universes v u
namespace homotopy_theory.cofibrations
open category_theory category_theory.category
open precofibration_category
variables {C : Type u} [category.{v} C] [precofibration_category.{v} C]
-- These are the cofibrations in the arrow category of C with the "projective" struc... |
b9a8fbc409fd27d086491b19ce062bc57ef5d81c | c3e8fac5ab7ca328e55bccf82a0207a97f96678c | /lean/src/ast.lean | 78694345d070a77bede9b6dbb00d4975e33a4a72 | [
"Unlicense"
] | permissive | Rotsor/brainfuck | 941bb33862ce3e9d61f0454db5ca02942f4b5775 | 3e6f30f298b8ba76d0bc71b8b5a47cedaf2f0b97 | refs/heads/master | 1,619,718,778,100 | 1,532,913,653,000 | 1,532,913,653,000 | 121,682,141 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 397 | lean | namespace brainfuck
namespace ast
-- AST
inductive instruction : Type
| left : instruction
| right : instruction
| plus : instruction
| minus : instruction
| print : instruction
| ask : instruction
| loop : list instruction -> instruction
def program := list instruction
i... |
26da693c562f63734c1822e505f6ce544a57772b | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/topology/algebra/group.lean | 028db113de07603fede833c5438a904e03b4c214 | [
"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 | 19,285 | 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 order.filter.pointwise
import group_theory.quotient_group
import topology.algebra.monoid
import topology.homeomorph
/-!
# The... |
e4ae4541bfd3d2f578b9dfd984876f8aadb6b367 | 0c0281448f624a53333195786d9730b1592ee3ac | /Automation.lean | c686933cde5aa76f28c7fb0ffc439b79b0232d91 | [] | no_license | kindaro/lean_study | ce788f8dd1adaef2e12d6f94ab88685da34b0877 | 8219865eb9f068f132fe4ce0ae4a2fb76b1f5865 | refs/heads/master | 1,693,155,825,536 | 1,634,312,849,000 | 1,634,312,849,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,274 | lean | open tactic
meta def map: (expr → tactic unit) → list expr → tactic unit
| f [] := failed
| f (x :: xs) := f x <|> map f xs
meta def size : expr → nat
| (expr.app f a) := size f + size a
| _ := 1
meta def sort_of_identifier: expr → string
| (expr.var nat) := "var"
| (expr.sort level) := "sort"
| (expr.const n... |
2e7fd1ce85a698c3d235b2d9e11e458486a10a53 | 95dcf8dea2baf2b4b0a60d438f27c35ae3dd3990 | /src/topology/algebra/uniform_ring.lean | 0837d618262f344a04cb12dc65dbab665b93f438 | [
"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 | 6,584 | 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
Theory of topological rings with uniform structure.
-/
import topology.algebra.group_completion topology.algebra.ring
open classical set lattice filte... |
a066511cd5acd9237d906a210f8c2b3e46a05183 | 2c096fdfecf64e46ea7bc6ce5521f142b5926864 | /src/Lean/Meta/DiscrTree.lean | 53d67e819990400965d1ef1c0be38a5706654728 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | Kha/lean4 | 1005785d2c8797ae266a303968848e5f6ce2fe87 | b99e11346948023cd6c29d248cd8f3e3fb3474cf | refs/heads/master | 1,693,355,498,027 | 1,669,080,461,000 | 1,669,113,138,000 | 184,748,176 | 0 | 0 | Apache-2.0 | 1,665,995,520,000 | 1,556,884,930,000 | Lean | UTF-8 | Lean | false | false | 23,389 | 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.WHNF
import Lean.Meta.DiscrTreeTypes
namespace Lean.Meta.DiscrTree
/-!
(Imperfect) discrimination trees.
We use a hybrid representatio... |
862248aedf43eb2184963ce0b39b8677117c5a2d | 947b78d97130d56365ae2ec264df196ce769371a | /stage0/src/Lean/Meta/Tactic/Clear.lean | d0b5f966cab07dd2b5a22dfc7a994e01be4faf51 | [
"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 | 1,459 | 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.Tactic.Util
namespace Lean
namespace Meta
def clear (mvarId : MVarId) (fvarId : FVarId) : MetaM MVarId :=
withMVarContext mvarId $ do
c... |
262b8dce8cb4289aa3c0825da4f6c3606f7c40cf | 315b4184091c669ce8e5e07f9b24473c4bcfbaaf | /library/init/meta/tactic.lean | 08db2d815ecf8a3a24c4a3b05f7768325914d2c8 | [
"Apache-2.0"
] | permissive | haraldschilly/lean | 78404910ad4c258cdf84e0509e4348c1525e57a9 | d01e2d7ae8250e8f69139d8cb37950079e76ca9d | refs/heads/master | 1,619,977,395,095 | 1,517,501,044,000 | 1,517,940,670,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 51,648 | 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.function init.data.option.basic init.util
import init.category.combinators init.category.monad init.category.alternative init.category.m... |
53aab682472b2621f8bfe96511472fc166c26fb9 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/number_theory/padics/padic_numbers.lean | c11594bed6308881be932742cf97ae955e48e093 | [
"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 | 40,177 | 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 analysis.normed_space.basic
import number_theory.padics.padic_norm
/-!
# p-adic numbers
This file defines the p-adic numbers (rationals) `ℚ_p` as
the compl... |
6694d12b8ae7337359d44f77a40616e33dffaa54 | 947b78d97130d56365ae2ec264df196ce769371a | /tests/lean/typeMismatch.lean | e5c53a1fd2ef505af49a935e82b8f12908e667fb | [
"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 | 197 | lean | import Lean
new_frontend
-- Test type mismatch error messages for "liftable" methods
def test (x : Nat) : IO Nat :=
IO.println ""
open Lean
def test (x : Expr) : MetaM Unit :=
Meta.isDefEq x x
|
bf68b82d735f89cf6e846181270b876633464760 | de91c42b87530c3bdcc2b138ef1a3c3d9bee0d41 | /old/not_in_use/classical_acceleration.lean | be57c488d29746fc24c811aef2766e51bbe13fe7 | [] | no_license | kevinsullivan/lang | d3e526ba363dc1ddf5ff1c2f36607d7f891806a7 | e9d869bff94fb13ad9262222a6f3c4aafba82d5e | refs/heads/master | 1,687,840,064,795 | 1,628,047,969,000 | 1,628,047,969,000 | 282,210,749 | 0 | 1 | null | 1,608,153,830,000 | 1,595,592,637,000 | Lean | UTF-8 | Lean | false | false | 493 | lean | import ...phys.src.classical_acceleration
import .classical_velocity
import .classical_time
namespace lang.classicalAcceleration
structure var : Type :=
mk :: (num : ℕ)
def varEq : var → var → bool
| v1 v2 := v1.num=v2.num
def env := (var → classicalAcceleration)
inductive expr : Type
| lit (v : classicalAccelerat... |
c4f9deebbda04ac7b6ef616ad4524e2d9d0e3359 | 38ee9024fb5974f555fb578fcf5a5a7b71e669b5 | /Mathlib/Init/Logic.lean | 31fc739dc4df71ecb27a6021eac35fb76b779296 | [
"Apache-2.0"
] | permissive | denayd/mathlib4 | 750e0dcd106554640a1ac701e51517501a574715 | 7f40a5c514066801ab3c6d431e9f405baa9b9c58 | refs/heads/master | 1,693,743,991,894 | 1,636,618,048,000 | 1,636,618,048,000 | 373,926,241 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 22,965 | 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, Jeremy Avigad, Floris van Doorn
-/
import Mathlib.Tactic.Basic
import Mathlib.Tactic.Ext
-- Workaround for not being able to add ext lemmas from other modul... |
2e287c5094a035f63db0c93d9ca5f9d25cb73abf | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /src/Lean/Meta/Tactic/Subst.lean | 1ea91d40aa010bb9229481ceaa095f68270ba9c5 | [
"Apache-2.0"
] | permissive | WojciechKarpiel/lean4 | 7f89706b8e3c1f942b83a2c91a3a00b05da0e65b | f6e1314fa08293dea66a329e05b6c196a0189163 | refs/heads/master | 1,686,633,402,214 | 1,625,821,189,000 | 1,625,821,258,000 | 384,640,886 | 0 | 0 | Apache-2.0 | 1,625,903,617,000 | 1,625,903,026,000 | null | UTF-8 | Lean | false | false | 8,173 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Meta.AppBuilder
import Lean.Meta.MatchUtil
import Lean.Meta.Tactic.Util
import Lean.Meta.Tactic.Revert
import Lean.Meta.Tactic.Assert
import Lea... |
91d3ffa4a0d7f60f4aebbff259ff1226a1fec9ce | ac49064e8a9a038e07cf5574b4fccd8a70d115c8 | /hott/algebra/group_theory.hlean | 87aae6fa3cef69f87e5472b71bc31ab5b1982cd5 | [
"Apache-2.0"
] | permissive | Bolt64/lean2 | 7c75016729569e04a3f403c7a4fc7c1de4377c9d | 75fd8162488214a959dbe3303a185cbbb83f60f9 | refs/heads/master | 1,611,290,445,156 | 1,493,763,922,000 | 1,493,763,922,000 | 81,566,307 | 0 | 0 | null | 1,486,732,167,000 | 1,486,732,167,000 | null | UTF-8 | Lean | false | false | 19,284 | hlean | /-
Copyright (c) 2015 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
Basic group theory
-/
import algebra.category.category algebra.bundled .homomorphism
open eq algebra pointed function is_trunc pi equiv is_equiv
set_option class.... |
3e318620f40beb2feb8e08912cdc24cdf50e5b90 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /src/Lean/Elab/Deriving/SizeOf.lean | c60f7c43fc0171603190f47312c37c410530bf1e | [
"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 | 817 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Meta.SizeOf
import Lean.Elab.Deriving.Basic
/-
Remark: `SizeOf` instances are automatically generated. We add support for `deriving instance` f... |
bec6a04d487216585759567d18f61653e5e9d781 | 3f7026ea8bef0825ca0339a275c03b911baef64d | /src/ring_theory/principal_ideal_domain.lean | ae80d1dd96009adc61bacbcc106552321456146e | [
"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 | 6,723 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Chris Hughes, Morenikeji Neri
-/
import algebra.euclidean_domain
import ring_theory.ideals ring_theory.noetherian ring_theory.unique_factorization_domain
variables {α : Type*}
open set... |
7cee543bf68d7dbfc5878ef611770a3e8930c9a5 | ac49064e8a9a038e07cf5574b4fccd8a70d115c8 | /hott/init/path.hlean | 333e381cbcda4386804df2d7a3bcd987ed2cb8a6 | [
"Apache-2.0"
] | permissive | Bolt64/lean2 | 7c75016729569e04a3f403c7a4fc7c1de4377c9d | 75fd8162488214a959dbe3303a185cbbb83f60f9 | refs/heads/master | 1,611,290,445,156 | 1,493,763,922,000 | 1,493,763,922,000 | 81,566,307 | 0 | 0 | null | 1,486,732,167,000 | 1,486,732,167,000 | null | UTF-8 | Lean | false | false | 30,531 | hlean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Jakob von Raumer, Floris van Doorn
Ported from Coq HoTT
-/
prelude
import .function .tactic
open function eq
/- Path equality -/
namespace eq
variables {A ... |
e29ef65b0c01e610e85d446d2a0b9ec93b4d372b | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/order/omega_complete_partial_order.lean | 38b71e8c1dc8e3cb2615aa7c155e3d127b745841 | [
"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 | 27,756 | lean | /-
Copyright (c) 2020 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
-/
import control.monad.basic
import data.part
import order.hom.order
import data.nat.order.basic
import tactic.wlog
/-!
# Omega Complete Partial Orders
> THIS FILE IS SYNCH... |
e3177f74fd11016a2726a080f95d99b8ef803d12 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/set_theory/game/birthday.lean | c9b2642f8e8b8d197536c9b0b1600500c88f3935 | [
"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,761 | lean | /-
Copyright (c) 2022 Violeta Hernández Palacios. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Violeta Hernández Palacios
-/
import set_theory.game.ordinal
import set_theory.ordinal.natural_ops
/-!
# Birthdays of games
The birthday of a game is an ordinal that rep... |
b645fe38cb8e1010b86d90eca137aa6c5ebe4272 | 26bff4ed296b8373c92b6b025f5d60cdf02104b9 | /tests/lean/run/rewrite5.lean | 826274e78c202fd65ea8c10bd164ea56fbdfb282 | [
"Apache-2.0"
] | permissive | guiquanz/lean | b8a878ea24f237b84b0e6f6be2f300e8bf028229 | 242f8ba0486860e53e257c443e965a82ee342db3 | refs/heads/master | 1,526,680,092,098 | 1,427,492,833,000 | 1,427,493,281,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 189 | lean | import algebra.group
open algebra
variable {A : Type}
variable [s : group A]
include s
theorem mul.right_inv (a : A) : a * a⁻¹ = 1 :=
by rewrite ⟨-{a}inv_inv at {1}, mul.left_inv⟩
|
ce677bf57f0cf822eb339a8ec3fa4622ad741188 | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/computability/halting.lean | f59bc553182b15be67328377698ccae69face1cf | [
"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 | 13,263 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
More partial recursive functions using a universal program;
Rice's theorem and the halting problem.
-/
import computability.partrec_code
open encodable denumerable
nam... |
16a57acf1f86428813e3916e71dfe6fbe2d8e35c | 957a80ea22c5abb4f4670b250d55534d9db99108 | /library/init/data/nat/bitwise.lean | 9d84ee8fbaec60223abc780bb505b154d473feb2 | [
"Apache-2.0"
] | permissive | GaloisInc/lean | aa1e64d604051e602fcf4610061314b9a37ab8cd | f1ec117a24459b59c6ff9e56a1d09d9e9e60a6c0 | refs/heads/master | 1,592,202,909,807 | 1,504,624,387,000 | 1,504,624,387,000 | 75,319,626 | 2 | 1 | Apache-2.0 | 1,539,290,164,000 | 1,480,616,104,000 | C++ | UTF-8 | Lean | false | false | 10,784 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
-/
prelude
import init.data.nat.lemmas init.meta.well_founded_tactics
universe u
namespace nat
def bodd_div2 : ℕ → bool × ℕ
| 0 := (ff, 0)
| (succ n) :=... |
fd4af76d189b272330c39a39e4eea44d7ad8ec50 | f618aea02cb4104ad34ecf3b9713065cc0d06103 | /src/set_theory/cardinal.lean | ce502c6e77c3ae555cdec8164778af9d41a33924 | [
"Apache-2.0"
] | permissive | joehendrix/mathlib | 84b6603f6be88a7e4d62f5b1b0cbb523bb82b9a5 | c15eab34ad754f9ecd738525cb8b5a870e834ddc | refs/heads/master | 1,589,606,591,630 | 1,555,946,393,000 | 1,555,946,393,000 | 182,813,854 | 0 | 0 | null | 1,555,946,309,000 | 1,555,946,308,000 | null | UTF-8 | Lean | false | false | 30,853 | 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, Mario Carneiro
Cardinal arithmetic.
Cardinals are represented as quotient over equinumerous types.
-/
import data.set.finite data.quot logic.function set_theory.schro... |
57df6ad0739da496aa1bb6f464bd991c4fe5971f | 491068d2ad28831e7dade8d6dff871c3e49d9431 | /hott/hit/quotient.hlean | 725b2670a3b6b190d3d2e97082bb3637e66e8c22 | [
"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,374 | 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
Quotients. This is a quotient without truncation for an arbitrary type-valued binary relation.
See also .set_quotient
-/
/-
The hit quotient is primitive, declar... |
32378ff62a0090af1b7086c33aa659fc7e4d6163 | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /src/category_theory/Fintype.lean | 2cb58f1d5de2a5da7ab77b6b18b66719c6394378 | [
"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 | 4,298 | lean | /-
Copyright (c) 2020 Adam Topaz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta, Adam Topaz
-/
import data.fintype.basic
import data.fin
import category_theory.concrete_category.bundled
import category_theory.concrete_category
import category_theory.full... |
13b36f1019efc9707690664dce08b32642accd38 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /test/ext.lean | b876a46d5e8bce93328505ebe49a78ea17f1929c | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 3,723 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
-/
import tactic.ext
import tactic.solve_by_elim
import data.stream.init
import data.finset.basic
import tactic.rcases
section ext_trace_test
setup_tactic_parser
namespace ... |
9e264fe37bc6b2f939fdbbc8bdb07be2be6b5e27 | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /tests/lean/run/nat_bug2.lean | f5db9e93e646b65d9ce3a989e6842ff8bbe1407f | [
"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 | 698 | lean | import standard
using num eq_proofs
inductive nat : Type :=
zero : nat,
succ : nat → nat
namespace nat
definition plus (x y : nat) : nat
:= nat.rec x (λn r, succ r) y
definition to_nat [coercion] (n : num) : nat
:= num.rec zero (λn, pos_num.rec (succ zero) (λn r, plus r (plus r (succ zero))) (λn r, plus r r) n) n
def... |
835133b76a4c0906a025330130fcee7ec1a6cfa1 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/1026.lean | c9b15c96d631e847cf0491af4f965542b2574a6d | [
"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 | 235 | lean | def foo (n : Nat) : Nat :=
if n = 0 then 0 else
let x := n - 1
have := match () with | _ => trivial
foo x
termination_by _ n => n
decreasing_by sorry
theorem ex : foo 0 = 0 := by
unfold foo
sorry
#check foo._unfold
|
c6a32a5642a99960729ad1c0e768c85fc39e56d6 | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/data/complex/exponential.lean | ebef798d6565da0edcd39b34216dd3fe4f667d0f | [
"Apache-2.0"
] | permissive | ilitzroth/mathlib | ea647e67f1fdfd19a0f7bdc5504e8acec6180011 | 5254ef14e3465f6504306132fe3ba9cec9ffff16 | refs/heads/master | 1,680,086,661,182 | 1,617,715,647,000 | 1,617,715,647,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 61,534 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Abhimanyu Pallavi Sudhir
-/
import algebra.geom_sum
import data.nat.choose.sum
import data.complex.basic
/-!
# Exponential, trigonometric and hyperbolic trigonometric funct... |
4e2ebf62d933bfc1c88469e9973d28353edef2b1 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/fintype/perm.lean | c3609830054bd67f8dc0bfb6f83484bde7c89c53 | [
"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 | 6,478 | 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.card
import group_theory.perm.basic
/-!
# fintype instances for `equiv` and `perm`
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to t... |
631af59aa1b68d6499c2dac43e40b77e99657c6b | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/meta/expr.lean | 20b49e7e670cc82ea896253fda77b281d1c1cc89 | [
"Apache-2.0"
] | permissive | fpvandoorn/mathlib | b21ab4068db079cbb8590b58fda9cc4bc1f35df4 | b3433a51ea8bc07c4159c1073838fc0ee9b8f227 | refs/heads/master | 1,624,791,089,608 | 1,556,715,231,000 | 1,556,715,231,000 | 165,722,980 | 5 | 0 | Apache-2.0 | 1,552,657,455,000 | 1,547,494,646,000 | Lean | UTF-8 | Lean | false | false | 4,536 | lean | /-
Copyright (c) 2019 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Simon Hudon, Scott Morrison, Keeley Hoek, Robert Y. Lewis
Additional non-tactic operations on expr and related types
-/
namespace name
meta def deinternalize_field ... |
2b1a123a5806770b7e45adb30120bce6ac4b8bc4 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/algebra/group/conj.lean | c032c7661002f7a4bb43280fed054ab958ee2ac9 | [
"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 | 1,930 | lean | /-
Copyright (c) 2018 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Chris Hughes, Michael Howes
-/
import tactic.basic algebra.group.hom
/-!
# Conjugacy of group elements
-/
universes u v
variables {α : Type u} {β : Type v}
variables... |
930c447f61fd4ed0a561d124885d79e2311e9609 | e4e5bde6f14c01a8a34267a9d7bb45e137735696 | /src/counterexamples/spaces/finite_discrete.lean | c30f201a12973ac96a503c30568c2e976ce03136 | [] | no_license | jamesdabbs/proofs | fb5dab6f3c4f3f5f952fca033ec649888ae787c6 | 00baf355b08e7aec00de34208e1b2cb4a8d7b701 | refs/heads/master | 1,645,645,735,797 | 1,569,559,636,000 | 1,569,559,636,000 | 211,238,170 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,811 | lean | /-
Reading list:
- https://leanprover.github.io/logic_and_proof/index.html
- Especially https://leanprover.github.io/logic_and_proof/sets.html
-/
prelude
import topology.order topology.subset_properties
import data.set data.set.basic
import set_theory.zfc
open set
open topological_space
universes u
variables ... |
bbb3c4ea452e1574342adc6874f05062d57e9c89 | 47181b4ef986292573c77e09fcb116584d37ea8a | /src/abvs_equiv.lean | 5557b56a5158e9f94fe6bf6c2d4a6719876eacb3 | [
"MIT"
] | permissive | RaitoBezarius/berkovich-spaces | 87662a2bdb0ac0beed26e3338b221e3f12107b78 | 0a49f75a599bcb20333ec86b301f84411f04f7cf | refs/heads/main | 1,690,520,666,912 | 1,629,328,012,000 | 1,629,328,012,000 | 332,238,095 | 4 | 0 | MIT | 1,629,312,085,000 | 1,611,414,506,000 | Lean | UTF-8 | Lean | false | false | 2,267 | lean | import number_theory.padics.padic_norm
import data.real.cau_seq
import analysis.special_functions.exp_log
import analysis.special_functions.pow
import data.nat.prime
import data.nat.basic
import tactic.apply
import tactic.linarith
import topology.metric_space.basic
open is_absolute_value
variables (α: ℝ)
def abvs_eq... |
c8ce71aa1cbb9469dcf4bb043b86e919b84dd041 | 4b846d8dabdc64e7ea03552bad8f7fa74763fc67 | /library/tools/super/splitting.lean | f30999fac1e3c84909abcbcba708ef811145cf83 | [
"Apache-2.0"
] | permissive | pacchiano/lean | 9324b33f3ac3b5c5647285160f9f6ea8d0d767dc | fdadada3a970377a6df8afcd629a6f2eab6e84e8 | refs/heads/master | 1,611,357,380,399 | 1,489,870,101,000 | 1,489,870,101,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,701 | 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 .prover_state
open monad expr list tactic
namespace super
private meta def find_components : list expr → list (list (expr × ℕ)) → list (list (expr × ℕ))
| (e::... |
30c91f0d2dd723b43e9cc83507ad389752cc7158 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /test/simp_command.lean | a929ef0c48e0c4de032886f63b491656bbbb8af8 | [
"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 | 2,483 | lean | import tactic.simp_command
import analysis.special_functions.trigonometric
/- Turn off trace messages only if the statements are simplified to true: -/
set_option trace.silence_simp_if_true true
/-!
Tests for the #simp command.
-/
#simp 5 - 5 = 0
section arith
def f (x : ℤ) := x + (x - x)
#simp [f] f 3 = 3
mk_sim... |
24e851fa287e339b5fe36777a4263d6c5d18bd66 | 95dcf8dea2baf2b4b0a60d438f27c35ae3dd3990 | /src/measure_theory/probability_mass_function.lean | 11e5a5321c22085aab0ead45080dc0f0e81b21cc | [
"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 | 4,788 | 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
Probability mass function -- discrete probability measures
-/
import topology.instances.nnreal topology.instances.ennreal topology.algebra.infinite_sum
noncomputable the... |
a36eab8e817124cd064b23f406cb5dea0b430050 | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /src/Lean/Syntax.lean | bfee7ec123dea99e797f8c84fbe5c69dd24db236 | [
"Apache-2.0"
] | permissive | williamdemeo/lean4 | 72161c58fe65c3ad955d6a3050bb7d37c04c0d54 | 6d00fcf1d6d873e195f9220c668ef9c58e9c4a35 | refs/heads/master | 1,678,305,356,877 | 1,614,708,995,000 | 1,614,708,995,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 14,326 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Sebastian Ullrich, Leonardo de Moura
-/
import Lean.Data.Name
import Lean.Data.Format
namespace Lean
def SourceInfo.updateTrailing (trailing : Substring) : SourceInfo → SourceI... |
79b749525e22c3579a77c0e9443a8e6462f66ecd | 618003631150032a5676f229d13a079ac875ff77 | /src/tactic/simpa.lean | be5469e7583271b85fb8f59b9d6ada3abdc76e3c | [
"Apache-2.0"
] | permissive | awainverse/mathlib | 939b68c8486df66cfda64d327ad3d9165248c777 | ea76bd8f3ca0a8bf0a166a06a475b10663dec44a | refs/heads/master | 1,659,592,962,036 | 1,590,987,592,000 | 1,590,987,592,000 | 268,436,019 | 1 | 0 | Apache-2.0 | 1,590,990,500,000 | 1,590,990,500,000 | null | UTF-8 | Lean | false | false | 2,209 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import tactic.doc_commands
namespace tactic
namespace interactive
open interactive interactive.types expr lean.parser
local postfix `?`:9001 := optional
/--
This i... |
2e151eb06f830e2cead8e782c74fc68bbb4e8a51 | 958488bc7f3c2044206e0358e56d7690b6ae696c | /lean/eq.lean | 9bc9ff084daea541ef9173dcfe54f29885ea7be0 | [] | 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 | 1,481 | lean | --#check eq.refl
--#check eq.symm
--#check eq.trans
namespace hidden
universe u
--#check @eq.refl.{u}
--#check @eq.symm.{u}
--#check @eq.trans.{u}
lemma L1 : 2 + 3 = 5 :=
eq.refl _
--#check L1
lemma L2 : 2 + 3 = 5 := rfl
--#check L2
lemma L3 : ∀ (α : Type u) (a b : α)(p : α → Prop), a = b → p a → p b
:= assu... |
6417c0a4965cfc844742f87d37f5c24cd1246de9 | 8e381650eb2c1c5361be64ff97e47d956bf2ab9f | /src/sheaves/sheaf.lean | efa565245ef23207d607929f02b28b3292ee741a | [] | no_license | alreadydone/lean-scheme | 04c51ab08eca7ccf6c21344d45d202780fa667af | 52d7624f57415eea27ed4dfa916cd94189221a1c | refs/heads/master | 1,599,418,221,423 | 1,562,248,559,000 | 1,562,248,559,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,523 | lean | /-
Sheaf (of types).
https://stacks.math.columbia.edu/tag/006S
-/
import sheaves.covering.covering
import sheaves.presheaf
universes u v
open topological_space lattice
section sheaf_condition
variables {α : Type u} [topological_space α]
-- Restriction map from U to U ∩ V.
def res_to_inter_left (F : pres... |
f645ef817aff9589f4f100dd5ae194e5cf763a94 | 592ee40978ac7604005a4e0d35bbc4b467389241 | /Library/generated/mathscheme-lean/NearRing.lean | d4dc08c43f11856b7d902b6bbddd1881aa09aa38 | [] | no_license | ysharoda/Deriving-Definitions | 3e149e6641fae440badd35ac110a0bd705a49ad2 | dfecb27572022de3d4aa702cae8db19957523a59 | refs/heads/master | 1,679,127,857,700 | 1,615,939,007,000 | 1,615,939,007,000 | 229,785,731 | 4 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 12,849 | lean | import init.data.nat.basic
import init.data.fin.basic
import data.vector
import .Prelude
open Staged
open nat
open fin
open vector
section NearRing
structure NearRing (A : Type) : Type :=
(times : (A → (A → A)))
(plus : (A → (A → A)))
(zero : A)
(lunit_zero : (∀ {x : A} , (plus zero x... |
8cad306e98d72899e64d6ae240cc51ce57c8bac5 | e151e9053bfd6d71740066474fc500a087837323 | /src/hott/types/trunc.lean | 6c673d3c24b78bf404e3b8e7e92af85fce73af43 | [
"Apache-2.0"
] | permissive | daniel-carranza/hott3 | 15bac2d90589dbb952ef15e74b2837722491963d | 913811e8a1371d3a5751d7d32ff9dec8aa6815d9 | refs/heads/master | 1,610,091,349,670 | 1,596,222,336,000 | 1,596,222,336,000 | 241,957,822 | 0 | 0 | Apache-2.0 | 1,582,222,839,000 | 1,582,222,838,000 | null | UTF-8 | Lean | false | false | 36,121 | lean | /-
Copyright (c) 2015 Jakob von Raumer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
Properties of trunc_index, is_trunc, trunctype, trunc, and the pointed versions of these
-/
-- NOTE: the fact that (is_trunc n A) is a mere proposition is proved i... |
b9ddc58508cef15cd08d6a15b23cbd4d4ea7b4fd | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/topology/metric_space/hausdorff_distance.lean | 1362de6fc1f5f1719bf2483804448d6e35821a37 | [
"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 | 52,591 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import topology.metric_space.isometry
import topology.instances.ennreal
import analysis.specific_limits
/-!
# Hausdorff distance
The Hausdorff distance on sub... |
2476eb042bbceacb02e1d6d164c88788eb50f957 | d1bbf1801b3dcb214451d48214589f511061da63 | /src/computability/partrec.lean | 6cc99be8383572b95367793746e2babf815518e8 | [
"Apache-2.0"
] | permissive | cheraghchi/mathlib | 5c366f8c4f8e66973b60c37881889da8390cab86 | f29d1c3038422168fbbdb2526abf7c0ff13e86db | refs/heads/master | 1,676,577,831,283 | 1,610,894,638,000 | 1,610,894,638,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 28,984 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
-/
import computability.primrec
import data.nat.psub
import data.pfun
/-!
# The partial recursive functions
The partial recursive functions are defined similarly to the... |
0d7bc68e48954c5cb5e2369c83e31a6315af9686 | d29d82a0af640c937e499f6be79fc552eae0aa13 | /src/algebra/archimedean.lean | fbb191ddaf6f0691e183885ae1b83012d6ed702b | [
"Apache-2.0"
] | permissive | AbdulMajeedkhurasani/mathlib | 835f8a5c5cf3075b250b3737172043ab4fa1edf6 | 79bc7323b164aebd000524ebafd198eb0e17f956 | refs/heads/master | 1,688,003,895,660 | 1,627,788,521,000 | 1,627,788,521,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 13,928 | 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 algebra.field_power
import data.rat
/-!
# Archimedean groups and fields.
This file defines the archimedean property for ordered groups and proves several re... |
a4cf43b8e9fa48e90bbe53afdb3629d729db4fcb | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/meta/widget/default.lean | 2af47c231740bad3a0c41bb8a690af1adebae0ab | [] | 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 | 456 | lean | /-
Copyright (c) E.W.Ayers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: E.W.Ayers
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.meta.widget.basic
import Mathlib.Lean3Lib.init.meta.widget.interactive_expr
import Mathlib.Lean3Lib.init.meta.widget.tactic_compo... |
aab4d6ba928c454eaa629c9aa02517e82ca981be | f3849be5d845a1cb97680f0bbbe03b85518312f0 | /library/tools/super/equality.lean | f93fe50466616c627bb39504b55a132d8395db10 | [
"Apache-2.0"
] | permissive | bjoeris/lean | 0ed95125d762b17bfcb54dad1f9721f953f92eeb | 4e496b78d5e73545fa4f9a807155113d8e6b0561 | refs/heads/master | 1,611,251,218,281 | 1,495,337,658,000 | 1,495,337,658,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,249 | 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 .utils
open tactic monad expr list
namespace super
meta def try_unify_eq_l (c : clause) (i : nat) : tactic clause := do
guard $ clause.li... |
a8a89cc21d470c48e7de0e2c49a9fad48dd206aa | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/algebra/group/to_additive.lean | 14945d3c407bd049c2a8b4256bea9bd706cc3fb7 | [
"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 | 12,315 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Yury Kudryashov.
-/
import tactic.transform_decl
import tactic.algebra
/-!
# Transport multiplicative to additive
This file defines an attribute `to_additive` that ca... |
deb049a95a993d1411f335af27cb7865c53668f9 | 64874bd1010548c7f5a6e3e8902efa63baaff785 | /tests/lean/nonexhaustive.lean | 2c8f0cc779fce01e87d9004beee985436574d517 | [
"Apache-2.0"
] | permissive | tjiaqi/lean | 4634d729795c164664d10d093f3545287c76628f | d0ce4cf62f4246b0600c07e074d86e51f2195e30 | refs/heads/master | 1,622,323,796,480 | 1,422,643,069,000 | 1,422,643,069,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 284 | lean | import data.vector
open nat vector
variable {A : Type}
definition foo : Π {n : nat}, vector A n → nat,
foo nil := 0,
foo (a :: b :: v) := 0
set_option pp.implicit false
definition foo : Π {n : nat}, vector A n → nat,
foo nil := 0,
foo (a :: b :: v) := 0
|
2d96660e277a23ce1c999c83eeb429d802d951e7 | 626e312b5c1cb2d88fca108f5933076012633192 | /src/logic/basic.lean | 3f3d9ca567d413aff0006fc1d0785c1e16202598 | [
"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 | 59,741 | 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
-/
import tactic.doc_commands
import tactic.reserved_notation
/-!
# Basic logic properties
This file is one of the earliest imports in mathlib.
## Im... |
afae24ac8e543ab71f137fe8008735625c9492b5 | 9028d228ac200bbefe3a711342514dd4e4458bff | /src/data/polynomial/eval.lean | 757ea5ca229cf05ca28a4bc02eb6292de2274632 | [
"Apache-2.0"
] | permissive | mcncm/mathlib | 8d25099344d9d2bee62822cb9ed43aa3e09fa05e | fde3d78cadeec5ef827b16ae55664ef115e66f57 | refs/heads/master | 1,672,743,316,277 | 1,602,618,514,000 | 1,602,618,514,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 19,819 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Johannes Hölzl, Scott Morrison, Jens Wagemaker
-/
import data.polynomial.induction
import data.polynomial.degree.basic
import deprecated.ring
/-!
# Theory of univariate po... |
fb6affb316622567ddd0a1f8f08bf3dada52e251 | 05d69962fb9deab19838de9bbcf33ebdbf8faa57 | /sum.lean | c5cdffc74f3326b3e3a60a2687aa8a9866eeb408 | [] | no_license | pj0y1/polynom | 6eb7c96dbf34960be5721a232a67f7a592aedf7a | 9e198cc9104017fae7774574f141197bb295ee66 | refs/heads/master | 1,611,193,417,139 | 1,501,472,138,000 | 1,501,472,138,000 | 64,856,946 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,432 | lean | /-A concise version of m14.lean and m15.lean
Containing theories of Sum exchange and Sum curry, Sum reduced
-/
import data.set data.finset algebra.group_bigops
import aux
local attribute prod.has_decidable_eq[instance]
open prod.ops function
variables {A B C:Type}{a:A}{b:B}
variables [deceqA: decidable_eq A][deceqB:... |
9015c5e3fc21b35275c44a5fffb6845b1f548bff | 9ad8d18fbe5f120c22b5e035bc240f711d2cbd7e | /src/order/lattice_extra.lean | 011040f783e81498e2105c3ca9671f0a2e22681e | [] | no_license | agusakov/lean_lib | c0e9cc29fc7d2518004e224376adeb5e69b5cc1a | f88d162da2f990b87c4d34f5f46bbca2bbc5948e | refs/heads/master | 1,642,141,461,087 | 1,557,395,798,000 | 1,557,395,798,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,861 | lean | /-
Copyright (c) 2019 Neil Strickland. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Neil Strickland
Some additional typeclass instances:
* A set with decidable linear order and top and bottom
elements is a bounded distributive lattice
* If we take a set with dec... |
4f0f36425c5449056ffee73d262374b27fb35be5 | 4e3bf8e2b29061457a887ac8889e88fa5aa0e34c | /lean/love13_rational_and_real_numbers_demo.lean | 05523ef1633f362ea1dfe503177d252c927c383e | [] | no_license | mukeshtiwari/logical_verification_2019 | 9f964c067a71f65eb8884743273fbeef99e6503d | 16f62717f55ed5b7b87e03ae0134791a9bef9b9a | refs/heads/master | 1,619,158,844,208 | 1,585,139,500,000 | 1,585,139,500,000 | 249,906,380 | 0 | 0 | null | 1,585,118,728,000 | 1,585,118,727,000 | null | UTF-8 | Lean | false | false | 8,814 | lean | /- LoVe Demo 13: Rational and Real Numbers -/
import .lovelib
namespace LoVe
set_option pp.beta true
/- Rational Numbers -/
structure fraction :=
(num : ℤ)
(denom : ℤ)
(denom_ne_zero : denom ≠ 0)
export fraction (num denom denom_ne_zero)
instance fraction.setoid : setoid fraction :=
{ r :=... |
b8f2f5613c74563b8339a1efe0910538183faf60 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/bench/binarytrees.lean | 91b1361f33720bd7f4ea973fb744b15c9f0bb559 | [
"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,631 | lean | inductive Tree
| nil
| node (l r : Tree)
instance : Inhabited Tree := ⟨.nil⟩
-- This function has an extra argument to suppress the
-- common sub-expression elimination optimization
partial def make' (n d : UInt32) : Tree :=
if d = 0 then .node .nil .nil
else .node (make' n (d - 1)) (make' (n + 1) (d - 1))
--... |
b76af19782e37e3a04fec14256c2c22d69bc6fca | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch3/ex0502.lean | 023f174c12322416d65382a48685db21a2b99a97 | [] | no_license | Ailrun/Theorem_Proving_in_Lean | ae6a23f3c54d62d401314d6a771e8ff8b4132db2 | 2eb1b5caf93c6a5a555c79e9097cf2ba5a66cf68 | refs/heads/master | 1,609,838,270,467 | 1,586,846,743,000 | 1,586,846,743,000 | 240,967,761 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 136 | lean | open classical
theorem dne {p : Prop} (h : ¬¬p) : p :=
or.elim (em p)
(assume hp : p, hp)
(assume hnp : ¬p, absurd hnp h)
|
a11e975c99ebe92e383d91b110060b04c8ae2348 | 75db7e3219bba2fbf41bf5b905f34fcb3c6ca3f2 | /hott/algebra/category/nat_trans.hlean | e430ab2c139ffab6fcbc546cc6ff884f43fa6754 | [
"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 | 7,492 | hlean | /-
Copyright (c) 2015 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Floris van Doorn, Jakob von Raumer
-/
import .functor.basic
open eq category functor is_trunc equiv sigma.ops sigma is_equiv function pi funext iso
structure nat_trans {C : Precateg... |
144274a4595653ebf9dc9c138d1ddc3550fe84c4 | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /tests/lean/run/e18.lean | 82174ed3dcc47e6150042999a571fd37393d97c0 | [
"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 | 474 | lean | inductive nat : Type :=
zero : nat,
succ : nat → nat
inductive list (A : Type) : Type :=
nil {} : list A,
cons : A → list A → list A
inductive int : Type :=
of_nat : nat → int,
neg : nat → int
coercion int.of_nat
constants n m : nat
constants i j : int
constant l : list nat
namespace list end list open list
chec... |
650eeecfd7d13a3b60b28d6b2144d9897eb7c454 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/data/sym/card.lean | d52f37ab7dfa56d18012cfc0b9c177457dd64f97 | [
"Apache-2.0"
] | permissive | AntoineChambert-Loir/mathlib | 64aabb896129885f12296a799818061bc90da1ff | 07be904260ab6e36a5769680b6012f03a4727134 | refs/heads/master | 1,693,187,631,771 | 1,636,719,886,000 | 1,636,719,886,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,191 | lean | /-
Copyright (c) 2021 Yaël Dillies, Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies, Bhavik Mehta
-/
import algebra.big_operators.basic
import data.fintype.card
import data.sym.sym2
/-!
# Stars and bars
In this file, we prove the case `n = 2... |
07c882ee8268a82e7e82c11092caa6d35a8242eb | 7282d49021d38dacd06c4ce45a48d09627687fe0 | /tests/lean/cond_tac.lean | dbdd8682091602f6ad1922358769235231a1914f | [
"Apache-2.0"
] | permissive | steveluc/lean | 5a0b4431acefaf77f15b25bbb49294c2449923ad | 92ba4e8b2d040a799eda7deb8d2a7cdd3e69c496 | refs/heads/master | 1,611,332,256,930 | 1,391,013,244,000 | 1,391,013,244,000 | 16,361,079 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,229 | lean | import tactic
(*
simple_tac = Cond(function(env, ios, s)
local gs = s:goals()
local n, g = gs:head()
local r = g:conclusion():is_and()
print ("Cond result: " .. tostring(r))
return r
end,
... |
cf274be7c8a405765b6ca87d14ee35b38e14e014 | b5d93c72e090448754596aaf1204dca77e00841f | /src/export_json.lean | 3717e5e3eb859043ebbc2c5413a58690ff080932 | [] | no_license | gebner/doc-gen | b9edb38b3da9ec87f284fc891d00be0616b44f3b | 80716270e92c25912ad1b6a742df1953e36374e3 | refs/heads/master | 1,606,264,147,578 | 1,576,502,548,000 | 1,576,502,548,000 | 228,408,636 | 0 | 0 | null | 1,576,507,505,000 | 1,576,507,505,000 | null | UTF-8 | Lean | false | false | 9,536 | lean | /-
Copyright (c) 2019 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Robert Y. Lewis
-/
import tactic.core system.io data.string.defs tactic.interactive data.list.sort
import all
/-!
Used to generate a json file for html docs.
The json file is a list... |
3e53548e4205d0bbb63f762047568d7f190bf49e | 86f6f4f8d827a196a32bfc646234b73328aeb306 | /examples/logic/unnamed_1231.lean | 304993c3d2dfade596c1944c589feb1580d774cc | [] | 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 | 256 | lean | variables {α : Type*} (P : α → Prop)
example (h : ¬ ∃ x, P x) : ∀ x, ¬ P x :=
sorry
example (h : ∀ x, ¬ P x) : ¬ ∃ x, P x :=
sorry
example (h : ¬ ∀ x, P x) : ∃ x, ¬ P x :=
sorry
example (h : ∃ x, ¬ P x) : ¬ ∀ x, P x :=
sorry |
991752e80dcc49892e4c538f4747c67c35a6805e | dfb46c403bb47bae8bc79d998f700de3141215f2 | /TBA/Eulerian/List.lean | 2c0f8daa2eee9e7067d41a3b2e21f6b63ce289ba | [] | no_license | JerrySommerfield/tba-2021 | 82ac01e8274e0a3e9fc681ef00961ed9535526c6 | 4f6ea59fd216ea54bf0c4367c4f5ea1bcc3534a9 | refs/heads/master | 1,685,282,562,160 | 1,623,763,805,000 | 1,623,764,287,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 16,778 | lean | import TBA.Eulerian.Nat
open BEq Nat List Decidable
namespace Eq
protected theorem symm_iff {a b : α} : b = a ↔ a = b := ⟨Eq.symm, Eq.symm⟩
end Eq
namespace List
@[simp] theorem length_append {as bs : List α} :
length (as ++ bs) = length as + length bs :=
match as with
| [] => by simp
| a :: as => b... |
3d5aef3de341b4b95d2aea3e0d755a8358700d34 | 947b78d97130d56365ae2ec264df196ce769371a | /src/Init/Control/Id.lean | 20107fd0bd946591f83867a6e2933b01b45b5fe8 | [
"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 | 780 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
The identity Monad.
-/
prelude
import Init.Control.MonadLift
import Init.Control.MonadRun
universe u
def Id (type : Type u) : Type u := type
@[inline] def ... |
3e212f4a7d4485a4770def77c7debbfe61e1a482 | 0c1546a496eccfb56620165cad015f88d56190c5 | /library/init/meta/format.lean | a55e7cc091548ea2dd05c4a3a36fd92a76ca1884 | [
"Apache-2.0"
] | permissive | Solertis/lean | 491e0939957486f664498fbfb02546e042699958 | 84188c5aa1673fdf37a082b2de8562dddf53df3f | refs/heads/master | 1,610,174,257,606 | 1,486,263,620,000 | 1,486,263,620,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,718 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.meta.options
universe variables u v
inductive format.color
| red | green | orange | blue | pink | cyan | grey
meta constant format : ... |
2eb9ff586ca2ba24afb34c809e9a73ab8af820d7 | 947b78d97130d56365ae2ec264df196ce769371a | /tests/lean/run/matchNoPostponing.lean | 69c32a9eef45f8ffe00714c76f7123978b1ef06f | [
"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 | 485 | lean | new_frontend
/- In the following example, type of `x` and `y` could be any type `α` s.t. `[HasOfNat α]`.
It relies on `SyntheticMVarKind.withDefault` to set `α := Nat`.
Moreover, we must commit to `α := Nat` before we try to build de `matcher` since
`mkMatcher` assumes `matchType` does not contain metavariabl... |
9f05e310ed2fae2a8dcda51112b913297ad67c00 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/order/ord_continuous.lean | efa28ab5c5ef830043d62badae746e65c5ffb52f | [
"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 | 8,036 | 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, Johannes Hölzl
-/
import order.conditionally_complete_lattice
import logic.function.iterate
import order.rel_iso
/-!
# Order continuity
We say that a function... |
28941aed866e13f4f1432bf6fe2e59eab23187d6 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/topology/algebra/continuous_functions.lean | ffe25ebd56aa3d179350b64214d586bd6827f7df | [] | 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 | 13,280 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Nicolò Cavalleri
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.topology.algebra.module
import Mathlib.topology.continuous_map
import Mat... |
2eb18f4e97bf1816120ed1948b69d4632e7d028a | 3dc4623269159d02a444fe898d33e8c7e7e9461b | /.github/workflows/geo/sieves.lean | c392d8760434973eb7a7c24f39a29ffe15f36e06 | [] | no_license | Or7ando/lean | cc003e6c41048eae7c34aa6bada51c9e9add9e66 | d41169cf4e416a0d42092fb6bdc14131cee9dd15 | refs/heads/master | 1,650,600,589,722 | 1,587,262,906,000 | 1,587,262,906,000 | 255,387,160 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,087 | lean | import category_theory.comma
import algebra.category.CommRing
import .global
import .ideals
import .Omega
import data.opposite
import ring_theory.ideals
import .src.sieve
import .src.grothendieck
open category_theory
open opposite
universes u
local notation `Ring` := CommRing.{u}
local notation `Aff` := Ringᵒᵖ
loca... |
c06711156f8c1716230a2430fe4dd0f675aef18e | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/ring_theory/power_series/basic.lean | cebc6b129f80978df34ea12303b211f9498e21d1 | [
"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 | 76,108 | lean | /-
Copyright (c) 2019 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Kenny Lau
-/
import data.finsupp.interval
import data.mv_polynomial.basic
import data.polynomial.algebra_map
import data.polynomial.coeff
import linear_algebra.std_basi... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.