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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
68e06bfeaf0a68489743e269977c70ec134db315 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/ring_theory/polynomial/vieta.lean | d3687f762f0b27b844b86cffc6ed47da4511e620 | [
"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,027 | lean | /-
Copyright (c) 2020 Hanting Zhang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hanting Zhang
-/
import data.polynomial.splits
import ring_theory.mv_polynomial.symmetric
/-!
# Vieta's Formula
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file r... |
c7fa6d89ce2ebca783bb728d93b9585b717be0e7 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/run/match_pattern1.lean | 4562a85c78abd6f70a1d1e2079be0ab77c07066e | [
"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 | 499 | lean | open tactic expr
set_option pp.all true
example (a b c x y : nat) (H : nat.add (nat.add x y) y = 0) : true :=
by do
a ← get_local `a, b ← get_local `b, c ← get_local `c,
nat_add : expr ← mk_const `nat.add,
p : pattern ← mk_pattern [] [a, b] (app_of_list nat_add [a, b]) [] [app_of_list nat_add [b, a], a, b],
... |
121973709f2b7687ab568ead04499b231bbcb7b4 | 947b78d97130d56365ae2ec264df196ce769371a | /stage0/src/Init/Data/Nat/Basic.lean | e23202f1c34ecdd2791bef7328aac3e52b41a63c | [
"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,379 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Leonardo de Moura
-/
prelude
import Init.Core
universes u
namespace Nat
@[extern "lean_nat_dec_eq"]
def beq : Nat → Nat → Bool
| zero, zero => true
| zer... |
7be52d811380465c0b8a51ace6c494dce07aa5db | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/linear_algebra/alternating.lean | 056a9303a425f0b85362d701e60dac7bb8a5e00f | [] | 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 | 24,036 | lean | /-
Copyright (c) 2020 Zhangir Azerbayev. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Eric Wieser, Zhangir Azerbayev
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.linear_algebra.multilinear
import Mathlib.linear_algebra.linear_independe... |
63ba33840e9898ff8b48b006fdc08deb5f4e8d2a | e514e8b939af519a1d5e9b30a850769d058df4e9 | /src/tactic/rewrite_search/discovery/collector/everything.lean | 69a1bb4ef36060ac68f9c334a34e1bfa2c83503e | [] | no_license | semorrison/lean-rewrite-search | dca317c5a52e170fb6ffc87c5ab767afb5e3e51a | e804b8f2753366b8957be839908230ee73f9e89f | refs/heads/master | 1,624,051,754,485 | 1,614,160,817,000 | 1,614,160,817,000 | 162,660,605 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 1,671 | lean | import tactic.rewrite_search.core.common
import ..types
import .common
open tactic
namespace tactic.rewrite_search.discovery
open tactic.rewrite_search
-- TODO print the lemmas which were being added
-- TODO use the metric to score the rewrites and pick the top few which are high-scoring
-- TODO only try some of o... |
e53817c1176fa8bab3c33f615ea2df63dc10da82 | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/tactic/omega/misc.lean | a2ed98da5b4522c8a17a3a2517d9f055c7d3001f | [
"Apache-2.0"
] | permissive | fpvandoorn/mathlib | b21ab4068db079cbb8590b58fda9cc4bc1f35df4 | b3433a51ea8bc07c4159c1073838fc0ee9b8f227 | refs/heads/master | 1,624,791,089,608 | 1,556,715,231,000 | 1,556,715,231,000 | 165,722,980 | 5 | 0 | Apache-2.0 | 1,552,657,455,000 | 1,547,494,646,000 | Lean | UTF-8 | Lean | false | false | 1,167 | lean | /-
Copyright (c) 2019 Seul Baek. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Seul Baek
Miscellaneous.
-/
variables {α β γ : Type}
namespace omega
lemma fun_mono_2 {p : α → β → γ} {a1 a2 : α} {b1 b2 : β} :
a1 = a2 → b1 = b2 → (p a1 b1 = p a2 b2) :=
λ h1 h2, by r... |
c4441adc4d170028c2dc03bb82c5731671e4a662 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/tactic/push_neg.lean | 1f7110e44b38a63a69eb5986d719c574775e2093 | [
"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 | 10,412 | lean | /-
Copyright (c) 2019 Patrick Massot All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Simon Hudon
-/
import tactic.core
import logic.basic
/-!
# A tactic pushing negations into an expression
-/
open tactic expr
/- Enable the option `trace.push_neg.use_... |
1a1395b5f31c2986024fd93eeb87dbd4019fee1e | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/604.lean | bca5913bc67bd0a2580f391c09d72f9ace178207 | [
"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 | 196 | lean | def foo {{u : Unit}} : Unit := u
#check foo -- foo : ⦃u : Unit⦄ → Unit
#check (foo : ∀ {{u : Unit}}, Unit)
def bla {u : Unit} : Unit := u
#check bla
#check (bla : ∀ {u : Unit}, Unit)
|
2985bb645c691c46e10cf0934e159787aa5e8ae0 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/analysis/normed_space/extr.lean | ea541566064e6f3aa377ecba332db2c5070ae25a | [
"Apache-2.0"
] | permissive | urkud/mathlib | eab80095e1b9f1513bfb7f25b4fa82fa4fd02989 | 6379d39e6b5b279df9715f8011369a301b634e41 | refs/heads/master | 1,658,425,342,662 | 1,658,078,703,000 | 1,658,078,703,000 | 186,910,338 | 0 | 0 | Apache-2.0 | 1,568,512,083,000 | 1,557,958,709,000 | Lean | UTF-8 | Lean | false | false | 3,993 | lean | /-
Copyright (c) 2022 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import analysis.normed_space.ray
import topology.local_extr
/-!
# (Local) maximums in a normed space
In this file we prove the following lemma, see `is_max_filter... |
39b09afb32e71a7be95315dfce26c5e87a1ca570 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/measure_theory/integral/periodic.lean | 9e9acb3aaca47cc0fbad4ce772f98ded0e753dbe | [
"Apache-2.0"
] | permissive | jcommelin/mathlib | d8456447c36c176e14d96d9e76f39841f69d2d9b | ee8279351a2e434c2852345c51b728d22af5a156 | refs/heads/master | 1,664,782,136,488 | 1,663,638,983,000 | 1,663,638,983,000 | 132,563,656 | 0 | 0 | Apache-2.0 | 1,663,599,929,000 | 1,525,760,539,000 | Lean | UTF-8 | Lean | false | false | 8,291 | lean | /-
Copyright (c) 2021 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import measure_theory.group.fundamental_domain
import measure_theory.integral.interval_integral
import topology.algebra.order.floor
/-!
# Integrals of periodic fun... |
6471b9b097be46ca99ac18af67cd1554814483e8 | 618003631150032a5676f229d13a079ac875ff77 | /src/category_theory/limits/shapes/wide_pullbacks.lean | f33222abe162bbd8b27b74e2669ee377f515c1cc | [
"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,891 | 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 data.fintype.basic
import category_theory.limits.limits
import category_theory.limits.shapes.finite_limits
import category_theory.sparse
/-!
# Wide pullbacks
We ... |
7b0fc2252b868612fef67a874e1a8c235cdc02f9 | 1abd1ed12aa68b375cdef28959f39531c6e95b84 | /src/algebra/opposites.lean | 70cfa8d311ec4b2d4d1fbe876a08ea0bafae1a0d | [
"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 | 23,327 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import data.opposite
import algebra.field
import algebra.group.commute
import group_theory.group_action.defs
import data.equiv.mul_add
/-!
# Algebraic operations on `αᵒᵖ`
Thi... |
807917290031bff9f6bc3b7d5788b2466604ec53 | 86f6f4f8d827a196a32bfc646234b73328aeb306 | /examples/logic/unnamed_531.lean | 684eaed74a58acb2ab65cb60789754875332dec3 | [] | 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 | 234 | lean | import data.real.basic
-- BEGIN
open function
example (c : ℝ) : injective (λ x, x + c) :=
begin
intros x₁ x₂ h',
exact (add_left_inj c).mp h',
end
example {c : ℝ} (h : c ≠ 0) : injective (λ x, c * x) :=
sorry
-- END |
eed210005736722e7f7b9c3c2c98e3317f744d92 | 9c1ad797ec8a5eddb37d34806c543602d9a6bf70 | /monoidal_categories/monoidal_functor.lean | 5c408e642b601c7540aaafa8454e02efb1d714e3 | [] | no_license | timjb/lean-category-theory | 816eefc3a0582c22c05f4ee1c57ed04e57c0982f | 12916cce261d08bb8740bc85e0175b75fb2a60f4 | refs/heads/master | 1,611,078,926,765 | 1,492,080,000,000 | 1,492,080,000,000 | 88,348,246 | 0 | 0 | null | 1,492,262,499,000 | 1,492,262,498,000 | null | UTF-8 | Lean | false | false | 8,108 | lean | -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Stephen Morgan, Scott Morrison
import .monoidal_category
open tqft.categories
open tqft.categories.functor
open tqft.categories.natural_transformation
open tqft.categories.monoi... |
03efa3bd327a4a3e56168c975af9dfe579acf157 | 94637389e03c919023691dcd05bd4411b1034aa5 | /src/inClassNotes/higherOrderFunctions/right_fold_test.lean | a1bdfbfeb75b58d0160f7e7e187e640814ed2db7 | [] | no_license | kevinsullivan/complogic-s21 | 7c4eef2105abad899e46502270d9829d913e8afc | 99039501b770248c8ceb39890be5dfe129dc1082 | refs/heads/master | 1,682,985,669,944 | 1,621,126,241,000 | 1,621,126,241,000 | 335,706,272 | 0 | 38 | null | 1,618,325,669,000 | 1,612,374,118,000 | Lean | UTF-8 | Lean | false | false | 4,854 | lean | /-
In this file, I explain why the foldr function has
such a funny-looking type.
The following examples have much in common
- Reducing a list of strings to a bool that indicates whether all of them have a given property
- Reducing a list of strings to a natural number that indicates the sum of all of their lengths
... |
73ce19d4f1935682a5bccc0594cfdd8888d7af79 | c31182a012eec69da0a1f6c05f42b0f0717d212d | /src/polyhedral_lattice/cech.lean | 3aa1e1994988ec73bb5848869962a03993685439 | [] | 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 | 15,781 | lean | import algebraic_topology.simplicial_object
import ring_theory.int.basic
import polyhedral_lattice.finsupp
import polyhedral_lattice.category
import polyhedral_lattice.quotient
/-!
# The Čech conerve attached to `Λ → Λ'`
Let `f : Λ → Λ'` be a morphism of polyhedral lattices.
(We probably need to assume that the coke... |
ae594d661b30df500ddce41f97f83232ea33a750 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/measure_theory/group/measure.lean | 55fac767a5bbd75e41634cd846cf789454a8fa91 | [
"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 | 31,759 | lean | /-
Copyright (c) 2020 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
-/
import dynamics.ergodic.measure_preserving
import measure_theory.measure.regular
import measure_theory.group.measurable_equiv
import measure_theory.measure.open_p... |
a7c4f12dec3cd3b9518fd65a27c8124df3480a39 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/data/fin/interval.lean | d456b9f0b53ed67e994eb58528d0ed8b4cc0c4a6 | [
"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 | 5,387 | 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.nat.interval
/-!
# Finite intervals in `fin n`
This file proves that `fin n` is a `locally_finite_order` and calculates the cardinality of its
intervals as ... |
d67ff6451181c7f6d7245673c7d18532cf325d3d | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /stage0/src/Lean/Compiler/LCNF.lean | 3068c3d2b02803e3f74d60fe1d2160e45299079d | [
"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 | 1,274 | lean | /-
Copyright (c) 2022 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Compiler.LCNF.AlphaEqv
import Lean.Compiler.LCNF.Basic
import Lean.Compiler.LCNF.Bind
import Lean.Compiler.LCNF.Check
import Lean.Compiler.LCNF.... |
ca58dd543fa4bd16badbf5a13a88d2f657d14450 | a4673261e60b025e2c8c825dfa4ab9108246c32e | /tests/lean/run/instances.lean | ce5c076d701f863dc9af74c45c3300edb3c38e57 | [
"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 | 289 | lean | import Lean
open Lean
open Lean.Meta
unsafe def tst1 : IO Unit :=
withImportModules [{module := `Lean}] {} 0 fun env => do
let aux : MetaM Unit := do
let insts ← getGlobalInstancesIndex
IO.println (format insts)
discard <| aux.run |>.toIO {} { env := env }
#eval tst1
|
976cf2417cdc295efe3d25edc0daf55bd7dd3701 | d436468d80b739ba7e06843c4d0d2070e43448e5 | /src/algebra/group/basic.lean | 28b8d9e2c0745ef34b93952870f01fd032fd8ce9 | [
"Apache-2.0"
] | permissive | roro47/mathlib | 761fdc002aef92f77818f3fef06bf6ec6fc1a28e | 80aa7d52537571a2ca62a3fdf71c9533a09422cf | refs/heads/master | 1,599,656,410,625 | 1,573,649,488,000 | 1,573,649,488,000 | 221,452,951 | 0 | 0 | Apache-2.0 | 1,573,647,693,000 | 1,573,647,692,000 | null | UTF-8 | Lean | false | false | 8,035 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Simon Hudon, Mario Carneiro
Various multiplicative and additive structures.
-/
import algebra.group.to_additive logic.function
universe u
variable {α : Type u}
@[to_ad... |
8aeabde273a5e81b448330b6273363e1c025bb16 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tests/lean/run/doNotation3.lean | 34f802e45fcef7126fa463c348d5e5d0d9626f86 | [
"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 | 2,672 | lean | theorem zero_lt_of_lt : {a b : Nat} → a < b → 0 < b
| 0, _, h => h
| a+1, b, h =>
have : a < b := Nat.lt_trans (Nat.lt_succ_self _) h
zero_lt_of_lt this
def fold {m α β} [Monad m] (as : Array α) (b : β) (f : α → β → m β) : m β := do
let rec loop : (i : Nat) → i ≤ as.size → β → m β
| 0, h, b => b
| i+1, h, ... |
d6244a19b7ce4d196ccd9e9950130c6623465d22 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/tactic/algebra.lean | 81e5b82212487db21ff8c2188bff2c78584bdc52 | [] | 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 | 298 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.tactic.core
import Mathlib.PostPort
namespace Mathlib
namespace tactic
|
5f171c17f5df2c6cff30f89a1dbf196f5e2a1d6c | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/topology/algebra/ring.lean | 8a838f5c91cf4841d703f0998cd6880eb472f5b9 | [
"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,001 | lean | /-
Copyright (c) 2018 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Johannes Hölzl
Theory of topological rings.
-/
import topology.algebra.group ring_theory.ideals
open classical set lattice filter topological_space
open_locale class... |
8068eae04ec32bfbfef53521f55849918eba8f26 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/data/polynomial/ring_division.lean | 9f5c63f712c37d2199353cf4780bad744410ece8 | [
"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 | 20,577 | 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.polynomial.div
import data.polynomial.algebra_map
/-!
# Theory of univariate po... |
da025554d71b3f651f67475815dcefdc8227453d | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/logic/function/basic.lean | 2f30f9709eb8c6fec9939c38715eeca79b90634c | [
"Apache-2.0"
] | permissive | agjftucker/mathlib | d634cd0d5256b6325e3c55bb7fb2403548371707 | 87fe50de17b00af533f72a102d0adefe4a2285e8 | refs/heads/master | 1,625,378,131,941 | 1,599,166,526,000 | 1,599,166,526,000 | 160,748,509 | 0 | 0 | Apache-2.0 | 1,544,141,789,000 | 1,544,141,789,000 | null | UTF-8 | Lean | false | false | 17,670 | lean | /-
Copyright (c) 2016 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.basic
import data.option.defs
/-!
# Miscellaneous function constructions and lemmas
-/
universes u v w
namespace function
section
var... |
365b803b19c67d1938e5d1353582643e062d00d1 | e0f9ba56b7fedc16ef8697f6caeef5898b435143 | /src/data/set/basic.lean | ff7160fff602621c99c1966c16f671814d605dac | [
"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 | 66,225 | 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
-/
import tactic.basic
import tactic.finish
import data.subtype
import logic.unique
import data.prod
/-!
# Basic properties of sets
Sets in Lean are ... |
27632baafe97e8d5e63c5ffb903c4ddb37690a73 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/982.lean | eac0212c0484bbdc629a87f010c3c719d9c28d3a | [
"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 | 296 | lean | import data.nat
open nat
constant P : nat → Prop
example (Hex : ∃ n, P n) : true :=
obtain n Hn, from Hex,
begin
note Hn2 := Hn,
exact trivial
end
example (Hex : ∃ n, P n) : true :=
obtain n Hn, from Hex,
begin
have H : n ≥ 0, from sorry,
exact trivial
end
|
db5498fb18dd01529f44ab96db22bb13d48833a5 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /src/Lean/Compiler/IR/SimpCase.lean | 6c59e7a18d776f559db87de8bc4b17058d52fea8 | [
"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 | 2,234 | 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.Compiler.IR.Basic
import Lean.Compiler.IR.Format
namespace Lean.IR
def ensureHasDefault (alts : Array Alt) : Array Alt :=
if alts.any Alt.is... |
031549226de9a3f6bfd27504e935f39a1dc17650 | 4b846d8dabdc64e7ea03552bad8f7fa74763fc67 | /tests/lean/run/isabelle.lean | 3d5f25966bcaba5f690b56342e77e501bc38a412 | [
"Apache-2.0"
] | permissive | pacchiano/lean | 9324b33f3ac3b5c5647285160f9f6ea8d0d767dc | fdadada3a970377a6df8afcd629a6f2eab6e84e8 | refs/heads/master | 1,611,357,380,399 | 1,489,870,101,000 | 1,489,870,101,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,230 | 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, ... |
0a9cf2ed79c7d4a066b91d4cae7e7d479c1afda2 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/limits/shapes/regular_mono.lean | 5cf7541ad07ced388316a9c6cd30608b75634dea | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,911 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Bhavik Mehta
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.category_theory.limits.preserves.basic
import Mathlib.category_theory.limits.... |
ebf5b0f8f828434b181826830d28f933633ebcb2 | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /src/measure_theory/decomposition/lebesgue.lean | 747e9f038a855e3ea815350af9a3b093cf70ba2f | [
"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 | 59,936 | 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.jordan
import measure_theory.measure.with_density_vector_measure
/-!
# Lebesgue decomposition
This file proves the Lebesgue decomposit... |
4c09e15c32784442efc3e68cdfc5291835403f92 | a46270e2f76a375564f3b3e9c1bf7b635edc1f2c | /4.6.4.lean | 45c6c5b3ac835e0bcd56e7111d4f8096d6a70447 | [
"CC0-1.0"
] | permissive | wudcscheme/lean-exercise | 88ea2506714eac343de2a294d1132ee8ee6d3a20 | 5b23b9be3d361fff5e981d5be3a0a1175504b9f6 | refs/heads/master | 1,678,958,930,293 | 1,583,197,205,000 | 1,583,197,205,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,038 | lean | namespace hidden
def divides (m n : ℕ) : Prop := ∃ k, m * k = n
instance : has_dvd nat := ⟨divides⟩
def even (n : ℕ) : Prop := 2 ∣ n -- You can enter the '∣' character by typing \mid
section
variables m n : ℕ
#check m ∣ n
#check m^n
#check even (m^n +3)
end
end hidden
def prime (n : ℕ) ... |
e157b1fc546a292edc7dd46d6b2bd4771ffad2ca | 88892181780ff536a81e794003fe058062f06758 | /src/100_theorems/t058.lean | 0265087df71161df31e87f204553697bf3ec9a38 | [] | no_license | AtnNn/lean-sandbox | fe2c44280444e8bb8146ab8ac391c82b480c0a2e | 8c68afbdc09213173aef1be195da7a9a86060a97 | refs/heads/master | 1,623,004,395,876 | 1,579,969,507,000 | 1,579,969,507,000 | 146,666,368 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 204 | lean | import data.finset
-- Formula for the Number of Combinations
open finset
theorem t058 {α} : Π (n : ℕ) (s : finset α),
card (powerset_len n s) = nat.choose (card s) n
:= finset.card_powerset_len
|
2552bb0d54be1684879fa86afc06e50b0ebb3864 | 80746c6dba6a866de5431094bf9f8f841b043d77 | /src/topology/basic.lean | d2e0c4a4496a135a0d3706576b2ca01bcaef536e | [
"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 | 90,945 | 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
Theory of topological spaces.
Parts of the formalization is based on the books:
N. Bourbaki: General Topology
I. M. James: Topologies and Uniformit... |
e88dbcafb2b1316594d5e07f369afc31c65dbc9a | 022547453607c6244552158ff25ab3bf17361760 | /src/measure_theory/lp_space.lean | 02ba0e737bcc9819ae7df24f96ee19372acbf851 | [
"Apache-2.0"
] | permissive | 1293045656/mathlib | 5f81741a7c1ff1873440ec680b3680bfb6b7b048 | 4709e61525a60189733e72a50e564c58d534bed8 | refs/heads/master | 1,687,010,200,553 | 1,626,245,646,000 | 1,626,245,646,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 95,294 | lean | /-
Copyright (c) 2020 Rémy Degenne. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Rémy Degenne, Sébastien Gouëzel
-/
import measure_theory.ess_sup
import measure_theory.ae_eq_fun
import measure_theory.mean_inequalities
import topology.continuous_function.compact
impor... |
e0536c94538a08d49e791aee34883c844e4d5d75 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/ring_theory/subring/basic.lean | 5de9780f72b5f8734bc3108df8d315a492bbedd9 | [
"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 | 46,877 | lean | /-
Copyright (c) 2020 Ashvni Narayanan. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Ashvni Narayanan
-/
import group_theory.subgroup.basic
import ring_theory.subsemiring.basic
/-!
# Subrings
Let `R` be a ring. This file defines the "bundled" subring type `subring... |
7ce64d058b33f5e7a6b6d9cb9eba0c18995faea7 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/field_theory/finite/basic.lean | 1096c12d080a889567e1c5a23996e6cc51b15437 | [
"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 | 20,263 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Joey van Langen, Casper Putz
-/
import tactic.apply_fun
import algebra.ring.equiv
import data.zmod.algebra
import linear_algebra.finite_dimensional
import ring_theory.integ... |
994d9c392d01025b72cb609c8e08b9971e7f6b5b | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/char_p/exp_char.lean | 86273305cea30bf564d45ac24dc157409e05542a | [
"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,176 | lean | /-
Copyright (c) 2021 Jakob Scholbach. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jakob Scholbach
-/
import algebra.char_p.basic
import data.nat.prime
/-!
# Exponential characteristic
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a... |
007ca09ff01b217d4d50799de4d6afb7eb72068d | 947b78d97130d56365ae2ec264df196ce769371a | /stage0/src/Init/Control/MonadLift.lean | 7215013fe5a5028c6ea4ad8d5454251621433acb | [
"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,985 | lean | /-
Copyright (c) 2016 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner, Sebastian Ullrich
Classy functions for lifting monadic actions of different shapes.
This theory is roughly modeled after the Haskell 'layers' package https://hackage.ha... |
d95ca313b410b38ac5b612f767c7db30b65c2c9a | 3863d2564418bccb1859e057bf5a4ef240e75fd7 | /hott/types/sum.hlean | 652f5a29016f0c269d85ebd1170d2b439a15a6a7 | [
"Apache-2.0"
] | permissive | JacobGross/lean | 118bbb067ff4d4af48a266face2c7eb9868fa91c | eb26087df940c54337cb807b4bc6d345d1fc1085 | refs/heads/master | 1,582,735,011,532 | 1,462,557,826,000 | 1,462,557,826,000 | 46,451,196 | 0 | 0 | null | 1,462,557,826,000 | 1,447,885,161,000 | C++ | UTF-8 | Lean | false | false | 15,381 | hlean | /-
Copyright (c) 2015 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Floris van Doorn
Theorems about sums/coproducts/disjoint unions
-/
import .pi .equiv logic
open lift eq is_equiv equiv prod prod.ops is_trunc sigma bool
namespace sum
universe v... |
653d0ffe8326db03a1f953a7cb7cf6640fb1f84a | 38bf3fd2bb651ab70511408fcf70e2029e2ba310 | /src/analysis/calculus/times_cont_diff.lean | c445560bbd411b82d2411f6b391615579a0b77c1 | [
"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 | 37,009 | 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.calculus.deriv
/-!
# Higher differentiability
A function is `C^1` on a domain if it is differentiable there, and its derivative is continuous... |
5a8b93dd202ee9a4496a946bd788e32749a2b567 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/let_Issue.lean | acc0291c6eea3066d2151e76c39df41789aa5152 | [
"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 | 172 | lean | class C (α : Type)
instance : C (Fin (n+1)) := ⟨⟩
instance : C (Fin UInt64.size) :=
let _ : C (Fin UInt64.size) := inferInstanceAs (C (Fin (_+1)))
inferInstance
|
e5d529a6c06bc822c0776857719f06bec7a77bc0 | 367134ba5a65885e863bdc4507601606690974c1 | /src/algebra/homology/image_to_kernel_map.lean | ca1e8d68dd0fc822ccf6396caa7528a25726069b | [
"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 | 3,681 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.limits.shapes.images
import category_theory.limits.shapes.kernels
/-!
# The morphism from `image f` to `kernel g` when `f ≫ g = 0`
We define ... |
55ebbd4ce645fb3961e5827461b6a063699e39c5 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/closed/cartesian.lean | 3149a729a5f0cfee487c398b718a0471a2e982c7 | [] | 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 | 16,942 | lean | /-
Copyright (c) 2020 Bhavik Mehta, Edward Ayers, Thomas Read. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta, Edward Ayers, Thomas Read
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.category_theory.limits.shapes.finite_prod... |
0e6bb8bd53bec2554f613757d5226ecc25364d22 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /hott/init/nat.hlean | 92bc54632274c8ebcc1feae7d2e44146bbeaa603 | [
"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 | 9,797 | hlean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Leonardo de Moura
-/
prelude
import init.tactic init.num init.types init.path
open eq eq.ops decidable
open algebra sum
set_option class.force_new true
notati... |
1425e44bdb608739c7b206d9ae202c135904a433 | 618003631150032a5676f229d13a079ac875ff77 | /src/topology/algebra/group.lean | 404cd78e27c767ca038c97f3ca0d8990c6df9b1c | [
"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 | 17,319 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro, Patrick Massot
Theory of topological groups.
-/
import order.filter.pointwise
import group_theory.quotient_group
import topology.algebra.monoid
import... |
33f9c366d15fe003030a14213d7a858ab2e3541b | 78630e908e9624a892e24ebdd21260720d29cf55 | /src/logic_propositional/prop_19.lean | bad0eee36610c6c1928725c649166faa289b3801 | [
"CC0-1.0"
] | permissive | tomasz-lisowski/lean-logic-examples | 84e612466776be0a16c23a0439ff8ef6114ddbe1 | 2b2ccd467b49c3989bf6c92ec0358a8d6ee68c5d | refs/heads/master | 1,683,334,199,431 | 1,621,938,305,000 | 1,621,938,305,000 | 365,041,573 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 466 | lean | namespace prop_19
variables A B : Prop
theorem prop_19 : (¬ ¬ A ∧ ¬ ¬ (A → B)) → ¬ ¬ B :=
assume h1: ¬ ¬ A ∧ ¬ ¬ (A → B),
have h2: ¬ ¬ A, from and.left h1,
have h3: A, from (classical.by_contradiction
(assume h4: ¬ A,
h2 h4)),
have h5: ¬ ¬ (A → B), from and.right h1,
have h6: A → B, from (classical.by_contradict... |
f05c5eb6df613ebd12bd16f3d21a4d170d560d8f | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/run/mk_byte.lean | a938d59f1fb631d6fb5bab6124d75e5a0d5ea16e | [
"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,300 | lean | import data.vector namespace Ex
universe u
-- def vector (α : Type u) (n : ℕ) := { l : list α // l.length = n }
namespace vector
variables {α : Type u} {n : ℕ}
@[pattern] def cons : α → vector α n → vector α (nat.succ n)
| a ⟨ v, h ⟩ := ⟨ a::v, congr_arg nat.succ h ⟩
def to_list' (v : vector α n) : list α := v.1
def ... |
118859d791c8ec84edf974e711aebb31d6111da2 | e514e8b939af519a1d5e9b30a850769d058df4e9 | /src/lib/interactive.lean | d9e016370f25cef9149da04fce1a882e0d7a2d72 | [] | no_license | semorrison/lean-rewrite-search | dca317c5a52e170fb6ffc87c5ab767afb5e3e51a | e804b8f2753366b8957be839908230ee73f9e89f | refs/heads/master | 1,624,051,754,485 | 1,614,160,817,000 | 1,614,160,817,000 | 162,660,605 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 211 | lean | namespace interactive
open lean interactive.types
meta def opt_single_or_list {α : Type} (ps : parser α) : parser (list α) :=
list_of ps <|> ((λ h, list.cons h []) <$> ps) <|> return []
end interactive
|
d108926b2a3328f108f6eda3e0569baa20b3553d | e0f9ba56b7fedc16ef8697f6caeef5898b435143 | /src/order/filter/filter_product.lean | 6607cd788183c5b86e7846540e18c6feaa1aff99 | [
"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 | 22,479 | lean | /-
Copyright (c) 2019 Abhimanyu Pallavi Sudhir. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Abhimanyu Pallavi Sudhir
"Filterproducts" (ultraproducts on general filters), ultraproducts.
-/
import order.filter.basic
import algebra.pi_instances
universes u v
variables... |
d8116614d9e1dcaa3ca789cc77439d4ea54868b8 | ca1ad81c8733787aba30f7a8d63f418508e12812 | /clfrags/src/hilbert/wr/proofs/and_or.lean | 83f7ecd4048f5a50b2d9f697fd6aceeb7c532c62 | [] | no_license | greati/hilbert-classical-fragments | 5cdbe07851e979c8a03c621a5efd4d24bbfa333a | 18a21ac6b2e890060eb4ae65752fc0245394d226 | refs/heads/master | 1,591,973,117,184 | 1,573,822,710,000 | 1,573,822,710,000 | 194,334,439 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,034 | lean | import hilbert.wr.and_or
import hilbert.wr.proofs.or
namespace clfrags
namespace hilbert
namespace wr
namespace and_or
theorem c₁ {a b : Prop} (h₁ : a) (h₂ : b) : and a b :=
have h₃ : or (and a b) a, from or.d₁' h₁,
have h₄ : or (and a b)... |
5c946f432967a23f8d852b682782a1deb3968f62 | 130c49f47783503e462c16b2eff31933442be6ff | /src/Lean/Elab/Extra.lean | de9a7e2445a4ac885dd2c2e40f3b90b658ef2c5f | [
"Apache-2.0"
] | permissive | Hazel-Brown/lean4 | 8aa5860e282435ffc30dcdfccd34006c59d1d39c | 79e6732fc6bbf5af831b76f310f9c488d44e7a16 | refs/heads/master | 1,689,218,208,951 | 1,629,736,869,000 | 1,629,736,896,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,259 | 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.App
/-
Auxiliary elaboration functions: AKA custom elaborators
-/
namespace Lean.Elab.Term
open Meta
@[builtinTermElab binrel] def elabB... |
e11931095327afd2aedd8abb7f73df33b0d37af2 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/typeclass_diamond.lean | 99a184edcecdb5f936d5d21721c4613ddb03c052 | [
"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,782 | lean | class Top₁ (n : Nat) : Type := (u : Unit := ())
class Bot₁ (n : Nat) : Type := (u : Unit := ())
class Left₁ (n : Nat) : Type := (u : Unit := ())
class Right₁ (n : Nat) : Type := (u : Unit := ())
instance Bot₁Inst : Bot₁ Nat.zero := {}
instance Left₁ToBot₁ (n : Nat) [Left₁ n] : Bot₁ n := {}
instance Right₁ToBo... |
82f2d5691bec4162d90cf2c1d4ed5a619a3c096d | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/category_theory/adjunction/lifting.lean | f8fa2872d8234e8c2d5fd4f30ec4ca2af8b915c8 | [
"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,679 | 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.limits.shapes.equalizers
import category_theory.limits.shapes.reflexive
import category_theory.monad.adjunction
import category_theory.monad.coequa... |
3c9f96bfbce519e660d40e74a2511d14aec161f4 | 22e97a5d648fc451e25a06c668dc03ac7ed7bc25 | /src/group_theory/congruence.lean | 83f8098eea74f2dbfb34609e9a9c53a418c87456 | [
"Apache-2.0"
] | permissive | keeferrowan/mathlib | f2818da875dbc7780830d09bd4c526b0764a4e50 | aad2dfc40e8e6a7e258287a7c1580318e865817e | refs/heads/master | 1,661,736,426,952 | 1,590,438,032,000 | 1,590,438,032,000 | 266,892,663 | 0 | 0 | Apache-2.0 | 1,590,445,835,000 | 1,590,445,835,000 | null | UTF-8 | Lean | false | false | 42,244 | lean | /-
Copyright (c) 2019 Amelia Livingston. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Amelia Livingston
-/
import data.setoid
import algebra.pi_instances
/-!
# Congruence relations
This file defines congruence relations: equivalence relations that preserve a binary... |
0f02a30f565636d652c7509316112250a2f69de7 | c9e78e68dc955b2325401aec3a6d3240cd8b83f4 | /src/proof_state.lean | 0310c412c5532d061825a1626109e10799a62930 | [] | no_license | loganrjmurphy/lean-strategies | 4b8dd54771bb421c929a8bcb93a528ce6c1a70f1 | 832ea28077701b977b4fc59ed9a8ce6911654e59 | refs/heads/master | 1,682,732,168,860 | 1,621,444,295,000 | 1,621,444,295,000 | 278,458,841 | 3 | 0 | null | 1,613,755,728,000 | 1,594,324,763,000 | Lean | UTF-8 | Lean | false | false | 1,378 | lean | import justification tactic LTS
variable {α : Type}
meta structure PROOF_STATE (α : Type) :=
(init_goal : expr := default expr)
(input : property.input α := default (property.input α))
(input_string : string := string.empty)
(strat_expr : expr := default expr)
(solved : bool := ff)
(originals : list (string × expr) ... |
d6b90a10d750a016627bc282fb77f867837e523e | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/control/lift.lean | 5eb3b4cb72fbbfe50c68c8ed12a37beabba6a3bb | [] | 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 | 5,265 | lean | /-
Copyright (c) 2016 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner, Sebastian Ullrich
Classy functions for lifting monadic actions of different shapes.
This theory is roughly modeled after the Haskell 'layers' package https://hackage.ha... |
00321873671b027431511b71b3ff457573f818d6 | 86f6f4f8d827a196a32bfc646234b73328aeb306 | /examples/logic/unnamed_89.lean | db3c807456caf15a716610f25d857b5e8556c19b | [] | 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 | 325 | lean | import data.real.basic
-- BEGIN
lemma my_lemma : ∀ {x y ε : ℝ},
0 < ε → ε ≤ 1 → abs x < ε → abs y < ε → abs (x * y) < ε :=
sorry
section
variables a b δ : ℝ
variables (h₀ : 0 < δ) (h₁ : δ ≤ 1)
variables (ha : abs a < δ) (hb : abs b < δ)
#check my_lemma h₀ h₁ ha hb
end
-- END |
c4e2de48cb1dfff7a5c5f659d3d10bbd769e7402 | b19a1b7dc79c802247fdce4c04708e070863b4d2 | /lean.lean | 2dc08ceca3ab69a97ea11bffdd82b60f235daab4 | [] | no_license | utanapishtim/promethazine | 99a1e80311fb20251a54ba78a534b23852b88c40 | 08a6f9bd6dd08feb3df8d4697e19ffc8d333b249 | refs/heads/master | 1,653,595,504,487 | 1,480,129,933,000 | 1,480,129,933,000 | 74,801,596 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,758 | lean | import standard
open bool nat
constant m : nat
constant n : nat
constants b1 b2 : bool
check m
check n
check n + 0
check m * (n + 0)
check b1
check b1 && b2
check b1 || b2
check tt
open prod
constants m n : nat
constant f : nat → nat
constant f' : nat → nat
constant f'' : ℕ → ℕ
constant p : ℕ × ℕ
constant q ... |
198360780687eb2abecad7ee94cde5a787dd1802 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /library/init/data/string/basic.lean | ca7a140cfe71861fecf28514861ec8e9db86ed1e | [
"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 | 2,575 | 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
private structure string_imp :=
(data : list char)
def string := string_imp
def list.as_st... |
18a0d56798d3e0b03925805f11777c749d3cbb39 | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /tests/lean/run/structuralRec1.lean | 5ad2e8b87b35a1039f2c38e45cd026c4e228d559 | [
"Apache-2.0"
] | permissive | collares/lean4 | 861a9269c4592bce49b71059e232ff0bfe4594cc | 52a4f535d853a2c7c7eea5fee8a4fa04c682c1ee | refs/heads/master | 1,691,419,031,324 | 1,618,678,138,000 | 1,618,678,138,000 | 358,989,750 | 0 | 0 | Apache-2.0 | 1,618,696,333,000 | 1,618,696,333,000 | null | UTF-8 | Lean | false | false | 1,663 | lean | def map {α β} (f : α → β) : List α → List β
| [] => []
| a::as => f a :: map f as
theorem ex1 : map Nat.succ [1] = [2] :=
rfl
theorem ex2 : map Nat.succ [] = [] :=
rfl
theorem ex3 (a : Nat) : map Nat.succ [a] = [Nat.succ a] :=
rfl
theorem ex4 {α β} (f : α → β) (a : α) (as : List α) : map f (a::as) = (f a) :: map... |
5ff8754ee2563abfd227fbd332ed1d2b31d50b76 | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /hott/types/W.hlean | 8f2abbc0d2f62f621b43a7ccdc08bd3e1e74eb2b | [
"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 | 5,328 | hlean | /-
Copyright (c) 2014 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: types.W
Author: Floris van Doorn
Theorems about W-types (well-founded trees)
-/
import .sigma .pi
open eq sigma sigma.ops equiv is_equiv
-- TODO fix universe levels
exit
inductiv... |
41efa21a07e50ea96d59d4e7d0eaa017fa8bc4e0 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/data/pnat/factors.lean | f5408d3e8be128bd78f7d7ea0a0e343b6488d279 | [
"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 | 14,012 | lean | /-
Copyright (c) 2019 Neil Strickland. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Neil Strickland
-/
import tactic.basic
import data.pnat.basic data.nat.prime data.multiset data.int.basic data.int.gcd
algebra.group algebra.group_power algebra.ordered_ring
/-- The... |
f68e29653fe029d990b422d19e46d1224a61caeb | 32025d5c2d6e33ad3b6dd8a3c91e1e838066a7f7 | /stage0/src/Lean/KeyedDeclsAttribute.lean | e8aaaa36859466032edf11c5bc60cc61de1cf784 | [
"Apache-2.0"
] | permissive | walterhu1015/lean4 | b2c71b688975177402758924eaa513475ed6ce72 | 2214d81e84646a905d0b20b032c89caf89c737ad | refs/heads/master | 1,671,342,096,906 | 1,599,695,985,000 | 1,599,695,985,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,082 | 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, Sebastian Ullrich
-/
import Lean.Attributes
import Lean.Compiler.InitAttr
import Lean.ToExpr
/-!
A builder for attributes that are applied to declarations of... |
509a7f16ea6e0e89a5990b09a123733f50ffc64d | bb31430994044506fa42fd667e2d556327e18dfe | /src/data/finset/image.lean | 601b3bbd93e24c774a9dbf5e9a2a9703a222cb4e | [
"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 | 26,689 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Jeremy Avigad, Minchao Wu, Mario Carneiro
-/
import algebra.hom.embedding
import data.fin.basic
import data.finset.basic
import data.int.order.basic
/-! # Im... |
3c5faaae2b3bd0f226a5e5466a2598b26e05b74e | abd85493667895c57a7507870867b28124b3998f | /src/deprecated/subgroup.lean | 2b332d0dba2c34380e6fb4e0093c7dbb4c062d3b | [
"Apache-2.0"
] | permissive | pechersky/mathlib | d56eef16bddb0bfc8bc552b05b7270aff5944393 | f1df14c2214ee114c9738e733efd5de174deb95d | refs/heads/master | 1,666,714,392,571 | 1,591,747,567,000 | 1,591,747,567,000 | 270,557,274 | 0 | 0 | Apache-2.0 | 1,591,597,975,000 | 1,591,597,974,000 | null | UTF-8 | Lean | false | false | 28,432 | 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, Mitchell Rowett, Scott Morrison, Johan Commelin, Mario Carneiro,
Michael Howes
-/
import group_theory.subgroup
import deprecated.submonoid
open set function
variable... |
291102860273624e9756545825bb9d21a4126b9f | d7189ea2ef694124821b033e533f18905b5e87ef | /galois/network/network_local_abs.lean | 42bd4c43977b7677cc8fc30442dace4a2f065a80 | [
"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 | 3,589 | lean | /-
For a given agent, we define a labeled transition system
where everything else occuring on the network may be completely arbitrary
-/
import .action
galois.option
galois.network.network_implementation
galois.temporal.LTS
namespace network
namespace loc
def next_agent_state_from_dlabel {A} {a_n... |
e600960efe05327e42d4875a84705881222c515c | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/data/list/prod_monoid.lean | 6e5da7765b1bb042ba6bac00d106b885421e2bce | [
"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 | 1,000 | lean | /-
Copyright (c) 2021 Alex J. Best. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Alex J. Best
-/
import data.list.big_operators
/-!
# Products / sums of lists of terms of a monoid
This file provides basic results about `list.prod` (definition in `data.list.defs`) i... |
cb8673012986d44259042aa4bdf7bc662e005927 | acc85b4be2c618b11fc7cb3005521ae6858a8d07 | /algebra/big_operators.lean | dc902b41eb90db6473253a3862c3ce18fb010d44 | [
"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 | 14,069 | 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
Some big operators for lists and finite sets.
-/
import data.list data.list.perm data.set.finite data.finset
algebra.group algebra.ordered_monoid algebra.group_power
... |
cdf5f1a364cda38ea90cf97d4540e52f23bf8008 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/algebra/category/Module/abelian.lean | 08c4c849521bb22172acb816d3f4e7dcfb24db72 | [
"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 | 3,287 | lean | /-
Copyright (c) 2020 Markus Himmel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel
-/
import linear_algebra.isomorphisms
import algebra.category.Module.kernels
import algebra.category.Module.limits
import category_theory.abelian.exact
/-!
# The category... |
fd0116c03b53f4457a9c4effb7e6fc88624a715f | 33340b3a23ca62ef3c8a7f6a2d4e14c07c6d3354 | /lia/qfree.lean | 8b5b975193d80f0d4216ff02dcd14fe561773b98 | [] | no_license | lclem/cooper | 79554e72ced343c64fed24b2d892d24bf9447dfe | 812afc6b158821f2e7dac9c91d3b6123c7a19faf | refs/heads/master | 1,607,554,257,488 | 1,578,694,133,000 | 1,578,694,133,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,237 | lean | import .formula
def qfree : formula → Prop
| formula.true := true
| formula.false := true
| (formula.atom _) := true
| (formula.not p) := qfree p
| (formula.or p q) := qfree p /\ qfree q
| (formula.and p q) := qfree p /\ qfree q
| (formula.ex p) := false
def nqfree : formula → Prop
| ⊤' := true
| ⊥' := true
| A' a :... |
584303ae138d7f5600532aebf0b1dfcb2894d7b1 | 367134ba5a65885e863bdc4507601606690974c1 | /src/analysis/special_functions/pow.lean | 8fa8e0c17d898f48a3d6ce6f6d1a3c09c12cfb40 | [
"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 | 70,142 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Abhimanyu Pallavi Sudhir, Jean Lo, Calle Sönne, Sébastien Gouëzel,
Rémy Degenne
-/
import analysis.special_functions.trigonometric
import analysis.calculus.extend_deriv
... |
daf917a707290981c888085b2a8406654cf55a87 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/category_theory/functor.lean | a5f5e8881fcf2e77ab0f2ff8fdbf1239d196bd43 | [
"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 | 3,488 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Tim Baumann, Stephen Morgan, Scott Morrison
-/
import tactic.reassoc_axiom
import tactic.monotonicity
/-!
# Functors
Defines a functor between categories, extending a `prefunctor` be... |
1993884da65417353b7ec09a9013e3d19ff75bd5 | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /test/library_search/ordered_ring.lean | 24a024e54bbd7d4ff7e2de0f721c9b4cc3b10125 | [
"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 | 414 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import data.nat.basic
/- Turn off trace messages so they don't pollute the test build: -/
set_option trace.silence_library_search true
example {a b : ℕ} (h : b > 0)... |
d2eff97033443c4359cdc9a40321a57afcd65cd4 | 492a7e27d49633a89f7ce6e1e28f676b062fcbc9 | /src/monoidal_categories_reboot/module_object.lean | f53a8c4a36b93d7027f3a3b26fa36298f5fa4150 | [
"Apache-2.0"
] | permissive | semorrison/monoidal-categories-reboot | 9edba30277de48a234b63813cf85b171772ce36f | 48b5f1d535daba4e591672042a298ac36be2e6dd | refs/heads/master | 1,642,472,396,149 | 1,560,587,477,000 | 1,560,587,477,000 | 156,465,626 | 0 | 1 | null | 1,541,549,278,000 | 1,541,549,278,000 | null | UTF-8 | Lean | false | false | 1,813 | lean | -- Copyright (c) 2019 Scott Morrison. All rights reserved.
import .monoidal_functor_attributes
universes v u
namespace category_theory
open monoidal_category
variables (C : Sort u) [𝒞 : monoidal_category.{v} C]
include 𝒞
structure Monoid :=
(A : C)
(unit : tensor_unit C ⟶ A)
(product : A ⊗ A ⟶ A)
(pen... |
ed5d29c0130275266f816bd6a2c381e7e2b34500 | 7cef822f3b952965621309e88eadf618da0c8ae9 | /test/delta_instance.lean | e030ebae7fe646b2b31d6f42b5ac43ff63ecf99e | [
"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 | 559 | lean | /-
Copyright (c) 2019 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
-/
import data.set
@[derive has_coe_to_sort] def X : Type := set ℕ
@[derive ring] def T := ℤ
class binclass (T1 T2 : Type)
instance : binclass ℤ ℤ := ⟨_, _⟩
@[der... |
32c8a08fa4ee6f427907e9bd3e866db78290658c | cf39355caa609c0f33405126beee2739aa3cb77e | /library/tools/debugger/cli.lean | b5470ba10d2ea88e43707301164d2a0fc6b4bf79 | [
"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 | 8,233 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
Simple command line interface for debugging Lean programs and tactics.
-/
import tools.debugger.util
namespace debugger
@[derive decidable_eq]
inductive mod... |
ca0ef0347ae025c9e84b2dd71a105b1c703acf5e | 28be2ab6091504b6ba250b367205fb94d50ab284 | /src/game/world1/level3.lean | d76297b83e8c9690849cb562a744beeb408c294e | [
"Apache-2.0"
] | permissive | postmasters/natural_number_game | 87304ac22e5e1c5ac2382d6e523d6914dd67a92d | 38a7adcdfdb18c49c87b37831736c8f15300d821 | refs/heads/master | 1,649,856,819,031 | 1,586,444,676,000 | 1,586,444,676,000 | 255,006,061 | 0 | 0 | Apache-2.0 | 1,586,664,599,000 | 1,586,664,598,000 | null | UTF-8 | Lean | false | false | 4,100 | lean | /-
We just restarted Lean behind the scenes,
so let's re-import the natural numbers, but this time without
addition and multiplication.
-/
import mynat.definition -- import Peano's definition of the natural numbers {0,1,2,3,4,...}
namespace mynat -- hide
/-
# Tutorial world
## Level 3: Peano's axioms.
The import a... |
a938c05948d3e0cc217e78dea720270a73179c97 | 64874bd1010548c7f5a6e3e8902efa63baaff785 | /library/data/set.lean | e76c9f4260539b2cecffc12a73b5c9d42358339c | [
"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 | 3,113 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: data.set
Author: Jeremy Avigad, Leonardo de Moura
-/
import data.bool
open eq.ops bool
namespace set
definition set (T : Type) :=
T → bool
definition mem [reducible] {T : Type} (x : T... |
f1400e65c42f38a5924aec849c6854f592bb9ae5 | 28b6e1a13d35e9b450f65c001660f4ec4713aa10 | /Search/SaveRestore.lean | 92d23f5c1401dab08dcbced94a04b749e06032e1 | [
"Apache-2.0"
] | permissive | dselsam/search | 14e3af3261a7a70f8e5885db9722b186f96fe1f5 | 67003b859d2228d291a3873af6279c1f61430c64 | refs/heads/master | 1,684,700,794,306 | 1,614,294,810,000 | 1,614,294,810,000 | 339,578,823 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 426 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Daniel Selsam
-/
namespace Search
class SaveRestore (m : Type → Type) (σ : outParam Type) where
save : m σ
restore : σ → m Unit
instance {σ : Type} : SaveRestore (State... |
9652a573318979ed71db108ec697d300c97f046b | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/linear_algebra/projection.lean | e47bb9fd3ffb68b445afb073121f8657b1b62e6e | [
"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 | 16,926 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import linear_algebra.quotient
import linear_algebra.prod
/-!
# Projection to a subspace
In this file we define
* `linear_proj_of_is_compl (p q : submodule R E) (... |
6a388cfbf55aaf04f8f4adbcfe8b01ed579242be | c09f5945267fd905e23a77be83d9a78580e04a4a | /src/ring_theory/ideal_operations.lean | 21fcd2a321805f94729a53c8f18a4bdf88f4b78b | [
"Apache-2.0"
] | permissive | OHIHIYA20/mathlib | 023a6df35355b5b6eb931c404f7dd7535dccfa89 | 1ec0a1f49db97d45e8666a3bf33217ff79ca1d87 | refs/heads/master | 1,587,964,529,965 | 1,551,819,319,000 | 1,551,819,319,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 24,293 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
More operations on modules and ideals.
-/
import ring_theory.ideals data.nat.choose order.zorn
import linear_algebra.tensor_product
import data.equiv.algebra
universes u v w x
... |
28ee3e4112952a3fea8a76851e79fb0854fdf332 | 1abd1ed12aa68b375cdef28959f39531c6e95b84 | /src/group_theory/perm/support.lean | 173dd58756a302193d65b31096f7bb40b79f1641 | [
"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 | 20,235 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Aaron Anderson, Yakov Pechersky
-/
import data.finset.sort
import data.fintype.basic
import group_theory.perm.basic
/-!
# Support of a permutation
## Main definitions
In... |
b2882643ce6ce6957063637ee9612130dd850330 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/algebra/hom/group_action.lean | cd9109774eeb2ae691ffc448fd62cd96cb56675f | [
"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 | 14,286 | 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.group_ring_action
import group_theory.group_action.defs
/-!
# Equivariant homomorphisms
## Main definitions
* `mul_action_hom M X Y`, the type of equivariant ... |
8f028cf818035bd9e0538c7c29ccf2a190bb98fd | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/tactic/local_cache.lean | d71b05bd68a7401de84a2e9416e74e0b7aeed1dd | [
"Apache-2.0"
] | permissive | fpvandoorn/mathlib | b21ab4068db079cbb8590b58fda9cc4bc1f35df4 | b3433a51ea8bc07c4159c1073838fc0ee9b8f227 | refs/heads/master | 1,624,791,089,608 | 1,556,715,231,000 | 1,556,715,231,000 | 165,722,980 | 5 | 0 | Apache-2.0 | 1,552,657,455,000 | 1,547,494,646,000 | Lean | UTF-8 | Lean | false | false | 7,198 | lean | import tactic.basic tactic.norm_num
namespace tactic
namespace local_cache
namespace internal
variables {α : Type} [reflected α] [has_reflect α]
meta def mk_full_namespace (ns : name) : name := `local_cache ++ ns
meta def save_data (dn : name) (a : α) [reflected a] : tactic unit :=
tactic.add_decl $ mk_definition ... |
d4173053b8f43149dc8191e186be32a865526074 | a88f0086fb3e2025ebb21e0ba2f2725774c6979f | /src/category_theory/yoneda.lean | bac89288c5bdec73523f6ba3e2456a6d4756ad1c | [
"Apache-2.0"
] | permissive | Kha/stdlib | b5a4456c35def0ca8f1bf2d32dbeebd7639cbc4d | e44b105c72ec77120f43a7a7dd1cd49867a65a41 | refs/heads/master | 1,609,528,111,500 | 1,572,963,395,000 | 1,572,963,395,000 | 98,516,307 | 0 | 1 | null | 1,501,146,352,000 | 1,501,146,352,000 | null | UTF-8 | Lean | false | false | 7,557 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.opposites
import category_theory.hom_functor
/-!
# The Yoneda embedding
The Yoneda embedding as a functor `yoneda : C ⥤ (Cᵒᵖ ⥤ Type v₁)`,
alo... |
f0e3dc425b347ca02e600430fa1abe1d3f7a60ec | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/nat/lattice.lean | 61ff4e7e97e7e97aad910e5f6ff923815c4a7973 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 6,957 | 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, Floris van Doorn, Gabriel Ebner, Yury Kudryashov
-/
import data.nat.interval
import order.conditionally_complete_lattice.finset
/-!
# Conditionally complete linear ord... |
f4de9f4aa5625939ce0ef9cf908fb76aa2953761 | eec7ba3e04c766a73912b8744756ce40b134e8d1 | /src/week05.lean | e1d95cbf3e9e5007c43c4e794a7017e49299120d | [] | no_license | UVM-M52/week-5-hdthomas | 9930ed32c5aa26c0ccc313db3854af515ef57259 | 20168571b296e78999cf16e89e291700b17b90a5 | refs/heads/master | 1,609,647,286,856 | 1,581,477,956,000 | 1,581,477,956,000 | 239,918,364 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,681 | lean | -- Math 52: Week 5
import .utils
open classical
-- The following lemmas may be useful for the next proof.
-- mul_lt_mul_of_pos_left (a b c : ℝ) : a < b → 0 < c → c * a < c * b
-- mul_lt_mul_of_pos_right (a b c : ℝ) : a < b → 0 < c → a * c < b * c
-- Lakins 2.1.2: For all real numbers a and b, if 0 < a < b, then a² <... |
3a703dcb5b78661d2132d82888976921c82df7f2 | 4bcaca5dc83d49803f72b7b5920b75b6e7d9de2d | /stage0/src/Lean/Meta/Tactic/Split.lean | f76f5b7e81abb7ea421d8d834edc8424b3d5a6e5 | [
"Apache-2.0"
] | permissive | subfish-zhou/leanprover-zh_CN.github.io | 30b9fba9bd790720bd95764e61ae796697d2f603 | 8b2985d4a3d458ceda9361ac454c28168d920d3f | refs/heads/master | 1,689,709,967,820 | 1,632,503,056,000 | 1,632,503,056,000 | 409,962,097 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,043 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Meta.Match.MatchEqs
import Lean.Meta.Tactic.Generalize
namespace Lean.Meta
namespace Split
private def getSimpMatchContext : MetaM Simp.Contex... |
cb04e9f2fe5127b70da3d4360fe274c5bb0b530f | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /src/Lean/Data/Json/Parser.lean | a243aaa8bb30bcf4070f468294cc69e91ec1c765 | [
"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 | 7,408 | lean | /-
Copyright (c) 2019 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner, Marc Huisinga
-/
import Lean.Data.Json.Basic
namespace Lean
open Std (RBNode RBNode.singleton RBNode.leaf)
inductive Quickparse.Result (α : Type) where
| success (p... |
4261710681214930080460eb4146090da7ec1035 | ea5678cc400c34ff95b661fa26d15024e27ea8cd | /sum_function.lean | 8039d73c40b8f6e5065967fd62fca575f5d82d77 | [] | 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 | 96 | lean | open int
example : 2 + 3 = 5:=begin generalize h:3=x,generalize g:2=y,rw ← h,rw ← g,← end
|
fe818696178157d63c4ae48df717ce687425aead | 968e2f50b755d3048175f176376eff7139e9df70 | /examples/prop_logic_theory/unnamed_2153.lean | 3e32fbfcc8022e24a85b24d3a63fbb505884f129 | [] | 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 | 280 | lean | variable p : Prop
-- BEGIN
theorem not_not_of_self : p → ¬¬p :=
begin
intros h₁ h₂, -- Assume `h₁ : p`. Assume `h₂ : ¬p`. It suffices to prove `false`.
show false, from h₂ h₁, -- We show `false` by false introduction on `h₂` and `h₁`.
end
-- END |
d06150b8998e6d26d2c1161a2d680f06ee41427b | bb31430994044506fa42fd667e2d556327e18dfe | /src/data/fintype/card.lean | 5f8f084613e0edf7e652b2d954d48c889a188fd8 | [
"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 | 41,649 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.fintype.basic
import data.finset.card
import data.list.nodup_equiv_fin
import tactic.positivity
import tactic.wlog
/-!
# Cardinalities of finite types
#... |
93e49af0ec2c4ecc99a788fe2cb2bfbc5a7452b8 | 0c1546a496eccfb56620165cad015f88d56190c5 | /library/init/data/to_string.lean | dac98ebbb49ef6e2d2e6dd5eddba4d16915cb93b | [
"Apache-2.0"
] | permissive | Solertis/lean | 491e0939957486f664498fbfb02546e042699958 | 84188c5aa1673fdf37a082b2de8562dddf53df3f | refs/heads/master | 1,610,174,257,606 | 1,486,263,620,000 | 1,486,263,620,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,593 | 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.string.basic init.data.bool.basic init.data.subtype.basic
import init.data.unsigned init.data.prod init.data.sum.basic init.data.nat... |
d8dbbba68405dca0efbdb5ed8330a14019e6eb23 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/newCatPanic.lean | c15e860ceac7509c34df0a27e7a887c54fa3d98b | [
"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 | 19 | lean | declare_syntax_cat
|
e10126ddc6e0c1818bc74f5b9c4af970a3ba6536 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Data/Lsp/Extra.lean | 0a1478477cfdee9cc7c4a154baaeb6881236e60e | [
"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 | 5,377 | lean | /-
Copyright (c) 2020 Marc Huisinga. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Marc Huisinga, Wojciech Nawrocki
-/
import Lean.Data.Lsp.Basic
import Lean.Server.Rpc.Basic
/-! This file contains Lean-specific extensions to LSP. See the structures below for which
... |
bdb23d9d8b232f11d8691ecf6ace2d292ac4bb43 | 290f65d8de0088e3098f612884d54e5b714d7862 | /src/abstract_V_and_I.lean | f505e81a7dc9d52770de514999b7033ee11ea4ba | [
"Apache-2.0"
] | permissive | auhlmann/M4P33 | ec775fd53610427b35f59ef84d469c30511de24e | dc2586aa3a8e0d916fc0795df592a996c89c85bb | refs/heads/master | 1,607,862,664,432 | 1,579,796,968,000 | 1,579,796,968,000 | 234,415,945 | 0 | 0 | Apache-2.0 | 1,579,210,321,000 | 1,579,210,320,000 | null | UTF-8 | Lean | false | false | 9,935 | lean | /-
Algebraic geometry M4P33, Jan-Mar 2020, formalised in Lean.
Copyright (c) 2020 Kevin Buzzard
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Buzzard, Alexander Uhlmann, and whoever else in the class
wants to join in.
Thoughts about how much of the 𝕍 and 𝕀 theory
goes through ab... |
5472bdc2f62a731e32e5b3e2421577ac284861ec | 2cf781335f4a6706b7452ab07ce323201e2e101f | /lean/deps/galois_stdlib/src/galois/data/list/nth_le.lean | 8dc67994ab7c3f8f233f9f9586494cda4cc346f2 | [
"Apache-2.0"
] | permissive | simonjwinwood/reopt-vcg | 697cdd5e68366b5aa3298845eebc34fc97ccfbe2 | 6aca24e759bff4f2230bb58270bac6746c13665e | refs/heads/master | 1,586,353,878,347 | 1,549,667,148,000 | 1,549,667,148,000 | 159,409,828 | 0 | 0 | null | 1,543,358,444,000 | 1,543,358,444,000 | null | UTF-8 | Lean | false | false | 4,598 | lean | -- Lemmas primarily about nth_le
import data.list.basic -- from mathlib
import galois.data.nat.basic
namespace list
/-- Simplify a singleton list -/
theorem nth_le_singleton {α: Type _} (x : α) (i : ℕ) (p : i < 1)
: list.nth_le [x] i p = x :=
begin
cases i,
case nat.zero {
simp [list.nth_le],
},
case nat.... |
94bf14e3be204fab42bcdac9804fbec5e6379551 | 08bd4ba4ca87dba1f09d2c96a26f5d65da81f4b4 | /src/Lean/Data/Json/FromToJson.lean | 6c995fed864625933a6909fdf14050df153f548d | [
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"Apache-2.0",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | gebner/lean4 | d51c4922640a52a6f7426536ea669ef18a1d9af5 | 8cd9ce06843c9d42d6d6dc43d3e81e3b49dfc20f | refs/heads/master | 1,685,732,780,391 | 1,672,962,627,000 | 1,673,459,398,000 | 373,307,283 | 0 | 0 | Apache-2.0 | 1,691,316,730,000 | 1,622,669,271,000 | Lean | UTF-8 | Lean | false | false | 6,219 | lean | /-
Copyright (c) 2019 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner, Marc Huisinga
-/
import Lean.Data.Json.Basic
import Lean.Data.Json.Printer
namespace Lean
universe u
class FromJson (α : Type u) where
fromJson? : Json → Except Str... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.