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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
d9648ddac8fa3eb0753942b6ef293f50691cc53c | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/playground/opts.lean | 0c449a9f3dea14a332a4769313ff4be0a2177b23 | [
"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 | 911 | lean | import init.lean.options
open Lean
@[init] def initRegopt1 : IO Unit :=
registerOption `myNatOpt {defValue := DataValue.ofNat 0, descr := "my Nat option" }
@[init] def initRegopt2 : IO Unit :=
registerOption `myBoolOpt {defValue := DataValue.ofBool true, descr := "my Bool option" }
@[init] def initRegopt3 : IO Unit... |
09cae4951fcce4626b95da46cfc9e0f1b5d5e5a9 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebra/algebra/subalgebra/basic.lean | 39a8100e375747d3d8918697aeeda2254dba7f6a | [
"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 | 44,505 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Yury Kudryashov
-/
import algebra.algebra.basic
import data.set.Union_lift
/-!
# Subalgebras over Commutative Semiring
In this file we define `subalgebra`s and the usual operat... |
54fc51cbb420e123d1b48188fca3f6a730fa2293 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/run/meta_level1.lean | fd5bd761f27145b3cfc0f8504ae4866daf65703a | [
"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 | 973 | lean | import system.io
open io
variable [io.interface]
#eval do pp (level.max (level.succ level.zero) (level.param `foo)), put_str "\n"
#eval level.normalize (level.succ (level.max (level.max level.zero (level.succ level.zero)) (level.param `lβ)))
#eval level.imax (level.mvar `m) (level.of_nat 10)
#eval if level.zero = le... |
134619c4130461ca21bb12a795173fef6786dd6b | 6094e25ea0b7699e642463b48e51b2ead6ddc23f | /tests/lean/run/cases_bug.lean | 98ab7452a9240d451051bfce4d7e14274d57d289 | [
"Apache-2.0"
] | permissive | gbaz/lean | a7835c4e3006fbbb079e8f8ffe18aacc45adebfb | a501c308be3acaa50a2c0610ce2e0d71becf8032 | refs/heads/master | 1,611,198,791,433 | 1,451,339,111,000 | 1,451,339,111,000 | 48,713,797 | 0 | 0 | null | 1,451,338,939,000 | 1,451,338,939,000 | null | UTF-8 | Lean | false | false | 137 | lean | import logic.cast
theorem cast_heq : β {A B : Type} (H : A = B) (a : A), cast H a == a
| A A (eq.refl A) a := heq.of_eq (cast_refl a)
|
5d0412313e75b5a61b6d371a2ad2eb684962ecb4 | 50b3917f95cf9fe84639812ea0461b38f8f0dbe1 | /canonical_isomorphism/reid_barton.lean | f0c5ce81635a4a256887fdcdf321f8bb33aec95c | [] | no_license | roro47/xena | 6389bcd7dcf395656a2c85cfc90a4366e9b825bb | 237910190de38d6ff43694ffe3a9b68f79363e6c | refs/heads/master | 1,598,570,061,948 | 1,570,052,567,000 | 1,570,052,567,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,578 | lean | import data.equiv
import analysis.topology.topological_space
universes u v w
class transportable (f : Type u β Type v) :=
(on_equiv : Ξ {Ξ± Ξ² : Type u} (e : equiv Ξ± Ξ²), equiv (f Ξ±) (f Ξ²))
(on_refl : Ξ (Ξ± : Type u), on_equiv (equiv.refl Ξ±) = equiv.refl (f Ξ±))
(on_trans : Ξ {Ξ± Ξ² Ξ³ : Type u} (d : equiv Ξ± Ξ²) (e : equiv Ξ²... |
780b9f329cc7c8be5b2bb9a6f6030cf8e9b01c66 | 6b45072eb2b3db3ecaace2a7a0241ce81f815787 | /data/list/set.lean | 5170b6f215cec800725a1ebb3d9c46818e1a468b | [] | no_license | avigad/library_dev | 27b47257382667b5eb7e6476c4f5b0d685dd3ddc | 9d8ac7c7798ca550874e90fed585caad030bbfac | refs/heads/master | 1,610,452,468,791 | 1,500,712,839,000 | 1,500,713,478,000 | 69,311,142 | 1 | 0 | null | 1,474,942,903,000 | 1,474,942,902,000 | null | UTF-8 | Lean | false | false | 31,495 | 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, Jeremy Avigad
Set-like operations on lists.
-/
import data.list.basic data.list.comb .basic .comb
open nat function decidable
universe variables uu vv
variable... |
2052f711e1c8d025ffcf5a001cf3f3db2eb89cfb | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/data/int/basic.lean | 1d85d71b9bb49da4837477394518eb75ef62583f | [
"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 | 53,748 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
The integers, with addition, multiplication, and subtraction.
-/
import data.nat.basic
import algebra.order_functions
open nat
namespace int
instance : inhabited β€ := ... |
143c897ce9c8a4096f8675be7cf6c119bdc92ff0 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/1236.lean | 3d6001f94bc93a083af84b8b239583db2477db70 | [
"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 | 38 | lean | example: x β€ x * 2 := by simp_arith
|
9e8c5b1ef51b835abd734139124fc70d6d8d067c | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/category_theory/subobject/lattice.lean | 126de21d00991b6bdd980ce55eaac0001d025f40 | [
"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 | 23,988 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta, Scott Morrison
-/
import category_theory.subobject.factor_thru
import category_theory.subobject.well_powered
/-!
# The lattice of subobjects
We provide the `semilattice... |
8bd2a9e048149ce7977a257195b03d5a599b1a74 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/algebra/group_power/lemmas.lean | fe2b21f7fbd85f9891fd2686803003c637dcbd40 | [
"Apache-2.0"
] | permissive | stjordanis/mathlib | 51e286d19140e3788ef2c470bc7b953e4991f0c9 | 2568d41bca08f5d6bf39d915434c8447e21f42ee | refs/heads/master | 1,631,748,053,501 | 1,627,938,886,000 | 1,627,938,886,000 | 228,728,358 | 0 | 0 | Apache-2.0 | 1,576,630,588,000 | 1,576,630,587,000 | null | UTF-8 | Lean | false | false | 33,109 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Robert Y. Lewis
-/
import algebra.group_power.basic
import algebra.invertible
import algebra.opposites
import data.list.basic
import data.int.cast
import data.equiv.basic... |
b1e2c515e80b2b3dfffc73311ca8754b2562d400 | 618003631150032a5676f229d13a079ac875ff77 | /src/data/pequiv.lean | c55c856a1958da599d139298c10a7484fc0bae4e | [
"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 | 11,179 | lean | /-
Copyright (c) 2019 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import data.set.lattice
universes u v w x
/-- A `pequiv` is a partial equivalence, a representation of a bijection between a subset
of `Ξ±` and a subset of `Ξ²` -/
stru... |
63aeff132dba56536088ce6147b28e9e0053dbbb | a047a4718edfa935d17231e9e6ecec8c7b701e05 | /src/algebra/pi_instances.lean | 9730afaef7073655d93188b87d83f7c477316864 | [
"Apache-2.0"
] | permissive | utensil-contrib/mathlib | bae0c9fafe5e2bdb516efc89d6f8c1502ecc9767 | b91909e77e219098a2f8cc031f89d595fe274bd2 | refs/heads/master | 1,668,048,976,965 | 1,592,442,701,000 | 1,592,442,701,000 | 273,197,855 | 0 | 0 | null | 1,592,472,812,000 | 1,592,472,811,000 | null | UTF-8 | Lean | false | false | 18,424 | 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 algebra.module
import ring_theory.subring
import ring_theory.prod
open_locale big_operators
/-!
# Pi instances for algebraic structures
-/
namespa... |
2d1250929def5d63ebfbc80e009bc34a993b4dfa | 8b9cc39aef95580045a98cd3aac5961a7611e7b8 | /src/__old_polytope.lean | 56fa0826ab5320cbd5b5e051626f877ae94e40b3 | [] | no_license | vihdzp/polytope | de2202d393ca744cd879f3a316784dc67607af8f | c2c6ed3ace5fa6af0fac0c923bdf44a2d8c76a49 | refs/heads/master | 1,688,255,728,556 | 1,627,359,324,000 | 1,627,359,324,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,137 | lean | import order.bounded_lattice set_theory.cardinal data.subtype
open_locale cardinal
universe u
section
parameters {Ξ± : Type u} [partial_order Ξ±]
-- A chain is a subset of faces where every pair of elements is related.
def is_chain (faces chain : set Ξ±) : Prop :=
chain β faces β§ β faceβ faceβ β chain, faceβ β€ faceβ β¨ ... |
44457e051b4ad18cc3779c12e06b44ec24e43316 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/order/semiconj_Sup.lean | a9dc15f5e92d609f5458c3b09a43b3d5786e1040 | [
"Apache-2.0"
] | permissive | dupuisf/mathlib | 62de4ec6544bf3b79086afd27b6529acfaf2c1bb | 8582b06b0a5d06c33ee07d0bdf7c646cae22cf36 | refs/heads/master | 1,669,494,854,016 | 1,595,692,409,000 | 1,595,692,409,000 | 272,046,630 | 0 | 0 | Apache-2.0 | 1,592,066,143,000 | 1,592,066,142,000 | null | UTF-8 | Lean | false | false | 5,657 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Yury G. Kudryashov
-/
import order.conditionally_complete_lattice
import logic.function.conjugate
import order.ord_continuous
import data.equiv.mul_add
/-!
# Semiconjugate by `Sup`... |
70f9317bcd2f12feda19570f1e86ad6f5452bfb9 | 34c1747a946aa0941114ffca77a3b7c1e4cfb686 | /src/sheaves/presheaf_extension.lean | 57f6c1c989903ab12fac43f760e4df19e9f50194 | [] | no_license | martrik/lean-scheme | 2b9edd63550c4579a451f793ab289af9fc79a16d | 033dc47192ba4c61e4e771701f5e29f8007e6332 | refs/heads/master | 1,588,866,287,405 | 1,554,922,682,000 | 1,554,922,682,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,574 | lean | /-
Presheaf (of types) extension.
https://stacks.math.columbia.edu/tag/009N
-/
import topology.opens
import sheaves.presheaf
import sheaves.presheaf_of_rings_on_basis
import sheaves.stalk_on_basis
universe u
open topological_space
section presheaf_extension
variables {Ξ± : Type u} [T : topological_space Ξ±]
v... |
e8544786f507939f747a68546cd025a5bfc489d4 | 3dd1b66af77106badae6edb1c4dea91a146ead30 | /tests/lean/run/ind6.lean | 611dfc7cbeee928fa6d1ef75afcddb31d387ac63 | [
"Apache-2.0"
] | permissive | silky/lean | 79c20c15c93feef47bb659a2cc139b26f3614642 | df8b88dca2f8da1a422cb618cd476ef5be730546 | refs/heads/master | 1,610,737,587,697 | 1,406,574,534,000 | 1,406,574,534,000 | 22,362,176 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 301 | lean | inductive tree.{u} (A : Type.{u}) : Type.{max u 1} :=
| node : A β forest.{u} A β tree.{u} A
with forest.{u} (A : Type.{u}) : Type.{max u 1} :=
| nil : forest.{u} A
| cons : tree.{u} A β forest.{u} A β forest.{u} A
check tree.{1}
check forest.{1}
check tree_rec.{1 1}
check forest_rec.{1 1}
|
0f4e2c3eb5dbd4aa06727a603cbfbaab47c296da | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/bugNatLitDiscrTree.lean | 05741f8a7fad4d46b2a52f84cecbec966035d080 | [
"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 | 793 | lean | def f' (n : Nat) : Option { r : Nat // r β€ n } :=
match n with
| 0 => some β¨0, Nat.le_refl _β©
| n+1 => match f' n with
| some β¨m, hββ© =>
have : m < n+1 := Nat.lt_of_le_of_lt hβ (Nat.lt_succ_self _)
match f' m with
| some β¨r, hββ© => some β¨r, Nat.le_trans hβ (Nat.le_trans hβ (Nat.le_succ _))... |
0e4f6892c0c722fd0bf3804f33e363be41a5cd46 | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /stage0/src/Lean/PrettyPrinter.lean | 472f010027c0fe5417c1ae284990ec76667d519f | [
"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 | 3,373 | lean | /-
Copyright (c) 2020 Sebastian Ullrich. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
-/
import Lean.PrettyPrinter.Delaborator
import Lean.PrettyPrinter.Parenthesizer
import Lean.PrettyPrinter.Formatter
import Lean.Parser.Module
import Lean.ParserCo... |
0b4c445c2dfd50832ed3898b1610ce81807e7e66 | bb31430994044506fa42fd667e2d556327e18dfe | /src/field_theory/subfield.lean | 1f66d94ff24e0a610be0a9f53ca6b40a718c8d00 | [
"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 | 27,725 | lean | /-
Copyright (c) 2020 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen
-/
import algebra.algebra.basic
import algebra.order.field.inj_surj
/-!
# Subfields
Let `K` be a field. This file defines the "bundled" subfield type `subfield K`, a type
w... |
55efa6060036121cd5196f0252f84deef49ac60a | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /docs/tutorial/category_theory/intro.lean | 4687fb0be94bb3776d09d1276929a6a1b2d7139b | [
"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,135 | lean | import category_theory.functor_category -- this transitively imports
-- category_theory.category
-- category_theory.functor
-- category_theory.natural_transformation
/-!
# An introduction to category theory in Lean
This is an introduction to the basic usage of category theory (in the mathematical sense) in Lean.
We c... |
8d29f50751867ebf4c8fbe1a695d6f2bcb861a9e | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/number_theory/cyclotomic/basic.lean | f323dcc6e0948852b87139c83adbccbbd2d2dcf5 | [
"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 | 27,260 | lean | /-
Copyright (c) 2021 Riccardo Brasca. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Riccardo Brasca
-/
import ring_theory.polynomial.cyclotomic.basic
import number_theory.number_field
import algebra.char_p.algebra
import field_theory.galois
/-!
# Cyclotomic extensi... |
10c430760e3a64a1d81e9d86165351f796bd328a | bdb33f8b7ea65f7705fc342a178508e2722eb851 | /analysis/measure_theory/lebesgue_measure.lean | 47f50ddfb9dd4d3aee25fbfcc756cf8c7f185791 | [
"Apache-2.0"
] | permissive | rwbarton/mathlib | 939ae09bf8d6eb1331fc2f7e067d39567e10e33d | c13c5ea701bb1eec057e0a242d9f480a079105e9 | refs/heads/master | 1,584,015,335,862 | 1,524,142,167,000 | 1,524,142,167,000 | 130,614,171 | 0 | 0 | Apache-2.0 | 1,548,902,667,000 | 1,524,437,371,000 | Lean | UTF-8 | Lean | false | false | 9,040 | 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
Lebesgue measure on the real line
-/
import analysis.measure_theory.measure_space analysis.measure_theory.borel_space
noncomputable theory
open classical set lattice fi... |
83a54efb2f25ffb0c302e781804013ebfe11bfdf | a721fe7446524f18ba361625fc01033d9c8b7a78 | /src/principia/real/add.lean | 2df8e176aedfc0a97d7d291d90dd77623f66a5ea | [] | 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 | 4,177 | lean | import .basic
namespace hidden
open myring
open ordered_myring
open myfield
open ordered_myfield
namespace cau_seq
-- We have to prove that it actually gives a cau_seq
def add : cau_seq β cau_seq β cau_seq :=
Ξ» f g, β¨Ξ» n, f.val n + g.val n,
begin
have hf := f.property,
have hg := g.property,
dsimp only [is_ca... |
55875fc292cfa3f7f5aab82163784e3c6013f020 | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /stage0/src/Lean/Elab/Do.lean | 8fb99f4956233162c01e3d39247b88ffd841ca45 | [
"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 | 69,665 | 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.Term
import Lean.Elab.BindersUtil
import Lean.Elab.PatternVar
import Lean.Elab.Quotation.Util
import Lean.Parser.Do
-- HACK: avoid code ex... |
e1c1455ad2493c5281a4a03b3f5c794df57c0bf6 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/analysis/convolution.lean | 01acc85d1edd3a6557f67aa5b52a8c63c3019b61 | [
"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 | 51,992 | lean | /-
Copyright (c) 2022 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
-/
import measure_theory.group.integration
import measure_theory.group.prod
import measure_theory.function.locally_integrable
import analysis.calculus.specific_funct... |
d48aeeac48db6504781a304c9ce63343f1eec076 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/linear_algebra/matrix/finite_dimensional.lean | 1930c3fab027cd497becdc1a3529d63a6e7de7ed | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 1,993 | lean | /-
Copyright (c) 2019 Johannes HΓΆlzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes HΓΆlzl, Patrick Massot, Casper Putz, Anne Baanen
-/
import data.matrix.basic
import linear_algebra.finite_dimensional
import linear_algebra.free_module.finite.matrix
import lin... |
78d9d8960538e255befe9798d50411da3f2b14ef | 097294e9b80f0d9893ac160b9c7219aa135b51b9 | /instructor/types/prod/product_types.lean | a8399e741b66270df32a45b22971a3928a8cc51d | [] | no_license | AbigailCastro17/CS2102-Discrete-Math | cf296251be9418ce90206f5e66bde9163e21abf9 | d741e4d2d6a9b2e0c8380e51706218b8f608cee4 | refs/heads/main | 1,682,891,087,358 | 1,621,401,341,000 | 1,621,401,341,000 | 368,749,959 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,038 | lean | -- Product types, record types, structures, tuples
-- Polymorphic types and functions
namespace hidden
inductive prod_nat_nat : Type
| mk : β β β β prod_nat_nat
-- Polymorphic data type! Yay!
inductive prod_S_T (S T : Type) : Type
| mk: S β T β prod_S_T
def p1 := prod_nat_nat.mk 5 3
def p2 := prod_nat_nat.mk 4 0
-... |
0b438d9488e946a3bcc3be56fdd96425bde78a1d | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/fintype/big_operators.lean | c34174eba89f20cf0086fe28bbe740b86fa19df9 | [
"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,065 | 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.option
import data.fintype.powerset
import data.fintype.sigma
import data.fintype.sum
import data.fintype.vector
import algebra.big_operators.ring... |
44b5b40f843dc2fb46bdf7913eb88545c51b5eec | 4fa161becb8ce7378a709f5992a594764699e268 | /src/linear_algebra/finsupp_vector_space.lean | e5135dec149a5f9c9b5fe43973c92be61feb06c7 | [
"Apache-2.0"
] | permissive | laughinggas/mathlib | e4aa4565ae34e46e834434284cb26bd9d67bc373 | 86dcd5cda7a5017c8b3c8876c89a510a19d49aad | refs/heads/master | 1,669,496,232,688 | 1,592,831,995,000 | 1,592,831,995,000 | 274,155,979 | 0 | 0 | Apache-2.0 | 1,592,835,190,000 | 1,592,835,189,000 | null | UTF-8 | Lean | false | false | 6,337 | lean | /-
Copyright (c) 2019 Johannes HΓΆlzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Johannes HΓΆlzl
Linear structures on function with finite support `ΞΉ ββ Ξ²`.
-/
import data.mv_polynomial
import linear_algebra.dimension
noncomputable theory
local attribute [instance, ... |
7ff780ffb2ce4befd8fa2d38c92d1d39574b7f67 | c09f5945267fd905e23a77be83d9a78580e04a4a | /src/analysis/asymptotics.lean | 1200c879809747073f02f7c8da2b36610634dc39 | [
"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 | 26,185 | lean | /-
Copyright (c) 2019 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad
We introduce these relations:
`is_O f g l` : "f is big O of g along l"
`is_o f g l` : "f is little o of g along l"
Here `l` is any filter on the domain of `f` and `g... |
fab7e16d9c12e801e60a9b64d8b1266c18982672 | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/order/iterate.lean | 9aae5877a14b24ed265cf635fdd00621d569cc2f | [
"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,384 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov
-/
import logic.function.iterate
import data.nat.basic
/-!
# Inequalities on iterates
In this file we prove some inequalities comparing `f^[n] x` and `g^[n] x`... |
81a181b73c0f84475255a434271d8601cf265d59 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/tactic/rewrite_search/frontend.lean | 910c7f57ffd0b2a75a418af49f2d40c4df695ea8 | [
"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 | 4,342 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Keeley Hoek, Scott Morrison
-/
import tactic.rewrite_search.explain
import tactic.rewrite_search.discovery
import tactic.rewrite_search.search
/-!
# `rewrite_search`: solving goals b... |
e4b331943e6b5ed0ff13d6df8f81478bba307cac | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /test/linarith.lean | 5c340974ce2cb3376c04c8f23e6591eb549646cc | [
"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,534 | lean | import tactic.linarith
import algebra.field_power
example {Ξ± : Type} (_inst : Ξ (a : Prop), decidable a)
[linear_ordered_field Ξ±]
{a b c : Ξ±}
(ha : a < 0)
(hb : Β¬b = 0)
(hc' : c = 0)
(h : (1 - a) * (b * b) β€ 0)
(hc : 0 β€ 0)
(this : -(a * -b * -b + b * -b + 0) = (1 - a) * (b * b))
(h : (1 - a) * (b * ... |
c9a8b1dd765fbcfb1b508320bdc6258a5fac9153 | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /src/Lean/Parser.lean | ddb9e777c9e0ddd9b89af231e40af9bbf5979b7c | [
"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 | 6,277 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Sebastian Ullrich
-/
import Lean.Parser.Basic
import Lean.Parser.Level
import Lean.Parser.Term
import Lean.Parser.Tactic
import Lean.Parser.Command
import Lea... |
a959081013f53fa7488ef184445030fb70f0cd67 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/category_theory/single_obj.lean | 61c406f614b45fea132abb21be680c8c186ecc80 | [
"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 | 5,351 | lean | /-
Copyright (c) 2019 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import category_theory.endomorphism
import category_theory.groupoid
import category_theory.category.Cat
import data.equiv.mul_add
import algebra.category.Mon.basic... |
359beeeac19621c08201914d1bde26bf621756b7 | e38e95b38a38a99ecfa1255822e78e4b26f65bb0 | /src/certigrad/det.lean | 99d26515a15b6972dcf2de935bc566be630d5634 | [
"Apache-2.0"
] | permissive | ColaDrill/certigrad | fefb1be3670adccd3bed2f3faf57507f156fd501 | fe288251f623ac7152e5ce555f1cd9d3a20203c2 | refs/heads/master | 1,593,297,324,250 | 1,499,903,753,000 | 1,499,903,753,000 | 97,075,797 | 1 | 0 | null | 1,499,916,210,000 | 1,499,916,210,000 | null | UTF-8 | Lean | false | false | 4,261 | lean | /-
Copyright (c) 2017 Daniel Selsam. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Daniel Selsam
Interface for deterministic operators.
-/
import .tgrads .util .tcont
namespace certigrad
open T list
namespace det
def function (ishapes : list S) (oshape : S) : Type ... |
be4427093ae56dc7de24735fe3fe47ace59cd40e | 1717bcbca047a0d25d687e7e9cd482fba00d058f | /src/topology/algebra/group.lean | a6ba84ff7053082a84e0ff58dfc4f991bb65850f | [
"Apache-2.0"
] | permissive | swapnilkapoor22/mathlib | 51ad5804e6a0635ed5c7611cee73e089ab271060 | 3e7efd4ecd5d379932a89212eebd362beb01309e | refs/heads/master | 1,676,467,741,465 | 1,610,301,556,000 | 1,610,301,556,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 24,342 | lean | /-
Copyright (c) 2017 Johannes HΓΆlzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes HΓΆlzl, Mario Carneiro, Patrick Massot
-/
import order.filter.pointwise
import group_theory.quotient_group
import topology.algebra.monoid
import topology.homeomorph
/-!
# The... |
03294a72d39ce440c54413d9f1a38a4b93d3ee5e | 42c01158c2730cc6ac3e058c1339c18cb90366e2 | /xenalib/M1Fstuff.lean | a030730d9b45d4b15645a0aa83e5caf6db196a44 | [] | no_license | ChrisHughes24/xena | c80d94355d0c2ae8deddda9d01e6d31bc21c30ae | 337a0d7c9f0e255e08d6d0a383e303c080c6ec0c | refs/heads/master | 1,631,059,898,392 | 1,511,200,551,000 | 1,511,200,551,000 | 111,468,589 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,966 | lean | import analysis.real init.classical tactic.norm_num
namespace M1F
theorem floor_real_exists : β (x : β), β (n : β€), βn β€ x β§ x < n+1 :=
begin
intro x,
have H : β (q : β), x < βq β§ βq < x + 1,
exact @exists_rat_btwn x (x+1) (by simp [zero_lt_one]),
cases H with q Hq,
cases classical.em (x < rat.floor q) with Hb Hs... |
eeddb5122ed74e0ba79c67e7dec546a88a1f39d8 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/category_theory/limits/fubini.lean | b66f019afc4c22efbc34b3a2b83d80863b2b0956 | [
"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 | 11,271 | 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.has_limits
import category_theory.products.basic
import category_theory.functor.currying
/-!
# A Fubini theorem for categorical limits
... |
5deaf9254d151536d91037844b179d7ab2210c25 | 4b846d8dabdc64e7ea03552bad8f7fa74763fc67 | /library/init/data/set.lean | f4fd5279861b9f81a17309cc86db1619b7ba4e87 | [
"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 | 1,642 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.logic init.category.functor
universes u v
def set (Ξ± : Type u) := Ξ± β Prop
def set_of {Ξ± : Type u} (p : Ξ± β Prop) : set Ξ± :=
p
namesp... |
946196c5f43dbdd2920814e0c92a9090cc4aaab1 | 9bb72db9297f7837f673785604fb89b3184e13f8 | /library/init/algebra/classes.lean | 367e02c693e579e2cc25a505ee98ad91b9dd4820 | [
"Apache-2.0"
] | permissive | dselsam/lean | ec83d7592199faa85687d884bbaaa570b62c1652 | 6b0bd5bc2e07e13880d332c89093fe3032bb2469 | refs/heads/master | 1,621,807,064,966 | 1,611,454,685,000 | 1,611,975,642,000 | 42,734,348 | 3 | 3 | null | 1,498,748,560,000 | 1,442,594,289,000 | C++ | UTF-8 | Lean | false | false | 13,161 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.logic init.data.ordering.basic
universes u v
@[algebra] class is_symm_op (Ξ± : Type u) (Ξ² : out_param (Type v)) (op : Ξ± β Ξ± β Ξ²) : Prop ... |
e765f5696f91aef67827abea6e95607e6e74789d | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/reflexive_elim_prop_bug.lean | e0343fa58c6c76bc8e88a146d5fa4737392281f7 | [
"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 | 555 | lean | namespace tst1
inductive Foo : Type
| node : (β β Foo) β Foo
| leaf : Foo
constant Bar : Type
constant P : Bar β Prop
constant Q : Bar β Type
axiom P_ax : β b, P b
lemma foo_error : β (foo : Foo) (b : Bar), P b
| (Foo.node f) := Ξ» b, foo_error (f 0) b
| Foo.leaf := Ξ» b, P_ax b
end tst1
namespace tst2
inductiv... |
811089441244dfcdb04db17121a5445a42b95c34 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/algebra/order/monoid.lean | 4ea1b086f8a434d6aa243440509b6bea7666a12b | [
"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 | 40,858 | 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.group.with_one
import algebra.group.type_tags
import algebra.group.prod
import algebra.order.monoid_le... |
e56ae4217a91b7cd8db28a0aa7403ba79ad27fb4 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/interactive/complete_namespace.lean | a6f296ed5d8909a021de695e38638275b4a734e2 | [
"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 | 131 | lean | prelude
inductive foo.bar
open foo
--^ "command": "complete"
namespace foo
open bar
--^ "command": "complete"
end foo
|
ace12ee30b7821dcbd21e8153fe4503ecf3989fa | 8e6cad62ec62c6c348e5faaa3c3f2079012bdd69 | /src/topology/paracompact.lean | 86daa82552f6770ace4dbeac1dfcd71f01473c21 | [
"Apache-2.0"
] | permissive | benjamindavidson/mathlib | 8cc81c865aa8e7cf4462245f58d35ae9a56b150d | fad44b9f670670d87c8e25ff9cdf63af87ad731e | refs/heads/master | 1,679,545,578,362 | 1,615,343,014,000 | 1,615,343,014,000 | 312,926,983 | 0 | 0 | Apache-2.0 | 1,615,360,301,000 | 1,605,399,418,000 | Lean | UTF-8 | Lean | false | false | 15,276 | lean | /-
Copyright (c) 2021 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Reid Barton, Yury Kudryashov
-/
import topology.subset_properties
import topology.separation
import data.option.basic
/-!
# Paracompact topological spaces
A topological space `X` is... |
0c5ffb0204effb34b24b3745942d7460a695c28c | 07c76fbd96ea1786cc6392fa834be62643cea420 | /hott/types/W.hlean | 46baa61bcb7277b1f785976795734632809c968b | [
"Apache-2.0"
] | permissive | fpvandoorn/lean2 | 5a430a153b570bf70dc8526d06f18fc000a60ad9 | 0889cf65b7b3cebfb8831b8731d89c2453dd1e9f | refs/heads/master | 1,592,036,508,364 | 1,545,093,958,000 | 1,545,093,958,000 | 75,436,854 | 0 | 0 | null | 1,480,718,780,000 | 1,480,718,780,000 | null | UTF-8 | Lean | false | false | 4,773 | hlean | /-
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
Theorems about W-types (well-founded trees)
-/
import .sigma .pi
open eq equiv is_equiv sigma sigma.ops
inductive Wtype.{l k} {A : Type.{l}} (B : A β Type.{k}) : T... |
b5a8cdbfc5273cc0d6aa62ae7876b678e3d8c19d | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/smt_tests2.lean | 41bfe0763885966810275839e2197172977f95ee | [
"Apache-2.0"
] | permissive | leanprover-community/lean | 12b87f69d92e614daea8bcc9d4de9a9ace089d0e | cce7990ea86a78bdb383e38ed7f9b5ba93c60ce0 | refs/heads/master | 1,687,508,156,644 | 1,684,951,104,000 | 1,684,951,104,000 | 169,960,991 | 457 | 107 | Apache-2.0 | 1,686,744,372,000 | 1,549,790,268,000 | C++ | UTF-8 | Lean | false | false | 1,312 | lean | lemma ex1 (a b c : nat) (f : nat β nat β nat) : f 0 1 = 1 β (Ξ» x y : nat, x) = f β false :=
begin [smt]
intros
end
lemma ex2 (a b c : nat) (f : nat β nat β nat) : f 0 1 = 1 β f = (Ξ» x y, x) β false :=
begin [smt]
intros
end
lemma ex3 (a b c : nat) (f : nat β nat) : f = (Ξ» x, x) β f 0 = 1 β false :=
begin [smt]
... |
f2d9dc87d2e04b947d5474b0a2ed80b85e9466bf | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/fintype/list.lean | 1accc08def6a384c482e3a1206adba8d9dcd9c5b | [
"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 | 1,903 | lean | /-
Copyright (c) 2021 Yakov Pechersky. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yakov Pechersky
-/
import data.fintype.basic
import data.finset.powerset
/-!
# Fintype instance for nodup lists
The subtype of `{l : list Ξ± // l.nodup}` over a `[fintype Ξ±]`
admits... |
8d4338d913cc6012fa133a6430e57b08649852db | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /stage0/src/Init/Lean/Data/Name.lean | f6d7d114e7077116faac36d2dd02b4a6935efd69 | [
"Apache-2.0"
] | permissive | mhuisi/lean4 | 28d35a4febc2e251c7f05492e13f3b05d6f9b7af | dda44bc47f3e5d024508060dac2bcb59fd12e4c0 | refs/heads/master | 1,621,225,489,283 | 1,585,142,689,000 | 1,585,142,689,000 | 250,590,438 | 0 | 2 | Apache-2.0 | 1,602,443,220,000 | 1,585,327,814,000 | C | UTF-8 | Lean | false | false | 5,653 | lean | /-
Copyright (c) 2018 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
prelude
import Init.LeanInit
import Init.Data.UInt
import Init.Data.ToString
import Init.Data.Hashable
import Init.Data.HashSet
import Init.Data.RBMap
import... |
7a25eba000260c7b409e2f0d2b7923fe8c22ec12 | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /library/hott/types/prod.lean | 65d8f62041b0eaaae6f1d0a2d3b3e72d1206a184 | [
"Apache-2.0"
] | permissive | codyroux/lean | 7f8dff750722c5382bdd0a9a9275dc4bb2c58dd3 | 0cca265db19f7296531e339192e9b9bae4a31f8b | refs/heads/master | 1,610,909,964,159 | 1,407,084,399,000 | 1,416,857,075,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 849 | 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
Ported from Coq HoTT
Theorems about products
-/
import ..trunc data.prod
open path Equiv IsEquiv truncation prod
variables {A A' B B' C D : Type}
{a a' a... |
4db9b9d1dff25becd15a7c39adc72de586f74c65 | f3849be5d845a1cb97680f0bbbe03b85518312f0 | /tests/lean/char_lits.lean | 90d322b68417bd26fdb8d82963ee71b5e499b6c2 | [
"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 | 209 | lean | import system.io
open io
#check 'a'
#eval 'a'
#eval '\n'
#eval '\\'
variable [io.interface]
#eval put_str (list.cons '\\' "aaa")
#eval put_str ['\n']
#eval put_str ['\n']
#eval put_str (list.cons '\'' "aaa")
|
908a75bea56b697838d57beab58066b6c877dd5c | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/algebra/algebra/subalgebra.lean | fc20aa2936735515b3e60799a21808610e1d319e | [
"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 | 43,654 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Yury Kudryashov
-/
import algebra.algebra.operations
import data.set.Union_lift
import ring_theory.subring.pointwise
/-!
# Subalgebras over Commutative Semiring
In this file we... |
de64374ec56769f41604681f8d7ce816b7558f5e | 367134ba5a65885e863bdc4507601606690974c1 | /src/meta/coinductive_predicates.lean | 4e6339b53fb949141285f3679f5eedbf7b5464b3 | [
"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 | 20,448 | 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 (CMU)
-/
import tactic.core
section
universe u
@[user_attribute]
meta def monotonicity : user_attribute := { name := `monotonicity, descr := "Monotonicity rules for pre... |
253069be38ca5f3b86b406adc2f0a36475868184 | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/tactic/omega/find_scalars.lean | 854a0a7dedff3bdfc8216186e03b22baf39cb391 | [
"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,885 | lean | /-
Copyright (c) 2019 Seul Baek. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Seul Baek
A tactic which performs FourierβMotzkin elimination to find
a contradictory linear combination of input constraints.
-/
import tactic.omega.term data.list.min_max
open list.fun... |
a8c2de9bc644ff61aa2b34dd5d623a9d236bce09 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/tactic/positivity.lean | b9c36aa5a13cb2890c451f9bab39d11ce43ba34f | [
"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 | 15,684 | lean | /-
Copyright (c) 2022 Mario Carneiro, Heather Macbeth. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Heather Macbeth
-/
import tactic.norm_num
/-! # `positivity` tactic
The `positivity` tactic in this file solves goals of the form `0 β€ x` and `0 < x`... |
af0b9b27f4d42737a5fd0f914007b16228e44dd6 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/playground/parser/parser.lean | 213c5137a30200ee8473a0b6cd6a22b67c6976c9 | [
"Apache-2.0"
] | permissive | mhuisi/lean4 | 28d35a4febc2e251c7f05492e13f3b05d6f9b7af | dda44bc47f3e5d024508060dac2bcb59fd12e4c0 | refs/heads/master | 1,621,225,489,283 | 1,585,142,689,000 | 1,585,142,689,000 | 250,590,438 | 0 | 2 | Apache-2.0 | 1,602,443,220,000 | 1,585,327,814,000 | C | UTF-8 | Lean | false | false | 32,509 | lean | import init.lean.name init.lean.parser.trie init.lean.parser.identifier
import syntax filemap
open Lean
export Lean.Parser (Trie)
-- namespace Lean
namespace Parser
/-- A multimap indexed by tokens. Used for indexing parsers by their leading token. -/
def TokenMap (Ξ± : Type) := RBMap Name (List Ξ±) Name.quickLt
names... |
0c76b7e0c6aaefc901eaf00dcf556b95edf748e0 | 4b846d8dabdc64e7ea03552bad8f7fa74763fc67 | /library/tools/super/demod.lean | 4d5f4125075f4320a2068792fff19dc583e97f4e | [
"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,189 | lean | /-
Copyright (c) 2017 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner
-/
import .superposition
open tactic monad expr
namespace super
meta def is_demodulator (c : clause) : bool :=
match c^.get_lits with
| [clause.literal.right eqn] := eqn... |
c05015294dd7a0d2b5e1ad5e2337b055f06b8ee1 | 1fd908b06e3f9c1252cb2285ada1102623a67f72 | /hit/trunc.lean | b224852086337769cb192695bd3339ffd382b97c | [
"Apache-2.0"
] | permissive | avigad/hott3 | 609a002849182721e7c7ae536d9f1e2956d6d4d3 | f64750cd2de7a81e87d4828246d1369d59f16f43 | refs/heads/master | 1,629,027,243,322 | 1,510,946,717,000 | 1,510,946,717,000 | 103,570,461 | 0 | 0 | null | 1,505,415,620,000 | 1,505,415,620,000 | null | UTF-8 | Lean | false | false | 5,989 | lean | /-
Copyright (c) 2015 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
n-truncation of types.
Ported from Coq HoTT
-/
/- The hit n-truncation is primitive, declared in init.hit. -/
import types.sigma types.pointed
universes u v w
ho... |
06d004ae4bff420ab9be722fbb39b999703171f9 | 4bcaca5dc83d49803f72b7b5920b75b6e7d9de2d | /src/Init/Prelude.lean | 438b61e9d2e902f63c3c9d3e759a82f047d74f5b | [
"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 | 76,926 | 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
-/
prelude
universe u v w
@[inline] def id {Ξ± : Sort u} (a : Ξ±) : Ξ± := a
abbrev Function.comp {Ξ± : Sort u} {Ξ² : Sort v} {Ξ΄ : Sort w} (f : Ξ² β Ξ΄) (g : Ξ± β Ξ²)... |
60f23368e7277a54717343b139ed5765d188474a | 2c41ae31b2b771ad5646ad880201393f5269a7f0 | /Lean/Qualities/Scalable.lean | cee88319cbebfb58a9becca584603656480da08f | [] | no_license | kevinsullivan/Boehm | 926f25bc6f1a8b6bd47d333d936fdfc278228312 | 55208395bff20d48a598b7fa33a4d55a2447a9cf | refs/heads/master | 1,586,127,134,302 | 1,488,252,326,000 | 1,488,252,326,000 | 32,836,930 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 659 | lean | -- Scalable
/-
[Scalable] is parameterized by an instance of type [SystemType], and it's a sub-attribute to [MissionEffective].
An instance of type [SystemType] is deemed [Scalable] if and only if all the requirements are satisfied.
-/
import SystemModel.System
inductive Scalable (sys_type: SystemType): Prop
... |
5ea249764160b1eb1ca5e3922af291c07f28397e | 07c76fbd96ea1786cc6392fa834be62643cea420 | /hott/types/equiv.hlean | bf04ad5526982682d154a14774f99659f05c83f6 | [
"Apache-2.0"
] | permissive | fpvandoorn/lean2 | 5a430a153b570bf70dc8526d06f18fc000a60ad9 | 0889cf65b7b3cebfb8831b8731d89c2453dd1e9f | refs/heads/master | 1,592,036,508,364 | 1,545,093,958,000 | 1,545,093,958,000 | 75,436,854 | 0 | 0 | null | 1,480,718,780,000 | 1,480,718,780,000 | null | UTF-8 | Lean | false | false | 12,611 | hlean | /-
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
Ported from Coq HoTT
Theorems about the types equiv and is_equiv
-/
import .fiber .arrow arity ..prop_trunc cubical.square .pointed
open eq is_trunc sigma sigma.op... |
1f0b61d412e3990a9d2e4ae73c75fbb541b33f96 | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /12_Axioms.org.14.lean | 840903e59a53c32177cc5d988e09fba43b643a68 | [] | no_license | cjmazey/lean-tutorial | ba559a49f82aa6c5848b9bf17b7389bf7f4ba645 | 381f61c9fcac56d01d959ae0fa6e376f2c4e3b34 | refs/heads/master | 1,610,286,098,832 | 1,447,124,923,000 | 1,447,124,923,000 | 43,082,433 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,280 | lean | import standard
import data.prod
open prod prod.ops quot
private definition eqv {A : Type} (pβ pβ : A Γ A) : Prop :=
(pβ.1 = pβ.1 β§ pβ.2 = pβ.2) β¨ (pβ.1 = pβ.2 β§ pβ.2 = pβ.1)
infix `~` := eqv
open eq or
local notation `β¨` Hβ `,` Hβ `β©` := and.intro Hβ Hβ
private theorem eqv.refl {A : Type} : β p : A Γ A, p ~ p :=
... |
ae1b7952c94a755088b5570c35eaeb29b63be63f | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/tactic/pi_instances.lean | 5eefbb79cc75ea8a36bddc25bb61ad64999d985d | [
"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 | 1,812 | lean | /-
Copyright (c) 2018 Simon Hudon All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Simon Hudon
Automation for creating instances of mathematical structures for pi types
-/
import tactic.solve_by_elim order.basic
namespace tactic
open interactive interactive.types lean... |
dd00021bf5a4680c165bcb189292ecaba9d72aa0 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/dep_bug.lean | a87316a5f77d63d6f66f91f5af94f42351865a16 | [
"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 | 301 | lean | open tactic
example (a b c : nat) (H : c = b) : a + c = a + b :=
by do
N β to_expr ``(nat),
define `v N,
trace_state,
trace "------------",
to_expr ```(a + b) >>= exact,
trace_state,
trace "------------",
get_local `H >>= subst,
trace_state,
to_expr ```(eq.refl v) >>= exact
|
a598e3bc187d0c37d5ff91859e8582ab8b22fd48 | 59a4b050600ed7b3d5826a8478db0a9bdc190252 | /src/category_theory/universal/uniqueness.lean | 55f007b807a75a3196cbe7f55d3c07d2c4fd0cee | [] | no_license | rwbarton/lean-category-theory | f720268d800b62a25d69842ca7b5d27822f00652 | 00df814d463406b7a13a56f5dcda67758ba1b419 | refs/heads/master | 1,585,366,296,767 | 1,536,151,349,000 | 1,536,151,349,000 | 147,652,096 | 0 | 0 | null | 1,536,226,960,000 | 1,536,226,960,000 | null | UTF-8 | Lean | false | false | 1,977 | lean | import category_theory.limits
universes u v
open category_theory
namespace category_theory.limits
variables {C : Type u} [π : category.{u v} C]
include π
section
@[extensionality] lemma homs_to_terminal_ext (X' : C) (X : C) [is_terminal.{u v} X] (f g : X' βΆ X) : f = g :=
begin
rw is_terminal.uniq X X' f,
rw... |
a1308ee9df0acf6812eb888ada76198dfe7c66f6 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/analysis/normed_space/hahn_banach/extension.lean | 103c5f6d682639f055fdb64e05f86f853d8fdfa1 | [
"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 | 6,812 | lean | /-
Copyright (c) 2020 Yury Kudryashov All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov, Heather Macbeth
-/
import analysis.convex.cone
import analysis.normed_space.is_R_or_C
import analysis.normed_space.extend
/-!
# Extension Hahn-Banach theorem
In this... |
871c06b7183f0cc0c71c502c01a9e13534c44b8d | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/data/polynomial/field_division.lean | a927d2f8cbabc9580c98847c6759645a00288103 | [
"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 | 21,313 | 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.derivative
import data.polynomial.ring_division
import ring_theory.euclidean_domain
/-!
# Theory o... |
b7d1c9fc033d0d1f712fc6e9832e2f2122d173cb | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/set.lean | afbcc93f77cfe57d1b58e090b025f994ae67568f | [
"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 | 131 | lean | import logic
open bool nat
definition set {{T : Type}} := T β bool
infix `β` := Ξ»x A, A x = tt
check 1 β (Ξ» x : nat, tt)
|
2ab6c72ddf1dd7bf48ad0996ef79b99fa5800ec4 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/lake/examples/deps/b/B.lean | 661392753c6d71c6732f118beb8aae9f1ede5f2f | [
"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 | 34 | lean | import Root
def b := s!"B{root}"
|
7a00fc2bc746fb7767dc4a34b02abf510f34eb3d | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/univ2.lean | 35793c93191f163d80ab2252112a71f495e62d84 | [
"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 | 231 | lean | import logic
axiom I : Type
definition F (X : Type) : Type := (X β Prop) β Prop
axiom unfoldd : I β F I
axiom foldd : F I β I
axiom iso1 : βx, foldd (unfoldd x) = x
theorem iso2 : βx, foldd (unfoldd x) = x
:= sorry
|
717ce375c6d15694a9a47303359aee63a6fbcd26 | 02005f45e00c7ecf2c8ca5db60251bd1e9c860b5 | /src/field_theory/finite/polynomial.lean | 3ba4e3e01b0fb13cc7486b41f02ac88c33b4e9a1 | [
"Apache-2.0"
] | permissive | anthony2698/mathlib | 03cd69fe5c280b0916f6df2d07c614c8e1efe890 | 407615e05814e98b24b2ff322b14e8e3eb5e5d67 | refs/heads/master | 1,678,792,774,873 | 1,614,371,563,000 | 1,614,371,563,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,506 | 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 field_theory.finite.basic
import field_theory.mv_polynomial
import data.mv_polynomial.expand
import linear_algebra.basic
/-!
## Polynomials over finite field... |
7d19f65079aa7599242fa1a880d846dba4fef412 | ad3e8f15221a986da27c99f371922c0b3f5792b6 | /src/week04/solutions/e02_limits.lean | 9c0910874572bfdf712ac91de7727099f9a23920 | [] | no_license | VArtem/lean-itmo | a0e1424c8cc4c2de2ac85ab6fd4a12d80e9b85f1 | dc44cd06f9f5b984d051831b3aaa7364e64c2dc4 | refs/heads/main | 1,683,761,214,467 | 1,622,821,295,000 | 1,622,821,295,000 | 357,236,048 | 12 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 17,652 | lean | import data.real.basic
import tactic
/-
-- ΠΡΠΎΡ ΡΠ°ΠΉΠ» ΠΏΠ΅ΡΠ΅Π²Π΅Π΄Π΅Π½ ΠΈ Π°Π΄Π°ΠΏΡΠΈΡΠΎΠ²Π°Π½ ΠΈΠ· ΡΡΠ΅ΡΡΠ΅ΠΉ Π½Π΅Π΄Π΅Π»ΠΈ ΠΊΡΡΡΠ° Formalising Mathematics: https://github.com/ImperialCollegeLondon/formalising-mathematics/blob/master/src/week_3/Part_A_limits.lean
Π ΡΡΠΎΠΌ ΡΠ°ΠΉΠ»Π΅ ΠΌΡ ΡΠ°Π·ΠΎΠ²ΡΠ΅ΠΌ ΡΠ΅ΠΎΡΠΈΡ ΠΏΡΠ΅Π΄Π΅Π»ΠΎΠ² ΠΏΠΎΡΠ»Π΅Π΄ΠΎΠ²Π°ΡΠ΅Π»ΡΠ½ΠΎΡΡΠ΅ΠΉ Π²Π΅ΡΠ΅ΡΡΠ²Π΅Π½Π½ΡΡ
ΡΠΈΡΠ΅Π» ΡΠ΅ΡΠ΅... |
b5baa879ec52d8770a1e433b76468b74a152f12c | fecda8e6b848337561d6467a1e30cf23176d6ad0 | /src/data/zmod/basic.lean | fe1696cb20581a7aee05a0e8fef7927eb82554b1 | [
"Apache-2.0"
] | permissive | spolu/mathlib | bacf18c3d2a561d00ecdc9413187729dd1f705ed | 480c92cdfe1cf3c2d083abded87e82162e8814f4 | refs/heads/master | 1,671,684,094,325 | 1,600,736,045,000 | 1,600,736,045,000 | 297,564,749 | 1 | 0 | null | 1,600,758,368,000 | 1,600,758,367,000 | null | UTF-8 | Lean | false | false | 27,685 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Chris Hughes
-/
import data.int.modeq
import algebra.char_p
import data.nat.totient
import ring_theory.ideal.operations
/-!
# Integers mod `n`
Definition of the integers mod n, and the... |
d288432675befc58d4758b7fbdd8d2b81e5686e0 | a7dd8b83f933e72c40845fd168dde330f050b1c9 | /src/data/rat.lean | 7670306ab38ecda2606df1abb3a6f7996c39b438 | [
"Apache-2.0"
] | permissive | NeilStrickland/mathlib | 10420e92ee5cb7aba1163c9a01dea2f04652ed67 | 3efbd6f6dff0fb9b0946849b43b39948560a1ffe | refs/heads/master | 1,589,043,046,346 | 1,558,938,706,000 | 1,558,938,706,000 | 181,285,984 | 0 | 0 | Apache-2.0 | 1,568,941,848,000 | 1,555,233,833,000 | Lean | UTF-8 | Lean | false | false | 45,245 | 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
Introduces the rational numbers as discrete, linear ordered field.
-/
import
data.nat.gcd data.pnat data.int.sqrt data.equiv.encodable
algebra.grou... |
8102114fcf890a1f55c8f81c1fc9b410ab1a4d15 | 1a61aba1b67cddccce19532a9596efe44be4285f | /hott/types/pi.hlean | 2d08232e0daaba8c92308ae23877ce34edff9eaf | [
"Apache-2.0"
] | permissive | eigengrau/lean | 07986a0f2548688c13ba36231f6cdbee82abf4c6 | f8a773be1112015e2d232661ce616d23f12874d0 | refs/heads/master | 1,610,939,198,566 | 1,441,352,386,000 | 1,441,352,494,000 | 41,903,576 | 0 | 0 | null | 1,441,352,210,000 | 1,441,352,210,000 | null | UTF-8 | Lean | false | false | 9,146 | hlean | /-
Copyright (c) 2014-15 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Floris van Doorn
Partially ported from Coq HoTT
Theorems about pi-types (dependent function spaces)
-/
import types.sigma arity
open eq equiv is_equiv funext sigma
namespace pi... |
ab2e83bc6ab13f800ce8d964e2fb6e41d0704b04 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/tactic/print_sorry.lean | f380ddec871fb0115235bff98cf94e6b8c0b02d0 | [
"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 | 4,856 | lean | /-
Copyright (c) 2022 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
-/
import tactic.core
import data.bool.basic
/-!
# Print sorry
Adds a command `#print_sorry_in nm` that prints all occurrences of `sorry` in declarations used in
`... |
09a921ba2e2cc917eee6973bc190a6a5a8e798a1 | a4fc62ff52cb859cadb6cdfa156b33d12a5fcfb1 | /Mandlebrah.lean | c0702a74c24c93bf5b39f48bd7155c317a11c95d | [] | no_license | chughes87/Mandlebrah | f86b2406422922d7bb0d89a3d28775bd8862e074 | 559d300a9ef3d43832d3b47cffb014abe7649538 | refs/heads/master | 1,692,395,039,560 | 1,632,105,435,000 | 1,632,105,435,000 | 407,995,906 | 6 | 2 | null | 1,632,197,696,000 | 1,632,010,899,000 | Lean | UTF-8 | Lean | false | false | 3,785 | lean | import Mandlebrah.Complex
def step (c z : Complex) : Complex := z ^ 2 + c
def mandel (c : Complex) (bound : Float := 2.0) (maxSteps : Nat := 20) : Nat :=
let rec iterate : Complex β Nat β Nat β Nat := Ξ»
| _, 0, _ => 0
| z, maxSteps + 1, currStep =>
match (Complex.Abs z β₯ bound : Bool) with
| tr... |
e8c7c4f83bcd9e6a3a4e42d01bcee58117221e9d | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebraic_topology/simplicial_set.lean | 5d5aca42921e6fb533f6a1c85e75eed8f3145f13 | [
"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 | 5,169 | lean | /-
Copyright (c) 2021 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Scott Morrison, Adam Topaz
-/
import algebraic_topology.simplicial_object
import algebraic_topology.topological_simplex
import category_theory.limits.presheaf
import ca... |
183178bb153b2f03f7cfb97a71663eb48bb1f7b7 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/algebra/module/torsion.lean | 9326615a9c7712ac45e4be6ab625728aa314212f | [
"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 | 27,501 | 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.direct_sum.module
import linear_algebra.isomorphisms
import group_theory.torsion
import ring_theory.coprime.ideal
import ring_theory.fi... |
b3a4fedadff9a3f4d5f4d0f9bae96247ea03bf13 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/topology/category/UniformSpace.lean | c36c99337f26bf7ff0f6bc4e71a5aaa9315b6b68 | [
"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 | 6,986 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Reid Barton, Patrick Massot, Scott Morrison
-/
import category_theory.monad.limits
import topology.uniform_space.completion
import topology.category.Top.basic
/-!
# The category of un... |
5f082614c35d5b298edc2492b3253b2d638cb622 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/set_theory/lists.lean | 29619cc8e300acdae60cd5d1c5df3a8efb4aac18 | [
"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 | 11,852 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
A computable model of hereditarily finite sets with atoms
(ZFA without infinity). This is useful for calculations in naive
set theory.
-/
import tactic.interactive data.... |
55cdf431e108b105845278b6c595ae03d3d32d5b | 92b1c7f0343a6a5cd36bc0f623a7490da3f1e0f3 | /src/stump/algorithm_measurable.lean | a3dc9376f6418b2166c3e242e93642ff0c712158 | [
"Apache-2.0"
] | permissive | jtristan/stump-learnable | 717453eb590af16e60c7d3806cc9e66492fab091 | aa3c089f41602efa08d31ef6b41e549456186d57 | refs/heads/master | 1,625,630,634,360 | 1,607,552,106,000 | 1,607,552,106,000 | 218,629,406 | 15 | 2 | null | null | null | null | UTF-8 | Lean | false | false | 3,294 | lean | /-
Copyright Β© 2019, Oracle and/or its affiliates. All rights reserved.
-/
import .algorithm_definition
import .setup_measurable
open set
namespace stump
variables (ΞΌ: probability_measure β) (target: β) (n: β)
@[simp]
lemma label_sample_measurable: β n: β, measurable (label_sample target n) :=
begin
intro,
app... |
f9c7f7d6c8ac38bf25b77e324ca8c8530683d416 | 9a0b1b3a653ea926b03d1495fef64da1d14b3174 | /tidy/rewrite_search/core/hook.lean | 99e39d9d55b2545c1149c0afb1fd2ebe82c7406a | [
"Apache-2.0"
] | permissive | khoek/mathlib-tidy | 8623b27b4e04e7d598164e7eaf248610d58f768b | 866afa6ab597c47f1b72e8fe2b82b97fff5b980f | refs/heads/master | 1,585,598,975,772 | 1,538,659,544,000 | 1,538,659,544,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,609 | lean | import tidy.lib.tactic
import tidy.rewrite_all_wrappers
import .shared
namespace tidy.rewrite_search
meta def rewrite_progress := mllist tactic rewrite
meta def progress_init (rs : list (expr Γ bool)) (exp : expr) (cfg : rewrite_all_cfg) (s : side) : tactic rewrite_progress := do
l β all_rewrites_mllist rs exp cf... |
e6ce23588de7ed4c0691ca1f2b01b1cbfff56f1e | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebraic_topology/dold_kan/decomposition.lean | fa1471a071589de0a5aa6d99beb2e4e4ec6b0288 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 5,411 | lean | /-
Copyright (c) 2022 JoΓ«l Riou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: JoΓ«l Riou
-/
import algebraic_topology.dold_kan.p_infty
/-!
# Decomposition of the Q endomorphisms
In this file, we obtain a lemma `decomposition_Q` which expresses
explicitly the proje... |
0cd56160bfe3b71622edbd0ca9686c68d14cda88 | 217bb195841a8be2d1b4edd2084d6b69ccd62f50 | /tests/compiler/array_test.lean | 770b8a6b6ba1789f5a7027e4599b962cc2c09635 | [
"Apache-2.0"
] | permissive | frank-lesser/lean4 | 717f56c9bacd5bf3a67542d2f5cea721d4743a30 | 79e2abe33f73162f773ea731265e456dbfe822f9 | refs/heads/master | 1,589,741,267,933 | 1,556,424,200,000 | 1,556,424,281,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 767 | lean | def foo (a : Array Nat) : Array Nat :=
let a := a.push 0 in
let a := a.push 1 in
let a := a.push 2 in
let a := a.push 3 in
a
def main : IO UInt32 :=
do
let a : Array Nat := Array.empty,
IO.println (toString a),
IO.println (toString a.sz),
let a := foo a,
IO.println (toString a),
let a := a.hmap (+10),
IO.printl... |
d721fc66b45c70f77a8dcfd23a9061fbe89e0e38 | b11468ab3abb22a54747a1a0e6ffff1005799c4d | /lean/src/minif2f_import.lean | 79a2d61d128adabf4ac74548c5d56d92bb79ef88 | [
"Apache-2.0",
"MIT"
] | permissive | atkirtland/miniF2F | ddefddc11469053c1d93fe6ffbe7924d1c06f2f6 | 1c4b8bffebdf052260d11d47a5ff96dc7d1fb8db | refs/heads/main | 1,693,440,222,185 | 1,633,522,781,000 | 1,633,522,781,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,828 | lean | import algebra.algebra.basic
import algebra.big_operators.basic
import algebra.floor
import algebra.group_power.basic
import algebra.quadratic_discriminant
import algebra.ring.basic
import analysis.asymptotics.asymptotic_equivalent
import analysis.mean_inequalities
import analysis.normed_space.basic
import analysis.inn... |
124c1f12fabc179daedc9453605af72992fbf9d0 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/category_theory/closed/monoidal.lean | 433aec0d14dce321188d99f604afc0fbbce6b0fa | [
"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,848 | 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 category_theory.monoidal.functor
import category_theory.adjunction.limits
import category_theory.adjunction.mates
import category_theory.functor.... |
bd62704ed7249b77147b2a23761f9fbc356d6fa6 | bab2ace2b909818f20ac125499a8dd88ce812721 | /src/2020/relations/partition_challenge.lean | 5617c34b379028d2ce0a69dfbc38aae5fd20180e | [] | no_license | LaplaceKorea/M40001_lean | 8a3cd411fb821a7665132c09e436f02f674cc666 | 116e9ed1fadf59dc2e78376fca92026859a03bf2 | refs/heads/master | 1,693,347,195,820 | 1,635,517,507,000 | 1,635,517,507,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,622 | lean | import tactic
/-!
# The partition challenge!
Prove that equivalence relations on Ξ± are the same as partitions of Ξ±.
Three sections:
1) partitions
2) equivalence classes
3) the challenge
## Overview
Say `Ξ±` is a type, and `R` is a binary relation on `Ξ±`.
The following things are already in Lean:
reflexive R := ... |
c3863d77c76cb1339050a6d20ce1f0caca9a3cb8 | 88fb7558b0636ec6b181f2a548ac11ad3919f8a5 | /tests/lean/eval_expr_error.lean | 85e30dc401ed59a237b29e62782f727dabbf1d64 | [
"Apache-2.0"
] | permissive | moritayasuaki/lean | 9f666c323cb6fa1f31ac597d777914aed41e3b7a | ae96ebf6ee953088c235ff7ae0e8c95066ba8001 | refs/heads/master | 1,611,135,440,814 | 1,493,852,869,000 | 1,493,852,869,000 | 90,269,903 | 0 | 0 | null | 1,493,906,291,000 | 1,493,906,291,000 | null | UTF-8 | Lean | false | false | 344 | lean | open tactic
meta def tst1 (A : Type) : tactic unit :=
do a β to_expr `(0),
v β eval_expr A a,
return ()
run_cmd do
a β to_expr `(nat.add),
v β eval_expr nat a,
trace v,
return ()
run_cmd do
a β to_expr `(Ξ» x : nat, x + 1),
v β (eval_expr nat a <|> trace "tactic failed" >> return 1),
trace v,
... |
616929ec2b9acee13f045379e7fa6133496c2037 | 35960c5b117752aca7e3e7767c0b393e4dbd72a7 | /src/sch/core.lean | 9b0f89ece5cf58939717e88b9da9f057fd2832eb | [
"Apache-2.0"
] | permissive | spl/tts | 461dc76b83df8db47e4660d0941dc97e6d4fd7d1 | b65298fea68ce47c8ed3ba3dbce71c1a20dd3481 | refs/heads/master | 1,541,049,198,347 | 1,537,967,023,000 | 1,537,967,029,000 | 119,653,145 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,925 | lean | import typ
namespace tts ------------------------------------------------------------------
/-- Grammar of type schemes -/
@[derive decidable_eq]
structure sch (V : Type) : Type :=
(vars : list V)
(type : typ V)
(vars_nodup : vars.nodup)
attribute [pp_using_anonymous_constructor] sch
namespace sch -----------------... |
c7fc87e96617aa8f812534da507466c1fd205437 | 2c096fdfecf64e46ea7bc6ce5521f142b5926864 | /src/Lean/Data/HashSet.lean | e11dae3273aa5a21c2cbee11a7c06d77de95ad16 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | Kha/lean4 | 1005785d2c8797ae266a303968848e5f6ce2fe87 | b99e11346948023cd6c29d248cd8f3e3fb3474cf | refs/heads/master | 1,693,355,498,027 | 1,669,080,461,000 | 1,669,113,138,000 | 184,748,176 | 0 | 0 | Apache-2.0 | 1,665,995,520,000 | 1,556,884,930,000 | Lean | UTF-8 | Lean | false | false | 6,963 | 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
-/
namespace Lean
universe u v w
def HashSetBucket (Ξ± : Type u) :=
{ b : Array (List Ξ±) // b.size.isPowerOfTwo }
def HashSetBucket.update {Ξ± : Type u} (data... |
f4c5fd1d3fd0c16e38c9dfb5b90acae3030a11ac | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/ring_theory/polynomial_algebra.lean | bc55dffa967ef868e1caff48675a43fa21d8fcc7 | [
"Apache-2.0"
] | permissive | dupuisf/mathlib | 62de4ec6544bf3b79086afd27b6529acfaf2c1bb | 8582b06b0a5d06c33ee07d0bdf7c646cae22cf36 | refs/heads/master | 1,669,494,854,016 | 1,595,692,409,000 | 1,595,692,409,000 | 272,046,630 | 0 | 0 | Apache-2.0 | 1,592,066,143,000 | 1,592,066,142,000 | null | UTF-8 | Lean | false | false | 11,917 | 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 ring_theory.matrix_algebra
import data.polynomial.algebra_map
/-!
# Algebra isomorphism between matrices of polynomials and polynomials of matrices
Given `[c... |
528b9d84ccc7795ec6c1ea0959e2af0c1d6b8f3e | 1b8f093752ba748c5ca0083afef2959aaa7dace5 | /src/category_theory/universal/cones.lean | 8499d5679a9b353689c7ea1993e494f0cfe517b9 | [] | no_license | khoek/lean-category-theory | 7ec4cda9cc64a5a4ffeb84712ac7d020dbbba386 | 63dcb598e9270a3e8b56d1769eb4f825a177cd95 | refs/heads/master | 1,585,251,725,759 | 1,539,344,445,000 | 1,539,344,445,000 | 145,281,070 | 0 | 0 | null | 1,534,662,376,000 | 1,534,662,376,000 | null | UTF-8 | Lean | false | false | 4,282 | 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 category_theory.limits.shape
open category_theory
namespace category_theory.limits
universes u v
variables {J : Type v} [small_category ... |
6051f390a84f90f9b2d13b26409e9dce6d9b7772 | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /tests/lean/run/binrel.lean | e7bceba7afb298f94ba4f1fe99eec4e0ff697025 | [
"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 | 816 | lean | def ex1 (x y : Nat) (i j : Int) :=
binrel% Less x i
def ex2 (x y : Nat) (i j : Int) :=
binrel% Less i x
def ex3 (x y : Nat) (i j : Int) :=
binrel% Less (i + 1) x
def ex4 (x y : Nat) (i j : Int) :=
binrel% Less i (x + 1)
def ex5 (x y : Nat) (i j : Int) :=
binrel% Less i (x + y)
def ex6 (x y : Nat) (i j : ... |
d3493692baae9bbb46f72f11f64c7221d677969e | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/ll_infer_type_bug.lean | a71ae60d60540ac1d8d57e20d2310254a515a5d0 | [
"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 | 508 | lean |
partial def f : List Nat β Bool
| [] => false
| (a::as) => a > 0 && f as
#print f._cstage2
#exit
mutual def f1, f2, f3, f4, f5
with f1 : Nat β Bool
| 0 := f3 0
| x := f2 x
with f2 : Nat β Bool
| 0 := f4 0
| x := f3 x
with f3 : Nat β Bool
| 0 := f5 0
| x := f4 x
with f4 : Nat β Bool
| 0 := f5 0
| (x+1) := f... |
2cc1304d91ee05266adcebe0f81b7b64944187d9 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/interactive/goal_info.lean | d0dc0a32b928c4e69e38e3915406c8a6830b550a | [
"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 | 926 | lean | constant addc {a b : nat} : a + b = b + a
constant addassoc {a b c : nat} : (a + b) + c = a + (b + c)
constant zadd (a : nat) : 0 + a = a
open nat
example : β n m : β, n + m = m + n :=
begin
intros n m,
induction m with m' ih,
--^ "command": "info"
{ change n + 0 = 0 + n, simp [zadd] },
... |
64dd47489ddcc1e4a2c4ab9a3bb10ca7608ec5fc | 1e3a43e8ba59c6fe1c66775b6e833e721eaf1675 | /src/algebra/order_functions.lean | 705457594b56c84cea1b614da1267a2de01e9292 | [
"Apache-2.0"
] | permissive | Sterrs/mathlib | ea6910847b8dfd18500486de9ab0ee35704a3f52 | d9327e433804004aa1dc65091bbe0de1e5a08c5e | refs/heads/master | 1,650,769,884,257 | 1,587,808,694,000 | 1,587,808,694,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 13,209 | 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 algebra.ordered_group
universes u v
variables {Ξ± : Type u} {Ξ² : Type v}
attribute [simp] max_eq_left max_eq_right min_eq_left min_eq_right
/-- A function `f... |
0b4a49f3ff8a69b002d868845fdbe53cd5ffa0c4 | ae1e94c332e17c7dc7051ce976d5a9eebe7ab8a5 | /src/Lean/Elab/Term.lean | bd0e737ac248089adc3d180ee8768c9f3e7dae8c | [
"Apache-2.0"
] | permissive | dupuisf/lean4 | d082d13b01243e1de29ae680eefb476961221eef | 6a39c65bd28eb0e28c3870188f348c8914502718 | refs/heads/master | 1,676,948,755,391 | 1,610,665,114,000 | 1,610,665,114,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 60,403 | 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.ResolveName
import Lean.Util.Sorry
import Lean.Structure
import Lean.Meta.ExprDefEq
import Lean.Meta.AppBuilder
import Lean.Meta.SynthInstance
i... |
dd3cd68f26abc9453b62dacb4a0eb067795ec6ca | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/category/Group/equivalence_Group_AddGroup.lean | 00d5f4ec4861710b5d352eca35c7070706c8110f | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 2,675 | lean | /-
Copyright (c) 2022 Jujian Zhang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jujian Zhang
-/
import algebra.category.Group.basic
import algebra.hom.equiv.type_tags
/-!
# Equivalence between `Group` and `AddGroup`
This file contains two equivalences:
* `Group_Ad... |
42dc7e0ea46a061fbde445eaa179019c8f2d5ac1 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/combinatorics/simple_graph/trails.lean | 607ac8ab2d38a7a319b9eee6adc567f275850590 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 5,928 | lean | /-
Copyright (c) 2022 Kyle Miller. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kyle Miller
-/
import combinatorics.simple_graph.connectivity
import data.nat.parity
/-!
# Trails and Eulerian trails
This module contains additional theory about trails, including Eul... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.