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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
32913bfa390f604d718d36eee3d71747ee061c5d | bdb33f8b7ea65f7705fc342a178508e2722eb851 | /data/seq/computation.lean | ffc98728fcde69e3ff5f923fcb65bec22e312c37 | [
"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 | 37,482 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
Coinductive formalization of unbounded computations.
-/
import data.stream data.nat.basic
universes u v w
/-
coinductive computation (α : Type u) : Type u
| retu... |
6b207f8ee129be9cd5165ed01949179acf2c11b2 | 432d948a4d3d242fdfb44b81c9e1b1baacd58617 | /src/linear_algebra/std_basis.lean | bec2f7a902ef2027fe7fce896c0e7179364753c8 | [
"Apache-2.0"
] | permissive | JLimperg/aesop3 | 306cc6570c556568897ed2e508c8869667252e8a | a4a116f650cc7403428e72bd2e2c4cda300fe03f | refs/heads/master | 1,682,884,916,368 | 1,620,320,033,000 | 1,620,320,033,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,219 | 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 linear_algebra.basic
import linear_algebra.basis
import linear_algebra.pi
/-!
# The standard basis
This file defines the standard basis `std_basis R φ i b j`... |
fa4b182607b2d6fe6e99002959dc53227df102cc | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/1029.lean | 0b3a6245a947177e9a42fc48b23e402f0c19d5be | [
"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 | 52 | lean | inductive Foo : Type
| mk : 0 = 1 → Foo → Foo
|
28f4673de9247f3d80a05572d5d886f3b3da45bb | aa2345b30d710f7e75f13157a35845ee6d48c017 | /analysis/measure_theory/outer_measure.lean | b11b82e2b61c57fc6737f4461313bfbd7226bae8 | [
"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 | 18,128 | 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
Outer measures -- overapproximations of measures
-/
import order.galois_connection algebra.big_operators algebra.module
analysis.ennreal analysi... |
7042192a0060d6b4a8d8b38d16a6224c4c3a60c6 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/algebraic_topology/dold_kan/decomposition.lean | 1d89283129af6835d3774e1aaae1c14c97f0f39f | [
"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 | 5,522 | lean | /-
Copyright (c) 2022 Joël Riou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Joël Riou
-/
import algebraic_topology.dold_kan.p_infty
/-!
# Decomposition of the Q endomorphisms
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corres... |
c6608e68f2dad21bf605d198079978d63217fc22 | 367134ba5a65885e863bdc4507601606690974c1 | /src/number_theory/bernoulli.lean | 194177166fa94acd0a254ab1dc61e1dbe5bc24e5 | [
"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 | 13,230 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Kevin Buzzard
-/
import data.rat
import data.fintype.card
import algebra.big_operators.nat_antidiagonal
import ring_theory.power_series.well_known
/-!
# Bernoulli numb... |
08aadfbc0fd6bb6ffa419c9498726b2cc566cf12 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/linear_algebra/smodeq.lean | 1a2183a8deebf5ebccf74e8cdad108e79fbdf97f | [] | 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 | 3,516 | lean | /-
Copyright (c) 2020 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.linear_algebra.basic
import Mathlib.PostPort
universes u_1 u_2 u_3
namespace Mathlib
/-!
# modula... |
77e7b1d0a7ac16e0e5540d3f790b54f367063cac | fecda8e6b848337561d6467a1e30cf23176d6ad0 | /src/data/nat/basic.lean | c73c321aeeda49aad30979efb7af15b750b3dad3 | [
"Apache-2.0"
] | permissive | spolu/mathlib | bacf18c3d2a561d00ecdc9413187729dd1f705ed | 480c92cdfe1cf3c2d083abded87e82162e8814f4 | refs/heads/master | 1,671,684,094,325 | 1,600,736,045,000 | 1,600,736,045,000 | 297,564,749 | 1 | 0 | null | 1,600,758,368,000 | 1,600,758,367,000 | null | UTF-8 | Lean | false | false | 61,028 | lean | /-
Copyright (c) 2014 Floris van Doorn (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Leonardo de Moura, Jeremy Avigad, Mario Carneiro
-/
import algebra.group_power.basic
import algebra.order_functions
/-!
# Basic oper... |
51159470ba21cf4b042706ba8f368efe6aedc587 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/analysis/calculus/implicit_auto.lean | 6184e4491f075b6182e9231639adc4eba30341ee | [] | 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 | 30,362 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.analysis.calculus.inverse
import Mathlib.analysis.normed_space.complemented
import Mathl... |
b3b2fa2ebc2b56d54c36961a29cb1cb3ab300cbb | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/ring_theory/eisenstein_criterion.lean | 5ee839d30dc376e3f20017a7a53d364a50dd6a08 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 5,587 | lean | /-
Copyright (c) 2020 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import data.nat.cast.with_top
import ring_theory.prime
import ring_theory.polynomial.content
/-!
# Eisenstein's criterion
A proof of a slight generalisation of Eisenstei... |
6eff0656c24908d7443d11815f155931cd82bdea | 3af272061d36e7f3f0521cceaa3a847ed4e03af9 | /src/upper_half_space.lean | 3dd8c910453d4993febc7d06ad557c3fc381be50 | [] | no_license | semorrison/kbb | fdab0929d21dca880d835081814225a95f946187 | 229bd06e840bc7a7438b8fee6802a4f8024419e3 | refs/heads/master | 1,585,351,834,355 | 1,539,848,241,000 | 1,539,848,241,000 | 147,323,315 | 2 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 3,211 | lean | import data.complex.basic
import .modular_group
import tactic.linarith
import .determinants
import group_theory.group_action
open complex
def upper_half_space := {z : ℂ | z.im > 0}
local notation `ℍ` := upper_half_space
local notation `Mat` := integral_matrices_with_determinant
instance upper_half_space.to_complex :... |
b9229ad54926facd08fd02d5837f805c42de045f | 97f752b44fd85ec3f635078a2dd125ddae7a82b6 | /library/theories/analysis/metric_space.lean | 3b5be5b4c993cbaf886854db05aa07895afb2648 | [
"Apache-2.0"
] | permissive | tectronics/lean | ab977ba6be0fcd46047ddbb3c8e16e7c26710701 | f38af35e0616f89c6e9d7e3eb1d48e47ee666efe | refs/heads/master | 1,532,358,526,384 | 1,456,276,623,000 | 1,456,276,623,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 27,595 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad
Metric spaces.
-/
import data.real.complete data.pnat data.list.sort ..topology.basic data.set
open nat real eq.ops classical
structure metric_space [class] (M : Type) : ... |
b91a2260c5a3cce1454bf7c396ecc2fd0b4a6852 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/sanitizeMacroScopes.lean | b3735f0351587bff7733a9d422172445c3169f2e | [
"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 | 100 | lean |
macro "m" x:term : term => `(fun x => $x)
set_option trace.Elab.step true in
#check fun x => m x
|
4f9a3094f73d489bc8df7fbde24a73cdd85b9665 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/lcnfCastIssue.lean | cdef50c3b1d085dcfa72675113c78c997db7b0b8 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 1,005 | lean | 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
inductive Unit : Type u
| star : Unit
attribute [eliminator] Unit.casesOn
notation "𝟏" => Unit
notation "★" => Unit.star
notation "ℕ" => Nat
... |
7ac898732d248a0f320ff9ccf6a190ac84fc444e | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Util.lean | 24f282e8312c7afc6ff5b8dfb34eda8844c4955f | [
"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 | 796 | 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.CollectFVars
import Lean.Util.CollectLevelParams
import Lean.Util.CollectMVars
import Lean.Util.FindMVar
import Lean.Util.FindLevelMVar
imp... |
b2b4a5bf72f17917ccd8d20f3ef10b91e279f813 | 0dbd5f7001f62ee8d54ed48bada66bfeaf55e550 | /src/ent/parity.lean | 846980b21ff85d59d0a6a0183e47dadd539ca8c8 | [] | no_license | rwbarton/lean-elementary-number-theory | 667203b08501792eef48217759539f6c1e2da25a | fabef0737fd2486e3f24f9e04652db4c182d5425 | refs/heads/master | 1,670,605,651,029 | 1,599,565,470,000 | 1,599,565,470,000 | 293,792,043 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,309 | lean | /- Even and odd natural numbers. -/
import data.nat.modeq
import ent.basic
import ent.modeq
import ent.xor
namespace nat
-- * Definition
def even (a : ℕ) := a ≡ 0 [MOD 2]
def odd (a : ℕ) := a ≡ 1 [MOD 2]
instance decidable_even {a : ℕ} : decidable (even a) :=
by unfold even; apply_instance
instance decidable_odd... |
5fb397953bed0bd9dc3b13ffc99577f5f6bb126a | 94e33a31faa76775069b071adea97e86e218a8ee | /src/topology/metric_space/metrizable_uniformity.lean | a3341cadb79b0787a61644618b90ba6a67d34ecd | [
"Apache-2.0"
] | permissive | urkud/mathlib | eab80095e1b9f1513bfb7f25b4fa82fa4fd02989 | 6379d39e6b5b279df9715f8011369a301b634e41 | refs/heads/master | 1,658,425,342,662 | 1,658,078,703,000 | 1,658,078,703,000 | 186,910,338 | 0 | 0 | Apache-2.0 | 1,568,512,083,000 | 1,557,958,709,000 | Lean | UTF-8 | Lean | false | false | 14,416 | 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 topology.metric_space.metrizable
/-!
# Metrizable uniform spaces
In this file we prove that a uniform space with countably generated uniformity filter is
p... |
c38ee7eab5e47bdc2f43bb08bd626ed2588383c7 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/category_theory/adjunction/opposites.lean | e5c6476be72a8cbeb47e49751cadcf75587ff782 | [
"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 | 10,772 | lean | /-
Copyright (c) 2020 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta, Thomas Read, Andrew Yang
-/
import category_theory.adjunction.basic
import category_theory.yoneda
import category_theory.opposites
/-!
# Opposite adjunctions
This file c... |
1e60d046e728d63a691fda16743885a7de2ebcdb | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/logic/function/conjugate.lean | 086f938f04f42fac2b6fd82741fbfdb122938d22 | [] | 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 | 5,521 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Yury Kudryashov
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.logic.function.basic
import Mathlib.PostPort
universes u_1 u_2 u_3
namespace Mathlib
/... |
e0f9cef3a0a8090f5174b469d03f7ef5b9eedda7 | 36c7a18fd72e5b57229bd8ba36493daf536a19ce | /tests/lean/run/blast_cc7.lean | 5c731fcfd2a87f1760b00f66b966e5e716dbbf4d | [
"Apache-2.0"
] | permissive | YHVHvx/lean | 732bf0fb7a298cd7fe0f15d82f8e248c11db49e9 | 038369533e0136dd395dc252084d3c1853accbf2 | refs/heads/master | 1,610,701,080,210 | 1,449,128,595,000 | 1,449,128,595,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 617 | lean | set_option blast.init_depth 10
set_option blast.inc_depth 1000
set_option blast.subst false
set_option blast.simp false
example (a b c d : Prop)
[d₁ : decidable a] [d₂ : decidable b] [d₃ : decidable c] [d₄ : decidable d]
: (a ↔ b) → (c ↔ d) → ((if (a ∧ c) then true else false) ↔ (if (b ∧ d) then true else fal... |
67066897819d2e46b7cd4962bf8f5b016e9acade | 4727251e0cd73359b15b664c3170e5d754078599 | /test/library_search/ordered_ring.lean | db8005ccb40054a63aec285790da3d2666bc9e66 | [
"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 | 460 | 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 tactic.basic
import data.nat.basic
import algebra.order.ring
/- Turn off trace messages so they don't pollute the test build: -/
set_option trace.silence_libr... |
2ec97fe9c52686893984e5c41e33051fe426f5c8 | ce89339993655da64b6ccb555c837ce6c10f9ef4 | /zeptometer/tactics-ex3.6.lean | 748a3b835b9564e1bf62e8adf37c43a5590dac8d | [] | no_license | zeptometer/LearnLean | ef32dc36a22119f18d843f548d0bb42f907bff5d | bb84d5dbe521127ba134d4dbf9559b294a80b9f7 | refs/heads/master | 1,625,710,824,322 | 1,601,382,570,000 | 1,601,382,570,000 | 195,228,870 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,964 | lean | open classical
variables p q r s : Prop
-- commutativity of ∧ and ∨
example : p ∧ q ↔ q ∧ p := begin
apply iff.intro,
intro h,
split,
apply and.right,
exact h,
apply and.left,
exact h,
intro h,
split,
apply and.right,
exact h,
apply and.left,
... |
9c33d79f86181cb1eda1afa5fd9da79c6b770b1f | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/nat/factorization/prime_pow.lean | ab2df778bbb158e82d2e8945f92620d1bfaee8eb | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 6,536 | lean | /-
Copyright (c) 2022 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta
-/
import algebra.is_prime_pow
import data.nat.factorization.basic
/-!
# Prime powers and factorizations
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this f... |
a6f4ec849edef7f9138d934f070eb20f6f1a5fce | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/category_theory/endofunctor/algebra.lean | deb460a14c73dc3f4e0689ff7fb2cae0b30919fc | [
"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 | 16,944 | lean | /-
Copyright (c) 2022 Joseph Hua. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Bhavik Mehta, Johan Commelin, Reid Barton, Rob Lewis, Joseph Hua
-/
import category_theory.limits.final
import category_theory.functor.reflects_isomorphisms
/-!
# Algebra... |
c4a6e6d2a1b8d743c0ce149b25624eecae54cb48 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tests/lean/run/autoboundIssues.lean | 2c2579a600a5cf5c700238c75a390368704f5a29 | [
"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 | 250 | lean | example : n.succ = 1 → n = 0 := by
intros h; injection h; assumption
example (h : n.succ = 1) : n = 0 := by
injection h; assumption
constant T : Type
constant T.Pred : T → T → Prop
example {ρ} (hρ : ρ.Pred σ) : T.Pred ρ ρ := sorry
|
069255189fefd0a4c7baba5b7953ad423278e0e5 | ed9ca7f44f366ca3a04272f939b2275961f36c59 | /src/for_mathlib/cardinal.lean | 0c7e8ecc6b52598d20c2f9da7cf513382441d6b7 | [
"Apache-2.0"
] | permissive | wh941231/lean-perfectoid-spaces | e88fb5d76746009242349f276cd0920285d8beb9 | 43954f64ce4afdf4fa39e2aeef8ec43826b24f2a | refs/heads/master | 1,653,641,928,775 | 1,588,499,720,000 | 1,588,499,720,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 323 | lean | import set_theory.cardinal
lemma cardinal.eq_one_iff_nonempty_subsingleton {α : Type*} :
cardinal.mk α = 1 ↔ (nonempty α ∧ subsingleton α) :=
by rw [← cardinal.ne_zero_iff_nonempty, ← cardinal.le_one_iff_subsingleton,
eq_iff_le_not_lt, ← cardinal.succ_zero, cardinal.lt_succ, cardinal.le_zero, and_comm]
|
d4e00d718c219f201c6f002782e4390201bd01a2 | a4673261e60b025e2c8c825dfa4ab9108246c32e | /stage0/src/Init/System/IOError.lean | f94573736c5df03a094fe844fecc7d631cb2f416 | [
"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 | 8,695 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
-/
prelude
import Init.Core
import Init.Data.UInt
import Init.Data.ToString.Basic
import Init.Data.String.Basic
/-
Imitate the structure of IOErrorType in Haskell:... |
e1731f4c0404c12c96c65fe61cfc6ae2d86b7dfd | 4fa161becb8ce7378a709f5992a594764699e268 | /src/topology/uniform_space/completion.lean | e5a6f4e7cd30208cd20eb836116ffc80e63775f8 | [
"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 | 23,200 | lean | /-
Copyright (c) 2018 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Johannes Hölzl
Hausdorff completions of uniform spaces.
The goal is to construct a left-adjoint to the inclusion of complete Hausdorff uniform spaces
into all uniform... |
7a5c88675ab3c2541d2f2f691b9227dee42ea344 | 842b7df4a999c5c50bbd215b8617dd705e43c2e1 | /nat_num_game/src/Advanced_Proposition_World/adv_prop_wrld3.lean | 87ae92c38a724a8733663d1ca09d3e9774f98760 | [] | no_license | Samyak-Surti/LeanCode | 1c245631f74b00057d20483c8ac75916e8643b14 | 944eac3e5f43e2614ed246083b97fbdf24181d83 | refs/heads/master | 1,669,023,730,828 | 1,595,534,784,000 | 1,595,534,784,000 | 282,037,186 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 184 | lean | lemma and_trans (P Q R : Prop) : P ∧ Q → Q ∧ R → P ∧ R :=
begin
intro f,
cases f with p q,
intro h,
cases h with q r,
split,
exact p,
exact r,
end |
6e6baa4ee84be0dc72feb7490c02f7d6311ff9d4 | ea4aee6b11f86433e69bb5e50d0259e056d0ae61 | /src/tidy/if_then_else.lean | 3d0a3a0e03fcacdc66b538c6eca4e866cb874eeb | [] | no_license | timjb/lean-tidy | e18feff0b7f0aad08c614fb4d34aaf527bf21e20 | e767e259bf76c69edfd4ab8af1b76e6f1ed67f48 | refs/heads/master | 1,624,861,693,182 | 1,504,411,006,000 | 1,504,411,006,000 | 103,740,824 | 0 | 0 | null | 1,505,553,968,000 | 1,505,553,968,000 | null | UTF-8 | Lean | false | false | 626 | lean | -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Scott Morrison
open tactic
meta def if_then_else { α β : Type } { m : Type → Type } [monad m] [has_orelse m] ( i : m α ) ( t e : m β ) : m β :=
do r ← (i >> pure tt) <|> pure f... |
d3f8ea1a7adca7247a2b0f27916eb9d3816087f4 | b70031c8e2c5337b91d7e70f1e0c5f528f7b0e77 | /src/order/complete_lattice.lean | f5140f38435149d5084f2cf5a88fc4aa1e42cbee | [
"Apache-2.0"
] | permissive | molodiuc/mathlib | cae2ba3ef1601c1f42ca0b625c79b061b63fef5b | 98ebe5a6739fbe254f9ee9d401882d4388f91035 | refs/heads/master | 1,674,237,127,059 | 1,606,353,533,000 | 1,606,353,533,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 38,759 | 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 order.bounds
/-!
# Theory of complete lattices
## Main definitions
* `Sup` and `Inf` are the supremum and the infimum of a set;
* `supr (f : ι → α)` and `in... |
e8275d250033e7875cbb98bb7b5520d87160d531 | 1901b51268d21ec7361af7d3534abd9a8fa5cf52 | /src/graph_theory/product.lean | 12bbbe7dbd58a9914a21a44ea95ca0f1e6cfe57a | [] | no_license | vbeffara/lean | b9ea4107deeaca6f4da98e5de029b62e4861ab40 | 0004b1d502ac3f4ccd213dbd23589d4c4f9fece8 | refs/heads/main | 1,652,050,034,756 | 1,651,610,858,000 | 1,651,610,858,000 | 225,244,535 | 6 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 1,146 | lean | import combinatorics.simple_graph.basic
import graph_theory.to_mathlib
open prod
variables {V V₁ V₂ V' : Type*} {G₁ : simple_graph V₁} {G₂ : simple_graph V₂}
namespace simple_graph
def tensor_product (G₁ : simple_graph V₁) (G₂ : simple_graph V₂) : simple_graph (V₁ × V₂) :=
{ adj := (G₁.adj on fst) ⊓ (G₂.adj on snd),... |
4555a954554706f10cd61e9611a17402907430fb | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/algebra/euclidean_domain.lean | 06aa37c5113dde65b7cca01a304b9a552f09b455 | [
"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 | 13,703 | lean | /-
Copyright (c) 2018 Louis Carlin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Louis Carlin, Mario Carneiro
Euclidean domains and Euclidean algorithm (extended to come)
A lot is based on pre-existing code in mathlib for natural number gcds
-/
import data.int.basic... |
46fdf5f6daa9f549a3313d193f992a66d866ade6 | f3849be5d845a1cb97680f0bbbe03b85518312f0 | /library/init/data/option/basic.lean | ee6826880c42e404da9321bbec36066ed72b61be | [
"Apache-2.0"
] | permissive | bjoeris/lean | 0ed95125d762b17bfcb54dad1f9721f953f92eeb | 4e496b78d5e73545fa4f9a807155113d8e6b0561 | refs/heads/master | 1,611,251,218,281 | 1,495,337,658,000 | 1,495,337,658,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,398 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.logic init.category.monad init.category.alternative
open decidable
universes u v
namespace option
def to_monad {m : Type → Type} [mon... |
ef0d8dda25fab3df0a2ab21a60afe064c694d5d4 | 649957717d58c43b5d8d200da34bf374293fe739 | /src/linear_algebra/tensor_product.lean | 45cab24f8ba14e1782aeb731f682cf59c0513d4f | [
"Apache-2.0"
] | permissive | Vtec234/mathlib | b50c7b21edea438df7497e5ed6a45f61527f0370 | fb1848bbbfce46152f58e219dc0712f3289d2b20 | refs/heads/master | 1,592,463,095,113 | 1,562,737,749,000 | 1,562,737,749,000 | 196,202,858 | 0 | 0 | Apache-2.0 | 1,562,762,338,000 | 1,562,762,337,000 | null | UTF-8 | Lean | false | false | 15,486 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Mario Carneiro
Tensor product of modules over commutative rings.
-/
import group_theory.free_abelian_group
import linear_algebra.direct_sum_module
variables {R : Type*} [comm... |
2dc4e6c1a394b973384b9b7a644d790a07791d85 | 07c76fbd96ea1786cc6392fa834be62643cea420 | /tests/lean/hott/615.hlean | cb39984e142a1d1a6935ac1abb88edf328fd5f2c | [
"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 | 489 | hlean | -- HoTT
import homotopy.circle
open circle eq int pi
attribute circle.rec circle.elim [recursor 4]
protected definition my_code (x : circle) : Type₀ :=
begin
induction x,
{ exact ℤ},
{ apply ua, apply equiv_succ}
end
protected definition my_decode {x : circle} : my_code x → base = x :=
begin
induction x,... |
de5981e350f5d7676238155381c022a1c96056fe | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/run/t9.lean | 5d0b77409bb85fb14dee0cdce1f3d72853ae570d | [
"Apache-2.0"
] | permissive | soonhokong/lean-osx | 4a954262c780e404c1369d6c06516161d07fcb40 | 3670278342d2f4faa49d95b46d86642d7875b47c | refs/heads/master | 1,611,410,334,552 | 1,474,425,686,000 | 1,474,425,686,000 | 12,043,103 | 5 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 606 | lean | prelude
definition bool : Type.{1} := Type.{0}
definition and (p q : bool) : bool
:= ∀ c : bool, (p → q → c) → c
infixl `∧`:25 := and
theorem and_intro (p q : bool) (H1 : p) (H2 : q) : p ∧ q
:= λ (c : bool) (H : p → q → c), H H1 H2
theorem and_elim_left (p q : bool) (H : p ∧ q) : p
:= H p (λ (H1 : p) (H2 : q), H1)
the... |
2802a58af85aa660da8205c8f97605bced42a747 | d642a6b1261b2cbe691e53561ac777b924751b63 | /src/measure_theory/measure_space.lean | 3962b9ff92b8280de26b583e682d41666f23ce4c | [
"Apache-2.0"
] | permissive | cipher1024/mathlib | fee56b9954e969721715e45fea8bcb95f9dc03fe | d077887141000fefa5a264e30fa57520e9f03522 | refs/heads/master | 1,651,806,490,504 | 1,573,508,694,000 | 1,573,508,694,000 | 107,216,176 | 0 | 0 | Apache-2.0 | 1,647,363,136,000 | 1,508,213,014,000 | Lean | UTF-8 | Lean | false | false | 35,547 | 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
Measure spaces -- measures
Measures are restricted to a measurable space (associated by the type class `measurable_space`).
This allows us to prove equ... |
0ba86b20fc9a21205c7666f498fbcffa92f16b71 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/struct_bug1.lean | b2316a988ca796b8a4e2488c2bdfc4dd806b034a | [
"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 | 194 | lean | variable (A : Type)
structure foo (a : A) :=
(eqpr : a = a)
section
parameter (B : Type)
structure foo2 (b : B) :=
(eqpr : b = b)
check foo2
definition tst : B → Type₁ := foo2
end
|
adaf305617c127ad551533a9d41c65df69d470e3 | 570f46c4bf91dd2d8b97fc9d43ce1c435867f7dc | /src/solutions/02_iff_if_and.lean | 6c09bd84e25232126a66a40dcaf0e630458394eb | [
"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 | 15,509 | lean | import data.real.basic
/-
In the previous file, we saw how to rewrite using equalities.
The analogue operation with mathematical statements is rewriting using
equivalences. This is also done using the `rw` tactic.
Lean uses ↔ to denote equivalence instead of ⇔.
In the following exercises we will use the lemma:
su... |
e31da9e46da00a831451d053ff4f5c4ad3552e17 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/order/well_founded_set.lean | 7aa880fb19d84a3953d2b86a43661752a86fa8a6 | [
"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 | 34,534 | lean | /-
Copyright (c) 2021 Aaron Anderson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson
-/
import algebra.pointwise
import order.antichain
import order.order_iso_nat
import order.well_founded
/-!
# Well-founded sets
A well-founded subset of an ordered typ... |
395489076d213d8a259cadb33de6eb607d603e73 | 367134ba5a65885e863bdc4507601606690974c1 | /src/category_theory/monoidal/internal/types.lean | dd3116cbc520b85f95bcd5e7a2a4ffc540078ff3 | [
"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 | 4,563 | 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 algebra.category.Mon.basic
import category_theory.monoidal.CommMon_
import category_theory.monoidal.types
/-!
# `Mon_ (Type u) ≌ Mon.{u}`
The category of int... |
7e65dc3b3b79f6c57c25ae9c2b2018b9dff1ed1c | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/pkg/user_attr_app/Main.lean | bdf86de03c0730324db79094532e2458668accd9 | [
"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 | 375 | lean | import UserAttr.Tst
open Lean
def tst : MetaM Unit := do
let env ← getEnv
assert! (blaAttr.hasTag env `f)
assert! (blaAttr.hasTag env `g)
assert! !(blaAttr.hasTag env `id)
pure ()
#eval tst
unsafe def main : IO Unit := do
initSearchPath (← Lean.findSysroot) ["build/lib"]
withImportModules [{ module :=... |
10641c644b53424acce0b6c2dcae21acc1a314cb | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/analysis/analytic/composition.lean | 2c07461779db9c9501dafdd21c79e8597b436c0e | [
"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 | 58,661 | 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, Johan Commelin
-/
import analysis.analytic.basic
import combinatorics.composition
/-!
# Composition of analytic functions
in this file we prove that the composi... |
9fdbe9f66679b55bdff7718eed15c8e1182d6506 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/over2.lean | f0f924845d44345b1094041a18231942715d6fa3 | [
"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 | 166 | lean | import data.nat
open nat
namespace N1
definition foo (a : nat) := a
end N1
namespace N2
definition foo (a : nat) := a
end N2
open N1 N2
definition boo := foo
|
30311e6944908b7bf22a059c16fe36f66a6ba1e0 | 9028d228ac200bbefe3a711342514dd4e4458bff | /src/topology/instances/nnreal.lean | a3a60f534f880094fb358934c2f8054d74db29cb | [
"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 | 3,512 | 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 topology.algebra.infinite_sum
noncomputable theory
open set topological_space metric
open_locale topological_space
namespace nnreal... |
046ef712dda09e5ff61c10833cffc2604a1a0323 | 618003631150032a5676f229d13a079ac875ff77 | /test/norm_num.lean | b3c297f34b3e1d96c6a9f2053c6137511d77ae46 | [
"Apache-2.0"
] | permissive | awainverse/mathlib | 939b68c8486df66cfda64d327ad3d9165248c777 | ea76bd8f3ca0a8bf0a166a06a475b10663dec44a | refs/heads/master | 1,659,592,962,036 | 1,590,987,592,000 | 1,590,987,592,000 | 268,436,019 | 1 | 0 | Apache-2.0 | 1,590,990,500,000 | 1,590,990,500,000 | null | UTF-8 | Lean | false | false | 11,977 | 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
Tests for norm_num
-/
import tactic.norm_num
import data.complex.basic
-- constant real : Type
-- notation `ℝ` := real
-- @[instance] constant real.linear_or... |
f426b15fcc29dc2ebc86f0f7b7af470efd668c1d | bb31430994044506fa42fd667e2d556327e18dfe | /src/measure_theory/measure/vector_measure.lean | ea7e57ae0726c47ab46db92576810e65e2f0cce0 | [
"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 | 50,117 | lean | /-
Copyright (c) 2021 Kexing Ying. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kexing Ying
-/
import measure_theory.measure.measure_space
import analysis.complex.basic
/-!
# Vector valued measures
This file defines vector valued measures, which are σ-additive fun... |
cf01c4af3aa5d2ed457b871e0ca1c0f319b92acc | 6e41ee3ac9b96e8980a16295cc21f131e731884f | /tests/lean/interactive/eq2.lean | 2e6b672b873db984460a9b618886645009342043 | [
"Apache-2.0"
] | permissive | EgbertRijke/lean | 3426cfa0e5b3d35d12fc3fd7318b35574cb67dc3 | 4f2e0c6d7fc9274d953cfa1c37ab2f3e799ab183 | refs/heads/master | 1,610,834,871,476 | 1,422,159,801,000 | 1,422,159,801,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,223 | lean | -- Copyright (c) 2014 Microsoft Corporation. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Leonardo de Moura, Jeremy Avigad, Floris van Doorn
-- logic.connectives.eq
-- ====================
-- Equality.
import logic.prop
-- eq
-- --
inductive eq {A : Type} ... |
9d82473f22f8700f4161c07bae06fafba752979b | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/1930.lean | 9aea0beecc91baac371bf6611b309ce198a3876d | [
"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 | 56 | lean | structure S := (f : ℕ)
def F : S := { f := prod.1 }
|
afbeb4712c50df2ba92df4eb2fee7276e9d671e8 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/ack.lean | f7ad2ad94d598c260f99e9f1318ca202b80b8430 | [
"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 | 510 | lean | import data.nat.basic
open nat
definition iter (f : nat → nat) (n : nat) : nat :=
nat.rec_on n
(f 1)
(λ (n₁ : nat) (r : nat), f r)
definition ack (m : nat) : nat → nat :=
nat.rec_on m
nat.succ
(λ (m₁ : nat) (r : nat → nat), iter r)
theorem ack_0_n (n : nat) : ack 0 n = n + 1 :=
rfl
theorem ack_m_0 (m : nat)... |
b30a1676ca26155b183dae125be021fbe079e0a1 | f5373ccdc976e6390397d9f4220a74c76f706f4a | /src/tools/dumb_json.lean | 8b0bb891b8e10f115ca5dab0135bb0eb6f281918 | [] | no_license | jasonrute/lean_gym_prototype | fcd91fdc454f9e351bbe258c765f50276407547e | ab29624d14e4e069e15afe0b1d90248b5b394b86 | refs/heads/master | 1,682,628,526,780 | 1,590,539,315,000 | 1,590,539,315,000 | 264,938,525 | 3 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,980 | lean | import tools.json
import system.io
namespace dumb_json
/- β is the output type and α is the internal type passed between loops (such as a counter)
If f returns sum.inl a it loops again using a.
If f returns sum.inr b it exists the loop and returns b -/
meta def io.better_iterate {e α β : Type} (a : α) (f : α → io ... |
f0d0512501c46e188867ddecf74a1157362b74c7 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /src/Lean/Elab/Inductive.lean | eecaa6c14780c40ac3cd2225daf2806352ccc8b5 | [
"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 | 40,171 | 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.ReplaceLevel
import Lean.Util.ReplaceExpr
import Lean.Util.CollectLevelParams
import Lean.Meta.Constructions
import Lean.Meta.CollectFVars
... |
e72e099c5536f75b1252caebb772c2c429b6fa93 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/monoidal/coherence.lean | 33035d50beba4e10c3a6d92b7017d65f29e84568 | [
"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 | 14,384 | lean | /-
Copyright (c) 2022. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Yuma Mizuno, Oleksandr Manzyuk
-/
import category_theory.monoidal.free.coherence
import category_theory.bicategory.coherence_tactic
/-!
# A `coherence` tactic for monoidal categories... |
10844b85cb4a92594fc9541b157493bf878ac5cb | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/ring_theory/witt_vector/compare.lean | abd951dd0259bea67cb1f8750864be9799dd3c7a | [] | 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,075 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Robert Y. Lewis
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.ring_theory.witt_vector.truncated
import Mathlib.ring_theory.witt_vector.i... |
a1b006e1cedaee9c8659f406b814d35b5313ef6f | 02005f45e00c7ecf2c8ca5db60251bd1e9c860b5 | /src/analysis/specific_limits.lean | 33c63f0eb83153c5662bb2fe52a0a0def70008e3 | [
"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 | 34,725 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
-/
import algebra.geom_sum
import order.filter.archimedean
import order.iterate
import topology.instances.ennreal
import tactic.ring_exp
import analysis.asymptotics.asym... |
43acc1e46d8a8f43af8df836f4fc63f58d8b8f2c | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /library/init/default.lean | df9b1fc5f96dcd3bd8e293782bd16781c9d52978 | [
"Apache-2.0"
] | permissive | soonhokong/lean-osx | 4a954262c780e404c1369d6c06516161d07fcb40 | 3670278342d2f4faa49d95b46d86642d7875b47c | refs/heads/master | 1,611,410,334,552 | 1,474,425,686,000 | 1,474,425,686,000 | 12,043,103 | 5 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 735 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.datatypes init.logic
import init.relation init.nat init.prod init.sum init.combinator
import init.bool init.unit init.num init.sigma ini... |
8eddec6b4529528bb4372d5e51d4ad1d82941880 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/ring_theory/finiteness.lean | 770b1bb947c6e02e93ec734106d213ecc324008e | [
"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 | 25,885 | 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 algebra.algebra.restrict_scalars
import algebra.algebra.subalgebra.basic
import group_theory.finiteness
import ring_theory.ideal.operations
/-!
# Finiteness ... |
3df9445891efbb4032fe677e39b4a8897ba5ed36 | e30ff3aabdac29f8ea40ad76887544d0f9be9018 | /sample-bot.lean | 5ed13e766745abf07567a966976bbfb4c2c3fda5 | [] | no_license | forked-from-1kasper/leanbot | bdef0efa3e4d0eb75b06c1707fb4e35086bb57fa | c61c8c7fdad7b05877e0d232719ce23d2999557f | refs/heads/master | 1,651,846,081,986 | 1,646,404,009,000 | 1,646,404,009,000 | 127,132,795 | 12 | 1 | null | 1,605,183,650,000 | 1,522,237,998,000 | Lean | UTF-8 | Lean | false | false | 1,228 | lean | import data.buffer.parser
import ircbot ircbot.base64
import ircbot.modules
open types effects support parsing login
open parser
-- constants
def server : string := "chat.freenode.net"
def port : string := "6667"
def ident : string := "lean"
def bot_nickname : string := "leanbot-test"
-- end
theorem bot_nickname_is... |
5f8d94dcc00c781a16da597950d011cb94efe1dc | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /hott/types/arrow.hlean | 03e935002a7a514d82ce5795e3c5a85e0e88ea63 | [
"Apache-2.0"
] | permissive | chubbymaggie/lean | 0d06ae25f9dd396306fb02190e89422ea94afd7b | d2c7b5c31928c98f545b16420d37842c43b4ae9a | refs/heads/master | 1,611,313,622,901 | 1,430,266,839,000 | 1,430,267,083,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,492 | hlean | /-
Copyright (c) 2014 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: types.arrow
Author: Floris van Doorn
Ported from Coq HoTT
Theorems about arrow types (function spaces)
-/
import types.pi
open eq equiv is_equiv funext pi equiv.ops
namespace arr... |
2c3a336b3df5b3d7b24cca5e5a9953f50382d3b7 | fecda8e6b848337561d6467a1e30cf23176d6ad0 | /src/topology/path_connected.lean | 2c439c38bf2fe3d77640beecbc78141b669f33ef | [
"Apache-2.0"
] | permissive | spolu/mathlib | bacf18c3d2a561d00ecdc9413187729dd1f705ed | 480c92cdfe1cf3c2d083abded87e82162e8814f4 | refs/heads/master | 1,671,684,094,325 | 1,600,736,045,000 | 1,600,736,045,000 | 297,564,749 | 1 | 0 | null | 1,600,758,368,000 | 1,600,758,367,000 | null | UTF-8 | Lean | false | false | 35,893 | lean | /-
Copyright (c) 2020 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot
-/
import topology.instances.real
/-!
# Path connectedness
## Main definitions
In the file the unit interval `[0, 1]` in `ℝ` is denoted by `I`, and `X` is a topologic... |
234f36767483636dccad64ea25fd9ab3f63f24cf | abbfc359cee49d3c5258b2bbedc2b4d306ec3bdf | /src/data/serial/derive.lean | c99e2eac54e83f81d0b7f6397bc9e0945ce871d1 | [] | no_license | cipher1024/serialean | 565b17241ba7edc4ee564bf0ae175dd15b06a28c | 47881e4a6bc0a62cd68520564610b75f8a4fef2c | refs/heads/master | 1,585,117,575,599 | 1,535,783,976,000 | 1,535,783,976,000 | 143,501,396 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,057 | lean |
import tactic.monotonicity
import data.serial.basic
import data.nat.serial
import tactic.serial
import tactic.norm_num
import tactic.basic
import category.basic
namespace tactic
open serial
open tactic
open tactic.interactive (unfold norm_num trivial simp ac_mono)
open interactive
meta def mk_up (u : level) (e : ex... |
46bddbe7a25824055c90cfdd65c6e1c3f7829bca | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/run/hinst_lemmas1.lean | d94d631e48b507a9db3ae0540d1755e3fc392843 | [
"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 | 309 | lean | run_cmd
do
tactic.trace "hinst_lemmas example:",
hs ← return $ hinst_lemmas.mk,
h₁ ← hinst_lemma.mk_from_decl `add_zero,
h₂ ← hinst_lemma.mk_from_decl `zero_add,
h₃ ← hinst_lemma.mk_from_decl `add_comm,
hs ← return $ ((hs^.add h₁)^.add h₂)^.add h₃,
hs^.pp >>= tactic.trace
|
793cd271910ef2f660e7c581232ffda0cecd69cf | 64874bd1010548c7f5a6e3e8902efa63baaff785 | /library/classical.lean | b06e00ec512bac4e233ccb51ec4a105c876c45a7 | [
"Apache-2.0"
] | permissive | tjiaqi/lean | 4634d729795c164664d10d093f3545287c76628f | d0ce4cf62f4246b0600c07e074d86e51f2195e30 | refs/heads/master | 1,622,323,796,480 | 1,422,643,069,000 | 1,422,643,069,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 258 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: classical
Author: Jeremy Avigad
The standard library together with the classical axioms.
-/
import standard logic.axioms
|
8ac114e2dbf41493bc029cf61fe74018cd5cc696 | de4548698671d50981659ecc9f4910de15969d3d | /Metamath/Translate.lean | b673dae96b822fdfffa7bbae4299fdae2562b7c8 | [] | no_license | digama0/mm-lean4 | 7ad17c81853816c6cd4bb97b8abe4bea0fd35ff6 | 6a427edecb851cec04818848a755c0145a5f2e98 | refs/heads/master | 1,688,934,520,262 | 1,687,937,043,000 | 1,687,937,043,000 | 365,257,017 | 15 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 23,060 | lean | -- WIP stuff. see Metamath.Verify for the verifier
import Std.Data.List.Lemmas
import Metamath.Verify
namespace Metamath
open Lean Elab
open Verify in
partial def foo : TermElabM Unit := do
let mut s : ParserState := Inhabited.default
s := s.withDB fun db => { db with interrupt := true }
let h ← IO.FS.Handle.mk... |
0cbefa5d3a12291e8448b1b05a8b89f7276e9898 | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /src/tactic/cache.lean | e5692b3c7235207e4c81f6607325395f782e5e7c | [
"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 | 5,532 | 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 tactic.doc_commands
/-!
# Instance cache tactics
For performance reasons, Lean does not automatically update its database
of class instances during a proof. T... |
62bd0778412fa475bfa4bfdd1d5d1ad59b49aee2 | ac2987d8c7832fb4a87edb6bee26141facbb6fa0 | /Mathlib/Tactic/Block.lean | af3a120324a5f4a0be8f6f9bda87a0dc1783fb8e | [
"Apache-2.0"
] | permissive | AurelienSaue/mathlib4 | 52204b9bd9d207c922fe0cf3397166728bb6c2e2 | 84271fe0875bafdaa88ac41f1b5a7c18151bd0d5 | refs/heads/master | 1,689,156,096,545 | 1,629,378,840,000 | 1,629,378,840,000 | 389,648,603 | 0 | 0 | Apache-2.0 | 1,627,307,284,000 | 1,627,307,284,000 | null | UTF-8 | Lean | false | false | 2,214 | lean | /-
Copyright (c) 2021 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
-/
import Mathlib.Tactic.OpenPrivate
import Lean
/-
This file adds support for a block structuring tactic. Blocks are started by an initial `-` and
all tactics in the sa... |
0071cdc2b59a05ec27476b6892d03a19f0c0ee68 | 9ad8d18fbe5f120c22b5e035bc240f711d2cbd7e | /src/combinatorics/fiber.lean | 7fa062e23b9df03a0cdf55be3c603b1ab88f9653 | [] | no_license | agusakov/lean_lib | c0e9cc29fc7d2518004e224376adeb5e69b5cc1a | f88d162da2f990b87c4d34f5f46bbca2bbc5948e | refs/heads/master | 1,642,141,461,087 | 1,557,395,798,000 | 1,557,395,798,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,830 | lean | /-
Copyright (c) 2019 Neil Strickland. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Neil Strickland
-/
import data.fintype
import tactic.squeeze
namespace combinatorics
universes u v
variables {α : Type u} {β : Type v} (p : α → β)
variables [fintype α] [fintype ... |
742846d88788c0dea0c9bc5810345dbb2c3d8509 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /stage0/src/Lean/Log.lean | 0c8c3bf1d059a6f06d4ec7e752a9550c6acaf6fb | [
"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 | 4,555 | 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.Util.Sorry
namespace Lean
/--
The `MonadLog` interface for logging error messages.
-/
class MonadLog (m : Type → Type) extends MonadFileMap m ... |
b49f2b823db15bb2b9050a460bdd6c32c9e6b351 | 41ebf3cb010344adfa84907b3304db00e02db0a6 | /uexp/src/uexp/meta/SDP.lean | 04ff058c08fdb72cb7c4d7ac666fc150fbebb4e8 | [
"BSD-2-Clause"
] | permissive | ReinierKoops/Cosette | e061b2ba58b26f4eddf4cd052dcf7abd16dfe8fb | eb8dadd06ee05fe7b6b99de431dd7c4faef5cb29 | refs/heads/master | 1,686,483,953,198 | 1,624,293,498,000 | 1,624,293,498,000 | 378,997,885 | 0 | 0 | BSD-2-Clause | 1,624,293,485,000 | 1,624,293,484,000 | null | UTF-8 | Lean | false | false | 10,338 | lean | import ..sql ..u_semiring ..extra_constants
import .cosette_tactics .TDP
-- assume there is only sig inside squash
lemma sig2_distr_plus {s₁ s₂ : Schema} {f₁ f₂ : Tuple s₁ → Tuple s₂ → usr} :
(∑ t₁ t₂ , f₁ t₁ t₂ + f₂ t₁ t₂) = (∑ t₁ t₂ , f₁ t₁ t₂) + (∑ t₁ t₂, f₂ t₁ t₂) :=
begin
rw ← sig_distr_plus,
apply ... |
7524f855c5a41e89b39a4cbaf79964724d625169 | 618003631150032a5676f229d13a079ac875ff77 | /src/order/basic.lean | b1c627b4b9f75a3426c5d5835070c50c24c70d2b | [
"Apache-2.0"
] | permissive | awainverse/mathlib | 939b68c8486df66cfda64d327ad3d9165248c777 | ea76bd8f3ca0a8bf0a166a06a475b10663dec44a | refs/heads/master | 1,659,592,962,036 | 1,590,987,592,000 | 1,590,987,592,000 | 268,436,019 | 1 | 0 | Apache-2.0 | 1,590,990,500,000 | 1,590,990,500,000 | null | UTF-8 | Lean | false | false | 34,029 | 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.set.basic
open function
/-!
# Basic definitions about `≤` and `<`
## Definitions
### Predicates on functions
- `monotone f`: a function ... |
ba511c8a24ffe703f00f69258425d005f1b43a28 | fecda8e6b848337561d6467a1e30cf23176d6ad0 | /src/analysis/specific_limits.lean | 42abaa0d50383b54dd67de0d92a8bb8bc842f28b | [
"Apache-2.0"
] | permissive | spolu/mathlib | bacf18c3d2a561d00ecdc9413187729dd1f705ed | 480c92cdfe1cf3c2d083abded87e82162e8814f4 | refs/heads/master | 1,671,684,094,325 | 1,600,736,045,000 | 1,600,736,045,000 | 297,564,749 | 1 | 0 | null | 1,600,758,368,000 | 1,600,758,367,000 | null | UTF-8 | Lean | false | false | 30,145 | 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
A collection of specific limit computations.
-/
import analysis.normed_space.basic
import algebra.geom_sum
import topology.instances.ennreal
import tactic.ring_exp
non... |
18f66a6df4afce2e05624077647d8fd1c25abe87 | 9a0b1b3a653ea926b03d1495fef64da1d14b3174 | /tidy/rewrite_search/core/explain.lean | 17642b353b807cbf45981a7732c986fabed60232 | [
"Apache-2.0"
] | permissive | khoek/mathlib-tidy | 8623b27b4e04e7d598164e7eaf248610d58f768b | 866afa6ab597c47f1b72e8fe2b82b97fff5b980f | refs/heads/master | 1,585,598,975,772 | 1,538,659,544,000 | 1,538,659,544,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,349 | lean | import .types
open interactive interactive.types expr tactic
variables {α β γ δ : Type}
namespace tidy.rewrite_search
def how.to_tactic (rule_strings : list string) : how → option string
| (how.rewrite index s location) := some ("nth_rewrite" ++ (match s with | side.L := "_lhs" | side.R := "_rhs" end) ++ " " ++ to_... |
143da5fc425ba7dbd9f2579e34d213a81c0e2ca8 | 1437b3495ef9020d5413178aa33c0a625f15f15f | /analysis/topology/infinite_sum.lean | 70e60aa49df24380bd29e30b42750a25075d4161 | [
"Apache-2.0"
] | permissive | jean002/mathlib | c66bbb2d9fdc9c03ae07f869acac7ddbfce67a30 | dc6c38a765799c99c4d9c8d5207d9e6c9e0e2cfd | refs/heads/master | 1,587,027,806,375 | 1,547,306,358,000 | 1,547,306,358,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 21,225 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
Infinite sum over a topological monoid
This sum is known as unconditionally convergent, as it sums to the same value under all possible
permutations. For Euclidean spa... |
39de0cce57630ff79bbb411c9d1a9e4b937639f1 | e4a7c8ab8b68ca0e53d2c21397320ea590fa01c6 | /src/tactic/polya/field/main.lean | 8126bba25704e041478de53ea7fa948b1df16127 | [] | no_license | lean-forward/field | 3ff5dc5f43de40f35481b375f8c871cd0a07c766 | 7e2127ad485aec25e58a1b9c82a6bb74a599467a | refs/heads/master | 1,590,947,010,909 | 1,563,811,881,000 | 1,563,811,881,000 | 190,415,651 | 1 | 0 | null | 1,563,643,371,000 | 1,559,746,688,000 | Lean | UTF-8 | Lean | false | false | 7,961 | lean | import data.polya.field
namespace tactic
meta def pexpr_of_pos_num (α h_one h_add : expr) : pos_num → pexpr
| pos_num.one := ``(@has_one.one %%α %%h_one)
| (pos_num.bit0 n) := ``(@bit0 %%α %%h_add (%%(pexpr_of_pos_num n)))
| (pos_num.bit1 n) := ``(@bit1 %%α %%h_one %%h_add (%%(pexpr_of_pos_num n)))
meta def exp... |
c21e6c8615506951282b42a514231d91488cd55c | d5b53bc87e7f4dda87570c8ef6ee4b4de685f315 | /src/add_subgroup/basic.lean | fd8e048610b4d84c24977fd58a1058b77a6842f8 | [] | no_license | Shenyang1995/M4R | 3bec366fba7262ed29d7f64b4ba7cc978494c022 | a6a3399c4d1935b39a22f64c30f293ef2a32fdeb | refs/heads/master | 1,597,008,096,640 | 1,591,722,931,000 | 1,591,722,931,000 | 214,177,424 | 5 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,052 | lean | import algebra.group.hom group_theory.subgroup group_theory.quotient_group
structure add_subgroup (G : Type*) [add_group G] :=
(carrier : set G)
(is_add_subgroup : is_add_subgroup carrier)
namespace add_subgroup
variables (G : Type*) [add_group G]
instance foo (H : add_subgroup G) :
_root_.is_add_subgroup H.carr... |
0b352cc79967c9722cba537b29f78650a9695e5e | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/homology/single.lean | ca25cc2f960e9a7b516f565a3468d1be547e2059 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 12,335 | lean | /-
Copyright (c) 2021 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import algebra.homology.homology
/-!
# Chain complexes supported in a single degree
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a ... |
8a07204fbf942be9641b725068390f10561d3eb0 | 853df553b1d6ca524e3f0a79aedd32dde5d27ec3 | /src/measure_theory/simple_func_dense.lean | efd3265c06cf52c3db101113bcf6404b1d014e6b | [
"Apache-2.0"
] | permissive | DanielFabian/mathlib | efc3a50b5dde303c59eeb6353ef4c35a345d7112 | f520d07eba0c852e96fe26da71d85bf6d40fcc2a | refs/heads/master | 1,668,739,922,971 | 1,595,201,756,000 | 1,595,201,756,000 | 279,469,476 | 0 | 0 | null | 1,594,696,604,000 | 1,594,696,604,000 | null | UTF-8 | Lean | false | false | 14,882 | lean | /-
Copyright (c) 2019 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou
-/
import measure_theory.l1_space
/-!
# Density of simple functions
Show that each Borel measurable function can be approximated,
both pointwise and in `L¹` norm, by a s... |
f7e1160b455faa9676b55e26623b82def1344217 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/ring_theory/polynomial/cyclotomic_auto.lean | 242fb11b8bafd19335c34131e40c076cfc4501e6 | [] | 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 | 14,958 | lean | /-
Copyright (c) 2020 Riccardo Brasca. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Riccardo Brasca
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.field_theory.splitting_field
import Mathlib.ring_theory.roots_of_unity
import Mathlib.alge... |
566b8c5c0752fac8985897a6094dcb7ffb39e9cf | 853df553b1d6ca524e3f0a79aedd32dde5d27ec3 | /src/order/liminf_limsup.lean | 32a85f1b8ef42a59ff6df701023b6dc2a57fe9fc | [
"Apache-2.0"
] | permissive | DanielFabian/mathlib | efc3a50b5dde303c59eeb6353ef4c35a345d7112 | f520d07eba0c852e96fe26da71d85bf6d40fcc2a | refs/heads/master | 1,668,739,922,971 | 1,595,201,756,000 | 1,595,201,756,000 | 279,469,476 | 0 | 0 | null | 1,594,696,604,000 | 1,594,696,604,000 | null | UTF-8 | Lean | false | false | 19,883 | lean | /-
Copyright (c) 2018 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel, Johannes Hölzl
-/
import order.filter.partial
import order.filter.at_top_bot
/-!
# liminfs and limsups of functions and filters
Defines the Liminf/Limsup of a f... |
66fc11c62bf614f7100ef06684626951f2ae7b79 | fa01e273a2a9f22530e6adb1ed7d4f54bb15c8d7 | /src/N2O/Data/Default.lean | 5dee6e2efd5f3ca616dc68c07bf1a6bfc372e900 | [
"LicenseRef-scancode-mit-taylor-variant",
"LicenseRef-scancode-warranty-disclaimer"
] | permissive | o89/n2o | 4c99afb11fff0a1e3dae6b3bc8a3b7fc42c314ac | 58c1fbf4ef892ed86bdc6b78ec9ca5a403715c2d | refs/heads/master | 1,670,314,676,229 | 1,669,086,375,000 | 1,669,086,375,000 | 200,506,953 | 16 | 6 | null | null | null | null | UTF-8 | Lean | false | false | 129 | lean | import N2O.Data.BERT import N2O.Data.Bytes import N2O.Data.Parser
import N2O.Data.Put import N2O.Data.Sum import N2O.Data.Vector
|
67ee4487a2aff5f550985442ac1abf5e62d29de9 | 137c667471a40116a7afd7261f030b30180468c2 | /src/algebra/homology/homology.lean | 7b3df86b70641f6af5f80b525c141f8a642b875f | [
"Apache-2.0"
] | permissive | bragadeesh153/mathlib | 46bf814cfb1eecb34b5d1549b9117dc60f657792 | b577bb2cd1f96eb47031878256856020b76f73cd | refs/heads/master | 1,687,435,188,334 | 1,626,384,207,000 | 1,626,384,207,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,755 | lean | /-
Copyright (c) 2021 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import algebra.homology.image_to_kernel
import algebra.homology.homological_complex
import category_theory.graded_object
/-!
# The homology of a complex
Given `C : ... |
c6a4ea53c5f84282f79c348fd9a3a5a6cee154ce | 3dc4623269159d02a444fe898d33e8c7e7e9461b | /.github/workflows/geo/src/pfin/lemmas.lean | f410e863a3231b30c94af37f4e905ac645667e41 | [] | 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 | 10,354 | lean | import data.nat.basic
import pfin.basic pfin.ops
universe u
open pfin nat function
/-- `pfin 0` is empty -/
def pfin_zero_elim {C : Sort*} : pfin 0 → C :=
λ x, false.elim $ nat.not_lt_zero x.val x.is_lt
def pfin_zero_elim' {α : pfin 0 → Sort u} : ∀(x : pfin 0), α x
| ⟨n, hn⟩ := false.elim (nat.not_lt_zero n hn)
nam... |
853b9ed65d35a94c8df1bb1acdef7b30d0f4a97c | e6b8240a90527fd55d42d0ec6649253d5d0bd414 | /src/analysis/complex/exponential.lean | 736e90f18e03dd3a491fb18ea61239b6e022fee2 | [
"Apache-2.0"
] | permissive | mattearnshaw/mathlib | ac90f9fb8168aa642223bea3ffd0286b0cfde44f | d8dc1445cf8a8c74f8df60b9f7a1f5cf10946666 | refs/heads/master | 1,606,308,351,137 | 1,576,594,130,000 | 1,576,594,130,000 | 228,666,195 | 0 | 0 | Apache-2.0 | 1,576,603,094,000 | 1,576,603,093,000 | null | UTF-8 | Lean | false | false | 82,599 | 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... |
45756652792ce1856cf78519a01e1921087aaf5c | dc253be9829b840f15d96d986e0c13520b085033 | /homotopy/wedge.hlean | 046d60a9193e86b75312a923699b94b7213ac533 | [
"Apache-2.0"
] | permissive | cmu-phil/Spectral | 4ce68e5c1ef2a812ffda5260e9f09f41b85ae0ea | 3b078f5f1de251637decf04bd3fc8aa01930a6b3 | refs/heads/master | 1,685,119,195,535 | 1,684,169,772,000 | 1,684,169,772,000 | 46,450,197 | 42 | 13 | null | 1,505,516,767,000 | 1,447,883,921,000 | Lean | UTF-8 | Lean | false | false | 9,927 | hlean | -- Authors: Floris van Doorn
import homotopy.wedge homotopy.cofiber ..move_to_lib .pushout
open wedge pushout eq prod sum pointed equiv is_equiv unit lift bool option
namespace wedge
variable (A : Type*)
variables {A}
definition add_point_of_wedge_pbool [unfold 2]
(x : A ∨ pbool) : A₊ :=
begin
induction x wit... |
06eb0731b20e11a00ae23da9a9b532275008e078 | d534932ed7c1eba03b537c377a4f8961acd41e99 | /Socket.lean | b24a5dfe041285c099900c837b94729b5b22c272 | [
"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 | 5,344 | lean | /-
Copyright (c) 2021 Xubai Wang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Xubai Wang
-/
import Init.System.IOError
--------------------------------------------------------------------------------
-- # Initialization
--------------------------------------... |
4d892744236c945d32f6920ee5cbe46fa3850038 | 735bb6d9c54e20a6bdc031c27bff1717e68886b9 | /tools/auto/experiments/test2.lean | 1279b982c134e3746471de74b632eef64d51040f | [] | 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 | 12,710 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Nathaniel Thomas
More examples to test automation, stolen shamelessly by Jeremy from Nathaniel's "tauto".
-/
import ..finish
open nat
section
variables (a b c ... |
1eb5cb4fb6c5f8b913ca4cbd0a70b4d1eae3c9f4 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/nestedInductiveIssue.lean | f43a19500230bdc576b2f8e316cc21e89e87b992 | [
"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 | 248 | lean | inductive Vec (α : Type u) : Nat → Type u
| nil : Vec α Nat.zero
| cons : α → {n : Nat} → Vec α n → Vec α (n+1)
inductive Expr
| val (v : Nat)
| app2 (f : String) (args : Vec Expr 2)
| app3 (f : String) (args : Vec Expr 3)
|
229d277b685b21fe4756e8f13c85c81ba3876a0f | 2fbe653e4bc441efde5e5d250566e65538709888 | /src/data/matrix/basic.lean | 45cb4a17933041772204b115ff1b2960feaef817 | [
"Apache-2.0"
] | permissive | aceg00/mathlib | 5e15e79a8af87ff7eb8c17e2629c442ef24e746b | 8786ea6d6d46d6969ac9a869eb818bf100802882 | refs/heads/master | 1,649,202,698,930 | 1,580,924,783,000 | 1,580,924,783,000 | 149,197,272 | 0 | 0 | Apache-2.0 | 1,537,224,208,000 | 1,537,224,207,000 | null | UTF-8 | Lean | false | false | 12,757 | lean | /-
Copyright (c) 2018 Ellen Arlt. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Ellen Arlt, Blair Shi, Sean Leather, Mario Carneiro, Johan Commelin
Matrices
-/
import algebra.module algebra.pi_instances
import data.fintype
universes u v w
def matrix (m n : Type u) ... |
abcc825ada7e06a8a4d1fab8b8772da055413cbf | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/data/set/function.lean | ecb07fa2b0420dffd3d59d94a87c38237184faf9 | [
"Apache-2.0"
] | permissive | agjftucker/mathlib | d634cd0d5256b6325e3c55bb7fb2403548371707 | 87fe50de17b00af533f72a102d0adefe4a2285e8 | refs/heads/master | 1,625,378,131,941 | 1,599,166,526,000 | 1,599,166,526,000 | 160,748,509 | 0 | 0 | Apache-2.0 | 1,544,141,789,000 | 1,544,141,789,000 | null | UTF-8 | Lean | false | false | 24,295 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad, Andrew Zipperer, Haitao Zhang, Minchao Wu, Yury Kudryashov
-/
import data.set.basic
import logic.function.conjugate
/-!
# Functions over sets
## Main definitions
### ... |
a9f7eaa80cfe4b6f6e66ebace1f485c59fe360cb | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/linear_algebra/matrix_auto.lean | d55da7d10611595db8e2ddf468d2a8503491411c | [] | 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 | 43,873 | lean | /-
Copyright (c) 2019 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Johannes Hölzl, Patrick Massot, Casper Putz
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.linear_algebra.finite_dimensional
import Mathlib.linear_algebra... |
5f01f3b52a72ea8a50dedfab4d9f641b26709cb2 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/tactic/lint/frontend.lean | a8f362d1bbcb86fed9d31586a3a924854a444e05 | [
"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,914 | lean | /-
Copyright (c) 2020 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Robert Y. Lewis, Gabriel Ebner
-/
import tactic.lint.basic
/-!
# Linter frontend and commands
This file defines the linter commands which spot common mistakes in ... |
2fb7b764f2531d47a38c7c63e55ccb8cb4fe0c0d | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /test/polyrith.lean | c3b71514e1e427c10c214281828c5c748dcbd2a9 | [
"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 | 24,021 | lean | /-
Copyright (c) 2022 Dhruv Bhatia. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Dhruv Bhatia, Robert Y. Lewis
-/
import tactic.polyrith
import data.real.basic
/-!
Each call to `polyrith` makes a call to the SageCell web API at
<https://sagecell.sagemath.org/>. ... |
3e6b0f579a2bc679ae4f3a5a4800366f90bafdf6 | 75db7e3219bba2fbf41bf5b905f34fcb3c6ca3f2 | /tests/lean/run/begin_end_plus.lean | e2eb377ccb5383d9ca66651583da2965f918a16a | [
"Apache-2.0"
] | permissive | jroesch/lean | 30ef0860fa905d35b9ad6f76de1a4f65c9af6871 | 3de4ec1a6ce9a960feb2a48eeea8b53246fa34f2 | refs/heads/master | 1,586,090,835,348 | 1,455,142,203,000 | 1,455,142,277,000 | 51,536,958 | 1 | 0 | null | 1,455,215,811,000 | 1,455,215,811,000 | null | UTF-8 | Lean | false | false | 350 | lean | example (a b c : Prop) : a → b → c → a ∧ c ∧ b :=
assume Ha Hb Hc,
have aux : c ∧ b, from and.intro Hc Hb,
begin+ -- the whole context is visible
split,
state,
repeat assumption
end
example (a b c : Prop) : a → b → c → a ∧ c ∧ b :=
assume Ha Hb Hc,
have aux : c ∧ b, from and.intro Hc Hb,
by+ split; repeat assum... |
d179ea640edafc6c8b0572a9914726a4da8bb473 | 9b9a16fa2cb737daee6b2785474678b6fa91d6d4 | /src/topology/algebra/topological_structures.lean | 11255af5a5c5714a74ecd6e5bdf46470a1e251e4 | [
"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 | 62,230 | 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
Theory of topological monoids, groups and rings.
TODO: generalize `topological_monoid` and `topological_add_monoid` to semigroups, or add a type class
... |
f86cb76e219a4d427fa5b857ed95e2066239af26 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/algebra/group/basic.lean | 7bdec37002e81e9ccbe3a746466a952be2a8d8b5 | [
"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 | 8,806 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Simon Hudon, Mario Carneiro
-/
import algebra.group.to_additive logic.function
attribute [simp] sub_neg_eq_add
/-!
# Extra identities for semigroups, monoids, and group... |
a57684649bdbb0adad7e5a2d9075bf17018bbb07 | e0b0b1648286e442507eb62344760d5cd8d13f2d | /stage0/src/Lean/Util/MonadBacktrack.lean | d61d31574370872c5f6b2979eb9274a16f3b9fda | [
"Apache-2.0"
] | permissive | MULXCODE/lean4 | 743ed389e05e26e09c6a11d24607ad5a697db39b | 4675817a9e89824eca37192364cd47a4027c6437 | refs/heads/master | 1,682,231,879,857 | 1,620,423,501,000 | 1,620,423,501,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,421 | 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
-/
namespace Lean
/-- Similar to `MonadState`, but it retrieves/restores only the "backtrackable" part of the state -/
class MonadBacktrack (s : outParam Typ... |
c817ad02857bce1a8118dade1af231ab3aa36784 | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/group_theory/submonoid/operations.lean | 1535462d432668527309cd04b7cfb4d1b1f4a54a | [
"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 | 24,841 | lean | /-
Copyright (c) 2018 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Kenny Lau, Johan Commelin, Mario Carneiro, Kevin Buzzard,
Amelia Livingston, Yury Kudryashov
-/
import group_theory.submonoid.basic
import data.equiv.mul_add
import al... |
be336b66873400796294af3285c77b88664c5eb6 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/data/equiv/module.lean | 442cf1be837e86f1a4ae9ef0783a446fc0b1b61b | [
"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,958 | lean | /-
Copyright (c) 2020 Anne Baanen. 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, Anne Baanen,
Frédéric Dupuis, Heather Macbeth
-/
import algebra.module.linear_map
/-!
# (Semi)linear equivalences
In t... |
1ac7ec9642f7ee6e91b11ab4cb5b8efd5b655ae9 | 4950bf76e5ae40ba9f8491647d0b6f228ddce173 | /src/topology/metric_space/pi_Lp.lean | 658c36d091197db6e7ffdfc76070ebbba957354e | [
"Apache-2.0"
] | permissive | ntzwq/mathlib | ca50b21079b0a7c6781c34b62199a396dd00cee2 | 36eec1a98f22df82eaccd354a758ef8576af2a7f | refs/heads/master | 1,675,193,391,478 | 1,607,822,996,000 | 1,607,822,996,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 12,040 | 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.mean_inequalities
/-!
# `L^p` distance on finite products of metric spaces
Given finitely many metric spaces, one can put the max distance on t... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.