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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
b23a643cdf40300cd7cb9df77186b37b59aa47be | af58757c0ea0692dc50b847d50227363bf9b45bc | /src/utils/finvec.lean | 4a74b5433e3feb9b994e0361342d7532d66a2188 | [] | no_license | alyata/fol_lean | b5ca6a8e0adbbe4362bb31ea2ad21d4b40f8fd0a | 5f2846e3e88d26712556697dd87b323fe7e6289f | refs/heads/master | 1,682,445,984,511 | 1,622,871,465,000 | 1,622,871,465,000 | 372,267,980 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,247 | lean | import data.fin
namespace fin
def to_nat {n : ℕ} : fin n → ℕ := (fin.fin_to_nat n).coe
def vec (n : ℕ) (U : Type) : Type := fin n → U
def dvec (n : ℕ) (U : fin n → Type) : Type := ∀(k : fin n), U k
def vec_to_dvec {n : ℕ} {U : Type} (v : vec n U) : dvec n (λ_, U) := v
def map {U V: Type} {n : ℕ} (f : U → V) (v : v... |
9ad859a023d81d3167c93265cd82f94c322f4e90 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/data/basic_auto.lean | d5e3f1d3cf3c6ae4938844e50d9a44bff27ec707 | [] | 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 | 1,051 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.data.setoid
import Mathlib.Lean3Lib.init.data.quot
import Mathlib.Lean3Lib.init.data.bool.basic
import M... |
4f6087ff60572782fc721bd8f103bca2627b4b16 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/run/apply3.lean | eb519fca6dc62c392153082dd4a9673f7e3024fb | [
"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 | 612 | lean | open tactic
print "------- fapply version ----------"
example (a : nat) : ∃ x : nat, x = a :=
by do
c₁ ← return (expr.const `Exists.intro [level.of_nat 1]),
fapply c₁, /- fapply adds all unassigned variables -/
trace_state,
swap, /- swap witness and ?M = a -/
a ← get_local `a,
mk_app `eq.refl [a] >>= exac... |
75768ac4a88a39495fc5b18bcfaa27f2f1806bce | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/algebra/big_operators/basic.lean | 968069b1da3dc70222619b3507b30c02d674c06d | [
"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 | 46,147 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
-/
import data.finset.fold
import data.equiv.mul_add
import tactic.abel
/-!
# Big operators
In this file we define products and sums indexed by finite sets (specifica... |
0cf3eb7a5191c7215020d090ab39546cdb06a5df | b7f22e51856f4989b970961f794f1c435f9b8f78 | /library/algebra/order_bigops.lean | 9e3c54ab903fe9967b35af0f5075df6486f99941 | [
"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 | 18,997 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
Min and max over finite sets.
To support constructive theories, we start with the class
decidable_linear_ordered_cancel_comm_monoid, because:
(1) We need a decidable lin... |
8ba25bdbe49871945a22ed61a9a0b4171f244fe2 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/nat/choose/dvd_auto.lean | ad00bdd8246539c4a4eabe4da2803c3863ca3fef | [] | 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 | 718 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Patrick Stevens
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.nat.choose.basic
import Mathlib.data.nat.prime
import Mathlib.PostPort
n... |
00b135d6b48df42872bed72d1f15dcf3becef996 | 8c02fed42525b65813b55c064afe2484758d6d09 | /src/spec/irstate.lean | 4c829c14f22acf94b409f2121698a2f164a6d26b | [
"LicenseRef-scancode-generic-cla",
"MIT"
] | permissive | microsoft/AliveInLean | 3eac351a34154efedd3ffc4fe2fa4ec01b219e0d | 4b739dd6e4266b26a045613849df221374119871 | refs/heads/master | 1,691,419,737,939 | 1,689,365,567,000 | 1,689,365,568,000 | 131,156,103 | 23 | 18 | NOASSERTION | 1,660,342,040,000 | 1,524,747,538,000 | Lean | UTF-8 | Lean | false | false | 12,249 | lean | -- Copyright (c) Microsoft Corporation. All rights reserved.
-- Licensed under the MIT license.
import .spec
import .lemmas
import ..irsem
namespace spec
open irsem
/-
- Lemmas about regfile.
-/
-- Induction principle of regfile.
lemma regfile.induction: ∀ {sem} {P: regfile sem → Prop}
{HP0: P (@regfile.empt... |
4ab7d26fc8189f9b26f6319ab0c9415197186dc6 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /library/algebra/category/functor.lean | f8164838fee5533ff747e79ec38050dfca8524e4 | [
"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 | 4,271 | 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
-/
import .basic
import logic.cast
open function
open category eq eq.ops heq
structure functor (C D : Category) : Type :=
(object : C → D)
(morphism : Π⦃a b : C⦄... |
26811a06f66ad9665dcf1117e17fcbed60c1ae09 | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /src/Lean/Compiler/LCNF/DependsOn.lean | baf134a959bc4a9062cae9dfbc8b136f53204ef9 | [
"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,542 | 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.Basic
namespace Lean.Compiler.LCNF
private abbrev M := ReaderT FVarIdSet Id
private def fvarDepOn (fvarId : FVarId) : M Bool :=... |
3e49725a6ef70cd62e590e194cae81323a85a523 | 750acab0c635b67751bcfec43c5411aa3941c441 | /sipser.lean | 5b93baaf983c2e169400b42b988fdf5b18301432 | [] | no_license | nthomas103/lean_work | 912f8e662cdd73ba97f5d3655ddb8a5d2cd204c9 | 7e9785cae2b60a77b41922fd5d5b159a1fae415c | refs/heads/master | 1,586,739,169,355 | 1,455,759,226,000 | 1,455,759,226,000 | 50,978,095 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,218 | lean | import standard algebra.order_bigops
open algebra fin finset num nat fintype stream prod prod.ops list set
open sigma sigma.ops decidable
structure turing_machine (Q Γ : Type) :=
[fintypeQ : fintype Q]
[fintypeΓ : fintype Γ]
[dec_eqQ : decidable_eq Q]
(b : Γ) --TODO maybe should require that b in not in the input
(q₀... |
3015d96944935717019f5fc6be58d128ca964aa5 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/nestedWF.lean | d0afa3933958e2a3c39000333d6b516090b785ae | [
"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 | 946 | lean | namespace Ex1
mutual
def h (c : Nat) (x : Nat) := match g c x c c with
| 0 => 1
| r => r + 2
def g (c : Nat) (t : Nat) (a b : Nat) : Nat := match t with
| (n+1) => match g c n a b with
| 0 => 0
| m => match g c (n - m) a b with
| 0 => 0
| m + 1 => g c m a b
| 0 => f c 0
def f (c : Nat) (x :... |
fe075c15b107831a2046bebfd759aad4bf0945f0 | 70f8755415fa7a17f87402cde4651e9f4db1b5bb | /src/mvpfunctor/M.lean | 6ba1a7fbcd6da3dc496af8acc3d6ecc28226515b | [
"Apache-2.0"
] | permissive | shingarov/qpf | ab935dc2298db12c87ac011a2e4d2c27e0bdef4b | debe2eacb8cf46b21aba2eaf3f2e20940da0263b | refs/heads/master | 1,653,705,576,607 | 1,570,136,035,000 | 1,570,136,035,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,164 | lean | /-
Copyright (c) 2018 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad, Mario Carneiro
The M construction as a multivariate polynomial functor.
-/
import mvpfunctor.basic pfunctor
universe u
namespace mvpfunctor
open typevec
variables {n : ... |
1881f2f9bffac164dd2e79a99b4878ce77c23c0c | 0845ae2ca02071debcfd4ac24be871236c01784f | /library/init/lean/compiler/externattr.lean | 3e17b239fedb6ab04613f96c0d5c90889c4d74a8 | [
"Apache-2.0"
] | permissive | GaloisInc/lean4 | 74c267eb0e900bfaa23df8de86039483ecbd60b7 | 228ddd5fdcd98dd4e9c009f425284e86917938aa | refs/heads/master | 1,643,131,356,301 | 1,562,715,572,000 | 1,562,715,572,000 | 192,390,898 | 0 | 0 | null | 1,560,792,750,000 | 1,560,792,749,000 | null | UTF-8 | Lean | false | false | 6,612 | 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
-/
prelude
import init.data.option.basic
import init.lean.expr
import init.lean.environment
import init.lean.attributes
import init.lean.projfns
namespace Lea... |
bfbc8a8e9425d946efe9ea6bf47f68116c194d3c | 5d166a16ae129621cb54ca9dde86c275d7d2b483 | /library/init/data/option/instances.lean | 7397a497afa5431e518eff0304d25e949dc2cba9 | [
"Apache-2.0"
] | permissive | jcarlson23/lean | b00098763291397e0ac76b37a2dd96bc013bd247 | 8de88701247f54d325edd46c0eed57aeacb64baf | refs/heads/master | 1,611,571,813,719 | 1,497,020,963,000 | 1,497,021,515,000 | 93,882,536 | 1 | 0 | null | 1,497,029,896,000 | 1,497,029,896,000 | null | UTF-8 | Lean | false | false | 1,382 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.data.option.basic
import init.meta.tactic
universes u v
@[inline] def option_bind {α : Type u} {β : Type v} : option α → (α → option β... |
8c0cc26b603019a3c2c414940e9c61f1af7aad16 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/unzip_bug.lean | 914789109ed078c238c39a4a6eeeeb5b7dc2d3b1 | [
"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 | 406 | lean | import data.examples.vector
open nat vector prod
variables {A B : Type}
definition unzip : Π {n : nat}, vector (A × B) n → vector A n × vector B n
| @unzip ⌞zero⌟ nil := (nil, nil)
| @unzip ⌞succ n⌟ ((a, b) :: v) :=
match unzip v with
(va, vb) := (a :: va, b :: vb)
end
example : unzip ((1, 20) :: ... |
10972c8ac8d051b024ea7a9fd78f2323586f596b | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/pfunctor/multivariate/basic.lean | 1e0dacfdec7d7a2c0e34fd82ef1a813201dbc7cd | [
"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 | 6,513 | lean | /-
Copyright (c) 2018 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Simon Hudon
-/
import control.functor.multivariate
import data.pfunctor.univariate.basic
/-!
# Multivariate polynomial functors.
Multivariate polynomial functors are us... |
8bc7b067d819d565b7239cef4365dbba7e2d3492 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/playground/flat_parser2.lean | 790edd21da19c8c6f41a75ec8b2a0bb74ae8362e | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | EdAyers/lean4 | 57ac632d6b0789cb91fab2170e8c9e40441221bd | 37ba0df5841bde51dbc2329da81ac23d4f6a4de4 | refs/heads/master | 1,676,463,245,298 | 1,660,619,433,000 | 1,660,619,433,000 | 183,433,437 | 1 | 0 | Apache-2.0 | 1,657,612,672,000 | 1,556,196,574,000 | Lean | UTF-8 | Lean | false | false | 17,139 | lean | import init.Lean.Message init.Lean.Parser.Syntax init.Lean.Parser.Trie init.Lean.Parser.basic
import init.Lean.Parser.token
namespace Lean
namespace flatParser
open String
open Parser (Syntax Syntax.missing Syntax.atom Syntax.ident Syntax.rawNode number stringLit)
open Parser (Trie TokenMap)
def maxPrec : Nat := 1024
... |
32d746b4f1b37de4f1565afff349a93a8cc0a377 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/limits/preserves/shapes/kernels.lean | 7f916b5db6c08ca01b1d8bac76f182ae1fcb3559 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 8,750 | lean | /-
Copyright (c) 2022 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.kernels
import category_theory.limits.preserves.shapes.zero
/-!
# Preserving (co)kernels
> THIS FILE IS SYNCHRONIZED WITH MATHL... |
d14576e86597c54ecbd53c9bff9ad1d62a512b87 | f6fc81bc8b5b766295e383d57865e4a9d2ea12c9 | /exercise/1-exercise.lean | c7b8734fb89c28b2337ab2c8dba422e153c8d5d7 | [
"CC-BY-4.0"
] | permissive | locnh2012/formalabstracts | ef43b9bbf31bc8c448bc6628a9b936253f351964 | 67bec3c68a962718528f5b968b739bd889be69b7 | refs/heads/master | 1,584,616,125,965 | 1,529,294,544,000 | 1,529,294,700,000 | 136,434,328 | 0 | 0 | null | 1,528,354,107,000 | 1,528,354,106,000 | null | UTF-8 | Lean | false | false | 1,324 | lean | open set
-- Twin Prime Conjecture --
def isPrime (n : ℕ) : Prop := (n ≥ 2) ∧ (∀ m : ℕ, m ≥ 1 ∧ m ∣ n → (m = 1 ∨ m =n))
#check isPrime
def twinPrime(p : ℕ) : Prop := isPrime(p) ∧ (∃ q : ℕ, (q = p + 2 ∨ q = p - 2) ∧ isPrime(q))
#check twinPrime
theorem infinite_twin_prime: ∀ n : ℕ, ∃ p, p ≥ n ∧ twinPrime(p) :=
begin
a... |
7ef76c92924c0b9161b7e7a02c21c55e1b885f56 | c31182a012eec69da0a1f6c05f42b0f0717d212d | /src/polyhedral_lattice/topology.lean | 45817b13ca245a7c4aa41185b38ba578206f0d0a | [] | 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 | 4,072 | lean | import polyhedral_lattice.basic
import normed_group.pseudo_normed_group
import pseudo_normed_group.profinitely_filtered
noncomputable theory
open_locale nnreal big_operators
namespace polyhedral_lattice
open pseudo_normed_group normed_group
variables (Λ : Type*) [polyhedral_lattice Λ]
lemma filtration_finite (ε : ... |
413a8e7de264ba733759971b7865dede0370cde2 | 01ae0d022f2e2fefdaaa898938c1ac1fbce3b3ab | /categories/natural_isomorphism.lean | 8f37c710cede0cb2ea7382e4f75a94af0f73c619 | [] | no_license | PatrickMassot/lean-category-theory | 0f56a83464396a253c28a42dece16c93baf8ad74 | ef239978e91f2e1c3b8e88b6e9c64c155dc56c99 | refs/heads/master | 1,629,739,187,316 | 1,512,422,659,000 | 1,512,422,659,000 | 113,098,786 | 0 | 0 | null | 1,512,424,022,000 | 1,512,424,022,000 | null | UTF-8 | Lean | false | false | 6,734 | 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 .isomorphism
import .functor_categories
open categories
open categories.isomorphism
open categories.functor
open categories.f... |
5b67ed7d313fb6d2e3ce42e7b5b8d3a897f74261 | 853df553b1d6ca524e3f0a79aedd32dde5d27ec3 | /src/combinatorics/composition.lean | 43062462382a20858e37b58b04e651dbab5edfe2 | [
"Apache-2.0"
] | permissive | DanielFabian/mathlib | efc3a50b5dde303c59eeb6353ef4c35a345d7112 | f520d07eba0c852e96fe26da71d85bf6d40fcc2a | refs/heads/master | 1,668,739,922,971 | 1,595,201,756,000 | 1,595,201,756,000 | 279,469,476 | 0 | 0 | null | 1,594,696,604,000 | 1,594,696,604,000 | null | UTF-8 | Lean | false | false | 34,350 | lean | /-
Copyright (c) 2020 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import data.fintype.card
import data.finset.sort
/-!
# Compositions
A composition of an integer `n` is a decomposition `n = i₀ + ... + i_{k-1}` of `n` into a ... |
d0ac15496249d1b34056bda9c453552256feb7bd | 97f752b44fd85ec3f635078a2dd125ddae7a82b6 | /hott/algebra/homotopy_group.hlean | 272bbab7961ef21243a8076b297c09e057817dd7 | [
"Apache-2.0"
] | permissive | tectronics/lean | ab977ba6be0fcd46047ddbb3c8e16e7c26710701 | f38af35e0616f89c6e9d7e3eb1d48e47ee666efe | refs/heads/master | 1,532,358,526,384 | 1,456,276,623,000 | 1,456,276,623,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,182 | hlean | /-
Copyright (c) 2015 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
homotopy groups of a pointed space
-/
import types.pointed .trunc_group .hott types.trunc
open nat eq pointed trunc is_trunc algebra
namespace eq
definition p... |
328a75b8ca050be812f847ebb6ced0d779f577b3 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/number_theory/liouville/basic.lean | 4b8f19321aa89fe0b44b807061d08bbf9e874968 | [
"Apache-2.0"
] | permissive | urkud/mathlib | eab80095e1b9f1513bfb7f25b4fa82fa4fd02989 | 6379d39e6b5b279df9715f8011369a301b634e41 | refs/heads/master | 1,658,425,342,662 | 1,658,078,703,000 | 1,658,078,703,000 | 186,910,338 | 0 | 0 | Apache-2.0 | 1,568,512,083,000 | 1,557,958,709,000 | Lean | UTF-8 | Lean | false | false | 12,389 | lean | /-
Copyright (c) 2020 Jujian Zhang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Damiano Testa, Jujian Zhang
-/
import analysis.calculus.mean_value
import data.polynomial.denoms_clearable
import data.real.irrational
/-!
# Liouville's theorem
This file contains a pr... |
16a2149237e0ce16bb46e61e611c6a4fe655b3ee | 5719a16e23dfc08cdea7a5bf035b81690f307965 | /src/Init/Lean/Elab/Command.lean | 2f784b319e11f47241232e04ebbf90cd25745fe2 | [
"Apache-2.0"
] | permissive | postmasters/lean4 | 488b03969a371e1507e1e8a4df9ebf63c7cbe7ac | f3976fc53a883ac7606fc59357d43f4b51016ca7 | refs/heads/master | 1,655,582,707,480 | 1,588,682,595,000 | 1,588,682,595,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 25,701 | 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
-/
prelude
import Init.Lean.Elab.Alias
import Init.Lean.Elab.Log
import Init.Lean.Elab.ResolveName
import Init.Lean.Elab.Term
import Init.Lean.Elab.Binders
imp... |
27d5d4bbf14a8a8531e1f6f8399e63fde0aaefad | 2c41ae31b2b771ad5646ad880201393f5269a7f0 | /Lean/Qualities/Adaptable.lean | 3222c3bac50c917a7718470eb9385c1418e0b1b3 | [] | 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 | -- Adaptable
/-
[Adaptable] is parameterized by an instance of type [SystemType], and it's a sub-attribute to [Flexible].
An instance of type [SystemType] is deemed [Adaptable] if and only if all the requirements are satisfied.
-/
import SystemModel.System
inductive Adaptable (sys_type: SystemType): Prop
| ... |
d6528be175729597c809c830bbd174f2f7bbbb63 | a07fc1a5c10c8dc40360ecb554c3aed54740f945 | /src/mwe1.lean | b638a325aef09d43a466793ab16aae7d140d74e3 | [] | no_license | mkummini/ideal-membership | 2a39b4b07d61f2177d7e584a53b5b2279097b150 | 59f823e657939e386d0e53a5d9be47392bab3e41 | refs/heads/master | 1,690,298,605,933 | 1,629,856,697,000 | 1,629,856,697,000 | 384,842,535 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 548 | lean | import data.mv_polynomial.basic
import data.mv_polynomial.comm_ring
import data.zmod.basic
open mv_polynomial
noncomputable theory
section
abbreviation R := mv_polynomial (fin 6) (zmod 101)
def f : R := (X 0)*(X 1)*(X 2) - (X 3)*(X 4)*(X 5)
def g : R := (X 0)*(X 1)*(X 2)
def h : R := (X 3)*(X 4)*(X 5)
#check R
... |
e16fcc7cb86e18ccb33516774f6fd8ccfd609591 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/algebra/hom/units.lean | 6cc9dfd51b438fdef7474bcee2724401454940e7 | [
"Apache-2.0"
] | permissive | urkud/mathlib | eab80095e1b9f1513bfb7f25b4fa82fa4fd02989 | 6379d39e6b5b279df9715f8011369a301b634e41 | refs/heads/master | 1,658,425,342,662 | 1,658,078,703,000 | 1,658,078,703,000 | 186,910,338 | 0 | 0 | Apache-2.0 | 1,568,512,083,000 | 1,557,958,709,000 | Lean | UTF-8 | Lean | false | false | 12,075 | lean | /-
Copyright (c) 2018 Johan Commelin All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Chris Hughes, Kevin Buzzard
-/
import algebra.hom.group
/-!
# Monoid homomorphisms and units
This file allows to lift monoid homomorphisms to group homomorphisms of th... |
9668d372da5f3c2276f483367c731e5343f9bf92 | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /src/category_theory/limits/shapes/pullbacks.lean | bf75ebb90eff0ebc98bf8c1e6523a78ec48595ad | [
"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 | 25,588 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Markus Himmel, Bhavik Mehta
-/
import category_theory.limits.shapes.finite_limits
import category_theory.limits.shapes.wide_pullbacks
import category_theory.limits.shap... |
e0f22c9b2963b6c0df61d13d17b6f4f208f1dc3b | a726f88081e44db9edfd14d32cfe9c4393ee56a4 | /world_experiments/world9/level1.lean | dea71adf970d9bb1f4c1d904e44b2a4b35618797 | [] | no_license | b-mehta/natural_number_game | 80451bf10277adc89a55dbe8581692c36d822462 | 9faf799d0ab48ecbc89b3d70babb65ba64beee3b | refs/heads/master | 1,598,525,389,186 | 1,573,516,674,000 | 1,573,516,674,000 | 217,339,684 | 0 | 0 | null | 1,571,933,100,000 | 1,571,933,099,000 | null | UTF-8 | Lean | false | false | 3,032 | lean | import game.world4.level7 -- hide
import mynat.le
namespace mynat -- hide
-- World name : Inequality world
/- Axiom : le_def (a b : mynat) :
a ≤ b ↔ ∃ c, b = a + c
-/
/-
# World 5 : Inequality world
A new level, a new import. By the way, you can take a look at the actual files
being imported by going to the sour... |
f0415d3e7f9484377c266fdfabd1bd60f68f3d4b | c777c32c8e484e195053731103c5e52af26a25d1 | /src/algebra/quaternion.lean | c465eb0e0fb6850d5d410960445a7c3e66874f34 | [
"Apache-2.0"
] | permissive | kbuzzard/mathlib | 2ff9e85dfe2a46f4b291927f983afec17e946eb8 | 58537299e922f9c77df76cb613910914a479c1f7 | refs/heads/master | 1,685,313,702,744 | 1,683,974,212,000 | 1,683,974,212,000 | 128,185,277 | 1 | 0 | null | 1,522,920,600,000 | 1,522,920,600,000 | null | UTF-8 | Lean | false | false | 35,448 | 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 algebra.algebra.equiv
import linear_algebra.finrank
import linear_algebra.free_module.basic
import linear_algebra.free_module.finite.basic
import set_theory.... |
25bab4f7d8c4341ec14248bc4121c7fbc2fee2ff | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /tests/lean/uintCtors.lean | b19594c36a6feb2513c90bbf23026c60e61e061b | [
"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 | 1,391 | lean | def UInt32.ofNatCore' (n : Nat) (h : n < UInt32.size) : UInt32 := {
val := { val := n, isLt := h }
}
#eval UInt32.ofNatCore' 10 (by decide)
def UInt64.ofNatCore' (n : Nat) (h : n < UInt64.size) : UInt64 := {
val := { val := n, isLt := h }
}
#eval UInt64.ofNatCore' 3 (by decide)
#eval toString $ { val := { val :... |
f3524e9d761e3046ab77ca2bd2df9216643ca0bb | b7fc5b86b12212bea5542eb2c9d9f0988fd78697 | /src/solutions/thursday/category_theory/exercise2.lean | b8569373a585b80fb9b6741686a5333eebd3da72 | [] | no_license | stjordanis/lftcm2020 | 3b16591aec853c8546d9c8b69c0bf3f5f3956fee | 1f3485e4dafdc587b451ec5144a1d8d3ec9b411e | refs/heads/master | 1,675,958,865,413 | 1,609,901,722,000 | 1,609,901,722,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,762 | lean | import algebra.category.CommRing.basic
import data.polynomial
/-!
Let's show that taking polynomials over a ring is functor `Ring ⥤ Ring`.
-/
noncomputable theory -- the default implementation of polynomials is noncomputable
-- Just ignore this for now: it's a hack that prevents an annoying problem,
-- and a cleaner... |
71e49a878e67ba4a2430343a58eed4ac198f3f39 | 6e44fda625e48340c6ffc7b1109a9e3b208e5384 | /src/metric_spaces/connected.lean | ae06e4ee182478733e2f84b586f389f801116bea | [] | no_license | JasonKYi/learn_mspaces | 9f998a265b907af6be6a54061637fcf1f6d1ee9d | 54083e81da420d2d362a7024a8c86bea8529fe66 | refs/heads/master | 1,619,008,842,896 | 1,609,897,382,000 | 1,609,897,382,000 | 249,780,600 | 5 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 11,084 | lean | import metric_spaces.basic
noncomputable theory
local attribute [instance] classical.prop_decidable
open set definitions
variables {α X : Type*} [metric_space X]
variables {Y : Type*} [metric_space Y]
namespace connected
/- We have some equivalent definitions for connected sets
- X is connected
↔ ∃ f : X → {0, 1... |
c9fc33cd44706df83ed396f24d34d07b0b73219a | e61a235b8468b03aee0120bf26ec615c045005d2 | /stage0/src/Init/Lean/Parser/Level.lean | 3c5ccd40d826af9d91004707cf296f4eebc0ce92 | [
"Apache-2.0"
] | permissive | SCKelemen/lean4 | 140dc63a80539f7c61c8e43e1c174d8500ec3230 | e10507e6615ddbef73d67b0b6c7f1e4cecdd82bc | refs/heads/master | 1,660,973,595,917 | 1,590,278,033,000 | 1,590,278,033,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,033 | 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
-/
prelude
import Init.Lean.Parser.Parser
namespace Lean
namespace Parser
@[init] def regBuiltinLevelParserAttr : IO Unit :=
registerBuilt... |
a4ea915ee57a139139680fedafac97529c83a158 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/analysis/calculus/conformal/normed_space.lean | a187e8103b8b76d84376ec1f76e3e70058eb3d31 | [
"Apache-2.0"
] | permissive | kbuzzard/mathlib | 2ff9e85dfe2a46f4b291927f983afec17e946eb8 | 58537299e922f9c77df76cb613910914a479c1f7 | refs/heads/master | 1,685,313,702,744 | 1,683,974,212,000 | 1,683,974,212,000 | 128,185,277 | 1 | 0 | null | 1,522,920,600,000 | 1,522,920,600,000 | null | UTF-8 | Lean | false | false | 4,735 | lean | /-
Copyright (c) 2021 Yourong Zang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yourong Zang
-/
import analysis.normed_space.conformal_linear_map
import analysis.calculus.fderiv.basic
/-!
# Conformal Maps
A continuous linear map between real normed spaces `X` and ... |
638c58e8ccd4b7b42a0ed65d6b118d4f437312e0 | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/algebra/geom_sum.lean | 0b1b7a89682eeb627ebfa56f69db77e2fcca09b9 | [
"Apache-2.0"
] | permissive | vaibhavkarve/mathlib | a574aaf68c0a431a47fa82ce0637f0f769826bfe | 17f8340912468f49bdc30acdb9a9fa02eeb0473a | refs/heads/master | 1,621,263,802,637 | 1,585,399,588,000 | 1,585,399,588,000 | 250,833,447 | 0 | 0 | Apache-2.0 | 1,585,410,341,000 | 1,585,410,341,000 | null | UTF-8 | Lean | false | false | 6,260 | lean | /-
Copyright (c) 2019 Neil Strickland. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Neil Strickland
Sums of finite geometric series
-/
import algebra.big_operators algebra.commute
universe u
variable {α : Type u}
open finset
/-- Sum of the finite geometric serie... |
a5c5ec236e98e7ac0d2b53dabadeadc942398a69 | d436468d80b739ba7e06843c4d0d2070e43448e5 | /src/tactic/lint.lean | f45eca9c1a2a2228f6d2d5f192cc6e27758f3588 | [
"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 | 22,638 | lean | /-
Copyright (c) 2019 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Robert Y. Lewis
-/
import tactic.core
/-!
# lint command
This file defines the following user commands to spot common mistakes in the code.
* `#lint`: check all dec... |
3c735b98fab2ab6a506c6e9602decad6bd86b62c | 3f7026ea8bef0825ca0339a275c03b911baef64d | /src/algebra/ring.lean | 62546e8ad3cc629bed96d78ac63147749ed8d5c6 | [
"Apache-2.0"
] | permissive | rspencer01/mathlib | b1e3afa5c121362ef0881012cc116513ab09f18c | c7d36292c6b9234dc40143c16288932ae38fdc12 | refs/heads/master | 1,595,010,346,708 | 1,567,511,503,000 | 1,567,511,503,000 | 206,071,681 | 0 | 0 | Apache-2.0 | 1,567,513,643,000 | 1,567,513,643,000 | null | UTF-8 | Lean | false | false | 22,062 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Floris van Doorn, Amelia Livingston
-/
import algebra.group
/-!
# Properties and homomorphisms of semirings and rings
This file proves simple proper... |
70077ce60f5797ca2c272f4d7cf985cc971b97e3 | 626e312b5c1cb2d88fca108f5933076012633192 | /src/group_theory/subgroup.lean | 524149b495fa9300349ddfd949f1432a1fa95b5c | [
"Apache-2.0"
] | permissive | Bioye97/mathlib | 9db2f9ee54418d29dd06996279ba9dc874fd6beb | 782a20a27ee83b523f801ff34efb1a9557085019 | refs/heads/master | 1,690,305,956,488 | 1,631,067,774,000 | 1,631,067,774,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 92,258 | lean | /-
Copyright (c) 2020 Kexing Ying. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kexing Ying
-/
import group_theory.submonoid
import group_theory.submonoid.center
import algebra.group.conj
import algebra.pointwise
import order.atoms
/-!
# Subgroups
This file defines... |
72fba5ec7c755bfc95f479ee13b2fa648f4ee7fc | 4727251e0cd73359b15b664c3170e5d754078599 | /src/measure_theory/integral/interval_integral.lean | b87b6813b61be7a90a7ea60a93c60ca9b01f9895 | [
"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 | 129,543 | 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, Patrick Massot, Sébastien Gouëzel
-/
import analysis.normed_space.dual
import data.set.intervals.disjoint
import measure_theory.measure.haar_lebesgue
import ana... |
81fa8d613706f8d62ee3c2ca0ee47f2e04f81a97 | 2385ce0e3b60d8dbea33dd439902a2070cca7a24 | /tests/lean/run/1675.lean | ded29e0040522a83a32f68c2a2713a0b5d85e0bb | [
"Apache-2.0"
] | permissive | TehMillhouse/lean | 68d6fdd2fb11a6c65bc28dec308d70f04dad38b4 | 6bbf2fbd8912617e5a973575bab8c383c9c268a1 | refs/heads/master | 1,620,830,893,339 | 1,515,592,479,000 | 1,515,592,997,000 | 116,964,828 | 0 | 0 | null | 1,515,592,734,000 | 1,515,592,734,000 | null | UTF-8 | Lean | false | false | 1,233 | lean | def foo (a b : nat) : Prop :=
a = 0 ∧ b = 0
attribute [simp] foo
example (p : nat → Prop) (a b : nat) : foo a b → p (a + b) → p 0 :=
begin
intros h₁ h₂,
simp * at *,
end
example (a b : nat) (p : nat → Prop) (h₁ : a = b + 0) (h₂ : b = 0) (h₃ : p a) : p 0 ∧ a = 0 :=
by simp * at *
constant q : Prop
axiom q_lemma ... |
0cd06f94cc80558a9cb7f63a30ed2ffe9e7fc5fa | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/padics/padic_numbers.lean | 78725dc1f1e7c681a7274ef58d464d326c7bb91e | [] | 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 | 22,888 | lean | /-
Copyright (c) 2018 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.padics.padic_norm
import Mathlib.analysis.normed_space.basic
import Mathlib.PostPor... |
1b72eee0bdb90410999d5335a686e5d48a57c72d | c777c32c8e484e195053731103c5e52af26a25d1 | /src/ring_theory/dedekind_domain/dvr.lean | 62b3fd3e1307b71764ab3d256e471f38b78a3226 | [
"Apache-2.0"
] | permissive | kbuzzard/mathlib | 2ff9e85dfe2a46f4b291927f983afec17e946eb8 | 58537299e922f9c77df76cb613910914a479c1f7 | refs/heads/master | 1,685,313,702,744 | 1,683,974,212,000 | 1,683,974,212,000 | 128,185,277 | 1 | 0 | null | 1,522,920,600,000 | 1,522,920,600,000 | null | UTF-8 | Lean | false | false | 7,333 | lean | /-
Copyright (c) 2020 Kenji Nakagawa. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenji Nakagawa, Anne Baanen, Filippo A. E. Nuccio
-/
import ring_theory.localization.localization_localization
import ring_theory.localization.submodule
import ring_theory.discrete_val... |
051c65029e57300903f8565a339ca66bf84fe2eb | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/computability/turing_machine.lean | 46544e741ba5edd7ed4d8ca61b1df44232ed9a30 | [
"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 | 67,542 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
Define a sequence of simple machine languages, starting with Turing
machines and working up to more complex lanaguages based on
Wang B-machines.
-/
import data.fintype d... |
81c1c9efcd56b270e3bd1945c65de690106c61e2 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/topology/metric_space/gromov_hausdorff.lean | d6b068acf48f90133088b1dbc3a9dd271ac05ab9 | [
"Apache-2.0"
] | permissive | kbuzzard/mathlib | 2ff9e85dfe2a46f4b291927f983afec17e946eb8 | 58537299e922f9c77df76cb613910914a479c1f7 | refs/heads/master | 1,685,313,702,744 | 1,683,974,212,000 | 1,683,974,212,000 | 128,185,277 | 1 | 0 | null | 1,522,920,600,000 | 1,522,920,600,000 | null | UTF-8 | Lean | false | false | 55,821 | 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 set_theory.cardinal.basic
import topology.metric_space.closeds
import topology.metric_space.completion
import topology.metric_space.gromov_hausdorff_real... |
113ce0a148ed82c2952c7305e14a379457e3b371 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/category_theory/derived.lean | 993ad9472f831a1490c026f9695ea7dc6cbcc67d | [
"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 | 7,638 | lean | /-
Copyright (c) 2021 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.preadditive.projective_resolution
/-!
# Left-derived functors
We define the left-derived functors `F.left_derived n : C ⥤ D` for any additive... |
56897e568778326d3b1b497d0f92ea73eac88946 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/category_theory/quotient.lean | 94b63d2b1c21ddd49c8ad8b0667c5ec4c8238694 | [
"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,666 | lean | /-
Copyright (c) 2020 David Wärn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Wärn
-/
import category_theory.natural_isomorphism
import category_theory.equivalence
import category_theory.eq_to_hom
/-!
# Quotient category
Constructs the quotient of a category... |
8db48e98572862b8dabc1f1d3454a8b36abd5f3e | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /counterexamples/canonically_ordered_comm_semiring_two_mul.lean | 9279565dfbcfa0a067fe692ddfcf8e4033b7a138 | [
"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 | 9,495 | lean | /-
Copyright (c) 2021 Damiano Testa. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Damiano Testa
-/
import data.zmod.basic
import ring_theory.subsemiring
import algebra.order.monoid
/-!
A `canonically_ordered_comm_semiring` with two different elements `a` and `b` suc... |
02b1a6de9e536af14c3e1e593be4152b3219ea1c | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/any_goals.lean | 3e91b7691129b2d50ba70a2bb662dffc52b88447 | [
"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 | 190 | lean | constant f : nat → nat
axiom fax : ∀ x, f x = x
example (a b c : nat) : b = c → f a = a ∧ c = b :=
begin
intros,
constructor,
any_goals {rw fax},
{symmetry, assumption}
end
|
a0aa8ec89fb1c0dce95aa83f46f98a8e065b6c3c | 4727251e0cd73359b15b664c3170e5d754078599 | /src/topology/vector_bundle.lean | 9a62e373990ca23c3f868557f0e73ab3141b1889 | [
"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 | 47,214 | lean | /-
Copyright © 2020 Nicolò Cavalleri. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nicolò Cavalleri, Sebastien Gouezel, Heather Macbeth, Patrick Massot
-/
import analysis.normed_space.bounded_linear_maps
import topology.fiber_bundle
/-!
# Topological vector bundles... |
3dcb7ed9c282d5dede4524d14193e1edf263d6ee | 969dbdfed67fda40a6f5a2b4f8c4a3c7dc01e0fb | /src/category_theory/limits/functor_category.lean | cf2cda5f48d7c112999974a02dec421bcc5f5761 | [
"Apache-2.0"
] | permissive | SAAluthwela/mathlib | 62044349d72dd63983a8500214736aa7779634d3 | 83a4b8b990907291421de54a78988c024dc8a552 | refs/heads/master | 1,679,433,873,417 | 1,615,998,031,000 | 1,615,998,031,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,547 | 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 category_theory.limits.preserves.limits
open category_theory category_theory.category
namespace category_theory.limits
universes v v₂ u -- declare the `v`'s... |
ae7e789ae6bfc1f9f3e349f0b56c0fe747501ae3 | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/eq3.lean | d37d59b1c15393b200a37b907d933d0e4aad5ccc | [
"Apache-2.0"
] | permissive | codyroux/lean0.1 | 1ce92751d664aacff0529e139083304a7bbc8a71 | 0dc6fb974aa85ed6f305a2f4b10a53a44ee5f0ef | refs/heads/master | 1,610,830,535,062 | 1,402,150,480,000 | 1,402,150,480,000 | 19,588,851 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 188 | lean | variable Vector : Nat -> Type
variable n : Nat
variable v1 : Vector n
variable v2 : Vector (n + 0)
variable v3 : Vector (0 + n)
axiom H1 : v1 == v2
axiom H2 : v2 == v3
check htrans H1 H2
|
da5ed8e2c96f7edbe162dd19fd4c6d0cb0abcaf5 | e030b0259b777fedcdf73dd966f3f1556d392178 | /tests/lean/run/ematch1.lean | 165488d59f9c08f45c712adc6382418f0733f7a0 | [
"Apache-2.0"
] | permissive | fgdorais/lean | 17b46a095b70b21fa0790ce74876658dc5faca06 | c3b7c54d7cca7aaa25328f0a5660b6b75fe26055 | refs/heads/master | 1,611,523,590,686 | 1,484,412,902,000 | 1,484,412,902,000 | 38,489,734 | 0 | 0 | null | 1,435,923,380,000 | 1,435,923,379,000 | null | UTF-8 | Lean | false | false | 781 | lean | constant f : nat → nat
constant g : nat → nat
axiom Ax : ∀ x, (: f (g x) :) = x
open tactic
meta def add_insts : list (expr × expr) → tactic unit
| [] := skip
| ((inst, pr)::r) := do
assertv `_einst inst pr,
add_insts r
meta def ematch_test (h : name) (e : expr) : tactic unit :=
do cc ← cc_state.mk... |
163e750b8ea87e0522f293d61c300ed19f917e71 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/ring_theory/polynomial.lean | 9488d0411fbde5807199ef96f81fc5755a21961b | [
"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 | 17,215 | lean | /-
Copyright (c) 2019 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
Ring-theoretic supplement of data.polynomial.
Main result: Hilbert basis theorem, that if a ring is noetherian then so is its polynomial ring.
-/
import data.equiv.fin data.pol... |
a2ae6eca97c2b310482f2773a7d7abd1661f3798 | 3446e92e64a5de7ed1f2109cfb024f83cd904c34 | /src/game/world5/level6.lean | 91b1be4c90cf29870db52ee61c2a3699ad9bbdeb | [] | no_license | kckennylau/natural_number_game | 019f4a5f419c9681e65234ecd124c564f9a0a246 | ad8c0adaa725975be8a9f978c8494a39311029be | refs/heads/master | 1,598,784,137,722 | 1,571,905,156,000 | 1,571,905,156,000 | 218,354,686 | 0 | 0 | null | 1,572,373,319,000 | 1,572,373,318,000 | null | UTF-8 | Lean | false | false | 1,998 | lean | import game.world5.level5 -- hide
namespace mynat -- hide
/-
# World 5 : Inequality world
## Level 6 : `le_antisymm`
In this level, it would be helpful if you knew about how to create extra
hypotheses in the middle of a proof.
Say you have a hypothesis `h : a + b = a`
and you remember back from world 2 level 12 t... |
ad30bba21f6c814a1f35eb16d09d208638b1ff22 | 137c667471a40116a7afd7261f030b30180468c2 | /src/measure_theory/decomposition.lean | ac03092ff1229b6eef722eaa812ef1565c70f94a | [
"Apache-2.0"
] | permissive | bragadeesh153/mathlib | 46bf814cfb1eecb34b5d1549b9117dc60f657792 | b577bb2cd1f96eb47031878256856020b76f73cd | refs/heads/master | 1,687,435,188,334 | 1,626,384,207,000 | 1,626,384,207,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,492 | 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
Hahn decomposition theorem
TODO:
* show general for signed measures (into ℝ)
-/
import measure_theory.measure_space
open set filter
open_locale classical topological_... |
9f33727b71aa1312ef3881ecad9295bd6c3a3042 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/lie/skew_adjoint.lean | 4242eeeb37ec86cdd353fb4f015fc3ff227c333e | [
"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 | 7,201 | lean | /-
Copyright (c) 2020 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import algebra.lie.matrix
import linear_algebra.matrix.bilinear_form
/-!
# Lie algebras of skew-adjoint endomorphisms of a bilinear form
When a module carries a bilinear ... |
e91c05f979cec1061880bde983bba3f9b538c477 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/974.lean | 0be5d5203b6649a7e2e4fc99e6fd160d8eaf0660 | [
"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 | 705 | lean | inductive Formula : Nat → Type u
| bot : Formula n
| imp (f₁ f₂ : Formula n ) : Formula n
| all (f : Formula (n+1)) : Formula n
def Formula.count_quantifiers : {n:Nat} → Formula n → Nat
| _, imp f₁ f₂ => f₁.count_quantifiers + f₂.count_quantifiers
| _, all f => f.count_quantifie... |
f9f8e80013bccc25ba74fb804bf7fc153482c8ff | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/nat_bug5.lean | 5b76a52e4dcc9a5a90755f3b0538ea9e32eb58aa | [
"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 | 1,313 | lean | import logic
open eq.ops eq
namespace foo
inductive nat : Type :=
| zero : nat
| succ : nat → nat
namespace nat
definition add (x y : nat) : nat := nat.rec x (λn r, succ r) y
infixl `+` := add
definition mul (n m : nat) := nat.rec zero (fun m x, x + n) m
infixl `*` := mul
axiom add_one (n:nat) : n + (succ zero) = suc... |
18368fca8f27506a960f57de8b7567062242c9e9 | 5ae26df177f810c5006841e9c73dc56e01b978d7 | /src/analysis/complex/polynomial.lean | 47adeb2a143834a94da63620bf45415aac44d460 | [
"Apache-2.0"
] | permissive | ChrisHughes24/mathlib | 98322577c460bc6b1fe5c21f42ce33ad1c3e5558 | a2a867e827c2a6702beb9efc2b9282bd801d5f9a | refs/heads/master | 1,583,848,251,477 | 1,565,164,247,000 | 1,565,164,247,000 | 129,409,993 | 0 | 1 | Apache-2.0 | 1,565,164,817,000 | 1,523,628,059,000 | Lean | UTF-8 | Lean | false | false | 6,027 | 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.polynomial topology.instances.polynomial analysis.complex.exponential
open complex polynomial metric filter is_absolute_value set lattice
namespace complex
... |
cf338ebdce9c6afe4155c6aba6c08e84529789cd | ce89339993655da64b6ccb555c837ce6c10f9ef4 | /bluejam/chap7/mybool.lean | 3e8a8bfa2c32c001a4e9cd748567a37cc421a044 | [] | no_license | zeptometer/LearnLean | ef32dc36a22119f18d843f548d0bb42f907bff5d | bb84d5dbe521127ba134d4dbf9559b294a80b9f7 | refs/heads/master | 1,625,710,824,322 | 1,601,382,570,000 | 1,601,382,570,000 | 195,228,870 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 722 | lean | namespace hidden
inductive bool : Type
| ff : bool
| tt : bool
open hidden.bool
def band (b1 b2 : bool) : bool :=
bool.cases_on b1 ff b2
def bnot (b1 : bool) : bool :=
bool.cases_on b1 tt ff
def bor (b1 b2 : bool) : bool :=
bool.cases_on b1 b2 tt
theorem band_comm (b1 b2 : bool) : band b1 b2 = band b2 b1 :=
begin
... |
ac93f52b89b9fa8306aed9c22b31ef1b6b97bc0f | 491068d2ad28831e7dade8d6dff871c3e49d9431 | /library/data/tuple.lean | eb144f47de327ae1c676d1beb54088ab6a312023 | [
"Apache-2.0"
] | permissive | davidmueller13/lean | 65a3ed141b4088cd0a268e4de80eb6778b21a0e9 | c626e2e3c6f3771e07c32e82ee5b9e030de5b050 | refs/heads/master | 1,611,278,313,401 | 1,444,021,177,000 | 1,444,021,177,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 11,058 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
Tuples are lists of a fixed size.
It is implemented as a subtype.
-/
import logic data.list data.fin
open nat list subtype function
definition tuple [reducibl... |
1fec4cdea915f77772239e94cb69a7f570723b68 | a4673261e60b025e2c8c825dfa4ab9108246c32e | /stage0/src/Lean/Data/Options.lean | cc3ad10181934373df9f20c42f1855fb46a4023f | [
"Apache-2.0"
] | permissive | jcommelin/lean4 | c02dec0cc32c4bccab009285475f265f17d73228 | 2909313475588cc20ac0436e55548a4502050d0a | refs/heads/master | 1,674,129,550,893 | 1,606,415,348,000 | 1,606,415,348,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,854 | lean | /-
Copyright (c) 2018 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich and Leonardo de Moura
-/
import Lean.Data.KVMap
namespace Lean
def Options := KVMap
def Options.empty : Options := {}
instance : Inhabited Options := ⟨Opti... |
4b0a8ec50243590247ba296bf9e76a89fc74010c | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /tests/lean/hidingInaccessibleNames.lean | c4ebdae1945eaec3ba97792201fd0852c20cff91 | [
"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 | 618 | lean | def f : (xs : List Nat) → Nat → xs ≠ [] → Nat
| [], _, _ => _
| [a,b], _, _ => _
| _, _, _ => _
set_option pp.inaccessibleNames true in
def f : (xs : List Nat) → Nat → xs ≠ [] → Nat
| [], _, _ => _
| [a,b], _, _ => _
| _, _, _ => _
theorem ex1 : p ∨ q → q ∨ p := by
intro h
cases h
traceState
appl... |
635defbcc42033e160728264828d06cdb24c6bd4 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/limits/preserves/shapes/products.lean | 751bb9de6af24b4bf6eb299a45b37799819ad27a | [
"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,649 | lean | /-
Copyright (c) 2020 Scott Morrison, Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Bhavik Mehta
-/
import category_theory.limits.shapes.products
import category_theory.limits.preserves.basic
/-!
# Preserving products
> THIS FILE IS SYN... |
e1938e8153c0f44cb86b7c7883cd6503b11957b4 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/1371.lean | 8de3b393af3126430146e80c3a2584a1a4cecf3a | [
"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 | 128 | lean | def f (stx : Lean.Syntax) :=
match stx with
| `($f $a) => 1
| `($_) => 2
| `($f $b) => 3
| _ => "hello"
|
7b9fbd73beeab5242d331ea7cc9264d555b1c186 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/704.lean | 1e4a305e7e3d5366b37e5eda029b2934fe569569 | [
"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 | 130 | lean | open classical
eval if true then 1 else (0:num)
attribute prop_decidable [instance] [priority 0]
eval if true then 1 else (0:num)
|
9154146aaee0185c1dfa07fb1ca2ab2ba70e1a6e | 798dd332c1ad790518589a09bc82459fb12e5156 | /analysis/topology/uniform_space.lean | 8f9ba23dba083495158ffa1de131880770e33df4 | [
"Apache-2.0"
] | permissive | tobiasgrosser/mathlib | b040b7eb42d5942206149371cf92c61404de3c31 | 120635628368ec261e031cefc6d30e0304088b03 | refs/heads/master | 1,644,803,442,937 | 1,536,663,752,000 | 1,536,663,907,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 83,313 | 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 uniform spaces.
Uniform spaces are a generalization of metric spaces and topological groups. Many concepts directly
generaliz... |
2756605a0c94e0d2fdefdba5503ee04e32434ea1 | fe84e287c662151bb313504482b218a503b972f3 | /src/exercises/loh/seminorms.lean | 5486c78db77411444c00e39ed6cd06dd98a37ffd | [] | no_license | NeilStrickland/lean_lib | 91e163f514b829c42fe75636407138b5c75cba83 | 6a9563de93748ace509d9db4302db6cd77d8f92c | refs/heads/master | 1,653,408,198,261 | 1,652,996,419,000 | 1,652,996,419,000 | 181,006,067 | 4 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 6,505 | lean | import data.real.basic
import algebra.category.Group.basic
import category_theory.functor category_theory.yoneda
import analysis.normed.group.SemiNormedGroup
notation `Ab` := AddCommGroup
universes u
noncomputable theory
open category_theory
instance : concrete_category Ab := by apply_instance
@[protect_proj, anc... |
ba03f1b49e5fee0d2eca52b99ee399e5399fbefa | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/category_theory/monoidal/internal/functor_category.lean | 11f40f0aa9533f4b4a8fe8a88af23c3240b60129 | [
"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 | 7,132 | 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.monoidal.CommMon_
import category_theory.monoidal.functor_category
/-!
# `Mon_ (C ⥤ D) ≌ C ⥤ Mon_ D`
When `D` is a monoidal category,
monoid ... |
a6d687ecb2a77006e07f289f46a5d72dde8e8330 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/data/finset/pairwise.lean | d71306e29b6c148d4f27fdf605cea003332f4c7a | [
"Apache-2.0"
] | permissive | kbuzzard/mathlib | 2ff9e85dfe2a46f4b291927f983afec17e946eb8 | 58537299e922f9c77df76cb613910914a479c1f7 | refs/heads/master | 1,685,313,702,744 | 1,683,974,212,000 | 1,683,974,212,000 | 128,185,277 | 1 | 0 | null | 1,522,920,600,000 | 1,522,920,600,000 | null | UTF-8 | Lean | false | false | 3,485 | lean | /-
Copyright (c) 2021 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies
-/
import data.finset.lattice
/-!
# Relations holding pairwise on finite sets
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding... |
a713ce0612c876215181615c1891497f9dbd288d | f3a5af2927397cf346ec0e24312bfff077f00425 | /src/game/world2/level2.lean | 605724b38b6d8f32a2b7310101ebcacb43624f8f | [
"Apache-2.0"
] | permissive | ImperialCollegeLondon/natural_number_game | 05c39e1586408cfb563d1a12e1085a90726ab655 | f29b6c2884299fc63fdfc81ae5d7daaa3219f9fd | refs/heads/master | 1,688,570,964,990 | 1,636,908,242,000 | 1,636,908,242,000 | 195,403,790 | 277 | 84 | Apache-2.0 | 1,694,547,955,000 | 1,562,328,792,000 | Lean | UTF-8 | Lean | false | false | 1,911 | lean | import mynat.definition -- hide
import mynat.add -- hide
import game.world2.level1 -- hide
namespace mynat -- hide
/-
# Addition world
Don't forget to use the drop down boxes on the left to see your tactics and
what you have proved so far.
## Level 2: `add_assoc` -- associativity of addition.
It's well-known that ... |
86c4c3498e90b1f069033c174d430f4b6e72d4c7 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/order/group/bounds.lean | 85767cd6b059e00038902148803e03580399f13e | [
"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,162 | 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, Yury Kudryashov
-/
import order.bounds.basic
import algebra.order.group.defs
/-!
# Least upper bound and the greatest lower bound in linear ordered additive commutativ... |
e295b2341b33954838e8f9fd8aaf1f55050dc3be | 78630e908e9624a892e24ebdd21260720d29cf55 | /src/logic_first_order/fol_20.lean | 7b47ede5e494a43908a3611f88843273b8c5c28a | [
"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 | 526 | lean | namespace fol_20
variable U : Type
variable R : U → U → Prop
theorem fol_20 : (∀ x y, R x y → R y x) → (∀ x y z, (R x y ∧ R y z) → R x z) →
(∀ x y, R x y → R x x) :=
assume h1: ∀ x y, R x y → R y x,
assume h2: ∀ x y z, (R x y ∧ R y z) → R x z,
assume t: U,
assume s: U,
have h3: R t s → R s t, from h1 t s,
have h4: ... |
6f633ae481e2df722f229ead7658ce71cf4ab37e | d436468d80b739ba7e06843c4d0d2070e43448e5 | /src/data/padics/padic_integers.lean | 43303ce7b1f4cbf509f56125b4a09112b17343c4 | [
"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 | 10,423 | lean | /-
Copyright (c) 2018 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis, Mario Carneiro
-/
import data.padics.padic_numbers ring_theory.ideals data.int.modeq
/-!
# p-adic integers
This file defines the p-adic integers ℤ_p as the subtype... |
c9335435e0d5e0e0ba17d128e8586299f0749b95 | f3be49eddff7edf577d3d3666e314d995f7a6357 | /TBA/Eulerian/Solution.lean | fe41b6fea55a21f3b065144a40ea3ad979c58cda | [] | no_license | IPDSnelting/tba-2021 | 8b930bcd2f4aae44a2ddc86e72b77f84e6d46e82 | b6390e55b768423d3266969e81d19290129c5914 | refs/heads/master | 1,686,754,693,583 | 1,625,135,602,000 | 1,625,136,365,000 | 355,124,341 | 50 | 7 | null | 1,625,133,762,000 | 1,617,699,824,000 | Lean | UTF-8 | Lean | false | false | 806 | lean | /- Eulerian circuits -/
/-
We provide you with a formalization of some facts about lists being equal up to permutation and
lists being sublists of their permutation
-/
import TBA.Eulerian.List
open List
namespace Eulerian
-- We model graphs as lists of pairs on a type with decidable equality.
variable {α : Type} (... |
1878691720cad1db244b5d566f8b0917baff430b | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/order/category/NonemptyFinLinOrd.lean | 6b649ed7be99ee421bae0c7bdbe669866043354d | [
"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 | 2,324 | 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 data.fintype.sort
import data.fin
import order.category.LinearOrder
/-! # Nonempty finite linear orders
Nonempty finite linear orders form the index categor... |
6062e8f970b8cea5af75b2730215c253cd000282 | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/group_theory/monoid_localization.lean | 4c4faa9ceddbf87ecf30b7b220f34bc2b6445df1 | [
"Apache-2.0"
] | permissive | vaibhavkarve/mathlib | a574aaf68c0a431a47fa82ce0637f0f769826bfe | 17f8340912468f49bdc30acdb9a9fa02eeb0473a | refs/heads/master | 1,621,263,802,637 | 1,585,399,588,000 | 1,585,399,588,000 | 250,833,447 | 0 | 0 | Apache-2.0 | 1,585,410,341,000 | 1,585,410,341,000 | null | UTF-8 | Lean | false | false | 13,992 | 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 group_theory.congruence
import algebra.associated
import algebra.punit_instances
/-!
# Localizations of commutative monoids
Localizing a commutative r... |
3b4593b7ee373892122ca2ed5360118ee8313586 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/field_theory/minpoly/is_integrally_closed.lean | 6a10a09a9738e44bac247266d025f2bdf69e4658 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 8,821 | lean | /-
Copyright (c) 2019 Riccardo Brasca. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Riccardo Brasca, Paul Lezeau, Junyan Xu
-/
import ring_theory.adjoin_root
import field_theory.minpoly.field
import ring_theory.polynomial.gauss_lemma
/-!
# Minimal polynomials over a... |
4efc744eb5e3d62e5163a8ff6f09a3224567ea19 | 205f0fc16279a69ea36e9fd158e3a97b06834ce2 | /src/02_True_False/00_intro.lean | 9afe02a95e2cec9501bee926be92c4966f4d4bce | [] | no_license | kevinsullivan/cs-dm-lean | b21d3ca1a9b2a0751ba13fcb4e7b258010a5d124 | a06a94e98be77170ca1df486c8189338b16cf6c6 | refs/heads/master | 1,585,948,743,595 | 1,544,339,346,000 | 1,544,339,346,000 | 155,570,767 | 1 | 3 | null | 1,541,540,372,000 | 1,540,995,993,000 | Lean | UTF-8 | Lean | false | false | 5,374 | lean | /-
So far, all of the propositions that we've
seen are in the form of assertions about
equalities: 0 = 0, 1 = 1, 2 + 3 = 4, and so
on. And we've seen how to prove propositions
of this kind (that are actually true) using
eq.refl and rfl as a shorthand.
We are now about to set out to explore the
different forms of propo... |
b240857746f3d1a8ae7097884b08bc5e7a6d55cf | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/group_theory/nielsen_schreier.lean | c36283d3646de7bb2509c0c55f6777a4a9e9ad28 | [
"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 | 12,088 | lean | /-
Copyright (c) 2021 David Wärn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Wärn
-/
import category_theory.action
import combinatorics.quiver.arborescence
import combinatorics.quiver.connected_component
import group_theory.is_free_group
/-!
# The Nielsen-Sch... |
6cc79819d2792d8379670274e6a233a2ab31a55f | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/basic_monitor2.lean | 9040b4878ba5988f84cf51cb098b4073953d5360 | [
"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 | 848 | lean | meta def get_file (fn : name) : vm format :=
do {
d ← vm.get_decl fn,
some n ← return (vm_decl.olean d) | failure,
return (to_fmt n)
}
<|>
return (to_fmt "<curr file>")
meta def pos_info (fn : name) : vm format :=
do {
d ← vm.get_decl fn,
some pos ← return (vm_decl.pos d) | failure,
file ← get_f... |
881ce919d06acb9d540e91876b2e7a5a74121311 | 8cb37a089cdb4af3af9d8bf1002b417e407a8e9e | /tests/lean/run/empty_set_inside_quotations.lean | 960fb6f996d811f46a0442b866938ead20fffe82 | [
"Apache-2.0"
] | permissive | kbuzzard/lean | ae3c3db4bb462d750dbf7419b28bafb3ec983ef7 | ed1788fd674bb8991acffc8fca585ec746711928 | refs/heads/master | 1,620,983,366,617 | 1,618,937,600,000 | 1,618,937,600,000 | 359,886,396 | 1 | 0 | Apache-2.0 | 1,618,936,987,000 | 1,618,936,987,000 | null | UTF-8 | Lean | false | false | 402 | lean | constant union_is_assoc {α} : is_associative (set α) (∪)
attribute [instance] union_is_assoc
#check ({} : set nat)
open tactic expr
meta def is_assoc_bin_app : expr → tactic (expr × expr)
| (app (app op a1) a2) := do h ← to_expr ``(is_associative.assoc %%op), return (op, h)
| _ := failed
#eval to... |
30fc9236432be2d8d4d2a3b75a358048f38128f0 | 64874bd1010548c7f5a6e3e8902efa63baaff785 | /tests/lean/run/inf_tree2.lean | 11636a5bda7f9556432ea262f1140a847a6063da | [
"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 | 1,119 | lean | import logic data.nat.basic
open nat
inductive inftree (A : Type) : Type :=
leaf : A → inftree A,
node : (nat → inftree A) → inftree A → inftree A
namespace inftree
inductive dsub {A : Type} : inftree A → inftree A → Prop :=
intro₁ : Π (f : nat → inftree A) (a : nat) (t : inftree A), dsub (f a) (node f t),
intr... |
3af2e302966b4278848f6156a9a278e5a87db544 | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/order/liminf_limsup.lean | 9a0e5e493cbb582d3f2a4c6b69e432e29c14419a | [
"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 | 16,957 | lean | /-
Copyright (c) 2018 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel, Johannes Hölzl
-/
import order.filter.partial
import order.filter.at_top_bot
/-!
# liminfs and limsups of functions and filters
Defines the Liminf/Limsup of a f... |
6da1da63dcf387f746f8ecc1f3183e7a6bcfcf78 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/topology/local_homeomorph.lean | f5acc6167e97aee5b2eae95aed3d4a9225c2c0a0 | [
"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 | 47,449 | 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 data.equiv.local_equiv
import topology.opens
/-!
# Local homeomorphisms
This file defines homeomorphisms between open subsets of topological spaces. An... |
a5c5ffd1598f3f29174cea36f100b22d370f1036 | 78630e908e9624a892e24ebdd21260720d29cf55 | /src/logic_first_order/fol_18.lean | 6912d544c9ac096242fd974ef0822db6d18608af | [
"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 | 565 | lean | namespace fol_18
variable U : Type
variables P Q : U → Prop
variable c : U
theorem fol_18 (h : ∃ x, P x ∧ Q x ∧ ∀ y, P y → x = y) : P c → Q c :=
assume h1: P c,
have h2: P c ∧ Q c ∧ ∀ y, P y → c = y, from exists.elim h
(assume s (h3: P s ∧ Q s ∧ ∀ y, P y → s = y),
have h4: _, from and.right h3,
have h5: _, fr... |
12d7c145c3ecbd2ec4440fe029859999e9694fbd | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/set_theory/game/nim.lean | b57ee3e96be3dc5a5e7cb8f00fbc293bbbd20f8c | [] | 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 | 6,609 | lean | /-
Copyright (c) 2020 Fox Thomson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Fox Thomson, Markus Himmel
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.nat.bitwise
import Mathlib.set_theory.game.impartial
import Mathlib.set_theor... |
632b17e9c65a67c36e45d8b32d1bdc88460c28ac | 0c1546a496eccfb56620165cad015f88d56190c5 | /library/init/core.lean | 377922527518bb2024f1a337b38b54da5ec4d91a | [
"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 | 17,894 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
notation, basic datatypes and type classes
-/
prelude
notation `Prop` := Sort 0
/- Logical operations and relations -/
reserve prefix `¬`:40
reserve prefix... |
1f082fc9dfa07e3081c5a19b79f9ccb163de956f | 4727251e0cd73359b15b664c3170e5d754078599 | /src/analysis/normed_space/basic.lean | d9c4f5b32215ec247f74a6e5685692242aa4c8fc | [
"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 | 22,501 | 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
-/
import analysis.normed.normed_field
import analysis.normed.group.infinite_sum
import data.matrix.basic
import topology.sequences
/-!
# Normed spaces
... |
bca033fefa04212894f28d9c1cd94f939324889a | 0c9c1ff8e5013c525bf1d72338b62db639374733 | /library/init/meta/interactive.lean | 25c9061ce794d6dc4f0565f888b2bedff3130ec9 | [
"Apache-2.0"
] | permissive | semorrison/lean | 1f2bb450c3400098666ff6e43aa29b8e1e3cdc3a | 85dcb385d5219f2fca8c73b2ebca270fe81337e0 | refs/heads/master | 1,638,526,143,586 | 1,634,825,588,000 | 1,634,825,588,000 | 258,650,844 | 0 | 0 | Apache-2.0 | 1,587,772,955,000 | 1,587,772,954,000 | null | UTF-8 | Lean | false | false | 73,588 | 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, Jannis Limperg
-/
prelude
import init.meta.tactic init.meta.type_context init.meta.rewrite_tactic init.meta.simp_tactic
import init.meta.smt.congruence_closur... |
1617cfd7caf14754eb8689102e5998401170e499 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebraic_topology/dold_kan/notations.lean | 0bfe1a14e6162fe85c1e95213f8076577818d0db | [
"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 | 780 | 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.alternating_face_map_complex
/-!
# Notations for the Dold-Kan equivalence
This file defines the notation `K[X] : chain_complex C ℕ` for the altern... |
0ad2396925a0a9c7182d10cdfb4b1c2a7f863403 | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/data/nat/totient.lean | 97859c572b98c4f696ffbd2e1d4ff2e760fad79d | [
"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 | 3,717 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import algebra.big_operators.basic
open finset
open_locale big_operators
namespace nat
/-- Euler's totient function. This counts the number of positive integers less t... |
4fd81067e519fc68bca053d0c963a4f8d76464f4 | 7cdf3413c097e5d36492d12cdd07030eb991d394 | /src/game/world1/level3.lean | 470710d5e9c4146233b41b727d10a9b4360676d3 | [] | no_license | alreadydone/natural_number_game | 3135b9385a9f43e74cfbf79513fc37e69b99e0b3 | 1a39e693df4f4e871eb449890d3c7715a25c2ec9 | refs/heads/master | 1,599,387,390,105 | 1,573,200,587,000 | 1,573,200,691,000 | 220,397,084 | 0 | 0 | null | 1,573,192,734,000 | 1,573,192,733,000 | null | UTF-8 | Lean | false | false | 4,434 | 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
/- Axiom : one_eq_succ_zero
1 = succ(0)
-/
/-
# World 1 : Tuto... |
dfdcaaf9fe45e5b95ad7d8b6d55c01303a567108 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/elabissues/bind_with_existential_types.lean | 6e571d9622711afd990b3138d1f91f0c9293f9aa | [
"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 | 1,560 | lean | /-
Problem: existential types do not play well with monads.
```
class HasBind (m : Type u → Type v) :=
(bind : ∀ {α β : Type u}, m α → (α → m β) → m β)
```
Even if we fix a universe-polymorphic monad M.{u v} : Type u -> Type v,
the bind operator forces the universes of the two applications of M to be the same.
So, we... |
31ab269a3d7bebb918c442c9131f4dd2f7bd1b54 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/probability/martingale/optional_stopping.lean | 3645319aa2ac2b0458f90e67db7b820b3c6e45e9 | [
"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 | 12,341 | lean | /-
Copyright (c) 2022 Kexing Ying. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kexing Ying
-/
import probability.process.hitting_time
import probability.martingale.basic
/-! # Optional stopping theorem (fair game theorem)
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.... |
0c010bc2438b00d75eb352ca5c3f904ed3aa9f9c | 206422fb9edabf63def0ed2aa3f489150fb09ccb | /src/computability/turing_machine.lean | 41b9350b4b86d4422d9394c69fbcda4e04ea7096 | [
"Apache-2.0"
] | permissive | hamdysalah1/mathlib | b915f86b2503feeae268de369f1b16932321f097 | 95454452f6b3569bf967d35aab8d852b1ddf8017 | refs/heads/master | 1,677,154,116,545 | 1,611,797,994,000 | 1,611,797,994,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 109,906 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
-/
import algebra.order
import data.fintype.basic
import data.pfun
import tactic.apply_fun
import logic.function.iterate
/-!
# Turing machines
This file defines a seque... |
b1e44f10cb236aa31ec1d073f18ca93687d2f9b0 | d0f9af2b0ace5ce352570d61b09019c8ef4a3b96 | /exam_2/satisfiability/exam2_test.lean | a5dcabad9c48694dae88d959bfee6dd0d8e56e5c | [] | no_license | jngo13/Discrete-Mathematics | 8671540ef2da7c75915d32332dd20c02f001474e | bf674a866e61f60e6e6d128df85fa73819091787 | refs/heads/master | 1,675,615,657,924 | 1,609,142,011,000 | 1,609,142,011,000 | 267,190,341 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,962 | lean | import .exam2
--import .satisfiability
#eval is_satisfiable true_intro
#eval is_satisfiable false_elim
#eval is_satisfiable true_imp
#eval is_satisfiable true_intro
#eval is_satisfiable false_elim
#eval is_satisfiable and_intro
#eval is_satisfiable and_elim_left
#eval is_satisfiable and_elim_right
#eval is_sa... |
a943908a8d6aa470e57bdf762d7d4caac0e519f9 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/algebraic_geometry/pullbacks.lean | d3fbcd6d6fb5a84c950d03f25d5e9071157d8aa4 | [
"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 | 27,450 | lean | /-
Copyright (c) 2022 Andrew Yang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Andrew Yang
-/
import algebraic_geometry.gluing
import category_theory.limits.opposites
import algebraic_geometry.Gamma_Spec_adjunction
/-!
# Fibred products of schemes
In this file we ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.