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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
c72cca3fb09e43f439a1fe4ea71cf7ad381b6828 | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/topology/sheaves/local_predicate.lean | d8a7aaeff1e50c05e7e154611b5dfc11398b77bb | [
"Apache-2.0"
] | permissive | waynemunro/mathlib | e3fd4ff49f4cb43d4a8ded59d17be407bc5ee552 | 065a70810b5480d584033f7bbf8e0409480c2118 | refs/heads/master | 1,693,417,182,397 | 1,634,644,781,000 | 1,634,644,781,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 11,626 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Scott Morrison, Adam Topaz
-/
import topology.sheaves.sheaf_of_functions
import topology.sheaves.stalks
import topology.sheaves.sheaf_condition.unique_gluing
/-!
# Fun... |
88abd60dd52a303acbe39b898dee8f440ce60aac | d29d82a0af640c937e499f6be79fc552eae0aa13 | /src/ring_theory/ideal/operations.lean | 5eba7b5552de5c412241caeae37472e9aca6ac42 | [
"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 | 67,768 | 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 algebra.algebra.operations
import algebra.algebra.tower
import data.equiv.ring
import data.nat.choose.sum
import ring_theory.ideal.basic
import ring_theory.non_zero_divi... |
a1e6378f38965db063da7482c3aa6378f4c07715 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/category_theory/limits/shapes/pullbacks.lean | f88e38a7a814517652269c82fd3cb0d5706ff230 | [
"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 | 93,735 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Markus Himmel, Bhavik Mehta, Andrew Yang
-/
import category_theory.limits.shapes.wide_pullbacks
import category_theory.limits.shapes.binary_products
/-!
# Pullbacks
W... |
e6153ceb772666b4bb76e8127d56b192d9618c95 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/closed/types_auto.lean | 6fb4d1fae09fcd70a296d264ed49fda0ac1d4bd0 | [] | 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 | 2,589 | lean | /-
Copyright (c) 2020 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.category_theory.limits.presheaf
import Mathlib.category_theory.limits.preserves.functor_categor... |
995148dfcb88786d07f39108c6d36c6f88f7cbf1 | 8c02fed42525b65813b55c064afe2484758d6d09 | /src/lang_tostr.lean | f27725cf534dc8d5f1bf624a0b763096008d646c | [
"LicenseRef-scancode-generic-cla",
"MIT"
] | permissive | microsoft/AliveInLean | 3eac351a34154efedd3ffc4fe2fa4ec01b219e0d | 4b739dd6e4266b26a045613849df221374119871 | refs/heads/master | 1,691,419,737,939 | 1,689,365,567,000 | 1,689,365,568,000 | 131,156,103 | 23 | 18 | NOASSERTION | 1,660,342,040,000 | 1,524,747,538,000 | Lean | UTF-8 | Lean | false | false | 2,717 | lean | -- Copyright (c) Microsoft Corporation. All rights reserved.
-- Licensed under the MIT license.
import .lang
namespace const
instance: has_to_string const :=
⟨λ a, match a with
| (const.int n) := to_string n --"(int " ++ to_string n ++ ")"
end⟩
end const
namespace reg
instance: has_to_string reg :=... |
d2a0d9044f3bbf6f85bf3564746b75237afa3f34 | 037dba89703a79cd4a4aec5e959818147f97635d | /src/2020/logic/logic_lecture_ad_lib.lean | 1fd8502eef6b661014a24b082feeead04ab52383 | [] | no_license | ImperialCollegeLondon/M40001_lean | 3a6a09298da395ab51bc220a535035d45bbe919b | 62a76fa92654c855af2b2fc2bef8e60acd16ccec | refs/heads/master | 1,666,750,403,259 | 1,665,771,117,000 | 1,665,771,117,000 | 209,141,835 | 115 | 12 | null | 1,640,270,596,000 | 1,568,749,174,000 | Lean | UTF-8 | Lean | false | false | 3,776 | lean | /-
What I present in M40001 is in some sense the mathematics
of true-false statements.
-/
import tactic
open bool
/-
#print notation ∧
#print and
-- This is one idea of a proposition.
-- ff and tt are the only two terms of type `bool`
-- functions band, bor, bnot
#check ff ∧ tt
#eval band ff tt
#eval tt
-/
example :... |
2fe9bb465abbde1ce6e5ffe47684d0621a9c1db7 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/scopedunifhint.lean | 4ab8507522ab887a9d60078b49289b0b812d3082 | [
"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,260 | lean | structure Magma.{u} where
α : Type u
mul : α → α → α
def Nat.Magma : Magma where
α := Nat
mul a b := a * b
def Prod.Magma (m : Magma.{u}) (n : Magma.{v}) : Magma where
α := m.α × n.α
mul | (a₁, b₁), (a₂, b₂) => (m.mul a₁ a₂, n.mul b₁ b₂)
instance : CoeSort Magma.{u} (Type u) where
coe m := m.α... |
42fea8897b9b73a41518c814a4a06614e4ce2ad3 | 92b50235facfbc08dfe7f334827d47281471333b | /library/data/real/complete.lean | caf1b661d63b622113dee5b0b9419177d3723eb6 | [
"Apache-2.0"
] | permissive | htzh/lean | 24f6ed7510ab637379ec31af406d12584d31792c | d70c79f4e30aafecdfc4a60b5d3512199200ab6e | refs/heads/master | 1,607,677,731,270 | 1,437,089,952,000 | 1,437,089,952,000 | 37,078,816 | 0 | 0 | null | 1,433,780,956,000 | 1,433,780,955,000 | null | UTF-8 | Lean | false | false | 14,179 | lean | /-
Copyright (c) 2015 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Robert Y. Lewis
The real numbers, constructed as equivalence classes of Cauchy sequences of rationals.
This construction follows Bishop and Bridges (1985).
At this point, we no longer... |
9908c7819d166bd8c460483931e9829055ae482f | 367134ba5a65885e863bdc4507601606690974c1 | /src/control/fix.lean | 9201e920a437f9239a2445d8846af23f25584db1 | [
"Apache-2.0"
] | permissive | kodyvajjha/mathlib | 9bead00e90f68269a313f45f5561766cfd8d5cad | b98af5dd79e13a38d84438b850a2e8858ec21284 | refs/heads/master | 1,624,350,366,310 | 1,615,563,062,000 | 1,615,563,062,000 | 162,666,963 | 0 | 0 | Apache-2.0 | 1,545,367,651,000 | 1,545,367,651,000 | null | UTF-8 | Lean | false | false | 3,313 | lean | /-
Copyright (c) 2020 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Simon Hudon
-/
import data.nat.upto
import data.stream.basic
import data.pfun
/-!
# Fixed point
This module defines a generic `fix` operator for defining recursive
computations that are... |
c1bc56aa3e7e8eb497ad545ee25a5086101124bd | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/set_theory/continuum.lean | f05ac8732a742368844b53bead1381122883ef83 | [
"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 | 2,905 | 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 set_theory.cardinal_ordinal
/-!
# Cardinality of continuum
In this file we define `cardinal.continuum` (notation: `𝔠`, localized in `cardinal`) to be `2 ^... |
a870299bd633f6b7b056e6713c5bbeb8d64df521 | 64874bd1010548c7f5a6e3e8902efa63baaff785 | /hott/truncation.hlean | 3491a94083c52442a3c976a551a7e5dfe2488b9e | [
"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 | 674 | hlean | -- Copyright (c) 2014 Jakob von Raumer. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Jakob von Raumer
open truncation
-- Axiomatize the truncation operator as long as we do not have
-- Higher inductive types
axiom truncate (A : Type) (n : trunc_index) : Type... |
f527cbf71882c65cefb166331bef522381dc0147 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/algebra/module/pi.lean | 57ec7896001fda402a8dc0a909a41a2acd1f64c9 | [
"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 | 5,428 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon, Patrick Massot
-/
import algebra.module.basic
import algebra.ring.pi
/-!
# Pi instances for module and multiplicative actions
This file defines instances for module, mul_ac... |
56a5a2fd5dac8b383ec028f93328cfa1b3db26c7 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/order/category/BddOrd.lean | 0be06702f6a2f9d3ba21852ce2d7802153f6791f | [
"Apache-2.0"
] | permissive | kbuzzard/mathlib | 2ff9e85dfe2a46f4b291927f983afec17e946eb8 | 58537299e922f9c77df76cb613910914a479c1f7 | refs/heads/master | 1,685,313,702,744 | 1,683,974,212,000 | 1,683,974,212,000 | 128,185,277 | 1 | 0 | null | 1,522,920,600,000 | 1,522,920,600,000 | null | UTF-8 | Lean | false | false | 3,036 | 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 category_theory.category.Bipointed
import order.category.PartOrd
import order.hom.bounded
/-!
# The category of bounded orders
This defines `BddOrd`, the categor... |
7a5a6c2eed743605e371309d00feaaa85481a84b | 01ae0d022f2e2fefdaaa898938c1ac1fbce3b3ab | /categories/functor_categories/isomorphisms.lean | ae979bdf3687b98539f6cba3da8d319f2d5dc529 | [] | no_license | PatrickMassot/lean-category-theory | 0f56a83464396a253c28a42dece16c93baf8ad74 | ef239978e91f2e1c3b8e88b6e9c64c155dc56c99 | refs/heads/master | 1,629,739,187,316 | 1,512,422,659,000 | 1,512,422,659,000 | 113,098,786 | 0 | 0 | null | 1,512,424,022,000 | 1,512,424,022,000 | null | UTF-8 | Lean | false | false | 1,385 | lean | -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Stephen Morgan, Scott Morrison
import ..natural_isomorphism
open categories
open categories.isomorphism
open categories.functor
open categories.natural_transformation
namespac... |
bd3597e16ffd3ff323797be2ee056f869f430162 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/compiler/lazylist.lean | 8366517044a359a315393340cf2963b59abd4188 | [
"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 | 3,962 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
universes u v w
inductive LazyList (α : Type u)
| nil {} : LazyList
| cons (hd : α) (tl : LazyList) : LazyList
| delayed (t : Thunk L... |
650f4f0e329806525d4631993d30f1feebba5962 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/linear_algebra/matrix/general_linear_group.lean | 659ad251c659ebec800d003b63d2679eac3a8d06 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 8,722 | lean | /-
Copyright (c) 2021 Chris Birkbeck. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Birkbeck
-/
import linear_algebra.general_linear_group
import linear_algebra.matrix.nonsingular_inverse
import linear_algebra.matrix.special_linear_group
/-!
# The General Linea... |
eca158c9193ac50287147853557e9f09985a8581 | 4950bf76e5ae40ba9f8491647d0b6f228ddce173 | /src/topology/metric_space/emetric_space.lean | 2acdfbc7d486454d0d214fe9810fed5e8deedce1 | [
"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 | 37,651 | lean | /-
Copyright (c) 2015, 2017 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Robert Y. Lewis, Johannes Hölzl, Mario Carneiro, Sébastien Gouëzel
-/
import data.real.ennreal
import data.finset.intervals
import topology.uniform_space.uniform_em... |
0f448b8f1f979468f5d82fb0249a0193491bf9a6 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/measure_theory/borel_space.lean | c6462745495c9b2b21f8810b5860b7e124a28fbf | [
"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 | 45,653 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Yury Kudryashov
-/
import measure_theory.measure_space
import analysis.normed_space.finite_dimension
/-!
# Borel (measurable) space
## Main definitions
* `borel α` : ... |
4be87c8442a734b61783365d25bd5a497e7f5038 | 76ce87faa6bc3c2aa9af5962009e01e04f2a074a | /01_Equality/03_type_inference.lean | 9fa351ac0ca6aaf64b3a1c1abbeb8054fd3f1143 | [] | no_license | Mnormansell/Discrete-Notes | db423dd9206bbe7080aecb84b4c2d275b758af97 | 61f13b98be590269fc4822be7b47924a6ddc1261 | refs/heads/master | 1,585,412,435,424 | 1,540,919,483,000 | 1,540,919,483,000 | 148,684,638 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,438 | lean | /- Type Inference -/
/-
Now as we've seen, given a value, t, of some type,
T, Lean can tell us what T is. The #check command
tells us the type of any value or expression. The
key observation is that if you give Lean a value,
Lean can determine its type.
-/
#check 0
/-
We can use the ability of Lean to determine th... |
95033109108b4d664f0b53406ddcb80e0a3301a2 | 626e312b5c1cb2d88fca108f5933076012633192 | /src/measure_theory/integral/interval_integral.lean | e5abacfaf60c0065fe50b644ca1023bcb27276d2 | [
"Apache-2.0"
] | permissive | Bioye97/mathlib | 9db2f9ee54418d29dd06996279ba9dc874fd6beb | 782a20a27ee83b523f801ff34efb1a9557085019 | refs/heads/master | 1,690,305,956,488 | 1,631,067,774,000 | 1,631,067,774,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 117,513 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov, Patrick Massot, Sébastien Gouëzel
-/
import measure_theory.integral.set_integral
import measure_theory.measure.lebesgue
import analysis.calculus.fderiv_measurab... |
e691b4fc3949616bc1b88212b9a350ba51d10b83 | 5fbbd711f9bfc21ee168f46a4be146603ece8835 | /lean/natural_number_game/advanced_proposition/01.lean | 96ead3a3e62b527548b3acaaf38ceb6cdc4196d5 | [
"LicenseRef-scancode-warranty-disclaimer"
] | no_license | goedel-gang/maths | 22596f71e3fde9c088e59931f128a3b5efb73a2c | a20a6f6a8ce800427afd595c598a5ad43da1408d | refs/heads/master | 1,623,055,941,960 | 1,621,599,441,000 | 1,621,599,441,000 | 169,335,840 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 81 | lean | example (P Q : Prop) (p : P) (q : Q) : P ∧ Q :=
begin
split,
cc,
cc,
end
|
d670e9c357e3fd7f986c93c49ab69efaccb92c4e | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /library/init/applicative.lean | 1412751ceba4be4bb4f5d4e3c5f291ea975e3bee | [
"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 | 695 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
prelude
import init.functor
universe variables u v
structure [class] applicative (F : Type u → Type v) extends functor F : Type (max u+1 v):=
(pure : Π {A :... |
2414925d5e24d7e0d5caa80702a505bd63792934 | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /src/combinatorics/derangements/finite.lean | bd423dcf49024d0d8ec50e17fff2419e5c108619 | [
"Apache-2.0"
] | permissive | dexmagic/mathlib | ff48eefc56e2412429b31d4fddd41a976eb287ce | 7a5d15a955a92a90e1d398b2281916b9c41270b2 | refs/heads/master | 1,693,481,322,046 | 1,633,360,193,000 | 1,633,360,193,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,719 | lean | /-
Copyright (c) 2021 Henry Swanson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Henry Swanson
-/
import combinatorics.derangements.basic
import data.fintype.card
import tactic.delta_instance
import tactic.ring
/-!
# Derangements on fintypes
This file contains lem... |
61b74c702394e0f8161328124628e736675f52f2 | 6de8ea38e7f58ace8fbf74ba3ad0bf3b3d1d7ab5 | /lab6/code/soundness.lean | e2c6ff47ce8f75a61b8b0ead080f4cbe5aec7306 | [] | no_license | KinanBab/CS591K1-Labs | 72f4e2c7d230d4e4f548a343a47bf815272b1f58 | d4569bf99d20c22cd56721024688cda247d1447f | refs/heads/master | 1,587,016,758,873 | 1,558,148,366,000 | 1,558,148,366,000 | 165,329,114 | 5 | 2 | null | 1,550,689,848,000 | 1,547,252,664,000 | TeX | UTF-8 | Lean | false | false | 2,867 | lean | import .lambda
import .lemmas
-- silly lemmas
-- type of the identity
lemma identity_type :
∀ {t}, typing list.nil (λ:"x"."x") (type.func t t) :=
begin
intros,
apply typing.abs,
apply typing.var,
simp,
end
-- type of the identity nested inside a silly abstraction
lemma nested_identity_type :
∀ {t}, typi... |
ba53783ddfd4269a51287758aea6a690823ac642 | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/ring_theory/adjoin/basic.lean | 19297b6c25a1c8d586652a7956cd44239223493a | [
"Apache-2.0"
] | permissive | troyjlee/mathlib | e18d4b8026e32062ab9e89bc3b003a5d1cfec3f5 | 45e7eb8447555247246e3fe91c87066506c14875 | refs/heads/master | 1,689,248,035,046 | 1,629,470,528,000 | 1,629,470,528,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 16,868 | lean | /-
Copyright (c) 2019 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import ring_theory.polynomial.basic
import algebra.algebra.subalgebra
/-!
# Adjoining elements to form subalgebras
This file develops the basic theory of subalgebras of an R-... |
47eca11e47a21a80ee1c8d3d9598dcd65254bfae | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /src/Lean/Compiler/LCNF/CSE.lean | f1e4884af06524b56e65020040603077e5624ee9 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | tobiasgrosser/lean4 | ce0fd9cca0feba1100656679bf41f0bffdbabb71 | ebdbdc10436a4d9d6b66acf78aae7a23f5bd073f | refs/heads/master | 1,673,103,412,948 | 1,664,930,501,000 | 1,664,930,501,000 | 186,870,185 | 0 | 0 | Apache-2.0 | 1,665,129,237,000 | 1,557,939,901,000 | Lean | UTF-8 | Lean | false | false | 3,372 | lean | /-
Copyright (c) 2022 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Compiler.LCNF.CompilerM
import Lean.Compiler.LCNF.ToExpr
import Lean.Compiler.LCNF.PassManager
namespace Lean.Compiler.LCNF
/-! Common Sub-exp... |
1320f08525f336ef90648a7c805db9fbf9f97856 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/combinatorics/simple_graph/regularity/bound.lean | 804327512ff252b2fb32bd3d87c53b2bfe0972df | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 6,481 | lean | /-
Copyright (c) 2022 Yaël Dillies, Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies, Bhavik Mehta
-/
import analysis.special_functions.pow
import order.partition.equipartition
/-!
# Numerical bounds for Szemerédi Regularity Lemma
This file g... |
e605ff2a3ac667b1a8b98ebf3999ac33a467c20d | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /02_Dependent_Type_Theory.org.40.lean | e025efa0c2d4035148c5835904d70867e57a7cd4 | [] | 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 | 194 | lean | /- page 31 -/
import standard
definition id {A : Type} (x : A) := x
-- BEGIN
variables A B : Type
variables (a : A) (b : B)
set_option pp.metavar_args false
check id -- ?A → ?A
-- END
|
a591d0e26a05cb209015b055376d93b99df034b2 | da3a76c514d38801bae19e8a9e496dc31f8e5866 | /library/init/data/option/basic.lean | fa143c85d454c50782de7a2b7589159f85bfcb15 | [
"Apache-2.0"
] | permissive | cipher1024/lean | 270c1ac5781e6aee12f5c8d720d267563a164beb | f5cbdff8932dd30c6dd8eec68f3059393b4f8b3a | refs/heads/master | 1,611,223,459,029 | 1,487,566,573,000 | 1,487,566,573,000 | 83,356,543 | 0 | 0 | null | 1,488,229,336,000 | 1,488,229,336,000 | null | UTF-8 | Lean | false | false | 3,353 | 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
open decidable
universes u v
namespace option
def to_monad {m : Type → Type} [monad m] [alternative m] {A} : opti... |
1d5c551a50e28bc329573bb9464a8d5f658f0ddc | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /library/init/coe.lean | fed1f98bfd1d073ba6e4a574a7ae82c63d346e37 | [
"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 | 5,881 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
/-
The elaborator tries to insert coercions automatically.
Only instances of has_coe type class are considered in the process.
Lean also provides a "lifti... |
10c87a66ed18f1fe434a0d8b82392855c57520a1 | 3dc4623269159d02a444fe898d33e8c7e7e9461b | /.github/workflows/project_1_a_decrire/lean-scheme-submission/src/sheaves/stalk_of_rings_on_basis.lean | 3d445c4de2adda3ff6e7307944f2f60362275840 | [] | 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 | 599 | lean | /-
Stalk of rings on basis.
https://stacks.math.columbia.edu/tag/007L
(just says that the category of rings is a type of algebraic structure)
-/
import topology.basic
import sheaves.stalk_on_basis
import sheaves.presheaf_of_rings_on_basis
universe u
open topological_space
section stalk_of_rings_on_bas... |
dda409f588c80fe36c2a4e6c2459045b271b915f | 037dba89703a79cd4a4aec5e959818147f97635d | /src/2020/relations/equiv_partition3.lean | 0930d0601d206f453747431fcbb4d3656afc3612 | [] | no_license | ImperialCollegeLondon/M40001_lean | 3a6a09298da395ab51bc220a535035d45bbe919b | 62a76fa92654c855af2b2fc2bef8e60acd16ccec | refs/heads/master | 1,666,750,403,259 | 1,665,771,117,000 | 1,665,771,117,000 | 209,141,835 | 115 | 12 | null | 1,640,270,596,000 | 1,568,749,174,000 | Lean | UTF-8 | Lean | false | false | 4,316 | lean | import logic.equiv.basic
import data.set.basic
structure partition (X : Type) :=
(C : set (set X))
(Hnonempty : ∀ c ∈ C, c ≠ ∅)
(Hcover : ∀ x, ∃ c ∈ C, x ∈ c)
(Hunique : ∀ c d ∈ C, c ∩ d ≠ ∅ → c = d)
def partition.ext {X : Type} (P Q : partition X) (H : P.C = Q.C) : P = Q :=
begin
cases P, cases Q,
simpa using H,... |
9807eda04476d4164e388b44a605ffc80c7a4d9a | e514e8b939af519a1d5e9b30a850769d058df4e9 | /src/tactic/rewrite_search/discovery/default.lean | 72465fc1ea73ce390af4c22ad3e8a97030a3a500 | [] | no_license | semorrison/lean-rewrite-search | dca317c5a52e170fb6ffc87c5ab767afb5e3e51a | e804b8f2753366b8957be839908230ee73f9e89f | refs/heads/master | 1,624,051,754,485 | 1,614,160,817,000 | 1,614,160,817,000 | 162,660,605 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 80 | lean | import .types
import .bundle
import .suggest
import .screening
import .collect |
4d5733b40d64b38cb2fa7807cf7d267919e7d685 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/tactic/equiv_rw_auto.lean | 0875bb1c8cea19ade1c6c4128379c9b40279e8a5 | [] | 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,158 | 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.tactic.simp_result
import Mathlib.tactic.clear
import Mathlib.control.equiv_functor.instanc... |
dce22fe2c93bfb05b66d1418c4838a2fd119b0e7 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/probability/probability_mass_function/monad.lean | e8ec58cd4b4e21ffd637d58498f8b6c9294a7e6c | [
"Apache-2.0"
] | permissive | jcommelin/mathlib | d8456447c36c176e14d96d9e76f39841f69d2d9b | ee8279351a2e434c2852345c51b728d22af5a156 | refs/heads/master | 1,664,782,136,488 | 1,663,638,983,000 | 1,663,638,983,000 | 132,563,656 | 0 | 0 | Apache-2.0 | 1,663,599,929,000 | 1,525,760,539,000 | Lean | UTF-8 | Lean | false | false | 14,422 | lean | /-
Copyright (c) 2020 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Devon Tuma
-/
import probability.probability_mass_function.basic
/-!
# Monad Operations for Probability Mass Functions
This file constructs two operations on `pmf` that g... |
80af90a6c87b7de7f52d175c21a977cc2e62a35b | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/algebra/category/Mon/colimits.lean | bd594ded935a2aadfffbc6f69c23b2405b135119 | [
"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 | 7,517 | 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 algebra.category.Mon.basic
import category_theory.limits.limits
import category_theory.limits.concrete_category
/-!
# The category of monoids has all colimits... |
d3e319a8f3cd79085991569df612e4b6e86f3393 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/order/filter/bases.lean | 26fd2e3208a4757d5f366fb1d016524751cb7cc4 | [
"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 | 49,396 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov, Johannes Hölzl, Mario Carneiro, Patrick Massot
-/
import data.prod.pprod
import data.set.countable
import order.filter.prod
/-!
# Filter bases
A filter basis `B : f... |
c9c12fd6568b773f5ab8a5d7329355bf62ee6e86 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/tactic/linarith/lemmas.lean | a5cff8a942a71706db1b8cc750f0c95b55ff7a33 | [
"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 | 3,793 | lean | /-
Copyright (c) 2020 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
-/
import algebra.ordered_ring
import data.int.basic
import tactic.norm_num
/-!
# Lemmas for `linarith`
This file contains auxiliary lemmas that `linarith` uses to ... |
b81b051453c89b5984f204ce115728be03f34881 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebra/category/Group/images.lean | 929d2d7082073b14f986e5fc358bac79f5d2c5e3 | [
"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 | 3,302 | 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.Group.abelian
import category_theory.limits.shapes.images
import category_theory.limits.types
/-!
# The category of commutative additive grou... |
e62ca23ba80c82610d482bb1205d86a116d14444 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/algebra/continued_fractions/computation/basic.lean | 688fada02c4264ab3964a41081be84a4b6b7e45c | [
"Apache-2.0"
] | permissive | robertylewis/mathlib | 3d16e3e6daf5ddde182473e03a1b601d2810952c | 1d13f5b932f5e40a8308e3840f96fc882fae01f0 | refs/heads/master | 1,651,379,945,369 | 1,644,276,960,000 | 1,644,276,960,000 | 98,875,504 | 0 | 0 | Apache-2.0 | 1,644,253,514,000 | 1,501,495,700,000 | Lean | UTF-8 | Lean | false | false | 7,973 | 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.order.floor
import algebra.continued_fractions.basic
import algebra.order.field
/-!
# Computable Continued Fractions
## Summary
We formalise the ... |
71939010f7ba2d0805f9934390a8ec5d11fcd76a | b2e508d02500f1512e1618150413e6be69d9db10 | /src/category_theory/limits/preserves.lean | f3144e3213553e7a13df012655d78af5bac132cb | [
"Apache-2.0"
] | permissive | callum-sutton/mathlib | c3788f90216e9cd43eeffcb9f8c9f959b3b01771 | afd623825a3ac6bfbcc675a9b023edad3f069e89 | refs/heads/master | 1,591,371,888,053 | 1,560,990,690,000 | 1,560,990,690,000 | 192,476,045 | 0 | 0 | Apache-2.0 | 1,568,941,843,000 | 1,560,837,965,000 | Lean | UTF-8 | Lean | false | false | 11,091 | lean | -- Copyright (c) 2018 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Scott Morrison, Reid Barton
-- Preservation and reflection of (co)limits.
import category_theory.limits.limits
open category_theory
namespace category_theory.limits
universe... |
f080703816691dc05acd6e8c796f3cf0d46a51de | 9028d228ac200bbefe3a711342514dd4e4458bff | /src/order/filter/cofinite.lean | 0a5967b87f7d9fc7c6501ad89c96a7dad8f029ad | [
"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 | 2,680 | 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, Yury Kudryashov
-/
import order.filter.at_top_bot
/-!
# The cofinite filter
In this file we define
`cofinite`: the filter of sets with finite compleme... |
35683da23fc4732eef54b4dd2216a9a90185d38d | 0845ae2ca02071debcfd4ac24be871236c01784f | /library/init/lean/default.lean | 6a9516fc0b48f6c51c80178e9a1c6eef3c20965d | [
"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 | 498 | 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
import init.lean.environment
import init.lean.modifiers
import init.lean.projfns
import init.lean.runtime
import init.lean... |
d8ee0985e275c6a40c26ce8485c6823cc8e8463b | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/algebraic_geometry/Spec.lean | a1d79faeea7610d6ef7fed5568b3a81b6de9c480 | [
"Apache-2.0"
] | permissive | waynemunro/mathlib | e3fd4ff49f4cb43d4a8ded59d17be407bc5ee552 | 065a70810b5480d584033f7bbf8e0409480c2118 | refs/heads/master | 1,693,417,182,397 | 1,634,644,781,000 | 1,634,644,781,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,838 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Justus Springer
-/
import algebraic_geometry.locally_ringed_space
import algebraic_geometry.structure_sheaf
import data.equiv.transfer_instance
/-!
# $Spec$ as a funct... |
f5ed67cffa9e94116410bb2ec45eecb013b535e3 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/category/Module/monoidal/basic.lean | 83862f84811454b5dfa9d31caaa4637b6c4f9415 | [
"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 | 9,183 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Buzzard, Scott Morrison, Jakob von Raumer
-/
import algebra.category.Module.basic
import linear_algebra.tensor_product
import category_theory.linear.yoneda
import category_theory... |
890299f528a1d6e985464bf998e27795aa012c4d | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/lean/run/simp_all.lean | 1ebc79d4a7dc1129db818dc2870518ef8e54eca4 | [
"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 | 504 | lean | def f (x : Nat) := x
theorem ex1 (h₁ : a = 0) (h₂ : a + b = 0) : f (b + c) = c := by
simp_all
simp [f]
theorem ex2 (h₁ : a = 0) (h₂ : a + b = 0) : f (b + c) = c := by
simp_all [f]
theorem ex3 (h₁ : a = 0) (h₂ : a + b = 0) : f (b + c) = c := by
simp_all only [f]
rw [Nat.zero_add] at h₂
simp [h₂]
theorem ... |
d312facdcfa36c9a0feeda448e5d38649b3e443f | 30b012bb72d640ec30c8fdd4c45fdfa67beb012c | /analysis/topology/stone_cech.lean | 9da672e80e484687a5d0ec13d01f6e5c2243197c | [
"Apache-2.0"
] | permissive | kckennylau/mathlib | 21fb810b701b10d6606d9002a4004f7672262e83 | 47b3477e20ffb5a06588dd3abb01fe0fe3205646 | refs/heads/master | 1,634,976,409,281 | 1,542,042,832,000 | 1,542,319,733,000 | 109,560,458 | 0 | 0 | Apache-2.0 | 1,542,369,208,000 | 1,509,867,494,000 | Lean | UTF-8 | Lean | false | false | 10,712 | lean | /-
Copyright (c) 2018 Reid Barton. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Reid Barton
Construction of the Stone-Čech compactification using ultrafilters.
Parts of the formalization are based on "Ultrafilters and Topology"
by Marius Stekelenburg, particularly ... |
4b7bdd7f7ad92c73788962cc595075f02040f7ad | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/algebra/lie/matrix.lean | f0f38395e15ec555c3bc57a6959fc64904e131f1 | [
"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 | 3,356 | lean | /-
Copyright (c) 2021 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import algebra.lie.of_associative
import linear_algebra.matrix.reindex
import linear_algebra.matrix.to_linear_equiv
/-!
# Lie algebras of matrices
An important class of L... |
c7b33d412831d21558558833e09838c2eec6009c | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/category_theory/limits/small_complete.lean | fcbc5238d5f5f373c468e39d68f848161687675d | [
"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 | 2,032 | lean | /-
Copyright (c) 2020 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta
-/
import category_theory.limits.shapes.products
import set_theory.cardinal
/-!
# Any small complete category is a preorder
We show that any small category which has all ... |
50a60b491c7b319e39c5f06d85f3c1f83b55ead5 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/hott/calc_auto_trans_eq.hlean | 087a8894df71baf0a35852f7f82bd45e4eb1cefb | [
"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 | 555 | hlean | constant list : Type → Type
constant R.{l} : Π {A : Type.{l}}, A → A → Type.{l}
infix `~` := R
example {A : Type} {a b c d : list nat} (H₁ : a ~ b) (H₂ : b = c) (H₃ : c = d) : a ~ d :=
calc a ~ b : H₁
... = c : H₂
... = d : H₃
example {A : Type} {a b c d : list nat} (H₁ : a = b) (H₂ : b = c) (H₃ : c ~ d) : a ~ ... |
f8b0ca2cbd4e9dc4290674bc29c987e74a0d5791 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/induction_with_drec.lean | c5d3e5e22fda1668091a7d4a3c53cdf4f8d315f8 | [
"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 | 164 | lean | universe u
example {α β : Type u} (a : α) (b : β) (h : α = β) : (eq.rec_on h a : β) = b → a = eq.rec_on (h^.symm) b :=
by induction h; intros; assumption
|
3a5aff0608b7a983acd7cedb933e11299f938c23 | a4673261e60b025e2c8c825dfa4ab9108246c32e | /tests/lean/macroPrio.lean | 401c69f5bfe49e764367a90c601ea3ab4e9d8ba8 | [
"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 | 486 | lean | import Lean
macro "foo!" x:term:max : term => `($x + 1)
#check foo! 0
theorem ex1 : foo! 2 = 3 :=
rfl
macro "foo!" x:term:max : term => `($x * 2)
#check foo! 1 -- ambiguous
-- macro with higher priority
macro [1] "foo!" x:term:max : term => `($x - 2)
#check foo! 2
theorem ex2 : foo! 2 = 0 :=
rfl
-- Define ... |
1edb488b6142352e7e9ebc944da39f6efcb61da6 | 626e312b5c1cb2d88fca108f5933076012633192 | /src/measure_theory/decomposition/jordan.lean | 5d25d4d9bfc7167457dffeada7a2f32e8b8c7998 | [
"Apache-2.0"
] | permissive | Bioye97/mathlib | 9db2f9ee54418d29dd06996279ba9dc874fd6beb | 782a20a27ee83b523f801ff34efb1a9557085019 | refs/heads/master | 1,690,305,956,488 | 1,631,067,774,000 | 1,631,067,774,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 18,799 | 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.decomposition.signed_hahn
/-!
# Jordan decomposition
This file proves the existence and uniqueness of the Jordan decomposition for signed measures.
... |
691542edc5c3b4dbf841b37a2933e3b53678c529 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/limits/shapes/diagonal.lean | 012e76ec3148c6f7605955a144e04ce4ea8dd4af | [
"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 | 15,004 | lean | /-
Copyright (c) 2022 Andrew Yang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Andrew Yang
-/
import category_theory.limits.shapes.pullbacks
import category_theory.limits.shapes.kernel_pair
import category_theory.limits.shapes.comm_sq
/-!
# The diagonal object of a... |
7a799d54c0ba7752707abc021f90919adfbcfe39 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/deprecated/subfield.lean | f71de9fe49b7f6cac61a0b47f07153639056b14e | [
"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 | 6,154 | lean | /-
Copyright (c) 2018 Andreas Swerdlow. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Andreas Swerdlow
-/
import deprecated.subring
import algebra.group_with_zero.power
/-!
# Unbundled subfields (deprecated)
This file is deprecated, and is no longer imported by anyt... |
1b62f5c1b7575686a71f976fe1917bcc40bbd741 | 38bf3fd2bb651ab70511408fcf70e2029e2ba310 | /src/tactic/solve_by_elim.lean | 64c194179d1a8dfc6e4e05e0e7ab9ac602ae76fc | [
"Apache-2.0"
] | permissive | JaredCorduan/mathlib | 130392594844f15dad65a9308c242551bae6cd2e | d5de80376088954d592a59326c14404f538050a1 | refs/heads/master | 1,595,862,206,333 | 1,570,816,457,000 | 1,570,816,457,000 | 209,134,499 | 0 | 0 | Apache-2.0 | 1,568,746,811,000 | 1,568,746,811,000 | null | UTF-8 | Lean | false | false | 4,193 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon, Scott Morrison
-/
import tactic.core
namespace tactic
meta def mk_assumption_set (no_dflt : bool) (hs : list simp_arg_type) (attr : list name) : tactic (list expr) :=
do (h... |
c18cbedaa13e9e8e458f8d47b64662808e4e2ce9 | f083c4ed5d443659f3ed9b43b1ca5bb037ddeb58 | /data/subtype.lean | 3b636a0b194ef1bf24a823288d03daa9b1cf4704 | [
"Apache-2.0"
] | permissive | semorrison/mathlib | 1be6f11086e0d24180fec4b9696d3ec58b439d10 | 20b4143976dad48e664c4847b75a85237dca0a89 | refs/heads/master | 1,583,799,212,170 | 1,535,634,130,000 | 1,535,730,505,000 | 129,076,205 | 0 | 0 | Apache-2.0 | 1,551,697,998,000 | 1,523,442,265,000 | Lean | UTF-8 | Lean | false | false | 2,888 | 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
-/
section subtype
variables {α : Sort*} {β : α → Prop}
protected lemma subtype.eq' : ∀ {a1 a2 : {x // β x}}, a1.val = a2.val → a1 = a2
| ⟨x, h1⟩ ⟨.(x), h2⟩ rfl := rfl
... |
ff5856df06dd4e2218f2e29bc058dea054bb4ad5 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/group3.lean | b5f3fb351d95f785eb3dca24c52991808023daa1 | [
"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 | 8,217 | lean | -- Copyright (c) 2014 Jeremy Avigad. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Jeremy Avigad, Leonardo de Moura
-- algebra.group
-- =============
-- Various structures with 1, *, inv, including groups.
import logic.eq
import data.unit data.sigma data.prod... |
960c340a29f7116ec386987bdb277d92924052e3 | b2fe74b11b57d362c13326bc5651244f111fa6f4 | /src/ring_theory/power_series.lean | f4c535f8458c3a6dfeea2a35416bd14a38e895f1 | [
"Apache-2.0"
] | permissive | midfield/mathlib | c4db5fa898b5ac8f2f80ae0d00c95eb6f745f4c7 | 775edc615ecec631d65b6180dbcc7bc26c3abc26 | refs/heads/master | 1,675,330,551,921 | 1,608,304,514,000 | 1,608,304,514,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 58,925 | lean | /-
Copyright (c) 2019 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Kenny Lau
-/
import data.mv_polynomial
import ring_theory.ideal.operations
import ring_theory.multiplicity
import tactic.linarith
/-!
# Formal power series
This file ... |
b43949125d12c24f29383a90b59cd2f7cba08015 | 3618c6e11aa822fd542440674dfb9a7b9921dba0 | /scratch/inductive_step_functor.lean | 96a71cb42307b9b50213d808f0449e5a5168b8b3 | [] | no_license | ChrisHughes24/single_relation | 99ceedcc02d236ce46d6c65d72caa669857533c5 | 057e157a59de6d0e43b50fcb537d66792ec20450 | refs/heads/master | 1,683,652,062,698 | 1,683,360,089,000 | 1,683,360,089,000 | 279,346,432 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,963 | lean | import for_mathlib.coprod.free_group_subgroup
import .functor
import neat.cyclically_reduce
import neat.initial
import tactic
noncomputable theory
notation `C∞` := multiplicative ℤ
universe u
variables {ι : Type} [decidable_eq ι] (r : free_group ι) (T : set ι) [decidable_pred T]
open free_group P semidirect_produc... |
0418d0836c6e44021592687bf7227ccae2661efe | 1b8f093752ba748c5ca0083afef2959aaa7dace5 | /src/category_theory/presheaves/map.lean | 44ff9abfe6fad4d588bd67e4bd12ed512ce6a8e3 | [] | no_license | khoek/lean-category-theory | 7ec4cda9cc64a5a4ffeb84712ac7d020dbbba386 | 63dcb598e9270a3e8b56d1769eb4f825a177cd95 | refs/heads/master | 1,585,251,725,759 | 1,539,344,445,000 | 1,539,344,445,000 | 145,281,070 | 0 | 0 | null | 1,534,662,376,000 | 1,534,662,376,000 | null | UTF-8 | Lean | false | false | 2,284 | lean | import category_theory.presheaves
open category_theory
open category_theory.examples
universes u v
namespace category_theory.presheaves
/- `Presheaf` is a 2-functor CAT ⥤₂ CAT, but we're not going to prove all of that yet. -/
attribute [simp] set.preimage_id -- mathlib??
namespace Presheaf
section
variables {C :... |
f004d78f9ac3e4c6db12e56da48681b89f9cedd4 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/category_theory/abelian/generator.lean | e5ff33f877a57fb11dd87cc01234634acff8277f | [
"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 | 2,486 | lean | /-
Copyright (c) 2022 Markus Himmel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel
-/
import category_theory.abelian.subobject
import category_theory.limits.essentially_small
import category_theory.preadditive.injective
import category_theory.preadditive... |
fa82ce8e28a96ec95e75b9534315ec874207f124 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/measure_theory/decomposition/signed_hahn.lean | bda6013a8533d53e108f488f5014543aad26090e | [
"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 | 21,727 | 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.vector_measure
import order.symm_diff
/-!
# Hahn decomposition
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require... |
2c31c787bf6ccf91c778122ebbf53fbe1f816179 | fcacd3765104e09818f257e879a0862c54892a8b | /src/DSC.lean | 882efdcb77b02fe0e974d1f6e608dc546b416f57 | [] | no_license | jamesa9283/LeanFilesForTalks | e1bb15fc4c8fb16cf895a8b845f1f825319fcf75 | 534aa17e4266bdd07b87ba439f10d5b0cb068a1c | refs/heads/master | 1,688,221,637,338 | 1,628,787,502,000 | 1,628,787,502,000 | 395,387,329 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 753 | lean | import analysis.special_functions.trigonometric
open real
open_locale real
variables (x y : ℝ)
lemma sin_sub' : sin (x - y) = sin x * cos y - cos x * sin y :=
begin
sorry
end
/- `neg_mul_eq_neg_mul_symm` may be useful -/
lemma sin_sub_pi : sin (π - x) = sin x :=
begin
sorry
end
example : (sin x) ^ 2 + (cos x)^... |
7a1f2466d59571bd07dcf05e1f739777558faa4a | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/probability_theory/density.lean | b09b6df6e03c04672ba0212ba1aa7a5fe67fdcfc | [
"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 | 18,396 | 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.decomposition.radon_nikodym
import measure_theory.measure.lebesgue
/-!
# Probability density function
This file defines the probability density func... |
afe0c351d619d6f48df2f3c6524326111ff2d9e4 | 367134ba5a65885e863bdc4507601606690974c1 | /src/tactic/explode_widget.lean | 43aa0d319f008e2c0b9eb49669a16b3647d8286b | [
"Apache-2.0"
] | permissive | kodyvajjha/mathlib | 9bead00e90f68269a313f45f5561766cfd8d5cad | b98af5dd79e13a38d84438b850a2e8858ec21284 | refs/heads/master | 1,624,350,366,310 | 1,615,563,062,000 | 1,615,563,062,000 | 162,666,963 | 0 | 0 | Apache-2.0 | 1,545,367,651,000 | 1,545,367,651,000 | null | UTF-8 | Lean | false | false | 10,156 | lean | /-
Copyright (c) 2020 Minchao Wu. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Minchao Wu
-/
import tactic.explode
import tactic.interactive_expr
/-!
# `#explode_widget` command
Render a widget that displays an `#explode` proof, providing more
interactivity such as ... |
5abdf81a3b4e23e0dc6f0833496e06492460798a | 02005f45e00c7ecf2c8ca5db60251bd1e9c860b5 | /src/analysis/convex/extrema.lean | 80c4c355489b33e55969de3a86af3d2dccb9b577 | [
"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 | 5,430 | lean | /-
Copyright (c) 2020 Frédéric Dupuis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frédéric Dupuis
-/
import analysis.calculus.local_extr
import topology.algebra.affine
/-!
# Minima and maxima of convex functions
We show that if a function `f : E → β` is convex, ... |
3e4da524135daa8d854113c7e940fab1faee684e | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/457.lean | 607223105f211406eeac70610ed448124f906193 | [
"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 | 184 | lean | axiom f {α : Type} : List α → List α
theorem t (a : α) (as : List α) : f (a :: as) = as :=
sorry
theorem tt {a : α} {as : List α} : f (a :: as) = as :=
by simp [t _ as]
|
b8704ea52c02311584bc23c2c722b35d6373ee94 | d744d97b07fc1e61b0ebea192b2d624125898128 | /test/nat_util_test.lean | 1bf8aac3af41ae68c3987e66faa1303569dde7ab | [
"MIT"
] | permissive | parkersullivan/leanstuff | 019c757848dd8f5db185e6973969141aee6fef7c | 3da132c44d365ecd933de64fa04ba66b9e620683 | refs/heads/master | 1,599,036,040,845 | 1,573,316,625,000 | 1,573,316,625,000 | 219,181,711 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 78 | lean | import ..src.nat_util
#eval ltb 4 5
#eval ltb 4 4
#eval (max 4 5)
#print max |
56b9f76cdb0468bda0dd2a9b222c3ff54c664a05 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/lie/direct_sum.lean | fd1db3af14d08a6b8b3ea05860cd3c6659ab60d6 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 8,749 | lean | /-
Copyright (c) 2020 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import algebra.direct_sum.module
import algebra.lie.of_associative
import algebra.lie.submodule
import algebra.lie.basic
/-!
# Direct sums of Lie algebras and Lie modules
... |
2e69d3e5e746da72e32a8745aeee4ffbea65d513 | cbb1957fc3e28e502582c54cbce826d666350eda | /folklore/measure_theory.lean | 38e06702b736c7ae8f6c5a28c48e8153bfc3050f | [
"CC-BY-4.0"
] | permissive | andrejbauer/formalabstracts | 9040b172da080406448ad1b0260d550122dcad74 | a3b84fd90901ccf4b63eb9f95d4286a8775864d0 | refs/heads/master | 1,609,476,417,918 | 1,501,541,742,000 | 1,501,541,760,000 | 97,241,872 | 1 | 0 | null | 1,500,042,191,000 | 1,500,042,191,000 | null | UTF-8 | Lean | false | false | 6,125 | lean | import .real_axiom .analysis
open set classical real_axiom real_axiom.extended_real
local attribute [instance] prop_decidable
noncomputable theory
def countable_union {X : Type} (f : ℕ → set X) : set X :=
{x | ∃ n, x ∈ f n}
variables {X : Type} (σ : set (set X))
class sigma_algebra :=
(univ_mem : univ ∈ σ)... |
4907c28b15c017aa12032ac3a0b82c3417ccaf21 | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/tactic/fin_cases.lean | 3b492f4a78c867c9bcb14c8188c7411d8e8753f6 | [
"Apache-2.0"
] | permissive | waynemunro/mathlib | e3fd4ff49f4cb43d4a8ded59d17be407bc5ee552 | 065a70810b5480d584033f7bbf8e0409480c2118 | refs/heads/master | 1,693,417,182,397 | 1,634,644,781,000 | 1,634,644,781,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,060 | 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 data.fintype.basic
import tactic.norm_num
/-!
# Case bash
This file provides the tactic `fin_cases`. `fin_cases x` performs case analysis on `x`, that is
cre... |
72e96f415ca2b5b58ab24676de413be1d63c3ebf | 246309748072bf9f8da313401699689ebbecd94d | /src/topology/sheaves/stalks.lean | ded0ee9c385c87006772b9abab24459338411231 | [
"Apache-2.0"
] | permissive | YJMD/mathlib | b703a641e5f32a996f7842f7c0043bab2b462ee2 | 7310eab9fa8c1b1229dca42682f1fa6bfb7dbbf9 | refs/heads/master | 1,670,714,479,314 | 1,599,035,445,000 | 1,599,035,445,000 | 292,279,930 | 0 | 0 | null | 1,599,050,561,000 | 1,599,050,560,000 | null | UTF-8 | Lean | false | false | 5,136 | 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 topology.category.Top.open_nhds
import topology.sheaves.presheaf
import category_theory.limits.limits
import category_theory.limits.types
universes v u v' u'
... |
503a6d41ecb8ca06e078cee2c7abb18210321546 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/order/heyting/regular.lean | 321537b802e7604e9096d13952b500c0c377b0a6 | [
"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,703 | lean | /-
Copyright (c) 2022 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies
-/
import order.galois_connection
/-!
# Heyting regular elements
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding PR to mathli... |
d66ee0809def4e3e5b78db20ab3f2607eddc3eea | 205f0fc16279a69ea36e9fd158e3a97b06834ce2 | /src/13_Relations/less_than.lean | da9c1d3dec52b6db18e739a8cb05345945502b8c | [] | no_license | kevinsullivan/cs-dm-lean | b21d3ca1a9b2a0751ba13fcb4e7b258010a5d124 | a06a94e98be77170ca1df486c8189338b16cf6c6 | refs/heads/master | 1,585,948,743,595 | 1,544,339,346,000 | 1,544,339,346,000 | 155,570,767 | 1 | 3 | null | 1,541,540,372,000 | 1,540,995,993,000 | Lean | UTF-8 | Lean | false | false | 1,256 | lean |
#print nat.less_than_or_equal
example : 7 <= 19 :=
begin
apply nat.less_than_or_equal.step,
apply nat.less_than_or_equal.step,
apply nat.less_than_or_equal.step,
apply nat.less_than_or_equal.step,
apply nat.less_than_or_equal.step,
apply nat.less_than_or_equal.step,
apply nat.less_than_or_equal.step,
apply nat.less_t... |
1e430144d6895cd7a82265be380de83b1fe9d609 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /stage0/src/Lean/ParserCompiler.lean | ff3a52cc5c7c76a793f49fb89708df301db6cee9 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | cipher1024/lean4 | 6e1f98bb58e7a92b28f5364eb38a14c8d0aae393 | 69114d3b50806264ef35b57394391c3e738a9822 | refs/heads/master | 1,642,227,983,603 | 1,642,011,696,000 | 1,642,011,696,000 | 228,607,691 | 0 | 0 | Apache-2.0 | 1,576,584,269,000 | 1,576,584,268,000 | null | UTF-8 | Lean | false | false | 7,596 | lean | /-
Copyright (c) 2020 Sebastian Ullrich. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
-/
import Lean.Util.ReplaceExpr
import Lean.Meta.Basic
import Lean.Meta.ReduceEval
import Lean.Meta.WHNF
import Lean.ParserCompiler.Attribute
import Lean.Parser.Ex... |
e70f326c97e5d5fee4085ac70d9fb0d2e64bfc2c | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/category_theory/limits/comma.lean | 0fe5d10c21267a0e0d1242ab752aee1d24fd0c3b | [
"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 | 9,224 | lean | /-
Copyright (c) 2021 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta
-/
import category_theory.arrow
import category_theory.over
import category_theory.limits.punit
import category_theory.limits.preserves.basic
import category_theory.limits.c... |
48cd1229cb330472ec226aa5b683007d10516224 | b70031c8e2c5337b91d7e70f1e0c5f528f7b0e77 | /src/analysis/special_functions/pow.lean | 0ebfdc9d9974591bf66c6c4700b159ed383fd458 | [
"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 | 60,334 | 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, Sébastien Gouëzel,
Rémy Degenne
-/
import analysis.special_functions.trigonometric
import analysis.calculus.extend_deriv
... |
fb08d5145bfdce4fc901f2960d31aadc09911884 | b00eb947a9c4141624aa8919e94ce6dcd249ed70 | /tests/lean/Reformat/Input.lean | 8a0b4179669f55747a544f9efcb88c65f94e202f | [
"Apache-2.0"
] | permissive | gebner/lean4-old | a4129a041af2d4d12afb3a8d4deedabde727719b | ee51cdfaf63ee313c914d83264f91f414a0e3b6e | refs/heads/master | 1,683,628,606,745 | 1,622,651,300,000 | 1,622,654,405,000 | 142,608,821 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,645 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
universes u v w
@[inline] def id {α : Sort u} (a : α) : α := a
/-
The kernel definitional equality test (t =?= s) has special support for idDelta... |
78d1856235e534821b53f2bf7e1fccff4196e92d | 94e33a31faa76775069b071adea97e86e218a8ee | /src/analysis/special_functions/pow.lean | b086039e3f13ea07ef6514136792afe5bfceb506 | [
"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 | 85,217 | 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, Sébastien Gouëzel,
Rémy Degenne, David Loeffler
-/
import analysis.special_functions.complex.log
/-!
# Power function on ... |
db736a78142a348e44318db84bb6838d0a30eb19 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/combinatorics/additive/pluennecke_ruzsa.lean | 737dad50dfabf7fee51038286251b285371e7617 | [
"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,438 | lean | /-
Copyright (c) 2022 Yaël Dillies, George Shakan. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies, George Shakan
-/
import combinatorics.double_counting
import data.finset.pointwise
import data.rat.nnrat
/-!
# The Plünnecke-Ruzsa inequality
> THIS FILE I... |
45ceea94f4519b9c8c70fd7c58e914f029544b31 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/category_theory/monoidal/Mon_.lean | b45d2a711633f1d7319d786b7b9a318364abebdb | [
"Apache-2.0"
] | permissive | Lix0120/mathlib | 0020745240315ed0e517cbf32e738d8f9811dd80 | e14c37827456fc6707f31b4d1d16f1f3a3205e91 | refs/heads/master | 1,673,102,855,024 | 1,604,151,044,000 | 1,604,151,044,000 | 308,930,245 | 0 | 0 | Apache-2.0 | 1,604,164,710,000 | 1,604,163,547,000 | null | UTF-8 | Lean | false | false | 9,457 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.monoidal.discrete
import category_theory.monoidal.unitors
import category_theory.limits.shapes.terminal
import algebra.punit_instances
/-!
# T... |
14f4acd0db63daa06783e23c7e44b2126b1a1557 | 618003631150032a5676f229d13a079ac875ff77 | /src/set_theory/lists.lean | 130770569a9aa0ec0386cbb9c15c4358ad99a4f4 | [
"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,840 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
A computable model of hereditarily finite sets with atoms
(ZFA without infinity). This is useful for calculations in naive
set theory.
-/
import data.list.basic
import d... |
2f1675d1ddb471a7359b21eeecd73308702db10d | a45212b1526d532e6e83c44ddca6a05795113ddc | /test/monotonicity/test_cases.lean | bfc83964c0e42c052378de63c4a0f9b8f5d27726 | [
"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,855 | lean | import tactic.monotonicity.interactive
open list tactic tactic.interactive
meta class elaborable (α : Type) (β : out_param Type) :=
(elaborate : α → tactic β)
export elaborable (elaborate)
meta instance : elaborable pexpr expr :=
⟨ to_expr ⟩
meta instance elaborable_list {α α'} [elaborable α α'] : elaborable (li... |
a95b6e3a8f2534a3ff72226188034e6d7100df6c | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/polynomial/identities.lean | 7688643db419a706cc19f595ffbdaa4bd360228f | [] | 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,569 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Johannes Hölzl, Scott Morrison, Jens Wagemaker
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.polynomial.derivative
import Mathlib.PostP... |
98bfba4a71e2494b2aee3f1a6198729ec0ea77a3 | 0003047346476c031128723dfd16fe273c6bc605 | /src/number_theory/pell.lean | ead8cd508613539d1e4ec5ada264ac29eab058fe | [
"Apache-2.0"
] | permissive | ChandanKSingh/mathlib | d2bf4724ccc670bf24915c12c475748281d3fb73 | d60d1616958787ccb9842dc943534f90ea0bab64 | refs/heads/master | 1,588,238,823,679 | 1,552,867,469,000 | 1,552,867,469,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 64,253 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.int.basic data.nat.prime data.nat.modeq algebra.associated
/-- The ring of integers adjoined with a square root of `d`.
These have the form `a + b √d` ... |
80ceb10cdc23be37f740cfd129e12a146fda510d | c678b448c073e84fd00f1777ac278c36a7bb9a83 | /data/containers/utils/has_preordering.lean | e4f4fe9b0e4442f7ac5cef9c06a9026a609dc1b0 | [] | no_license | GaloisInc/lean-containers | 9d714d9a355381d66f4bf9b686589a85ce7afcc4 | c3359c6e439a611926168e2c86496d0d90a67f9b | refs/heads/master | 1,587,884,399,036 | 1,548,187,422,000 | 1,548,187,422,000 | 173,382,186 | 0 | 0 | null | 1,551,483,637,000 | 1,551,483,637,000 | null | UTF-8 | Lean | false | false | 4,764 | lean | /- This defines a preorder comparison function for comparing elements, and
the notation of a monotonic search predicate for searching within a ordered set.
-/
import .ordering
section
open ordering
/--
Define a class for tricotomy comparisons that define preorders.
-/
class has_preordering (α : Type _) :=
(cmp : α →... |
69b81964872b3fdcde80bf05470942adb73afa54 | da23b545e1653cafd4ab88b3a42b9115a0b1355f | /src/tidy/lib.lean | a1f6ead131d984bfbd2656a92ede7f384b84bf6d | [] | no_license | minchaowu/lean-tidy | 137f5058896e0e81dae84bf8d02b74101d21677a | 2d4c52d66cf07c59f8746e405ba861b4fa0e3835 | refs/heads/master | 1,585,283,406,120 | 1,535,094,033,000 | 1,535,094,033,000 | 145,945,792 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,184 | lean | import data.buffer
import data.pnat
import data.nat.basic
import data.num.bitwise
import tactic.norm_num
universe u
--FIXME the fact that we use this is really sad (ARRAYS DO IT)
def list.at {α : Type u} [inhabited α] (l : list α) (n : ℕ) : α :=
list.head $ option.to_list $ list.nth l n
private def list_set_at_aux {... |
4f0ad4790fba35b3babffdb42db0fb127776e600 | f1b175e38ffc5cc1c7c5551a72d0dbaf70786f83 | /data/equiv/basic.lean | 1d5433c1a4dd3dce53850278901b6d5630c7b628 | [
"Apache-2.0"
] | permissive | mjendrusch/mathlib | df3ae884dd5ce38c7edf452bcbfd3baf4e3a6214 | 5c209edb7eb616a26f64efe3500f2b1ba95b8d55 | refs/heads/master | 1,585,663,284,800 | 1,539,062,055,000 | 1,539,062,055,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 28,818 | 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... |
eeea5b983b39b2984fea538731af1f2a1ab83773 | d436468d80b739ba7e06843c4d0d2070e43448e5 | /src/topology/sheaves/stalks.lean | d66d54aec85ac762ace9f30e87f53e4a8784c687 | [
"Apache-2.0"
] | permissive | roro47/mathlib | 761fdc002aef92f77818f3fef06bf6ec6fc1a28e | 80aa7d52537571a2ca62a3fdf71c9533a09422cf | refs/heads/master | 1,599,656,410,625 | 1,573,649,488,000 | 1,573,649,488,000 | 221,452,951 | 0 | 0 | Apache-2.0 | 1,573,647,693,000 | 1,573,647,692,000 | null | UTF-8 | Lean | false | false | 3,742 | 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 topology.category.Top.open_nhds
import topology.sheaves.presheaf
import category_theory.limits.limits
universes v u v' u'
open category_theory
open Top
open ... |
1fb5623600cc60229eea95080eec3a0e7d70bca5 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /hott/algebra/ordered_ring.hlean | 2d29ac3bd4086ae72959eec0276266c6bfa0842b | [
"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 | 30,365 | hlean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
Here an "ordered_ring" is partially ordered ring, which is ordered with respect to both a weak
order and an associated strict order. Our numeric structures (int, rat, and... |
2d60ae806e6ecb97bb5b46a2993267047cf0ba47 | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/algebra/ordered_monoid_lemmas.lean | 00d7d3230af7e2c13fe7b63c25bc046c8621ca48 | [
"Apache-2.0"
] | permissive | hikari0108/mathlib | b7ea2b7350497ab1a0b87a09d093ecc025a50dfa | a9e7d333b0cfd45f13a20f7b96b7d52e19fa2901 | refs/heads/master | 1,690,483,608,260 | 1,631,541,580,000 | 1,631,541,580,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 27,366 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Mario Carneiro, Johannes Hölzl, Damiano Testa
-/
import algebra.covariant_and_contravariant
import order.basic
/-!
# Ordered monoids
This file devel... |
9f782fad5bcae80e2f9f5502e68ff69466626f0f | b7f22e51856f4989b970961f794f1c435f9b8f78 | /hott/homotopy/susp.hlean | 97c0f9c84969a95499c58a56d9c2b1f17c1789bc | [
"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 | 12,324 | hlean | /-
Copyright (c) 2015 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Ulrik Buchholtz
Declaration of suspension
-/
import hit.pushout types.pointed cubical.square .connectedness
open pushout unit eq equiv
definition susp (A : Type... |
575c226648fab5bb03bb06d6f00266fc7995e0d2 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/tactic/lint/type_classes.lean | 3911ad2e074aa7b8116353761e6a5651d21d067b | [
"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 | 15,587 | 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
/-!
# Linters about type classes
This file defines several linters checking the correct usage of type c... |
4a92e1f78de0692423994a888458ff15fdc26de7 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/multiset/nodup.lean | 73f744131d197cf626b37a421391c19094d115c6 | [
"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 | 9,873 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.multiset.bind
import data.multiset.powerset
import data.multiset.range
/-!
# The `nodup` predicate for multisets without duplicate elements.
-/
n... |
f947f5218b36b696655fe0fa955c68c2e46b9a64 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/topology/metric_space/isometry.lean | e983a6338b61ea1bd80d730d1138af8b27ed0ad0 | [] | 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 | 21,045 | lean | /-
Copyright (c) 2018 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Isometries of emetric and metric spaces
Authors: Sébastien Gouëzel
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.topology.bounded_continuous_function
import M... |
15d848ccb5e9383d0795c2cab4ee06ef97c750fd | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/topology/algebra/ordered/proj_Icc.lean | e5d30f94d6ab6dc9c40066d954812d2176aeee87 | [
"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,278 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov, Patrick Massot
-/
import topology.algebra.ordered.basic
import data.set.intervals.proj_Icc
/-!
# Projection onto a closed interval
In this file we prove that the pr... |
bbc24778c9fc79e5ae73d7f9f6dec97f1cf9960e | 367134ba5a65885e863bdc4507601606690974c1 | /src/linear_algebra/affine_space/affine_equiv.lean | 0664879cf330b7600b757d4c3ab148342fbf07b6 | [
"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,965 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Yury G. Kudryashov
-/
import linear_algebra.affine_space.affine_map
import algebra.invertible
/-!
# Affine equivalences
In this file we define `affine_equiv k P₁ P₂` (notation: `P... |
ee2b3707bb7a2a5609dc24800fdb7009ac79ec86 | 5fbbd711f9bfc21ee168f46a4be146603ece8835 | /lean/natural_number_game/inequality/04.lean | d18030c2a6c5817ce57b1bb88feb5caf3e489736 | [
"LicenseRef-scancode-warranty-disclaimer"
] | no_license | goedel-gang/maths | 22596f71e3fde9c088e59931f128a3b5efb73a2c | a20a6f6a8ce800427afd595c598a5ad43da1408d | refs/heads/master | 1,623,055,941,960 | 1,621,599,441,000 | 1,621,599,441,000 | 169,335,840 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 66 | lean | lemma zero_le (a : mynat) : 0 ≤ a :=
begin
use a,
ring,
end
|
06ee82d7a658f09131854297cd6678aa0c4777de | 63abd62053d479eae5abf4951554e1064a4c45b4 | /archive/100-theorems-list/73_ascending_descending_sequences.lean | 35d8df77cd006513f12ffd2904133bb6a42dd2c3 | [
"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 | 8,126 | lean | /-
Copyright (c) 2020 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta
-/
import tactic.basic
import data.fintype.basic
/-!
# Erdős–Szekeres theorem
This file proves Theorem 73 from the [100 Theorems List](https://www.cs.ru.nl/~freek/100/), a... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.