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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
16911c04684fbc82ed35886a9ee9e4495093405f | bdb33f8b7ea65f7705fc342a178508e2722eb851 | /algebra/group_power.lean | 18a5f65da93aaef2da776409c4db95fa9e21decd | [
"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 | 16,371 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Robert Y. Lewis
The power operation on monoids and groups. We separate this from group, because it depends on
nat, which in turn depends on other parts of algebra.
We h... |
7a04ec5a7fc1a7c3d373910dba8a672f5de6fcc4 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/category/Module/projective.lean | 4ae2bb3bf189842a73e239fdc3a6907c912f9152 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 2,162 | lean | /-
Copyright (c) 2020 Markus Himmel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel, Scott Morrison
-/
import algebra.category.Module.epi_mono
import algebra.module.projective
import category_theory.preadditive.projective
import linear_algebra.finsupp_vec... |
a69d6f13edd8048d4ffeedd401468165e3118a32 | 82b86ba2ae0d5aed0f01f49c46db5afec0eb2bd7 | /src/Lean/Attributes.lean | d43cb89a0b5de2564e4c802c766a925b5820aab6 | [
"Apache-2.0"
] | permissive | banksonian/lean4 | 3a2e6b0f1eb63aa56ff95b8d07b2f851072d54dc | 78da6b3aa2840693eea354a41e89fc5b212a5011 | refs/heads/master | 1,673,703,624,165 | 1,605,123,551,000 | 1,605,123,551,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 17,398 | 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.Syntax
import Lean.CoreM
import Lean.ResolveName
namespace Lean
inductive AttributeApplicationTime
| afterTypeChecking | afterCompilation | ... |
ee89c276ef4e51af0472f6954efb8ffc1db9f9a3 | b522075d31b564daeb3347a10eb9bb777ee93943 | /map.lean | da94f3174b1a4eccdfd9f85d77cb95321183e4ae | [] | no_license | truonghoangle/manifolds | e6c2534dd46579f56ba99a48e2eb7ce51640e7c0 | 9c0d731a480e88758180b31ce7c3b371771d426b | refs/heads/master | 1,638,501,090,139 | 1,557,991,948,000 | 1,557,991,948,000 | 185,779,631 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,051 | lean | /-
Copyright (c) 2019 Joe Cool. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Hoang Le Truong.
-/
import algebra.module data.pfun
universes u v w
variables {α : Type u} {β : Type v} {γ : Type w}
local attribute [instance] classical.prop_decidable
namespac... |
058dd6b3f450072a3dff2f1aa95a6011b66dc235 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/module/dedekind_domain.lean | c7e533928a18dcfccf021509a3e3d4575381a5a4 | [
"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 | 3,219 | lean | /-
Copyright (c) 2022 Pierre-Alexandre Bazin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Pierre-Alexandre Bazin
-/
import algebra.module.torsion
import ring_theory.dedekind_domain.ideal
/-!
# Modules over a Dedekind domain
Over a Dedekind domain, a `I`-torsion mo... |
0304bbdc70d7abad33145b3181af8b0f677c1dc3 | b3fced0f3ff82d577384fe81653e47df68bb2fa1 | /src/data/zmod/basic.lean | d03116ada506116dd990d2dce767123a606bf9c4 | [
"Apache-2.0"
] | permissive | ratmice/mathlib | 93b251ef5df08b6fd55074650ff47fdcc41a4c75 | 3a948a6a4cd5968d60e15ed914b1ad2f4423af8d | refs/heads/master | 1,599,240,104,318 | 1,572,981,183,000 | 1,572,981,183,000 | 219,830,178 | 0 | 0 | Apache-2.0 | 1,572,980,897,000 | 1,572,980,896,000 | null | UTF-8 | Lean | false | false | 18,607 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Chris Hughes
# zmod and zmodp
Definition of the integers mod n, and the field structure on the integers mod p.
There are two types defined, `zmod n`, which is for integers modulo a pos... |
63e6fa6f1fae9ef16950b5f522396c756cc0b219 | c3f2fcd060adfa2ca29f924839d2d925e8f2c685 | /library/data/empty.lean | 96bd1495dfc7fb2dd8b89c32bc58e9efe6d2603d | [
"Apache-2.0"
] | permissive | respu/lean | 6582d19a2f2838a28ecd2b3c6f81c32d07b5341d | 8c76419c60b63d0d9f7bc04ebb0b99812d0ec654 | refs/heads/master | 1,610,882,451,231 | 1,427,747,084,000 | 1,427,747,429,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,385 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: data.empty
Author: Jeremy Avigad, Floris van Doorn
-/
import logic.cast logic.subsingleton
namespace empty
protected theorem elim (A : Type) (H : empty) : A :=
empty.rec (... |
e0228ea3038faabdcfb6a51643944aec6ee2e5be | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/lean/run/ind_cmd_bug.lean | fd3d94da3236318806831d364196a3af14649eab | [
"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 | 83 | lean | structure D (α : Type) :=
(a : α)
inductive S
| mk₁ (v : S)
| mk₂ (v : D S)
|
3e37561e05b673a439eb96fa6ba2987b119e063d | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/data/ordering/default_auto.lean | 82cb57ffa835f92e43f9aba6aaedd916ab15e748 | [] | 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 | 317 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.data.ordering.basic
import Mathlib.Lean3Lib.init.data.ordering.lemmas
namespace Mathlib
end Mathlib |
6765d489c3d597d0e348865f3f5a8f419dfe5cc6 | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/tactic/norm_num.lean | 42d5e146f6960f30b9d610948d77da9a1a9b1d2f | [
"Apache-2.0"
] | permissive | abentkamp/mathlib | d9a75d291ec09f4637b0f30cc3880ffb07549ee5 | 5360e476391508e092b5a1e5210bd0ed22dc0755 | refs/heads/master | 1,682,382,954,948 | 1,622,106,077,000 | 1,622,106,077,000 | 149,285,665 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 63,668 | lean | /-
Copyright (c) 2017 Simon Hudon All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon, Mario Carneiro
-/
import data.rat.cast
import data.rat.meta_defs
/-!
# `norm_num`
Evaluating arithmetic expressions including `*`, `+`, `-`, `^`, `≤`.
-/
universes u v w
n... |
725d29df7a4aa0404c46fd1698e753d50d38e277 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/category_theory/sites/sheaf.lean | c2983cbe2a316c9978fb10958bed4359c9ebd246 | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 22,613 | lean | /-
Copyright (c) 2020 Kevin Buzzard, Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Buzzard, Bhavik Mehta
-/
import category_theory.limits.preserves.shapes.equalizers
import category_theory.limits.preserves.shapes.products
import category_theory.li... |
8c01879db5126e6037ae28c311403e5c6580b249 | f083c4ed5d443659f3ed9b43b1ca5bb037ddeb58 | /linear_algebra/linear_map_module.lean | eed9ee082c44bada73819ca30f0bf5b47864d6e0 | [
"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 | 8,746 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Kenny Lau
Type of linear functions
-/
import linear_algebra.basic
linear_algebra.prod_module
linear_algebra.quotient_module
linear_algebra.subtype_module
noncomp... |
bff225c0529f2f0b7e059029814ca9f2efb28eb1 | ecad13897fdb44984cf1968424224d1750040236 | /lean/lean/examples/example01.lean | f2cff77c41def19414ff3620d80721067b1ca04f | [] | no_license | MetaBorgCube/sdf3-demo | 4899159b1cfb0a95ae3af325035bbba8a1255477 | e831606d5b404eba75b087916a1162923143b98a | refs/heads/master | 1,609,472,086,310 | 1,553,380,857,000 | 1,553,380,857,000 | 59,577,395 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 25 | lean | (a : A) -> (z : S) -> x
|
d10f9e0376bd3c193cd770ba4b6a3634fb626a23 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/algebra/module/linear_map.lean | 91dc7de0d87514f36b25d38fc126f2c4317b6bc8 | [
"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 | 32,874 | 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.group.hom
import algebra.module.basic
import algebra.mod... |
ac262c4beed633abb46affbb5b16c6a35b695eab | 4950bf76e5ae40ba9f8491647d0b6f228ddce173 | /src/algebra/group_with_zero/basic.lean | 677b487ae8f31faab06e2f974e89f2398ac2574c | [
"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 | 35,430 | 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 logic.nontrivial
import algebra.group.units_hom
import algebra.group.inj_surj
import algebra.group_with_zero.defs
/-!
# Groups with an adjoined zero element
... |
d6664bb335af5999e76a95a8041ad556f8cca919 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/ring_theory/polynomial/hermite/gaussian.lean | 307939d32d9fa8f3ecfa82c74bf6269d68f217df | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 2,559 | lean | /-
Copyright (c) 2023 Luke Mantle. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Luke Mantle, Jake Levinson
-/
import ring_theory.polynomial.hermite.basic
import analysis.calculus.deriv.pow
import analysis.calculus.deriv.add
import analysis.special_functions.exp
impor... |
f0bcc04277d69d1a3c1f9941fc3d339a326e0d19 | dc06cc9775d64d571bf4778459ec6fde1f344116 | /src/data/finsupp.lean | 0beea7962687a4fe6d3aa5692e6d1af25afbba1a | [
"Apache-2.0"
] | permissive | mgubi/mathlib | 8c1ea39035776ad52cf189a7af8cc0eee7dea373 | 7c09ed5eec8434176fbc493e0115555ccc4c8f99 | refs/heads/master | 1,642,222,572,514 | 1,563,782,424,000 | 1,563,782,424,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 62,351 | 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
Type of functions with finite support.
Functions with finite support provide the basis for the following concrete instances:
* ℕ →₀ α: Polynomials (where α is a ring... |
8881780ccc0159fc2cafd8cde658f24b480e99e3 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/category_theory/limits/preserves/filtered.lean | 6e015b1640b350794dce25d5202ee99b0362ecf6 | [
"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 | 2,667 | lean | /-
Copyright (c) 2021 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Justus Springer
-/
import category_theory.limits.preserves.basic
import category_theory.filtered
import category_theory.limits.types
/-!
# Preservation of filtered col... |
e84e8e97b169fdea39b92eddb04c05c5f0baa70a | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/ns2.lean | d1d55132e206d666783b2739e994d2ec3fa8892a | [
"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 | 521 | lean | definition foo.id {A : Type} (a : A) := a
constant foo.T : Type.{1}
#check foo.id
#check foo.T
inductive foo.v.I | unit : foo.v.I
#check foo.v.I
#check foo.v.I.unit
namespace foo
#check id
#check T
#check v.I
end foo
namespace bla
definition vvv.pr {A : Type} (a b : A) := a
#check vvv.pr
end bla
#check bl... |
157e2fdbec2ad25be5a9d5f66f53dedb9b687072 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/order/filter/archimedean_auto.lean | f0844c8542ddca236f2f66ce6ddac0f5b14ebdf9 | [] | 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,316 | lean | /-
Copyright (c) 2019 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Yury Kudryashov
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.order.filter.at_top_bot
import Mathlib.algebra.archimedean
import Mathlib.... |
c60f295a1505670c584b82a3bef311e2f533fd34 | 649957717d58c43b5d8d200da34bf374293fe739 | /src/set_theory/cardinal.lean | 2fd58ffa9f22c36fd0e70c9d4e6f64890bd3bb32 | [
"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 | 40,358 | 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, Mario Carneiro
Cardinal arithmetic.
Cardinals are represented as quotient over equinumerous types.
-/
import data.set.countable data.quot logic.function set_theory.sc... |
73d6bff56aa3dd7b9f0f0885ec9effc52a12bdbf | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/analysis/specific_limits.lean | 91dbda02a6cf58429f89695f89139a865571d403 | [
"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 | 29,581 | 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... |
50ec0fe78bf7617510fa783d8ef585917bf2087d | 534c92d7322a8676cfd1583e26f5946134561b54 | /src/Exercises/01_Propositions/Q0108/S0008.lean | 3d7f921a9f25550501011478b2262c3bfa6ce776 | [
"Apache-2.0"
] | permissive | kbuzzard/mathematics-in-lean | 53f387174f04d6077f434e27c407aee9425837f7 | 3fad7bb7e888dabef94921101af8671b78a4304a | refs/heads/master | 1,586,812,457,439 | 1,546,893,744,000 | 1,546,893,744,000 | 163,450,734 | 8 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 107 | lean | theorem not_not (P : Prop) : P → ¬ (¬ P) :=
begin
intro HP,
intro HnP,
apply HnP,
exact HP
end
|
353312e46d3e1818645b4e913327eacfb94a51a8 | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /11_Tactic-Style_Proofs.org.24.lean | 7eca1a513340b862e23e884d98abbc07f46ff3eb | [] | 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 | 557 | lean | import standard
example (p q r : Prop) : p ∧ (q ∨ r) ↔ (p ∧ q) ∨ (p ∧ r) :=
begin
apply iff.intro,
intro H,
apply (or.elim (and.elim_right H)),
intro Hq,
show (p ∧ q) ∨ (p ∧ r),
from or.inl (and.intro (and.elim_left H) Hq),
intro Hr,
show (p ∧ q) ∨ (p ∧ r),
from or.inr (and.intro (and.elim_left H) Hr),
intro H,
apply (... |
e94f768b2e50ace7df68260e01a8b0c2978fff52 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/topology/algebra/nonarchimedean/basic.lean | 1ee2fdc6957f250f30b29c74c3d02b7bf8d7ca75 | [
"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 | 5,851 | lean | /-
Copyright (c) 2021 Ashwin Iyengar. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Buzzard, Johan Commelin, Ashwin Iyengar, Patrick Massot
-/
import topology.algebra.ring
import topology.algebra.open_subgroup
import data.set.basic
import group_theory.subgroup.b... |
8747ea7878b53cbf14ef167c4dd22fbc244909eb | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/analysis/normed_space/pi_Lp.lean | 12b33f1a0c6db831e4162870f637a12db7137e70 | [
"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 | 34,920 | 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, Jireh Loreaux
-/
import analysis.mean_inequalities
import data.fintype.order
/-!
# `L^p` distance on finite products of metric spaces
Given finitely many metric ... |
23a03a80789b1f57e4d937f49162549e4a7ae153 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/elabissues/namespace_vs_prefix.lean | bbc731cf12242e6f9d25abbd63c9187cdfde8283 | [
"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 | 725 | lean | inductive Foo : Type
| mk : Nat → Foo
namespace Foo
def worksInNamespace : Foo → Nat
| mk n => n --works
end Foo
-- The following fails, because `namespace Foo` is not open,
-- despite the `Foo.` prefix in the name.
def Foo.failsWithPrefix : Foo → Nat
| mk n => n -- error: invalid application, function expected
def ... |
a2815fde28e506d7439362ae88bb44e071f1633c | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/ring_theory/localization/num_denom.lean | db61a20f6d8218a470f7cd02e5e9c3a9870d3f4b | [
"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 | 3,968 | 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, Johan Commelin, Amelia Livingston, Anne Baanen
-/
import ring_theory.localization.fraction_ring
import ring_theory.localization.integer
import ring_theory.unique_... |
6b4ef4ac6c7bfa2cba9c7dfc7aa7ca0f8daaa942 | 7c92a46ce39266c13607ecdef7f228688f237182 | /src/valuation/with_zero_topology.lean | eaa8e08288875f98da31ea3f089700e15f0a7ecc | [
"Apache-2.0"
] | permissive | asym57/lean-perfectoid-spaces | 3217d01f6ddc0d13e9fb68651749469750420767 | 359187b429f254a946218af4411d45f08705c83e | refs/heads/master | 1,609,457,937,251 | 1,577,542,616,000 | 1,577,542,675,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 15,173 | lean | import topology.algebra.ordered
import for_mathlib.filter
import for_mathlib.topology
import valuation.linear_ordered_comm_group_with_zero
/-!
# The topology on linearly ordered commutative groups with zero
Let Γ₀ be a linearly ordered commutative group to which we have adjoined a zero element.
Then Γ₀ may naturall... |
5ab457375d69db6b5ea4e0ad78fa47fb878a8388 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/linear_algebra/linear_pmap_auto.lean | b099747be3d1a10f1213a2d8a56d4fefe0928f3e | [] | 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 | 17,409 | 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.linear_algebra.basic
import Mathlib.PostPort
universes u v w l u_1 u_2 u_3 u_4
namespac... |
968461e95245b54cf2bae3171aa7485d61c2010f | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/analysis/special_functions/bernstein.lean | b30ec1e65c458d21dae9670e593ad74d482fd024 | [
"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 | 12,890 | 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 ring_theory.polynomial.bernstein
import topology.continuous_function.polynomial
/-!
# Bernstein approximations and Weierstrass' theorem
We prove that the Ber... |
95e3081833fef3da57abc3ff16203a4324975e84 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/analysis/calculus/specific_functions.lean | d55ef2521e7f690f64502e9ec67901f0775d100a | [
"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 | 23,005 | 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, Floris van Doorn
-/
import analysis.calculus.iterated_deriv
import analysis.inner_product_space.euclidean_dist
import measure_theory.function.locally_integrable
i... |
ab048866e3fb7b3d0f74e5ddb6aef00b069db19d | 94e33a31faa76775069b071adea97e86e218a8ee | /test/json.lean | fcaf548e4fb4b5b86ce56513d45e79411770f5fc | [
"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 | 2,467 | lean | import data.json
import data.int.basic
run_cmd do
let j := json.of_int 2,
z ← of_json native.float j,
guard (z = 2)
run_cmd do
j ← json.parse "2.0",
tactic.success_if_fail_with_msg (of_json ℤ j) "number must be integral"
run_cmd do
let j := json.of_int (-1),
tactic.success_if_fail_with_msg (of_json ℕ j... |
d1b7e9b3354dafbd00f8a7d527a274da789faa19 | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/category_theory/functor.lean | fdbe2b16c8862eadda8be6a1573aa9aa139005d5 | [
"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 | 3,635 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Tim Baumann, Stephen Morgan, Scott Morrison
Defines a functor between categories.
(As it is a 'bundled' object rather than the `is_functorial` typeclass parametrised
by the underlyin... |
128275e2344bda284923d550d6df2159574493be | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/analysis/calculus/local_extr.lean | efdf9cb714937ddd3ce2486b0f1397314bba37da | [
"Apache-2.0"
] | permissive | lacker/mathlib | f2439c743c4f8eb413ec589430c82d0f73b2d539 | ddf7563ac69d42cfa4a1bfe41db1fed521bd795f | refs/heads/master | 1,671,948,326,773 | 1,601,479,268,000 | 1,601,479,268,000 | 298,686,743 | 0 | 0 | Apache-2.0 | 1,601,070,794,000 | 1,601,070,794,000 | null | UTF-8 | Lean | false | false | 16,310 | lean | /-
Copyright (c) 2019 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import topology.local_extr
import analysis.calculus.deriv
/-!
# Local extrema of smooth functions
## Main definitions
In a real normed space `E` we define `pos_t... |
31ec7fc697c3f5bea780c9aa1b0d5358c034d8d8 | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/category_theory/monad/equiv_mon.lean | 267f30b02f34f485e307cd26391461e0f7f4bc24 | [
"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 | 3,285 | lean | /-
Copyright (c) 2020 Adam Topaz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Adam Topaz
-/
import category_theory.monad.bundled
import category_theory.monoidal.End
import category_theory.monoidal.internal
import category_theory.category.Cat
/-!
# The equivalence ... |
79204d8b2b6b21566d6d7d73d630901074cd7f38 | 0b3933727d99a2f351f5dbe6e24716bb786a6649 | /src/sesh/ren_sub.lean | 118fd55653b3b75e194ce0db4945cbd9dbf2b995 | [] | no_license | Vtec234/lean-sesh | 1e770858215279f65aba92b4782b483ab4f09353 | d11d7bb0599406e27d3a4d26242aec13d639ecf7 | refs/heads/master | 1,587,497,515,696 | 1,558,362,223,000 | 1,558,362,223,000 | 169,809,439 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,252 | lean | /- Introduces renaming and substitution on terms and values. -/
import sesh.term
/- The type of renaming functions which transport indices
from one precontext to another. -/
def ren_fn (γ δ) := Π (A: tp), γ ∋ A → δ ∋ A
namespace ren_fn
open debrujin_idx
/- A renaming function which moves every index/variable up ... |
d58b261aeb90cb33e4bdeb055df5cc59ed2d7965 | c062f1c97fdef9ac746f08754e7d766fd6789aa9 | /algebra/lattice/basic.lean | 41469946a55028971c061a3514fc3e3cb57bc003 | [] | no_license | emberian/library_dev | 00c7a985b21bdebe912f4127a363f2874e1e7555 | f3abd7db0238edc18a397540e361a1da2f51503c | refs/heads/master | 1,624,153,474,804 | 1,490,147,180,000 | 1,490,147,180,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,711 | 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
Defines the inf/sup (semi)-lattice with optionally top/bot type class hierarchy.
-/
import ..order
universes u v w
/- TODO: automatic construction of dual definition... |
29fac275c9bbda9aef92d201015cc401cb1871eb | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/group_power/basic.lean | 281fa0372ef7eed776e90808c9faf0db9f8e87cc | [
"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,048 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Robert Y. Lewis
-/
import algebra.divisibility.basic
import algebra.group.commute
import algebra.group.type_tags
/-!
# Power operations on monoids and groups
> THIS FIL... |
cc3b72972b58b9a71b3f74593f998c0d3c031065 | 95dcf8dea2baf2b4b0a60d438f27c35ae3dd3990 | /src/group_theory/submonoid.lean | 3e180374c873a7b05516c266f90e0790a44bb8ba | [
"Apache-2.0"
] | permissive | uniformity1/mathlib | 829341bad9dfa6d6be9adaacb8086a8a492e85a4 | dd0e9bd8f2e5ec267f68e72336f6973311909105 | refs/heads/master | 1,588,592,015,670 | 1,554,219,842,000 | 1,554,219,842,000 | 179,110,702 | 0 | 0 | Apache-2.0 | 1,554,220,076,000 | 1,554,220,076,000 | null | UTF-8 | Lean | false | false | 10,303 | 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
-/
import algebra.big_operators
import data.finset
import tactic.subtype_instance
variables {α : Type*} [monoid α] {s : set α... |
26bed9618b8dc7dde1d73b2b1005bd59ebdbd423 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/structInstError.lean | efe13498db8bdb6eaa34c462743f9ba33327fd65 | [
"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 | 109 | lean | structure Foo where
x : Nat
b : Bool
#check { x := 10, b := true }
#check { x := 10, b := true : Foo }
|
6d65d72fa50fc65ceaac2a3fc3fdf74002c0bc24 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/geometry/euclidean/circumcenter.lean | bb4fbc109bac0e3fbed23878c184ac388177734b | [
"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 | 40,609 | lean | /-
Copyright (c) 2020 Joseph Myers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Joseph Myers
-/
import geometry.euclidean.basic
import linear_algebra.affine_space.finite_dimensional
import tactic.derive_fintype
/-!
# Circumcenter and circumradius
This file proves ... |
c77ee5f667ac1746c3364762ec0356da503480cc | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/tactic/lint/type_classes.lean | 586d6810d95f430e5ee958a82bb2ee8d8e2b03ce | [
"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 | 23,251 | 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... |
f4b1223d3ba6355aba9a876dd675a56e2712765d | 130c49f47783503e462c16b2eff31933442be6ff | /stage0/src/Init/Prelude.lean | db8c0b245d26d0b31c0ef19e3996047581eeaeeb | [
"Apache-2.0"
] | permissive | Hazel-Brown/lean4 | 8aa5860e282435ffc30dcdfccd34006c59d1d39c | 79e6732fc6bbf5af831b76f310f9c488d44e7a16 | refs/heads/master | 1,689,218,208,951 | 1,629,736,869,000 | 1,629,736,896,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 76,266 | 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
universe u v w
@[inline] def id {α : Sort u} (a : α) : α := a
/- `idRhs` is an auxiliary declaration used to implement "smart unfolding". It is u... |
6d3dbefa014aad195cd44bd365d2bf9c663a3859 | 8cb37a089cdb4af3af9d8bf1002b417e407a8e9e | /library/init/data/bool/basic.lean | 0595c7acffbef30a36a67ec9096ef3e55add1f2e | [
"Apache-2.0"
] | permissive | kbuzzard/lean | ae3c3db4bb462d750dbf7419b28bafb3ec983ef7 | ed1788fd674bb8991acffc8fca585ec746711928 | refs/heads/master | 1,620,983,366,617 | 1,618,937,600,000 | 1,618,937,600,000 | 359,886,396 | 1 | 0 | Apache-2.0 | 1,618,936,987,000 | 1,618,936,987,000 | null | UTF-8 | Lean | false | false | 782 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
prelude
import init.core
/-!
# Boolean operations
-/
/-- `cond b x y` is `x` if `b = tt` and `y` otherwise. -/
@[inline] def {u} cond {a : Type u} : bool → ... |
1f8b7f9d39be34f7af023e63704caac15bdc3125 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/combinatorics/simple_graph/matching.lean | 9575ac48b595404679a62ae90ccea0fd1ca6b30f | [
"Apache-2.0"
] | permissive | jjgarzella/mathlib | 96a345378c4e0bf26cf604aed84f90329e4896a2 | 395d8716c3ad03747059d482090e2bb97db612c8 | refs/heads/master | 1,686,480,124,379 | 1,625,163,323,000 | 1,625,163,323,000 | 281,190,421 | 2 | 0 | Apache-2.0 | 1,595,268,170,000 | 1,595,268,169,000 | null | UTF-8 | Lean | false | false | 2,010 | lean | /-
Copyright (c) 2020 Alena Gusakov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Alena Gusakov
-/
import data.fintype.basic
import data.sym2
import combinatorics.simple_graph.basic
/-!
# Matchings
## Main definitions
* a `matching` on a simple graph is a subset o... |
72f8a2e1694cef35a3b343d164a2353437f40a1f | b9a81ebb9de684db509231c4469a7d2c88915808 | /src/super/cdcl_solver.lean | a6344289e251f54a426fb6ba0fc6bd2cd2c79eae | [] | no_license | leanprover/super | 3dd81ce8d9ac3cba20bce55e84833fadb2f5716e | 47b107b4cec8f3b41d72daba9cbda2f9d54025de | refs/heads/master | 1,678,482,996,979 | 1,676,526,367,000 | 1,676,526,367,000 | 92,215,900 | 12 | 6 | null | 1,513,327,539,000 | 1,495,570,640,000 | Lean | UTF-8 | Lean | false | false | 14,235 | lean | /-
Copyright (c) 2017 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner
-/
import .clause
open tactic expr monad super native
namespace cdcl
@[reducible] meta def prop_var := expr
@[reducible] meta def proof_term := expr
@[reducible] meta de... |
f938a3f2124d089f18913df0e0f8173d5409cd68 | 9cba98daa30c0804090f963f9024147a50292fa0 | /old/metrology/axis_orientation.lean | e524314504fe85073300435fab3b33994fc9e0b1 | [] | no_license | kevinsullivan/phys | dcb192f7b3033797541b980f0b4a7e75d84cea1a | ebc2df3779d3605ff7a9b47eeda25c2a551e011f | refs/heads/master | 1,637,490,575,500 | 1,629,899,064,000 | 1,629,899,064,000 | 168,012,884 | 0 | 3 | null | 1,629,644,436,000 | 1,548,699,832,000 | Lean | UTF-8 | Lean | false | false | 2,085 | lean | import ...math.affine.affine_euclidean_space_lib
open euclidean
open eucl_lib
open aff_lib
namespace orientation
structure AxisOrientation (dim : ℕ) :=
(or : affine_euclidean_orientation dim)
/-
In relation to a body the standard is:
x forward
y left
z up
For short-range Cartesian representations of geographic l... |
ac89c71cc0d3f73764aabe33a2b90fef44584546 | f3a5af2927397cf346ec0e24312bfff077f00425 | /src/game/world10/level8.lean | 8abc66e27c3af4fd6e298018d156ffb4621058a9 | [
"Apache-2.0"
] | permissive | ImperialCollegeLondon/natural_number_game | 05c39e1586408cfb563d1a12e1085a90726ab655 | f29b6c2884299fc63fdfc81ae5d7daaa3219f9fd | refs/heads/master | 1,688,570,964,990 | 1,636,908,242,000 | 1,636,908,242,000 | 195,403,790 | 277 | 84 | Apache-2.0 | 1,694,547,955,000 | 1,562,328,792,000 | Lean | UTF-8 | Lean | false | false | 440 | lean | import game.world10.level7 -- hide
namespace mynat -- hide
/-
# Inequality world.
## Level 8: `succ_le_succ`
Another straightforward one.
-/
/- Lemma
For all naturals $a$ and $b$, if $a\le b$, then $\operatorname{succ}(a)\le\operatorname{succ}(b)$.
-/
lemma succ_le_succ (a b : mynat) (h : a ≤ b) : succ a ≤ succ... |
617ff26f950a2b4b97c9881d1b511ffab4c2f1b1 | b70031c8e2c5337b91d7e70f1e0c5f528f7b0e77 | /src/group_theory/subgroup.lean | 43c7d142a2954d85bb399f7721167e859306a915 | [
"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 | 47,930 | lean | /-
Copyright (c) 2020 Kexing Ying. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kexing Ying
-/
import group_theory.submonoid
import algebra.group.conj
/-!
# Subgroups
This file defines multiplicative and additive subgroups as an extension of submonoids, in a bundle... |
3db27c798e01e95dc8a32f2de3136545c2e048b5 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Util/HasConstCache.lean | 744079153b013d017ee41123b91a9142d98415cf | [
"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,501 | 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.Expr
namespace Lean
structure HasConstCache (declName : Name) where
cache : HashMapImp Expr Bool := mkHashMapImp
unsafe def HasConstCache.c... |
41508a1695b9bc66dd29fd456bb587c02a71fa25 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /library/data/equiv.lean | f7a5ac8d4e7e2ca8904bebb3b8f0b10f9d2b7ff0 | [
"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 | 16,758 | 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
In the standard library we cannot assume the univalence axiom.
We say two types are equivalent if they are isomorphic.
Two equivalent types have the same car... |
ce898f52d8448b4b72632e37c9eea06e973b7010 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /library/theories/analysis/real_deriv.lean | 14e439a6fd89c4c768863afec61158efeb4f5427 | [
"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 | 1,988 | lean | /-
Copyright (c) 2016 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Robert Y. Lewis
Derivatives on ℝ
-/
import .bounded_linear_operator
open real nat classical topology analysis set
noncomputable theory
namespace real
-- make instance of const mul b... |
4e7052244e9e10c34282c0d4916b9df8139a3538 | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/analysis/special_functions/polynomials.lean | 64f772afc053cd7a25b55d752c60e0712a9efbb9 | [
"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 | 10,715 | lean | /-
Copyright (c) 2020 Anatole Dedecker. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anatole Dedecker, Devon Tuma
-/
import analysis.asymptotics.asymptotic_equivalent
import analysis.asymptotics.specific_asymptotics
import data.polynomial.ring_division
/-!
# Limits ... |
d3eb035832424644ff41e37ba5454efcc9088fab | 2385ce0e3b60d8dbea33dd439902a2070cca7a24 | /tests/lean/run/1797.lean | 12a9338e022fe57613611fde8296ed2aa5f54472 | [
"Apache-2.0"
] | permissive | TehMillhouse/lean | 68d6fdd2fb11a6c65bc28dec308d70f04dad38b4 | 6bbf2fbd8912617e5a973575bab8c383c9c268a1 | refs/heads/master | 1,620,830,893,339 | 1,515,592,479,000 | 1,515,592,997,000 | 116,964,828 | 0 | 0 | null | 1,515,592,734,000 | 1,515,592,734,000 | null | UTF-8 | Lean | false | false | 144 | lean | example (n : nat) : true :=
begin
cases h : n with m,
{ guard_hyp h := n = nat.zero, sorry },
{ guard_hyp h := n = nat.succ m, sorry}
end
|
c5269f342d69a30537ec840b26b8b1c4aeb21132 | 86f6f4f8d827a196a32bfc646234b73328aeb306 | /examples/basics/unnamed_349.lean | 09f4710429e345ee5d289449e9443d181297c1f1 | [] | no_license | jamescheuk91/mathematics_in_lean | 09f1f87d2b0dce53464ff0cbe592c568ff59cf5e | 4452499264e2975bca2f42565c0925506ba5dda3 | refs/heads/master | 1,679,716,410,967 | 1,613,957,947,000 | 1,613,957,947,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 320 | lean | import data.real.basic
variables a b : ℝ
-- BEGIN
example : (a + b) * (a + b) = a * a + 2 * (a * b) + b * b :=
calc
(a + b) * (a + b)
= a * a + b * a + (a * b + b * b) :
begin
sorry
end
... = a * a + (b * a + a * b) + b * b : by sorry
... = a * a + 2 * (a * b) + b * b : by sorry
-- END |
e8cc1f58fbf7e56a18230b4449cc4a9a45b87237 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/blast16.lean | b3bdcb0ca4908a7c745365ca751545c6dee9c95b | [
"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 | 202 | lean | set_option trace.blast true
example (p q : Prop) : p ∨ q → q ∨ p :=
by blast
definition lemma1 (p q r s : Prop) (a b : nat) : r ∨ s → p ∨ q → a = b → q ∨ p :=
by blast
print lemma1
|
8353bf971444a406579abcabb1550096e11970a5 | 82b86ba2ae0d5aed0f01f49c46db5afec0eb2bd7 | /src/Init/Notation.lean | 6517d4da35987a64a6b3fb3b1f78d3209117dc95 | [
"Apache-2.0"
] | permissive | banksonian/lean4 | 3a2e6b0f1eb63aa56ff95b8d07b2f851072d54dc | 78da6b3aa2840693eea354a41e89fc5b212a5011 | refs/heads/master | 1,673,703,624,165 | 1,605,123,551,000 | 1,605,123,551,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,457 | 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
Notation for operators defined at Prelude.lean
-/
prelude
import Init.Prelude
infixr:90 " ∘ " => Function.comp
infixr:35 " × " => Prod
infixl:65 " + " =>... |
5230e745497b3cd2530a3a31175f134c1735068c | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/testing/slim_check/testable.lean | 7087b24ed77dcded41cbb278c904d65bcb411027 | [
"Apache-2.0"
] | permissive | lacker/mathlib | f2439c743c4f8eb413ec589430c82d0f73b2d539 | ddf7563ac69d42cfa4a1bfe41db1fed521bd795f | refs/heads/master | 1,671,948,326,773 | 1,601,479,268,000 | 1,601,479,268,000 | 298,686,743 | 0 | 0 | Apache-2.0 | 1,601,070,794,000 | 1,601,070,794,000 | null | UTF-8 | Lean | false | false | 22,903 | lean | /-
Copyright (c) 2020 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Simon Hudon
-/
import testing.slim_check.sampleable
/-!
# `testable` Class
Testable propositions have a procedure that can generate counter-examples
together with a proof that they i... |
1f242c591c01886d182de881e1b38d93b476cf17 | 947b78d97130d56365ae2ec264df196ce769371a | /tests/lean/shadow.lean | 3628625f8837b3bb32eac192a60b5a29fc2e23c6 | [
"Apache-2.0"
] | permissive | shyamalschandra/lean4 | 27044812be8698f0c79147615b1d5090b9f4b037 | 6e7a883b21eaf62831e8111b251dc9b18f40e604 | refs/heads/master | 1,671,417,126,371 | 1,601,859,995,000 | 1,601,860,020,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 651 | lean | import Lean
new_frontend
theorem ex1 {α} (x : α) (h : x = x) (x : α) : x = x :=
h
set_option pp.sanitizeNames false in
theorem ex2 {α} (x : α) (h : x = x) (x : α) : x = x :=
h -- this error is confusing because we have disabled `pp.sanitizeNames`
def foo1 {α} [Inhabited α] (inst inst : α) : {β δ : Type} → α → β → δ... |
2eab993c989ae1d90aedadd04b2922d7d3228835 | 097294e9b80f0d9893ac160b9c7219aa135b51b9 | /assignments/hw3.lean | ee851b768c36a3f640aa1feab6887fb2b8f2cdca | [] | no_license | AbigailCastro17/CS2102-Discrete-Math | cf296251be9418ce90206f5e66bde9163e21abf9 | d741e4d2d6a9b2e0c8380e51706218b8f608cee4 | refs/heads/main | 1,682,891,087,358 | 1,621,401,341,000 | 1,621,401,341,000 | 368,749,959 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,293 | lean | /-
Review: bool
New: Product types
New: Polymorphic types
-/
/-
1. [30 points]
In class we implemented a polymorphic ordered
pair abstract data type that we called prod_S_T.
In a new file called dm_prod.lean re-implement
this ADT but call it dm_prod. Implement at least
the following functions:
- fst
- snd
- set_fst... |
b677f3654fed6dd992be3c36ebab84ced1e0f9c1 | 432d948a4d3d242fdfb44b81c9e1b1baacd58617 | /src/category_theory/limits/shapes/images.lean | 28e5145ddb6be7172c04dd95658f76a77f57e055 | [
"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 | 27,284 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Markus Himmel
-/
import category_theory.limits.shapes.equalizers
import category_theory.limits.shapes.pullbacks
import category_theory.limits.shapes.strong_epi
/-!
# C... |
7fd206329fbc94235501ffb3efe872eb26d974e6 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/measure_theory/measure/stieltjes.lean | cd65059c9a0bc68a17260c8383ac8243c0c4d0fe | [
"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 | 26,791 | lean | /-
Copyright (c) 2021 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Yury Kudryashov, Sébastien Gouëzel
-/
import measure_theory.constructions.borel_space.basic
import topology.algebra.order.left_right_lim
/-!
# Stieltjes measures on... |
32b673260103be17e88a0263da8387d701601722 | 85485c410781936e7dd6aba0ba77b8a82f76c1d6 | /src/localization.lean | 81d996a1edd2c0b1b1a3bb5f77dd17bee11f3689 | [] | no_license | yuma-mizuno/lean-cluster-algebra | 5b33657b3cf27c24cab292d4ac62d6e1e5e715b9 | 4a4fb128566305eda2b82aea068157cb43afdf18 | refs/heads/master | 1,689,542,026,900 | 1,630,963,668,000 | 1,630,964,456,000 | 392,828,775 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 11,484 | lean | import ring_theory.localization
/-!
This file proves some properties on localizations that are needed to define mutations.
## Main statements
* `is_localization_of_lift_of_sup`: let `A`, `B`, and `C` are commutative rings, and `M` and `N`
are submonoids of `A`. Suppose that `B` is a localization of `A` at `M` and `... |
9b239e2918d12ecfcc7b61734b1c9bb9dcc8b5bb | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/group_theory/order_of_element.lean | e6181e443c3aafcb3c249c0d29f6c4e55abfba7b | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,549 | 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
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.algebra.big_operators.order
import Mathlib.group_theory.coset
import Mathlib.data.nat.totie... |
b426d7172430a42a1cdb2fe16ed8ad02766f90f5 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/ring_theory/localization/module.lean | bca0672c79990260bf20f3210d155674a4001834 | [
"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 | 3,028 | lean | /-
Copyright (c) 2022 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Junyan Xu, Anne Baanen
-/
import linear_algebra.linear_independent
import ring_theory.localization.fraction_ring
import ring_theory.localization.integer
/-!
# Modules / vector spaces ove... |
0f289ccbfa0e8039efbc6cd118863c1edd488de6 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/list/rotate.lean | ad57d2f6e96bd4e5b9653e88a18156cc2c612f78 | [] | 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,685 | lean | /-
Copyright (c) 2019 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.list.basic
import Mathlib.PostPort
universes u
namespace Mathlib
namespace list
theo... |
5598b75762d61d5d9b7a763bcffe7a02aef38d5e | 735bb6d9c54e20a6bdc031c27bff1717e68886b9 | /data/list/set.lean | c73a52f36d19f4d91edc38c48e5df946d7b69620 | [] | 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 | 31,854 | lean | /-
Copyright (c) 2015 Leonardo de Moura. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Jeremy Avigad
Set-like operations on lists.
-/
import data.list.basic data.list.comb .basic .comb
open nat function decidable
universe variables uu vv
variable... |
1bb4a6cb707b79b628d88c5dc0c3e77db0e75df0 | 5ae26df177f810c5006841e9c73dc56e01b978d7 | /src/linear_algebra/tensor_product.lean | ff2ab898d86e2043fa8720237c6bb23975034667 | [
"Apache-2.0"
] | permissive | ChrisHughes24/mathlib | 98322577c460bc6b1fe5c21f42ce33ad1c3e5558 | a2a867e827c2a6702beb9efc2b9282bd801d5f9a | refs/heads/master | 1,583,848,251,477 | 1,565,164,247,000 | 1,565,164,247,000 | 129,409,993 | 0 | 1 | Apache-2.0 | 1,565,164,817,000 | 1,523,628,059,000 | Lean | UTF-8 | Lean | false | false | 15,537 | 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... |
b55d0e5d12517dbb2e433a93884895203718db6d | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/data/list/nat_antidiagonal.lean | baa368e6e35a5ce88dcc312df15912f280c8735f | [
"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,300 | lean | /-
Copyright (c) 2019 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import data.list.range
/-!
# Antidiagonals in ℕ × ℕ as lists
This file defines the antidiagonals of ℕ × ℕ as lists: the `n`-th antidiagonal is the list of
pairs `(i... |
57e8d468b71121ae25837b9b16de30393187034d | 4fa161becb8ce7378a709f5992a594764699e268 | /src/linear_algebra/bilinear_form.lean | 0e83e49bc614f7a3ac3a44bac9d98db2961222a6 | [
"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 | 25,630 | lean | /-
Copyright (c) 2018 Andreas Swerdlow. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Andreas Swerdlow
-/
import linear_algebra.matrix
import linear_algebra.tensor_product
/-!
# Bilinear form
This file defines a bilinear form over a module. Basic ideas
such as ortho... |
c4ca9eacd3466642982fabb714435ca55362fb24 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/apply_auto_opt.lean | 0827d2300b10f2489d78730be98d9be00007ddbb | [
"Apache-2.0"
] | permissive | leanprover-community/lean | 12b87f69d92e614daea8bcc9d4de9a9ace089d0e | cce7990ea86a78bdb383e38ed7f9b5ba93c60ce0 | refs/heads/master | 1,687,508,156,644 | 1,684,951,104,000 | 1,684,951,104,000 | 169,960,991 | 457 | 107 | Apache-2.0 | 1,686,744,372,000 | 1,549,790,268,000 | C++ | UTF-8 | Lean | false | false | 333 | lean | def p (a : nat) (b := tt) : nat :=
a + cond b 1 2
def q (a b : nat) (h : a ≠ b . tactic.contradiction) : nat :=
a + b
def val1 : nat :=
begin
refine @p _ _,
exact 2,
apply_opt_param
end
example : val1 = 3 :=
rfl
def val2 : nat :=
begin
fapply @q,
exact 1,
exact 0,
apply_auto_param
end
example : val2 ... |
094a60f0d3e95d08c09a1fa8d4e989c9b3848517 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/topology/metric_space/baire.lean | cdfeb57f517e89ff50c0efe2f40eb12b53459e65 | [] | 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 | 7,293 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.analysis.specific_limits
import Mathlib.order.filter.countable_Inter
import Mathlib.t... |
5124d3908617316d2febab937c16501776518776 | 297c4ceafbbaed2a59b6215504d09e6bf201a2ee | /higman.lean | 42a272ba236717d3392d506311989b1a66b7d091 | [] | no_license | minchaowu/Kruskal.lean3 | 559c91b82033ce44ea61593adcec9cfff725c88d | a14516f47b21e636e9df914fc6ebe64cbe5cd38d | refs/heads/master | 1,611,010,001,429 | 1,497,935,421,000 | 1,497,935,421,000 | 82,000,982 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 34,490 | lean | import .lemmas .dickson
open classical nat function prod set subtype
noncomputable theory
definition inj_from_to {A B: Type} (f : A → B) (S1 : set A) (S2 : set B) := maps_to f S1 S2 ∧ inj_on f S1
theorem inj_from_to_id {A : Type} (S1 : set A) : (∀ a, a ∈ S1 → id a ∈ S1) ∧ ∀ a₁ a₂, a₁ ∈ S1 → a₂ ∈ S1 → id a₁ = id a₂ →... |
435bef0ceade776f6858c40e1423c33fad75c6c7 | 7c2dd01406c42053207061adb11703dc7ce0b5e5 | /src/solutions/03_forall_or.lean | 713f6eecf2b3ee2f9a3cd46af4f378a7a9223385 | [
"Apache-2.0"
] | permissive | leanprover-community/tutorials | 50ec79564cbf2ad1afd1ac43d8ee3c592c2883a8 | 79a6872a755c4ae0c2aca57e1adfdac38b1d8bb1 | refs/heads/master | 1,687,466,144,386 | 1,672,061,276,000 | 1,672,061,276,000 | 189,169,918 | 186 | 81 | Apache-2.0 | 1,686,350,300,000 | 1,559,113,678,000 | Lean | UTF-8 | Lean | false | false | 9,253 | lean | import data.real.basic
import algebra.group.pi
set_option pp.beta true
/-
In this file, we'll learn about the ∀ quantifier, and the disjunction
operator ∨ (logical OR).
Let P be a predicate on a type X. This means for every mathematical
object x with type X, we get a mathematical statement P x.
In Lean, P x has ty... |
aa100b42d77579a37b9f5bc3d497a6a23bb497e6 | cabd1ea95170493667c024ef2045eb86d981b133 | /src/super/misc_preprocessing.lean | 75171fad57e6601444379b5cd38e418283bea38b | [] | no_license | semorrison/super | 31db4b5aa5ef4c2313dc5803b8c79a95f809815b | 0c6c03ba9c7470f801eb4d055294f424ff090308 | refs/heads/master | 1,630,272,140,541 | 1,511,054,739,000 | 1,511,054,756,000 | 114,317,807 | 0 | 0 | null | 1,513,304,776,000 | 1,513,304,775,000 | null | UTF-8 | Lean | false | false | 1,137 | lean | /-
Copyright (c) 2017 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner
-/
import .clause .prover_state
open expr list monad
namespace super
meta def is_taut (c : clause) : tactic bool := do
qf ← c.open_constn c.num_quants,
return $ list.bor... |
4115b4f2573bd945a9c5eb7d8d6b1e803d6a015a | bb31430994044506fa42fd667e2d556327e18dfe | /archive/imo/imo1988_q6.lean | 5db7f6694d4fbe6bd0e3d27a8d8a17b70a441380 | [
"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 | 13,845 | lean | /-
Copyright (c) 2019 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import data.nat.prime
import data.rat.defs
import order.well_founded
import tactic.linarith
import tactic.wlog
/-!
# IMO 1988 Q6 and constant descent Vieta jumping
... |
b8d99e6c8c82792d1b3f608e25a4477fd041d799 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/linear_algebra/tensor_algebra.lean | ace28c6dfe0f46116d82706c35bbe65b8333856e | [] | 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 | 7,272 | lean | /-
Copyright (c) 2020 Adam Topaz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Adam Topaz.
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.algebra.free_algebra
import Mathlib.algebra.ring_quot
import Mathlib.algebra.triv_sq_zero_ext
impor... |
060c3c6584ddf8cbaec08d7e4324dcc0fe5f74e7 | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /08_Building_Theories_and_Proofs.org.1.lean | ec00c946038ef26de655aa752a9f347d3651b6ea | [] | 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 | 213 | lean | import standard
structure Semigroup : Type :=
(carrier : Type)
(mul : carrier → carrier → carrier)
(mul_assoc : ∀ a b c : carrier, mul (mul a b) c = mul a (mul b c))
notation a `*` b := Semigroup.mul _ a b
|
db40bee5e58b8e1b9606f150b1e8761cc88b6ad1 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/category_theory/over.lean | 01c0fdc49e5cf85e77c500c85f4775ad34aa1fc6 | [
"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,779 | lean | /-
Copyright (c) 2019 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Bhavik Mehta
-/
import category_theory.comma
import category_theory.punit
import category_theory.reflects_isomorphisms
/-!
# Over and under categories
Over (and under... |
14f92733137988f6471c8222fa7356a7cf9d7aa2 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/opposite.lean | 9a6beca88e6deb2987eadfba797783d8020cae02 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 4,789 | 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, Simon Hudon, Kenny Lau
-/
import logic.equiv.defs
/-!
# Opposites
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> https://github.com/leanprover-community/ma... |
95614129d19c3d81effb076e229dfb3ccf75dce2 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/control/traversable/equiv.lean | 02b8ff3d878f827d384334f0ff8663eddf63804b | [
"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 | 6,229 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
-/
import control.traversable.lemmas
import data.equiv.basic
/-!
# Transferring `traversable` instances along isomorphisms
This file allows to transfer `traversable` instanc... |
0a4a8c56a856bd68575a2159eb6516de1875ee9e | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/lake/Lake/Util/Log.lean | 58f4178d946bda942ca60db4819c968e3dae5171 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 3,507 | lean | /-
Copyright (c) 2021 Mac Malone. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mac Malone
-/
import Lake.Util.Error
import Lake.Util.OptionIO
namespace Lake
inductive LogLevel
| info
| warning
| error
inductive Verbosity : Type u
| quiet
| normal
| verbose
derivin... |
10a3070a8a886e24110e7a95638cb3d6dc5f596d | 94e33a31faa76775069b071adea97e86e218a8ee | /src/analysis/convex/combination.lean | 9d77210e94389bb4e0e5399a47dbe03d0d096229 | [
"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 | 20,191 | lean | /-
Copyright (c) 2019 Yury Kudriashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudriashov
-/
import algebra.big_operators.order
import analysis.convex.hull
import linear_algebra.affine_space.basis
/-!
# Convex combinations
This file defines convex combina... |
c9eb85ab45114ae5173f2abad825cd34ddca3c3e | 952248371e69ccae722eb20bfe6815d8641554a8 | /src/rat_additions.lean | c9d64f915de339849ac75a3c4c9c638c7c06d4d5 | [] | no_license | robertylewis/lean_polya | 5fd079031bf7114449d58d68ccd8c3bed9bcbc97 | 1da14d60a55ad6cd8af8017b1b64990fccb66ab7 | refs/heads/master | 1,647,212,226,179 | 1,558,108,354,000 | 1,558,108,354,000 | 89,933,264 | 1 | 2 | null | 1,560,964,118,000 | 1,493,650,551,000 | Lean | UTF-8 | Lean | false | false | 8,596 | lean | import data.rat data.nat.gcd tactic.finish algebra.group_power
--meta instance : has_to_format ℤ := ⟨λ z, int.rec_on z (λ k, ↑k) (λ k, "-"++↑(k+1)++"")⟩
meta instance int.reflect : has_reflect int
| (int.of_nat n) :=
if n = 0 then unchecked_cast `(0 : int)
else if n = 1 then unchecked_cast `(1 :... |
3aaf8e048798bbeaf51f92d5d53fac078b9addd9 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/linear_algebra/affine_space/finite_dimensional_auto.lean | d5c4a74c528aa523012e9b5944d3b29d58f2ee10 | [] | 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,574 | lean | /-
Copyright (c) 2020 Joseph Myers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Joseph Myers.
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.linear_algebra.affine_space.independent
import Mathlib.linear_algebra.finite_dimensional
import... |
304158195d9a770476c4f4c7457573a51f627c37 | 82b86ba2ae0d5aed0f01f49c46db5afec0eb2bd7 | /stage0/src/Lean/Elab/Tactic/Match.lean | e93cecbae9556e5978ae5afd852327c66c602dd4 | [
"Apache-2.0"
] | permissive | banksonian/lean4 | 3a2e6b0f1eb63aa56ff95b8d07b2f851072d54dc | 78da6b3aa2840693eea354a41e89fc5b212a5011 | refs/heads/master | 1,673,703,624,165 | 1,605,123,551,000 | 1,605,123,551,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,169 | 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.Elab.Match
import Lean.Elab.Tactic.Basic
import Lean.Elab.Tactic.Induction
namespace Lean.Elab.Tactic
structure AuxMatchTermState :=
(nextId... |
3c7bf4ee8751236b9190a7e2e283c0e0eff398c7 | e953c38599905267210b87fb5d82dcc3e52a4214 | /library/data/rat/basic.lean | b584aaa01f72b2acd0f0ab7d332fc98d0c47382d | [
"Apache-2.0"
] | permissive | c-cube/lean | 563c1020bff98441c4f8ba60111fef6f6b46e31b | 0fb52a9a139f720be418dafac35104468e293b66 | refs/heads/master | 1,610,753,294,113 | 1,440,451,356,000 | 1,440,499,588,000 | 41,748,334 | 0 | 0 | null | 1,441,122,656,000 | 1,441,122,656,000 | null | UTF-8 | Lean | false | false | 22,694 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad
The rational numbers as a field generated by the integers, defined as the usual quotient.
-/
import data.int algebra.field
open int quot eq.ops
record prerat : Type :=
(n... |
5a83ac9ea222926de987e5bbe2c4128051dd526a | 8f209eb34c0c4b9b6be5e518ebfc767a38bed79c | /code/src/internal/Ant/map.lean | eb1778020ffd676af46d4d0c7161772ac63db52b | [] | no_license | hediet/masters-thesis | 13e3bcacb6227f25f7ec4691fb78cb0363f2dfb5 | dc40c14cc4ed073673615412f36b4e386ee7aac9 | refs/heads/master | 1,680,591,056,302 | 1,617,710,887,000 | 1,617,710,887,000 | 311,762,038 | 4 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 955 | lean | import tactic
import ...definitions
import ..internal_definitions
import ..utils
variable [GuardModule]
open GuardModule
lemma Ant.map_associative { α β γ: Type } (f: β → γ) (g: α → β) (ant: Ant α):
(ant.map g).map f = ant.map (f ∘ g) :=
by induction ant; simp [*, Ant.map]
@[simp]
lemma Ant.map_const { α β γ: Ty... |
b20e766223ac797ed3e901cf9eb9429f449f12ee | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/algebra/category/Group/biproducts.lean | 10730e722a3dcaee4297e75788836a151f960460 | [
"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 | 3,651 | 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.limits
import algebra.category.Group.preadditive
import category_theory.limits.shapes.biproducts
import category_theory.limits.shapes.ty... |
945b43cbfb6449748366ff91705030fb15cbee4a | 205f0fc16279a69ea36e9fd158e3a97b06834ce2 | /src/01_Equality/01_equality.lean | 32b487722953d70808a67feb6df095a2a0f8cdab | [] | 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,894 | lean | /- ** An inference rule for equality in general ** -/
/-
Intuitively you would suppose that the proposition,
0 = 0, should be true in any reasonable logical system.
There are two ways a logic could make this happen.
The first is that the logic could provide 0 = 0 as
an axiom, as we just discussed.
That'd be ok, ... |
d5c7da483fd9408e0a7302334d0014c295ffbc1e | cabd1ea95170493667c024ef2045eb86d981b133 | /src/super/clausifier.lean | 9b0022e0b32a8b6d8ae0c44e68085d4c18d5946d | [] | no_license | semorrison/super | 31db4b5aa5ef4c2313dc5803b8c79a95f809815b | 0c6c03ba9c7470f801eb4d055294f424ff090308 | refs/heads/master | 1,630,272,140,541 | 1,511,054,739,000 | 1,511,054,756,000 | 114,317,807 | 0 | 0 | null | 1,513,304,776,000 | 1,513,304,775,000 | null | UTF-8 | Lean | false | false | 10,788 | lean | /-
Copyright (c) 2017 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner
-/
import .clause .clause_ops
import .prover_state .misc_preprocessing
open expr list tactic monad decidable
universe u
namespace super
meta def try_option {a : Type u}... |
93da4ba4011714ee3d563c55059e1fb6d785d555 | 6b45072eb2b3db3ecaace2a7a0241ce81f815787 | /algebra/group_power.lean | e8d1ffb285faa79c91925bffae35549ac7252a8a | [] | no_license | avigad/library_dev | 27b47257382667b5eb7e6476c4f5b0d685dd3ddc | 9d8ac7c7798ca550874e90fed585caad030bbfac | refs/heads/master | 1,610,452,468,791 | 1,500,712,839,000 | 1,500,713,478,000 | 69,311,142 | 1 | 0 | null | 1,474,942,903,000 | 1,474,942,902,000 | null | UTF-8 | Lean | false | false | 5,719 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Robert Y. Lewis
The power operation on monoids and groups. We separate this from group, because it depends on
nat, which in turn depends on other parts of algebra.
We h... |
38776aa480fdbe37297028acdfa4ebe4fe90eeb0 | 3984ab8555ab1e1084e22ef652544acdfc231f27 | /src/v0.1/dump/variance.lean | 6f4ec549eaa223f3194bf84495c29046dca28136 | [] | no_license | mrakgr/CFR-in-Lean | a35c7a478795cc794cc0caff3199cf28c8ee5448 | 720a3260297bcc158e08833d38964450dcaad2eb | refs/heads/master | 1,598,515,917,940 | 1,572,612,355,000 | 1,572,612,355,000 | 217,296,108 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,461 | lean | -- Not related to the CFR project.
-- The variance proof here was just a little thing I did in order to get familiar with Lean.
import data.rat
variable (α : Type)
theorem list.eq.identity : ∀ (l : list α), list.map id l = l
| [] := rfl
| (x :: l) := by simp [list.eq.identity l]
def mean (l : list rat) : ra... |
029e6eb471076e59484b760ae3363d351af28b89 | 4fa161becb8ce7378a709f5992a594764699e268 | /src/category_theory/preadditive.lean | 5df0fefcffb004c4b07e494a07431b4319174d65 | [
"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 | 7,187 | lean | /-
Copyright (c) 2020 Markus Himmel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel
-/
import algebra.group.hom
import category_theory.limits.shapes.kernels
/-!
# Preadditive categories
A preadditive category is a category in which `X ⟶ Y` is an abelian... |
3a84d6b1b096f9d219b0e636602f428a99656be1 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/subobject/well_powered.lean | 3336ecda1e17742e8b049730084fcec94e9d4546 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 2,907 | 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 category_theory.subobject.basic
import category_theory.essentially_small
/-!
# Well-powered categories
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any chang... |
ef1cc57696f1efc1d5b9dc76e652dcb724963a97 | 7541ac8517945d0f903ff5397e13e2ccd7c10573 | /src/category_theory/endofunctor_comp.lean | 40903f6c1752e1a64dc54b74cabdd185c6c6b2f5 | [] | no_license | ramonfmir/lean-category-theory | 29b6bad9f62c2cdf7517a3135e5a12b340b4ed90 | be516bcbc2dc21b99df2bcb8dde0d1e8de79c9ad | refs/heads/master | 1,586,110,684,637 | 1,541,927,184,000 | 1,541,927,184,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,068 | lean | import category_theory.functor_category
import category_theory.products
import category_theory.tactics.obviously
import tactic.interactive
universes u₁ v₁
open category_theory
def functor.prod' (C : Type u₁) [category.{u₁ v₁} C] : ( (C ⥤ C) × (C ⥤ C) ) ⥤ (C ⥤ C) :=
begin
refine
{ obj := λ a, a.1 ⋙ a.2,
map ... |
9e25315eeabc10db12c25f1165ef3ec3b474a067 | 41ebf3cb010344adfa84907b3304db00e02db0a6 | /uexp/tactic_paper_supplemental_material/robust_simp/robust_simp.lean | 31079597367939f817debf1c64670cfbd92434d6 | [
"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 | 3,481 | lean | open tactic smt_tactic list expr
/-
cc_state is the state of the congruence closure procedure.
It uses an union-find datastructure to store equivalence classes of terms.
-/
structure rsimp_cfg :=
(max_rounds := 5)
meta def collect_implied_eqs (cfg : rsimp_cfg) : tactic cc_state :=
focus1 $ using_smt $
do add_lemma... |
1527a66998c5044dd344a54438b6b33879592668 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/notation8.lean | 53323448cdf5482eb016b1301df1186da4b2fa5c | [
"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 | 121 | lean | constant f : nat → nat → nat
constant g : nat → nat
check f $ 1 + g 1 $ g 2 + 2
check f $ g 1 $ (f $ 1 + 1 $ g 2)
|
8e47e2fdc53147c336c9dd0cf77cf6fe67335bf7 | f68ef9a599ec5575db7b285d4960e63c5d464ccc | /Exercises/Lista6-LucasMoschen.lean | 1cc4eb49e83aaa12d5355544aa3118a933828646 | [] | no_license | lucasmoschen/discrete-mathematics | a38d5970cc571b0b9d202bf6a43efeb8ed6f66e3 | 0f1945cc5eb094814c926cd6ae4a8b4c5c579a1e | refs/heads/master | 1,677,111,757,003 | 1,611,500,097,000 | 1,611,500,097,000 | 205,903,359 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 860 | lean | -- Lucas Moschen
-- Teorema de Cantor
import data.set
variables X Y: Type
def surjective {X: Type} {Y: Type} (f : X → Y) : Prop := ∀ y, ∃ x, f x = y
theorem Cantor : ∀ (A: set X), ¬ ∃ (f: A → set A), surjective f :=
begin
intro A,
intro h,
cases h with f h1,
have h2: ∃ x, f x ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.