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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
32c0fa8a6de911eeb674c9985e75d31d2570a06b | cf39355caa609c0f33405126beee2739aa3cb77e | /library/init/meta/smt/smt_tactic.lean | c64c24edeb05ca3a4545345c43c268789f7b3e84 | [
"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 | 15,126 | 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.control
import init.meta.simp_tactic
import init.meta.smt.congruence_closure
import init.meta.smt.ematch
universe u
run_cmd mk_simp_at... |
3f25532d62729cb72ce7b08cbc13417dc88e15b0 | 556aeb81a103e9e0ac4e1fe0ce1bc6e6161c3c5e | /src/starkware/cairo/common/cairo_secp/ec_spec.lean | e0d3dd146de16b4b3445d869d3c75e86ef091546 | [] | permissive | starkware-libs/formal-proofs | d6b731604461bf99e6ba820e68acca62a21709e8 | f5fa4ba6a471357fd171175183203d0b437f6527 | refs/heads/master | 1,691,085,444,753 | 1,690,507,386,000 | 1,690,507,386,000 | 410,476,629 | 32 | 9 | Apache-2.0 | 1,690,506,773,000 | 1,632,639,790,000 | Lean | UTF-8 | Lean | false | false | 65,519 | lean | /-
Specifications file for ec_spec.cairo
Do not modify the constant definitions, structure definitions, or automatic specifications.
Do not change the name or arguments of the user specifications and soundness theorems.
You may freely move the definitions around in the file.
You may add definitions and theo... |
294733b87c293f610aaee7c4e22dc1febd17f0d4 | 3f1a1d97c03bb24b55a1b9969bb4b3c619491d5a | /library/init/data/ordering/lemmas.lean | e4edd646cf4dfcbcd1f852c63640ea3424598771 | [
"Apache-2.0"
] | permissive | praveenmunagapati/lean | 00c3b4496cef8e758396005013b9776bb82c4f56 | fc760f57d20e0a486d14bc8a08d89147b60f530c | refs/heads/master | 1,630,692,342,183 | 1,515,626,222,000 | 1,515,626,222,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,114 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.data.ordering.basic init.meta init.algebra.classes init.ite_simp
set_option default_priority 100
universes u
namespace ordering
/- Del... |
0763cc88e068231e0b6963db1bc60ffe044d4ff9 | 6fca17f8d5025f89be1b2d9d15c9e0c4b4900cbf | /src/game/world8/level13.lean | 53240f5ba9046f9d053858396b7f9afcd8d285b4 | [
"Apache-2.0"
] | permissive | arolihas/natural_number_game | 4f0c93feefec93b8824b2b96adff8b702b8b43ce | 8e4f7b4b42888a3b77429f90cce16292bd288138 | refs/heads/master | 1,621,872,426,808 | 1,586,270,467,000 | 1,586,270,467,000 | 253,648,466 | 0 | 0 | null | 1,586,219,694,000 | 1,586,219,694,000 | null | UTF-8 | Lean | false | false | 585 | lean | import game.world8.level12 -- hide
namespace mynat -- hide
/-
# Advanced Addition World
## Level 13: `ne_succ_self`
The last level in Advanced Addition World is the statement
that $n\not=\operatorname{succ}(n)$. When you've done this
you've completed Advanced Addition World and can move on
to Advanced Multiplicatio... |
9f048aa4597cb4987741d47e60e7d9db72032509 | 2c096fdfecf64e46ea7bc6ce5521f142b5926864 | /src/Init/Data/ByteArray/Basic.lean | 46f5c4411ceed3deb17da9ee7893e527bf5f3af7 | [
"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 | 7,389 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
prelude
import Init.Data.Array.Basic
import Init.Data.Array.Subarray
import Init.Data.UInt
import Init.Data.Option.Basic
universe u
structure ByteArray wher... |
b55ecbbd4f72126c66fdfab29dfbffe5e02347e0 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /stage0/src/Lean/AuxRecursor.lean | de557215e9e39d0a1997db96c313dc83d674f819 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | cipher1024/lean4 | 6e1f98bb58e7a92b28f5364eb38a14c8d0aae393 | 69114d3b50806264ef35b57394391c3e738a9822 | refs/heads/master | 1,642,227,983,603 | 1,642,011,696,000 | 1,642,011,696,000 | 228,607,691 | 0 | 0 | Apache-2.0 | 1,576,584,269,000 | 1,576,584,268,000 | null | UTF-8 | Lean | false | false | 1,961 | 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.Environment
namespace Lean
def casesOnSuffix := "casesOn"
def recOnSuffix := "recOn"
def brecOnSuffix := "brecOn"
def bin... |
b1815b9c050323a97274b6513dea8d6aacc0d905 | 5c5878e769950eabe897ad08485b3ba1a619cea9 | /examples/universes.lean | 2a510cac0033339e4df1bc8d6b071bc1ab72e9f1 | [
"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 | 2,748 | lean | universes u₁ v₁ u₂ v₂
structure Category :=
(Obj : Type u₁)
(Hom : Obj → Obj → Type v₁)
(identity : Π X : Obj, Hom X X)
(compose : Π {X Y Z : Obj}, Hom X Y → Hom Y Z → Hom X Z)
(left_identity : ∀ {X Y : Obj} (f : Hom X Y), compose (identity X) f = f)
(right_identity : ∀ {X Y : Obj} (f : Hom X Y), compose f (identity... |
577837287b92c3884ac42f1eee776dd15bbcb29a | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/doc_string2.lean | d0d96a074cf78af0d27e392b50b8711a797181c2 | [
"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 | 257 | lean | /-- Documentation for inductive foo -/
inductive foo
| val1 | val2
namespace foo
/-- Documentation for x -/
def x := 10
end foo
open tactic
run_cmd do
trace "--------",
doc_string `foo >>= trace,
trace "--------",
doc_string `foo.x >>= trace
|
f720c498dd5edbe594e1aad8efa8fe1ab2d2adc3 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/number_theory/dioph.lean | 9517b606612c4987abfb69d8c18d13c499a99424 | [
"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 | 35,392 | 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 number_theory.pell
import data.pfun
import data.fin2
/-!
# Diophantine functions and Matiyasevic's theorem
Hilbert's tenth problem asked whether there exist... |
eb9493e1a4cafccd99eb1d28c45cb420433b46d0 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/tactic/omega/nat/sub_elim_auto.lean | 06bf551f34f4da3647ce2ad997aeb7cb718b8e85 | [] | 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 | 3,041 | lean | /-
Copyright (c) 2019 Seul Baek. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Seul Baek
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.tactic.omega.nat.form
import Mathlib.PostPort
namespace Mathlib
/-
Subtraction elimination for linea... |
7f7998927592a946a56f14a4e9f0cc12319088f2 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/analysis/normed/group/SemiNormedGroup/kernels.lean | 1769c78efedd539646942129455b6f1902bee639 | [
"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 | 13,097 | lean | /-
Copyright (c) 2021 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Riccardo Brasca, Johan Commelin, Scott Morrison
-/
import analysis.normed.group.SemiNormedGroup
import analysis.normed.group.quotient
import category_theory.limits.shapes.kernels
/-!
... |
d3e0ded80a4adb09fa6bb185e95738fb72001b0c | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/compiler/closure_bug2.lean | 0a027e06054b5b20c856d9c86f43eebd327713be | [
"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 | 555 | 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 := ... |
fdc3fbeb478ddbf76d0458609397ad592865204b | 4727251e0cd73359b15b664c3170e5d754078599 | /src/group_theory/nilpotent.lean | 77c70116bfa646e0d170d80f65e6f8e05a328ebd | [
"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 | 37,956 | lean | /-
Copyright (c) 2021 Kevin Buzzard. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Buzzard, Ines Wright, Joachim Breitner
-/
import group_theory.quotient_group
import group_theory.solvable
import group_theory.p_group
import group_theory.sylow
import data.nat.fa... |
018eb716def98f780c2e7efe8faa5b9f748ca4b3 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/testing/slim_check/functions_auto.lean | e70e231301345052abcad8c1ab06514ad35d8c05 | [] | 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,232 | lean | /-
Copyright (c) 2020 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Simon Hudon
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.list.sigma
import Mathlib.testing.slim_check.sampleable
import Mathlib.testing.slim_check.tes... |
edea083510f500a05f385406452654e894383214 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/n3.lean | 34cc76fb1898a98d408153b356b9df52088bcb30 | [
"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 | 620 | lean | prelude
definition Prop : Type.{1} := Type.{0}
constant N : Type.{1}
constant and : Prop → Prop → Prop
infixr `∧`:35 := and
constant le : N → N → Prop
constant lt : N → N → Prop
constant f : N → N
constant add : N → N → N
infixl `+`:65 := add
precedence `≤`:50
precedence `<`:50
infixl ≤ := le
infixl < := lt
notation A ... |
4c094d9fc4ada854bc37ffe2ab88d7b972c99156 | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/topology/uniform_space/basic.lean | feed27e4ebc8ee8056a6c45d4e7fcea1d6ee9fde | [
"Apache-2.0"
] | permissive | agjftucker/mathlib | d634cd0d5256b6325e3c55bb7fb2403548371707 | 87fe50de17b00af533f72a102d0adefe4a2285e8 | refs/heads/master | 1,625,378,131,941 | 1,599,166,526,000 | 1,599,166,526,000 | 160,748,509 | 0 | 0 | Apache-2.0 | 1,544,141,789,000 | 1,544,141,789,000 | null | UTF-8 | Lean | false | false | 69,028 | 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.lift
import topology.separation
/-!
# Uniform spaces
Uniform spaces are a generalization of metric spaces and top... |
348d22596e4b38ef7456bf7985dedc034c090d4a | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/1772.lean | 26bdb99efc051be7f9f9ee81b47b5ac35d6effb5 | [
"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 | 294 | lean | example (p : Prop) (f : ∀ q : Prop, q → q) : p = p :=
by apply f _ _; refl
example (p : Prop) (f : ∀ q : Prop, q → q) : p = p :=
by apply f _ _; transitivity; refl
example (p r : Prop) (f : ∀ q : Prop, (r = q → q) → q) (h2 : r): p :=
by apply f _ (λ h, _); subst h; assumption
|
8d5d045736b7bb8c2a05afebcda90cbbc6aaeebf | 22e97a5d648fc451e25a06c668dc03ac7ed7bc25 | /src/data/list/basic.lean | 0167c2ca363b4be0d13d2cff2378972c691b317f | [
"Apache-2.0"
] | permissive | keeferrowan/mathlib | f2818da875dbc7780830d09bd4c526b0764a4e50 | aad2dfc40e8e6a7e258287a7c1580318e865817e | refs/heads/master | 1,661,736,426,952 | 1,590,438,032,000 | 1,590,438,032,000 | 266,892,663 | 0 | 0 | Apache-2.0 | 1,590,445,835,000 | 1,590,445,835,000 | null | UTF-8 | Lean | false | false | 154,168 | lean | /-
Copyright (c) 2014 Parikshit Khanna. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Parikshit Khanna, Jeremy Avigad, Leonardo de Moura, Floris van Doorn, Mario Carneiro
-/
import algebra.group
import deprecated.group
import data.nat.basic
/-!
# Basic properties of ... |
a4a7f5182b73e9770ac46c9ca2f1aedd3df1405a | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/tactic/omega/misc.lean | b6ebe964c9c8ab791f4adb81ffdcc4fa7adc2a89 | [
"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,142 | lean | /-
Copyright (c) 2019 Seul Baek. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Seul Baek
-/
/-
Miscellaneous.
-/
import tactic.localized
variables {α β γ : Type}
namespace omega
lemma fun_mono_2 {p : α → β → γ} {a1 a2 : α} {b1 b2 : β} :
a1 = a2 → b1 = b2 → (p a... |
bcead15d104801319161db272847ec5c950d1f8a | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /stage0/src/Lean/Elab/PreDefinition/Eqns.lean | 9ab0b767f13845dc395612e20e886210325a3b33 | [
"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 | 16,152 | lean | /-
Copyright (c) 2022 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Meta.Eqns
import Lean.Util.CollectFVars
import Lean.Meta.Tactic.Split
import Lean.Meta.Tactic.Apply
import Lean.Meta.Tactic.Refl
namespace Lean... |
cd05769359702c4d6962944ee2e78de15c90807e | efa51dd2edbbbbd6c34bd0ce436415eb405832e7 | /20170116_POPL/debug/has_to_string.lean | e565736982d82136b82ba53d7cb8659e7168e53a | [
"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 | 1,566 | lean | /- We revist an example from earlier, showing how the debugger
can be used to interactively debug & introspect on tactics. -/
/- First we import the debugger. -/
import tools.debugger
/- Then we set the option which enables the debugger. -/
set_option debugger true
/- We then set the option which enables autorun, wh... |
183c0ec771e7fd7ff8674a52bc56f9b1798d4d57 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/data/pnat/basic.lean | 41f3f00d22bacb00a270b7dfdec4c7631207dbbd | [
"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 | 16,471 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Neil Strickland
-/
import data.nat.basic
/-!
# The positive natural numbers
This file defines the type `ℕ+` or `pnat`, the subtype of natural numbers that are ... |
6f0f98817725f219048e9c290fd73cf1752099d6 | ea4aee6b11f86433e69bb5e50d0259e056d0ae61 | /src/tidy/timing.lean | 9365f104386054b8bdfedd73178e8a18bf5b3918 | [] | no_license | timjb/lean-tidy | e18feff0b7f0aad08c614fb4d34aaf527bf21e20 | e767e259bf76c69edfd4ab8af1b76e6f1ed67f48 | refs/heads/master | 1,624,861,693,182 | 1,504,411,006,000 | 1,504,411,006,000 | 103,740,824 | 0 | 0 | null | 1,505,553,968,000 | 1,505,553,968,000 | null | UTF-8 | Lean | false | false | 550 | lean |
import system.io
open tactic
universe variables u
-- There's apparently about a 1/5th of a second overhead here...
meta def time_in_nanos : tactic ℕ :=
do time ← tactic.run_io (λ [ioi : io.interface], @io.cmd ioi { cmd := "gdate", args := [ "+%s%N" ] } ),
pure time.to_nat
meta def time_tactic { α : Type } ( t :... |
dd76e8b339c809aaae8bb0218367964a0389aff0 | e9dbaaae490bc072444e3021634bf73664003760 | /src/Problems/2009/IMO_2009_P2.lean | 3365ef54b021856e4ae9ab017a9f0fda7b9ee510 | [
"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 | 369 | lean | import Geo.Geo.Core
namespace Geo
open Seg Triangle
def IMO_2009_P2 : Prop :=
∀ (A B C P Q : Point),
let O := circumcenter ⟨A, B, C⟩;
on P (Seg.mk C A) →
on Q (Seg.mk A B) →
let K := (Seg.mk B P).midp;
let L := (Seg.mk C Q).midp;
let M := (Seg.mk P Q).midp;
let Γ := Circle.buildPPP K L M;
tangent (Line.mk P Q) Γ →
c... |
03debf47e8c79ce2b3dfc91f3526d2798fd04bb7 | 129628888508a22919f176e3ba2033c3b52fa859 | /src/ftg.lean | 14fcdf1873b42d31d7be2cbdfa51b76863aecdfe | [
"Apache-2.0"
] | permissive | ImperialCollegeLondon/P11-Galois-Theory | 1aa35b6aa71c08aec6da3296ba404bf246db8df3 | ced2caa52300feb633316b3120c40ca957c8e8ff | refs/heads/master | 1,671,253,848,362 | 1,600,080,687,000 | 1,600,080,687,000 | 160,926,153 | 4 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 532 | lean | import ring_theory.algebra data.fintype.basic linear_algebra.dimension
universes u v w
variables (K : Type u) (L : Type v) [field K] [field L]
class finite_Galois_extension extends algebra K L.
definition galois_group : Type u → Type v → Type w := sorry
instance [finite_Galois_extension K L] :
fintype (... |
19b22620be5046dae0cb5d698b3dcdcc67d2b80e | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/category_theory/limits/shapes/pullbacks.lean | 6a52b692c2abd4bebdff4e649de7b32ec28535f2 | [
"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 | 29,299 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Markus Himmel, Bhavik Mehta
-/
import category_theory.limits.shapes.wide_pullbacks
import category_theory.limits.shapes.binary_products
/-!
# Pullbacks
We define a ca... |
930c013cc3ff757b4c2fb62ad999fab9c83a3d58 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/multiset/locally_finite.lean | 78d3b6f2d0a1d38d77a272424b85f9c6a61c189c | [
"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 | 8,626 | lean | /-
Copyright (c) 2021 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies
-/
import data.finset.locally_finite
/-!
# Intervals as multisets
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding PR to mathl... |
72c0c97bd721a3b429a992244b888d79119edefb | 86f6f4f8d827a196a32bfc646234b73328aeb306 | /examples/basics/unnamed_45.lean | ae24fe2090e2cdad1cb6c73981bbb069dde98c5a | [] | 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 | 126 | lean | import data.real.basic
example (a b c : ℝ) : (a * b) * c = b * (a * c) :=
begin
rw mul_comm a b,
rw mul_assoc b a c
end |
a3204b74adc3971f6fabad3224d950a57b2353ff | 80746c6dba6a866de5431094bf9f8f841b043d77 | /src/data/pfun.lean | 6af4742325913e3c5e999d178454d8a6757b5e4c | [
"Apache-2.0"
] | permissive | leanprover-fork/mathlib-backup | 8b5c95c535b148fca858f7e8db75a76252e32987 | 0eb9db6a1a8a605f0cf9e33873d0450f9f0ae9b0 | refs/heads/master | 1,585,156,056,139 | 1,548,864,430,000 | 1,548,864,438,000 | 143,964,213 | 0 | 0 | Apache-2.0 | 1,550,795,966,000 | 1,533,705,322,000 | Lean | UTF-8 | Lean | false | false | 16,850 | 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.set.basic data.option.basic data.equiv.basic
/-- `roption α` is the type of "partial values" of type `α`. It
is similar to `option α` except the domain ... |
97270c4b70e349a4ef42a57e85ada7c5536d223b | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/topology/uniform_space/separation.lean | 9568058cb194736c94251861084e96d38da36f31 | [
"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 | 23,295 | 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, Patrick Massot
-/
import tactic.apply_fun
import data.set.pairwise
import topology.uniform_space.basic
import topology.separation
/-!
# Hausdorff properties of unifor... |
a265cf40e72a36feabcc4640e49a279c54292d83 | 3b15c7b0b62d8ada1399c112ad88a529e6bfa115 | /src/Lean/PrettyPrinter/Delaborator/Basic.lean | df6d19261a9aedff0f4907a4428b80e71777f996 | [
"Apache-2.0"
] | permissive | stephenbrady/lean4 | 74bf5cae8a433e9c815708ce96c9e54a5caf2115 | b1bd3fc304d0f7bc6810ec78bfa4c51476d263f9 | refs/heads/master | 1,692,621,473,161 | 1,634,308,743,000 | 1,634,310,749,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 12,375 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
-/
import Lean.KeyedDeclsAttribute
import Lean.ProjFns
import Lean.Syntax
import Lean.Meta.Match.Match
import Lean.Elab.Term
import Lean.PrettyPrinter.Delabora... |
ad36397e61cab0d57157f32d02e2a9fa5c749cc4 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/real/hyperreal.lean | fc7dcc328ccfb94dcf655455ad62176a8f2ce9d9 | [
"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,026 | lean | /-
Copyright (c) 2019 Abhimanyu Pallavi Sudhir. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Abhimanyu Pallavi Sudhir
-/
import order.filter.filter_product
import analysis.specific_limits.basic
/-!
# Construction of the hyperreal numbers as an ultraproduct of real s... |
0bd84e6e6d1f6ebf15099b3e5c60b7d5375295f5 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/compiler/unreachable.lean | 97731acb7f5627ea829f2b25c2118448e60d47e5 | [
"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 | 84 | lean | def False.elim' {C : Sort u} (h : False) : C := h.rec
def main: IO Unit := pure ()
|
11c75b42f7e78a6ae5ade80c48ce8a197f3219c5 | 95dcf8dea2baf2b4b0a60d438f27c35ae3dd3990 | /src/linear_algebra/basic.lean | 1dea3d8d32dd35e563f99fd871a9f5460cc0ab45 | [
"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 | 57,927 | 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, Kevin Buzzard
Basics of linear algebra. This sets up the "categorical/lattice structure" of
modules, submodules, and linear maps.
-/
import algebra.pi... |
7ec73f8d42701b1a2b34ba40e2e480f307925d13 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/ring_theory/power_series/basic.lean | dc01dd91072314507bc0c6d0e93e19b90698c53f | [
"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 | 64,455 | 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.mv_polynomial
import linear_algebra.std_basis
import ring_theory.ideal.operations
import ring_theory.multiplicity
import ring_theory.algebra_to... |
b5f28da7a2e305e73a7cc618403451df814a4cbc | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/order/sub/defs.lean | e65e0290ed91913fbe2f97c7ef4dbec5c3b15dbe | [
"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,280 | lean | /-
Copyright (c) 2021 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
-/
import algebra.covariant_and_contravariant
import algebra.group.basic
import algebra.order.monoid.lemmas
import order.lattice
/-!
# Ordered Subtraction
> THIS F... |
1000ef9f5e0fb37ae0ed57474d77bb02b7c3605c | b328e8ebb2ba923140e5137c83f09fa59516b793 | /src/Lean/Util.lean | e15f1cbdafc444efcf2d16779885e196f0a35ce1 | [
"Apache-2.0"
] | permissive | DrMaxis/lean4 | a781bcc095511687c56ab060e816fd948553e162 | 5a02c4facc0658aad627cfdcc3db203eac0cb544 | refs/heads/master | 1,677,051,517,055 | 1,611,876,226,000 | 1,611,876,226,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 650 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Util.CollectFVars
import Lean.Util.CollectLevelParams
import Lean.Util.CollectMVars
import Lean.Util.FindMVar
import Lean.Util.MonadCache
import... |
5346299673e31cf406616912ed2ca9e290080ae0 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/group_theory/group_action/default.lean | f64b8ea3262f6aac0403a1e6f29a7d9ddb3cc338 | [
"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 | 39 | lean | import group_theory.group_action.basic
|
0219725cd5befdd0c5143557f92b901f0e641977 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/tactic20.lean | 9f7e5ac0a9e90af206a048e99620dfa4cf61f62c | [
"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 | 166 | lean | import logic
open tactic
definition assump := eassumption
theorem tst {A : Type} {a b c : A} (H1 : a = b) (H2 : b = c) : a = c
:= by apply eq.trans; assump; assump
|
699de398d66d97dd608a358b29dd23a29c874231 | 92b50235facfbc08dfe7f334827d47281471333b | /hott/algebra/category/constructions/comma.hlean | 2d3dd637c00bc32d3100c7cb400a4f39430e2a19 | [
"Apache-2.0"
] | permissive | htzh/lean | 24f6ed7510ab637379ec31af406d12584d31792c | d70c79f4e30aafecdfc4a60b5d3512199200ab6e | refs/heads/master | 1,607,677,731,270 | 1,437,089,952,000 | 1,437,089,952,000 | 37,078,816 | 0 | 0 | null | 1,433,780,956,000 | 1,433,780,955,000 | null | UTF-8 | Lean | false | false | 6,840 | 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
Comma category
-/
import ..functor ..strict ..category
open eq functor equiv sigma sigma.ops is_trunc iso is_equiv
namespace category
structure comma_object ... |
6d74a3d71aefdefabf7540f824d7f19071fc9e13 | 367134ba5a65885e863bdc4507601606690974c1 | /src/computability/partrec_code.lean | 3000a296324fc8e630ee21e89af02e6587d87ad4 | [
"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 | 38,585 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
Godel numbering for partial recursive functions.
-/
import computability.partrec
open encodable denumerable
namespace nat.partrec
open nat (mkpair)
theorem rfind' {f}... |
fa62415844c4d5595914edef43251d63349fe6ec | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/linear_algebra/finsupp.lean | b185fced46f057d7ae3500d35f3971b0e8b5f83d | [
"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 | 30,172 | lean | /-
Copyright (c) 2019 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
-/
import data.finsupp.basic
import linear_algebra.basic
/-!
# Properties of the semimodule `α →₀ M`
Given an `R`-semimodule `M`, the `R`-semimodule structure on `α →₀... |
1653092a005b1299471c28b05d1458d325fe6eea | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Compiler/LCNF/ReduceJpArity.lean | 5687267b66e8b73db35ae1de8940cde39d008324 | [
"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 | 2,430 | lean | /-
Copyright (c) 2022 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Compiler.LCNF.CompilerM
import Lean.Compiler.LCNF.InferType
import Lean.Compiler.LCNF.PassManager
namespace Lean.Compiler.LCNF
/-!
Join point a... |
e726b3ecd3246832c6d1b3a7f351f38adf7e8aa7 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/data/countable/defs.lean | 8cb56fdef833bdeb8c6e80f460120251d9f69417 | [
"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 | 3,218 | lean | /-
Copyright (c) 2022 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import data.finite.defs
/-!
# Countable types
In this file we define a typeclass saying that a given `Sort*` is countable. See also `encodable`
for a version that... |
e8ce78260d4059c98e3d523db10293894c9ce135 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/set_theory/ordinal_notation_auto.lean | e96c9c660c1e5e815cb633184a34916f324119ea | [] | 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 | 20,470 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.set_theory.ordinal_arithmetic
import Mathlib.PostPort
universes l u_1
namespace Mathlib
... |
edcefae622790d01fa0b754daa0e1ae9c6e47ede | 0d7f5899c0475f9e105a439896d9377f80c0d7c3 | /src/.old/lang.lean | d9d2d84c801e1783cb7510a060fbc583c15432bc | [] | no_license | adamtopaz/UnivAlg | 127038f320e68cdf3efcd0c084c9af02fdb8da3d | 2458d47a6e4fd0525e3a25b07cb7dd518ac173ef | refs/heads/master | 1,670,320,985,286 | 1,597,350,882,000 | 1,597,350,882,000 | 280,585,500 | 4 | 0 | null | 1,597,350,883,000 | 1,595,048,527,000 | Lean | UTF-8 | Lean | false | false | 7,565 | lean | import data.vector
import .for_mathlib
--------------- lang ---------------
section
universe v
structure lang := (op : ℕ → Type v)
namespace lang
instance : has_coe_to_fun lang := ⟨_,op⟩
end lang
end
--------------- ralg ---------------
section
universes v u
structure ralg (L : lang.{v}) :=
(carrier : Type u)
(app... |
3fbabe11b764c063b290332309f9422dda58a53c | 2a70b774d16dbdf5a533432ee0ebab6838df0948 | /_target/deps/mathlib/src/data/nat/fib.lean | 1f2cda4f49e59f9612a8fc57bfee91835b17b1c3 | [
"Apache-2.0"
] | permissive | hjvromen/lewis | 40b035973df7c77ebf927afab7878c76d05ff758 | 105b675f73630f028ad5d890897a51b3c1146fb0 | refs/heads/master | 1,677,944,636,343 | 1,676,555,301,000 | 1,676,555,301,000 | 327,553,599 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,632 | lean | /-
Copyright (c) 2019 Kevin Kappelmann. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Kappelmann
-/
import data.stream.basic
import tactic
import data.nat.gcd
/-!
# The Fibonacci Sequence
## Summary
Definition of the Fibonacci sequence `F₀ = 0, F₁ = 1, Fₙ₊₂ = ... |
5a4ea990b6bf0aa611a260f0d852ee843214313e | 1dd482be3f611941db7801003235dc84147ec60a | /src/data/equiv/basic.lean | 387d80b392945b80a046d2d75151786dc95509bc | [
"Apache-2.0"
] | permissive | sanderdahmen/mathlib | 479039302bd66434bb5672c2a4cecf8d69981458 | 8f0eae75cd2d8b7a083cf935666fcce4565df076 | refs/heads/master | 1,587,491,322,775 | 1,549,672,060,000 | 1,549,672,060,000 | 169,748,224 | 0 | 0 | Apache-2.0 | 1,549,636,694,000 | 1,549,636,694,000 | null | UTF-8 | Lean | false | false | 31,913 | 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, Mario Carneiro
In the standard library we cannot assume the univalence axiom.
We say two types are equivalent if they are isomorphic.
Two equivalent types h... |
f64cec2b2bd5f4c72d7988665e41205d2f797538 | 510e96af568b060ed5858226ad954c258549f143 | /data/num/lemmas.lean | 01b22bd94522de586cab32a18670cf41b7297ded | [] | no_license | Shamrock-Frost/library_dev | cb6d1739237d81e17720118f72ba0a6db8a5906b | 0245c71e4931d3aceeacf0aea776454f6ee03c9c | refs/heads/master | 1,609,481,034,595 | 1,500,165,215,000 | 1,500,165,347,000 | 97,350,162 | 0 | 0 | null | 1,500,164,969,000 | 1,500,164,969,000 | null | UTF-8 | Lean | false | false | 15,929 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
Properties of the binary representation of integers.
-/
import .basic .bitwise
meta def unfold_coe : tactic unit :=
`[unfold coe lift_t has_lift_t.lift coe_t has... |
5860cca2b9c20cb0953b65dfd9bf8a81d4c8f6e9 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /library/data/bv.lean | 3c23b85eea24833d9aef45a1c20caeed8c576e08 | [
"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 | 5,087 | lean | /-
Copyright (c) 2015 Joe Hendrix. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Joe Hendrix
Basic operations on bitvectors.
This is a work-in-progress, and contains additions to other theories.
-/
import data.list
import data.tuple
namespace bv
open bool
open eq.op... |
9ffc2f376735f80e6cf7e40603b9c267aeb3acf7 | cb1829c15cd3d28210f93507f96dfb1f56ec0128 | /theorem_proving/10-type_classes.lean | 41cddc42feff29d3e3200229c569de868237acc6 | [] | no_license | williamdemeo/LEAN_wjd | 69f9f76e35092b89e4479a320be2fa3c18aed6fe | 13826c75c06ef435166a26a72e76fe984c15bad7 | refs/heads/master | 1,609,516,630,137 | 1,518,123,893,000 | 1,518,123,893,000 | 97,740,278 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 917 | lean | -- 10. Type Classes
#print "==========================================="
#print "Section 10.1. Type Classes and Instances"
#print " "
namespace Sec_10_1
end Sec_10_1
#print "==========================================="
#print "Section 10.2. Chaining Instances"
#print " "
namespace Sec_10_2
end Sec_10_2
#print ... |
b734a6d01a693cb6b6c15351d3d19664fa133dc8 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/with_attrs1.lean | c535f1d31019cb65e376b72ea792662e04a00d59 | [
"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 | 321 | lean | import data.nat
open nat
constants f : nat → nat → nat
axiom f_ax : ∀ a b, f a b = f b a
example (a b : nat) : f a b = f b a :=
begin
with_attrs f_ax [simp] simp
end
definition g (a : nat) := f a 1
example (a : nat) : g a = f 1 a :=
begin
with_attributes g [reducible] with_attributes f_ax [simp] simp
end
|
f6aff25a3a075d208b9997c641f1660ab71cf19b | 4b846d8dabdc64e7ea03552bad8f7fa74763fc67 | /library/init/algebra/group.lean | 2f95b6f4e1fdadf23c2bdb2cc79efbd1b8ac766a | [
"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 | 15,740 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura
-/
prelude
import init.logic init.algebra.ac init.meta init.meta.decl_cmds init.meta.smt.rsimp
/- Make sure instances defined in this file have... |
f8e3b2fc3ebeb820c374c92c1e1e7a90be4a779b | a4673261e60b025e2c8c825dfa4ab9108246c32e | /src/Init/Data/Hashable.lean | 3a414d6cb66389a34f4705de464c2863e0cf3d95 | [
"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 | 764 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import Init.Data.UInt
import Init.Data.String
universes u
instance : Hashable Nat := {
hash := fun n => USize.ofNat n
}
instance [Hashable α] [H... |
18df04a273dd14177a43ca8f44f8fe32404137a6 | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/order/bounded_lattice.lean | 89c097ab4c07913367c975a07619cc95875c51b8 | [
"Apache-2.0"
] | permissive | hikari0108/mathlib | b7ea2b7350497ab1a0b87a09d093ecc025a50dfa | a9e7d333b0cfd45f13a20f7b96b7d52e19fa2901 | refs/heads/master | 1,690,483,608,260 | 1,631,541,580,000 | 1,631,541,580,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 50,224 | 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 data.option.basic
import logic.nontrivial
import order.lattice
import tactic.pi_instances
/-!
# ⊤ and ⊥, bounded lattices and variants
This file defines top ... |
c76d57076928f786188e16bc3835d1196901121e | f3ab5c6b849dd89e43f1fe3572fbed3fc1baaf0f | /lean/nominal.lean | 80cad4b570637b07e0dc0830f79785c0bde7f603 | [
"Apache-2.0",
"BSD-2-Clause",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | ekmett/coda | 69fa7ac66924ea2cee12f7005b192c22baf9e03e | 3309ea70c31b58a3915b0ecc9140985c3a1ac565 | refs/heads/master | 1,670,616,044,398 | 1,619,020,702,000 | 1,619,020,702,000 | 100,850,826 | 170 | 15 | NOASSERTION | 1,670,434,088,000 | 1,503,220,814,000 | Haskell | UTF-8 | Lean | false | false | 3,990 | lean | open function
open group
-- generally following
-- https://www.cl.cam.ac.uk/~amp12/agda/choudhury/choudhury-dissertation.pdf
def atom : Type := ℕ
def {u} neq {A : Sort u} (a b : A) : Prop
:= (a = b) → false
inductive nelem (a : ℕ) : list ℕ → Prop
| nil : nelem []
| cons : Π {b as}, nelem as -> neq a b -> nelem (b... |
c45f81317e4aac47436298fb23d945a26202e8ae | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/comp_val4.lean | bac77f739f0ce6fa7f9b2e10feda99e2cbd568fc | [
"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 | 323 | lean | open tactic
example : (1030912003002020:int) ≠ 1021992923928 :=
by comp_val
example : -(1030912003002020:int) ≠ 1021992923928 :=
by comp_val
example : (1030912003002020:int) ≠ -1021992923928 :=
by comp_val
example : -(1030912003002020:int) ≠ 0 :=
by comp_val
example : (0:int) ≠ 1021992923928 :=
by comp_val
|
9dd74ecc0670ee63519f2ec66d4ff8a8177c5935 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/eq3.lean | e773d9be8e17d5a70603d1617beb6911bd3e2f5b | [
"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 | 266 | lean | import data.examples.vector
open nat vector
definition swap {A : Type} : Π {n}, vector A (succ (succ n)) → vector A (succ (succ n))
| swap (a :: b :: vs) := b :: a :: vs
example (n : nat) (a b : num) (v : vector num n) : swap (a :: b :: v) = b :: a :: v :=
rfl
|
adcd2c6f32e02fa94a82acf58f8fed772cf49a2d | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/fintype/units.lean | de94d0ad60d8c9dcba6a24661827a24e2376c58e | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 1,279 | 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.prod
import data.fintype.sum
import data.int.units
/-!
# fintype instances relating to units
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any ch... |
afa043f24c5763d3121267e1db1561badea99d82 | 367134ba5a65885e863bdc4507601606690974c1 | /src/set_theory/game/nim.lean | 1881978d078d99e21353613f63ec5e1d57ada70b | [
"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 | 15,404 | lean | /-
Copyright (c) 2020 Fox Thomson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Fox Thomson, Markus Himmel
-/
import data.nat.bitwise
import set_theory.game.impartial
import set_theory.ordinal_arithmetic
/-!
# Nim and the Sprague-Grundy theorem
This file contains t... |
eec6e4e3dc3a705af332bb0bc85acf2ee3896943 | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/data/list/perm.lean | 2e53309e3640ad4224e5b6575aec19e0b72c8304 | [
"Apache-2.0"
] | permissive | troyjlee/mathlib | e18d4b8026e32062ab9e89bc3b003a5d1cfec3f5 | 45e7eb8447555247246e3fe91c87066506c14875 | refs/heads/master | 1,689,248,035,046 | 1,629,470,528,000 | 1,629,470,528,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 53,752 | 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, Mario Carneiro
-/
import data.list.bag_inter
import data.list.erase_dup
import data.list.zip
import logic.relation
/-!
# List permutations
-/
... |
e4e76ba671f1e3249cde4c17f033c180bcf3742f | c8af905dcd8475f414868d303b2eb0e9d3eb32f9 | /examples/perfectly-adapted-signal-response.lean | c8dd39240a0c6f36254a8b0d3d9d05b44e13b6dc | [
"BSD-3-Clause"
] | permissive | continuouspi/lean-cpi | 81480a13842d67ff5f3698643210d8ed5dd08de4 | 443bf2cb236feadc45a01387099c236ab2b78237 | refs/heads/master | 1,650,307,316,582 | 1,587,033,364,000 | 1,587,033,364,000 | 207,499,661 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,742 | lean | import .common
open cpi
open cpi.species
open_locale normalise
def k1 : ℍ := fin_poly.X "k₁"
def k2 : ℍ := fin_poly.X "k₂"
def k3 : ℍ := fin_poly.X "k₃"
def k4 : ℍ := fin_poly.X "k₄"
def aff : affinity ℍ := affinity.mk_pair k2
def ω : context := context.extend 0 (context.extend 0 (context.extend 0 context.nil))
de... |
7f550f82da4b5314a10db1f557a7d69e708ae5fd | c56b090bd37dca8992124f0b09c22340ef7e27bc | /src/lecture4-divisibility.lean | fd5e2528df88825634a1e22abf9a9f8a75288127 | [] | no_license | stjordanis/math135 | df113ed7ae9f81b27316cc5b000f88b385391a81 | e270f3a9cae435c066c0d2574f03a8adbe40b7b5 | refs/heads/master | 1,677,069,951,721 | 1,611,905,122,000 | 1,611,905,122,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,904 | lean | import data.int.basic
import data.nat.parity
import data.nat.prime
import tactic
import tactic.linarith
namespace lecture4
open nat
theorem div_14_div_7 : ∀ N, 14 ∣ N → 7 ∣ N :=
begin
intros N h,
cases h with divisor h,
refine dvd.intro _ _,
let divisor' := 2 * divisor,
use divisor',
simp,
linarith,
en... |
fdc9421ae54e197704015576c5d0f271f1cf7c7c | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/data/mv_polynomial/equiv.lean | bbdf61fa66fa74ecc172887a6c6b1cb99cd21340 | [
"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,822 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Johan Commelin, Mario Carneiro
-/
import data.mv_polynomial.rename
import data.polynomial.algebra_map
import data.polynomial.lifts
import data.mv_polynomial.variables
... |
b40279d4725e8f2380bc5caf6e7d4884b17ec271 | 82b86ba2ae0d5aed0f01f49c46db5afec0eb2bd7 | /src/Lean/Meta/Offset.lean | a18348857d1e4064b24a21651a614c7cda80252a | [
"Apache-2.0"
] | permissive | banksonian/lean4 | 3a2e6b0f1eb63aa56ff95b8d07b2f851072d54dc | 78da6b3aa2840693eea354a41e89fc5b212a5011 | refs/heads/master | 1,673,703,624,165 | 1,605,123,551,000 | 1,605,123,551,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,378 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Data.LBool
import Lean.Meta.InferType
namespace Lean.Meta
partial def evalNat : Expr → Option Nat
| Expr.lit (Literal.natVal n) _ => pure n
... |
cb1689bca7a4bfc1f5c682d33af03a2e480505b7 | dd4e652c749fea9ac77e404005cb3470e5f75469 | /src/alex_playground/uncurr2.lean | bef39e04e3352957199cf4eb81144aad0453b383 | [] | no_license | skbaek/cvx | e32822ad5943541539966a37dee162b0a5495f55 | c50c790c9116f9fac8dfe742903a62bdd7292c15 | refs/heads/master | 1,623,803,010,339 | 1,618,058,958,000 | 1,618,058,958,000 | 176,293,135 | 3 | 2 | null | null | null | null | UTF-8 | Lean | false | false | 2,484 | lean | import data.real.basic
import tactic.interactive
import order.liminf_limsup
universe variables u v w x
-- copied from current mathlib, but changed to support sorts.
section uncurry
variables {α : Sort u} {β : Sort v} {γ : Sort w} {δ : Sort x}
/-- Records a way to turn an element of `α` into a function from `β` to `... |
407c8c1cf83bc5975be898660aabc1d43213991e | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Elab/Tactic/ElabTerm.lean | f8d23ff54989fa04fd5ee384618d8799fd0b501c | [
"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 | 18,109 | 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.Constructor
import Lean.Meta.Tactic.Assert
import Lean.Meta.Tactic.Clear
import Lean.Meta.Tactic.Rename
import Lean.Elab.Tactic.Basi... |
c5af53b9e1050936b3b13ec1ce943dd5733a56e6 | 3618c6e11aa822fd542440674dfb9a7b9921dba0 | /src/coprod/pre.lean | 436bb7fec15915908074ca454fd4af0fa119e135 | [] | no_license | ChrisHughes24/single_relation | 99ceedcc02d236ce46d6c65d72caa669857533c5 | 057e157a59de6d0e43b50fcb537d66792ec20450 | refs/heads/master | 1,683,652,062,698 | 1,683,360,089,000 | 1,683,360,089,000 | 279,346,432 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 21,831 | lean | import data.list.chain
import data.sigma.basic
variables {ι : Type*} {M : ι → Type*} {G : ι → Type*} {N : Type*}
variables [Π i, monoid (M i)] [Π i, group (G i)] [monoid N]
open list function
namespace coprod.pre
def reduced (l : list (Σ i, M i)) : Prop :=
l.chain' (λ a b, a.1 ≠ b.1) ∧ ∀ a : Σ i, M i, a ∈ l → a.2 ≠... |
bde06be70d1f7f7b86c1c9da8ef7e4439aa8c654 | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /src/topology/sequences.lean | ab37790d4298f4446188cc7f84bb5e3017c9c8e6 | [
"Apache-2.0"
] | permissive | kmill/mathlib | ea5a007b67ae4e9e18dd50d31d8aa60f650425ee | 1a419a9fea7b959317eddd556e1bb9639f4dcc05 | refs/heads/master | 1,668,578,197,719 | 1,593,629,163,000 | 1,593,629,163,000 | 276,482,939 | 0 | 0 | null | 1,593,637,960,000 | 1,593,637,959,000 | null | UTF-8 | Lean | false | false | 18,938 | lean | /-
Copyright (c) 2018 Jan-David Salchow. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jan-David Salchow, Patrick Massot
-/
import topology.bases
import topology.subset_properties
import topology.metric_space.basic
/-!
# Sequences in topological spaces
In this file ... |
c550601c8194b0f8469fe5e5d595f6af850e0a99 | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/linear_algebra/determinant.lean | 544c15df1f2f02d629ffd86a601e7e782a714a41 | [
"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 | 15,761 | lean | /-
Copyright (c) 2019 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Patrick Massot, Casper Putz, Anne Baanen
-/
import linear_algebra.free_module.pid
import linear_algebra.matrix.basis
import linear_algebra.matrix.diagonal
import linear... |
6b38933961b1497c28a7591e2bae1c8b75a518fd | b70031c8e2c5337b91d7e70f1e0c5f528f7b0e77 | /src/field_theory/perfect_closure.lean | 3f58ea6d77938403e731597010afd4c2d23b868c | [
"Apache-2.0"
] | permissive | molodiuc/mathlib | cae2ba3ef1601c1f42ca0b625c79b061b63fef5b | 98ebe5a6739fbe254f9ee9d401882d4388f91035 | refs/heads/master | 1,674,237,127,059 | 1,606,353,533,000 | 1,606,353,533,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 16,641 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Yury Kudryashov
-/
import algebra.char_p
import data.equiv.ring
import algebra.group_with_zero.power
import algebra.iterate_hom
/-!
# The perfect closure of a field
-/
universe... |
25f228aa4e561067b8a3256df8d678d1825c8cf4 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/group_theory/free_abelian_group.lean | 069e6160df8e16f576b32fa7209b6943e6dc4be1 | [
"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 | 19,142 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import algebra.group.pi
import group_theory.free_group
import group_theory.abelianization
import algebra.module.basic -- we use the ℤ-module structure on an add_comm_group in ... |
23aaae3bb3ce1a32a9e1e3598a2f155da534f906 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/smt_begin_end1.lean | 9db40378edbe8247b45635b8dd0b51b647c51a29 | [
"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 | 728 | lean | constant p : nat → nat → Prop
constant f : nat → nat
axiom pf (a : nat) : p (f a) (f a) → p a a
example (a b c : nat) : a = b → p (f a) (f b) → p a b :=
begin [smt]
intros,
have h : p (f a) (f a),
trace_state,
add_fact (pf _ h)
end
example (p q : Prop) : p ∨ q → p ∨ ¬q → ¬p ∨ q → ¬p ∨ ¬q → false :=
begin [smt... |
a82b77109afbacb426217626cc489266757703b9 | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /src/data/finset/lattice.lean | 3c721d8305246d2e6dc85da3ce93c973609b3fc6 | [
"Apache-2.0"
] | permissive | kmill/mathlib | ea5a007b67ae4e9e18dd50d31d8aa60f650425ee | 1a419a9fea7b959317eddd556e1bb9639f4dcc05 | refs/heads/master | 1,668,578,197,719 | 1,593,629,163,000 | 1,593,629,163,000 | 276,482,939 | 0 | 0 | null | 1,593,637,960,000 | 1,593,637,959,000 | null | UTF-8 | Lean | false | false | 16,659 | 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 data.finset.fold
import data.multiset.lattice
/-!
# Lattice operations on multisets
-/
variables {α β γ : Type*}
namespace finset
open multiset
/-! ### sup ... |
080337eee5ad97c9f7d25a959b615cedb4ffd945 | cf39355caa609c0f33405126beee2739aa3cb77e | /library/init/data/unsigned/basic.lean | c070966bad51ce633b9662255c5ab87c1c89c58e | [
"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 | 861 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.data.fin.basic
open nat
def unsigned_sz : nat := succ 4294967295
def unsigned := fin unsigned_sz
namespace unsigned
/- We cannot use ... |
2831e866d64bf4ae739ee7c2099869e86f23f0e2 | 7571914d3f4d9677288f35ab1a53a2ad70a62bd7 | /library/init/meta/interactive_base.lean | 2204d3e88ec1b58501e17a4980675baad4ada324 | [
"Apache-2.0"
] | permissive | picrin/lean-1 | a395fed5287995f09a15a190bb24609919a0727f | b50597228b42a7eaa01bf8cb7a4fb1a98e7a8aab | refs/heads/master | 1,610,757,735,162 | 1,502,008,413,000 | 1,502,008,413,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,079 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.data.option.instances
import init.meta.lean.parser init.meta.tactic init.meta.has_reflect
open lean
open lean.parser
local postfix `?`... |
a84745d0f34088c4087ed64a0dfab5700cc5cfc4 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/list/infix.lean | 1d8d58e50fd64dbb6a9b34f76279e32f061f4779 | [
"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,368 | 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.list.basic
/-!
# Prefixes, subfixes, infixes
This file proves properties about
* `list.prefix`: `l₁` is a prefix of `l₂` if `l₂` starts with `l₁`.
* `li... |
fb7a22a96f680d7183c67aa9a6733b8ee5361783 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/tactic/omega/nat/preterm.lean | 81d0d260ae27d9328be97f4855843260707c3d7e | [
"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 | 4,875 | lean | /- Copyright (c) 2019 Seul Baek. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Seul Baek
Linear natural number arithmetic terms in pre-normalized form. -/
import tactic.omega.term
open tactic
namespace omega
namespace nat
/-- The shadow syntax for arithmetic terms... |
1027150d650cdd9f65b4aa426b5e8b78f4ee73f1 | e1440579fb0723caf9edf1ed07aee74bbf4f5ce7 | /lean-experiments/stumps-learnable/src/lib/util.lean | 6df103ed2d4b3259a844a892588cff707734775b | [
"Apache-2.0"
] | permissive | palmskog/coq-proba | 1ecc5b7f399894ea14d6094a31a063280a122099 | f73e2780871e2a3dd83b7ce9d3aed19f499f07e5 | refs/heads/master | 1,599,620,504,720 | 1,572,960,008,000 | 1,572,960,008,000 | 221,326,479 | 0 | 0 | Apache-2.0 | 1,573,598,769,000 | 1,573,598,768,000 | null | UTF-8 | Lean | false | false | 10,007 | lean | /-
Copyright © 2019, Oracle and/or its affiliates. All rights reserved.
-/
import data.set
import analysis.complex.exponential
import .attributed.dvector
import lib.basic
import topology.constructions
local attribute [instance] classical.prop_decidable
open nnreal real ennreal set lattice
open topological_space
op... |
ef28a022ca6dd306fbd45fa881627e4e2529dc3b | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/measure_theory/measure/content.lean | b7c6e0d7cff915a2aeb36e7afc334b0c9647d5a3 | [
"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 | 19,372 | lean | /-
Copyright (c) 2020 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
-/
import measure_theory.measure.measure_space
import measure_theory.measure.regular
import topology.sets.compacts
/-!
# Contents
> THIS FILE IS SYNCHRONIZED WITH ... |
a01cfa53f5f62bb735c2bbec8f2ea7e4c3ea44d1 | 4b846d8dabdc64e7ea03552bad8f7fa74763fc67 | /tests/lean/io_bug2.lean | 5c16f4223948f0e2343121ae3b8bfcf396c706f0 | [
"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 | 136 | lean | import system.io
open io
def main : io unit := do
put_ln "t1",
(x, y) ← return ((1 : nat), (2 : ℕ)),
put_ln "t2"
#eval main
|
76c9abc7f8c6f42c758157c745ee8226a1aa8af1 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/analysis/normed_space/finite_dimension.lean | cfdde83cd0715c3ae150c761e7c15a7293a2024d | [
"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 | 45,019 | 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.asymptotics.asymptotic_equivalent
import analysis.normed_space.affine_isometry
import analysis.normed_space.operator_norm
import analysis.normed... |
bb5288e13e096beb8c31cf8be8f8c3b4cc1994d1 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/data/polynomial/field_division.lean | e35336bad2f994d82ca8a55a4d9d998b4fa4247b | [
"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 | 19,777 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Johannes Hölzl, Scott Morrison, Jens Wagemaker
-/
import data.polynomial.ring_division
import data.polynomial.derivative
import algebra.gcd_monoid
/-!
# Theory of univaria... |
c43a4fc0cc6f01914186418c5234fbb2df97712e | 22e97a5d648fc451e25a06c668dc03ac7ed7bc25 | /src/measure_theory/bochner_integration.lean | bda4ddb7488fe18054a055150afee72f33e7f84e | [
"Apache-2.0"
] | permissive | keeferrowan/mathlib | f2818da875dbc7780830d09bd4c526b0764a4e50 | aad2dfc40e8e6a7e258287a7c1580318e865817e | refs/heads/master | 1,661,736,426,952 | 1,590,438,032,000 | 1,590,438,032,000 | 266,892,663 | 0 | 0 | Apache-2.0 | 1,590,445,835,000 | 1,590,445,835,000 | null | UTF-8 | Lean | false | false | 55,209 | lean | /-
Copyright (c) 2019 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou
-/
import measure_theory.simple_func_dense
import analysis.normed_space.bounded_linear_maps
/-!
# Bochner integral
The Bochner integral extends the definition of the Leb... |
9fbb699235faf038923dfd10e5f13abda9efcb8a | b2fe74b11b57d362c13326bc5651244f111fa6f4 | /src/ring_theory/perfection.lean | b88a70e41466f3164553d58fbf7fa6aada6309f3 | [
"Apache-2.0"
] | permissive | midfield/mathlib | c4db5fa898b5ac8f2f80ae0d00c95eb6f745f4c7 | 775edc615ecec631d65b6180dbcc7bc26c3abc26 | refs/heads/master | 1,675,330,551,921 | 1,608,304,514,000 | 1,608,304,514,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 15,479 | lean | /-
Copyright (c) 2020 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import algebra.char_p
import algebra.ring.pi
import analysis.special_functions.pow
import field_theory.perfect_closure
import ring_theory.localization
import ring_theory.subri... |
bda2a429acdcfffbb6b7d9a9c1ca3696fd5c2719 | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/linear_algebra/determinant.lean | a7f2305f3b726b16ddb6011e9d62051d41412a30 | [
"Apache-2.0"
] | permissive | ilitzroth/mathlib | ea647e67f1fdfd19a0f7bdc5504e8acec6180011 | 5254ef14e3465f6504306132fe3ba9cec9ffff16 | refs/heads/master | 1,680,086,661,182 | 1,617,715,647,000 | 1,617,715,647,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 15,477 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Chris Hughes, Tim Baanen
-/
import data.matrix.pequiv
import data.fintype.card
import group_theory.perm.sign
import algebra.algebra.basic
import tactic.ring
import linear_algebra... |
768c3837d9e1f909c2e5aea35223fd5fa7a0ed51 | d642a6b1261b2cbe691e53561ac777b924751b63 | /src/order/filter/partial.lean | 4d52f752a24156f3d3f8634c87bcd74049365778 | [
"Apache-2.0"
] | permissive | cipher1024/mathlib | fee56b9954e969721715e45fea8bcb95f9dc03fe | d077887141000fefa5a264e30fa57520e9f03522 | refs/heads/master | 1,651,806,490,504 | 1,573,508,694,000 | 1,573,508,694,000 | 107,216,176 | 0 | 0 | Apache-2.0 | 1,647,363,136,000 | 1,508,213,014,000 | Lean | UTF-8 | Lean | false | false | 8,470 | lean | /-
Copyright (c) 2019 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
Extends `tendsto` to relations and partial functions.
-/
import order.filter.basic
import data.pfun
universes u v w
namespace filter
variables {α : Type u} {β : Type v} ... |
8c1de5e675a5f68a9b30349691d7e858c11ba541 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/data/sigma/default_auto.lean | 05ff95251e892bf24093ab827068730294df92c8 | [] | 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 | 308 | 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
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.data.sigma.basic
import Mathlib.Lean3Lib.init.data.sigma.lex
namespace Mathlib
end Mathlib |
4db7b56eefd8540addf61dd407d6810f803bf1ad | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Meta/Match/MatchPatternAttr.lean | fb6044fb41a20cf6a8de2fe7fb34c89ffeddf0c6 | [
"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 | 580 | 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.Attributes
namespace Lean
builtin_initialize matchPatternAttr : TagAttribute ←
registerTagAttribute `match_pattern "mark that a definition c... |
68becea9735bafc8a3d7d313c2e418476db251c2 | a4673261e60b025e2c8c825dfa4ab9108246c32e | /stage0/src/Lean/ResolveName.lean | 874493db79093c4194835f3c25d52803c4c4f0e8 | [
"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 | 8,976 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Sebastian Ullrich
-/
import Lean.Data.OpenDecl
import Lean.Hygiene
import Lean.Modifiers
import Lean.Exception
namespace Lean
/-!
We use aliases to impleme... |
0a016af84f67c829c0cd40fea35873e71030f5c0 | c3f2fcd060adfa2ca29f924839d2d925e8f2c685 | /tests/lean/t7.lean | 7e25aae2ab3f86bdaf342b65e62b65512dedba7c | [
"Apache-2.0"
] | permissive | respu/lean | 6582d19a2f2838a28ecd2b3c6f81c32d07b5341d | 8c76419c60b63d0d9f7bc04ebb0b99812d0ec654 | refs/heads/master | 1,610,882,451,231 | 1,427,747,084,000 | 1,427,747,429,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 629 | lean | prelude definition Prop : Type.{1} := Type.{0}
constant and : Prop → Prop → Prop
context
parameter {A : Type} -- Mark A as implicit parameter
parameter R : A → A → Prop
parameter B : Type
definition id (a : A) : A := a
private definition refl : Prop := ∀ (a : A), R a a
definition symm : Prop := ∀ (a... |
f89adadb7518b44b9df684dec120401c44fe5062 | e030b0259b777fedcdf73dd966f3f1556d392178 | /tests/lean/run/match_convoy.lean | 6996bf3a826482573385701eddb3fc359a472973 | [
"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 | 2,694 | lean | definition foo (a b : bool) : bool :=
match a, b with
| tt, ff := tt
| tt, tt := tt
| ff, tt := tt
| ff, ff := ff
end
example : foo tt tt = tt := rfl
example : foo tt ff = tt := rfl
example : foo ff tt = tt := rfl
example : foo ff ff = ff := rfl
inductive vec (A : Type) : nat → Type
| nil {} : vec nat.zero
| cons :... |
d1efcefb512e9a4fe3c68f435d6be70a4bd63fe7 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/run/vm_eval1.lean | 2bf479fd82d674fdf5461214ac1231c991962a4e | [
"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 | 769 | lean | open bool nat
-- set_option trace.compiler.code_gen true
attribute [reducible]
definition foo (b : bool) : Type :=
cond b nat (nat → nat)
definition bla (b : bool) : foo b → nat :=
bool.cases_on b (λ f, f 100) (λ n, n)
definition of_dec (p : Prop) [h : decidable p] : bool :=
decidable.cases_on h (λ h, ff) (λ h, tt)... |
bd0e7416ea857654d8c353cbe33ffc38726f5d89 | 46ee5dc7248ccc9ee615639c0c003c05f58975cd | /src/soundness.lean | dbac4787b76e561c550d681eb68141b1dc4296e8 | [
"Apache-2.0"
] | permissive | m4lvin/tablean | e61d593b4dde6512245192c577edeb36c48f63c0 | 836202612fc2bfacb5545696412e7d27f7704141 | refs/heads/main | 1,685,613,112,076 | 1,676,755,678,000 | 1,676,755,678,000 | 454,064,275 | 8 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 16,430 | lean | -- SOUNDNESS
import syntax
import tableau
open classical
local attribute [instance, priority 10] prop_decidable
open has_sat
-- Combine a collection of pointed models with one new world using the given valuation.
-- TODO: rewrite to term mode?
def combinedModel { β : Type } (collection : β → Σ (W : Type), kripkeMod... |
4b2ffebcc7141d470d7eab5bfd04fbbe27ae46ac | 9028d228ac200bbefe3a711342514dd4e4458bff | /src/data/int/basic.lean | 250bc5a993d62bdec342cc92f948bec39c3fdc4b | [
"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 | 48,727 | 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 data.nat.basic
import algebra.order_functions
open nat
namespace int
instance : inhabited ℤ := ... |
5bf0b6e0ca9bf05aaf0e7989e201b8f347f3fcee | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/analysis/normed_space/normed_group_quotient.lean | 889180e16ce745ee757806742bbc09d42e34f74d | [
"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 | 22,001 | lean | /-
Copyright (c) 2021 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Riccardo Brasca
-/
import analysis.normed_space.normed_group_hom
/-!
# Quotients of seminormed groups
For any `semi_normed_group M` and any `S : add_subgroup M`, we p... |
fbdde0b16a3b70c9a618ce6fd4f16a67b18fa1ed | d436468d80b739ba7e06843c4d0d2070e43448e5 | /src/data/finset.lean | 5af15aea2d4bb30e15335395568becb7926e6dd4 | [
"Apache-2.0"
] | permissive | roro47/mathlib | 761fdc002aef92f77818f3fef06bf6ec6fc1a28e | 80aa7d52537571a2ca62a3fdf71c9533a09422cf | refs/heads/master | 1,599,656,410,625 | 1,573,649,488,000 | 1,573,649,488,000 | 221,452,951 | 0 | 0 | Apache-2.0 | 1,573,647,693,000 | 1,573,647,692,000 | null | UTF-8 | Lean | false | false | 92,337 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura, Jeremy Avigad, Minchao Wu, Mario Carneiro
Finite sets.
-/
import logic.embedding algebra.order_functions
data.multiset data.sigma.basic data.set.lattice
op... |
21f78bd5fe83fb1b4981d886ab40184e56252e33 | 367134ba5a65885e863bdc4507601606690974c1 | /src/order/filter/basic.lean | e87986e8eb5c1d9f4670c25a9745c57cc5cfe698 | [
"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 | 108,873 | 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, Jeremy Avigad
-/
import order.zorn
import order.copy
import data.set.finite
import tactic.monotonicity
/-!
# Theory of filters on sets
## Main definitions
* `filter`... |
d9235ff5d4d81a6e96b92afb367c9f05e36a2678 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/measure_theory/integral/lebesgue.lean | 6041f5c3b17477440b9de5fb1ebf84d1570680de | [
"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 | 104,216 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Johannes Hölzl
-/
import dynamics.ergodic.measure_preserving
import measure_theory.function.simple_func
import measure_theory.measure.mutually_singular
/-!
# Lower Leb... |
ba2c857fc5d578f30796123c7bb50e10f256f181 | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/data/finset/default.lean | 9450420fae5cfa86c19e027c0dc1e6f035c6ecc4 | [
"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 | 242 | lean | import data.finset.basic
import data.finset.fold
import data.finset.interval
import data.finset.lattice
import data.finset.nat_antidiagonal
import data.finset.pi
import data.finset.powerset
import data.finset.sort
import data.finset.preimage
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.