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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0141186bc0c7c56e841034f5dff8ab020fdb7c81 | e89c01ae56ce079fecb3cee914e848b44949d055 | /src/position.lean | b347d31ebf751a331fdfb799f1a9cf8a77fef7eb | [] | no_license | foxthomson/impartial | 968fea13b4a88bc59ddb05d764806763c068af8f | 5f8b405dbbd864682f1ccd30ff7504a23bb20a42 | refs/heads/master | 1,670,158,094,446 | 1,597,590,230,000 | 1,597,590,230,000 | 286,443,788 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,947 | lean | import set_theory.pgame
universe u
/-!
# Basic definitions about who has a winning stratergy
We define `G.p_position`, `G.n_position`, `G.l_position` and `G.r_position`
for a pgame `G`, which means the second, first, left and right players
have a winning stratergy respectivly.
These are defined by inequalities whic... |
dd081864c76181032f3ba1e9df8ea76f356aa526 | 2a70b774d16dbdf5a533432ee0ebab6838df0948 | /_target/deps/mathlib/src/combinatorics/composition.lean | 60780f93ce12d115eefec85e521a4fc8a766e47b | [
"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 | 33,832 | 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 data.fintype.card
import data.finset.sort
import tactic.omega
/-!
# Compositions
A composition of a natural number `n` is a decomposition `n = i₀ + ...... |
74640428c6e141e1343fd8ecb41b75a52eb151ba | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/sigma/lex.lean | c6863bd0ad2c22e3d574a6685ca2001630f7b0b4 | [
"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,004 | 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.sigma.basic
import order.rel_classes
/-!
# Lexicographic order on a sigma type
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require... |
b20aa8b832c99c65e090b4dcf3f556d56e2b37d1 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/have1.lean | 9b892974a363b0c367e9869845333c02ce6648d3 | [
"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 | 420 | lean | import logic
open bool eq.ops tactic eq
constants a b c : bool
axiom H1 : a = b
axiom H2 : b = c
check have e1 : a = b, from H1,
have e2 : a = c, by apply trans; apply e1; apply H2,
have e3 : c = a, from e2⁻¹,
have e4 : b = a, from e1⁻¹,
have e5 : b = c, from e4 ⬝ e2,
have e6 : a = a, fr... |
7f2e8b69ad39de88ed3a10d84d2f5c4e100b1fbe | b2fe74b11b57d362c13326bc5651244f111fa6f4 | /src/data/real/sqrt.lean | f6e5d5032c203739650f771e9dbe4aedfc42d4a8 | [
"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 | 9,173 | lean | /-
Copyright (c) 2020 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Floris van Doorn, Yury Kudryashov
-/
import topology.instances.nnreal
/-!
# Square root of a real number
In this file we define
* `nnreal.sqrt` to be the square root... |
0539bfbe5659e1bcdeac1d7f460ceb8a10ee2e20 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/order/galois_connection.lean | 43a67f4f9ba02cabb4d38aa61ea55ff0abb2b460 | [
"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 | 13,394 | 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
Galois connections - order theoretic adjoints.
-/
import order.complete_lattice order.bounds order.order_iso
open function set
universes u v w x
variables {α : Type u} ... |
9f3ebe06a0b5b4123d4005c3246f0bdebcbc5ac3 | 2a70b774d16dbdf5a533432ee0ebab6838df0948 | /_target/deps/mathlib/src/topology/separation.lean | fe1449f5cb56b0e42882c6a523e74ca9e34cd631 | [
"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 | 35,142 | 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
Separation properties of topological spaces.
-/
import topology.subset_properties
open set filter
open_locale topological_space filter
local attribute ... |
abe3a6fc6d676e11c17d1428b4b65e63c118ee48 | 675b8263050a5d74b89ceab381ac81ce70535688 | /src/data/polynomial/degree/definitions.lean | d70518e42337516090b12b43577d13f823dded2b | [
"Apache-2.0"
] | permissive | vozor/mathlib | 5921f55235ff60c05f4a48a90d616ea167068adf | f7e728ad8a6ebf90291df2a4d2f9255a6576b529 | refs/heads/master | 1,675,607,702,231 | 1,609,023,279,000 | 1,609,023,279,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 36,445 | 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.coeff
import data.nat.with_bot
/-!
# Theory of univariate polynomials
The definitions include
`de... |
33c0b07176dea207896d3cd038b63489784844f5 | 97f752b44fd85ec3f635078a2dd125ddae7a82b6 | /library/theories/analysis/complex_norm.lean | 1a161308c5474279dd533d363910fd9f5be2d1a0 | [
"Apache-2.0"
] | permissive | tectronics/lean | ab977ba6be0fcd46047ddbb3c8e16e7c26710701 | f38af35e0616f89c6e9d7e3eb1d48e47ee666efe | refs/heads/master | 1,532,358,526,384 | 1,456,276,623,000 | 1,456,276,623,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,212 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad
Instantiate the complex numbers as a normed space, by temporarily making it an inner product space
over the reals.
-/
import theories.analysis.inner_product data.complex
o... |
39470df8dac83e788ee3bc3ce7ce78b97dc7c271 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/data/rat/defs.lean | 1f4b953429037054df0e4622b8c2f322d3809554 | [
"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 | 35,164 | 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.int.basic
import data.nat.gcd
import logic.encodable.basic
/-!
# Basics for the Rational Numbers
## Summary
We define a rational number... |
eb1e1b87ce2264a743bde9c0a9d992ef8b78c228 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /src/Lean/PrettyPrinter/Delaborator/Basic.lean | b5928e0ab97ace577095129d94a002b406ab8e96 | [
"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 | 12,769 | 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.Transform
import Lean.Meta.Match.Match
import Lean.Elab.Term
import ... |
06dd5030b111f854ff7d0f0066a216b03b2ca646 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/topology/algebra/mul_action.lean | a6096bbedbc71dd070f01624e7f243e1195b337b | [
"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 | 9,686 | 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 topology.algebra.monoid
import algebra.module.prod
import topology.homeomorph
/-!
# Continuous monoid action
In this file we define class `has_continuous_s... |
d2b3531c5821369d8393d79370774df4db054f7b | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/sub_bug.lean | 23187a6dfdce57b63841551374200bbac90ceb59 | [
"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 | 58 | lean | import data.nat
open nat subtype
check { x : nat | x > 0}
|
3820765dbe60b9d26898f52f7ae256e661a1a382 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/number_theory/pell.lean | 772dd426715d305955447aacb5a4641a5b3a0af3 | [
"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 | 37,124 | 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.nat.modeq data.zsqrtd.basic tactic.ring tactic.omega
namespace pell
open nat
section
parameters {a : ℕ} (a1 : a > 1)
include a1
private def d := ... |
4cd0e899e9e631ed174b739ac76b151ae84767ce | d1a52c3f208fa42c41df8278c3d280f075eb020c | /stage0/src/Lean/Meta/Match/MVarRenaming.lean | cada805d9d9e0f5288d7daffec87bc587755e7c8 | [
"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,037 | 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.ReplaceExpr
namespace Lean.Meta
/- A mapping from MVarId to MVarId -/
structure MVarRenaming where
map : MVarIdMap MVarId := {}
def MV... |
7f85e26a59873a6d5453f52e90dfc0a7dd7c2dec | 36c7a18fd72e5b57229bd8ba36493daf536a19ce | /library/data/finset/basic.lean | bb186173f3d0d33173b59d5d0aeb8b4a2693a742 | [
"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 | 28,424 | 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
Finite sets.
-/
import data.fintype.basic data.nat data.list.perm algebra.binary
open nat quot list subtype binary function eq.ops
open [declara... |
0ecf3c374c6079ed7b3b8ebd8b6630dc7c3374fc | 815d5098500e90b3fad5de3111ec5a8666698316 | /lists-exercises.lean | ad3f4e62b43c3dca1d4307ad3054dd5b5e6530d8 | [] | no_license | EgbertRijke/lists-in-lean | 5c8f69e02bfa7f9cdfc9a2bdac33e31db82858cc | 848015bada1470a3b5c13be0680169d75f79cbcf | refs/heads/master | 1,659,407,427,247 | 1,590,053,359,000 | 1,590,053,359,000 | 264,247,486 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,477 | lean | /- This is a short tutorial on lean for the Logic in Computer Science course at the university
of Ljubljana. -/
namespace logika_v_racunalnistvu
/- Definitions of inductive types are made using the inductive keyword. Different constructors
are separated by |. -/
inductive list (A : Type) : Type
| nil : list
| co... |
765e20dad493395c19e72159e744bd6e336889dc | c777c32c8e484e195053731103c5e52af26a25d1 | /src/ring_theory/polynomial/quotient.lean | f7cdff17c5fc2989d392377b66fc7ca76fc50db5 | [
"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 | 9,847 | lean | /-
Copyright (c) 2019 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, David Kurniadi Angdinata, Devon Tuma, Riccardo Brasca
-/
import data.polynomial.div
import ring_theory.polynomial.basic
import ring_theory.ideal.quotient_operations
/-!
# Quoti... |
d4f68658a6d8954e09dd6b9ea03e3ca22fcf9546 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/simpUnfoldAbbrev.lean | 8379ac3f778d16b8d0d4c788b3c7e8e39a36048c | [
"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 | 382 | lean | example {x y : Nat} (h : y > x) : x < y := by
-- simp should unfold `>` when inserting into the discrimination tree
simp [h]
abbrev good (n : Nat) :=
n > 42
example (h : good n) : n > 42 := by
-- simp should unfold `good` when inserting into the discrimination tree
simp [h]
example {x y : Nat} (h : x ≠ y) ... |
f7ae1b14dc6fa7c6b3a6e4568b7b97a0b7dfb76f | f3849be5d845a1cb97680f0bbbe03b85518312f0 | /tests/lean/bad_structures2.lean | eb7bd5e71f5099b7e07d799eda37d3821aab9f31 | [
"Apache-2.0"
] | permissive | bjoeris/lean | 0ed95125d762b17bfcb54dad1f9721f953f92eeb | 4e496b78d5e73545fa4f9a807155113d8e6b0561 | refs/heads/master | 1,611,251,218,281 | 1,495,337,658,000 | 1,495,337,658,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 407 | lean | structure foo :=
(x : bool)
structure boo :=
(x : nat)
structure bla extends foo, boo
structure boo2 :=
{x : bool}
structure bla extends foo, boo2
structure bla extends foo :=
(x : num)
structure bla extends foo :=
( : num)
structure bla extends foo :=
mk :: y z : num
structure bla2 extends nat
structure bla2 ... |
0e314faa8d09862cc18f5012124a9bd70351d1de | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/run/order_defaults.lean | 97bcbab9b3fb7de3bfe41c77204a5a8fa7b21c9f | [
"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 | 554 | lean | example : preorder unit := {
le := λ _ _, true,
le_refl := λ _, trivial,
le_trans := λ _ _ _ _ _, trivial,
}
example : partial_order unit := {
le := λ _ _, true,
le_refl := λ _, trivial,
le_trans := λ _ _ _ _ _, trivial,
le_antisymm := by intros a b; intros; cases a; cases b; refl
}
exampl... |
596a718a85d39914b63768d22263b7c10bfacfc8 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/ring_theory/polynomial/basic_auto.lean | eb9ab1bcfe471119eef0d1264e501581e1c5d123 | [] | 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,857 | lean | /-
Copyright (c) 2019 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
# Ring-theoretic supplement of data.polynomial.
## Main results
* `mv_polynomial.integral_domain`:
If a ring is an integral domain, then so is its polynomial ring over finitel... |
9c45e48a194f4a990a7c7e9dfa1642acd484e6cf | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /src/Init/Data/String/Basic.lean | 5ec8e36eecf0f4eb378a9673cedf47c184214a01 | [
"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 | 19,308 | 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.List.Basic
import Init.Data.Char.Basic
import Init.Data.Option.Basic
universe u
def List.asString (s : List Char) : String :=
⟨s⟩... |
e7ec33350b77985b7d5a0059b9c362df8bcd3694 | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /src/algebra/associated.lean | 298577d3204361206cbfd5e6cbf4ae4bfd891756 | [
"Apache-2.0"
] | permissive | dexmagic/mathlib | ff48eefc56e2412429b31d4fddd41a976eb287ce | 7a5d15a955a92a90e1d398b2281916b9c41270b2 | refs/heads/master | 1,693,481,322,046 | 1,633,360,193,000 | 1,633,360,193,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 29,407 | 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, Jens Wagemaker
-/
import algebra.big_operators.basic
import algebra.divisibility
import algebra.invertible
/-!
# Associated, prime, and irreducible elements.
-/
varia... |
dcb270d9e55b5008b857f54d20798c8354fff325 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/ind_ns.lean | 2c963e0c4ab518c4b479b407e71e16f738b61f13 | [
"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 | 127 | lean | inductive day
| monday | tuesday | wednesday | thursday | friday | saturday | sunday
#check day.monday
open day
#check monday
|
022b811068e39797fa45d5f3888ccec017473ab2 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/order/filter/germ.lean | ff9655a1ba547b9a9bf364bd0bfcb010c7d53fb9 | [
"Apache-2.0"
] | permissive | Lix0120/mathlib | 0020745240315ed0e517cbf32e738d8f9811dd80 | e14c37827456fc6707f31b4d1d16f1f3a3205e91 | refs/heads/master | 1,673,102,855,024 | 1,604,151,044,000 | 1,604,151,044,000 | 308,930,245 | 0 | 0 | Apache-2.0 | 1,604,164,710,000 | 1,604,163,547,000 | null | UTF-8 | Lean | false | false | 21,341 | 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, Abhimanyu Pallavi Sudhir
-/
import order.filter.basic
import algebra.module.pi
/-!
# Germ of a function at a filter
The germ of a function `f : α → β` at a fi... |
1f8053f1c13c40c00b554ee84a3d272e564e7b1c | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/270.lean | de05864acb2045205716233d6d6aa9ecfd7a363a | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 1,086 | lean | class CommAddSemigroup (α : Type u) extends Add α where
addComm : {a b : α} → a + b = b + a
addAssoc : {a b c : α} → a + b + c = a + (b + c)
open CommAddSemigroup
theorem addComm3 [CommAddSemigroup α] {a b c : α} : a + b + c = a + c + b := by {
have h : b + c = c + b := addComm;
have h' := congrArg (a... |
98d3fd8c7a7b5f9e89c3d719700a8ccc15ff6e13 | d7189ea2ef694124821b033e533f18905b5e87ef | /galois/list/alist.lean | 8906b26dd03fa00d58f06e47755fe0e01c628823 | [
"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 | 980 | lean | /-
Defines a lookup function for assoc-lists.
-/
universes u v
namespace list
section
parameter {α : Type u}
parameter {β : Type v}
parameter [decidable_eq α]
parameter (k : α)
/-- Return the key associated with the name or fail if not found. -/
def alist_lookup : list (α × β) → option β
| [] := option.none
| ((h,v... |
35002cfbe1aefd8638f302fadfa002d20851eeb8 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/topology/uniform_space/cauchy.lean | 0d55d454b4a7320f310890fe91eb806b4c8409d5 | [
"Apache-2.0"
] | permissive | lacker/mathlib | f2439c743c4f8eb413ec589430c82d0f73b2d539 | ddf7563ac69d42cfa4a1bfe41db1fed521bd795f | refs/heads/master | 1,671,948,326,773 | 1,601,479,268,000 | 1,601,479,268,000 | 298,686,743 | 0 | 0 | Apache-2.0 | 1,601,070,794,000 | 1,601,070,794,000 | null | UTF-8 | Lean | false | false | 26,073 | 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... |
203c0aefcfc8179bc031142c63f8fa49ad72b2f7 | bb31430994044506fa42fd667e2d556327e18dfe | /src/analysis/locally_convex/bounded.lean | 5c26f900fd27c2d55a83799d8813d7f8ea426cb4 | [
"Apache-2.0"
] | permissive | sgouezel/mathlib | 0cb4e5335a2ba189fa7af96d83a377f83270e503 | 00638177efd1b2534fc5269363ebf42a7871df9a | refs/heads/master | 1,674,527,483,042 | 1,673,665,568,000 | 1,673,665,568,000 | 119,598,202 | 0 | 0 | null | 1,517,348,647,000 | 1,517,348,646,000 | null | UTF-8 | Lean | false | false | 13,140 | lean | /-
Copyright (c) 2022 Moritz Doll. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Moritz Doll
-/
import analysis.locally_convex.basic
import analysis.locally_convex.balanced_core_hull
import analysis.seminorm
import topology.bornology.basic
import topology.algebra.unif... |
bf345bf770962b1f686558c110ac4aad96190ccb | 38bf3fd2bb651ab70511408fcf70e2029e2ba310 | /src/algebra/ring.lean | 5adb139b94215fba3239f17d4324f57703fbaf60 | [
"Apache-2.0"
] | permissive | JaredCorduan/mathlib | 130392594844f15dad65a9308c242551bae6cd2e | d5de80376088954d592a59326c14404f538050a1 | refs/heads/master | 1,595,862,206,333 | 1,570,816,457,000 | 1,570,816,457,000 | 209,134,499 | 0 | 0 | Apache-2.0 | 1,568,746,811,000 | 1,568,746,811,000 | null | UTF-8 | Lean | false | false | 24,331 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Floris van Doorn, Amelia Livingston
-/
import algebra.group
import tactic.norm_cast
/-!
# Properties and homomorphisms of semirings and rings
This f... |
de10736e2d118ffde09c1ef830d703fd7b668b6d | 206422fb9edabf63def0ed2aa3f489150fb09ccb | /test/matrix.lean | a6b9a011d584fa3cb8046e2c7b5b2ed97966606f | [
"Apache-2.0"
] | permissive | hamdysalah1/mathlib | b915f86b2503feeae268de369f1b16932321f097 | 95454452f6b3569bf967d35aab8d852b1ddf8017 | refs/heads/master | 1,677,154,116,545 | 1,611,797,994,000 | 1,611,797,994,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,287 | lean | import data.matrix.notation
variables {α β : Type} [semiring α] [ring β]
namespace matrix
open_locale matrix
example {a a' b b' c c' d d' : α} :
![![a, b], ![c, d]] + ![![a', b'], ![c', d']] = ![![a + a', b + b'], ![c + c', d + d']] :=
by simp
example {a a' b b' c c' d d' : β} :
![![a, b], ![c, d]] - ![![a', b... |
7d8691a34c1b263556346cd820a3e7fe5931b567 | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /src/Lean/Elab/Notation.lean | 9c56bb9904e6979480daed966a22efbddc4c0950 | [
"Apache-2.0"
] | permissive | WojciechKarpiel/lean4 | 7f89706b8e3c1f942b83a2c91a3a00b05da0e65b | f6e1314fa08293dea66a329e05b6c196a0189163 | refs/heads/master | 1,686,633,402,214 | 1,625,821,189,000 | 1,625,821,258,000 | 384,640,886 | 0 | 0 | Apache-2.0 | 1,625,903,617,000 | 1,625,903,026,000 | null | UTF-8 | Lean | false | false | 4,807 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Elab.Syntax
namespace Lean.Elab.Command
open Lean.Syntax
open Lean.Parser.Term hiding macroArg
open Lean.Parser.Command
/- Wrap all occurrence... |
d8b8cfcfdc0a609482fdb4df5b56e407fbfcdc47 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /src/Lean/Elab/PreDefinition/Main.lean | 4874e4230fb8ed5459cd00cb55bdf10a9e16473a | [
"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 | 4,980 | 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.Elab.PreDefinition.Basic
import Lean.Elab.PreDefinition.Structural
import Lean.Elab.PreDefinition.WF
namespace Lean.Elab
open Meta
open Term
st... |
d185765ed58656b0c7dc5a3b28a0dd8922c8f1b9 | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /src/Lean/Compiler/InlineAttrs.lean | 71f808f107f28e3db2615bf0a75507cddfda58e3 | [
"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,131 | 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.Compiler
inductive InlineAttributeKind where
| inline | noinline | macroInline | inlineIfReduce
deriving Inhabi... |
bd060a0b2de081242c52597a383c7256dec3c26d | 4727251e0cd73359b15b664c3170e5d754078599 | /src/number_theory/class_number/finite.lean | 353d6ff7ca5a8a5da7ecf9fff8fc4c82031ea7d6 | [
"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 | 17,913 | lean | /-
Copyright (c) 2021 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen
-/
import analysis.special_functions.pow
import linear_algebra.free_module.pid
import linear_algebra.matrix.absolute_value
import number_theory.class_number.admissible_absolu... |
c2ff16398705b90b2196b348a3932d220e8b04fd | b2fe74b11b57d362c13326bc5651244f111fa6f4 | /src/order/filter/cofinite.lean | 9fb071981da1046df070014085626b8dacb0fe21 | [
"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 | 3,008 | 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, Yury Kudryashov
-/
import order.filter.at_top_bot
/-!
# The cofinite filter
In this file we define
`cofinite`: the filter of sets with finite compleme... |
ee8aba158d842350690bdd78b3ea49473f18ec4c | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/group_theory/finite_abelian.lean | 0a844cd0e78bc093c32cd451ae5ceeead17364d7 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 3,783 | lean | /-
Copyright (c) 2022 Pierre-Alexandre Bazin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Pierre-Alexandre Bazin
-/
import algebra.module.pid
import data.zmod.quotient
/-!
# Structure of finite(ly generated) abelian groups
* `add_comm_group.equiv_free_prod_direct_... |
efc801a646aa92aeecff2368f469a082bcd90076 | 75db7e3219bba2fbf41bf5b905f34fcb3c6ca3f2 | /library/data/nat/pairing.lean | 3af9a1d591e44028ae77e97446291f3ed8a70314 | [
"Apache-2.0"
] | permissive | jroesch/lean | 30ef0860fa905d35b9ad6f76de1a4f65c9af6871 | 3de4ec1a6ce9a960feb2a48eeea8b53246fa34f2 | refs/heads/master | 1,586,090,835,348 | 1,455,142,203,000 | 1,455,142,277,000 | 51,536,958 | 1 | 0 | null | 1,455,215,811,000 | 1,455,215,811,000 | null | UTF-8 | Lean | false | false | 3,502 | 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
Elegant pairing function.
-/
import data.nat.sqrt data.nat.div
open prod decidable
namespace nat
definition mkpair (a b : nat) : nat :=
if a < b then b*b + a... |
a198e61ddec98ed53b41b1317ad2127a52c53214 | 4d3f29a7b2eff44af8fd0d3176232e039acb9ee3 | /Mathlib/Mathlib/Test/Split.lean | 6eb6b6483d15da03083a0e31167ec1f42565a932 | [] | no_license | marijnheule/lamr | 5fc5d69d326ff92e321242cfd7f72e78d7f99d7e | 28cc4114c7361059bb54f407fa312bf38b48728b | refs/heads/main | 1,689,338,013,620 | 1,630,359,632,000 | 1,630,359,632,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 211 | lean | import Mathlib.Tactic.Basic
import Mathlib.Tactic.Split
example : (α : Type) × List α := by
split
- exact [0,1]
-- example : (α : Type) × List α := by
-- fsplit
-- - exact ℕ
-- - exact [0,1]
|
498f8211a98b34c77d9c5f22b0de1958158fe0cf | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/tree.lean | d2e2981efb57103a1eb79d26b81a092b3fdca838 | [
"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 | 5,183 | lean | /-
Copyright (c) 2019 mathlib community. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Wojciech Nawrocki
-/
import data.rbtree.init
import data.num.basic
import order.basic
/-!
# Binary tree
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to... |
482102b170b9a30e0e49df57b5ee2ff3b967c191 | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/ring_theory/integral_domain.lean | 25f3addfc6258f297ecae2aa3da94cd96beb1b99 | [
"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 | 6,646 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Chris Hughes
-/
import data.fintype.card
import data.polynomial.ring_division
import group_theory.specific_groups.cyclic
import algebra.geom_sum
/-!
# Integral domain... |
defa1ac8a249f2d3d8c5b63e1fa4e2c91078d986 | 25adb3ce35902d6e9c57e494fe055c47c9881db4 | /src/classical_geometry.lean | 4dcf3f7a68ee8e8b7adc536ff4e21094da7d5599 | [] | no_license | rohanrajnair/phys | fefb5e430f8e4b61c2acbaecb9d1c6702495ef87 | 0172c81b24bc94e2df5e32904c9f6904d8f24da7 | refs/heads/master | 1,673,021,045,568 | 1,603,474,638,000 | 1,603,474,638,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 462 | lean | import .....math.new_affine.real_affine_space
import ..metrology.dimension
-- name serves as unique ID for a given geometric space
structure classicalGeometry : Type :=
mk :: (name : ℕ) (dim : ℕ )
-- provide standard 3D world object
def worldGeometry := classicalGeometry.mk 0 3
noncomputable def classicalGeometryA... |
60f9d37ee9eb3919b5febed694fc75bdc26012d9 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/data/polynomial/integral_normalization.lean | 8b04217f4f1b96108159b8a03aacf76a92eb4bc1 | [
"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 | 5,559 | 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.algebra_map
import data.polynomial.monic
/-!
# Theory of monic polynomials
We define `integral_no... |
a4c48270a0a4a3c9a178302586fe5f4ac6fc43cc | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /src/tactic/cancel_denoms.lean | bc1f33ac22f1776fe0aef5efc5f32519cfc7c200 | [
"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 | 9,306 | lean | /-
Copyright (c) 2020 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
-/
import data.rat.meta_defs
import tactic.norm_num
import data.tree
import meta.expr
/-!
# A tactic for canceling numeric denominators
This file defines tactics th... |
3e4a4bd9902a0a051d3c960f03d1b94d70e69be3 | 682dc1c167e5900ba3168b89700ae1cf501cfa29 | /src/del/syntax/soundnessDEL.lean | f7d12fe4afa615720d71af813c4cecca24130229 | [] | no_license | paulaneeley/modal | 834558c87f55cdd6d8a29bb46c12f4d1de3239bc | ee5d149d4ecb337005b850bddf4453e56a5daf04 | refs/heads/master | 1,675,911,819,093 | 1,609,785,144,000 | 1,609,785,144,000 | 270,388,715 | 13 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 3,619 | lean | /-
Copyright (c) 2021 Paula Neeley. All rights reserved.
Author: Paula Neeley
Following the textbook "Dynamic Epistemic Logic" by
Hans van Ditmarsch, Wiebe van der Hoek, and Barteld Kooi
-/
import del.languageDEL data.set.basic del.semantics.semanticsDEL del.announcements
local attribute [instance] classical.prop_dec... |
a3be2524bd3da66e27ecd5040b54f67339173681 | 46125763b4dbf50619e8846a1371029346f4c3db | /src/algebra/ordered_ring.lean | 8b2cbfbf8fc8491189b2a127a5657423c25d5c1a | [
"Apache-2.0"
] | permissive | thjread/mathlib | a9d97612cedc2c3101060737233df15abcdb9eb1 | 7cffe2520a5518bba19227a107078d83fa725ddc | refs/heads/master | 1,615,637,696,376 | 1,583,953,063,000 | 1,583,953,063,000 | 246,680,271 | 0 | 0 | Apache-2.0 | 1,583,960,875,000 | 1,583,960,875,000 | null | UTF-8 | Lean | false | false | 22,091 | 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 tactic.split_ifs order.basic algebra.order algebra.ordered_group algebra.ring data.nat.cast
universe u
variable {α : Type u}
-- `mul_nonneg` and `mul_pos` in... |
9359f902e4ad63d96a776bf6a724085b8e6f5ed7 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/algebra/group/pi.lean | d63785e836d79093119f6c810e1143a4f248d8a7 | [
"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 | 9,703 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon, Patrick Massot
-/
import data.pi
import data.set.function
import tactic.pi_instances
import algebra.group.hom_instances
/-!
# Pi instances for groups and monoids
This file ... |
0fd32f899da4f42f57f94332af7a2d720f3e1195 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/group_theory/submonoid/center.lean | 899e59dc5a6c90b9dcbc7891cfa5f35eb09a9308 | [
"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 | 2,474 | lean | /-
Copyright (c) 2021 Eric Wieser. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Eric Wieser
-/
import group_theory.submonoid.operations
import group_theory.subsemigroup.center
import data.fintype.basic
/-!
# Centers of monoids
## Main definitions
* `submonoid.cent... |
59c9c0da1178415f8e33288878a58718b9a872ea | e953c38599905267210b87fb5d82dcc3e52a4214 | /library/data/num.lean | 1723b5c62b9e7dd52f2aa7f70f0f0c3a6f1dee76 | [
"Apache-2.0"
] | permissive | c-cube/lean | 563c1020bff98441c4f8ba60111fef6f6b46e31b | 0fb52a9a139f720be418dafac35104468e293b66 | refs/heads/master | 1,610,753,294,113 | 1,440,451,356,000 | 1,440,499,588,000 | 41,748,334 | 0 | 0 | null | 1,441,122,656,000 | 1,441,122,656,000 | null | UTF-8 | Lean | false | false | 17,532 | 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
-/
import data.bool tools.helper_tactics
open bool eq.ops decidable helper_tactics
namespace pos_num
theorem succ_not_is_one (a : pos_num) : is_one (succ a) ... |
17736b98ad82a3d91b06b6ff881bec79a20f1338 | ff5230333a701471f46c57e8c115a073ebaaa448 | /library/init/data/nat/bitwise.lean | 6a3072d33c6905b320d7ad0fa1d11939288d55c5 | [
"Apache-2.0"
] | permissive | stanford-cs242/lean | f81721d2b5d00bc175f2e58c57b710d465e6c858 | 7bd861261f4a37326dcf8d7a17f1f1f330e4548c | refs/heads/master | 1,600,957,431,849 | 1,576,465,093,000 | 1,576,465,093,000 | 225,779,423 | 0 | 3 | Apache-2.0 | 1,575,433,936,000 | 1,575,433,935,000 | null | UTF-8 | Lean | false | false | 10,902 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
-/
prelude
import init.data.nat.lemmas init.meta.well_founded_tactics
universe u
namespace nat
def bodd_div2 : ℕ → bool × ℕ
| 0 := (ff, 0)
| (succ n) :=... |
5c59a460ebdfa1659b24a6c7fd5c307b047ea39f | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch6/ex0102.lean | 6557eab2c9feb8fee94fa469bc33c5d7ad6c977d | [] | no_license | Ailrun/Theorem_Proving_in_Lean | ae6a23f3c54d62d401314d6a771e8ff8b4132db2 | 2eb1b5caf93c6a5a555c79e9097cf2ba5a66cf68 | refs/heads/master | 1,609,838,270,467 | 1,586,846,743,000 | 1,586,846,743,000 | 240,967,761 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 25 | lean | -- import .foo ..bar.baz
|
0d833da7900f18027695b8a5ac6dd0d687b7e275 | 29cc89d6158dd3b90acbdbcab4d2c7eb9a7dbf0f | /newtest.lean | 56600c7af564ade8054e20a7ec9e712b51951588 | [] | no_license | KjellZijlemaker/Logical_Verification_VU | ced0ba95316a30e3c94ba8eebd58ea004fa6f53b | 4578b93bf1615466996157bb333c84122b201d99 | refs/heads/master | 1,585,966,086,108 | 1,549,187,704,000 | 1,549,187,704,000 | 155,690,284 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,661 | lean | inductive tc1 {α: Type} (r: α → α → Prop) : α → α → Prop
| base : ∀a b, r a b → tc1 a b
| step : ∀a b c, r a b → tc1 b c → tc1 a c
inductive tc2 {α: Type} (r: α → α → Prop) : α → α → Prop
| base : ∀a b, r a b → tc2 a b
| pets : ∀a b c, r a b → r b c → tc2 a c
inductive tc3 {α: Type} (r: α → α → Prop) : α → α → Prop... |
ffa0eae2ebe4a3f9f1af910bd29e826627aee05c | 80746c6dba6a866de5431094bf9f8f841b043d77 | /src/data/polynomial.lean | 7bb3298bc07c80a5c6690d16818e707fa733858e | [
"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 | 85,832 | 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, Jens Wagemaker
Theory of univariate polynomials, represented as `ℕ →₀ α`, where α is a commutative semiring.
-/
import data.finsupp algebra.euclidean_domai... |
48e1b85bf0d322cfe91a22d0eee8d544b1141209 | a4673261e60b025e2c8c825dfa4ab9108246c32e | /tests/bench/qsort.lean | ef89c791b4917b6c0db3729b9ebe8b80560d8021 | [
"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 | 2,432 | lean | #lang lean4
abbrev Elem := UInt32
def badRand (seed : Elem) : Elem :=
seed * 1664525 + 1013904223
def mkRandomArray : Nat → Elem → Array Elem → Array Elem
| 0, seed, as => as
| i+1, seed, as => mkRandomArray i (badRand seed) (as.push seed)
partial def checkSortedAux (a : Array Elem) : Nat → IO Unit
| i =>
if i <... |
f54700259b58eaf15ee5529e313d171fe6141b02 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/LazyInitExtension.lean | 981151ec51058000fd4084eacdc770ed7bf93477 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 1,325 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.MonadEnv
namespace Lean
structure LazyInitExtension (m : Type → Type) (α : Type) where
ext : EnvExtension (Option α)
fn : m α
instance [... |
e9f39dc19f851ef1b46c5c1777d5c389c5652424 | 432d948a4d3d242fdfb44b81c9e1b1baacd58617 | /src/category_theory/subobject/basic.lean | 89c5365d9656b41b4239a87b0d4d7dc4987bb72c | [
"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 | 21,992 | lean | /-
Copyright (c) 2020 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta, Scott Morrison
-/
import category_theory.subobject.mono_over
import category_theory.skeletal
/-!
# Subobjects
We define `subobject X` as the quotient (by isomorphisms) of... |
3a422ea7ec1f5dbd0fe526a17a228d6341497a3d | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /stage0/src/Init/Data/Option/Basic.lean | f952aa3db373f4cfd4b0f5e4d5d49e811052d763 | [
"Apache-2.0"
] | permissive | collares/lean4 | 861a9269c4592bce49b71059e232ff0bfe4594cc | 52a4f535d853a2c7c7eea5fee8a4fa04c682c1ee | refs/heads/master | 1,691,419,031,324 | 1,618,678,138,000 | 1,618,678,138,000 | 358,989,750 | 0 | 0 | Apache-2.0 | 1,618,696,333,000 | 1,618,696,333,000 | null | UTF-8 | Lean | false | false | 2,208 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import Init.Core
import Init.Control.Basic
import Init.Coe
namespace Option
def toMonad [Monad m] [Alternative m] : Option α → m α
| none =>... |
d8193595faf584be0823e95be77592b25bad3e03 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/coe6.lean | 4408e7b94f5e6a6ee3e2371938f09aed1266dcbe | [
"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 | 311 | lean | universe variables u
structure Group :=
(carrier : Type u) (mul : carrier → carrier → carrier) (one : carrier)
attribute [instance]
definition Group_to_Type : has_coe_to_sort Group _ :=
{ coe := λ g, g^.carrier }
constant g : Group.{1}
set_option pp.binder_types true
#check λ a b : g, Group.mul g a b
|
19893b22287845e69d0f9109c2e5d5c360773878 | da23b545e1653cafd4ab88b3a42b9115a0b1355f | /src/tidy/repeat_at_least_once.lean | 49165720c37c6b0afc2f96ad3b0bac79f6733627 | [] | no_license | minchaowu/lean-tidy | 137f5058896e0e81dae84bf8d02b74101d21677a | 2d4c52d66cf07c59f8746e405ba861b4fa0e3835 | refs/heads/master | 1,585,283,406,120 | 1,535,094,033,000 | 1,535,094,033,000 | 145,945,792 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 822 | lean | -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Scott Morrison
namespace tactic
variable {α : Type}
private meta def repeat_with_results_aux (t : tactic α) : list α → tactic (list α)
| L := do r ← try_core t,
matc... |
fcf5efb5210cfcbe486f0557c1e6bd3fc9da77b1 | 968e2f50b755d3048175f176376eff7139e9df70 | /examples/prop_logic_theory/unnamed_330.lean | c4279760dc11ec7b21d51f35bb5a726232aea58a | [] | no_license | gihanmarasingha/mth1001_sphinx | 190a003269ba5e54717b448302a27ca26e31d491 | 05126586cbf5786e521be1ea2ef5b4ba3c44e74a | refs/heads/master | 1,672,913,933,677 | 1,604,516,583,000 | 1,604,516,583,000 | 309,245,750 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 161 | lean | variables p q : Prop
-- BEGIN
example (h : p ∧ q) : q ∧ p :=
begin
show q ∧ p, split,
{ show q, from h.right, },
{ show p, from h.left, },
end
-- END |
675fdd16709164139941e9a719dc2b2e7dbc1cb8 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/async_map.lean | 8e590fd3bb54e961be0c406aa23ba3c6ed85972d | [
"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 | 185 | lean | meta def list.async_map {α β} (f : α → β) (xs : list α) : list β :=
(xs.map (λ x, task.delay $ λ _, f x)).map task.get
#eval ((list.range 1000000).async_map (+1)).foldl (+) 0 |
f812845d7e0932334d670e44f898d833eb6872a7 | a721fe7446524f18ba361625fc01033d9c8b7a78 | /elaborate/append_init_last_nat.stripped.lean | a7f699c73c9ecddfe7752ce42a3cc4ee92c3b2db | [] | no_license | Sterrs/leaning | 8fd80d1f0a6117a220bb2e57ece639b9a63deadc | 3901cc953694b33adda86cb88ca30ba99594db31 | refs/heads/master | 1,627,023,822,744 | 1,616,515,221,000 | 1,616,515,221,000 | 245,512,190 | 2 | 0 | null | 1,616,429,050,000 | 1,583,527,118,000 | Lean | UTF-8 | Lean | false | false | 11,497 | lean | λ {lst : mylist mynat} (h : lst = empty → false), mylist.rec (λ (h : empty = empty → false), false.rec (false.rec (mylist mynat) (h (eq.refl empty)) ++ false.rec mynat (h (eq.refl empty)) :: empty = empty) (h (eq.refl empty))) (λ (lst_head : mynat) (lst_tail : mylist mynat) (lst_ih : ∀ (h : lst_tail = empty → false), i... |
838144ddf1fdb4dae38cba945f8fea308c02d6f5 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/matchLeftovers.lean | bca5403bbd6fb0bc42d7ff81d7c6e48451a37174 | [
"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 | 609 | lean | def f : Nat × Nat → Nat
| (a, b) => a + b
def f' : Nat × Nat → Nat
| (a, b) => by done
example (x : Nat × Nat) (h : x.1 > 0) : f x > 0 := by
match x with
| (a, b) => done
def g (x : Nat) : Nat × Nat :=
(x, x+1)
example (x : Nat) : Nat :=
match g x with
| (a, b) => by done
inductive Vector (α : Type u... |
2108ba2d6a8d18f91bbc9b1d022c516ef950b695 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/newfrontend2.lean | abb02584eeb81a7a2cd390365fdbe2f00aac29df | [
"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 | 489 | lean | def foo {α} (a : Option α) (b : α) : α :=
match a with
| some a => a
| none => b
structure S :=
(x : Nat)
#check if 0 == 1 then true else false
def f (x : Nat) : Nat :=
if x < 5 then x+1 else x-1
def x := 1
#check foo x x
#check match 1 with | x => x + 1
#check match (motive := Int → _) 1 with | x => x + 1
#ch... |
351bd8cb2ceb329a253ac11f0fbd4931cd2094c0 | d450724ba99f5b50b57d244eb41fef9f6789db81 | /src/mywork/lecture_2.lean | 455d208431e9786be25dc21f5c8e2457868418b0 | [] | no_license | jakekauff/CS2120F21 | 4f009adeb4ce4a148442b562196d66cc6c04530c | e69529ec6f5d47a554291c4241a3d8ec4fe8f5ad | refs/heads/main | 1,693,841,880,030 | 1,637,604,848,000 | 1,637,604,848,000 | 399,946,698 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,557 | lean | /-
INFERENCE RULE #1/2: EQUALITY IS REFLEXIVE
Everything is equal to itself. A bit more formally,
if one is given a type, T, and a value, t, of this
type, then you may have a proof of t = t "for free."
-/
axiom eq_refl :
∀ (T : Type) -- if T is any type (of thing)
(t : T), -- and t is thing of that type, ... |
e1bad6b0a6198172311cbbf1e1f0c85b0cc81be4 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Compiler/LCNF/LambdaLifting.lean | f75dbd88075e11b317e9da0778957bb2fe8a5bdc | [
"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 | 7,648 | 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.Instances
import Lean.Compiler.InlineAttrs
import Lean.Compiler.LCNF.Closure
import Lean.Compiler.LCNF.Types
import Lean.Compiler.LCNF.Mona... |
06471673d3df88f869e2879f29424bb5b6d62473 | ee8cdbabf07f77e7be63a449b8483ce308d37218 | /lean/src/test/mathd-algebra-114.lean | 312a8d8ed09cb208248016cb567ed4f12c7f8f9a | [
"MIT",
"Apache-2.0"
] | permissive | zeta1999/miniF2F | 6d66c75d1c18152e224d07d5eed57624f731d4b7 | c1ba9629559c5273c92ec226894baa0c1ce27861 | refs/heads/main | 1,681,897,460,642 | 1,620,646,361,000 | 1,620,646,361,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,403 | lean | /-
Copyright (c) 2021 OpenAI. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kunhao Zheng
-/
import tactic.gptf
import tactic.basic
import data.real.basic
import analysis.special_functions.pow
import data.nat.basic
example (a : ℝ) (h₀ : a = 8) : ( 16 * (a ^ 2) ^ ((1:ℝ... |
6c5c88ae001d27a4c81059926c04d737c2517003 | 3dc4623269159d02a444fe898d33e8c7e7e9461b | /.github/workflows/geo/group_objet/G.lean | 4e22700ada3c53248dbccc2d8f4f8e955b7b8758 | [] | no_license | Or7ando/lean | cc003e6c41048eae7c34aa6bada51c9e9add9e66 | d41169cf4e416a0d42092fb6bdc14131cee9dd15 | refs/heads/master | 1,650,600,589,722 | 1,587,262,906,000 | 1,587,262,906,000 | 255,387,160 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,331 | lean | import .groupk
import category_theory.comma
import category_theory.limits.limits
import category_theory.limits.shapes
import category_theory.yoneda
open category_theory
open category_theory.limits
open category_theory.category
universes v u
open Product_stuff
open lem
/-
The goal is define group obj in a categor... |
9bb505e17529d055ac581f0a8b7c9032f1ea470b | 592ee40978ac7604005a4e0d35bbc4b467389241 | /Library/generated/mathscheme-lean/CommutativeGroup.lean | a1148a0aa3ef246d49d414694eba3ed629986c7d | [] | no_license | ysharoda/Deriving-Definitions | 3e149e6641fae440badd35ac110a0bd705a49ad2 | dfecb27572022de3d4aa702cae8db19957523a59 | refs/heads/master | 1,679,127,857,700 | 1,615,939,007,000 | 1,615,939,007,000 | 229,785,731 | 4 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,866 | 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 CommutativeGroup
structure CommutativeGroup (A : Type) : Type :=
(op : (A → (A → A)))
(e : A)
(lunit_e : (∀ {x : A} , (op e x) = x))
(runit_e : (∀... |
32291f40d6a4a66b8605145bacce167d2b88165b | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/topology/category/Top/adjunctions.lean | 437da75dc77ee56c10f648befd2d3ee18966f6f3 | [
"Apache-2.0"
] | permissive | jjgarzella/mathlib | 96a345378c4e0bf26cf604aed84f90329e4896a2 | 395d8716c3ad03747059d482090e2bb97db612c8 | refs/heads/master | 1,686,480,124,379 | 1,625,163,323,000 | 1,625,163,323,000 | 281,190,421 | 2 | 0 | Apache-2.0 | 1,595,268,170,000 | 1,595,268,169,000 | null | UTF-8 | Lean | false | false | 1,406 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Mario Carneiro
-/
import topology.category.Top.basic
import category_theory.adjunction.basic
/-!
# Adjunctions regarding the category of topological spaces
This file ... |
63ca6e685fd7b2b32257a3ecfabfc2ab6c7aca9c | 432d948a4d3d242fdfb44b81c9e1b1baacd58617 | /src/tactic/aesop/priority_queue.lean | e33f23b27fca7108b6083bc82af1ba8fa97ab1e4 | [
"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 | 1,882 | lean | /-
Copyright (c) 2021 Jannis Limperg. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jannis Limperg
-/
import tactic.aesop.util
structure priority_queue (α : Type*) (lt : α → α → bool) :=
(queue : list α)
namespace priority_queue
variables {α : Type*} {lt : α → α →... |
eee3ae5db5eaa93a9ff0abe949dc997749393ea3 | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/nested_have.lean | 3b5b1ab64cf3b1ccd6acb63e5e2978647a5b865c | [
"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 | 393 | lean | import macros
theorem T (a b c d e : Bool) : (a → b) → (a → b → c) → d ∧ a → (d → c → e) → e
:= assume Hab Habc Hda Hde,
have Hd : d,
from and_eliml Hda,
have Ha : a,
from and_elimr Hda,
have Hc : c,
from (have Hb : b,
from Hab Ha,
show c,
... |
72c68fc59fbc41975a06b2be887e2451d7fd16e3 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/finset/lattice.lean | d1cebc6ae7b9f5b176a3a1b05e549a7d120f2ed9 | [] | 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 | 32,621 | 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.data.finset.fold
import Mathlib.data.multiset.lattice
import Mathlib.order.order_dual
import... |
05e1df9b5c2be30703f713bf5d316b9849d96e5a | ce89339993655da64b6ccb555c837ce6c10f9ef4 | /bluejam/topprover/16.lean | 46a649d82e3cdc46066f227e3074114049935e7a | [] | no_license | zeptometer/LearnLean | ef32dc36a22119f18d843f548d0bb42f907bff5d | bb84d5dbe521127ba134d4dbf9559b294a80b9f7 | refs/heads/master | 1,625,710,824,322 | 1,601,382,570,000 | 1,601,382,570,000 | 195,228,870 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 445 | lean | inductive gcd: nat → nat → nat → Prop
| zero : ∀ (n : nat), gcd n 0 n
| step : ∀ (n m p : nat), gcd m n p → gcd (n + m) n p
| swap : ∀ (n m p : nat), gcd m n p → gcd n m p
example : ∀ n : nat, gcd n (n + 1) 1 :=
begin
intros,
apply gcd.swap,
apply gcd.step,
induction n,
apply gcd.zero,
appl... |
2ab48a8fb1c8d14babdf0b1a454272288571d1ec | 947b78d97130d56365ae2ec264df196ce769371a | /tests/lean/run/macro.lean | 1cf032f830a4046846c3c272d1abb50bde99cbd0 | [
"Apache-2.0"
] | permissive | shyamalschandra/lean4 | 27044812be8698f0c79147615b1d5090b9f4b037 | 6e7a883b21eaf62831e8111b251dc9b18f40e604 | refs/heads/master | 1,671,417,126,371 | 1,601,859,995,000 | 1,601,860,020,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,217 | lean | new_frontend
abbrev Set (α : Type) := α → Prop
axiom setOf {α : Type} : (α → Prop) → Set α
axiom mem {α : Type} : α → Set α → Prop
axiom univ {α : Type} : Set α
axiom Union {α : Type} : Set (Set α) → Set α
syntax:100 term " ∈ " term:99 : term
macro_rules
| `($x ∈ $s) => `(mem $x $s)
declare_syntax_cat index
syntax... |
2d3bcc7e851d9ac1e11b2484003ea594b8aab6e5 | 4950bf76e5ae40ba9f8491647d0b6f228ddce173 | /src/algebra/ordered_group.lean | d5e9d16ff2bb536b4371d583f59ad2ccf06d8f52 | [
"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 | 34,103 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Mario Carneiro, Johannes Hölzl
-/
import algebra.ordered_monoid
set_option old_structure_cmd true
/-!
# Ordered groups
This file develops the basics... |
8a9c874af89347ec1d61f585f000ffde04aae70a | cc62cd292c1acc80a10b1c645915b70d2cdee661 | /src/category_theory/small.lean | baccdf254afed75cb8fb8fad076fbfc8173d073b | [] | no_license | RitaAhmadi/lean-category-theory | 4afb881c4b387ee2c8ce706c454fbf9db8897a29 | a27b4ae5eac978e9188d2e867c3d11d9a5b87a9e | refs/heads/master | 1,651,786,183,402 | 1,565,604,314,000 | 1,565,604,314,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 728 | lean | /- Categories which are small relative to a cardinal κ.
κ-filtered categories.
Normally we care about these concepts for categories which are
used to index (co)limits, so we work with small_categories. -/
import category_theory.category
import category_theory.functor
import category_theory.limits.cones
import... |
10955130708d98cbe739fe8e105ee8b5e0b418f5 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/algebra/lie/of_associative.lean | f3417892099f7dc75d66662febed3c516817f92c | [
"Apache-2.0"
] | permissive | jcommelin/mathlib | d8456447c36c176e14d96d9e76f39841f69d2d9b | ee8279351a2e434c2852345c51b728d22af5a156 | refs/heads/master | 1,664,782,136,488 | 1,663,638,983,000 | 1,663,638,983,000 | 132,563,656 | 0 | 0 | Apache-2.0 | 1,663,599,929,000 | 1,525,760,539,000 | Lean | UTF-8 | Lean | false | false | 10,650 | lean | /-
Copyright (c) 2021 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import algebra.lie.basic
import algebra.lie.subalgebra
import algebra.lie.submodule
import algebra.algebra.subalgebra.basic
/-!
# Lie algebras of associative algebras
Thi... |
0844b2bec9188b967287e79dcff2caae807b86b4 | acc85b4be2c618b11fc7cb3005521ae6858a8d07 | /tactic/converter/binders.lean | f0c00db062f2b03572c2b5638f2e58aa88b164b6 | [
"Apache-2.0"
] | permissive | linpingchuan/mathlib | d49990b236574df2a45d9919ba43c923f693d341 | 5ad8020f67eb13896a41cc7691d072c9331b1f76 | refs/heads/master | 1,626,019,377,808 | 1,508,048,784,000 | 1,508,048,784,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,897 | 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
Binder elimination
-/
import order tactic.converter.old_conv
namespace old_conv
open tactic monad
meta instance : monad_fail old_conv :=
{ old_conv.monad with fail :=... |
8b364e150981e01aeffe93accb199e32ce6fd708 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/geometry/manifold/algebra/smooth_functions.lean | 3a3a4199b49a5bc7870be9bb941e4b6617e0e3e5 | [
"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 | 10,477 | lean | /-
Copyright © 2020 Nicolò Cavalleri. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nicolò Cavalleri
-/
import geometry.manifold.algebra.structures
/-!
# Algebraic structures over smooth functions
In this file, we define instances of algebraic structures over smoot... |
0ed4834789de159d22aaecc758e7bbe7aa7e9e38 | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/data/rat/order.lean | b0db0b6f1abb9d87afcdf411577ce42c0353e054 | [
"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 | 9,464 | 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.basic
/-!
# Order for Rational Numbers
## Summary
We define the order on `ℚ`, prove that `ℚ` is a discrete, linearly ordered field, ... |
69d9bac49e8102a5085db7c7a98c4b49faeedca1 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/measure_theory/decomposition/jordan.lean | e1cad89cc57033cbc202dab9c7a52619ab016c71 | [
"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 | 25,309 | lean | /-
Copyright (c) 2021 Kexing Ying. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kexing Ying
-/
import measure_theory.decomposition.signed_hahn
import measure_theory.measure.mutually_singular
/-!
# Jordan decomposition
This file proves the existence and uniqueness o... |
d0b653fed38a393078ae8ec3e0163b2ae9b9ac45 | 618003631150032a5676f229d13a079ac875ff77 | /src/algebra/group_with_zero_power.lean | 0d89caf98b337c0c61d754177a3e39ef3690b2c3 | [
"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 | 7,645 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import algebra.group_power
/-!
# Powers of elements of groups with an adjoined zero element
In this file we define integer power functions for groups with an adjoin... |
86b3da3fceac26cdb4c3f32b0246223a3de05386 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/analysis/complex/upper_half_plane/basic.lean | 3660a15597c8f07eed34d745247c00d7dd02e76c | [
"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 | 10,412 | lean | /-
Copyright (c) 2021 Alex Kontorovich and Heather Macbeth and Marc Masdeu. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Alex Kontorovich, Heather Macbeth, Marc Masdeu
-/
import linear_algebra.special_linear_group
import analysis.complex.basic
import group_theory.gr... |
e775622b1a9d0b79b16dca514e8d0ebda371b0ae | bb31430994044506fa42fd667e2d556327e18dfe | /src/algebra/module/dedekind_domain.lean | 775f0ed1430552a628cd8ec1ea5aac781a68b277 | [
"Apache-2.0"
] | permissive | sgouezel/mathlib | 0cb4e5335a2ba189fa7af96d83a377f83270e503 | 00638177efd1b2534fc5269363ebf42a7871df9a | refs/heads/master | 1,674,527,483,042 | 1,673,665,568,000 | 1,673,665,568,000 | 119,598,202 | 0 | 0 | null | 1,517,348,647,000 | 1,517,348,646,000 | null | UTF-8 | Lean | false | false | 3,222 | lean | /-
Copyright (c) 2022 Pierre-Alexandre Bazin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Pierre-Alexandre Bazin
-/
import algebra.module.torsion
import ring_theory.dedekind_domain.ideal
/-!
# Modules over a Dedekind domain
Over a Dedekind domain, a `I`-torsion mo... |
8e53ea68aafbb79e8a25086167a6311cf5581714 | 1abd1ed12aa68b375cdef28959f39531c6e95b84 | /src/algebra/lie/classical.lean | 4195212d25b337b160e19780d22a4973bcb957ae | [
"Apache-2.0"
] | permissive | jumpy4/mathlib | d3829e75173012833e9f15ac16e481e17596de0f | af36f1a35f279f0e5b3c2a77647c6bf2cfd51a13 | refs/heads/master | 1,693,508,842,818 | 1,636,203,271,000 | 1,636,203,271,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 13,718 | lean | /-
Copyright (c) 2020 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import algebra.invertible
import algebra.lie.skew_adjoint
import algebra.lie.abelian
import linear_algebra.matrix.trace
import linear_algebra.matrix.transvection
import dat... |
98a63125e91d68b0ab960dff30dfd17a070739bc | a4673261e60b025e2c8c825dfa4ab9108246c32e | /stage0/src/Std/Data/AssocList.lean | 02b2deecd3698815d4b44b57012cec12da38593f | [
"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 | 3,084 | 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
-/
universes u v w w'
namespace Std
/- List-like type to avoid extra level of indirection -/
inductive AssocList (α : Type u) (β : Type v) :=
| nil : AssocLi... |
7b7cf0e0add9b5c683938f9b52523dee2c0b9e9a | 0ddf2dd8409bcb923d11603846800bd9699616ea | /my_algebra.lean | 33b5950960e06c52d233a75a68969e40e73a44f2 | [] | no_license | tounaishouta/Lean | 0cbaaa9340e7f8f884504ea170243e07a54f0566 | 1d75311f5506ca2bfd8b7ccec0b7d70c3319d555 | refs/heads/master | 1,610,229,383,935 | 1,459,950,226,000 | 1,459,950,226,000 | 50,836,185 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,757 | lean | import standard
namespace my_algebra
/- Magma -/
section
structure Magma.{l} : Type.{l + 1} :=
(carrier : Type.{l})
(mul : carrier → carrier → carrier)
end
/- Semigroup -/
section
structure Semigroup.{l} extends Magma.{l} : Type.{l + 1} :=
(mul_assoc : ∀ {x y z : carrier}, mul x (mul y z) = mul (m... |
fe71d3443568fbe519afc3e530a05dc87f778513 | 9b3d2b4b77abbff73696b5496622a33c36d7e08a | /src/trace.lean | dc740589f05e30ba803a6624efeabfdba9e410bf | [] | no_license | TOTBWF/lean4-raytrace | c328e1d596a1f4c2d92ae673260ad4dfc642e4ed | 6f4e9712ce15ff29523ae30416ea6ce5ea26818e | refs/heads/master | 1,676,715,704,423 | 1,610,528,616,000 | 1,610,528,616,000 | 329,246,745 | 9 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,796 | lean | --------------------------------------------------------------------------------
-- A Lean 4 Raytracer
--
-- Author: Reed Mullanix
--
-- Inspiration Drawn from https://raytracing.github.io/books/RayTracingInOneWeekend.html
--------------------------------------------------------------------------------
-- Weird missin... |
8f0cbf2c5f76a21ca66c9553db9ff6fc778ec4fa | 491068d2ad28831e7dade8d6dff871c3e49d9431 | /tests/lean/slow/nat_wo_hints.lean | 9f21880d784d846fe91d3a4cd5718932f1227d1a | [
"Apache-2.0"
] | permissive | davidmueller13/lean | 65a3ed141b4088cd0a268e4de80eb6778b21a0e9 | c626e2e3c6f3771e07c32e82ee5b9e030de5b050 | refs/heads/master | 1,611,278,313,401 | 1,444,021,177,000 | 1,444,021,177,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 49,745 | lean | ----------------------------------------------------------------------------------------------------
-- Copyright (c) 2014 Floris van Doorn. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Author: Floris van Doorn
-----------------------------------------------------------... |
5804d4b452e49195037c73d4922140a03f7ec2c2 | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/category_theory/sites/pretopology.lean | f9884a7ab6e31cf3d8d955c369e57e4bafa68734 | [
"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 | 8,518 | lean | /-
Copyright (c) 2020 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta
-/
import category_theory.sites.grothendieck
/-!
# Grothendieck pretopologies
Definition and lemmas about Grothendieck pretopologies.
A Grothendieck pretopology for a cat... |
d580bd5d1abeb4944070cfd6113c8e743539f7e7 | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /hott/hit/coeq.hlean | 565fbaf0af6269ce64489c5bcedddfef215f04f3 | [
"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 | 2,443 | hlean | /-
Copyright (c) 2015 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: hit.coeq
Authors: Floris van Doorn
Declaration of the coequalizer
-/
import .type_quotient
open type_quotient eq equiv
namespace coeq
section
universe u
parameters {A B : Type.{... |
3cda7b2640199c783ee632af8ae55cdd0ed8ebe9 | 680b0d1592ce164979dab866b232f6fa743f2cc8 | /library/data/list/comb.lean | 7db7cb680da579cfe3f8dcbe1f3fed55de9a18fb | [
"Apache-2.0"
] | permissive | syohex/lean | 657428ab520f8277fc18cf04bea2ad200dbae782 | 081ad1212b686780f3ff8a6d0e5f8a1d29a7d8bc | refs/heads/master | 1,611,274,838,635 | 1,452,668,188,000 | 1,452,668,188,000 | 49,562,028 | 0 | 0 | null | 1,452,675,604,000 | 1,452,675,602,000 | null | UTF-8 | Lean | false | false | 24,240 | lean | /-
Copyright (c) 2015 Leonardo de Moura. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Haitao Zhang, Floris van Doorn
List combinators.
-/
import data.list.basic data.equiv
open nat prod decidable function helper_tactics
namespace list
variables {... |
4c98562ad469537fb11d090d7d18555471fa85c6 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/run/simplifier_custom_relations.lean | f87307442b986e66f8e18cc1dd322e87a0a4dc61 | [
"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 | 989 | lean | open tactic
constants (A : Type) (rel : A → A → Prop)
(rel.refl : ∀ a, rel a a)
(rel.symm : ∀ a b, rel a b → rel b a)
(rel.trans : ∀ a b c, rel a b → rel b c → rel a c)
attribute [refl] rel.refl
attribute [symm] rel.symm
attribute [trans] rel.trans
constants (x y z : A) (f g h : A → A)... |
8ff3a0a6a4e3beb0382af494798ddd1b3dde8ae6 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/category_theory/monoidal/rigid.lean | 6baad7967beddbdc3c7b88b3c1533b090e69a11b | [
"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 | 11,855 | lean | /-
Copyright (c) 2021 Jakob von Raumer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jakob von Raumer
-/
import category_theory.monoidal.category
/-!
# Rigid (autonomous) monoidal categories
This file defines rigid (autonomous) monoidal categories and the necessa... |
b09346512fe5db6c52358392feda64e905ae38fc | e4a7c8ab8b68ca0e53d2c21397320ea590fa01c6 | /src/tactic/polya/field/default.lean | 7aa50c23d4a2ca93099ed29607c9fed05119a4e2 | [] | no_license | lean-forward/field | 3ff5dc5f43de40f35481b375f8c871cd0a07c766 | 7e2127ad485aec25e58a1b9c82a6bb74a599467a | refs/heads/master | 1,590,947,010,909 | 1,563,811,881,000 | 1,563,811,881,000 | 190,415,651 | 1 | 0 | null | 1,563,643,371,000 | 1,559,746,688,000 | Lean | UTF-8 | Lean | false | false | 13 | lean | import .main
|
7b12196842219ef5b3f0411e0463d3ed8c9733e7 | e0f9ba56b7fedc16ef8697f6caeef5898b435143 | /src/tactic/solve_by_elim.lean | a9d1b0b0e5e2c125ca7b2918c91a76f1ea430dd6 | [
"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 | 12,218 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon, Scott Morrison
-/
import tactic.core
/-!
# solve_by_elim
A depth-first search backwards reasoner.
`solve_by_elim` takes a list of lemmas, and repeating tries to `apply` th... |
b3912602adc5ae0325897f7ece9a02702f1b54e1 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/group_theory/sylow.lean | 44a8af17a1ca7fca8456b56177ff4d766e4e5d7a | [
"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 | 20,942 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Thomas Browning
-/
import data.set_like.fintype
import group_theory.group_action.conj_act
import group_theory.p_group
/-!
# Sylow theorems
The Sylow theorems are the fol... |
648c443bbfa08b0a7e6c2ddfbe13efb00a49771c | 5e42295de7f5bcdf224b94603a8ec29b17c2d367 | /prod_form.lean | d09d1b6134f8307cdf365e7e157706601d334184 | [] | no_license | pnmadelaine/lean_polya | 9369e0d87dce773f91383bb58ac6fde0a00a1a40 | 1c62b0b3fa71044b0225ce28030627d251b08ebc | refs/heads/master | 1,590,161,172,243 | 1,515,010,019,000 | 1,515,010,019,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 49,355 | lean | import .datatypes .blackboard .proof_reconstruction .reconstruction_theorems .radicals .proof_trace
-- TODO: maybe more of this can move to datatypes
namespace polya
meta def approx_prec := 100
private meta def round_rat_to_prec_over (q : ℚ) (prec : ℕ) : ℚ :=
let z' := ((q.num.nat_abs*prec)/q.denom) + 1 in
rat.mk_... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.