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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
ad0320a7ba3b0d8c630cb6ed307afdfa2a249929 | 38bf3fd2bb651ab70511408fcf70e2029e2ba310 | /src/tactic/sanity_check.lean | 5c846ffc606d388d3f1be9617788588ebdc91d36 | [
"Apache-2.0"
] | permissive | JaredCorduan/mathlib | 130392594844f15dad65a9308c242551bae6cd2e | d5de80376088954d592a59326c14404f538050a1 | refs/heads/master | 1,595,862,206,333 | 1,570,816,457,000 | 1,570,816,457,000 | 209,134,499 | 0 | 0 | Apache-2.0 | 1,568,746,811,000 | 1,568,746,811,000 | null | UTF-8 | Lean | false | false | 13,292 | 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
-/
import tactic.core
/-!
# sanity_check command
This file defines the following user commands to spot common mistakes in the code.
* `#sanity_check`: check al... |
330cb67086e21c809f55e32e6087654c1bc5d7ef | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /src/Lean/Meta/SynthInstance.lean | bf5a850873528983eb77b6ff59d83b79e06411d8 | [
"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 | 34,768 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Daniel Selsam, Leonardo de Moura
Type class instance synthesizer using tabled resolution.
-/
import Lean.Meta.Basic
import Lean.Meta.Instances
import Lean.Meta.AbstractMVars
im... |
f4820af428c54e292d1db8f9472ebc2758ac6d52 | 735bb6d9c54e20a6bdc031c27bff1717e68886b9 | /tools/auto/finish.lean | 26ecc2a0dee4e71a7dc47ab2fc082e84e1b31a7a | [] | no_license | digama0/library_dev | 3ea441564c4d7eca54a562b701febaa4db6a1061 | 56520d5d1dda46d87c98bf3acdf850672fdab00f | refs/heads/master | 1,611,047,574,219 | 1,500,469,648,000 | 1,500,469,648,000 | 87,738,883 | 0 | 0 | null | 1,491,771,880,000 | 1,491,771,879,000 | null | UTF-8 | Lean | false | false | 14,287 | lean | /-
Copyright (c) 2017 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
These tactics do straightforward things: they call the simplifier, split conjunctive assumptions,
eliminate existential quantifiers on the left, and look for contradictio... |
f05ee3331c4545d952702a7c54a482fc0230134c | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/linear_algebra/quotient.lean | 2f3d8f59ce4d250f4dcebebad9d68e8d5a898e84 | [
"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 | 16,995 | 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, Yury Kudryashov
-/
import linear_algebra.basic
/-!
# Quotients by submodules
* If `p` is a submodule of `M`, `M ⧸ p` is the quotient of... |
572630c017a68195b863a562a26ef6bea4bb9c02 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /doc/examples/NFM2022/nfm23.lean | f51a1d255f21d9e5dedbc421d1baac1e3b714f45 | [
"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 | 529 | lean | /- split tactic -/
def f (x y z : Nat) : Nat :=
match x, y, z with
| 5, _, _ => y
| _, 5, _ => y
| _, _, 5 => y
| _, _, _ => 1
example : x ≠ 5 → y ≠ 5 → z ≠ 5 → z = w → f x y w = 1 := by
intros
simp [f]
split
. contradiction
. contradiction
. contradiction
. rfl
def g (xs ys : List Nat) : Nat... |
bd201156441bda44a19e30771713341505df9ed9 | de44c57911f8f2292d4105ccefe4372f3880a7b7 | /src/moromoro.lean | 55fe3fda00e5e62820214600d08dd958f44364ca | [] | no_license | nyuichi/LeanHOL | 108b1df4daab61b60b0160a7f56cf6b7dd8f57fe | 8190f2d4234f0f39c9e7b5612e552e72ab002798 | refs/heads/master | 1,587,207,990,491 | 1,569,724,629,000 | 1,569,724,629,000 | 167,488,678 | 22 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 346 | lean | -- things not defined in the standard library (but which should be)
universes u v
variables {α : Sort u} {β : Sort v}
lemma inv_image.equivalence (r : β → β → Prop) (f : α → β) (h : equivalence r) : equivalence (inv_image r f) :=
mk_equivalence _
(by intro x; apply h.1)
(by intros x y; apply h.2.1)
(by intros x y z;... |
0e3a1f97475aa509bdde3566883e5f81fcd23ad6 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/data/real/ennreal.lean | f3784053c39c2cbbe45d574bd0b8e5ac1fc24c41 | [
"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 | 65,296 | 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 data.real.nnreal
import data.set.intervals
/-!
# Extended non-negative reals
We define `ennreal = ℝ≥0∞ := with_no ℝ≥0` to be the type of ext... |
0506ef042416926179526ef24f04e006c9a10e45 | f57570f33b51ef0271f8c366142363d5ae8fff45 | /src/simplified_predicate_logic.lean | dbbabcc6d24857b0ee23731353f9dbb7c2670673 | [] | no_license | maxd13/lean-logic | 4083cb3fbb45b423befca7fda7268b8ba85ff3a6 | ddcab46b77adca91b120a5f37afbd48794da8b52 | refs/heads/master | 1,692,257,681,488 | 1,631,740,832,000 | 1,631,740,832,000 | 246,324,437 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 33,849 | lean | import data.set.countable tactic.find tactic.tidy tactic.ring
universe u
-- We introduce a much simplified version of
-- untyped first order (minimal) predicate logic.
-- make all propositions decidable.
-- Allows us to freely use ifs like in Haskell
-- but then we must add noncomputable to all functions
-- local at... |
876f72d3939ccae6e204b018dea6dc403a832ca2 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /src/Lean/Util/Sorry.lean | 34012824ccacb0e21da259da84c7a9d522508119 | [
"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 | 2,278 | 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.Message
import Lean.Exception
import Lean.Util.FindExpr
namespace Lean
def Expr.isSorry : Expr → Bool
| app (app (.const ``sorryAx ..) ..) .... |
1a43b3f06fa114de0405a0e7f37600695e567ad7 | a4673261e60b025e2c8c825dfa4ab9108246c32e | /stage0/src/Init/Data.lean | 9e7a15cadfda407f2789a8a09007e7f2f7ea3b26 | [
"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 | 572 | 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.Data.Basic
import Init.Data.Nat
import Init.Data.Char
import Init.Data.String
import Init.Data.List
import Init.Data.Int
import Init.Dat... |
f59b777d7bb5f26f92c77d95b80e0ebfa6627740 | 3b15c7b0b62d8ada1399c112ad88a529e6bfa115 | /stage0/src/Lean/Elab/Structure.lean | cf60a36fa7383e7489e23d38d01cdeded6e74b77 | [
"Apache-2.0"
] | permissive | stephenbrady/lean4 | 74bf5cae8a433e9c815708ce96c9e54a5caf2115 | b1bd3fc304d0f7bc6810ec78bfa4c51476d263f9 | refs/heads/master | 1,692,621,473,161 | 1,634,308,743,000 | 1,634,310,749,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 44,162 | 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.Parser.Command
import Lean.Meta.Closure
import Lean.Meta.SizeOf
import Lean.Meta.Injective
import Lean.Meta.Structure
import Lean.Meta.AppBuilde... |
5d6c155259f6b5b2716db88d28028654ff5465bc | 206422fb9edabf63def0ed2aa3f489150fb09ccb | /src/data/complex/exponential.lean | 6201e1df23b61b85128f3a7c6b574f36aa13a6b5 | [
"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 | 61,163 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Abhimanyu Pallavi Sudhir
-/
import algebra.geom_sum
import data.nat.choose.sum
import data.complex.basic
/-!
# Exponential, trigonometric and hyperbolic trigonometric funct... |
b1c134d9dbd89314f88e7110d2af87b5cd644ebd | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/linear_algebra/matrix/to_linear_equiv.lean | be08b349688814064ce9acc2c57ccf388692121e | [
"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 | 7,363 | lean | /-
Copyright (c) 2019 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Patrick Massot, Casper Putz, Anne Baanen
-/
import linear_algebra.matrix.nonsingular_inverse
import linear_algebra.matrix.to_lin
import ring_theory.localization
/-!
# ... |
5adb3eecb68eddb4b9720850b2c55eaac50aa31c | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/nat/choose/factorization.lean | f856c8de6eb62eae34d0dc2345ae1b8924caa62c | [
"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,658 | lean | /-
Copyright (c) 2022 Bolton Bailey. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bolton Bailey, Patrick Stevens, Thomas Browning
-/
import data.nat.choose.central
import data.nat.factorization.basic
import data.nat.multiplicity
/-!
# Factorization of Binomial Coef... |
314c69c707d2cae77162ca0b12f60b68a7b69779 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/measure_theory/integral/set_integral.lean | 9b20f3ce4b6bf92a3929e2331b490191a71f34ac | [
"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 (c) 2020 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou, Yury Kudryashov
-/
import measure_theory.integral.integrable_on
import measure_theory.integral.bochner
import order.filter.indicator_function
/-!
# Set integral
In this... |
f33325fdddb90e040ceab2c2533d0e7954d2c196 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/control/fold_auto.lean | 248791271856c75246aabb0e09ac708bc410cd5d | [] | 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 | 15,212 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon, Sean Leather
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.algebra.free_monoid
import Mathlib.algebra.opposites
import Mathlib.control.travers... |
5ce76625879976868e960c231c7252081c8ee493 | b3fced0f3ff82d577384fe81653e47df68bb2fa1 | /src/measure_theory/simple_func_dense.lean | 1b989a467ac0eac7bbb4b4d31a8d24f0837f4b73 | [
"Apache-2.0"
] | permissive | ratmice/mathlib | 93b251ef5df08b6fd55074650ff47fdcc41a4c75 | 3a948a6a4cd5968d60e15ed914b1ad2f4423af8d | refs/heads/master | 1,599,240,104,318 | 1,572,981,183,000 | 1,572,981,183,000 | 219,830,178 | 0 | 0 | Apache-2.0 | 1,572,980,897,000 | 1,572,980,896,000 | null | UTF-8 | Lean | false | false | 15,139 | lean | /-
Copyright (c) 2019 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou
Show that each Borel measurable function can be approximated,
both pointwise and in L¹ norm, by a sequence of simple functions.
-/
import measure_theory.l1_space
noncom... |
f0cf675365d3716c0563e950427d11d39dcbdb7a | ae1e94c332e17c7dc7051ce976d5a9eebe7ab8a5 | /stage0/src/Init/Control/EState.lean | 04dc034f0c4aa15d63ebf2e5e4f3e2d816a76cd1 | [
"Apache-2.0"
] | permissive | dupuisf/lean4 | d082d13b01243e1de29ae680eefb476961221eef | 6a39c65bd28eb0e28c3870188f348c8914502718 | refs/heads/master | 1,676,948,755,391 | 1,610,665,114,000 | 1,610,665,114,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,995 | 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.Control.State
import Init.Control.Except
import Init.Data.ToString.Basic
universes u v
namespace EStateM
variables {ε σ α : Type u}
i... |
15b351114495d69eb85be6eeb2dbd3de8ab8b491 | abd85493667895c57a7507870867b28124b3998f | /src/analysis/special_functions/trigonometric.lean | c71997dbf548493685a52db15a191844a5165946 | [
"Apache-2.0"
] | permissive | pechersky/mathlib | d56eef16bddb0bfc8bc552b05b7270aff5944393 | f1df14c2214ee114c9738e733efd5de174deb95d | refs/heads/master | 1,666,714,392,571 | 1,591,747,567,000 | 1,591,747,567,000 | 270,557,274 | 0 | 0 | Apache-2.0 | 1,591,597,975,000 | 1,591,597,974,000 | null | UTF-8 | Lean | false | false | 65,938 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Abhimanyu Pallavi Sudhir, Jean Lo, Calle Sönne
-/
import analysis.special_functions.exp_log
/-!
# Trigonometric functions
## Main definitions
This file contains the foll... |
f8b46572ea1d73f035e295d5d98f89ba0775bfff | 367134ba5a65885e863bdc4507601606690974c1 | /src/tactic/norm_num.lean | 9647de35395a0212a0bf14cfec06162e4b628959 | [
"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 | 60,013 | lean | /-
Copyright (c) 2017 Simon Hudon All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon, Mario Carneiro
-/
import data.rat.cast
import data.rat.meta_defs
/-!
# `norm_num`
Evaluating arithmetic expressions including `*`, `+`, `-`, `^`, `≤`.
-/
universes u v w
n... |
06f264960aa4089363e69b2db04b9eb0b891a7b2 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /src/Init/Lean/Meta/Tactic/Assert.lean | 90f04d218222b0744c7367e9095ad2a48688bdfb | [
"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,296 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import Init.Lean.Meta.Tactic.Util
namespace Lean
namespace Meta
/--
Convert the given goal `Ctx |- target` into `Ctx |- type -> target`.
It as... |
6a636e45bb5fa7876c718c7192e7b72b13b5c3e3 | f618aea02cb4104ad34ecf3b9713065cc0d06103 | /src/number_theory/pell.lean | d1ad05605ae8cf1c5c67172938ba80c1a2dd2173 | [
"Apache-2.0"
] | permissive | joehendrix/mathlib | 84b6603f6be88a7e4d62f5b1b0cbb523bb82b9a5 | c15eab34ad754f9ecd738525cb8b5a870e834ddc | refs/heads/master | 1,589,606,591,630 | 1,555,946,393,000 | 1,555,946,393,000 | 182,813,854 | 0 | 0 | null | 1,555,946,309,000 | 1,555,946,308,000 | null | UTF-8 | Lean | false | false | 37,667 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.nat.prime data.nat.modeq data.zsqrtd.basic
local attribute [instance, priority 0] nat.cast_coe
namespace pell
open nat
section
parameters {a : ℕ} (a1... |
df4e40cb5e0feac269d6c4e3f493fd1e6c7afbe2 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/967.lean | e3a17f00e6bb39639371e9323ed189dbf6e3d650 | [
"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 | 158 | lean | variables (A : Type)
definition f (A : Type) (a : A) := a
inductive bla (A : Type) :=
| mk : A → bla A
structure foo (A : Type) (f : A → A) :=
(a : A)
|
e03f1dc172ca6817df4065b6b7409e0c794751ea | eb9357a70318e50e095b58730bebfe0cffee457f | /lean/love10_denotational_semantics_exercise_sheet.lean | a45caf233f059db4365a2381fe1da357ef4efdb2 | [] | no_license | Vierkantor/logical_verification_2021 | 7485dd916953131d501760f023d5b30fbb74d36a | 9500b9c194e22a9ab4067321cfed7a1f445afcfc | refs/heads/main | 1,692,560,845,086 | 1,624,721,275,000 | 1,624,721,275,000 | 416,354,079 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,612 | lean | import .love10_denotational_semantics_demo
/-! # LoVe Exercise 10: Denotational Semantics -/
set_option pp.beta true
set_option pp.generalized_field_notation false
namespace LoVe
/-! ## Question 1: Monotonicity
1.1. Prove the following lemma from the lecture. -/
lemma monotone_comp {α β : Type} [partial_order ... |
bf0aad78a58351d8072b6507be6bb468d7738c4a | 367134ba5a65885e863bdc4507601606690974c1 | /src/topology/metric_space/antilipschitz.lean | 0fb8191d839d35c26e690b24e0542a9ec1a156e7 | [
"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 | 6,491 | 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 topology.metric_space.lipschitz
/-!
# Antilipschitz functions
We say that a map `f : α → β` between two (extended) metric spaces is
`antilipschitz_with K`,... |
39b5f4193c4ee538bf78432babac755f4a76ce9e | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/nat/squarefree.lean | 55c412691488fb1ce0e224e3ff34d3d915902749 | [
"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 | 22,204 | lean | /-
Copyright (c) 2020 Aaron Anderson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson
-/
import algebra.squarefree
import data.nat.factorization.prime_pow
import data.nat.prime_norm_num
import ring_theory.int.basic
/-!
# Lemmas about squarefreeness of na... |
a0e627fdad11061a623e8792e7ff440f4fc6ccbe | 38bf3fd2bb651ab70511408fcf70e2029e2ba310 | /src/data/zmod/quadratic_reciprocity.lean | bff898c2059196adc5d058ea00f4a36e3e9e45ac | [
"Apache-2.0"
] | permissive | JaredCorduan/mathlib | 130392594844f15dad65a9308c242551bae6cd2e | d5de80376088954d592a59326c14404f538050a1 | refs/heads/master | 1,595,862,206,333 | 1,570,816,457,000 | 1,570,816,457,000 | 209,134,499 | 0 | 0 | Apache-2.0 | 1,568,746,811,000 | 1,568,746,811,000 | null | UTF-8 | Lean | false | false | 33,330 | 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 field_theory.finite data.zmod.basic algebra.pi_instances
open function finset nat finite_field zmodp
namespace zmodp
variables {p q : ℕ} (hp : nat.prime p) (hq ... |
6407ebad8b6d791f1d446371199a09c55069deaa | d7189ea2ef694124821b033e533f18905b5e87ef | /galois/arith/dense_linear.lean | 8bf9a11c556f0d93b7d356cf305c755b207287e3 | [
"Apache-2.0"
] | permissive | digama0/lean-protocol-support | eaa7e6f8b8e0d5bbfff1f7f52bfb79a3b11b0f59 | cabfa3abedbdd6fdca6e2da6fbbf91a13ed48dda | refs/heads/master | 1,625,421,450,627 | 1,506,035,462,000 | 1,506,035,462,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 25,352 | lean | /- In this file, we define the core procedure behind
Fourier-Motzkin variable elimination over ℚ, and prove
its correctness.
-/
import data.rat
galois.tactic
.dense_linear_lemmas
galois.list
galois.list.fpow
galois.vector.lemmas
galois.vector.dot_product
galois.li... |
1a46302ae8583ffaef45ff99719e35727ee69ac3 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/geometry/manifold/instances/sphere.lean | f012ecaa9f3ec5f97c84f0b93249b382365935b4 | [
"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 | 20,407 | lean | /-
Copyright (c) 2021 Heather Macbeth. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Heather Macbeth
-/
import analysis.complex.circle
import analysis.inner_product_space.calculus
import analysis.inner_product_space.pi_L2
import geometry.manifold.algebra.lie_group
imp... |
e7a1ff566608ae7c2a8e3700d479db444e997fbb | 5d166a16ae129621cb54ca9dde86c275d7d2b483 | /tests/lean/interactive/rb_map_ts.lean | f713b5c3220b8d078f0130f9f04b7d8d4266c139 | [
"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 | 2,159 | 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... |
62f42833e937e7be4696801a5f81623494d99c97 | c8b4b578b2fe61d500fbca7480e506f6603ea698 | /src/flt_three/primes.lean | 123e08e958b0719f7845a0197d2795a693f2b141 | [] | no_license | leanprover-community/flt-regular | aa7e564f2679dfd2e86015a5a9674a6e1197f7cc | 67fb3e176584bbc03616c221a7be6fa28c5ccd32 | refs/heads/master | 1,692,188,905,751 | 1,691,766,312,000 | 1,691,766,312,000 | 421,021,216 | 19 | 4 | null | 1,694,532,115,000 | 1,635,166,136,000 | Lean | UTF-8 | Lean | false | false | 2,916 | lean | /-
Copyright (c) 2020 Ruben Van de Velde. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
-/
import data.int.parity
import ring_theory.int.basic
section
variables {R : Type*} [comm_ring R] {x y z : R}
lemma coprime_add_self_pow
{n : ℕ}
(hn : 0 < n)
(hsoln : x ^ n + y ^ n... |
01c676ebd6dfef8f219839124a3c066c4b3dd517 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /stage0/src/Lean/Parser/Do.lean | 1eb453c70e432008de1a7ee3b1b5fac1cea9f1cd | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | cipher1024/lean4 | 6e1f98bb58e7a92b28f5364eb38a14c8d0aae393 | 69114d3b50806264ef35b57394391c3e738a9822 | refs/heads/master | 1,642,227,983,603 | 1,642,011,696,000 | 1,642,011,696,000 | 228,607,691 | 0 | 0 | Apache-2.0 | 1,576,584,269,000 | 1,576,584,268,000 | null | UTF-8 | Lean | false | false | 7,312 | 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.Parser.Term
namespace Lean
namespace Parser
builtin_initialize registerBuiltinParserAttribute `builtinDoElemParser `doElem
builtin_initialize ... |
bd3b14bf99bf7a058f45c930a7f8843e773f8181 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/linear_algebra/sesquilinear_form.lean | b9e8e550fb9512cd3d714890a751c0d04620e352 | [
"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 | 29,088 | lean | /-
Copyright (c) 2018 Andreas Swerdlow. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Andreas Swerdlow
-/
import algebra.module.linear_map
import linear_algebra.basis.bilinear
import linear_algebra.bilinear_map
import algebra.euclidean_domain.instances
import ring_the... |
9581fad437c296bb69d7db312e19c3a691b56be0 | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /src/algebra/ordered_ring.lean | 86d8b8049f65eb4370d159babc923374953b206d | [
"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 | 43,806 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Mario Carneiro
-/
import algebra.ring
import algebra.ordered_group
set_option default_priority 100 -- see Note [default priority]
set_option old_struc... |
ac14b273e19615b357006073d7d21ba4415eaffc | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/order/rel_iso/set.lean | 5f236405bc97e8a213ca1b98c5d1296632b5600c | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 2,859 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import order.rel_iso.basic
import logic.embedding.set
/-!
# Interactions between relation homomorphisms and sets
It is likely that there are better homes for many o... |
ce82ffebdcc8e0c805c5a74db34c50ab6dd3ce43 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/seq/parallel.lean | 80f7dfc0832e7bae98f607752aae336375b4e189 | [
"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,117 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
Parallel computation of a computable sequence of computations by
a diagonal enumeration.
The important theorems of this operation are proven as
terminates_parall... |
2d0addcce4e4b2570655ebf5a52dffdba576503b | a4673261e60b025e2c8c825dfa4ab9108246c32e | /tests/lean/run/finally.lean | 19f6580c41f8d4082b37bb093abba2b0eb81c394 | [
"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 | 1,835 | lean | def checkM (b : IO Bool) : IO Unit :=
unless (← b) do throw $ IO.userError "failed"
abbrev M := ExceptT String $ StateRefT Nat IO
def f1 : M Nat :=
throw "error 1"
def f2 : M Nat :=
throwThe IO.Error $ IO.userError "error 2"
def tst1 : M Nat := do
try
try f1 finally set 100; IO.println "finisher executed"
catch _... |
150732a8361dc8057b9bdefb305feb80d350550f | 0845ae2ca02071debcfd4ac24be871236c01784f | /tests/playground/arith_eval_uint32.lean | 09ceac438c651bf079945e280900abddf9255856 | [
"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 | 454 | lean | inductive Expr
| Var : UInt32 → Expr
| Val : UInt32 → Expr
| Add : Expr → Expr → Expr
open Expr
def dec (n : UInt32) : UInt32 :=
if n = 0 then 0 else n-1
def mkExpr : UInt32 → UInt32 → Expr | n v :=
if n = 0 then Val v
else Add (mkExpr (n-1) (v+1)) (mkExpr (n-1) (dec v))
def eval : Expr → UInt32
| (Var x) := 0
| (V... |
e3073ea60034f5052cba804d249092b8f47e1e39 | d450724ba99f5b50b57d244eb41fef9f6789db81 | /src/instructor/lectures/lecture_2.lean | 64610b9936ec5a41b90bd2a6cc2a755a76a7d7cc | [] | no_license | jakekauff/CS2120F21 | 4f009adeb4ce4a148442b562196d66cc6c04530c | e69529ec6f5d47a554291c4241a3d8ec4fe8f5ad | refs/heads/main | 1,693,841,880,030 | 1,637,604,848,000 | 1,637,604,848,000 | 399,946,698 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,430 | lean | /-
In this file, we give formal statements (our version)
of the two axioms of equality. We also present Lean's
versions of these rules, and show how you can use them
without giving all of the arguments explicitly.
-/
/-
INFERENCE RULE #1/2: EQUALITY IS REFLEXIVE
Everything is equal to itself. A bit more formally,
if ... |
fd6f594b5d2008f80229def9bd9b486a81fae902 | 07c6143268cfb72beccd1cc35735d424ebcb187b | /src/category_theory/monad/limits.lean | 8fe90fe619cbffbd68532c264e877e65efb356cd | [
"Apache-2.0"
] | permissive | khoek/mathlib | bc49a842910af13a3c372748310e86467d1dc766 | aa55f8b50354b3e11ba64792dcb06cccb2d8ee28 | refs/heads/master | 1,588,232,063,837 | 1,587,304,803,000 | 1,587,304,803,000 | 176,688,517 | 0 | 0 | Apache-2.0 | 1,553,070,585,000 | 1,553,070,585,000 | null | UTF-8 | Lean | false | false | 10,504 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Bhavik Mehta
-/
import category_theory.monad.adjunction
import category_theory.adjunction.limits
import category_theory.limits.creates
namespace category_theory
open c... |
6da5d72a2b89fd3b9269b8d867ee4b0798abc5c4 | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/category_theory/concrete_category/basic.lean | 2e7c4bd37d1ec8fa208e2a140c06ab94def009d8 | [
"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,322 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Johannes Hölzl, Reid Barton, Sean Leather, Yury Kudryashov
-/
import category_theory.types category_theory.full_subcategory
/-!
# Concrete categories
A concrete categ... |
3b8e48c098deee7a986c0165fea63a00e71ce8ca | 9dc8cecdf3c4634764a18254e94d43da07142918 | /archive/imo/imo1987_q1.lean | a70d2de162618c0b676abc25129756160a714ae6 | [
"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 | 4,120 | 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 data.fintype.card
import dynamics.fixed_points.basic
/-!
# Formalization of IMO 1987, Q1
Let $p_{n, k}$ be the number of permutations of a set of cardinali... |
90bea0f2f664a0f3a876a6ec785c2607b3c3fda9 | 491068d2ad28831e7dade8d6dff871c3e49d9431 | /tests/lean/run/struct_inst_exprs.lean | 36b3109242d95d8b554dcf5d3a9d976877c1607c | [
"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 | 453 | lean | open nat prod
set_option pp.coercions true
definition s : nat × nat := pair 10 20
structure test :=
(A : Type) (a : A) (B : A → Type) (b : B a)
definition s2 := ⦃ test, a := 3, b := 10 ⦄
eval s2
definition s3 := {| test, a := 20, s2 |}
eval s3
definition s4 := ⦃ test, A := nat, B := λ a, nat, a := 10, b := 10 ⦄... |
b6e326c9a1de377d460a5c7697cbab4d4f4eb8b9 | 91b8df3b248df89472cc0b753fbe2bac750aefea | /experiments/lean/src/ddl/binary/kinding.lean | bd989841952158129d41ad27af3b59ebc73fb5ba | [
"Apache-2.0",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | yeslogic/fathom | eabe5c4112d3b4d5ec9096a57bb502254ddbdf15 | 3960a9466150d392c2cb103c5cb5fcffa0200814 | refs/heads/main | 1,685,349,769,736 | 1,675,998,621,000 | 1,675,998,621,000 | 28,993,871 | 214 | 11 | Apache-2.0 | 1,694,044,276,000 | 1,420,764,938,000 | Rust | UTF-8 | Lean | false | false | 2,034 | lean | import ddl.binary.basic
import ddl.binary.repr
import ddl.binder
import ddl.ctx
import ddl.host.typing
namespace ddl.binary
open ddl
open ddl.binary
section
variables {ℓ α : Type} [decidable_eq ℓ]
inductive has_kind : ctx ℓ → type ℓ α → kind → Prop
| bvar {Γ} (x : ℕ) {k} :
ctx.lookup ... |
87e354489d14e1ca2c8e1330c612e56d549060ed | 570f46c4bf91dd2d8b97fc9d43ce1c435867f7dc | /src/solutions/09_limits_final.lean | 3cf3588c14e67f8341eaf39f72660adcdfc35a33 | [
"Apache-2.0"
] | permissive | Timeroot/tutorials | ef586f20e059c2cfa2b044e5663ea98f32c86646 | ff7a6c1ad58b2eedfdc7303661e19409656467ab | refs/heads/master | 1,691,446,431,254 | 1,633,556,762,000 | 1,633,556,762,000 | 414,377,840 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 12,756 | lean | import tuto_lib
set_option pp.beta true
set_option pp.coercions false
/-
This is the final file in the series. Here we use everything covered
in previous files to prove a couple of famous theorems from
elementary real analysis. Of course they all have more general versions
in mathlib.
As usual, keep in mind the fol... |
02c83dc3a5f01688f4b79c85b0933bec72c01a32 | bb31430994044506fa42fd667e2d556327e18dfe | /src/field_theory/separable_degree.lean | e91513df84c43f219090e432a11d9d3f86d721cd | [
"Apache-2.0"
] | permissive | sgouezel/mathlib | 0cb4e5335a2ba189fa7af96d83a377f83270e503 | 00638177efd1b2534fc5269363ebf42a7871df9a | refs/heads/master | 1,674,527,483,042 | 1,673,665,568,000 | 1,673,665,568,000 | 119,598,202 | 0 | 0 | null | 1,517,348,647,000 | 1,517,348,646,000 | null | UTF-8 | Lean | false | false | 5,298 | lean | /-
Copyright (c) 2021 Jakob Scholbach. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jakob Scholbach
-/
import algebra.algebra.basic
import algebra.char_p.exp_char
import field_theory.separable
/-!
# Separable degree
This file contains basics about the separable de... |
eb98f3e85ef84f1d7ac9c1225b9db179fe093aad | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/finset/lattice.lean | f86ede26b60351514038c9b88dc3fb768b960bad | [
"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 | 64,031 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.finset.fold
import data.finset.option
import data.finset.prod
import data.multiset.lattice
import order.complete_lattice
/-!
# Lattice operations on fins... |
a8febd4970844d08334127d0df9d21a7b800bbcc | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/analysis/box_integral/partition/additive.lean | d89fe1b178380dacc86428abf713abae71ca2513 | [
"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,518 | 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.box_integral.partition.split
import analysis.normed_space.operator_norm
import data.set.intervals.proj_Icc
/-!
# Box additive functions
We say tha... |
a26cb6eb6b8d96dca2fe77d3fd156718bbc63090 | 4727251e0cd73359b15b664c3170e5d754078599 | /archive/imo/imo1998_q2.lean | b914c0fc5f13796b858560cc49cc3cfe8d1bdb03 | [
"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 | 9,561 | 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 data.fintype.basic
import data.int.parity
import algebra.big_operators.order
import tactic.ring
import tactic.noncomm_ring
/-!
# IMO 1998 Q2
In a competition, there... |
4b7ee8b6122a949d34e3d44f6937313159022887 | b24beef0a8b1a8e92be756a25aa78e24908b2b14 | /src/demos/category_theory.lean | 95a3077ec7b524166e16e879aedc6162b584ab23 | [] | permissive | ChristopheMargerin/lftcm2020 | 14967e74cbe92a7b61d32d8130f32cfa09b5172b | 589180047fa4fdfb3179636db58b0b0320549871 | refs/heads/master | 1,668,536,269,632 | 1,594,891,664,000 | 1,594,891,664,000 | 280,112,730 | 0 | 0 | MIT | 1,594,891,963,000 | 1,594,891,962,000 | null | UTF-8 | Lean | false | false | 15,450 | lean | import demos.category_theory_imports
/-!
This is a demo of the category theory library in mathlib,
as part of "Lean for the Curious Mathematician 2020".
You can get this file by:
* installing Lean if necessary: https://leanprover-community.github.io/get_started.html#regular-install
* `leanproject get lftcm2020`
* `co... |
dcec46ae1eef59ec45001ad3897c1867ca58a544 | 2eab05920d6eeb06665e1a6df77b3157354316ad | /src/algebra/monoid_algebra/grading.lean | 24792bd15a5f243f4687f21ccbe2fd571360add3 | [
"Apache-2.0"
] | permissive | ayush1801/mathlib | 78949b9f789f488148142221606bf15c02b960d2 | ce164e28f262acbb3de6281b3b03660a9f744e3c | refs/heads/master | 1,692,886,907,941 | 1,635,270,866,000 | 1,635,270,866,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,855 | 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 algebra.monoid_algebra.to_direct_sum
import linear_algebra.finsupp
/-!
# Internal grading of an `add_monoid_algebra`
In this file, we show that an `add_monoid_alge... |
ed200036c00147720feed1def75eeeb42ebdf358 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/mvar_eta_issue.lean | 55b5cd84e1af78f2ca21ab254e1e3394a8113713 | [
"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 | 619 | lean | open tactic
example : true :=
by do
let n : expr := `(nat),
let t : expr := `(nat → nat),
m ← mk_meta_var t,
let em : expr := (expr.lam `x binder_info.default n (expr.app m (expr.var 0))),
/- The unification constraint
?m =?= (fun x, ?m x)
should work.
-/
unify m em,
constructor
example ... |
32a24f3c572fbf94680aedf852b49fb819c8dc44 | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/analysis/normed_space/finite_dimension.lean | f03c00355af6ce0e1f7d9a71d9b67f408cff2cd2 | [
"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 | 32,472 | 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.normed_space.affine_isometry
import analysis.normed_space.operator_norm
import analysis.asymptotics.asymptotic_equivalent
import linear_algebra.... |
64097bce38c4af394f6914d8e7128261c13de1ef | 0845ae2ca02071debcfd4ac24be871236c01784f | /library/init/data/fin/basic.lean | 4f426c37334c93aaccc72d678ec9466b11ca1441 | [
"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 | 3,103 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
prelude
import init.data.nat.div init.data.nat.bitwise
open Nat
structure Fin (n : Nat) := (val : Nat) (isLt : val < n)
namespace Fin
protected def lt {n} ... |
f528f0148aa770b41b8e4b66b82e4722e1201a83 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/zmod/quotient.lean | c619573eabdc4ec78434f3891d7a5e95514ff7f9 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 7,716 | 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.zmod.basic
import group_theory.group_action.quotient
import ring_theory.int.basic
import ring_theory.ideal.quotient_operations
/-!
# `zmod n` and quotient grou... |
e9283a8e29e8b75f5e9b8cabc4019d8d62e00dd1 | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /src/Lean/Meta/Match/Match.lean | 7963a4ac37c52a5b6a38fae98049ffcbd1a0e71d | [
"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 | 37,444 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Util.CollectLevelParams
import Lean.Util.Recognizers
import Lean.Compiler.ExternAttr
import Lean.Meta.Check
import Lean.Meta.Closure
import Lean... |
22b4951b3373f2d0a55febb643899cd23cca3aef | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /test/apply_fun.lean | 581be9190a81faa4b7a8a86b3edc90e3ec2c6c87 | [
"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 | 2,410 | lean | import tactic.apply_fun
import data.matrix.basic
open function
example (X Y Z : Type) (f : X → Y) (g : Y → Z) (H : injective $ g ∘ f) :
injective f :=
begin
intros x x' h,
apply_fun g at h,
exact H h
end
example (x : ℤ) (h : x = 1) : 1 = 1 :=
begin
revert h,
refine (λ h, _),
apply_fun (λ p, p) at h,
... |
bdd4b9390c3ef3d3f36de2f490b89f05f04bb80d | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/number_theory/cyclotomic/rat.lean | 67def7f2ff0c15a35db3a35ec16d3def4565ccb0 | [
"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,629 | lean | /-
Copyright (c) 2022 Riccardo Brasca. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Riccardo Brasca
-/
import number_theory.cyclotomic.discriminant
import ring_theory.polynomial.eisenstein
/-!
# Ring of integers of `p ^ n`-th cyclotomic fields
We gather results abo... |
d1b190380c2d4fff2e59d93b1f73231115221e7c | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/algebra/indicator_function.lean | bf9fc5be61da6d8f3a894eb216d3bf370869e7d2 | [
"Apache-2.0"
] | permissive | hikari0108/mathlib | b7ea2b7350497ab1a0b87a09d093ecc025a50dfa | a9e7d333b0cfd45f13a20f7b96b7d52e19fa2901 | refs/heads/master | 1,690,483,608,260 | 1,631,541,580,000 | 1,631,541,580,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 20,729 | lean | /-
Copyright (c) 2020 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou
-/
import algebra.support
/-!
# Indicator function
- `indicator (s : set α) (f : α → β) (a : α)` is `f a` if `a ∈ s` and is `0` otherwise.
- `mul_indicator (s : set α) (... |
227dfc1d4ff9eb8518cc3f644a42f1ec32e2c505 | 1d265c7dd8cb3d0e1d645a19fd6157a2084c3921 | /src/lessons/lesson15.lean | 9f105190d6bd0ef5d988b156916441d20791c05c | [
"MIT"
] | permissive | hanzhi713/lean-proofs | de432372f220d302be09b5ca4227f8986567e4fd | 4d8356a878645b9ba7cb036f87737f3f1e68ede5 | refs/heads/master | 1,585,580,245,658 | 1,553,646,623,000 | 1,553,646,623,000 | 151,342,188 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 51 | lean | import data.set
open set
#check {{1}, {2, {3}}, 1} |
1623c0a890a97926f852cf893ece0fbf6b1a29e7 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/arthur2.lean | c4d6a0f9978d4456f8f3c298e0c4c69512efa441 | [
"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 | 15,705 | lean | import Lean.Data.HashMap
inductive NEList (α : Type)
| uno : α → NEList α
| cons : α → NEList α → NEList α
def NEList.contains [BEq α] : NEList α → α → Bool
| uno a, x => a == x
| cons a as, x => a == x || as.contains x
def NEList.noDup [BEq α] : NEList α → Bool
| uno a => true
| cons a as => ¬a... |
2eccf449ce9330342ee1484a2ede9343eef99755 | 19cc34575500ee2e3d4586c15544632aa07a8e66 | /src/algebra/module/basic.lean | 3ddf34fcdbc0692f2121912ea3c73e8bf1fa0e90 | [
"Apache-2.0"
] | permissive | LibertasSpZ/mathlib | b9fcd46625eb940611adb5e719a4b554138dade6 | 33f7870a49d7cc06d2f3036e22543e6ec5046e68 | refs/heads/master | 1,672,066,539,347 | 1,602,429,158,000 | 1,602,429,158,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 23,045 | lean | /-
Copyright (c) 2015 Nathaniel Thomas. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nathaniel Thomas, Jeremy Avigad, Johannes Hölzl, Mario Carneiro
-/
import group_theory.group_action
import tactic.nth_rewrite
import algebra.group.hom
/-!
# Modules over a ring
In ... |
fab643fbc1a1a01798c513057c8b78a6473a1b0c | 827a8a5c2041b1d7f55e128581f583dfbd65ecf6 | /Wsusp.hlean | cf86b67dd1e5f72a2602aef4cb964fc35da4f12d | [
"Apache-2.0"
] | permissive | fpvandoorn/leansnippets | 6af0499f6f3fd2c07e4b580734d77b67574e7c27 | 601bafbe07e9534af76f60994d6bdf741996ef93 | refs/heads/master | 1,590,063,910,882 | 1,545,093,878,000 | 1,545,093,878,000 | 36,044,957 | 2 | 2 | null | 1,442,619,708,000 | 1,432,256,875,000 | Lean | UTF-8 | Lean | false | false | 1,135 | hlean | import hit.quotient types.W
open quotient Wtype
-- The definition of something similar to case of W-suspensions using type quotients.
-- The special case is the case where the second argument of "sup" has codomain W(A, B) instead of W(A, B, C, l, r)
namespace Wsusp
section
parameters {A C : Type} {B : A → Type} (l... |
2c18e39c2059fd34707b78383adf656492391c20 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/topology/algebra/valuation.lean | ee3fdd9f7cba465873a4c512a1add709ea9fec08 | [
"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 | 6,213 | lean | /-
Copyright (c) 2021 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot
-/
import topology.algebra.nonarchimedean.bases
import topology.algebra.uniform_filter_basis
import ring_theory.valuation.basic
/-!
# The topology on a valued ring
In... |
1a4f77a4ec78c2587171da3bcd1a574e018549b6 | 2c41ae31b2b771ad5646ad880201393f5269a7f0 | /Lean/Examples/Parnas/Shared_Info.lean | d9b57b3781143e5c0fe410f7e19a138b7c8a817e | [] | 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 | 911 | lean | -- Context
inductive kwicContexts
| nominal
-- Phase
-- [kwicPhases] represents the lifecycle phases of a software system.
-- design, implementation and maintenance are talked about in the paper
inductive kwicPhases
| design
| implementation
| maintenance
-- Stakeholder
-- [kwicStakeholders] represents the set ... |
5cfb1b4bc748dad6023f404c8ba056b420384e14 | 9028d228ac200bbefe3a711342514dd4e4458bff | /src/topology/metric_space/emetric_space.lean | b61e462d0918deecca9a6cd3e83e8e91efd20dab | [
"Apache-2.0"
] | permissive | mcncm/mathlib | 8d25099344d9d2bee62822cb9ed43aa3e09fa05e | fde3d78cadeec5ef827b16ae55664ef115e66f57 | refs/heads/master | 1,672,743,316,277 | 1,602,618,514,000 | 1,602,618,514,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 37,519 | 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 data.real.ennreal
import data.finset.intervals
import topology.uniform_space.uniform_em... |
f0fc240b9e5221275560f2cf5983b0e118d8afaa | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/analysis/calculus/lhopital.lean | 9ed6d0d6911ac4370b7e8a4b25aa34965ba40c66 | [
"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 | 24,295 | 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 ... |
3157a02d029d80f5ba592b5becc02679920fcd04 | 9b9a16fa2cb737daee6b2785474678b6fa91d6d4 | /src/category_theory/concrete_category.lean | f4fd0d3135e98493c06ef70e5213c6cd2376a4cc | [
"Apache-2.0"
] | permissive | johoelzl/mathlib | 253f46daa30b644d011e8e119025b01ad69735c4 | 592e3c7a2dfbd5826919b4605559d35d4d75938f | refs/heads/master | 1,625,657,216,488 | 1,551,374,946,000 | 1,551,374,946,000 | 98,915,829 | 0 | 0 | Apache-2.0 | 1,522,917,267,000 | 1,501,524,499,000 | Lean | UTF-8 | Lean | false | false | 3,151 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Johannes Hölzl, Reid Barton, Sean Leather
Bundled type and structure.
-/
import category_theory.functor
import category_theory.types
universes u v
namespace category... |
0abdc043a9ae04fe04cb564e8ed35dde4163fe7f | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tests/lean/run/depElim1.lean | ca39813b03a9e3c8d8ca3d922be1865340addad9 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | cipher1024/lean4 | 6e1f98bb58e7a92b28f5364eb38a14c8d0aae393 | 69114d3b50806264ef35b57394391c3e738a9822 | refs/heads/master | 1,642,227,983,603 | 1,642,011,696,000 | 1,642,011,696,000 | 228,607,691 | 0 | 0 | Apache-2.0 | 1,576,584,269,000 | 1,576,584,268,000 | null | UTF-8 | Lean | false | false | 13,826 | lean | import Lean.Meta.Match
open Lean
open Lean.Meta
open Lean.Meta.Match
/- Infrastructure for testing -/
universe u v
def check (x : Bool) : IO Unit := do
unless x do
throw $ IO.userError "check failed"
def inaccessible {α : Sort u} (a : α) : α := a
def val {α : Sort u} (a : α) : α := a
def As {α : Sort u} (v a : α... |
0d4b64762ae3ea4a88b4fbcd1e4a471ee1114fcb | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch5/ex0709.lean | 8d9bfa52d085715ef5e0b3156906deed48619a6e | [] | no_license | Ailrun/Theorem_Proving_in_Lean | ae6a23f3c54d62d401314d6a771e8ff8b4132db2 | 2eb1b5caf93c6a5a555c79e9097cf2ba5a66cf68 | refs/heads/master | 1,609,838,270,467 | 1,586,846,743,000 | 1,586,846,743,000 | 240,967,761 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 104 | lean | variables (f : ℕ → ℕ) (k : ℕ)
example (h₁ : f 0 = 0) (h₂ : k = 0) : f k = 0 :=
by simp *
|
3b3748c1da474916e93a27e4ddf03bcb4f0aef8f | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /src/category_theory/limits/shapes/wide_pullbacks.lean | ca5d6816be3ede9533ef238c43dd9b714d17c848 | [
"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 | 7,859 | lean | /-
Copyright (c) 2020 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta
-/
import data.fintype.basic
import category_theory.limits.limits
import category_theory.limits.shapes.finite_limits
import category_theory.sparse
/-!
# Wide pullbacks
We ... |
1f303bf3abf9b0b6d192515bcfcc96de1848c1a5 | 4fa161becb8ce7378a709f5992a594764699e268 | /src/data/int/basic.lean | 0a381100884159b7e07f2a24cd5c2ecd22250717 | [
"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 | 54,754 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
The integers, with addition, multiplication, and subtraction.
-/
import algebra.char_zero
import init_.data.int.order
import algebra.ring
import data.list.range
open nat
... |
eea69b902330036e9526b82b352b71bc61b0184c | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /03_Propositions_and_Proofs.org.9.lean | 8133866076cb653bb7c54b6fb92dc8f48e2710c6 | [] | 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 | 143 | lean | /- page 36 -/
import standard
constants p q : Prop
-- BEGIN
lemma t1 : p → q → p :=
assume Hp : p,
assume Hq : q,
show p, from Hp
-- END
|
dd7b63ab9ab01cf71d62b2fb73100b962eab4b80 | 0845ae2ca02071debcfd4ac24be871236c01784f | /library/init/lean/eqncompiler/default.lean | 82d44e9f46bb3f624357da9b6c8d11898e49f79d | [
"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 | 214 | 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.eqncompiler.matchpattern
|
42801b26a8e5eabacab773c495847a353e268ea3 | 01ae0d022f2e2fefdaaa898938c1ac1fbce3b3ab | /categories/universal/comparisons/cones.lean | 0b112fb756a5c41b32dc6897fbb950ab97d3cc05 | [] | 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 | 3,009 | lean | -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Stephen Morgan, Scott Morrison
import ...isomorphism
import ...natural_transformation
import ...equivalence
import ..comma_categories
import ..universal
import tidy.its
open c... |
3cf50b95a9653060d3969c0dfea8db94f406f128 | bb31430994044506fa42fd667e2d556327e18dfe | /src/data/int/range.lean | 2bc2fa5cc67fa6b3c5ca6a201133a302a1d5bb22 | [
"Apache-2.0"
] | permissive | sgouezel/mathlib | 0cb4e5335a2ba189fa7af96d83a377f83270e503 | 00638177efd1b2534fc5269363ebf42a7871df9a | refs/heads/master | 1,674,527,483,042 | 1,673,665,568,000 | 1,673,665,568,000 | 119,598,202 | 0 | 0 | null | 1,517,348,647,000 | 1,517,348,646,000 | null | UTF-8 | Lean | false | false | 2,026 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Kenny Lau
-/
import data.list.range
import data.int.order.basic
/-!
# Intervals in ℤ
This file defines integer ranges. `range m n` is the set of integers greater than `m` ... |
d29c6fb3da772047252ede4cfc9d1c9e3936807a | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/let_elim_issue.lean | 6d09b5f01539729375156e0636724b35a8c2b419 | [
"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 | 148 | lean | import system.io
variable [io.interface]
open io
def tst : io unit :=
put_str "hello\n"
>> put_str "world\n"
>> put_str "from Lean\n"
#eval tst
|
78934373a523c2a2dce634452b0fae5bebf98632 | bb31430994044506fa42fd667e2d556327e18dfe | /src/linear_algebra/finite_dimensional.lean | d0ee8c0ce5983fc00684d93068c8992344262b19 | [
"Apache-2.0"
] | permissive | sgouezel/mathlib | 0cb4e5335a2ba189fa7af96d83a377f83270e503 | 00638177efd1b2534fc5269363ebf42a7871df9a | refs/heads/master | 1,674,527,483,042 | 1,673,665,568,000 | 1,673,665,568,000 | 119,598,202 | 0 | 0 | null | 1,517,348,647,000 | 1,517,348,646,000 | null | UTF-8 | Lean | false | false | 63,527 | 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 algebra.algebra.subalgebra.basic
import field_theory.finiteness
import linear_algebra.free_module.finite.rank
import tactic.interval_cases
/-!
# Finite dimensiona... |
605779128c2e00316d2f1a51d30b6918738d0d4a | 592f865bb4e2e537ae3552cb83c32fb99c8d4c68 | /src/Theorem.lean | 32b6d6cb68ba7fc8c0c7fafd77e063390cda3d6a | [] | no_license | BassemSafieldeen/Entropy_and_reversible_catalysis | 250dbb9446690ab89d89a6a512c8f888e09e8596 | 5dd6ee062f61e26bbcf254477e3e24aa3fc489af | refs/heads/master | 1,678,747,213,156 | 1,615,540,586,000 | 1,615,540,586,000 | 322,216,014 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,825 | lean | import linear_algebra.eigenspace
import rnd_var
import to_mathlib_maybe.pTrace
import to_mathlib_maybe.Hilbert_space
import to_qShannon_theory_maybe.state
import to_qShannon_theory_maybe.channel
import to_qShannon_theory_maybe.entropy
#check rnd_var
#check quantum_state
#check quantum_channel
#check entropy
-- impo... |
3ef49708b0bde3077115deff1096ca7d194a8f74 | da3a76c514d38801bae19e8a9e496dc31f8e5866 | /tests/lean/run/quote1.lean | b01ad8f5877d6d728bf94aacd5cbe4c8c981cb95 | [
"Apache-2.0"
] | permissive | cipher1024/lean | 270c1ac5781e6aee12f5c8d720d267563a164beb | f5cbdff8932dd30c6dd8eec68f3059393b4f8b3a | refs/heads/master | 1,611,223,459,029 | 1,487,566,573,000 | 1,487,566,573,000 | 83,356,543 | 0 | 0 | null | 1,488,229,336,000 | 1,488,229,336,000 | null | UTF-8 | Lean | false | false | 270 | lean | open tactic list
meta definition foo (a : pexpr) : pexpr :=
`(%%a + %%a + %%a + b)
example (a b : nat) : a = a :=
by do
a ← get_local `a,
t1 ← mk_app `add [a, a],
t2 ← to_expr (foo (to_pexpr t1)),
trace t2,
r ← mk_app (`eq.refl) [a],
exact r
|
f420f8c782143f35dd808f49f14d0e35fde39169 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/data/finsupp.lean | 77e8fc0686d2c960fa3c9ee8cd1b36ef2635b315 | [
"Apache-2.0"
] | permissive | dupuisf/mathlib | 62de4ec6544bf3b79086afd27b6529acfaf2c1bb | 8582b06b0a5d06c33ee07d0bdf7c646cae22cf36 | refs/heads/master | 1,669,494,854,016 | 1,595,692,409,000 | 1,595,692,409,000 | 272,046,630 | 0 | 0 | Apache-2.0 | 1,592,066,143,000 | 1,592,066,142,000 | null | UTF-8 | Lean | false | false | 71,947 | 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, Scott Morrison
-/
import algebra.big_operators.order
import algebra.module.basic
import data.fintype.card
import data.set.finite
import data.multiset.antidiagonal
/-!
... |
bcf1bca38266dc523e470c1f5c68caea87111523 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/tactic/algebra.lean | 6f4c97dbfb258131efb79ee371b77b818b2314ee | [
"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 | 2,436 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
-/
import tactic.core
open lean.parser
namespace tactic
section performance -- see Note [user attribute parameters]
local attribute [semireducible] reflected
local attrib... |
97a87d4234c005f297d0591b3ac97b633acc43eb | 367134ba5a65885e863bdc4507601606690974c1 | /src/category_theory/limits/lattice.lean | 28f2e3ba07c6b77691962bfa98e07ec97bd6ea86 | [
"Apache-2.0"
] | permissive | kodyvajjha/mathlib | 9bead00e90f68269a313f45f5561766cfd8d5cad | b98af5dd79e13a38d84438b850a2e8858ec21284 | refs/heads/master | 1,624,350,366,310 | 1,615,563,062,000 | 1,615,563,062,000 | 162,666,963 | 0 | 0 | Apache-2.0 | 1,545,367,651,000 | 1,545,367,651,000 | null | UTF-8 | Lean | false | false | 3,869 | 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.finite_limits
import order.complete_lattice
universes u
open category_theory
open category_theory.limits
namespace category_th... |
d96bc78dbbd786c38fd7520a593d790744be76ee | 4727251e0cd73359b15b664c3170e5d754078599 | /src/order/category/BoundedLattice.lean | 0201a28d1a1914ad905e82adbad4d794e9dc1a3d | [
"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,433 | lean | /-
Copyright (c) 2022 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies
-/
import order.category.BoundedOrder
import order.category.Lattice
import order.category.Semilattice
/-!
# The category of bounded lattices
This file defines `BoundedLatt... |
ce8b3555a5dd6f442f3cfcac849efbfccc90e0ea | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/data/list/nodup_equiv_fin.lean | 4da9b07e4dc44d9f0146498c2728bcf00e28d43f | [
"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 | 7,253 | 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.list.sort
import data.list.duplicate
import data.fin
/-!
# Isomorphism between `fin (length l)` and `{x // x ∈ l}`
Given a list `l,
* if `l` ha... |
e3cca472cbab6d080dd2b206e884e0edcdf4ef9b | 9cb9db9d79fad57d80ca53543dc07efb7c4f3838 | /src/pseudo_normed_group/basic.lean | bbed27a663398b15789ca5debdcb218c79c49c1d | [] | no_license | mr-infty/lean-liquid | 3ff89d1f66244b434654c59bdbd6b77cb7de0109 | a8db559073d2101173775ccbd85729d3a4f1ed4d | refs/heads/master | 1,678,465,145,334 | 1,614,565,310,000 | 1,614,565,310,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 12,070 | lean | import data.real.nnreal
import algebra.group.hom
import algebra.big_operators
import algebra.module.pi
import topology.basic
import hacks_and_tricks.type_pow
noncomputable theory
open_locale nnreal big_operators
local attribute [instance] type_pow
/-- A pseudo-normed group is an abelian group `M`
together with an ... |
ba5a84ce160b0f4895da4ac83f8a2a4e67924a58 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/ring_theory/nilpotent.lean | 14654b2b2688e37be5bfe5d7ac6b03f084ae4349 | [
"Apache-2.0"
] | permissive | jcommelin/mathlib | d8456447c36c176e14d96d9e76f39841f69d2d9b | ee8279351a2e434c2852345c51b728d22af5a156 | refs/heads/master | 1,664,782,136,488 | 1,663,638,983,000 | 1,663,638,983,000 | 132,563,656 | 0 | 0 | Apache-2.0 | 1,663,599,929,000 | 1,525,760,539,000 | Lean | UTF-8 | Lean | false | false | 8,298 | lean | /-
Copyright (c) 2021 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import data.nat.choose.sum
import algebra.algebra.bilinear
import ring_theory.ideal.operations
/-!
# Nilpotent elements
## Main definitions
* `is_nilpotent`
* `is_ni... |
8cb974a423b5a0968c2d44bc854a7e007ceeb6ee | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/data/multiset/lattice.lean | f3d5d7bb73bf7b903d7ea364ae8f851ed4ee0d6a | [
"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 | 3,593 | 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 data.multiset.finset_ops
import data.multiset.fold
/-!
# Lattice operations on multisets
-/
namespace multiset
variables {α : Type*}
/-! ### sup -/
section s... |
de426a3ff34915234536ed3e0bd5c841706db35c | 367134ba5a65885e863bdc4507601606690974c1 | /archive/imo/imo2013_q5.lean | 9d9a407a1929acf25cae62fe669f241f05f5f194 | [
"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 | 14,929 | lean | /-
Copyright (c) 2021 David Renshaw. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Renshaw
-/
import algebra.geom_sum
import data.rat.basic
import data.real.basic
/-!
# IMO 2013 Q5
Let ℚ>₀ be the set of positive rational numbers. Let f: ℚ>₀ → ℝ be a function ... |
0d29b01bc872ee19fbd840df6075674ab622fd36 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/control/traversable/instances.lean | c20af0f3e825d2063d11f7c0790bafc84eb6969d | [
"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 | 5,686 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Simon Hudon
Instances of `traversable` for types from the core library
-/
import data.list.forall2
import data.set.lattice
import control.traversable.lemmas
universes u v
section option... |
33c81a64273b12d4a5678d0d718a9ae64208cc97 | 6f510b1ed724f95a55b7d26a8dcd13e1264123dd | /src/page02.lean | 1f59162c695e3ac5086632af0969d4980ccd4884 | [] | no_license | jcommelin/oberharmersbach2019 | adaf2e54ba4eff7c178c933978055ff4d6b0593b | d2cdf780a10baa8502a9b0cae01c7efa318649a6 | refs/heads/master | 1,587,558,516,731 | 1,550,558,213,000 | 1,550,558,213,000 | 170,372,753 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 570 | lean | /- The Curry-Howard correspondence -/
/- a.k.a. propositions-as-types -/
/- a.k.a. proofs-as-programs -/
variables (X Y : Type) (f : X → Y)
variables (P Q : Prop) (hypothesis : P → Q)
#check ∀ x : X, P
variable (P' : X → Prop)
--- --- --- --- --- --- --- --- --- --- --- --- --- ---
variables (G : X → Typ... |
53eece2356cb80f20588b60e4b5775a1ba7c4193 | c3f2fcd060adfa2ca29f924839d2d925e8f2c685 | /hott/init/tactic.hlean | 508574ded5345405e8952c19aab868c47712c697 | [
"Apache-2.0"
] | permissive | respu/lean | 6582d19a2f2838a28ecd2b3c6f81c32d07b5341d | 8c76419c60b63d0d9f7bc04ebb0b99812d0ec654 | refs/heads/master | 1,610,882,451,231 | 1,427,747,084,000 | 1,427,747,429,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,648 | hlean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: init.tactic
Author: Leonardo de Moura
This is just a trick to embed the 'tactic language' as a Lean
expression. We should view 'tactic' as automation that when execute
produces... |
481077938fc2b9689e086bcc54ef4112437227aa | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/ring_theory/witt_vector/frobenius.lean | 3db064e47a79ac4a4c0d2a32d431338880066208 | [] | 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 | 8,403 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.nat.multiplicity
import Mathlib.ring_theory.witt_vector.basic
import Mathlib.ring_theo... |
b9cd983269f1d6c9705034c2529458c77c82b24c | 367134ba5a65885e863bdc4507601606690974c1 | /src/algebra/category/Mon/basic.lean | 9b0f91182286341e57b4ef5e4fe792d2c9e1c938 | [
"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 | 6,830 | 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.concrete_category.bundled_hom
import category_theory.concrete_category.reflects_isomorphisms
import algebra.punit_instances
/-!
# Category ins... |
fc459ed767d818cfb8b23c31ed639b76dcb1a385 | eb9357a70318e50e095b58730bebfe0cffee457f | /lean/love06_monads_demo.lean | 85a6e1fdb116df044d7e632b7979beaa375cd11c | [] | no_license | Vierkantor/logical_verification_2021 | 7485dd916953131d501760f023d5b30fbb74d36a | 9500b9c194e22a9ab4067321cfed7a1f445afcfc | refs/heads/main | 1,692,560,845,086 | 1,624,721,275,000 | 1,624,721,275,000 | 416,354,079 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 12,167 | lean | import .lovelib
/-! # LoVe Demo 6: Monads
Monads are an important functional programming abstraction. They generalize
computation with side effects. Haskell has shown that they can be used very
successful to write imperative programs. For us, they are interesting in their
own right and for two more reasons:
* They ... |
986ffbd39139016d6bb0495fa97ad6c25e78774c | 46125763b4dbf50619e8846a1371029346f4c3db | /src/order/basic.lean | a1580f784a5f262d87427704572157015a13c15f | [
"Apache-2.0"
] | permissive | thjread/mathlib | a9d97612cedc2c3101060737233df15abcdb9eb1 | 7cffe2520a5518bba19227a107078d83fa725ddc | refs/heads/master | 1,615,637,696,376 | 1,583,953,063,000 | 1,583,953,063,000 | 246,680,271 | 0 | 0 | Apache-2.0 | 1,583,960,875,000 | 1,583,960,875,000 | null | UTF-8 | Lean | false | false | 27,870 | 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 logic.basic data.sum data.set.basic algebra.order
open function
/- TODO: automatic construction of dual definitions / theorems -/
universes u v... |
ecaf2225f356940f382e991e7cc38dc37ceb1314 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/analysis/complex/removable_singularity.lean | 816caed16fc9a8f8c82a1083567c9c70a49fb8c1 | [
"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 | 7,330 | lean | /-
Copyright (c) 2022 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import analysis.calculus.fderiv_analytic
import analysis.asymptotics.specific_asymptotics
import analysis.complex.cauchy_integral
/-!
# Removable singularity theor... |
188b88d9093ab3d9b64c2c0eedf666e93dcbe357 | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /examples/lean/ex5.lean | 17822db67e2e7843f7f73c65653fc5e2677b8ed1 | [
"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 | 879 | lean | import macros
scope
theorem ReflIf (A : Type)
(R : A → A → Bool)
(Symm : ∀ x y, R x y → R y x)
(Trans : ∀ x y z, R x y → R y z → R x z)
(Linked : ∀ x, ∃ y, R x y)
:
∀ x, R x x :=
take x,
obtai... |
6b7e59e719ac162482ace96e46c22cfb9088ff7b | 4bddde0d06fbd53be6f23d7f5899998e8f63410b | /src/tactic/iconfig/lib/parser.lean | 64f64ee6bc7d5087e1278664acfb9734e2df3fb9 | [] | no_license | khoek/libiconfig | 4816290a5862af14b07683b3d2663e8e62832ef4 | 6f55c50bc5d852d26ee5ee4c5b52b2cda2a852e5 | refs/heads/master | 1,586,109,683,212 | 1,559,567,916,000 | 1,559,567,916,000 | 157,085,466 | 0 | 1 | null | 1,559,567,917,000 | 1,541,945,134,000 | Lean | UTF-8 | Lean | false | false | 1,088 | lean | import order.bounded_lattice
open lean.parser
open interactive interactive.types
open tactic
namespace interactive.types
private meta def bool_from_pexpr : pexpr → lean.parser bool
| (expr.local_const `tt `tt _ _) := return tt
| (expr.local_const `ff `ff _ _) := return ff
| e := interaction_monad.fail format!"'{e}' ... |
c635c795278e5820fb6b7c4897c6f0d93ff20a1b | be5348f86d661459153802318209304b793c0e2a | /src/rotations.lean | 6159150d2e0f493f9d2ef1c0e348c27562fc496d | [] | no_license | reglayass/lean-avl | 6b758c7708bdb3316b1b97ada3e3f259b49da58a | c7bffa75d7548e5ff8cdd7d69f5a58499f883df1 | refs/heads/master | 1,692,297,536,477 | 1,633,946,864,000 | 1,633,946,864,000 | 340,881,572 | 4 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 17,600 | lean | import definitions forall_keys tactic.linarith tactic.omega
set_option pp.generalized_field_notation false
universe u
namespace rotation_lemmas
open btree forall_keys_lemmas
variables {α : Type u}
/- # Auxiliary lemmas # -/
/-
These auxiliary lemmas for rotations are used to show that the key relation of x to a ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.