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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
6a7f2f9fa8b475884d535d17297e54b4cb8c351c | 969dbdfed67fda40a6f5a2b4f8c4a3c7dc01e0fb | /src/algebra/category/Group/basic.lean | 0d101c788ba6849ca43de21080d96d1df6bcb686 | [
"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 | 9,189 | lean | /-
Copyright (c) 2018 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import algebra.category.Mon.basic
import category_theory.endomorphism
/-!
# Category instances for group, add_group, comm_group, and add_comm_group.
We introduce th... |
568c112bf6e15474f93776d58f2f249bfca052b3 | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /src/Lean/Elab/Tactic/Simp.lean | 879c1877f8d2fe83342aa47484866336ef1eb9e0 | [
"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,592 | 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.Meta.Tactic.Simp
import Lean.Elab.Tactic.Basic
import Lean.Elab.Tactic.ElabTerm
import Lean.Elab.Tactic.Location
import Lean.Meta.Tactic.Replace... |
d8d5736427a686a1572fa64852762229f8fb045d | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/dynamics/ergodic/measure_preserving.lean | 99dae252876e28701c9120913ae31865f71cc108 | [
"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,564 | lean | /-
Copyright (c) 2021 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import measure_theory.prod
/-!
# Measure preserving maps
We say that `f : α → β` is a measure preserving map w.r.t. measures `μ : measure α` and
`ν : measure β` i... |
ab69132d5853e749573a0f4d11835cf80d75fc78 | 4fa161becb8ce7378a709f5992a594764699e268 | /src/category_theory/limits/shapes/zero.lean | 0650f0f818dad075df37cac4e6d00211b03259ea | [
"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 | 9,868 | lean | /-
Copyright (c) 2019 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.binary_products
import category_theory.limits.shapes.images
import category_theory.epi_mono
import category_theory.punit
/-!
# Z... |
f272fa97a100523bcca437c8cc5eddb595bb4b0a | aa101d73b1a3173c7ec56de02b96baa8ca64c42e | /src/my_exercises/04_exists.lean | 521aba1f8185c6b94d2f559d3bd4050d55d2597d | [
"Apache-2.0"
] | permissive | gihanmarasingha/tutorials | b554d4d53866c493c4341dc13e914b01444e95a6 | 56617114ef0f9f7b808476faffd11e22e4380918 | refs/heads/master | 1,671,141,758,153 | 1,599,173,318,000 | 1,599,173,318,000 | 282,405,870 | 0 | 0 | Apache-2.0 | 1,595,666,751,000 | 1,595,666,750,000 | null | UTF-8 | Lean | false | false | 3,310 | lean | import data.real.basic
import data.int.parity
/-
In this file, we learn how to handle the ∃ quantifier.
In order to prove `∃ x, P x`, we give some x₀ using tactic `use x₀` and
then prove `P x₀`. This x₀ can be an object from the local context
or a more complicated expression.
-/
example : ∃ n : ℕ, 8 = 2*n :=
begin
... |
6490aadee5e918f8df05f8bab6f78678eb6d27d5 | a8a8012e62ebc4c8550b92736c0b20faab882ba0 | /typeclass.hlean | fca7bc86590c6744f6e1b5532bc7edea5c3e583f | [] | no_license | fpvandoorn/Bergen-Lean | d02d173f79492498b0ee042ae6699a984108c6ef | 40638f1e04b6c681858127e85546c9012b62ab63 | refs/heads/master | 1,610,398,839,774 | 1,484,840,344,000 | 1,484,840,344,000 | 79,229,751 | 0 | 2 | null | null | null | null | UTF-8 | Lean | false | false | 401 | hlean | --A typeclass B is a function B : U → U
--It should be thought of as the type of types Σ X : U. B X
--An object of B is a pair (X, x) with X : U and x : B X
structure typeclass :=
(data : Type → Type)
namespace typeclass
structure obj.{u v} (C : typeclass.{u v}) : Type.{max (u+1) v} :=
(U : Type.{u})
(str... |
b3591302b138a36420d202570fbe6adcfa607321 | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/overload1.lean | e43be2734407dca3c2d03899e847dee97e1f4486 | [
"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 | 279 | lean | variable N : Type
variable f : Bool -> Bool -> Bool
variable g : N -> N -> N
infixl 10 ++ : f
infixl 10 ++ : g
print true ++ false ++ true
set_option lean::pp::notation false
print true ++ false ++ true
variable a : N
variable b : N
print a ++ b ++ a
print true ++ false ++ false |
c24bf12aab81f02e38267b7e257f806fed245d52 | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/field_theory/perfect_closure.lean | f0415295634d4e7417f92a050692af4d2e392d45 | [
"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 | 17,188 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Kenny Lau
The perfect closure of a field.
-/
import algebra.char_p
universes u v
/-- A perfect field is a field of characteristic p that has p-th root. -/
class perfect_field (α : Type u... |
a55a0993695b32d2dedcb3a515856d0102f2b77a | 618003631150032a5676f229d13a079ac875ff77 | /src/topology/order.lean | 1d5f1563f5b60ce84483639bfe1192ab057c2ad7 | [
"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 | 27,670 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro
-/
import topology.basic
/-!
# Ordering on topologies and (co)induced topologies
Topologies on a fixed type `α` are ordered, by reverse inclusion.
That... |
ebe16c5812589e5c2365deb42b5ae69bf2bbccc6 | f5f7e6fae601a5fe3cac7cc3ed353ed781d62419 | /src/topology/algebra/infinite_sum.lean | 0f5a5dfef890e14c7a65f4ebbf4cc7c25c1c7eea | [
"Apache-2.0"
] | permissive | EdAyers/mathlib | 9ecfb2f14bd6caad748b64c9c131befbff0fb4e0 | ca5d4c1f16f9c451cf7170b10105d0051db79e1b | refs/heads/master | 1,626,189,395,845 | 1,555,284,396,000 | 1,555,284,396,000 | 144,004,030 | 0 | 0 | Apache-2.0 | 1,533,727,664,000 | 1,533,727,663,000 | null | UTF-8 | Lean | false | false | 24,540 | 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
Infinite sum over a topological monoid
This sum is known as unconditionally convergent, as it sums to the same value under all possible
permutations. For Euclidean spa... |
a4874d60d3f75c16d9f7c74778c96438b5226db7 | 05b503addd423dd68145d68b8cde5cd595d74365 | /src/linear_algebra/basic.lean | d07029c287e4853836647dcb5f36723c77be4395 | [
"Apache-2.0"
] | permissive | aestriplex/mathlib | 77513ff2b176d74a3bec114f33b519069788811d | e2fa8b2b1b732d7c25119229e3cdfba8370cb00f | refs/heads/master | 1,621,969,960,692 | 1,586,279,279,000 | 1,586,279,279,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 77,356 | 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, Kevin Buzzard
-/
import algebra.pi_instances data.finsupp data.equiv.mul_add order.order_iso
/-!
# Linear algebra
This file defines the basics of lin... |
e609943be27223572a674a65de7f2800c2670208 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/data/fintype/fin.lean | 413d29a06bafc63116ae17f151f9552ece1dace2 | [
"Apache-2.0"
] | permissive | jjgarzella/mathlib | 96a345378c4e0bf26cf604aed84f90329e4896a2 | 395d8716c3ad03747059d482090e2bb97db612c8 | refs/heads/master | 1,686,480,124,379 | 1,625,163,323,000 | 1,625,163,323,000 | 281,190,421 | 2 | 0 | Apache-2.0 | 1,595,268,170,000 | 1,595,268,169,000 | null | UTF-8 | Lean | false | false | 1,435 | lean | /-
Copyright (c) 2021 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen
-/
import data.fin
import data.fintype.basic
/-!
# The structure of `fintype (fin n)`
This file contains some basic results about the `fintype` instance for `fin`,
especially... |
2eb37fd40cef67402ac255b46a9fb418c4681f9d | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/tactic/omega/main.lean | 80fc0e66305e854b543003ddc9cae3717f81b562 | [
"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 | 3,884 | lean | /-
Copyright (c) 2019 Seul Baek. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Seul Baek
A tactic for discharging linear integer & natural
number arithmetic goals using the Omega test.
-/
import tactic.omega.int.main
import tactic.omega.nat.main
namespace omega
... |
a95e0c5d468253be9ea24a2511512d18393282a7 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/data/pfunctor/multivariate/M.lean | ede48f428f644bf6e478645a31246dd879aa62ab | [
"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,485 | lean | /-
Copyright (c) 2018 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Mario Carneiro, Simon Hudon
-/
import data.pfunctor.multivariate.basic
import data.pfunctor.univariate.M
/-!
# The M construction as a multivariate polynomial functor.
... |
f5482b751ead67215fc5054e04159285961e8786 | eb586f8ae80b7045ba4ff08f1c7ba69403d61081 | /src/small_things.lean | 2151bdce6d158333d819ff540990510b11b2a4c3 | [] | no_license | bryangingechen/transcendental | 926584f58c47d766b304d39d1aa6814284535394 | 3692ac5ebe85e49c5f65bc7f2ea4f873a973bac2 | refs/heads/master | 1,668,733,660,442 | 1,594,269,161,000 | 1,594,269,161,000 | 278,266,099 | 0 | 0 | null | 1,594,270,314,000 | 1,594,270,313,000 | null | UTF-8 | Lean | false | false | 8,407 | lean | import data.rat.basic
import data.real.basic
import data.finset
import data.int.gcd
import algebra.gcd_domain
import data.finsupp algebra.big_operators
import data.polynomial
import tactic
noncomputable theory
open_locale big_operators
namespace small_things
theorem same_sum {s : finset ℕ} (f g : ℕ -> ℝ) (h : ∀ i ∈ ... |
673c329580d910a0c7b93cf0b05fc06226f65139 | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/order/basic.lean | 2bed08046cd9732e040397ebf3cd4e8c3e3415bd | [
"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 | 25,289 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Mario Carneiro
-/
import data.prod
import data.subtype
/-!
# Basic definitions about `≤` and `<`
This file proves basic results about orders, provides extensive dot not... |
ef3a6a0c2626e37d2e06932430ff09fa7dc0d641 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/lean/run/evalBuiltinInit.lean | 1f028ca33a06a2741ca82578d492d3cf471d6520 | [
"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 | 186 | lean | import Lean
-- option should be ignored when evaluating a `[builtinInit]` decl
set_option interpreter.prefer_native false
#eval toString Lean.PrettyPrinter.formatterAttribute.defn.name
|
361feded1cfcceeac2e2f72d08abdf0ab1fa56d9 | 88fb7558b0636ec6b181f2a548ac11ad3919f8a5 | /tests/lean/vm_sorry.lean | 68ed3e244001d9810106f8c3402dff061b53343a | [
"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 | 418 | lean | def half_baked : bool → ℕ
| tt := 42
| ff := sorry
#eval (half_baked tt)
#eval (half_baked ff)
meta def my_partial_fun : bool → ℕ
| tt := 42
| ff := undefined
#eval (my_partial_fun ff)
open expr tactic
run_cmd (do v ← to_expr `(half_baked ff) >>= whnf,
trace $ to_string v^.is_sorry)
example : 0 = 1... |
072687f46fc3c8b1032221c76031c4186d35dad8 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/data/set/intervals/ord_connected.lean | 9fc914f5f2a6b65b364b665d734c22d70a4c3b26 | [
"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,452 | 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 data.set.intervals.unordered_interval
import data.set.lattice
/-!
# Order-connected sets
We say that a set `s : set α` is `ord_connected` if for all ... |
78463d71475bc901d36310b8829e2741a8cc7e11 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/interactive/compNamespace.lean | 2879bb47bc632b5e2829ac655aba096704ac040a | [
"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 | 366 | lean | namespace Foo
namespace LongNamespaceExample
def x := 10
#check LongN
--^ textDocument/completion
end LongNamespaceExample
#check LongN
--^ textDocument/completion
end Foo
#check Foo.
--^ textDocument/completion
#check Foo.LongN
--^ textDocument/completion
open Foo
#chec... |
c75e3ff718c3c1f9e3aa67814eb3ec477db3b80d | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/scientific.lean | ada0b9c4a896e7e47189a9a79d4ab0dc60922291 | [
"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 | 397 | lean | -- https://github.com/leanprover/lean4/issues/1484
#eval 1.0e1
#eval 1.0e+1
#eval 1.0e-1
#eval 1.453e-8
#eval 0.05843E5
#eval 8.43e6
#eval 5.2342E-7
#eval 123.
#eval 123.E+3
#eval -853.4E-2
-- we reject leading decimal points
#eval .123
#eval .123E3
#eval .123E00003
-- errors
#eval e-8
#eval 1.0e
#eval 1.0e+
#eval 1.... |
788b8472dcea1b43adc59d83d4ec232c86a861b2 | 6db8061629f55e774dd3d03be5bf005ffb485e48 | /BetterNumLits/Macro.lean | 2111ba5f8c7398c1c313a7328cd32565823a5368 | [] | no_license | tydeu/lean4-betterNumLits | 21fd5717d1b62ecb021c73e8cfaa0e3d19005690 | 45e3b79214b3e1f81f8e034dd12257e993ddc578 | refs/heads/master | 1,683,103,070,685 | 1,621,717,131,000 | 1,621,717,131,000 | 369,368,844 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,142 | lean | import BetterNumLits.Numerals
import BetterNumLits.Notation
import BetterNumLits.Nat
import BetterNumLits.OfRadix
import BetterNumLits.Fin
open Lean Syntax
def digitToStx : Char -> MacroM Syntax
| '0' => `((0))
| '1' => `((1))
| '2' => `((2))
| '3' => `((3))
| '4' => `((4))
| '5' => `((5))
| '6' => `((6))
| '7' => `... |
926c3ef324ae2365842b7dd1f731988f53e8dd63 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/1435.lean | 7e3f8e845a09526296c369cb890432e91ce91811 | [
"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 | 288 | lean | class LinearOrder (α : Type _) extends LE α, LT α
theorem le_of_not_gt [LinearOrder α] {a b : α} : ¬ a > b → a ≤ b := sorry
instance : LinearOrder Nat where
lt := Nat.lt
le := Nat.le
example (a b : Nat) (h : ¬a < b) : b ≤ a := by
have := le_of_not_gt h
exact this
|
a663cfb5f64154bbd6ea65b1402ac5bb98784250 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/linear_algebra/exterior_algebra/grading.lean | ee7e87b9b61ff3e343b306647af72acb3f460228 | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 2,808 | lean | /-
Copyright (c) 2021 Eric Wieser. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Eric Wieser
-/
import linear_algebra.exterior_algebra.basic
import ring_theory.graded_algebra.basic
/-!
# Results about the grading structure of the exterior algebra
Many of these resul... |
c5cc8308cc3e12197cdce73aea78933a52d525db | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/category_theory/abelian/basic.lean | 5fc660290f5fa3ab3aee9b42c68d18148cd3739f | [
"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 | 22,625 | lean | /-
Copyright (c) 2020 Markus Himmel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel
-/
import category_theory.limits.shapes.constructions.pullbacks
import category_theory.limits.shapes.regular_mono
import category_theory.limits.shapes.biproducts
import c... |
896e4df22e2ee36db9ecae226c879bcfdceb0f3c | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/ring_theory/free_comm_ring.lean | 7e475424b67031caed3b3ad26a527e6f5690dfbd | [
"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 | 16,022 | lean | /-
Copyright (c) 2019 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Johan Commelin
-/
import group_theory.free_abelian_group data.equiv.functor data.polynomial
import ring_theory.ideal_operations ring_theory.free_ring
noncomputable theory
local... |
ccd8e4c91e31650eda723a8dd84ba09cf6081b62 | c5b07d17b3c9fb19e4b302465d237fd1d988c14f | /src/category/comonad.lean | daa6714673d7dcd0e9b3015d7f002e71ff087fe6 | [
"MIT"
] | permissive | skaslev/papers | acaec61602b28c33d6115e53913b2002136aa29b | f15b379f3c43bbd0a37ac7bb75f4278f7e901389 | refs/heads/master | 1,665,505,770,318 | 1,660,378,602,000 | 1,660,378,602,000 | 14,101,547 | 0 | 1 | MIT | 1,595,414,522,000 | 1,383,542,702,000 | Lean | UTF-8 | Lean | false | false | 405 | lean | class comonad (m : Type → Type) extends functor m :=
(extract : Π {A}, m A → A)
(dup : Π {A}, m A → m (m A))
(map_extract_over_dup : Π {A} {x : m A}, extract <$> dup x = x)
namespace comonad
def cobind {m A B} [comonad m] (x: m A) (f : m A -> B) : m B := f <$> dup x
notation x `=>>` g := cobind x g
end comonad
def bi... |
1a2d4e085cebb7c43599c191be53c372a37d66e2 | 80746c6dba6a866de5431094bf9f8f841b043d77 | /src/group_theory/sylow.lean | dddf8f5ed6c74936ce583015e86fd80d8f5f5ded | [
"Apache-2.0"
] | permissive | leanprover-fork/mathlib-backup | 8b5c95c535b148fca858f7e8db75a76252e32987 | 0eb9db6a1a8a605f0cf9e33873d0450f9f0ae9b0 | refs/heads/master | 1,585,156,056,139 | 1,548,864,430,000 | 1,548,864,438,000 | 143,964,213 | 0 | 0 | Apache-2.0 | 1,550,795,966,000 | 1,533,705,322,000 | Lean | UTF-8 | Lean | false | false | 11,502 | 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 group_theory.order_of_element data.zmod.basic algebra.pi_instances group_theory.group_action group_theory.quotient_group
open equiv fintype finset is_group_action... |
3d044a29fb42caa6bc23473dd8f6f6277596c094 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/analysis/normed_space/star/basic.lean | 864193d1e9b1dbb531a2bd8cdc4793d06f283639 | [
"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 | 7,337 | lean | /-
Copyright (c) 2021 Frédéric Dupuis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frédéric Dupuis
-/
import analysis.normed.group.hom
import analysis.normed_space.basic
import analysis.normed_space.linear_isometry
import algebra.star.self_adjoint
import algebra.st... |
b44fee2d7087563d69dfdbcb6ff894d0d7f861f9 | 367134ba5a65885e863bdc4507601606690974c1 | /src/topology/bounded_continuous_function.lean | a50da28f85bb6d557116030fbb7ecc41ba7d7044 | [
"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 | 32,064 | 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, Mario Carneiro, Yury Kudryashov, Heather Macbeth
-/
import analysis.normed_space.basic
/-!
# Bounded continuous functions
The type of bounded continuous functio... |
3f3de34dd0e46ffba47ca7743cce47df31eba9a6 | 50b3917f95cf9fe84639812ea0461b38f8f0dbe1 | /blog/group_axioms_other/group_axioms_sructure.lean | 8f21b66853fbe47769105803b7131a09f53aaf17 | [] | 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,958 | lean | -- do I use a section? What even is a section?
-- so I use a namespace? What would a sensible convention be?
-- I don't care about junk like imports at the beginning of files
-- This file is for undergraduate mathematicians who want to see the
-- proof that one of the axioms that Lean uses to define a group
-- actual... |
5adce31334076a711e64dc3c119cd1f617299e04 | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /src/Lean/Elab/Term.lean | 387273e5cbf29746f8913a1a5944475856251816 | [
"Apache-2.0"
] | permissive | williamdemeo/lean4 | 72161c58fe65c3ad955d6a3050bb7d37c04c0d54 | 6d00fcf1d6d873e195f9220c668ef9c58e9c4a35 | refs/heads/master | 1,678,305,356,877 | 1,614,708,995,000 | 1,614,708,995,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 63,580 | 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... |
ad584adc20e2d2ddfb0237eb61fe9cbafe8d6732 | 432d948a4d3d242fdfb44b81c9e1b1baacd58617 | /src/algebra/big_operators/finprod.lean | b5e6c15496d1d0caa04b32073d2df838ab2dca4e | [
"Apache-2.0"
] | permissive | JLimperg/aesop3 | 306cc6570c556568897ed2e508c8869667252e8a | a4a116f650cc7403428e72bd2e2c4cda300fe03f | refs/heads/master | 1,682,884,916,368 | 1,620,320,033,000 | 1,620,320,033,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 31,518 | lean | /-
Copyright (c) 2020 Kexing Ying and Kevin Buzzard. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kexing Ying, Kevin Buzzard, Yury Kudryashov
-/
import data.set.finite
import data.set.disjointed
import algebra.big_operators
import data.indicator_function
/-!
# Fini... |
add1186b8990d7c7ef8ff3aab879aa2a0a808835 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/geometry/euclidean/circumcenter.lean | 84cbe8164ca774f94d968a016982de5471eff2c3 | [
"Apache-2.0"
] | permissive | AntoineChambert-Loir/mathlib | 64aabb896129885f12296a799818061bc90da1ff | 07be904260ab6e36a5769680b6012f03a4727134 | refs/heads/master | 1,693,187,631,771 | 1,636,719,886,000 | 1,636,719,886,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 38,266 | lean | /-
Copyright (c) 2020 Joseph Myers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Joseph Myers
-/
import geometry.euclidean.basic
import linear_algebra.affine_space.finite_dimensional
import tactic.derive_fintype
/-!
# Circumcenter and circumradius
This file proves ... |
95182300b1769e099195c6bb907314a4e84c8188 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/category_theory/preadditive/Mat.lean | 96a248a0caa20eda5e0a1f1c20f11b255a887e0d | [
"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 | 18,661 | 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 algebra.big_operators.basic
import algebra.big_operators.pi
import category_theory.limits.shapes.biproducts
import category_theory.preadditive.basic
import cat... |
5b9933c994e443387dbe00df6c7c023178e625fc | 94e33a31faa76775069b071adea97e86e218a8ee | /src/group_theory/nilpotent.lean | 53ed68c0d2a8d62cbd5ce2a8a125ea5beb653989 | [
"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 | 37,962 | lean | /-
Copyright (c) 2021 Kevin Buzzard. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Buzzard, Ines Wright, Joachim Breitner
-/
import group_theory.quotient_group
import group_theory.solvable
import group_theory.p_group
import group_theory.sylow
import data.nat.fa... |
f2f1a5d3e5870a500e50d729354351dcf0f8f182 | ee8cdbabf07f77e7be63a449b8483ce308d37218 | /lean/src/valid/mathd-numbertheory-109.lean | 69acfc27791d7cbe7e1dac350ccd210e732a1a90 | [
"MIT",
"Apache-2.0"
] | permissive | zeta1999/miniF2F | 6d66c75d1c18152e224d07d5eed57624f731d4b7 | c1ba9629559c5273c92ec226894baa0c1ce27861 | refs/heads/main | 1,681,897,460,642 | 1,620,646,361,000 | 1,620,646,361,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 422 | lean | /-
Copyright (c) 2021 OpenAI. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kunhao Zheng
-/
import data.real.basic
import data.pnat.basic
import data.finset.basic
import algebra.big_operators.basic
open_locale big_operators
example (v : ℕ → ℕ) (h₀ : ∀ n, v n = 2 * n ... |
e4762cb21950736967604ed7dcdd77a86e521bdd | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /tests/lean/run/group5.lean | a85db5a0ef22039849996218d87ca876efab584b | [
"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 | 4,013 | 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
-- algebra.group
-- =============
-- Various structures with 1, *, inv, including groups.
import logic.eq logic.connectives
import data.unit da... |
926a97b517fcd075491768264714a7d9c16ebfdd | 43390109ab88557e6090f3245c47479c123ee500 | /src/xenalib/Keji_further_matrix_things.lean | 333669d25379a130d60f847955d11fb5cf30ca07 | [
"Apache-2.0"
] | permissive | Ja1941/xena-UROP-2018 | 41f0956519f94d56b8bf6834a8d39473f4923200 | b111fb87f343cf79eca3b886f99ee15c1dd9884b | refs/heads/master | 1,662,355,955,139 | 1,590,577,325,000 | 1,590,577,325,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 24,026 | lean | import init.function xenalib.Ellen_Arlt_matrix_rings algebra.module algebra.big_operators data.set.finite analysis.real data.complex.basic algebra.ring xenalib.Keji_permutations_for_matrices
open complex matrix
def Cross_out_column {R : Type} [ring R] {n : nat }
(A : matrix R (n+1) (n+1)) (m : fin (n+1)) : matrix R... |
af60211d507c2029b73200ab723186a910cf953a | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/measure_theory/measurable_space.lean | 025b9aaa7d8294bf3b31881b5acaab42e50d1055 | [
"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 | 52,327 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro
-/
import data.set.disjointed
import data.set.countable
import data.indicator_function
import data.equiv.encodable.lattice
import order.filter.basic
/-!... |
e16088c5b9b56f3b0b6f25f5ec41aed7d7a4fb12 | e791a827712b9cda7e14eb9861a152725a60f884 | /sets.lean | c7d7f66616852e81669f1c09f1b6b136ac0f78eb | [] | no_license | Shamrock-Frost/FormalComplexAnalysis | 29bf1d45f59b22d6553b24fe5b630464f9c2d9fa | 3cac79d9b603b1edf7df1bc7e948c74eb86a2cc0 | refs/heads/master | 1,588,634,495,874 | 1,554,397,551,000 | 1,554,397,551,000 | 179,541,347 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,373 | lean | variables {α : Type _} {β : Type _} {γ : Type _}
def fun.im (f : α → β) (A : set α) := { b : β | ∃ a, a ∈ A ∧ b = f a }
def fun.pre_im (f : α → β) (B : set β) := { a : α | f a ∈ B }
def fun.pre_im_of_inv_eq_im (f : α → β) (g : β → α) (B : set β)
(hfg : ∀ b, f (g b) = b) (hgf : ∀ a, g (f a) = a)
: fun.pre_im f B ... |
c17d931243cfea8b0a72211f1e850371fad7cfe3 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/zeroExitPoints.lean | 6028c23e1fb6c38affdc676affb0dbbc8730fb94 | [
"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 | 165 | lean | set_option trace.Compiler.result true
def f (x : Empty) (y : Nat) : Nat :=
let g (h : Unit → Empty) : Nat := h () |>.casesOn
let aux := g fun _ => x
y + aux
|
6b823fb6e031f66980fd92b8d86754cecf4e54c1 | e9dbaaae490bc072444e3021634bf73664003760 | /src/Util.lean | 5875d11c801e7f985a5e931b4d35b4e649763a85 | [
"Apache-2.0"
] | permissive | liaofei1128/geometry | 566d8bfe095ce0c0113d36df90635306c60e975b | 3dd128e4eec8008764bb94e18b932f9ffd66e6b3 | refs/heads/master | 1,678,996,510,399 | 1,581,454,543,000 | 1,583,337,839,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 428 | lean | axiom WIP.{u} {α : Sort u} : α
--axiom WIP {α : Prop} : α
universe u
variable {α : Type u}
def unique (p : α → Prop) (x : α) : Prop := p x ∧ ∀ y, p y → y = x
instance HasZeroOfHasNat {α : Type u} [HasOfNat α] : HasZero α := ⟨ofNat α 0⟩
instance HasOneOfHasNat {α : Type u} [HasOfNat α] : HasOne α := ⟨ofNat α 1⟩
inst... |
3a81f3485a07dd7a8107479401da3fd9d6c42fc1 | 0845ae2ca02071debcfd4ac24be871236c01784f | /library/init/coe.lean | c8ef699d64b289c5aa2960395391fccaa446b5bd | [
"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,852 | 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
-/
/-
The Elaborator tries to insert coercions automatically.
Only instances of HasCoe type class are considered in the process.
Lean also provides a "liftin... |
fafd00fc626e721e422391783c71e7ece924b310 | b32d3853770e6eaf06817a1b8c52064baaed0ef1 | /src/super/inferences/superposition.lean | f2c4cc1b19ebcd97398cff49eec82c7f32e1a29a | [] | no_license | gebner/super2 | 4d58b7477b6f7d945d5d866502982466db33ab0b | 9bc5256c31750021ab97d6b59b7387773e54b384 | refs/heads/master | 1,635,021,682,021 | 1,634,886,326,000 | 1,634,886,326,000 | 225,600,688 | 4 | 2 | null | 1,598,209,306,000 | 1,575,371,550,000 | Lean | UTF-8 | Lean | false | false | 5,036 | lean | import super.prover_state super.resolve
namespace super
open native tactic expr
meta def clause.flip (c : clause) (i : ℕ) : tactic clause :=
match c.literals.nth i with
| some (literal.pos e@(app (app (app (const ``eq [l]) ty) a) b)) :=
clause.resolve c i ⟨clause_type.imp e (clause_type.atom (const ``eq [l] ty b a)... |
1476fcb9d8fa061027cee64326579f5df330a64c | dd4e652c749fea9ac77e404005cb3470e5f75469 | /src/cone_program.lean | e8608692a5477cdd73e8b4820ff18a88945b61dc | [] | no_license | skbaek/cvx | e32822ad5943541539966a37dee162b0a5495f55 | c50c790c9116f9fac8dfe742903a62bdd7292c15 | refs/heads/master | 1,623,803,010,339 | 1,618,058,958,000 | 1,618,058,958,000 | 176,293,135 | 3 | 2 | null | null | null | null | UTF-8 | Lean | false | false | 2,242 | lean | import .vec_cone data.real.basic
variables {k m n : nat}
namespace cone_program
structure primal (m n : nat) :=
(obf : colvec (fin n) ℝ)
(lhs : matrix (fin m) (fin n) ℝ)
(rhs : colvec (fin m) ℝ)
open matrix
variables (K : set (colvec (fin n) ℝ)) (K' : set (colvec (fin n) ℝ))
local infix ` ⬝ ` : 70 := matrix.mul
... |
6c93d923e6361bf8bcb1f52620b0f2cdacfd5f13 | 206422fb9edabf63def0ed2aa3f489150fb09ccb | /src/measure_theory/probability_mass_function.lean | 207332bb7cf7e715d2e3684053523953c66891d6 | [
"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 | 6,022 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Johannes Hölzl
-/
import topology.instances.ennreal
/-!
# Probability mass functions
This file is about probability mass functions or discrete probability measures:
a function `α → ℝ≥... |
3128816fc322be3d0a80ebb85c17034f26f341d2 | 2a44f685380c1a89f9e3b6e5e37ec65d74ec5010 | /src/uniq/uniq.lean | 828087a4676425c6683f71622bb3e77610976443 | [
"Apache-2.0"
] | permissive | fgdorais/uniq | 0a4c50ae1df37687f38d65b9cd462b3bdf83dbff | 87072ea6292436500370ebfc4bd140b1dae704fd | refs/heads/master | 1,584,872,936,588 | 1,530,977,726,000 | 1,530,977,726,000 | 139,905,607 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,257 | lean | /-
Copyright © 2018 François G. Dorais. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
-/
-- workaround for https://github.com/leanprover/lean/issues/1961
lemma subtype_eq {α : Sort*} {p : α → Prop} :
∀ {a1 a2 : subtype p}, a1.val = a2.val → a1 = a2
| ⟨x,h1⟩ ⟨.(x),h2⟩ rfl := r... |
f951d973c3fd3c61bbca807c6296dcba2cbbeefd | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/linear_algebra/linear_pmap.lean | 5006e9db299487bc6d8d60872dd21853053254e5 | [
"Apache-2.0"
] | permissive | AntoineChambert-Loir/mathlib | 64aabb896129885f12296a799818061bc90da1ff | 07be904260ab6e36a5769680b6012f03a4727134 | refs/heads/master | 1,693,187,631,771 | 1,636,719,886,000 | 1,636,719,886,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 16,786 | lean | /-
Copyright (c) 2020 Yury Kudryashov All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import linear_algebra.basic
import linear_algebra.prod
/-!
# Partially defined linear maps
A `linear_pmap R E F` is a linear map from a submodule of `E` to `F`. We... |
863d5764a783372e471709d05a9c8b1f133c4b29 | c7e0fa0422da099d4b66b195c60455d87facee0d | /function.lean | 9ac4ceb8f27b0da7a2a25015bf853a12def174db | [] | no_license | viljamivirolainen/linear | 12d725a90a44ae2760f59e9a9d9dd12aae36300a | dcf28df05e06da1b4fc76bce61b8fa0741300dc8 | refs/heads/master | 1,678,895,327,362 | 1,516,045,398,000 | 1,516,045,398,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,442 | lean | import .vector_space
universes u v
variable {α : Type u}
instance function_functor : functor ((→) α) :=
{ map := λ _ _, (∘),
id_map := λ _ _, rfl,
map_comp := λ _ _ _ _ _ _, rfl }
instance functor_has_neg {f α} [functor f] [has_neg α] : has_neg (f α) :=
⟨has_map.map has_neg.neg⟩
variable ... |
7519424c84c63801d0f2d53b20a516297009fe05 | 64874bd1010548c7f5a6e3e8902efa63baaff785 | /tests/lean/run/forest_height.lean | e045bb4ffe5f7a7bc8bd12fb21131ce216c03fd2 | [
"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 | 4,281 | lean | import data.nat.basic data.sum data.sigma data.bool
open nat sigma
inductive tree (A : Type) : Type :=
node : A → forest A → tree A
with forest : Type :=
nil : forest A,
cons : tree A → forest A → forest A
namespace manual
check tree.rec_on
definition tree.height {A : Type} (t : tree A) : nat :=
tree.rec_on t
(λ ... |
fac3cdd850145941441496c8984b1bad64cd263c | 2c41ae31b2b771ad5646ad880201393f5269a7f0 | /Lean/Examples/Car/Car_Changeable.lean | 749bde7b2b0a8635459137853b49eeecb718fdd3 | [] | 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 | 15,901 | lean | import Qualities.Satisfactory
--import Value
import Examples.Car.Car_SystemModel
--import BoehmTactics
/-
[homeOilActionSpec] expresses a Ross-style changeability requirement
pertaining to system instances. We interpret this one as saying that
when the [trigger] condition on a system instance state is true, then
the ... |
2239a07abae9219121fac9302aba50f98dba98d5 | 97c8e5d8aca4afeebb5b335f26a492c53680efc8 | /ground_zero/types/coproduct.lean | ce83bb73d458e680140a4181c8f577ca671d9279 | [] | no_license | jfrancese/lean | cf32f0d8d5520b6f0e9d3987deb95841c553c53c | 06e7efaecce4093d97fb5ecc75479df2ef1dbbdb | refs/heads/master | 1,587,915,151,351 | 1,551,012,140,000 | 1,551,012,140,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 672 | lean | import ground_zero.types.equiv
namespace ground_zero.types
universes u v f
inductive coproduct (α : Sort u) (β : Sort v)
| inl {} : α → coproduct
| inr {} : β → coproduct
infix ` + ` := coproduct
namespace coproduct
variables {α : Sort u} {β : Sort v}
def elim {γ : Sort f} (g₀ : α → γ) (g₁ : β → γ) : α + β → γ... |
2bc0373577cbb2877f28ee6f4e26a0ef6faabf31 | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/tactic/squeeze.lean | 27b9fe4080c9b5c91c67dd8a8ea35cdc33f89432 | [
"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 | 3,712 | lean |
import meta.rb_map
import tactic.basic data.list.defs
import category.traversable.basic
import tactic.simpa
open interactive interactive.types lean.parser
meta def loc.to_string_aux : option name → string
| none := "⊢"
| (some x) := to_string x
meta def loc.to_string : loc → string
| (loc.ns []) := ""
| (loc.ns [no... |
1f59a81e16c8f5be4dc450fd33437cf922b914bc | 12dabd587ce2621d9a4eff9f16e354d02e206c8e | /world05/level03.lean | b29f527f884986ec089d293e2e466241b686fca9 | [] | no_license | abdelq/natural-number-game | a1b5b8f1d52625a7addcefc97c966d3f06a48263 | bbddadc6d2e78ece2e9acd40fa7702ecc2db75c2 | refs/heads/master | 1,668,606,478,691 | 1,594,175,058,000 | 1,594,175,058,000 | 278,673,209 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 167 | lean | example (P Q R S T U: Type)
(p : P)
(h : P → Q)
(i : Q → R)
(j : Q → T)
(k : S → T)
(l : T → U)
: U :=
begin
have q := h(p),
have t := j(q),
exact l(t),
end
|
528605821fa60cb657cd717a5cdc9435fa2e5764 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/measure_theory/covering/vitali.lean | a549606b238d37f870c71e06c3a109a8acdd5d62 | [
"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 | 29,561 | lean | /-
Copyright (c) 2021 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import topology.metric_space.basic
import measure_theory.constructions.borel_space
import measure_theory.covering.vitali_family
/-!
# Vitali covering theorems
... |
022c8b44e662a903bad1f00113f5ccb54f4091f2 | 853df553b1d6ca524e3f0a79aedd32dde5d27ec3 | /src/tactic/pi_instances.lean | b0ee8ba686eb81d68ab97aeb33ff5ef6c0863011 | [
"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 | 2,046 | lean | /-
Copyright (c) 2018 Simon Hudon All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Simon Hudon
-/
import tactic.solve_by_elim
import order.basic
/-!
# `pi_instance`
Automation for creating instances of mathematical structures for pi types
-/
namespace tactic
open tact... |
99b243850291a342b4fa35ab408e5d6619771714 | f0f12a5b81106a798deda31dca238c11997a605e | /Playlean4/Group/OnSet.lean | a0ebe455241939cb1dd76b444d26199938b1d767 | [
"MIT"
] | permissive | thejohncrafter/playlean4 | fe7119d492aab07048f78333eeda9862f6471740 | 81df180a71b8d84d0f45bc98db367aad203cf5df | refs/heads/master | 1,683,152,783,765 | 1,621,879,382,000 | 1,621,879,382,000 | 366,563,501 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,120 | lean |
import Playlean4.Basic
import Playlean4.Group.Basic
import Playlean4.Group.Subgroup
import Playlean4.Group.Action
set_option quotPrecheck.allowSectionVars true
namespace Group.Action.Remarkable
namespace OnSet
variable {G : Type} (law : G → G → G) [grp : Group G law]
local infixl:70 " * " => id' law
@[appUnexpand... |
445d7e6b286f462902fabcd854f5e8bee784cdd2 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/meta/expr_lens.lean | 30ddcd8ba71c4d53aa0d6d0ec006b9736027620f | [] | 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,759 | lean | /-
Copyright (c) 2020 Keeley Hoek. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Keeley Hoek, Scott Morrison
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.meta.expr
import Mathlib.PostPort
universes l
namespace Mathli... |
3aa8a6ad4c5dd95dd3ce68d91c2c6b71d3eff74f | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/topology/metric_space/emetric_space.lean | 208b618199ca47f2a9f25d2ad125c99b4ab66b34 | [] | 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 | 33,728 | lean | /-
Copyright (c) 2015, 2017 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Robert Y. Lewis, Johannes Hölzl, Mario Carneiro, Sébastien Gouëzel
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.real.ennreal
i... |
ed68f4ec2347c430df9c2f9412440ac8e4c188f2 | 98beff2e97d91a54bdcee52f922c4e1866a6c9b9 | /src/subobject_classifier.lean | 46545fbd8d57318b58e1c1a667fcfe1164dd535b | [] | no_license | b-mehta/topos | c3fc43fb04ba16bae1965ce5c26c6461172e5bc6 | c9032b11789e36038bc841a1e2b486972421b983 | refs/heads/master | 1,629,609,492,867 | 1,609,907,263,000 | 1,609,907,263,000 | 240,943,034 | 43 | 3 | null | 1,598,210,062,000 | 1,581,877,668,000 | Lean | UTF-8 | Lean | false | false | 5,420 | lean | /-
Copyright (c) 2020 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta
-/
import category_theory.limits.shapes
import category_theory.limits.shapes.regular_mono
import category_theory.epi_mono
import sub
/-!
# Subobject classifiers
Define a ... |
72ee580fc78c00eea215bee2269821d20c4b5937 | 3dd1b66af77106badae6edb1c4dea91a146ead30 | /tests/lean/run/imp.lean | 022b1ee441168635be2f2c603c05c17a69188025 | [
"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 | 570 | lean | variable N : Type.{1}
variables a b c : N
variable f : forall {a b : N}, N → N
check f
check @f
check @f a
check @f a b
check @f a b c
definition l1 : N → N → N → N := @f
definition l2 : N → N → N := @f a
definition l3 : N → N := @f a b
definition l4 : N := @f a b c
variable g : forall ⦃a b : N⦄, N → N
check g
chec... |
b9b9adc1fe6f9d8be3b0cb3541831c475946a8f3 | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /tests/lean/run/tree_subterm_pred.lean | 7b4c2cb586fb7c730781b39ef234972d143588c1 | [
"Apache-2.0"
] | permissive | chubbymaggie/lean | 0d06ae25f9dd396306fb02190e89422ea94afd7b | d2c7b5c31928c98f545b16420d37842c43b4ae9a | refs/heads/master | 1,611,313,622,901 | 1,430,266,839,000 | 1,430,267,083,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,943 | lean | import logic
open eq.ops
inductive tree (A : Type) :=
| leaf : A → tree A
| node : tree A → tree A → tree A
namespace tree
inductive direct_subterm {A : Type} : tree A → tree A → Prop :=
| node_l : Π (l r : tree A), direct_subterm l (node l r)
| node_r : Π (l r : tree A), direct_subterm r (node l r)
definition dire... |
d224186f36c44d141f7e3427a7de60a922371826 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Server.lean | d6f27596cdf9badc78754e2625471e4ac805f020 | [
"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 | 284 | lean | /-
Copyright (c) 2020 Marc Huisinga. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Marc Huisinga, Wojciech Nawrocki
-/
import Lean.Server.Watchdog
import Lean.Server.FileWorker
import Lean.Server.Rpc
import Lean.Server.CodeActions
|
e6f7259fdb6e96ec4a44728a9212992ba7fc567b | 33340b3a23ca62ef3c8a7f6a2d4e14c07c6d3354 | /examples.lean | 1f5439df23a1751007352f458f0acc35938a4bc9 | [] | no_license | lclem/cooper | 79554e72ced343c64fed24b2d892d24bf9447dfe | 812afc6b158821f2e7dac9c91d3b6123c7a19faf | refs/heads/master | 1,607,554,257,488 | 1,578,694,133,000 | 1,578,694,133,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,164 | lean | import .lia.main
example : ∃ (z : int), z + 5 = 1223 := by lia
example : ∃ (x : int), 3 ∣ (x + 5) := by lia
example : ∀ x : int, 31 * x > 0 → x > 0 := by lia
example : ∀ x y : int, (x ≤ 5 ∧ y ≤ 3) → x + y ≤ 8 := by lia
example : ∀ x y : int, ¬(2 * x + 1 = 2 * y) := by lia
example : ∀ x y : int, x + 2 = y → ∃ z : int... |
dfe318fc46acc7b5f80dc3f7d16ea0c3787b1cc5 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/data/equiv/encodable/basic.lean | 84f99c2cd9135c91bc761b7eaa039f928966d1be | [
"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 | 17,828 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Mario Carneiro
-/
import data.equiv.nat
import order.rel_iso
import order.directed
/-!
# Encodable types
This file defines encodable (constructively countab... |
cfcebf2989be8cafcd0ffff72f3207397aac14f0 | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/topology/algebra/infinite_sum.lean | e15d2d86056c6002f1dd8e739c2805123c534f4b | [
"Apache-2.0"
] | permissive | abentkamp/mathlib | d9a75d291ec09f4637b0f30cc3880ffb07549ee5 | 5360e476391508e092b5a1e5210bd0ed22dc0755 | refs/heads/master | 1,682,382,954,948 | 1,622,106,077,000 | 1,622,106,077,000 | 149,285,665 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 48,359 | 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 algebra.big_operators.intervals
import topology.instances.real
import topology.algebra.module
import data.indicator_function
import data.equiv.encodable.lattic... |
08d87781456443c404bd259935024841337d114c | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/int/modeq.lean | 9f63d07fa77e915d1a891f2368a810acd19287e7 | [
"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,743 | 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 data.nat.modeq
import tactic.ring
/-!
# Congruences modulo an integer
This file defines the equivalence relation `a ≡ b [ZMOD n]` on the integers, similarly to ... |
7b56f3ff2b5eeef35b47311656486cc029b47a5e | 367134ba5a65885e863bdc4507601606690974c1 | /src/analysis/p_series.lean | eb5ff99c071cd886c296bf93680299c590780463 | [
"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 | 10,268 | 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 analysis.special_functions.pow
/-!
# Convergence of `p`-series
In this file we prove that the series `∑' k in ℕ, 1 / k ^ p` converges if and only if `... |
5407c6daaa1991734f8170a57fde89ff15f49a21 | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /tests/lean/run/fun.lean | 626a928f3609c43c66d90d1a9660e09cf4bb166b | [
"Apache-2.0"
] | permissive | chubbymaggie/lean | 0d06ae25f9dd396306fb02190e89422ea94afd7b | d2c7b5c31928c98f545b16420d37842c43b4ae9a | refs/heads/master | 1,611,313,622,901 | 1,430,266,839,000 | 1,430,267,083,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 354 | lean | import logic algebra.function
open function bool
constant f : num → bool
constant g : num → num
check f ∘ g ∘ g
check typeof id : num → num
constant h : num → bool → num
check flip h
check flip h ff num.zero
check typeof flip h ff num.zero : num
constant f1 : num → num → bool
constant f2 : bool → num
check (f1... |
c8363696ec540f77249a616c8bf9a09f6dcb6912 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/cases_renaming_issue.lean | f7fab241f49d9b8b734ae6ba0a0ad9ae15c83bdb | [
"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 | 325 | lean | inductive fi : ℕ → Type
| zero : Π {n}, fi (n + 1)
| suc : Π {n}, fi n → fi (n + 1)
open fi
namespace fi
def lift {n k} : Π m, (fi n → fi k) → fi (n + m) → fi (k + m) :=
begin
intros m f i, induction m with m ih_m, exact f i,
cases i with n n i, exact fi.zero,
exact fi.suc (ih_m i)
end
end fi
|
7a8ed0d1b2793510d0772d22e95dc5437b73c07f | 367134ba5a65885e863bdc4507601606690974c1 | /src/data/matrix/pequiv.lean | a685fd159ddd848ba08c69cafaec4c5a1f1a08a0 | [
"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 | 5,697 | 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.matrix.basic
import data.pequiv
/-
# partial equivalences for matrices
Using partial equivalences to represent matrices.
This file introduces the function `p... |
99747a5734c415c7f1377a32f42129a566cc4a78 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /hott/algebra/category/functor/adjoint.hlean | 7ea163a63777c402acd061d8bd72e3e306eafc17 | [
"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 | 10,164 | 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
Adjoint functors
-/
import .attributes .examples
open functor nat_trans is_trunc eq iso prod
namespace category
structure adjoint {C D : Precategory} (F : C ⇒... |
9bb41aba2a36d84fbd072ae7b0b7e731be0c2cc9 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /library/init/meta/format.lean | ef867fd916d2712529f709d3724b9b1cd7f6802d | [
"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 | 4,693 | 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.meta.options init.function init.data.to_string
universes u v
inductive format.color
| red | green | orange | blue | pink | cyan | grey... |
e44b32279f2b837cdb44bcbc88ab96928907c0f3 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/compiler_bug2.lean | a3e017e1b011a4bfe75407dc2a67b63d5719dc5c | [
"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 | 333 | lean | open expr list
meta def rwr_ctxs_lc (lc : expr) : expr → list expr
| (var _) := []
| (app a b) := map (λc, app a c) (rwr_ctxs_lc b) ++ map (λc, app c b) (rwr_ctxs_lc a)
| e := [lc]
meta def g (lc : expr) : expr → list expr
| (var _) := []
| (app a b) := map (app a) (g b) ++ map (app b) (g a)
| e :... |
ffcff7e38c2d794e35182162fa54e670e77446a8 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/geometry/manifold/bump_function.lean | a9e8b916682dbdf8ff4cb9859fa3c6ad23c64c89 | [
"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 | 14,142 | lean | /-
Copyright (c) 2021 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import analysis.calculus.specific_functions
import geometry.manifold.cont_mdiff
/-!
# Smooth bump functions on a smooth manifold
In this file we define `smooth_bu... |
8defef96c317b3e1e7773f067840594a7a7a6128 | 26ac254ecb57ffcb886ff709cf018390161a9225 | /src/analysis/calculus/tangent_cone.lean | fb9e5a541551245348b873496bc9a442bdc22e6c | [
"Apache-2.0"
] | permissive | eric-wieser/mathlib | 42842584f584359bbe1fc8b88b3ff937c8acd72d | d0df6b81cd0920ad569158c06a3fd5abb9e63301 | refs/heads/master | 1,669,546,404,255 | 1,595,254,668,000 | 1,595,254,668,000 | 281,173,504 | 0 | 0 | Apache-2.0 | 1,595,263,582,000 | 1,595,263,581,000 | null | UTF-8 | Lean | false | false | 16,527 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import analysis.convex.basic
import analysis.normed_space.bounded_linear_maps
import analysis.specific_limits
/-!
# Tangent cone
In this file, we define two p... |
23baa6f9963e6c0a8fe2620addd1ab09fbea5739 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/1305.lean | 04a617e9059da19cb00345013bd09014045cc11a | [
"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 | 458 | lean | structure Foo where
(p : Nat → Prop)
(q : String → Prop)
[inst0 : DecidablePred p]
[inst1 : DecidablePred q]
example : Foo := {
p := fun n => n < 9
q := fun s => s.length < 9
}
structure Bar where
(p : Prop)
(q : Prop)
[inst0 : Decidable p]
[inst1 : Decidable q]
example : Bar := {
p := True
q... |
42d751559869483bc45368d9aa0ae35fbc425adb | 097294e9b80f0d9893ac160b9c7219aa135b51b9 | /instructor/types/option/dm_option.lean | 4b87f616ddca4f2391ec22f5f2728a84caf38dbb | [] | 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 | 542 | lean | /-
Our own implementation of Lean's option type.
We call it dm_option to avoid any possible name
conflicts.
-/
namespace hidden
/-
In the preceding example, an explicit type
argument for dm_option.none is required, even
though there is enough context for Lean to infer
that the type argument must be ℕ. If you want
Le... |
2d014f1cc2066dab2da4bdae634327ba77e8ff67 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/analysis/calculus/lhopital.lean | 200fd626074200e955585fd55e4c3e231ff8172c | [
"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 | 24,286 | lean | /-
Copyright (c) 2020 Anatole Dedecker. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anatole Dedecker
-/
import analysis.calculus.mean_value
/-!
# L'Hôpital's rule for 0/0 indeterminate forms
In this file, we prove several forms of "L'Hopital's rule" for computing ... |
b87e3439610ce4eda7f433e4992019e37f336cb3 | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /tests/lean/run/coe5.lean | 41420afe819e1b51f5cd9efb4849c2917783d528 | [
"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 | 1,028 | lean | import logic
namespace setoid
inductive setoid : Type :=
mk_setoid: Π (A : Type'), (A → A → Prop) → setoid
set_option pp.universes true
check setoid
definition test : Type.{2} := setoid.{0}
definition carrier (s : setoid)
:= setoid.rec (λ a eq, a) s
definition eqv {s : setoid} : carrier s → carrier... |
0a5ecf32106c531657dceb8fb41d2a1c653e1d0f | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/topology/instances/ereal.lean | 9b013eef3cba407e90c918638f17c9c8aee48c2b | [
"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 | 13,263 | lean | /-
Copyright (c) 2021 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.rat.encodable
import data.real.ereal
import topology.algebra.order.monotone_continuity
import topology.instances.ennreal
/-!
# Topological structur... |
484da9e12999a60374349f0e21fb87bf0c744b9a | c777c32c8e484e195053731103c5e52af26a25d1 | /src/category_theory/abelian/injective_resolution.lean | fa70a18e894359afd0c5ef18d316cac4c8c02a9b | [
"Apache-2.0"
] | permissive | kbuzzard/mathlib | 2ff9e85dfe2a46f4b291927f983afec17e946eb8 | 58537299e922f9c77df76cb613910914a479c1f7 | refs/heads/master | 1,685,313,702,744 | 1,683,974,212,000 | 1,683,974,212,000 | 128,185,277 | 1 | 0 | null | 1,522,920,600,000 | 1,522,920,600,000 | null | UTF-8 | Lean | false | false | 12,688 | lean | /-
Copyright (c) 2022 Jujian Zhang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jujian Zhang, Scott Morrison
-/
import algebra.homology.quasi_iso
import category_theory.preadditive.injective_resolution
import algebra.homology.homotopy_category
/-!
# Main result
Wh... |
1417682841d340e30b2c0b8dddcad05516d70f9c | 96e8eaa491186a6ce9be9623f5e3f16221c3bd46 | /main.lean | dab6ef2138f9cd08e1f03813153a69f78b925c17 | [] | no_license | drocta/orthogonal-free-surjective | fb2b37b7ab86e67306d7206380b5a62ec2d9f413 | 6523bdbc7479a62155aae3405c6b00b5673b4b75 | refs/heads/master | 1,588,319,668,013 | 1,554,352,615,000 | 1,554,352,615,000 | 177,363,555 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,158 | lean | import .free
-- import .orthogonal -- not being used yet, so commenting out because it takes a while to compile.
universes u v w
#check my_unit.{u}
#check my_unit.star
open category_theory
-- todo : maybe the definition of initial and final objects should be in another file?
section
variables (C : Type u) [CC : c... |
8727a3c0258f5199df8787ddf93711edf2e7507d | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Meta/Tactic/Assert.lean | 6d565fe008602925c6d0a8e5ee294722873eec63 | [
"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 | 4,872 | 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.Meta.Tactic.FVarSubst
import Lean.Meta.Tactic.Intro
import Lean.Meta.Tactic.Revert
namespace Lean.Meta
/--
Convert the given goal `Ctx |- ta... |
8b4b965d5edc64c6c5396b978004f7af9516013b | 56e5b79a7ab4f2c52e6eb94f76d8100a25273cf3 | /src/tests/test_bfs.lean | c8a65edb74e7faea7eff552156b21581decbe531 | [
"Apache-2.0"
] | permissive | DyeKuu/lean-tpe-public | 3a9968f286ca182723ef7e7d97e155d8cb6b1e70 | 750ade767ab28037e80b7a80360d213a875038f8 | refs/heads/master | 1,682,842,633,115 | 1,621,330,793,000 | 1,621,330,793,000 | 368,475,816 | 0 | 0 | Apache-2.0 | 1,621,330,745,000 | 1,621,330,744,000 | null | UTF-8 | Lean | false | false | 464 | lean | import evaluation
import backends.bfs.baseline
import all
open baseline
example {p q : Prop} (h₁ : p) (h₂ : q) : p ∧ q :=
begin
tidy
end
universe u
example {α : Type u} (p : α → Prop) [decidable_pred p] (l : list α) :
list.partition p l = (list.filter p l, list.filter (not ∘ p) l) :=
begin
simp at *
end
-- ex... |
bf6f6f56ee8d0ba24c9b589449efbaa5354ea720 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/allGoals.lean | e0b10b8d30e68c96bdcb322ed900f670fcdc2dad | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 1,700 | lean | inductive Weekday where
| sunday : Weekday
| monday : Weekday
| tuesday : Weekday
| wednesday : Weekday
| thursday : Weekday
| friday : Weekday
| saturday : Weekday
def Weekday.next : Weekday -> Weekday :=
fun d => match d with
| sunday => monday
| monday => tuesday
| tue... |
bc9974b59fb845fc8392c3f385c9ace8d735e083 | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /11_Tactic-Style_Proofs.org.10.lean | f73efd625835834ef32ff2c766360aa6b07c34f5 | [] | 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 | 139 | lean | import standard
example : ∀ a b c : nat, a = b → a = c → c = b :=
begin
intros [a, b, c, H1, H2],
exact eq.trans (eq.symm H2) H1
end
|
550fa1b7633b97095e2a2aefe01aa2bbb14d2687 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/topology/category/TopCommRing_auto.lean | f910dd581e5a54836eb9befb4f8f3fd79d9b2d0f | [] | 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 | 4,338 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.algebra.category.CommRing.basic
import Mathlib.topology.category.Top.basic
import Mathlib.t... |
7154598aa05f1ecd3ed4b1da91e48e4672f3f6bf | 618003631150032a5676f229d13a079ac875ff77 | /src/data/list/nodup.lean | 184d78c70eb77a47ff61261c3c28237fc2580bd7 | [
"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,497 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Kenny Lau
-/
import data.list.pairwise
import data.list.forall2
universes u v
open nat function
variables {α : Type u} {β : Type v}
namespace list
/- no duplicates... |
1201b0ae395d6a128777812a272dbe08c122ebe9 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /library/data/finset/equiv.lean | 92cc2d4b54b8fd2b0554233302dee60ba572f4e2 | [
"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 | 13,772 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
import data.finset.card
open nat decidable
namespace finset
variable {A : Type}
protected definition to_nat (s : finset nat) : nat :=
finset.Sum s (λ n, 2^... |
7465bf1be44fd4014e4decaacb480869c2ecf6ce | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/control/monad/cont.lean | 557b6acd8154b25a08e4bea4ee000e4eeaec65ca | [
"Apache-2.0"
] | permissive | Lix0120/mathlib | 0020745240315ed0e517cbf32e738d8f9811dd80 | e14c37827456fc6707f31b4d1d16f1f3a3205e91 | refs/heads/master | 1,673,102,855,024 | 1,604,151,044,000 | 1,604,151,044,000 | 308,930,245 | 0 | 0 | Apache-2.0 | 1,604,164,710,000 | 1,604,163,547,000 | null | UTF-8 | Lean | false | false | 9,360 | lean | /-
Copyright (c) 2019 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Simon Hudon
Monad encapsulating continuation passing programming style, similar to
Haskell's `Cont`, `ContT` and `MonadCont`:
<http://hackage.haskell.org/package/mtl-2.2.2/docs/Control-Mo... |
b3dffe855573e5cafd91e7ab8803b76c8a3d1647 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /archive/miu_language/basic.lean | ad139d96ffe3b085667740c116ae06031cb31a92 | [
"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,146 | lean | /-
Copyright (c) 2020 Gihan Marasingha. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gihan Marasingha
-/
import tactic.linarith
/-!
# An MIU Decision Procedure in Lean
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding PR ... |
ea0dde66d501f070c72db452648446a4a530f3c7 | 0845ae2ca02071debcfd4ac24be871236c01784f | /library/init/data/persistentarray/default.lean | c6da178b65958c0c810eebd1a201a7ab1b798fb3 | [
"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 | 211 | 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.persistentarray.basic
|
ee56d7e141a2897f9da099e748125bca4dafa65a | 36c7a18fd72e5b57229bd8ba36493daf536a19ce | /tests/lean/ftree.lean | 2ec6f1b727dd9fb11937cf2ac26e7c7387d42574 | [
"Apache-2.0"
] | permissive | YHVHvx/lean | 732bf0fb7a298cd7fe0f15d82f8e248c11db49e9 | 038369533e0136dd395dc252084d3c1853accbf2 | refs/heads/master | 1,610,701,080,210 | 1,449,128,595,000 | 1,449,128,595,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 757 | lean | inductive list (T : Type) : Type := nil {} : list T | cons : T → list T → list T
namespace explicit
inductive ftree.{l₁ l₂} (A : Type.{l₁}) (B : Type.{l₂}) : Type.{max 1 l₁ l₂} :=
leafa : A → ftree A B |
leafb : B → ftree A B |
node : (A → ftree A B) → (B → ftree A B) → ftree A B
end explicit
namespace implicit
... |
ad7033344e608071810750b10b7b9cf9ca45d38c | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/category_theory/abelian/pseudoelements.lean | acf8374cdeb661c40915faf1007b4111724be8d7 | [
"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 | 19,213 | lean | /-
Copyright (c) 2020 Markus Himmel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel
-/
import category_theory.abelian.exact
import category_theory.over
/-!
# Pseudoelements in abelian categories
A *pseudoelement* of an object `X` in an abelian category ... |
d73295a0f37d9b46ac74a78984098e0b0cffc43d | 0d107d7abd6ae235d586830f8e09b1b30e7eef0b | /src/google_interview/Solution.lean | fd2d29c2827a52897db2482d9b8686a3a6b4a1df | [] | no_license | ukikagi/codewars-lean | 6b9a83ebbb159e7eebf8551b745a1c4d450e747f | 1912f2a4e25e917abfce70d65c0469cfac19dc93 | refs/heads/master | 1,672,948,190,244 | 1,603,361,004,000 | 1,603,795,841,000 | 303,746,208 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 484 | lean | import .Preloaded
/-
universes u
inductive mytree (A : Type u) : Type u
| leaf : A → mytree
| branch : A → mytree → mytree → mytree
def flip_mytree {A : Type u} : mytree A → mytree A
| t@(mytree.leaf _) := t
| (mytree.branch a l r) := mytree.branch a (flip_mytree r) (flip_mytree l)
-/
universe u
theorem flip_f... |
fb2c0b7b959d58e2982411fddd5188f3469bbf0c | 17d3c61bf162bf88be633867ed4cb201378a8769 | /tests/lean/interactive/rb_map_ts.lean | cad744cd013202baa897dcebb5da53c98a616816 | [
"Apache-2.0"
] | permissive | u20024804/lean | 11def01468fb4796fb0da76015855adceac7e311 | d315e424ff17faf6fe096a0a1407b70193009726 | refs/heads/master | 1,611,388,567,561 | 1,485,836,506,000 | 1,485,836,625,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,999 | lean | meta def mytac :=
state_t (name_map nat) tactic
meta instance : monad mytac :=
state_t.monad _ _
meta instance : monad.has_monad_lift tactic mytac :=
monad.monad_transformer_lift (state_t (name_map nat)) tactic
meta instance (α : Type) : has_coe (tactic α) (mytac α) :=
⟨monad.monad_lift⟩
namespace mytac
meta def s... |
16c3ca1cd94245e4f41b3dd776134118aa72d805 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/order/fixed_points.lean | cb7fecc3fda1c2550f99e4c696f8b490690df0cf | [
"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 | 9,452 | 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, Kenny Lau, Yury Kudryashov
-/
import dynamics.fixed_points.basic
import order.hom.order
/-!
# Fixed point construction on complete lattices
This file sets up the basi... |
9accd9d2e01377ebcf4cc326045e24ec778c01be | 43390109ab88557e6090f3245c47479c123ee500 | /src/xenalib/M1P1.lean | 8df2b62ae7eadfd3d083b94e6d7b11331c93549f | [
"Apache-2.0"
] | permissive | Ja1941/xena-UROP-2018 | 41f0956519f94d56b8bf6834a8d39473f4923200 | b111fb87f343cf79eca3b886f99ee15c1dd9884b | refs/heads/master | 1,662,355,955,139 | 1,590,577,325,000 | 1,590,577,325,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,478 | lean | import data.real.basic
import chris_hughes_various.exponential.exponential
definition is_deriv (f : ℝ → ℝ) (x : ℝ) (d : ℝ) : Prop :=
-- d = derivative of f at x
-- limit of f(x+h)-f(x) / h = d as h tends to zero
∀ ε > 0, ∃ δ > 0, ∀ h, abs h < δ ∧ h ≠ 0 → abs ((f (x + h) - f x) / h - d) < ε
--#print group
definiti... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.