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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
a34b410a20460ebd267dfbe5687b639d97ed3f9c | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /library/init/prod.lean | 4fee1b1086ae23b6ece23c7c0656ba9b937e4626 | [
"Apache-2.0"
] | permissive | soonhokong/lean-osx | 4a954262c780e404c1369d6c06516161d07fcb40 | 3670278342d2f4faa49d95b46d86642d7875b47c | refs/heads/master | 1,611,410,334,552 | 1,474,425,686,000 | 1,474,425,686,000 | 12,043,103 | 5 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 1,249 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura, Jeremy Avigad
-/
prelude
import init.num init.relation
notation A × B := prod A B
-- notation for n-ary tuples
notation `(` h `, ` t:(foldr `, ` (e r, prod.mk ... |
8478fb529570a6fe8f17a7fdee919dde8a9f009c | 4727251e0cd73359b15b664c3170e5d754078599 | /src/logic/equiv/nat.lean | 977b44562e24be8cc9ea064e58b83443247aba6b | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 2,066 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.nat.pairing
import data.pnat.basic
/-!
# Equivalences involving `ℕ`
This file defines some additional constructive equivalences using `encodable` and th... |
c8628b55524bb9f8b18c10e80087e9a9933a187b | 947b78d97130d56365ae2ec264df196ce769371a | /stage0/src/Lean/Meta/SynthInstance.lean | 8c6ed2751992de1fde358eb433872f42a4c3645a | [
"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 | 24,589 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Daniel Selsam, Leonardo de Moura
Type class instance synthesizer using tabled resolution.
-/
import Lean.Meta.Basic
import Lean.Meta.Instances
import Lean.Meta.LevelDefEq
impor... |
54bd796d7ec7443381a539683fb70967f96bab9d | 592ee40978ac7604005a4e0d35bbc4b467389241 | /Library/generated/mathscheme-lean/Shelf.lean | 0c3a7f92c4f458e11c8f477f6e82d5cb2e0371d3 | [] | 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 | 8,400 | 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 Shelf
structure Shelf (A : Type) : Type :=
(linv : (A → (A → A)))
(rinv : (A → (A → A)))
(leftDistributive : (∀ {x y z : A} , (linv x (linv y z)) = (linv... |
19d0af5fffd54c3abdd480016ea77033358af188 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/geometry/manifold/basic_smooth_bundle.lean | 9b515116da7ee2720c6c881a4fb6d3b72d162121 | [
"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 | 31,797 | 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.topological_fiber_bundle
import geometry.manifold.smooth_manifold_with_corners
/-!
# Basic smooth bundles
In general, a smooth bundle is a bun... |
2f05695c9eebbc368b2b73add8506af20798460a | c31182a012eec69da0a1f6c05f42b0f0717d212d | /src/prop_92/prop_92.lean | fcfeb3c5bbc9f73d597872d6d2d339f3adfe2b02 | [] | no_license | Ja1941/lean-liquid | fbec3ffc7fc67df1b5ca95b7ee225685ab9ffbdc | 8e80ed0cbdf5145d6814e833a674eaf05a1495c1 | refs/heads/master | 1,689,437,983,362 | 1,628,362,719,000 | 1,628,362,719,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,551 | lean | import pseudo_normed_group.CLC
import prop_92.concrete
noncomputable theory
open_locale nnreal
namespace CLCFP
variables (r r' : ℝ≥0) (V : SemiNormedGroup) [normed_with_aut r V] (c c₁ c₂ : ℝ≥0) (n : ℕ)
variables [fact (0 < r)] [fact (0 < r')] [fact (r' ≤ 1)] [fact (c₂ ≤ r' * c₁)] [fact (c₂ ≤ c₁)]
variables (M : (Pr... |
adffb968be577e3cb82b13e860df505bfccaa8c4 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/constr_tac2.lean | 20beb9118c574588179035ec0df026d63a682141 | [
"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 | 95 | lean | open nat
example (n m : ℕ) (H : n < m) : n < succ m :=
begin
constructor 2,
exact H
end
|
f3998399fdce246af035a19873e3160224ff8ea6 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/data/polynomial/coeff.lean | 5e53ed55b57433df1a891872c2a1c80dff09f1e5 | [
"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 | 12,078 | 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.basic
import data.finset.nat_antidiagonal
import data.nat.choose.sum
/-!
# Theory of univariate p... |
ea1f65e9be77aee71e89a86a048cdb4a21b0a4c9 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/esimp1.lean | b7ce1e4d6d8167c61b386aa6f840837766ba90cb | [
"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 | 572 | lean | open nat
example (x y : nat) (H : (fun (a : nat), sigma.pr1 ⟨a, y⟩) x = 0) : x = 0 :=
begin
esimp at H,
exact H
end
definition foo [irreducible] (a : nat) := a
example (x y : nat) (H : (fun (a : nat), sigma.pr1 ⟨foo a, y⟩) x = 0) : x = 0 :=
begin
esimp at H,
esimp ↑foo at H,
exact H
end
example (x y : na... |
a0c92c73d094814be4bfad355e299be8ef698fce | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/analysis/inner_product_space/pi_L2.lean | 77fe7cf13684417956a99220220e859633b69d46 | [
"Apache-2.0"
] | permissive | ramonfmir/mathlib | c5dc8b33155473fab97c38bd3aa6723dc289beaa | 14c52e990c17f5a00c0cc9e09847af16fabbed25 | refs/heads/master | 1,661,979,343,526 | 1,660,830,384,000 | 1,660,830,384,000 | 182,072,989 | 0 | 0 | null | 1,555,585,876,000 | 1,555,585,876,000 | null | UTF-8 | Lean | false | false | 35,191 | lean | /-
Copyright (c) 2020 Joseph Myers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Joseph Myers, Sébastien Gouëzel, Heather Macbeth
-/
import analysis.inner_product_space.projection
import linear_algebra.finite_dimensional
import analysis.normed_space.pi_Lp
/-!
# `L²`... |
3d43306d1c0600afeefeafa94553f20aac840478 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/run/class6.lean | 1e1c9acd719694434cbbc4b1bde9db75d93a3a33 | [
"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 | 320 | lean | open tactic
inductive t1 : Type
| mk1 : t1
inductive t2 : Type
| mk2 : t2
theorem inhabited_t1 : inhabited t1
:= inhabited.mk t1.mk1
theorem inhabited_t2 : inhabited t2
:= inhabited.mk t2.mk2
attribute [instance] inhabited_t1
attribute [instance] inhabited_t2
theorem T : inhabited (t1 × t2)
:= by apply_instance
|
89cdc475f9bec1bdfda171f625f2531ec24854b6 | e1da55f4222dac91b940ca052928eaace09762da | /src/chunk.lean | 3884e51a3a55593095da6cf27a7db306ed5fe780 | [] | no_license | b-mehta/regularity-lemma | c5826e22c280d0b073a4e62dba731f4dd3d1b69f | cf26082b0c88fa54276e6fdc3338c15e607c52c6 | refs/heads/master | 1,658,209,524,267 | 1,644,406,456,000 | 1,644,406,456,000 | 457,327,371 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 28,519 | 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 .bounds
import .finpartitions
import .prereqs
import .witness
/-!
# Chunk of `increment`
-/
open finpartition finset fintype relation... |
3c8598f524f0280041c36eb3b22f1fb5c01f1954 | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /hott/algebra/relation.hlean | 95d476061543a2b17951219f2d8122f717c2b85f | [
"Apache-2.0"
] | permissive | chubbymaggie/lean | 0d06ae25f9dd396306fb02190e89422ea94afd7b | d2c7b5c31928c98f545b16420d37842c43b4ae9a | refs/heads/master | 1,611,313,622,901 | 1,430,266,839,000 | 1,430,267,083,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,446 | hlean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: algebra.relation
Author: Jeremy Avigad
General properties of relations, and classes for equivalence relations and congruences.
-/
namespace relation
/- properties of binary r... |
653d123946487a86d2dde35578f1e3af677fb131 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/topology/algebra/uniform_mul_action.lean | 55eefec7ba24562811eee24ada07d00e646ac96d | [
"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 | 7,412 | lean | /-
Copyright (c) 2022 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov
-/
import topology.algebra.uniform_group
import topology.uniform_space.completion
/-!
# Multiplicative action on the completion of a uniform space
> THIS FILE ... |
0438f00428da5cc089db50bc9df4d423434bdc3c | 7282d49021d38dacd06c4ce45a48d09627687fe0 | /tests/lean/exists8.lean | 725cceaed9e865f6eca5776939a1cfb21a59293a | [
"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,126 | lean | import Int.
variable P : Int -> Int -> Bool
theorem T1 (R1 : not (exists x y, P x y)) : forall x y, not (P x y) :=
fun a b,
(not_exists_elim (not_exists_elim R1 a)) b
axiom Ax : forall x, exists y, P x y
theorem T2 : exists x y, P x y :=
refute (fun R : not (exists x y, P x y),
... |
abd4c8db1fc2820aa3398f156532212f4a49ed9f | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/algebra/group/hom_instances.lean | be6ea16686823d85816cde123443a01476d60fc7 | [
"Apache-2.0"
] | permissive | abentkamp/mathlib | d9a75d291ec09f4637b0f30cc3880ffb07549ee5 | 5360e476391508e092b5a1e5210bd0ed22dc0755 | refs/heads/master | 1,682,382,954,948 | 1,622,106,077,000 | 1,622,106,077,000 | 149,285,665 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,572 | 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 algebra.group_power.basic
/-!
# Instances on spaces of monoid... |
817f0f72719b9efee6837e7ee0606044ec5e1bcd | 4950bf76e5ae40ba9f8491647d0b6f228ddce173 | /src/data/equiv/ring.lean | c8bd07e14a45add3e6d7bd46a1c53b71f444dc13 | [
"Apache-2.0"
] | permissive | ntzwq/mathlib | ca50b21079b0a7c6781c34b62199a396dd00cee2 | 36eec1a98f22df82eaccd354a758ef8576af2a7f | refs/heads/master | 1,675,193,391,478 | 1,607,822,996,000 | 1,607,822,996,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 11,441 | lean | /-
Copyright (c) 2018 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Callum Sutton, Yury Kudryashov
-/
import data.equiv.mul_add
import algebra.field
import algebra.opposites
/-!
# (Semi)ring equivs
In this file we define extension of ... |
657f1510fc255ff0bc3b88a237f4e143804ad481 | 26ac254ecb57ffcb886ff709cf018390161a9225 | /src/algebra/group/with_one.lean | ca4a08c3dd25a2fda46f122174dd343a554385c6 | [
"Apache-2.0"
] | permissive | eric-wieser/mathlib | 42842584f584359bbe1fc8b88b3ff937c8acd72d | d0df6b81cd0920ad569158c06a3fd5abb9e63301 | refs/heads/master | 1,669,546,404,255 | 1,595,254,668,000 | 1,595,254,668,000 | 281,173,504 | 0 | 0 | Apache-2.0 | 1,595,263,582,000 | 1,595,263,581,000 | null | UTF-8 | Lean | false | false | 7,980 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Johan Commelin
-/
import algebra.ring
universes u v
variable {α : Type u}
@[to_additive]
def with_one (α) := option α
namespace with_one
@[to_additive]
instance : m... |
34093976945c989fed74ae74cae8badb018ba1cd | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/expectedTypePropagation.lean | 1616b6be65f475f2c8630b47d37215fb824edd33 | [
"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 | 305 | lean |
instance : Coe Nat Int :=
⟨fun n => Int.ofNat n⟩
def f (x : Nat) : List Int :=
[x]
def g1 (x : Nat) : List Int :=
[x, x]
def g2 (n : Nat) (i : Int) : Int :=
0 + n + i
def g3 (n : Nat) (i : Int) : Int :=
let x : Int := n+i;
x + x
def g4 (n : Nat) (i : Int) : Int :=
let f := fun x => x + i;
f n
|
0bc973da58b30fb430e73fed1e12262ecf3e227f | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/resolveLVal.lean | 78f89c27635ad3e7ce9c9bf27f4d13561c9e1165 | [
"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 | 269 | lean |
namespace Foo
structure A :=
(x : Nat)
def A.doubleX (a : A) :=
2 * a.x
structure B extends A :=
(y : Nat)
def f (b : B) : Nat :=
b.x + b.doubleX
theorem ex1 : { x := 10, y := 0 : B }.doubleX = 20 :=
rfl
theorem ex2 : f { x := 10, y := 0 } = 30 :=
rfl
end Foo
|
b23c6f7e6e5e37ce4ae59fd26e6c4c074a7a9f60 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/analysis/inner_product_space/rayleigh.lean | 4ef2624b746dae6b9577583ac0a661eba432d222 | [
"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 | 12,774 | lean | /-
Copyright (c) 2021 Heather Macbeth. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Heather Macbeth, Frédéric Dupuis
-/
import analysis.inner_product_space.calculus
import analysis.inner_product_space.dual
import analysis.inner_product_space.adjoint
import analysis.c... |
26586aff53105cf5944fc559d782063c1b87d072 | ea5678cc400c34ff95b661fa26d15024e27ea8cd | /mertens.lean | 97082df5c90dc31a298a5d85b3643fa3a045bfdb | [] | no_license | ChrisHughes24/leanstuff | dca0b5349c3ed893e8792ffbd98cbcadaff20411 | 9efa85f72efaccd1d540385952a6acc18fce8687 | refs/heads/master | 1,654,883,241,759 | 1,652,873,885,000 | 1,652,873,885,000 | 134,599,537 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,603 | lean | import data.nat.basic data.complex.basic data.rea l.cau_seq .exponential.series
local attribute [instance, priority 0] classical.prop_decidable
noncomputable theory
open nat is_absolute_value
lemma series_series_diag {α : Type*} [add_comm_monoid α] (f : ℕ → ℕ → α) (n : ℕ) : series (λ i,
series (λ k, f k (i - k)) i)... |
0f107b55c80e48d70e69e27cf85c98a3512c6be2 | 432d948a4d3d242fdfb44b81c9e1b1baacd58617 | /src/group_theory/nielsen_schreier.lean | bda61f8124bd4d7ab1d5376dc1c66a121a5a77a0 | [
"Apache-2.0"
] | permissive | JLimperg/aesop3 | 306cc6570c556568897ed2e508c8869667252e8a | a4a116f650cc7403428e72bd2e2c4cda300fe03f | refs/heads/master | 1,682,884,916,368 | 1,620,320,033,000 | 1,620,320,033,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 12,022 | lean | /-
Copyright (c) 2021 David Wärn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Wärn
-/
import category_theory.action
import combinatorics.quiver
import group_theory.is_free_group
/-!
# The Nielsen-Schreier theorem
This file proves that a subgroup of a free gro... |
14d6a8438bf5036d45a9979ea78c94df8963aad7 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/representation_theory/group_cohomology/basic.lean | a972d9f61f84910eaa17c2c9d48b2ac8f9f56316 | [
"Apache-2.0"
] | permissive | kbuzzard/mathlib | 2ff9e85dfe2a46f4b291927f983afec17e946eb8 | 58537299e922f9c77df76cb613910914a479c1f7 | refs/heads/master | 1,685,313,702,744 | 1,683,974,212,000 | 1,683,974,212,000 | 128,185,277 | 1 | 0 | null | 1,522,920,600,000 | 1,522,920,600,000 | null | UTF-8 | Lean | false | false | 8,578 | lean | /-
Copyright (c) 2023 Amelia Livingston. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Amelia Livingston
-/
import algebra.homology.opposite
import representation_theory.group_cohomology.resolution
/-!
# The group cohomology of a `k`-linear `G`-representation
Let `... |
f9de2c88461f3ce0a61122fa7a2712d7a85563af | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/order/basic.lean | 9e149ab14bdd54a92d29eeb012d58bc150195af9 | [
"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 | 25,072 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Mario Carneiro
-/
import data.prod
import data.subtype
/-!
# Basic definitions about `≤` and `<`
This file proves basic results about orders, provides extensive dot not... |
d5607cf05cb0add831fdc88cc2dd39a30f413549 | 7cef822f3b952965621309e88eadf618da0c8ae9 | /test/linarith.lean | 8586169385460df654d84aab8aa360d54f4e1ae7 | [
"Apache-2.0"
] | permissive | rmitta/mathlib | 8d90aee30b4db2b013e01f62c33f297d7e64a43d | 883d974b608845bad30ae19e27e33c285200bf84 | refs/heads/master | 1,585,776,832,544 | 1,576,874,096,000 | 1,576,874,096,000 | 153,663,165 | 0 | 2 | Apache-2.0 | 1,544,806,490,000 | 1,539,884,365,000 | Lean | UTF-8 | Lean | false | false | 4,413 | lean | import tactic.linarith
example (e b c a v0 v1 : ℚ) (h1 : v0 = 5*a) (h2 : v1 = 3*b) (h3 : v0 + v1 + c = 10) :
v0 + 5 + (v1 - 3) + (c - 2) = 10 :=
by linarith
example (ε : ℚ) (h1 : ε > 0) : ε / 2 + ε / 3 + ε / 7 < ε :=
by linarith
example (x y z : ℚ) (h1 : 2*x < 3*y) (h2 : -4*x + z/2 < 0)
(h3 : 12*y - z < ... |
587e2b5a6f6dace7f0e1cc461b3fb214a1af4aaa | 367134ba5a65885e863bdc4507601606690974c1 | /src/tactic/norm_cast.lean | 3aefd8dc882bfc33c686ea0f54463a7a02608dce | [
"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 | 26,441 | lean | /-
Copyright (c) 2019 Paul-Nicolas Madelaine. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Paul-Nicolas Madelaine, Robert Y. Lewis
Normalizing casts inside expressions.
-/
import tactic.converter.interactive
import tactic.hint
/-!
# A tactic for normalizing casts i... |
0de284b10fc879326350f6d61cbf6c8c788071c9 | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /src/Lean/Compiler/LCNF/Simp/SimpM.lean | a067ea300d1a13c015645e2d609ae1d213250b46 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | tobiasgrosser/lean4 | ce0fd9cca0feba1100656679bf41f0bffdbabb71 | ebdbdc10436a4d9d6b66acf78aae7a23f5bd073f | refs/heads/master | 1,673,103,412,948 | 1,664,930,501,000 | 1,664,930,501,000 | 186,870,185 | 0 | 0 | Apache-2.0 | 1,665,129,237,000 | 1,557,939,901,000 | Lean | UTF-8 | Lean | false | false | 9,646 | 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.ImplementedByAttr
import Lean.Compiler.LCNF.Renaming
import Lean.Compiler.LCNF.ElimDead
import Lean.Compiler.LCNF.AlphaEqv
import Lean.... |
83fdb9d21d1504b7c85211dd190c8ef79dc404eb | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/data/dlist.lean | a07d447f132b24d88d705fd2d140c51e66c638ad | [] | 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 | 2,427 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
universes u l
namespace Mathlib
/--
A difference list is a function that, given a list, ret... |
a58a4fb3b39cf635c63deef3f6a28baf4c2af7d0 | 5d76f062116fa5bd22eda20d6fd74da58dba65bb | /src/snarks/pinocchio/vars.lean | d9dc3b5dfa75fed216917a4aa8a867550c015b62 | [] | no_license | brando90/formal_baby_snark | 59e4732dfb43f97776a3643f2731262f58d2bb81 | 4732da237784bd461ff949729cc011db83917907 | refs/heads/master | 1,682,650,246,414 | 1,621,103,975,000 | 1,621,103,975,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 271 | lean |
section
/-- An inductive type from which to index the variables of the 3-variable polynomials the proof manages -/
@[derive decidable_eq]
inductive vars : Type
| r_v : vars
| r_w : vars
| s : vars
| α_v : vars
| α_w : vars
| α_y : vars
| β : vars
| γ : vars
end |
41d7fbba4a69dd18a363f62f23cf450bf85aa996 | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/tactic/push_neg.lean | d29c01defda63cef4c1f89d6a08df1ca18e363a5 | [
"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 | 7,974 | lean | /-
Copyright (c) 2019 Patrick Massot All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Patrick Massot, Simon Hudon
A tactic pushing negations into an expression
-/
import tactic.interactive
import algebra.order
open tactic expr
namespace push_neg
section
universe u
... |
c225f8a08eb2cf447523a12a7ab4224844bd98fb | 82b86ba2ae0d5aed0f01f49c46db5afec0eb2bd7 | /tests/lean/run/frontend1.lean | d7aa814e931e878cdecc467aca208776646feb92 | [
"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 | 7,156 | lean | #lang lean4
import Lean.Elab
open Lean
open Lean.Elab
def runM (input : String) (failIff : Bool := true) : CoreM Unit := do
let env ← getEnv;
let opts ← getOptions;
let (env, messages) ← liftIO $ process input env opts;
messages.forM $ fun msg => (liftIO msg.toString) >>= IO.println;
when (failIff && messages.hasErro... |
00c8e764eccfa25923de7b3a40d2c5de9dec6adb | 1ce2e14f78a7f514bae439fbbb1f7fa2932dd7dd | /src/list.lean | 827b26a0940a57bd91e5dff422e3e3425b5b9f7e | [
"MIT"
] | permissive | wudcscheme/lean-mathgirls | b88faf76d12e5ca07b83d6e5580663380b0bb45c | 95b64a33ffb34f3c45e212c4adff3cc988dcbc60 | refs/heads/master | 1,678,994,115,961 | 1,585,127,877,000 | 1,585,127,877,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,996 | lean | import data.list init.algebra.classes
import tactic.norm_num tactic.tauto tactic.rewrite tactic.rewrite_all tactic.omega tactic.tidy
import tactic.hint
variables {α: Type*}
variables [semiring α]
@[simp]
theorem map_id {l: list α}: list.map (λ x, x) l = l := begin
induction l, reflexivity, simp, assumption,
... |
acb709c8c8d8291dc6cf8414a2d4294c3e5a50f9 | 82b86ba2ae0d5aed0f01f49c46db5afec0eb2bd7 | /stage0/src/Lean/CoreM.lean | d20c6bec642a06901ead58e32eb9150e51620b95 | [
"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,097 | 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.RecDepth
import Lean.Util.Trace
import Lean.Environment
import Lean.Exception
import Lean.InternalExceptionId
import Lean.Eval
import Lean.... |
762abc8450b64d48779718ae8c6dbcea85c30193 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/analysis/box_integral/partition/measure.lean | 59650c2282b00d257843908c57d0103a37fae2d0 | [
"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 | 4,074 | lean | /-
Copyright (c) 2021 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import analysis.box_integral.partition.additive
import measure_theory.measure.lebesgue
/-!
# Box-additive functions defined by measures
In this file we prove a fe... |
748c861450e67696846475ecf7c7daf3699ede8d | c777c32c8e484e195053731103c5e52af26a25d1 | /src/set_theory/ordinal/natural_ops.lean | ff6f1e849beffe3554a5aff9ae98298204fb1910 | [
"Apache-2.0"
] | permissive | kbuzzard/mathlib | 2ff9e85dfe2a46f4b291927f983afec17e946eb8 | 58537299e922f9c77df76cb613910914a479c1f7 | refs/heads/master | 1,685,313,702,744 | 1,683,974,212,000 | 1,683,974,212,000 | 128,185,277 | 1 | 0 | null | 1,522,920,600,000 | 1,522,920,600,000 | null | UTF-8 | Lean | false | false | 12,152 | 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.ordinal.arithmetic
/-!
# Natural operations on ordinals
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this ... |
1b12e037a6c6a27e9557b35654ab924b3d0557bd | c777c32c8e484e195053731103c5e52af26a25d1 | /src/linear_algebra/exterior_algebra/of_alternating.lean | 0aaeb47af7172350267b536a12c4f183ada0cb70 | [
"Apache-2.0"
] | permissive | kbuzzard/mathlib | 2ff9e85dfe2a46f4b291927f983afec17e946eb8 | 58537299e922f9c77df76cb613910914a479c1f7 | refs/heads/master | 1,685,313,702,744 | 1,683,974,212,000 | 1,683,974,212,000 | 128,185,277 | 1 | 0 | null | 1,522,920,600,000 | 1,522,920,600,000 | null | UTF-8 | Lean | false | false | 6,188 | lean | /-
Copyright (c) 2022 Eric Wieser. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Eric Wieser
-/
import linear_algebra.clifford_algebra.fold
import linear_algebra.exterior_algebra.basic
/-!
# Extending an alternating map to the exterior algebra
## Main definitions
... |
1e0060a111b78a190f26aa8742d0d4411e998c47 | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/topology/algebra/ordered/basic.lean | 68a45f6afc72b5acdac73a15b1e4374ddb4dce37 | [
"Apache-2.0"
] | permissive | abentkamp/mathlib | d9a75d291ec09f4637b0f30cc3880ffb07549ee5 | 5360e476391508e092b5a1e5210bd0ed22dc0755 | refs/heads/master | 1,682,382,954,948 | 1,622,106,077,000 | 1,622,106,077,000 | 149,285,665 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 168,910 | 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, Yury Kudryashov
-/
import tactic.tfae
import algebra.group_with_zero.power
import data.set.intervals.pi
import topology.algebra.group
import order.filte... |
d022733d6273130b796e0c3cb4d6db2e4ccf4be2 | 83bd63fd58ebbb33f769cbf6d6a67463ba1bc637 | /src/day_3/subgroups.lean | 4dcf98b1d458d5733d6b1ea0eb0f903f83f37552 | [] | no_license | Wornbard/mbl_lean_workshop | 6ebdafebac74f1b1148f67a528242a3687af17e1 | 6b68ce25fdc49043fd5ab409de8e4a2987def22e | refs/heads/main | 1,690,205,591,845 | 1,630,953,271,000 | 1,630,953,271,000 | 403,417,180 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,429 | lean | import day_3.groups
/-!
## Subgroups
We define the structure `subgroup G`, whose terms are subgroups of `G`.
A subgroup of `G` is implemented as a subset of `G` closed under
`1`, `*` and `⁻¹`.
-/
namespace mbl
/-- A subgroup of a group G is a subset containing 1
and closed under multiplication and inverse. -/
str... |
d3b9b5c65ca53d4114f5538397e21448656c2550 | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/elab_bug1.lean | 939f5a7ec70fc7b46f89969a2cc513e9ac525fc5 | [
"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 | 145 | lean | set_option pp::implicit true
check let P : Nat → Bool := λ x, x ≠ 0,
Q : ∀ x, P (x + 1) := λ x, Nat::succ_nz x
in Q |
76feed89ebf125fbe0cfb2737493a29c38d9da3b | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/ulift.lean | 1c45f97e97983c0a93692a716b9801408822e690 | [
"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 | 2,849 | lean | /-
Copyright (c) 2021 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import logic.equiv.basic
/-!
# Extra lemmas about `ulift` and `plift`
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> https://github.com/leanprover-community/mathlib... |
20f6324517d9476763fa3d1ea76713aca221bc94 | 9e90bb7eb4d1bde1805f9eb6187c333fdf09588a | /src/stump/setup_measurable.lean | 17d523a375cf0b693c877b6907a559463ea7ce69 | [
"Apache-2.0"
] | permissive | alexjbest/stump-learnable | 6311d0c3a1a1a0e65ce83edcbb3b4b7cecabb851 | f8fd812fc646d2ece312ff6ffc2a19848ac76032 | refs/heads/master | 1,659,486,805,691 | 1,590,454,024,000 | 1,590,454,024,000 | 266,173,720 | 0 | 0 | Apache-2.0 | 1,590,169,884,000 | 1,590,169,883,000 | null | UTF-8 | Lean | false | false | 10,921 | lean | /-
Copyright © 2019, Oracle and/or its affiliates. All rights reserved.
-/
import .setup_definition .setup_properties
open set
open measure_theory
open probability_measure
open lattice
local attribute [instance] classical.prop_decidable
namespace stump
variables (μ: probability_measure ℍ) (target: ℍ)
lemma is_me... |
0d7d5cb56e4046aca9c625aca9e0b06abe634c0f | 2caa8cd2737f8e6ea2ec83101247ef95d28a4406 | /src/chapter2.lean | 3b9d2e22a4d10a7a4829bb104172ebb5c779b314 | [] | no_license | ruler501/DescriptiveSetTheory | 1a079368bf2b06fbcba6864f31f4d3ff2a89195c | 08a91bcd1533a88a28c2fac45d26ff223de2e9e6 | refs/heads/master | 1,676,123,700,591 | 1,610,658,976,000 | 1,610,658,976,000 | 327,178,014 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,754 | lean | import set_theory.ordinal
import tactic.linarith
open set classical
universes u
variables {α : Type u} {m : ℕ} {n : ℕ}
def lift_value (is : fin m) (h : m ≤ n) : fin n :=
let i := is.val in
let hi : i < m := is.property in
⟨i, gt_of_ge_of_gt h hi⟩
-- instance nat_to_subtype : has_coe ℕ Type := ⟨λ (n : ℕ), ... |
fc9448aebf6da1950017163aa16f12edcca4a3d5 | 5ae26df177f810c5006841e9c73dc56e01b978d7 | /src/data/int/basic.lean | 3d3fd48b7f4ab778a032ba41d8f78bb35b202e8f | [
"Apache-2.0"
] | permissive | ChrisHughes24/mathlib | 98322577c460bc6b1fe5c21f42ce33ad1c3e5558 | a2a867e827c2a6702beb9efc2b9282bd801d5f9a | refs/heads/master | 1,583,848,251,477 | 1,565,164,247,000 | 1,565,164,247,000 | 129,409,993 | 0 | 1 | Apache-2.0 | 1,565,164,817,000 | 1,523,628,059,000 | Lean | UTF-8 | Lean | false | false | 50,454 | 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 data.list.basic algebra.char_zero algebra.order_functions
open nat
namespace int
... |
84df06aa7baa074019d7c9693c3dc86c894a7fd2 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/data/equiv/mul_add.lean | 76a3badc0f642302599c245b5bd1ee43563344ff | [
"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 | 24,506 | lean | /-
Copyright (c) 2018 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Callum Sutton, Yury Kudryashov
-/
import algebra.group.hom
import algebra.group.type_tags
import algebra.group.units_hom
import algebra.group_with_zero
/-!
# Multiplic... |
bdd4d1adc6496d55c150e0abbc6ce6d4e976dc5e | 618003631150032a5676f229d13a079ac875ff77 | /src/algebra/category/Group/limits.lean | 0fa7d14d3f192b6c04ff8a9a5c89ab795c900d26 | [
"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 | 4,252 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import algebra.category.Group.basic
import category_theory.limits.types
import algebra.pi_instances
/-!
# The category of abelian groups has all limits
Further, the... |
8b9584bc68d894566801696af03ddf45c811b55b | d7189ea2ef694124821b033e533f18905b5e87ef | /galois/csp/class.lean | 0bc06eb3f31ff86e043cd255e2002c5e8468fae3 | [
"Apache-2.0"
] | permissive | digama0/lean-protocol-support | eaa7e6f8b8e0d5bbfff1f7f52bfb79a3b11b0f59 | cabfa3abedbdd6fdca6e2da6fbbf91a13ed48dda | refs/heads/master | 1,625,421,450,627 | 1,506,035,462,000 | 1,506,035,462,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,047 | lean | universe variable u
namespace csp
-- | This defines the monad process class for messages.
--
-- Defined as a class so that components can depend on this.
class has_send_receive (msg_t : Type) (m : Type → Type u) :=
(send : msg_t → m unit)
(receive : Π (guard : msg_t → bool), m (psigma (λ(m : msg_t), guard m = tt)))
... |
37c128ddb846ecd5f1854eb1b63cea6817e1222f | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/run/calc_auto_trans_eq.lean | bc39e13752c68ebabad9aa92d66dfeb60d75861d | [
"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 | 513 | lean | constant R : Π {A : Type}, A → A → Prop
infix `~` := R
example {A : Type} {a b c d : list nat} (H₁ : a ~ b) (H₂ : b = c) (H₃ : c = d) : a ~ d :=
calc a ~ b : H₁
... = c : H₂
... = d : H₃
example {A : Type} {a b c d : list nat} (H₁ : a = b) (H₂ : b = c) (H₃ : c ~ d) : a ~ d :=
calc a = b : H₁
... = c : H₂
... |
9a00481c4e751eb088e0d4c3fcac39483e8d7cec | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/constr_tac4.lean | e3a62d79a89f8c6fa5e556beb71fda0a32b9c83f | [
"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 | 567 | lean | import data.nat
open nat
namespace foo
definition lt.trans {a b c : nat} (H₁ : a < b) (H₂ : b < c) : a < c :=
have aux : a < b → a < c, from
le.rec_on H₂
(λ h₁, lt.step h₁)
(λ b₁ bb₁ ih h₁, by constructor; exact ih h₁),
aux H₁
definition succ_lt_succ {a b : nat} (H : a < b) : succ a < succ b :=
le.rec_on H
... |
324fd012d3a355d0d0b89c6eb99d048f08197a4e | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/pp_numeral_types.lean | 8381057a7ff25ee6a0cc3616d34f3986877e2832 | [
"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 | 507 | lean | local attribute [pp_numeral_type] fin
#check (17 : fin 22)
local attribute [pp_numeral_type] nat
#check (17 : fin 22)
#check nat.zero.succ.succ.succ
set_option pp.numeral_types true
#check 2 + 1 = 3
#check (17 : fin 22)
#check 3
#check nat.zero.succ.succ.succ
set_option pp.all true
#check 3
#check nat.zero.s... |
99a123bc89c58394e0ddc65fc8394de11883d414 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/topology/sheaves/sheaf_condition/opens_le_cover.lean | 56b72565bbdddacf2e14b4ccea7a68587d32de6d | [
"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 | 13,936 | 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.presheaf
import category_theory.limits.final
import topology.sheaves.sheaf_condition.pairwise_intersections
/-!
# Another version of the shea... |
59f20f02ad0a1c0d41062b5834fc022fe6ed778f | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /11_Tactic-Style_Proofs.org.4.lean | 25a90bb861430f49319523d6f19d7cf50079ddb3 | [] | no_license | cjmazey/lean-tutorial | ba559a49f82aa6c5848b9bf17b7389bf7f4ba645 | 381f61c9fcac56d01d959ae0fa6e376f2c4e3b34 | refs/heads/master | 1,610,286,098,832 | 1,447,124,923,000 | 1,447,124,923,000 | 43,082,433 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 151 | lean | import standard
-- BEGIN
theorem test (p q : Prop) (Hp : p) (Hq : q) : p ∧ q ∧ p :=
begin
apply (and.intro Hp),
exact (and.intro Hq Hp)
end
-- END
|
d956af22f65e6aa571d74215164aa600f39836c7 | 86f6f4f8d827a196a32bfc646234b73328aeb306 | /examples/sets_functions_and_relations/unnamed_178.lean | afc2ebdbb0c0f55be9173608c443c1772ec91572 | [] | 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 | 238 | lean | import tactic
variable {α : Type*}
variables (s t u : set α)
-- BEGIN
example : s ∩ (t ∪ u) ⊆ (s ∩ t) ∪ (s ∩ u) :=
begin
rintros x ⟨xs, xt | xu⟩,
{ left, exact ⟨xs, xt⟩ },
right, exact ⟨xs, xu⟩
end
-- END |
3d162306e173e216af0b04f7499a04f214550f26 | 54c9ed381c63410c9b6af3b0a1722c41152f037f | /experiments/delaborate/Delaborate.lean | 1b6d5cff36d3689331205fd3a7b92649ef5daddf | [
"Apache-2.0"
] | permissive | dselsam/binport | 0233f1aa961a77c4fc96f0dccc780d958c5efc6c | aef374df0e169e2c3f1dc911de240c076315805c | refs/heads/master | 1,687,453,448,108 | 1,627,483,296,000 | 1,627,483,296,000 | 333,825,622 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,501 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Daniel Selsam
-/
import Lean
import Std.Data.HashSet
open Lean Lean.Meta Lean.Elab.Term
open Std (HashSet mkHashSet)
def Lean.MessageLog.getErrorMessages (log : MessageLog) : ... |
0e7d237b7ea57877cfe1313ce3147a644d99cc7a | 26ac254ecb57ffcb886ff709cf018390161a9225 | /src/linear_algebra/direct_sum_module.lean | 473074a13ad699f616c7e186b1faf66af1ec8cd8 | [
"Apache-2.0"
] | permissive | eric-wieser/mathlib | 42842584f584359bbe1fc8b88b3ff937c8acd72d | d0df6b81cd0920ad569158c06a3fd5abb9e63301 | refs/heads/master | 1,669,546,404,255 | 1,595,254,668,000 | 1,595,254,668,000 | 281,173,504 | 0 | 0 | Apache-2.0 | 1,595,263,582,000 | 1,595,263,581,000 | null | UTF-8 | Lean | false | false | 4,808 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
Direct sum of modules over commutative rings, indexed by a discrete type.
-/
import algebra.direct_sum
import linear_algebra.basic
/-!
# Direct sum of modules over commutative r... |
f1766786368ef7b908dd1dbaed39d9ccbb946703 | 618003631150032a5676f229d13a079ac875ff77 | /src/algebra/order.lean | 13f75d3cdc1493c8745375cd6a743acddc2c8b1a | [
"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 | 9,514 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
universe u
variables {α : Type u}
@[simp] lemma ge_iff_le [preorder α] {a b : α} : a ≥ b ↔ b ≤ a := iff.rfl
@[simp] lemma gt_iff_lt [preorder α] {a b : α} : a > b ↔... |
270495ecb380b0c9c465ba64d3fdb51d6d43c87a | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /src/Lean/PrettyPrinter.lean | 5b8682616ce390ab7a909de1c20acf057c38f459 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | tobiasgrosser/lean4 | ce0fd9cca0feba1100656679bf41f0bffdbabb71 | ebdbdc10436a4d9d6b66acf78aae7a23f5bd073f | refs/heads/master | 1,673,103,412,948 | 1,664,930,501,000 | 1,664,930,501,000 | 186,870,185 | 0 | 0 | Apache-2.0 | 1,665,129,237,000 | 1,557,939,901,000 | Lean | UTF-8 | Lean | false | false | 4,404 | lean | /-
Copyright (c) 2020 Sebastian Ullrich. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
-/
import Lean.PrettyPrinter.Delaborator
import Lean.PrettyPrinter.Parenthesizer
import Lean.PrettyPrinter.Formatter
import Lean.Parser.Module
import Lean.ParserCo... |
e83dc2b2bc70d300a3d4be46a63babcd69bfccfd | 60bf3fa4185ec5075eaea4384181bfbc7e1dc319 | /src/game/sup_inf/level04.lean | c8564f2bc1b12b6558ea5173877790bb17617c04 | [
"Apache-2.0"
] | permissive | anrddh/real-number-game | 660f1127d03a78fd35986c771d65c3132c5f4025 | c708c4e02ec306c657e1ea67862177490db041b0 | refs/heads/master | 1,668,214,277,092 | 1,593,105,075,000 | 1,593,105,075,000 | 264,269,218 | 0 | 0 | null | 1,589,567,264,000 | 1,589,567,264,000 | null | UTF-8 | Lean | false | false | 1,443 | lean | import data.real.basic
namespace xena -- hide
/-
# Chapter 3 : Sup and Inf
## Level 4
-/
definition is_upper_bound (S : set ℝ) (x : ℝ) := ∀ s ∈ S, s ≤ x
definition is_lub' (S : set ℝ) (x : ℝ) := is_upper_bound S x ∧
∀ y : ℝ, is_upper_bound S y → x ≤ y
definition has_lub (S : set ℝ) := ∃ x, is_lub' S x
/-
A ... |
d09b31f5c910e13123b080741141aa1fa7438e6b | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/analysis/complex/arg.lean | 3ca878c0a8de30390da16b757a0b9152ffe3f074 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 2,088 | lean | /-
Copyright (c) 2022 Eric Rodriguez. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Eric Rodriguez
-/
import analysis.inner_product_space.basic
import analysis.special_functions.complex.arg
/-!
# Rays in the complex numbers
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4... |
98aac41a30008471927f593e50d6a782cddb78ad | 0d22ec5e0205ec4203aae2ddf07e1f695ff21a61 | /src/mv_polynomial_derivations.lean | 79a594c128b1a4d3dae8eba26dbeaaa3733ea0f1 | [
"Apache-2.0"
] | permissive | shingtaklam1324/step3-06-q8-lean | 4611fda6b002797d38d3f625253960dcfeb2a987 | 20e5161fab8b5c3c2dd051bd707a26f1dc50dac2 | refs/heads/master | 1,649,936,589,910 | 1,585,242,273,000 | 1,585,242,273,000 | 250,318,324 | 2 | 0 | Apache-2.0 | 1,585,389,271,000 | 1,585,241,690,000 | Lean | UTF-8 | Lean | false | false | 715 | lean | import tactic
data.mv_polynomial
structure mv_polynomial_derivation (R : Type) (S : Type) [comm_ring R] :=
(to_fun : mv_polynomial S R → mv_polynomial S R) -- Delta
(map_add' : ∀ (f g : mv_polynomial S R), to_fun (f + g) = to_fun f + to_fun g)
(map_C_mul' : ∀ (k : R) (f : mv_polynomial S R), to_fun (mv_polynomi... |
91e7d7fc53b78eb8c2e3f3f9f4bcadfefe202c20 | 6fca17f8d5025f89be1b2d9d15c9e0c4b4900cbf | /src/game/world10/level7.lean | 211fc01a082c43e7ffb43feaaeb68e5824653f07 | [
"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 | 424 | lean | import game.world10.level6 -- hide
namespace mynat -- hide
/-
# Inequality world
## Level 7: `le_zero`
We proved `add_right_eq_zero` back in advanced addition world.
Note that you can do things like `have h2 := add_right_eq_zero _ _ h1`
if `h1 : a + c = 0`.
-/
/- Lemma
For all naturals $a$, if $a\le 0$ then $a = 0$... |
831d4577652baaaf3d9e565b98f9da8ce2519f94 | 36c7a18fd72e5b57229bd8ba36493daf536a19ce | /library/data/nat/examples/partial_sum.lean | f50793686332a76b6bc0eda64e282afc2aae2b3d | [
"Apache-2.0"
] | permissive | YHVHvx/lean | 732bf0fb7a298cd7fe0f15d82f8e248c11db49e9 | 038369533e0136dd395dc252084d3c1853accbf2 | refs/heads/master | 1,610,701,080,210 | 1,449,128,595,000 | 1,449,128,595,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,173 | 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
-/
import data.nat
open nat algebra
definition partial_sum : nat → nat
| 0 := 0
| (succ n) := succ n + partial_sum n
example : partial_sum 5 = 15 :=
rf... |
28d68fb6130191e07c1beed859caadbada02e958 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/blast_unit2.lean | 779cb333f7cabcb5c54266c439b2fa1a07bfb8b6 | [
"Apache-2.0"
] | permissive | leanprover-community/lean | 12b87f69d92e614daea8bcc9d4de9a9ace089d0e | cce7990ea86a78bdb383e38ed7f9b5ba93c60ce0 | refs/heads/master | 1,687,508,156,644 | 1,684,951,104,000 | 1,684,951,104,000 | 169,960,991 | 457 | 107 | Apache-2.0 | 1,686,744,372,000 | 1,549,790,268,000 | C++ | UTF-8 | Lean | false | false | 1,113 | lean | variables {A₁ A₂ A₃ A₄ B₁ B₂ B₃ B₄ : Prop}
meta def blast : tactic unit :=
using_smt $ smt_tactic.intros >> return ()
constants (a b c d e : nat)
constants (p : nat → Prop)
constants (q : nat → nat → Prop)
constants (f : nat → nat)
lemma lemma1 : a = d → b = e → p b → (p a → (¬ p e) ∧ p c) → ¬ p d := by blast
lemma... |
51c159e13936138bc5051a345d8c76885c5272c4 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/algebra/category/Mon/filtered_colimits.lean | 58b4bd14b1e676588561fcabe8ebc23289284b55 | [
"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 | 14,297 | lean | /-
Copyright (c) 2021 Justus Springer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Justus Springer
-/
import algebra.category.Mon.basic
import category_theory.limits.concrete_category
import category_theory.limits.preserves.filtered
/-!
# The forgetful functor from... |
6b19c6e48c8e652da8fd02b98594460168b4c147 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/logic/embedding/set.lean | 60952eac1fe061315f368cf7e4270b6c755d3e81 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 4,173 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro
-/
import logic.embedding.basic
import data.set.image
/-!
# Interactions between embeddings and sets.
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any ... |
00eda042c5e6152f7caf686f69a849efb29f715c | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/tactic/omega/main.lean | 7c3758025ec357746808be0df30ab60045676b69 | [
"Apache-2.0"
] | permissive | rmitta/mathlib | 8d90aee30b4db2b013e01f62c33f297d7e64a43d | 883d974b608845bad30ae19e27e33c285200bf84 | refs/heads/master | 1,585,776,832,544 | 1,576,874,096,000 | 1,576,874,096,000 | 153,663,165 | 0 | 2 | Apache-2.0 | 1,544,806,490,000 | 1,539,884,365,000 | Lean | UTF-8 | Lean | false | false | 4,592 | lean | /-
Copyright (c) 2019 Seul Baek. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Seul Baek
A tactic for discharging linear integer & natural
number arithmetic goals using the Omega test.
-/
import tactic.omega.int.main
import tactic.omega.nat.main
namespace omega
ope... |
9120e1340e5d0c8e7e9d94e28602df28904fecdb | 1a9d3677cccdaaccacb163507570e75d34043a38 | /src/week_1/kb_solutions/Part_D_relations_solutions.lean | efe050bef3e1839349f2b3e57f34092fe70269ee | [
"Apache-2.0"
] | permissive | alreadydone/formalising-mathematics | 687d386a72065795e784e270f5c05ea3948b67dd | 65869362cd7a2ac74dd1a97c7f9471835726570b | refs/heads/master | 1,680,260,936,332 | 1,616,563,371,000 | 1,616,563,371,000 | 348,780,769 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,136 | lean | import tactic
/-!
# Equivalence relations are the same as partitions
In this file we prove that there's a bijection between
the equivalence relations on a type, and the partitions of a type.
Three sections:
1) partitions
2) equivalence classes
3) the proof
## Overview
Say `α` is a type, and `R : α → α → Prop` i... |
a8a54b124976afcc1d1a74a35a945aec02719b91 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/field_theory/is_alg_closed/algebraic_closure.lean | e614ed0bbe571afb575df73edb220a2669a9e2fc | [
"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 | 10,817 | 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.direct_limit
import field_theory.is_alg_closed.basic
/-!
# Algebraic Closure
In this file we construct the algebraic closure of a field
## Main Definitions
- ... |
144f48a70dd128646949e1b106f5072135ce8558 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/set_theory/game/birthday.lean | d8d1345df6ff3989d1d32720e7c1b015a4e16d05 | [
"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 | 4,280 | 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
/-!
# Birthdays of games
The birthday of a game is an ordinal that represents at which "step" the game was c... |
9ef301d6f9bed51043c83e3907eb71512169bc64 | 618003631150032a5676f229d13a079ac875ff77 | /src/order/lattice.lean | c72f1b42349a375e6d83ba6e15f2f9e6aa500bc2 | [
"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 | 18,273 | 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
Defines the inf/sup (semi)-lattice with optionally top/bot type class hierarchy.
-/
import order.basic
set_option old_structure_cmd true
universes u v w
variables {α... |
66ce4be1e3da298b4ac5de3004470af7b7665e5a | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/analysis/normed_space/enorm.lean | 4af078e526972e14ae1cdd2537048bee92eeaa9b | [
"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 | 7,853 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov
-/
import analysis.normed_space.basic
/-!
# Extended norm
In this file we define a structure `enorm 𝕜 V` representing an extended norm (i.e., a norm that can
... |
60e7110237875f3aad29a69e5cb00cbb94cec2b6 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/data/rat/cast.lean | 780ae00f4e71f017373dce779fdb93a13d9dde8e | [
"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 | 15,313 | lean | /-
Copyright (c) 2019 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro
-/
import data.rat.order
import data.int.char_zero
import algebra.field.opposite
/-!
# Casts for Rational Numbers
## Summary
We define the canonical i... |
ddc68fe139d6dac7a49b2db92c421cebbc2dfa5c | e0f9ba56b7fedc16ef8697f6caeef5898b435143 | /src/analysis/calculus/tangent_cone.lean | 269604620998ab0c8bd5da9727d012d546c9d1e4 | [
"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 | 16,506 | 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.convex.basic
import analysis.normed_space.bounded_linear_maps
import analysis.specific_limits
/-!
# Tangent cone
In this file, we define two p... |
0526fb00cbabfb028a0d01bfb7058dc974155d80 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/widget/widget4.lean | b8197e8dfad5509dd91369f6d364f3a15a642ba1 | [
"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 | 56 | lean | open tactic widget
#eval trace_widget term_goal_widget
|
fd67153fdc78718a7849db9096586cb47a5c0e45 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/geometry/manifold/diffeomorph.lean | 4427d841552c66b07ba36f74b7352bf674dae50f | [
"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 | 20,932 | lean | /-
Copyright © 2020 Nicolò Cavalleri. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nicolò Cavalleri, Yury Kudryashov
-/
import geometry.manifold.cont_mdiff_map
/-!
# Diffeomorphisms
This file implements diffeomorphisms.
## Definitions
* `diffeomorph I I' M M' n`:... |
39767b16d93638ec43469b7d99575ae2936dc695 | e030b0259b777fedcdf73dd966f3f1556d392178 | /library/init/algebra/group.lean | a22f01b0f7b146c6cf302f3b42eeff669b70b546 | [
"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 | 15,923 | 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
/- Make sure instances defined in this file have lower priority than... |
807079dd5cbafcd84f3cf4308be69119bd52a3b7 | 97c8e5d8aca4afeebb5b335f26a492c53680efc8 | /ground_zero/proto.lean | b2734e8e2e6914bd986057afd39b7655bd5fc4cf | [] | no_license | jfrancese/lean | cf32f0d8d5520b6f0e9d3987deb95841c553c53c | 06e7efaecce4093d97fb5ecc75479df2ef1dbbdb | refs/heads/master | 1,587,915,151,351 | 1,551,012,140,000 | 1,551,012,140,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 247 | lean | namespace ground_zero.proto
universes u v
structure iff (α : Sort u) (β : Sort v) :=
(left : α → β) (right : β → α)
infix ↔ := iff
notation [parsing_only] `𝟎` := empty
notation [parsing_only] `𝟐` := bool
end ground_zero.proto |
37969eeef188b77bc4a599af1c8597f65499383b | 64874bd1010548c7f5a6e3e8902efa63baaff785 | /hott/init/axioms/funext_from_ua.hlean | 973941e09c140505884e01310ba1da15934eb655 | [
"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 | 5,053 | hlean | -- Copyright (c) 2014 Jakob von Raumer. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Author: Jakob von Raumer
-- Ported from Coq HoTT
prelude
import ..equiv ..datatypes ..types.prod
import .funext_varieties .ua .funext
open eq function prod sigma truncation equiv is_eq... |
5f3d88e23d5864314c1c70182a84d5dfb95ae5ab | 07c6143268cfb72beccd1cc35735d424ebcb187b | /src/data/real/ennreal.lean | 8d2bf411a21b2a7a616a376a54f7d43d68a86306 | [
"Apache-2.0"
] | permissive | khoek/mathlib | bc49a842910af13a3c372748310e86467d1dc766 | aa55f8b50354b3e11ba64792dcb06cccb2d8ee28 | refs/heads/master | 1,588,232,063,837 | 1,587,304,803,000 | 1,587,304,803,000 | 176,688,517 | 0 | 0 | Apache-2.0 | 1,553,070,585,000 | 1,553,070,585,000 | null | UTF-8 | Lean | false | false | 44,707 | 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, Yury Kudryashov
Extended non-negative reals
-/
import data.real.nnreal order.bounds data.set.intervals tactic.norm_num
noncomputable theory
open classical set
open_loc... |
9b0b729c8fba46b5f3e2f83d49dd89cbdd03b63d | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/run/662.lean | 8e316f4781408c33480568112c216c07783e792a | [
"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 | 1,160 | lean | open nat
inductive type : Type
| Nat : type
| Func : type → type → type
open type
section var
variable {var : type → Type}
inductive term : type → Type
| Var : ∀ {t}, var t → term t
| Const : nat → term Nat
| Plus : term Nat → term Nat → term Nat
| Abs : ∀ {dom ran}, (var dom → term ran) → term (Func dom ran)... |
a684fce88bf7bafbc60f9fb57d3d5862f9a9afee | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/category_theory/adjunction/basic.lean | d3192aac4d04bd4c74ddc918c7b4f0a753e08877 | [
"Apache-2.0"
] | permissive | rmitta/mathlib | 8d90aee30b4db2b013e01f62c33f297d7e64a43d | 883d974b608845bad30ae19e27e33c285200bf84 | refs/heads/master | 1,585,776,832,544 | 1,576,874,096,000 | 1,576,874,096,000 | 153,663,165 | 0 | 2 | Apache-2.0 | 1,544,806,490,000 | 1,539,884,365,000 | Lean | UTF-8 | Lean | false | false | 10,556 | lean | /-
Copyright (c) 2019 Reid Barton. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Reid Barton, Johan Commelin
-/
import category_theory.equivalence
import data.equiv.basic
namespace category_theory
open category
universes v₁ v₂ v₃ u₁ u₂ u₃ -- declare the `v`'s first;... |
367d3e8f96880e2ee4aa252834adc71a6e70409c | 9028d228ac200bbefe3a711342514dd4e4458bff | /src/data/polynomial/monomial.lean | 59f84f76d79abe102ffe6e5dce2ae28f45c8f90d | [
"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 | 2,863 | 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.basic
/-!
# Univariate monomials
Preparatory lemmas for degree_basic.
-/
noncomputable theory
o... |
1644330f8bcd4ecd5bcc210c071922863f4404be | 43390109ab88557e6090f3245c47479c123ee500 | /src/Euclid_old/tarski_3.lean | 0da131e26a531fb24a6df44b48402c64dc4a0ae3 | [
"Apache-2.0"
] | permissive | Ja1941/xena-UROP-2018 | 41f0956519f94d56b8bf6834a8d39473f4923200 | b111fb87f343cf79eca3b886f99ee15c1dd9884b | refs/heads/master | 1,662,355,955,139 | 1,590,577,325,000 | 1,590,577,325,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 23,167 | lean | import Euclid.tarski_2
open classical set
namespace Euclidean_plane
variables {point : Type} [Euclidean_plane point]
local attribute [instance] prop_decidable
-- Right Angles
def R (a b c : point) : Prop := eqd a c a (S b c)
theorem R.symm {a b c : point} : R a b c → R c b a :=
begin
intro h,
have h1 := seven13 b a... |
a200ca40bbe7b831f45a5e105b6c4e4282e6c407 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/linear_algebra/matrix/default.lean | 6ac169c9a9c9da8ddef92331c154b70680c4da67 | [
"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 | 293 | lean | import linear_algebra.determinant
import linear_algebra.matrix.basis
import linear_algebra.matrix.block
import linear_algebra.matrix.diagonal
import linear_algebra.matrix.dot_product
import linear_algebra.matrix.to_linear_equiv
import linear_algebra.matrix.reindex
import linear_algebra.trace
|
b4a34a637452b247944e209d7209fd16b388e4a2 | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/field_theory/fixed.lean | 4f50337864cb79051409dee0b2d781b02be6069e | [
"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 | 14,502 | 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.polynomial.group_ring_action
import field_theory.normal
import field_theory.separable
import field_theory.tower
import ring_theory.polynomial
/-!
# Fixed field... |
5ec63624ee2960ee9500956d1258e6e9708e7094 | 2a70b774d16dbdf5a533432ee0ebab6838df0948 | /_target/deps/mathlib/src/topology/instances/ennreal.lean | ebf3714f51264f9b38032956b4dad4e7009c3e19 | [
"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 | 43,907 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Johannes Hölzl
-/
import topology.instances.nnreal
/-!
# Extended non-negative reals
-/
noncomputable theory
open classical set filter metric
open_locale classical topological_space e... |
8a4ce1a444fdf0ac917d00de65adbee44087ee6d | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/category/Module/basic.lean | ddd4a0f5691c101f0a4c7fc176bf6ca6f3add4d9 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 11,072 | lean | /-
Copyright (c) 2019 Robert A. Spencer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert A. Spencer, Markus Himmel
-/
import algebra.category.Group.preadditive
import category_theory.linear.basic
import category_theory.elementwise
import linear_algebra.basic
impo... |
abba4fa721b09f3a7b2ccefa7a2a2339b035ad8b | 4fa161becb8ce7378a709f5992a594764699e268 | /src/topology/uniform_space/cauchy.lean | 9806fa3e966e56e92be69e37145e25e2e5727f20 | [
"Apache-2.0"
] | permissive | laughinggas/mathlib | e4aa4565ae34e46e834434284cb26bd9d67bc373 | 86dcd5cda7a5017c8b3c8876c89a510a19d49aad | refs/heads/master | 1,669,496,232,688 | 1,592,831,995,000 | 1,592,831,995,000 | 274,155,979 | 0 | 0 | Apache-2.0 | 1,592,835,190,000 | 1,592,835,189,000 | null | UTF-8 | Lean | false | false | 26,171 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro
-/
import topology.uniform_space.basic
import topology.bases
import data.set.intervals
/-!
# Theory of Cauchy filters in uniform spaces. Complete uniform... |
c0b2de450043c1f6edeca7a15b068dab11f2741a | 9a0b1b3a653ea926b03d1495fef64da1d14b3174 | /tidy/rewrite_search/discovery/shared.lean | 311c0b3962861b8fd49772432aebff3d0e78e2b4 | [
"Apache-2.0"
] | permissive | khoek/mathlib-tidy | 8623b27b4e04e7d598164e7eaf248610d58f768b | 866afa6ab597c47f1b72e8fe2b82b97fff5b980f | refs/heads/master | 1,585,598,975,772 | 1,538,659,544,000 | 1,538,659,544,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 811 | lean | import .bundle
namespace tidy.rewrite_search.discovery
-- I've resisted the urge to pick funny vague adjectives here even though it kills me
-- I can only dream: (resolute, determined, obstinate, unwavering, etc.)
-- vs. (idle, indolent, etc.)
@[derive decidable_eq]
inductive persistence
| speedy
| try_... |
285e4ee1aab5b023bc6e6ca4cd84e8c068e0e8dd | 4b846d8dabdc64e7ea03552bad8f7fa74763fc67 | /library/init/data/fin/basic.lean | 4a78ca99fd019562c28d4d394d4ca597024bc543 | [
"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 | 976 | lean | /-
Copyright (c) 2016 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.nat.basic
open nat
structure fin (n : nat) := (val : nat) (is_lt : val < n)
namespace fin
variable {n : nat}
lemma eq_of_veq : ∀ ... |
93c08db64fdc3f1293a0cca63152365d3038176a | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/linear_algebra/multilinear.lean | 724e9ef9c091ef2d3763cca2989e3aa7406e9296 | [] | 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 | 54,259 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.linear_algebra.basic
import Mathlib.algebra.algebra.basic
import Mathlib.tactic.omega... |
4bc181e625b4ca44b6347398c6ef611fcc7f9f8c | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/lua5.lean | f56bab9ebd5d8acb3cb4af3bcf24449b5da074f9 | [
"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 | 263 | lean | import Int.
variable x : Int
(*
local N = 100
local env = get_environment()
-- Create N variables with the same type of x
typeofx = env:type_check(Const("x"))
for i = 1, N do
env:add_var("y_" .. i, typeofx)
end
*)
print environment 101
check x + y_1 + y_2 |
c6d49264efc72426503a949d02d287042a08ea36 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/algebra/group_power/default_auto.lean | aa9ea20c6099f60d5d3526aff2eb6a530a8eb000 | [] | 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 | 157 | lean | import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.algebra.group_power.lemmas
import Mathlib.PostPort
namespace Mathlib
end Mathlib |
12fe51f34eace5711343487cba29b02081a7b719 | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/group_theory/perm/cycle_type.lean | 970d4c2b0f5f8bc7d3a4d41a7d862aa2eed6b3ec | [
"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 | 19,720 | lean | /-
Copyright (c) 2020 Thomas Browning. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Thomas Browning
-/
import algebra.gcd_monoid.multiset
import combinatorics.partition
import group_theory.perm.cycles
import group_theory.sylow
import ring_theory.int.basic
import tac... |
c0edf6ea89b66f688523770f1cf1dbd3d1e64a49 | 367134ba5a65885e863bdc4507601606690974c1 | /src/data/matrix/notation.lean | dd6703256ec6ac885f4f47d5b3499122b49b6c25 | [
"Apache-2.0"
] | permissive | kodyvajjha/mathlib | 9bead00e90f68269a313f45f5561766cfd8d5cad | b98af5dd79e13a38d84438b850a2e8858ec21284 | refs/heads/master | 1,624,350,366,310 | 1,615,563,062,000 | 1,615,563,062,000 | 162,666,963 | 0 | 0 | Apache-2.0 | 1,545,367,651,000 | 1,545,367,651,000 | null | UTF-8 | Lean | false | false | 17,833 | lean | /-
Copyright (c) 2020 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen
Notation for vectors and matrices
-/
import data.fintype.card
import data.matrix.basic
import tactic.fin_cases
/-!
# Matrix and vector notation
This file defines notation ... |
d4c4a7601e72469be1cf10a8a89f7c9472916e9e | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/data/list/basic_auto.lean | 60f96c7a6d783fcd6ce6395cd1d9225d4898a091 | [] | 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 | 8,659 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.logic
import Mathlib.Lean3Lib.init.data.nat.basic
import Mathlib.Lean3Lib.init.data.bool.basic
import Mat... |
439766886ceb88f53607e424c257d50fa3960866 | 432d948a4d3d242fdfb44b81c9e1b1baacd58617 | /src/deprecated/group.lean | 0d07d3df7442c34cad02d7d3ccbd5f940b917b15 | [
"Apache-2.0"
] | permissive | JLimperg/aesop3 | 306cc6570c556568897ed2e508c8869667252e8a | a4a116f650cc7403428e72bd2e2c4cda300fe03f | refs/heads/master | 1,682,884,916,368 | 1,620,320,033,000 | 1,620,320,033,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 13,584 | lean | /-
Copyright (c) 2019 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import algebra.group.type_tags
import algebra.group.units_hom
import algebra.ring.basic
import data.equiv.mul_add
/-!
# Unbundled monoid and group homomorphisms (d... |
bbfa818432f959c7ac3d50ef667bd8bcba89325d | c8d830ce6c7de4840cf0c892d8b58e7e8df97e37 | /src/property_catalogue/LTL/patterns.lean | df71d3d01a2ea6b9c12de3432d3011de63c96019 | [] | no_license | loganrjmurphy/lean-strategies | 4b8dd54771bb421c929a8bcb93a528ce6c1a70f1 | 020e2a65dc2ab475696dfea5ad8935a0a4085918 | refs/heads/main | 1,682,732,168,860 | 1,614,820,630,000 | 1,614,820,630,000 | 278,458,841 | 3 | 0 | null | 1,613,755,728,000 | 1,594,324,763,000 | Lean | UTF-8 | Lean | false | false | 2,756 | lean | import LTS.defs
variable {M : LTS}
set_option pp.beta true
@[reducible]
def init_state (s : M.S) [has_coe M.S (formula M)] : formula M := ↑s
@[reducible]
def holds_over_transition (s : M.S) [has_coe M.S (formula M)] : formula M :=
◾(↑s ⇒ formula.next ↑s)
@[reducible]
def not_init (s : M.S) [has_coe M.S (for... |
2f2dbc5d5ebf83086a08b03f9afa876f747782b3 | f02b05b665ad2d2cd970e93758a98d57f310a822 | /test/test2.lean | d6940c39ee7453eac98dd7fad774d9cf6a6d40c8 | [] | no_license | khoek/leancache | b0ed5d2a9a2e87f58d4ad27343d957a9cd49ce5f | 5c8329f7b647b8d82966ab180c4473b20d1f249c | refs/heads/master | 1,585,344,140,717 | 1,549,094,327,000 | 1,549,094,327,000 | 147,138,187 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 132 | lean | import tactic.tcache
set_option trace.cache true
namespace charlie
theorem lol : 1 + 2 = 3 := by c begin
simp
end
end charlie
|
61b1339aa2eb61805a4c52222aa57bc45b9534cd | 88fb7558b0636ec6b181f2a548ac11ad3919f8a5 | /tests/lean/run/isabelle.lean | 38103e5c12abb54ffa105763b9e1a6922aad98bc | [
"Apache-2.0"
] | permissive | moritayasuaki/lean | 9f666c323cb6fa1f31ac597d777914aed41e3b7a | ae96ebf6ee953088c235ff7ae0e8c95066ba8001 | refs/heads/master | 1,611,135,440,814 | 1,493,852,869,000 | 1,493,852,869,000 | 90,269,903 | 0 | 0 | null | 1,493,906,291,000 | 1,493,906,291,000 | null | UTF-8 | Lean | false | false | 2,235 | lean | /-
Isabelle style tactics.
This test is based on a file created by Gabriel Ebner.
-/
import data.lazy_list
universe variables u
meta def lazy_tactic (α : Type u) :=
tactic_state → lazy_list (α × tactic_state)
namespace lazy_tactic
open lazy_list
meta def of_tactic {α : Type u} (t : tactic α) : lazy_tactic α :=
λ s, ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.