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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
4522b49115f4f1634ae12b51366750abbcb2fc55 | 8e6cad62ec62c6c348e5faaa3c3f2079012bdd69 | /src/topology/stone_cech.lean | e70760c6b0a42d5530ccd7a2325224361f16d4e8 | [
"Apache-2.0"
] | permissive | benjamindavidson/mathlib | 8cc81c865aa8e7cf4462245f58d35ae9a56b150d | fad44b9f670670d87c8e25ff9cdf63af87ad731e | refs/heads/master | 1,679,545,578,362 | 1,615,343,014,000 | 1,615,343,014,000 | 312,926,983 | 0 | 0 | Apache-2.0 | 1,615,360,301,000 | 1,605,399,418,000 | Lean | UTF-8 | Lean | false | false | 11,239 | lean | /-
Copyright (c) 2018 Reid Barton. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Reid Barton
-/
import topology.bases
import topology.dense_embedding
/-! # Stone-Čech compactification
Construction of the Stone-Čech compactification using ultrafilters.
Parts of the ... |
cb7e0f81f0252003d7451641f66039b19383c8bf | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/category_theory/yoneda.lean | 113f3b73df8e982e4f861598979e9e89a5f49201 | [
"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 | 6,840 | lean | -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Scott Morrison
/- The Yoneda embedding, as a functor `yoneda : C ⥤ (Cᵒᵖ ⥤ Type v₁)`,
along with an instance that it is `fully_faithful`.
Also the Yoneda lemma, `yoneda_le... |
87ba5fcc556404c39b8563d10537089befcc27c6 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Meta/Tactic/Clear.lean | c996fe88397b01212b399dbfcba5c0d771906c08 | [
"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 | 2,299 | 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.Util
namespace Lean.Meta
/--
Erase the given free variable from the goal `mvarId`.
-/
def _root_.Lean.MVarId.clear (mvarId : MVarI... |
625e149e2b2027d0f70d0b5915fd69a43422cb7f | de91c42b87530c3bdcc2b138ef1a3c3d9bee0d41 | /old/not_in_use/velocityOverride.lean | fa243e583afb3ca593ff8281e80dd4026a22b632 | [] | no_license | kevinsullivan/lang | d3e526ba363dc1ddf5ff1c2f36607d7f891806a7 | e9d869bff94fb13ad9262222a6f3c4aafba82d5e | refs/heads/master | 1,687,840,064,795 | 1,628,047,969,000 | 1,628,047,969,000 | 282,210,749 | 0 | 1 | null | 1,608,153,830,000 | 1,595,592,637,000 | Lean | UTF-8 | Lean | false | false | 358 | lean | import ..imperative_DSL.environment
import ..eval.velocityEval
open lang.classicalVelocity
def assignVelocity : environment.env → lang.classicalVelocity.var → lang.classicalVelocity.expr → environment.env
| i v e := environment.env.mk i.g i.t
(λ r, if (varEq v r)
then (classicalVelocityEval e i)
... |
4786c503e1912de78420ef584e0d7fc702c5a98a | efa51dd2edbbbbd6c34bd0ce436415eb405832e7 | /20161026_ICTAC_Tutorial/ex47.lean | e03f2324abe5138694a4bdd8926b4af470b04f4a | [
"Apache-2.0"
] | permissive | leanprover/presentations | dd031a05bcb12c8855676c77e52ed84246bd889a | 3ce2d132d299409f1de269fa8e95afa1333d644e | refs/heads/master | 1,688,703,388,796 | 1,686,838,383,000 | 1,687,465,742,000 | 29,750,158 | 12 | 9 | Apache-2.0 | 1,540,211,670,000 | 1,422,042,683,000 | Lean | UTF-8 | Lean | false | false | 539 | lean | /- Existential quantifier -/
example : ∃ x : ℕ, x > 0 :=
have h : 1 > 0, from nat.zero_lt_succ 0,
exists.intro 1 h
example (x : ℕ) (h : x > 0) : ∃ y, y < x :=
exists.intro 0 h
example (x y z : ℕ) (hxy : x < y) (hyz : y < z) : ∃ w, x < w ∧ w < z :=
exists.intro y (and.intro hxy hyz)
check @exists.intro
example : ∃ ... |
0c36e1348819211862d3eba4c6efb8bf0a1dfb45 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/topology/hom/open.lean | 84aeb9a84c3d358c1371600a35c5b8e0929e686e | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 4,348 | 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 topology.continuous_function.basic
/-!
# Continuous open maps
This file defines bundled continuous open maps.
We use the `fun_like` design, so each type of morp... |
58bd80e732df23308a216a1be1f29b72b61ca1cb | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/analysis/subadditive.lean | c7e1d6f3311d4f3bb4eb6518ea337e3ab5d03d29 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 4,831 | 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.instances.real
import order.filter.archimedean
/-!
# Convergence of subadditive sequences
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any cha... |
11029342652626a9eef77d728de52be2c554e2c9 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Init/Control/StateCps.lean | bb49ce5ea2b2d4c2162a5924e5f635f375fd0961 | [
"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 | 3,762 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import Init.Control.Lawful
/-!
The State monad transformer using CPS style.
-/
def StateCpsT (σ : Type u) (m : Type u → Type v) (α : Type u) := (δ... |
ae64877f081fbd41ca27ad8570d4892bbbb881a3 | f5f7e6fae601a5fe3cac7cc3ed353ed781d62419 | /src/data/rat.lean | 0ea3511301afba7062c6987db9b3b400a5fc640a | [
"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 | 44,807 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro
Introduces the rational numbers as discrete, linear ordered field.
-/
import
data.nat.gcd data.pnat data.int.sqrt data.equiv.encodable order.basic
... |
be20b94b98fa9824bbeca1d47657bc332a2ebcfa | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /src/Lean/Parser/Extra.lean | d5aeee209899322b8f54cfc480ca33cb1b557d13 | [
"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,059 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Sebastian Ullrich
-/
import Lean.Parser.Extension
-- necessary for auto-generation
import Lean.PrettyPrinter.Parenthesizer
import Lean.PrettyPrinter.Formatter... |
162d872c7eeb75edb2bcd53c82cea219d1eef6db | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/list/range_auto.lean | c34c359027e86e671614afa1becf894fe03b38e0 | [] | 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,530 | 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, Scott Morrison
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.list.chain
import Mathlib.data.list.nodup
import Mathlib.da... |
e7020515ec323542f51fc9c6ecfde35998a3e175 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/number_theory/padics/padic_val.lean | 80fd6b1f19230ee5b04f289e0f4d87de79238401 | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 22,266 | lean | /-
Copyright (c) 2018 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
-/
import algebra.order.absolute_value
import algebra.field_power
import ring_theory.int.basic
import tactic.basic
import tactic.ring_exp
import number_theory.divisors... |
29c4fc12797d5b1bb0587dd720bcf3120ae8d60b | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/data/real/nnreal.lean | 6a470382fdf7b4e30ed3c1a4ddd3825887e2a001 | [
"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 | 18,629 | lean | /-
Copyright (c) 2018 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
Nonnegative real numbers.
-/
import data.real.basic order.lattice algebra.field
noncomputable theory
open lattice
open_locale classical
/-- Nonnegative real numbers.... |
f9b57dda0b12d67a9eb570e9b76c284e7a39d6cd | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/category_theory/shift.lean | 968475f14017165ea0354032ca530a65cc8aa796 | [
"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 | 13,725 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Johan Commelin, Andrew Yang
-/
import category_theory.limits.shapes.zero
import category_theory.monoidal.End
import category_theory.monoidal.discrete
/-!
# Shift
A `s... |
bcd5270aaa02a61c686ec3cb84b30ae889193c6a | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/tactic/simps.lean | 1a018244ce8fd2bd782cd8b2f65d499db0511acd | [
"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 | 8,418 | 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
/-!
# simps attribute
This file defines the `@[simps]` attribute, to automatically generate simp-lemmas
reducing a definition when projec... |
1b19490085830eee118df9a277a3e7bc494aed57 | 3dc4623269159d02a444fe898d33e8c7e7e9461b | /.github/workflows/project_1_a_decrire/projet_A2/natutal_transformX.lean | 12640083c2c9e15d094a49be904af1531998b8df | [] | no_license | Or7ando/lean | cc003e6c41048eae7c34aa6bada51c9e9add9e66 | d41169cf4e416a0d42092fb6bdc14131cee9dd15 | refs/heads/master | 1,650,600,589,722 | 1,587,262,906,000 | 1,587,262,906,000 | 255,387,160 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 21 | lean | import .action_Idem_X |
f46353a360ece2c6e843daab64b53b57ec3d2572 | ba4794a0deca1d2aaa68914cd285d77880907b5c | /src/game/world4/level3.lean | 9efa85b3f9a57bba90a0f64a9ce5f18ebbb75d16 | [
"Apache-2.0"
] | permissive | ChrisHughes24/natural_number_game | c7c00aa1f6a95004286fd456ed13cf6e113159ce | 9d09925424da9f6275e6cfe427c8bcf12bb0944f | refs/heads/master | 1,600,715,773,528 | 1,573,910,462,000 | 1,573,910,462,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 321 | lean | import game.world4.level2 -- hide
namespace mynat -- hide
/-
# Power World
## Level 3: `pow_one`
-/
/- Lemma
For all naturals $a$, $a ^ 1 = a$.
-/
lemma pow_one (a : mynat) : a ^ (1 : mynat) = a :=
begin [less_leaky]
rw one_eq_succ_zero,
rw pow_succ,
rw pow_zero,
rw one_mul,
refl,
end
end mynat -- hide... |
2414913c03816c0a68dc039e2c75c01cf9e0ed20 | bdb33f8b7ea65f7705fc342a178508e2722eb851 | /tactic/converter/old_conv.lean | 210e236f7ec709387d183ee82a70747eb709db66 | [
"Apache-2.0"
] | permissive | rwbarton/mathlib | 939ae09bf8d6eb1331fc2f7e067d39567e10e33d | c13c5ea701bb1eec057e0a242d9f480a079105e9 | refs/heads/master | 1,584,015,335,862 | 1,524,142,167,000 | 1,524,142,167,000 | 130,614,171 | 0 | 0 | Apache-2.0 | 1,548,902,667,000 | 1,524,437,371,000 | Lean | UTF-8 | Lean | false | false | 9,414 | 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
Converter monad for building simplifiers.
-/
open tactic
meta structure old_conv_result (α : Type) :=
(val : α) (rhs : expr) (proof : option expr)
meta def ... |
219ff30993fdca7e926db0ee8ac83ab34f5a1527 | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /src/category_theory/limits/shapes/finite_limits.lean | 5905bde7166dab00e758d54221cad72df786f3e4 | [
"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 | 1,892 | 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.products
universes v u
open category_theory
namespace category_theory.limits
/-- A category with a `fintype` of objects, and a... |
2aedfe6ff2e9745c03250f18372b2b757ae5b1b6 | 3b1abba731363bfec018d9d2cfee7fd90e1dc93c | /RT_n_2.lean | 39e8dbb49b308a3a786de7e127a86c36776f0034 | [] | no_license | minchaowu/Ramsey.lean | dcf4e0845cca6dc02ef898f3fd9123c079c5a1a9 | 8ebbead4869bdf3f4788137411c5f36f2e72943a | refs/heads/master | 1,610,462,544,433 | 1,488,596,497,000 | 1,488,596,497,000 | 72,063,527 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 25,331 | lean | import lemmas_for_RT_n_m RT_1_2
open classical set nat decidable prod subtype
noncomputable theory
section
parameter X : set ℕ
parameter k : ℕ
parameter c : set ℕ → ℕ
parameter Hinf : infinite X
parameter IH : (∀ X : set ℕ, ∀ c : set ℕ → ℕ, infinite X → is_coloring X (k+1) 2 c → ∃ S, S ⊆ X ∧ infinite S ∧ is_homo... |
3c602f351f19cc98d47f2ca777b752c1e4ddc865 | 4dbc106f944ae08d9082a937156fe53f8241336c | /src/data/array/basic.lean | 872bd52b09f90225a73b3d761a6fafc22e3e4eb8 | [] | no_license | spl/lean-finmap | feff7ee53811b172531f84b20c02e50c787fe6fc | 936d9caeb27631e3c6cf20e972de4837c9fe98fa | refs/heads/master | 1,584,501,090,642 | 1,537,511,660,000 | 1,537,515,626,000 | 134,227,269 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,137 | lean | import data.array.lemmas data.list.dict
namespace array
variables {α : Type*} {n : ℕ}
def modify (a : array n α) (i : fin n) (f : α → α) : array n α :=
a.write i $ f $ a.read i
@[simp] theorem modify_id (a : array n α) (i : fin n) : a.modify i id = a :=
array.ext $ λ j, by by_cases h : i = j; simp [h, modify]
@[sim... |
d93c5364b8db5552a296d992a9bbb63fa5dc62d7 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/ring_theory/polynomial/gauss_lemma.lean | c3a21b5845e4d92199be99fba269ca7b0913c724 | [
"Apache-2.0"
] | permissive | jjgarzella/mathlib | 96a345378c4e0bf26cf604aed84f90329e4896a2 | 395d8716c3ad03747059d482090e2bb97db612c8 | refs/heads/master | 1,686,480,124,379 | 1,625,163,323,000 | 1,625,163,323,000 | 281,190,421 | 2 | 0 | Apache-2.0 | 1,595,268,170,000 | 1,595,268,169,000 | null | UTF-8 | Lean | false | false | 7,659 | 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 ring_theory.int.basic
import ring_theory.localization
/-!
# Gauss's Lemma
Gauss's Lemma is one of a few results pertaining to irreducibility of primitive pol... |
5ddad2b26584a885df6c902409c5639962aefcc1 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/category/Groupoid_auto.lean | ece67a7d85360356677f80d297c709cff61828f4 | [] | 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,902 | lean | /-
Copyright (c) 2019 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.category_theory.single_obj
import Mathlib.PostPort
universes v u u_1 u_2
namespace Mat... |
29967bd7a755ccaaf875cf3ab34604b61f28bef0 | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /tests/lean/run/implicit.lean | 1c642fb37eac0a1790e02f2d86be31f55e9cf5a4 | [
"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 | 224 | lean | import standard
definition f {A : Type} {B : Type} (f : A → B → Prop) ⦃C : Type⦄ {R : C → C → Prop} {c : C} (H : R c c) : R c c
:= H
variable g : Prop → Prop → Prop
variable H : true ∧ true
check f g H
|
3d8a20832d1803687f770f321a299a6f0206aef5 | 32025d5c2d6e33ad3b6dd8a3c91e1e838066a7f7 | /stage0/src/Lean/Meta/SynthInstance.lean | 716a1575712dd403302a5a17738f49d09879bcec | [
"Apache-2.0"
] | permissive | walterhu1015/lean4 | b2c71b688975177402758924eaa513475ed6ce72 | 2214d81e84646a905d0b20b032c89caf89c737ad | refs/heads/master | 1,671,342,096,906 | 1,599,695,985,000 | 1,599,695,985,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 24,257 | 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.LevelDefEq
impor... |
70fabedc75350f7abe850e14aa3222a7edeb2e7c | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/algebra/ring/prod.lean | 2a575eeb2c5722bf7dd28a391d4c4b3c159be297 | [
"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,789 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Chris Hughes, Mario Carneiro, Yury Kudryashov
-/
import algebra.group.prod
import algebra.ring.basic
/-!
# Semiring, ring etc structures on `R × S`
In this file we d... |
72f70eda1cea40c1dd385478927ab4a6fba88724 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/repr.lean | bce39c05316746a2ee8f8faa4439ada9988f5f5d | [
"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 | 608 | lean | --
#eval repr (1, 2, 3)
#eval repr (some 1, some (some true))
#eval List.iota 10 |>.map some |>.map some
#eval List.iota 15 |>.map fun x => (x, some x)
#eval repr ("hello", 1, true, false, 'a', "testing tuples", "another string", "another string", "testing bigger tuples that should not fit in a single line", 20)
#eval... |
fd5c95b5a4d21f02b20891861478f2ea2d154d8f | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/topology/metric_space/contracting_auto.lean | e82a4bbb0ae8bb4bc63e2191b1710b34c5bb2d88 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 16,158 | lean | /-
Copyright (c) 2019 Rohan Mitta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Rohan Mitta, Kevin Buzzard, Alistair Tucker, Johannes Hölzl, Yury Kudryashov
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.analysis.specific_limits
import ... |
a458e3a0c192135ab218a4706c8f4ff5c74a5234 | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /src/topology/instances/ennreal.lean | c8385d3b88d039cad811708a4deb6f83e6228e3e | [
"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 | 40,035 | 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.nnreal
/-!
# Extended non-negative reals
-/
noncomputable theory
open classical set filter metric
open_locale classical
open_locale topologi... |
cba2b2a3fe60ca9763fd34047c8fa2795d1e177c | 4a092885406df4e441e9bb9065d9405dacb94cd8 | /src/continuous_valuations.lean | 6214b14666636df8a0400694d3d56df01f15022b | [
"Apache-2.0"
] | permissive | semorrison/lean-perfectoid-spaces | 78c1572cedbfae9c3e460d8aaf91de38616904d8 | bb4311dff45791170bcb1b6a983e2591bee88a19 | refs/heads/master | 1,588,841,765,494 | 1,554,805,620,000 | 1,554,805,620,000 | 180,353,546 | 0 | 1 | null | 1,554,809,880,000 | 1,554,809,880,000 | null | UTF-8 | Lean | false | false | 4,923 | lean | import topology.algebra.ring
import valuation_spectrum
import for_mathlib.logic
universes u u₀ u₁ u₂ u₃
namespace valuation
variables {R : Type u₀} [comm_ring R] [topological_space R] [topological_ring R]
variables {Γ : Type u} [linear_ordered_comm_group Γ]
variables {Γ₁ : Type u₁} [linear_ordered_comm_group Γ₁]
var... |
f80d8caab3bcfd961116cdc55c3b86c707a430ae | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/data/nat/modeq.lean | f404bdd49f24840b97b0888b6d097132fe65d832 | [
"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 | 9,061 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
Modular equality relation.
-/
import data.int.gcd algebra.ordered_ring
namespace nat
/-- Modular equality. `modeq n a b`, or `a ≡ b [MOD n]`, means
that `a - b` is ... |
0ea5182fa369d21cecc0d354d405eaba88d2839f | 4fa161becb8ce7378a709f5992a594764699e268 | /src/order/filter/basic.lean | 7207c3f30c24f438d652d911dd5cc52b564bf3f6 | [
"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 | 86,676 | 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, Jeremy Avigad
-/
import order.zorn
import order.copy
import data.set.finite
/-!
# Theory of filters on sets
## Main definitions
* `filter` : filters on a set;
* `at_... |
57b08d9f57635a38c8f9bb59f185d6c0686d6872 | d534932ed7c1eba03b537c377a4f8961acd41e99 | /examples/sockaddr/lakefile.lean | 1e9fc7ea0bf93862e1db19be5cdef3da7534667c | [
"Apache-2.0"
] | permissive | Adminixtrator/lean4-socket | d7e321d547df6545d0c085d310be8f2c41c44ddb | b313041f2e75f4ad8320ab66d7e2afafd2202318 | refs/heads/main | 1,692,582,696,753 | 1,633,439,398,000 | 1,633,439,523,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 132 | lean | import Lake
open Lake DSL
package sockaddr where
dependencies := #[{
name := `socket
src := Source.path "../../lake"
}] |
e8d8c48af2019b986918eaf7f8b55b699a992f4b | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/field_theory/minpoly.lean | fde1e22a19892147a2f7b712548d4a85f3d551de | [
"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 | 17,652 | lean | /-
Copyright (c) 2019 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Johan Commelin
-/
import data.polynomial.field_division
import ring_theory.integral_closure
import ring_theory.polynomial.gauss_lemma
/-!
# Minimal polynomials
This file ... |
394ae7669ef0436788e453663d0b24bc7b1ba969 | 0707842a58b971bc2c537fdcab2f5cef1c12d77a | /lean4/04_basic_functions.lean | 09e93c01a813c9b82b663888b2bfdb59edd3152f | [] | no_license | adolfont/LearningProgramming | 7a41e5dfde8df72fc0b4a23592999ecdb22a26e0 | 866e6654d347287bd0c63aa31d18705174f00324 | refs/heads/master | 1,652,902,832,503 | 1,651,315,660,000 | 1,651,315,660,000 | 1,328,601 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,397 | lean | -- Source: https://leanprover.github.io/lean4/doc/tour.html
namespace BasicFunctions
-- The `#eval` command evaluates an expression on the fly and prints the result.
#eval 2+2
-- You use 'def' to define a function. This one accepts a natural number
-- and returns a natural number.
-- Parentheses are optional for fun... |
fe9bbc5e3a596f6b46831159625ae891678a466b | 36938939954e91f23dec66a02728db08a7acfcf9 | /lean/deps/galois_stdlib/src/galois/category/combinators.lean | bb9ae8edabfe06c89681c21840fb0fb8f75e6e25 | [
"Apache-2.0"
] | permissive | pnwamk/reopt-vcg | f8b56dd0279392a5e1c6aee721be8138e6b558d3 | c9f9f185fbefc25c36c4b506bbc85fd1a03c3b6d | refs/heads/master | 1,631,145,017,772 | 1,593,549,019,000 | 1,593,549,143,000 | 254,191,418 | 0 | 0 | null | 1,586,377,077,000 | 1,586,377,077,000 | null | UTF-8 | Lean | false | false | 493 | lean | /-
This defines a few combinators for monads that aren't in the standard library.
-/
universes u v
/-- `pwhen c a` executes `a` when `c` is true; polymorphic version of `when` -/
def pwhen {m : Type u → Type v} [monad m] (c : Prop) [h : decidable c] (t : m punit) : m punit :=
ite c t (pure punit.star)
/-- `punless... |
0345875f2caae4b21d9c0a0e876f9e421c8ec8cd | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /test/likely_generated_name.lean | ecec0a9cbde089cbe45af4f083abec3040b36d1a | [
"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 | 689 | lean | /-
Copyright (c) 2020 Jannis Limperg. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jannis Limperg
-/
import meta.expr
/-
Lean currently uses the name ᾰ for binders which aren't given a name explicitly
(e.g. when using a function arrow to define a Π type). This test... |
9e31e0149f2ad9899dd49298243bf981ae19f1fa | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/set/lattice.lean | 7f0a924b57c9f4b10370760939debbdaec0b9fac | [] | 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 | 59,152 | 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, Johannes Hölzl, Mario Carneiro
-- QUESTION: can make the first argument in ∀ x ∈ a, ... implicit?
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.in... |
69c0550b83731b25d3a008484b2a2e67d39d6559 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/simp_trace.lean | d220889adee8477ed88401e2c605e15fffe8f28b | [
"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 | 382 | lean | -- Options (particularly trace options) are refreshed
-- upon entry to the simplifier.
example {p : Prop} (h : p) : p :=
begin
have h₁ : true = true := rfl,
have h₂ : true = true := rfl,
have h₃ : true = true := rfl,
simp at h₁,
tactic.set_bool_option `trace.simplify.rewrite tt,
simp at h₂,
tactic.set_bo... |
4e4f8f6bfac364a5e3dda781e53a4af6e5e00136 | 0c1546a496eccfb56620165cad015f88d56190c5 | /tests/lean/run/auto_propext.lean | 22ab32acfda845d9797293aa66e4f1c563b44cde | [
"Apache-2.0"
] | permissive | Solertis/lean | 491e0939957486f664498fbfb02546e042699958 | 84188c5aa1673fdf37a082b2de8562dddf53df3f | refs/heads/master | 1,610,174,257,606 | 1,486,263,620,000 | 1,486,263,620,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 107 | lean | example (p q : Prop) (h : p) : q ∨ p :=
by simp [h]
example (p q : Prop) : p → q ∨ p :=
by ctx_simp
|
12d2a33952255f490ea1b834b9bfbba144f82474 | 4f9ca1935adf84f1bae9c5740ec1f2ad406716fa | /src/analysis/complex/exponential.lean | 2a6f73fc443f1f560254a768c462da9cd06473f3 | [
"Apache-2.0"
] | permissive | matthew-hilty/mathlib | 36fd7db866365e9ee4a0ba1d6f8ad34d068cec6c | 585e107f9811719832c6656f49e1263a8eef5380 | refs/heads/master | 1,607,100,509,178 | 1,578,151,707,000 | 1,578,151,707,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 82,393 | 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 tactic.linarith data.complex.exponential analysis.specific_limits
group_theory.quotient_group analysis.comple... |
af81a24520bb832e690fe5665f8fdf9723561393 | e9e522945c3343bde702d42749ae47c79b79e996 | /models/lean/core.lean | af3495ce9d5f391e2ab0ed026775ddd68f009e57 | [
"BSD-2-Clause"
] | permissive | hopper-lang/hopper-v0 | a3f1c2e8d5c8658f1085770a80d160d655a21eff | e0de23b3c78313a7f6856c3d48c3d6a2ce3962dd | refs/heads/master | 1,620,061,254,821 | 1,474,595,525,000 | 1,474,595,525,000 | 52,626,148 | 17 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,064 | lean |
import data.bool
import data.nat
import data.list
-- import data.examples.vector
import data.fin
set_option pp.all true
check vector
inductive
/-
debrujin representation
-/
check nat.succ
check Type.{imax 0 1}
check Type.{imax 1 2}
check Type.{imax 2 0}
check Type.{imax 1 0}
inductive Var ( a b : Type ) : Ty... |
d310aa4cb6f5641434fc8df9a61b62d2dfcc6d80 | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/data/equiv/encodable.lean | 2acbd471b339d6252f04a9c6fcf2db660c135c8c | [
"Apache-2.0"
] | permissive | vaibhavkarve/mathlib | a574aaf68c0a431a47fa82ce0637f0f769826bfe | 17f8340912468f49bdc30acdb9a9fa02eeb0473a | refs/heads/master | 1,621,263,802,637 | 1,585,399,588,000 | 1,585,399,588,000 | 250,833,447 | 0 | 0 | Apache-2.0 | 1,585,410,341,000 | 1,585,410,341,000 | null | UTF-8 | Lean | false | false | 13,340 | 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, Mario Carneiro
Type class for encodable Types.
Note that every encodable Type is countable.
-/
import data.equiv.nat order.order_iso
open option list nat func... |
57ddfc280fb8004dd122454d9135b00500fe9239 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/set_theory/game/state.lean | 1c7e7612bc5e1ae479e6271f3cab5082a4d8ee97 | [] | 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,682 | 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.set_theory.game.short
import Mathlib.PostPort
universes u l
namespace Mathlib
/-!
# Gam... |
a0c0543a97a5a2fa6e124ab99a13b36b9405938f | 2d787ac9a5ab28a7d164cd13cee8a3cdc1e4680a | /src/my_exercises/05_sequence_limits.lean | df350ac5019d86a587c7aef89e1c3e3c77b7b450 | [
"Apache-2.0"
] | permissive | paulzfm/lean3-tutorials | 8c113ec2c9494d401c8a877f094db93e5a631fd6 | f41baf1c62c251976ec8dd9ccae9e85ec4c4d336 | refs/heads/master | 1,679,267,488,532 | 1,614,782,461,000 | 1,614,782,461,000 | 344,157,026 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,698 | lean | import data.real.basic
import algebra.group.pi
import tuto_lib
notation `|`x`|` := abs x
/-
In this file we manipulate the elementary definition of limits of
sequences of real numbers.
mathlib has a much more general definition of limits, but here
we want to practice using the logical operators and relations
covered... |
d42e212791c77664a382fb1d5ca1bdc39db640cf | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/data/int/sqrt.lean | 395e8dadb4d317f872efd116872c3a639f46058b | [
"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 | 886 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import data.nat.sqrt data.int.basic
namespace int
/-- `sqrt n` is the square root of an integer `n`. If `n` is not a
perfect square, and is positive, it returns the larges... |
6e4787fff99270b07f8cad2dd3c9f7a237e9baa9 | 1abd1ed12aa68b375cdef28959f39531c6e95b84 | /src/linear_algebra/matrix/to_linear_equiv.lean | de959185e33fae80dc9e77bb51d2695d1bd1576f | [
"Apache-2.0"
] | permissive | jumpy4/mathlib | d3829e75173012833e9f15ac16e481e17596de0f | af36f1a35f279f0e5b3c2a77647c6bf2cfd51a13 | refs/heads/master | 1,693,508,842,818 | 1,636,203,271,000 | 1,636,203,271,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,382 | 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.nondegenerate
import linear_algebra.matrix.nonsingular_inverse
import linear_algebra.matrix.to_... |
0ece8f4b7ad8ddb4df3d3bd0b24a6e2148bf3814 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/data/zmod/basic.lean | 17b61cecd199bcf1aecf4eb3df65471f0e8467fa | [
"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 | 32,531 | 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.int.modeq
import algebra.char_p.basic
import ring_theory.ideal.operations
import tactic.fin_cases
/-!
# Integers mod `n`
Definition of the integers mod n, ... |
063af10e8ee07906f045854413a769ea77de5996 | 4c9815277c8976de4e56645c018f488aeda377e1 | /logic_and_proof/propositions.lean | c49658d127e5614e81abfef4e180e6dd34325913 | [] | no_license | na-ka-na/lean-practice | 1b300b4feb73d1bed834e7da20bb53dc29510b04 | 1617dfb0e216db1182e83d68e4371d0e3ca45580 | refs/heads/master | 1,669,986,867,115 | 1,597,654,365,000 | 1,597,654,365,000 | 288,049,299 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,004 | lean | variables A B C D P Q R: Prop
example : A ∧ (A → B) → B :=
assume ⟨ hA, hAimpB ⟩, hAimpB hA
example : A → ¬ (¬ A ∧ B) :=
assume : A,
show ¬ (¬ A ∧ B), from
assume ⟨ hnotA, hB ⟩, show false, from hnotA ‹A›
example : ¬ (A ∧ B) → (A → ¬ B) :=
assume : ¬ (A ∧ B),
show (A → ¬ B), from
assume : A, show ¬ B, f... |
3ce5860be3818002fc88f9962b569b9784031d6d | a4673261e60b025e2c8c825dfa4ab9108246c32e | /tests/lean/run/beginEndAsMacro.lean | 730372edb8cb40f6fe68abc2ea93fd6c9045154f | [
"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 | 567 | lean | syntax[beginEndKind] "begin " sepByT(tactic, ", ") "end" : term
open Lean in
@[macro beginEndKind] def expandBeginEnd : Lean.Macro := fun stx =>
match_syntax stx with
| `(begin $ts* end) => do
let ts := ts.getSepElems.map fun t => mkNullNode #[t, mkNullNode]
let tseq := mkNode `Lean.Parser.Tactic.tacti... |
25c7a2db95e065f3073a19f597718a232952ecf7 | d29d82a0af640c937e499f6be79fc552eae0aa13 | /src/algebra/big_operators/basic.lean | dbd751587c032cddaf2d9218efa34b8ab5436b67 | [
"Apache-2.0"
] | permissive | AbdulMajeedkhurasani/mathlib | 835f8a5c5cf3075b250b3737172043ab4fa1edf6 | 79bc7323b164aebd000524ebafd198eb0e17f956 | refs/heads/master | 1,688,003,895,660 | 1,627,788,521,000 | 1,627,788,521,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 60,023 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
-/
import data.finset.fold
import data.equiv.mul_add
import tactic.abel
/-!
# Big operators
In this file we define products and sums indexed by finite sets (specifica... |
0db66bab7e09312a97b8b49637fe697feb6478a0 | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/linear_algebra/direct_sum_module.lean | 78d2ffccc2e368159948b2fba401bbf064aee78d | [
"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 | 2,498 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
Direct sum of modules over commutative rings, indexed by a discrete type.
-/
import algebra.direct_sum
import linear_algebra.basic
universes u v w u₁
variables (R : Type u) [c... |
2e06b2d34923e8c40bfe03ff2e14a03050a6848b | 32025d5c2d6e33ad3b6dd8a3c91e1e838066a7f7 | /src/Lean/Meta/Tactic/Apply.lean | ee0eb0703119a08b1ceacc8f900ea6570878c8f6 | [
"Apache-2.0"
] | permissive | walterhu1015/lean4 | b2c71b688975177402758924eaa513475ed6ce72 | 2214d81e84646a905d0b20b032c89caf89c737ad | refs/heads/master | 1,671,342,096,906 | 1,599,695,985,000 | 1,599,695,985,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,826 | 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.FindMVar
import Lean.Meta.ExprDefEq
import Lean.Meta.SynthInstance
import Lean.Meta.Tactic.Util
namespace Lean
namespace Meta
/-
Comput... |
9b7c270af6a0b5c4732b7eec0e06185935256231 | ad0c7d243dc1bd563419e2767ed42fb323d7beea | /data/nat/cast.lean | 2ad3dc14e5efebec7d846f322adea336490ca203 | [
"Apache-2.0"
] | permissive | sebzim4500/mathlib | e0b5a63b1655f910dee30badf09bd7e191d3cf30 | 6997cafbd3a7325af5cb318561768c316ceb7757 | refs/heads/master | 1,585,549,958,618 | 1,538,221,723,000 | 1,538,221,723,000 | 150,869,076 | 0 | 0 | Apache-2.0 | 1,538,229,323,000 | 1,538,229,323,000 | null | UTF-8 | Lean | false | false | 3,657 | lean | /-
Copyright (c) 2014 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
Natural homomorphism from the natural numbers into a monoid with one.
-/
import tactic.interactive algebra.order algebra.ordered_group
namespace nat
variables {α : Typ... |
7445ee7663df0f3e326fbe86382c9d565f06a694 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/analysis/calculus/iterated_deriv.lean | 10795867616d8fc2cabb0d253075ca734b638e0d | [
"Apache-2.0"
] | permissive | ramonfmir/mathlib | c5dc8b33155473fab97c38bd3aa6723dc289beaa | 14c52e990c17f5a00c0cc9e09847af16fabbed25 | refs/heads/master | 1,661,979,343,526 | 1,660,830,384,000 | 1,660,830,384,000 | 182,072,989 | 0 | 0 | null | 1,555,585,876,000 | 1,555,585,876,000 | null | UTF-8 | Lean | false | false | 14,472 | lean | /-
Copyright (c) 2020 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import analysis.calculus.deriv
import analysis.calculus.cont_diff
/-!
# One-dimensional iterated derivatives
We define the `n`-th derivative of a function `f ... |
7aa9ca0436239416b1a4aa64a7db212b5f69e120 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/exact_partial.lean | b3522bd00dffff018d87fa56cce36d8f281ba5ce | [
"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 | 91 | lean | example (a b : Prop) : a → b → a ∧ b :=
begin
intros,
exact (and.intro _ _),
end
|
f0daceeb4ca6b2cf0711ab2ab69e5316bb6d6739 | 9631e35ca5dd719ccc7d3a57ec322fd93d6a0776 | /src/maze_with_fire/level.lean | 5253b3558a5ad2550b0d37a669fb7aa3baf51863 | [] | no_license | kbuzzard/maze-game | 123fa47e0262edb6d147178d239a345d847ff147 | 362ab394ae5218c43b24232aaeef08efc0067eab | refs/heads/master | 1,670,131,466,823 | 1,598,546,702,000 | 1,598,546,702,000 | 290,744,081 | 5 | 1 | null | 1,598,546,703,000 | 1,598,523,538,000 | Lean | UTF-8 | Lean | false | false | 755 | lean | -- import the definition of the example maze
import maze_with_fire.definition
/-!
# Maze with fire.
You are in a maze of twisty passages, all distinct.
You can go north, south east or west.
If you fall into the fire, you will end up in the room of death,
room 5.
-/
namespace maze
/- Solver remark : there are 6 ... |
31a0cb01871c8eec71bc7d47570d2a55e8178224 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/vector2_auto.lean | 7a896f394154fa08a7ea6f8f78212114db29c84e | [] | 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,695 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.Lean3Lib.data.vector
import Mathlib.data.list.nodup
import Mathlib.data.list.of_fn
import M... |
ef692236308eac8dfc435b9b450b5bc8f500f485 | 491068d2ad28831e7dade8d6dff871c3e49d9431 | /library/algebra/ordered_group.lean | 75afaae809921cf071bb61211f4ebde78b3b0407 | [
"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 | 32,111 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
Partially ordered additive groups, modeled on Isabelle's library. These classes can be refined
if necessary.
-/
import logic.eq data.unit data.sigma data.prod
import alge... |
42bb078bb6e3aabd4c0eee221e633fe6cc0acbc2 | 4bcaca5dc83d49803f72b7b5920b75b6e7d9de2d | /stage0/src/Lean/Elab/Notation.lean | 6291658b3464403a345e6adea391df13d3175294 | [
"Apache-2.0"
] | permissive | subfish-zhou/leanprover-zh_CN.github.io | 30b9fba9bd790720bd95764e61ae796697d2f603 | 8b2985d4a3d458ceda9361ac454c28168d920d3f | refs/heads/master | 1,689,709,967,820 | 1,632,503,056,000 | 1,632,503,056,000 | 409,962,097 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,828 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Elab.Syntax
namespace Lean.Elab.Command
open Lean.Syntax
open Lean.Parser.Term hiding macroArg
open Lean.Parser.Command
/- Wrap all occurrence... |
6035b9d1b1e3d4a8338816c2180e45b018096a34 | 0845ae2ca02071debcfd4ac24be871236c01784f | /library/init/lean/compiler/ir/pushproj.lean | 0235e3d37b5a618836d096e6597a8eb28b8cad6d | [
"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 | 2,110 | 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.compiler.ir.basic
import init.lean.compiler.ir.freevars
namespace Lean
namespace IR
partial def pushProjs : Array FnBody → Array ... |
3a0d2edeabc7cd8e6af8f9f2a8f0b46012a93145 | 491068d2ad28831e7dade8d6dff871c3e49d9431 | /tests/lean/run/tactic23.lean | 2bbf670c5c90aa0241173ee6202b54c444c3b894 | [
"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 | 998 | lean | import logic
namespace experiment
inductive nat : Type :=
| zero : nat
| succ : nat → nat
namespace nat
definition add (a b : nat) : nat
:= nat.rec a (λ n r, succ r) b
infixl `+` := add
definition one := succ zero
-- Define coercion from num -> nat
-- By default the parser converts numerals into a binary representat... |
7270d9af1dbab36f8ba401280df68d4f242612f8 | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /tests/lean/hott/cases_eq.hlean | f1f19806b59c5bd7eb275adbb81c3930257375d3 | [
"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 | 508 | hlean | open eq.ops
theorem trans {A : Type} {a b c : A} (h₁ : a = b) (h₂ : b = c) : a = c :=
begin
cases h₁, cases h₂, apply rfl
end
theorem symm {A : Type} {a b : A} (h₁ : a = b) : b = a :=
begin
cases h₁, apply rfl
end
theorem congr {A B : Type} (f : A → B) {a₁ a₂ : A} (h : a₁ = a₂) : f a₁ = f a₂ :=
begin
cases h, ... |
da907041b8ea1d1ea94ac945d9f192e853a4fb70 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/order/basic.lean | f8fa2c8e0e14273224084297bf009532fd633c27 | [
"Apache-2.0"
] | permissive | ramonfmir/mathlib | c5dc8b33155473fab97c38bd3aa6723dc289beaa | 14c52e990c17f5a00c0cc9e09847af16fabbed25 | refs/heads/master | 1,661,979,343,526 | 1,660,830,384,000 | 1,660,830,384,000 | 182,072,989 | 0 | 0 | null | 1,555,585,876,000 | 1,555,585,876,000 | null | UTF-8 | Lean | false | false | 32,762 | 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.basic
import data.subtype
/-!
# Basic definitions about `≤` and `<`
This file proves basic results about orders, provides extensive d... |
3be38335b14b59756b756261828fcc1d0eac2d18 | 02005f45e00c7ecf2c8ca5db60251bd1e9c860b5 | /src/data/fin.lean | dd11bd5066908edfd058e4d50bac9c17ab4ad738 | [
"Apache-2.0"
] | permissive | anthony2698/mathlib | 03cd69fe5c280b0916f6df2d07c614c8e1efe890 | 407615e05814e98b24b2ff322b14e8e3eb5e5d67 | refs/heads/master | 1,678,792,774,873 | 1,614,371,563,000 | 1,614,371,563,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 60,047 | lean | /-
Copyright (c) 2017 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis, Keeley Hoek
-/
import data.nat.cast
import tactic.localized
import tactic.apply_fun
import order.rel_iso
/-!
# The finite type with `n` elements
`fin n` is the type... |
b6f234f5c6dda9bdf8919766754943e471bca130 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/order/filter/lift.lean | e0f6b01b0a2ca2ac50a067a3968e8739c6adbc0d | [
"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 | 16,401 | 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
Lift filters along filter and set functions.
-/
import order.filter.basic
open set
open_locale classical filter
namespace filter
variables {α : Type*} {β : Type*} {γ... |
0856a31c11a2553e7ae7df6a8dab404dec3fe40e | 59a4b050600ed7b3d5826a8478db0a9bdc190252 | /src/category_theory/universal/continuous.lean | 9390a7c3ba332100dcc29cba6d1ff7f7ea81b5f6 | [] | no_license | rwbarton/lean-category-theory | f720268d800b62a25d69842ca7b5d27822f00652 | 00df814d463406b7a13a56f5dcda67758ba1b419 | refs/heads/master | 1,585,366,296,767 | 1,536,151,349,000 | 1,536,151,349,000 | 147,652,096 | 0 | 0 | null | 1,536,226,960,000 | 1,536,226,960,000 | null | UTF-8 | Lean | false | false | 1,444 | lean | -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Scott Morrison
import category_theory.universal.cones
open category_theory.limits
namespace category_theory
universes u v
variables {C : Type u} [𝒞 : category.{u v} C] {D : ... |
b35500e1b9da1f6f57d410ab176f2f639956098f | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/data/equiv/basic.lean | ce54b03d2c4b38ffa09896db2c5e4ab71715bbb3 | [
"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 | 70,201 | 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
In the standard library we cannot assume the univalence axiom.
We say two types are equivalent if they are isomorphic.
Two equivalent types h... |
2bf3bfe8f7239dca30e4f9c9f3ea6a9b04af872e | 66a6486e19b71391cc438afee5f081a4257564ec | /homotopy/three_by_three.hlean | 9379b320e84b3288c1d2a62014dd3efd2fb04f39 | [
"Apache-2.0"
] | permissive | spiceghello/Spectral | c8ccd1e32d4b6a9132ccee20fcba44b477cd0331 | 20023aa3de27c22ab9f9b4a177f5a1efdec2b19f | refs/heads/master | 1,611,263,374,078 | 1,523,349,717,000 | 1,523,349,717,000 | 92,312,239 | 0 | 0 | null | 1,495,642,470,000 | 1,495,642,470,000 | null | UTF-8 | Lean | false | false | 2,382 | hlean | -- WIP
import ..move_to_lib
open function eq
namespace pushout
section
-- structure span2 : Type :=
-- {A₀₀ A₀₂ A₀₄ A₂₀ A₂₂ A₂₄ A₄₀ A₄₂ A₄₄ : Type}
-- {f₀₁ : A₀₂ → A₀₀} {f₂₁ : A₂₂ → A₂₀} {f₄₁ : A₄₂ → A₄₀}
-- {f₀₃ : A₀₂ → A₀₄} {f₂₃ : A₂₂ → A₂₄} {f₄₃ : A₄₂ → A₄₄}
-- {f₁₀ : A₂₀ → A₀₀} {f₁₂ : A₂₂ → A... |
d8a2bb619230c6ddae5d42912cbd7f71764fcf8b | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/category/functor.lean | c2fba987824a3220c175ef3259f9797fd4dec036 | [
"Apache-2.0"
] | permissive | gebner/mathlib | eab0150cc4f79ec45d2016a8c21750244a2e7ff0 | cc6a6edc397c55118df62831e23bfbd6e6c6b4ab | refs/heads/master | 1,625,574,853,976 | 1,586,712,827,000 | 1,586,712,827,000 | 99,101,412 | 1 | 0 | Apache-2.0 | 1,586,716,389,000 | 1,501,667,958,000 | Lean | UTF-8 | Lean | false | false | 4,446 | lean | /-
Copyright (c) 2017 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Simon Hudon
Standard identity and composition functors
-/
import tactic.ext tactic.lint category.basic
universe variables u v w
section functor
variables {F : Type u → Type v}
variable... |
6ff9540a1d1c51e4af82d46e460ab181524620f0 | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/tactic/tfae.lean | b2629e03b0b4ae9dfc54977ec4289e8be736a787 | [
"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 | 3,068 | lean | /-
Copyright (c) 2018 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Reid Barton, Simon Hudon
"The Following Are Equivalent" (tfae) :
Tactic for proving the equivalence of a set of proposition
using various implications between them.
-/... |
122d51299171406bd6c370a2d5825d33b4e380bc | c777c32c8e484e195053731103c5e52af26a25d1 | /src/analysis/convex/strict_convex_space.lean | 751345c147d107f2e4b21f8371444f42af304934 | [
"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 | 14,183 | 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, Yury Kudryashov
-/
import analysis.convex.normed
import analysis.convex.strict
import analysis.normed.order.basic
import analysis.normed_space.add_torsor
import analysis.no... |
35d6ef0785add065194805303ad66c60d17fd574 | 95ac00a060729805e0320c0f4084d6b35729f8dd | /src/tactic/interactive.lean | 421758c7259f125ef278e64a39bf967c5e613f02 | [
"Apache-2.0"
] | permissive | holtzermann17/mathlib | e71f8319634d8a1171ff0bf104e64ff838e8b641 | d8f6dc46f2efb7278c6e5d68442c6e969388e93a | refs/heads/master | 1,584,975,663,098 | 1,547,733,323,000 | 1,549,020,382,000 | 141,714,796 | 0 | 0 | null | 1,532,092,944,000 | 1,532,092,944,000 | null | UTF-8 | Lean | false | false | 25,474 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Simon Hudon, Sebastien Gouezel, Scott Morrison
-/
import data.dlist data.dlist.basic data.prod category.basic
tactic.basic tactic.rcases tactic.generalize_proofs
ta... |
7ece49b6d4e717a16ee41981ba78a7283eba255c | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /stage0/src/Lean/Eval.lean | f914ac96cb23d285780788e4b15a2d38bf4460f4 | [
"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 | 860 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Sebastian Ullrich
-/
import Lean.Environment
namespace Lean
universe u
/-- `Eval` extension that gives access to the current environment & options.
The... |
0c4c6f9857e0f5fb1697f31566343f82c5846874 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /test/conv/conv.lean | 2e3ed7ca402b50384baa38e5203d1885bc5770e5 | [
"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,536 | lean | /-
Copyright (c) 2019 Lucas Allen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Lucas Allen
Tests for the `conv` tactic inside the inveractive `conv` monad
-/
import tactic.converter.interactive
example (a b c d : ℕ) (h₁ : b = c) (h₂ : a + c = a + d) : a + b = a +... |
731255d35bbb693da09fc0a18716185b70783145 | 453dcd7c0d1ef170b0843a81d7d8caedc9741dce | /order/basic.lean | f16960091e7aada426404996bcb34ff7c545ad8f | [
"Apache-2.0"
] | permissive | amswerdlow/mathlib | 9af77a1f08486d8fa059448ae2d97795bd12ec0c | 27f96e30b9c9bf518341705c99d641c38638dfd0 | refs/heads/master | 1,585,200,953,598 | 1,534,275,532,000 | 1,534,275,532,000 | 144,564,700 | 0 | 0 | null | 1,534,156,197,000 | 1,534,156,197,000 | null | UTF-8 | Lean | false | false | 14,704 | 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 tactic.interactive logic.basic data.sum data.set.basic algebra.order
open function
/- TODO: automatic construction of dual definitions / theorem... |
7dba79da6010fee900fb3f0e3b22adec367eec0d | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/algebra/category/Group/limits.lean | c807dcbde08a914d6ca2cb2db2fa8953ac609fd5 | [] | 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 | 10,847 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.algebra.category.Mon.limits
import Mathlib.algebra.category.Group.preadditive
import Mathli... |
e62659df8c48aa32f2e13f7afb5604aa46ee3d98 | 947b78d97130d56365ae2ec264df196ce769371a | /src/Lean/Parser/Command.lean | e9cdecb74124830fe5e2005887e1432b3c5ecb3b | [
"Apache-2.0"
] | permissive | shyamalschandra/lean4 | 27044812be8698f0c79147615b1d5090b9f4b037 | 6e7a883b21eaf62831e8111b251dc9b18f40e604 | refs/heads/master | 1,671,417,126,371 | 1,601,859,995,000 | 1,601,860,020,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,738 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Sebastian Ullrich
-/
import Lean.Parser.Term
import Lean.Parser.Do
namespace Lean
namespace Parser
/--
Syntax quotation for terms and (lists of) commands.... |
054860139f797466a588a7a850401b068b2726d6 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/topology/metric_space/thickened_indicator.lean | 001701e9833f6f2825d4055687c3e130562fe011 | [
"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 | 11,853 | lean | /-
Copyright (c) 2022 Kalle Kytölä. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kalle Kytölä
-/
import data.real.ennreal
import topology.continuous_function.bounded
import topology.metric_space.hausdorff_distance
/-!
# Thickened indicators
> THIS FILE IS SYNCHRONI... |
474e993f8990703dee57724827980c9dcbcb48c6 | 367134ba5a65885e863bdc4507601606690974c1 | /src/data/fintype/basic.lean | 042af10bc4557de8d8a96102ad3bb754daee7082 | [
"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 | 58,026 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
Finite types.
-/
import tactic.wlog
import data.finset.powerset
import data.finset.lattice
import data.finset.pi
import data.array.lemmas
import order.well_founded
impor... |
5f3898ae21446e6b0ac539f430d140ce213af824 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/aStructPerfIssue.lean | 2e85d2b8f1dee7704ae9b7913ff21d3ce9584d97 | [
"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 | 10,326 | lean | noncomputable section
namespace MWE
universe u v w
inductive Id {A : Type u} : A → A → Type u
| refl {a : A} : Id a a
attribute [eliminator] Id.casesOn
infix:50 (priority := high) " = " => Id
@[match_pattern] abbrev idp {A : Type u} (a : A) : a = a := Id.refl
def Id.symm {A : Type u} {a b : A} (p : a = b) : b = a... |
0deef97ca81d28101fb74e3ea65d843ff9fc5bee | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/data/bool/basic_auto.lean | 7d858ea9dc0a6928bb906d546f533139f96eda17 | [] | 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 | 717 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.core
universes u
namespace Mathlib
/-!
# Boolean operations
-/
/-- `cond b x y` is `x` if `b = tt` a... |
5079457cba246a87c04694d0432324e753658313 | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/algebra/field_power.lean | b40fc9f5be0d9a8bf938c94891784c7f1106b1ff | [
"Apache-2.0"
] | permissive | ilitzroth/mathlib | ea647e67f1fdfd19a0f7bdc5504e8acec6180011 | 5254ef14e3465f6504306132fe3ba9cec9ffff16 | refs/heads/master | 1,680,086,661,182 | 1,617,715,647,000 | 1,617,715,647,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,909 | lean | /-
Copyright (c) 2018 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
-/
import algebra.group_with_zero.power
import tactic.linarith
/-!
# Integer power operation on fields and division rings
This file collects basic facts about the op... |
173502c6588dd4cdb79dc5fb90ddfc694fbe0d16 | 367134ba5a65885e863bdc4507601606690974c1 | /src/data/multiset/gcd.lean | 0ad7ca5b273848d269d6992225b93e3899212a3c | [
"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,101 | lean | /-
Copyright (c) 2020 Aaron Anderson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Aaron Anderson
-/
import data.multiset.lattice
import algebra.gcd_monoid
/-!
# GCD and LCM operations on multisets
## Main definitions
- `multiset.gcd` - the greatest common denomina... |
ce67c35141060dd051a3aa764996e55b704edac8 | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /tests/lean/run/inductionAltExplicit.lean | 027cc5520938bac2b3ae6f75cff466ad47e48426 | [
"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 | 1,292 | lean | inductive Lex (ra : α → α → Prop) (rb : β → β → Prop) : α × β → α × β → Prop where
| left {a₁} (b₁) {a₂} (b₂) (h : ra a₁ a₂) : Lex ra rb (a₁, b₁) (a₂, b₂)
| right (a) {b₁ b₂} (h : rb b₁ b₂) : Lex ra rb (a, b₁) (a, b₂)
def lexAccessible1 {ra : α → α → Prop} {rb : β → β → Prop} (aca : (a : α) → Acc ra a) ... |
05e7d418bb46ce2b6c7315d4750b521a16ae59fa | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/number_theory/bernoulli_polynomials.lean | 163162901b42d227e3e8765d52e2b49032ca4471 | [
"Apache-2.0"
] | permissive | ramonfmir/mathlib | c5dc8b33155473fab97c38bd3aa6723dc289beaa | 14c52e990c17f5a00c0cc9e09847af16fabbed25 | refs/heads/master | 1,661,979,343,526 | 1,660,830,384,000 | 1,660,830,384,000 | 182,072,989 | 0 | 0 | null | 1,555,585,876,000 | 1,555,585,876,000 | null | UTF-8 | Lean | false | false | 10,249 | lean | /-
Copyright (c) 2021 Ashvni Narayanan. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Ashvni Narayanan, David Loeffler
-/
import data.polynomial.algebra_map
import data.polynomial.derivative
import data.nat.choose.cast
import number_theory.bernoulli
/-!
# Bernoulli p... |
cbd002869ebd3c1e29b5da0784565726214d28ee | aa2345b30d710f7e75f13157a35845ee6d48c017 | /category_theory/full_subcategory.lean | 1aedc32db6dc63332a4d9d7d12382d812b6c5f9c | [
"Apache-2.0"
] | permissive | CohenCyril/mathlib | 5241b20a3fd0ac0133e48e618a5fb7761ca7dcbe | a12d5a192f5923016752f638d19fc1a51610f163 | refs/heads/master | 1,586,031,957,957 | 1,541,432,824,000 | 1,541,432,824,000 | 156,246,337 | 0 | 0 | Apache-2.0 | 1,541,434,514,000 | 1,541,434,513,000 | null | UTF-8 | Lean | false | false | 840 | lean | -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Scott Morrison
import category_theory.embedding
namespace category_theory
universes u v
section
variables {C : Type u} [𝒞 : category.{u v} C]
include 𝒞
instance full_subca... |
5d2dd4db9f0ef147eefcfda8909db6a38f2362f4 | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /10_Structures_and_Records.org.8.lean | 17a1e744a0e12008025f3d9eeac7dfbf4abb2a46 | [] | 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 | 274 | lean | import standard
structure point (A : Type) :=
mk :: (x : A) (y : A)
check {| point, x := 10, y := 20 |} -- point num
check {| point, y := 20, x := 10 |}
check ⦃ point, x := 10, y := 20 ⦄
example : {| point, x := 10, y := 20 |} = {| point, y := 20, x := 10 |} :=
rfl
|
b66c769ecfb26fdf141511d739bebd9a34102f3e | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/analysis/complex/cauchy_integral.lean | d109234451380858e913a9e771396485b07e7bb2 | [
"Apache-2.0"
] | permissive | ramonfmir/mathlib | c5dc8b33155473fab97c38bd3aa6723dc289beaa | 14c52e990c17f5a00c0cc9e09847af16fabbed25 | refs/heads/master | 1,661,979,343,526 | 1,660,830,384,000 | 1,660,830,384,000 | 182,072,989 | 0 | 0 | null | 1,555,585,876,000 | 1,555,585,876,000 | null | UTF-8 | Lean | false | false | 36,605 | 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.measure.complex_lebesgue
import measure_theory.integral.divergence_theorem
import measure_theory.integral.circle_integral
import analysis.calc... |
c6e5320cea1f5777778b86c457fad7d62467005b | c777c32c8e484e195053731103c5e52af26a25d1 | /src/analysis/calculus/cont_diff_def.lean | 51293f418f5bc254820e537e92ec764713ca5a0d | [
"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 | 78,283 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import analysis.calculus.fderiv.basic
import analysis.calculus.formal_multilinear_series
/-!
# Higher differentiability
A function is `C^1` on a domain if it ... |
5138c964552923e224989c2c3ab52f8027d41073 | 453dcd7c0d1ef170b0843a81d7d8caedc9741dce | /data/real/cau_seq.lean | 2ea711d839dc93cf2c2b172a5ac6773164f3cafb | [
"Apache-2.0"
] | permissive | amswerdlow/mathlib | 9af77a1f08486d8fa059448ae2d97795bd12ec0c | 27f96e30b9c9bf518341705c99d641c38638dfd0 | refs/heads/master | 1,585,200,953,598 | 1,534,275,532,000 | 1,534,275,532,000 | 144,564,700 | 0 | 0 | null | 1,534,156,197,000 | 1,534,156,197,000 | null | UTF-8 | Lean | false | false | 19,986 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
A basic theory of Cauchy sequences, used in the construction of the reals.
Where applicable, lemmas that will be reused in other contexts have
been stated in extra gene... |
b5b8182ca6d458da17f3e26f189ec23886f918c4 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/data/finset/lattice.lean | 5be371cc398405c2e137bd58b79a0d77fa6a7faa | [
"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 | 42,240 | 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.multiset.lattice
import order.order_dual
import order.complete_lattice
/-!
# Lattice operations on finsets
-/
variables {α β γ :... |
0a9814febfcdacbe7ddcc9489815e348027f58ac | efce24474b28579aba3272fdb77177dc2b11d7aa | /src/category_theory/bundled.lean | 386c08b03a2c509119ff76748d7f1688390df7e6 | [
"Apache-2.0"
] | permissive | rwbarton/lean-homotopy-theory | cff499f24268d60e1c546e7c86c33f58c62888ed | 39e1b4ea1ed1b0eca2f68bc64162dde6a6396dee | refs/heads/lean-3.4.2 | 1,622,711,883,224 | 1,598,550,958,000 | 1,598,550,958,000 | 136,023,667 | 12 | 6 | Apache-2.0 | 1,573,187,573,000 | 1,528,116,262,000 | Lean | UTF-8 | Lean | false | false | 1,532 | lean | import category_theory.base
import category_theory.functor
import category_theory.groupoid
universe u
-- The category of categories and the category of groupoids.
local notation f ` ∘ `:80 g:80 := g ≫ f
namespace category_theory
open category_theory.functor
section Cat
structure Cat : Type (u+1) :=
(carrier : Typ... |
17b0ce995d2c858477912fb23ab5588ba3242524 | 07c76fbd96ea1786cc6392fa834be62643cea420 | /hott/hit/prop_trunc.hlean | 1677ca62477cab9e6ba1fd743d6250dd275f3819 | [
"Apache-2.0"
] | permissive | fpvandoorn/lean2 | 5a430a153b570bf70dc8526d06f18fc000a60ad9 | 0889cf65b7b3cebfb8831b8731d89c2453dd1e9f | refs/heads/master | 1,592,036,508,364 | 1,545,093,958,000 | 1,545,093,958,000 | 75,436,854 | 0 | 0 | null | 1,480,718,780,000 | 1,480,718,780,000 | null | UTF-8 | Lean | false | false | 15,277 | hlean | import types.trunc hit.colimit homotopy.connectedness
open eq is_trunc unit quotient seq_colim pi nat equiv sum algebra is_conn function
/-
In this file we define the propositional truncation, which, given (X : Type)
has constructors
* tr : X → trunc X
* is_prop_trunc : is_prop (trunc X)
and wi... |
db8084d0a34906d129f069c4fbf887f42185ab2b | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/topology/algebra/multilinear.lean | e598fab1085d98713fb2aa79c1d8c8c29015bf7a | [
"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 | 13,358 | lean | /-
Copyright (c) 2020 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import topology.algebra.module
import linear_algebra.multilinear
/-!
# Continuous multilinear maps
We define continuous multilinear maps as maps from `Π(i : ι... |
e2e6c80105a19bf0088b215087c92d1a33ecd2eb | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/algebra/continued_fractions/computation/correctness_terminating.lean | bea80094f6fbdd255f33414f175ec6a585253cb1 | [
"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 | 11,832 | lean | /-
Copyright (c) 2020 Kevin Kappelmann. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Kappelmann
-/
import algebra.continued_fractions.computation.translations
import algebra.continued_fractions.terminated_stable
import algebra.continued_fractions.continuants_re... |
b4c9d55d4e63d7a4735fcddcc08919b42eb9be6c | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/topology/continuous_function/basic.lean | 025eda0e032fb9c03864bdf6bb03f283b1433697 | [
"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 | 10,711 | lean | /-
Copyright © 2020 Nicolò Cavalleri. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nicolò Cavalleri
-/
import data.set.Union_lift
import topology.subset_properties
import topology.tactic
import topology.algebra.ordered.proj_Icc
/-!
# Continuous bundled map
In this... |
51e6db52521faa110d74a3fcf26e5bdf922bbe17 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/data/real/cardinality.lean | e706700e4f6cfa9874aa2a837132e1140b851164 | [
"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 | 7,827 | 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
The cardinality of the reals.
-/
import set_theory.cardinal_ordinal
import analysis.specific_limits
import data.rat.denumerable
import data.set.intervals.image_prei... |
25e6d4de5c9a6caf6ac260b7306bb45815d487ea | e8159fb1a58abf09f7d75106ba3aa6c1c504c038 | /theorem-proving-in-lean/2.10.3 vector.lean | 20fedea97cf7135dc82ab7606a594bfafb23bd49 | [] | no_license | ndcroos/lean-snippets | cbf53e777a72964b6875a8c98bdd7eb02e74e246 | b66736347cd80a4143e43397f359dbdf9cbcd491 | refs/heads/master | 1,584,160,922,314 | 1,525,542,053,000 | 1,525,542,053,000 | 131,447,243 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 914 | lean | /-
Above, we used the example vec α n for vectors of elements of type α of length n.
Declare a constant vec_add that could represent a function that adds two vectors of natural numbers of the same length,
and a constant vec_reverse that can represent a function that reverses its argument.
Use implicit arguments for ... |
3391143ff37a71a34294b07b29dea3506e311495 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/bench/unionfind.lean | 53edda59455861db7bb964d2a70e105886810ea8 | [
"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 | 4,364 | lean | def StateT' (m : Type → Type) (σ : Type) (α : Type) := σ → m (α × σ)
namespace StateT'
variables {m : Type → Type} [Monad m] {σ : Type} {α β : Type}
@[inline] protected def pure (a : α) : StateT' m σ α := fun s => pure (a, s)
@[inline] protected def bind (x : StateT' m σ α) (f : α → StateT' m σ β) : StateT' m σ β := fu... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.