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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
e00b665915c3d64c2ab209570a33f857bdb3063a | 7afc29faca4febb6e5005c20aa4aa5c3df5cf35c | /src/single.lean | 6b5f0e809d79cda2c0788025e8255647ced380c4 | [
"MIT"
] | permissive | Piwry/Proof-of-Surreal | ad2883027e275050b43a578c5513ae3fe350515b | 6b92baf2382ac23dd0d700f5c958aa910ad4b754 | refs/heads/master | 1,670,521,185,736 | 1,599,657,591,000 | 1,599,657,591,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 597 | lean | import data.list algebra.ring tactic.omega defs
lemma single_complete: almost_complete [●] :=
begin
apply almost_complete.cmp_rule,
existsi ([]),
intros t h,
exfalso, apply h, apply grow_list.head_grow,
apply grow.single_grow
end
lemma single_grow : ∀ t : bintree, (t ↣ ●) → t = ● :=
begin
intros t ... |
d884fcabfa7da40a8007b3839b1e2bd08b661c2b | c777c32c8e484e195053731103c5e52af26a25d1 | /counterexamples/phillips.lean | d5221ec1e43839edd2f2776fc56526f8f77e925f | [
"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 | 29,001 | lean | /-
Copyright (c) 2021 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import analysis.normed_space.hahn_banach.extension
import measure_theory.measure.lebesgue
/-!
# A counterexample on Pettis integrability
There are several the... |
0874027c417d67a48b6fed9aa74e3b6ca21e3d85 | 7490bf5d40d31857a58062614642bb5a41c36154 | /hw1.lean | f329aa239de35ea375e96c8d2c8bde304b6bb9aa | [] | no_license | reesegrayallen/Lean-Discrete-Mathematics | 9f1d6fe1c814cc9264ce868a67adcf5a82566e22 | 00c875284613ea12e0a729f519738aab8599456b | refs/heads/main | 1,674,181,372,629 | 1,606,801,004,000 | 1,606,801,004,000 | 317,387,970 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,147 | lean | /-
Homework #1
Reese Allen, rga2uz
20Sp CS 2102-001
-/
-- namespace for identifiers in this file
-- namespace ends below, see end of file
namespace hidden
/-
An abstract data type combines a data type
and a set of functions that operate on values
of that type. As we're implementing a Boolean
algebra ADT, we defi... |
d844e57363ed365b1fa7ebcdf4c9f6ace9abde3e | 351a46035517d2a1985619b8cabdf263754d343a | /src/ch5.lean | e65ad034cb77ed2664d774b36781cfaea832b5ce | [] | no_license | kaychaks/logic_proof | accc212517b613caca92c10db77e6aaf6b7ccfbc | 90f3bf0acbabf558ba2f82dee968255d8bfe2de1 | refs/heads/master | 1,587,001,734,509 | 1,548,235,051,000 | 1,548,235,051,000 | 165,186,786 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,286 | lean | variables A B : Prop
open classical
example : ¬ A → false → A :=
sorry
example : ¬ A ∨ ¬ B → ¬ (A ∧ B) :=
assume h,
show ¬ (A ∧ B), from
assume h1 : A ∧ B,
show false, from
or.elim h
(assume na : ¬ A,
show false, from na h1.left)
(assume nb : ¬ B,
show false, from nb ... |
b4820d6ae8261bb7f004c81a6ad4e975c57af29b | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/tactic/fin_cases.lean | a38ed37cc72abbcf743f8282d395c962153d11da | [
"Apache-2.0"
] | permissive | vaibhavkarve/mathlib | a574aaf68c0a431a47fa82ce0637f0f769826bfe | 17f8340912468f49bdc30acdb9a9fa02eeb0473a | refs/heads/master | 1,621,263,802,637 | 1,585,399,588,000 | 1,585,399,588,000 | 250,833,447 | 0 | 0 | Apache-2.0 | 1,585,410,341,000 | 1,585,410,341,000 | null | UTF-8 | Lean | false | false | 4,298 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Scott Morrison
Case bashing:
* on `x ∈ A`, for `A : finset α` or `A : list α`, or
* on `x : A`, with `[fintype A]`.
-/
import data.fintype
import tactic.norm_num
namespace tactic
open... |
d10de9db0cb6df2f6e92fadb55d6caf5cf9ca4d0 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/analysis/p_series.lean | 0467dc5f398fecb5cbe34f788e1f674e309bf754 | [] | 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,969 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.analysis.special_functions.pow
import Mathlib.PostPort
universes u_1
namespace Ma... |
a3fb338d751d5328bce4762a45e725a33aa57958 | 367134ba5a65885e863bdc4507601606690974c1 | /src/tactic/lint/simp.lean | cb14925a683e97325726fba1e6a1721565cb662f | [
"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 | 9,340 | lean | /-
Copyright (c) 2020 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner
-/
import tactic.lint.basic
/-!
# Linter for simplification lemmas
This files defines several linters that prevent common mistakes when declaring simp lemmas:
* `simp_... |
8f2ea77f2ba7945ff069fc1bd174873acb9b5f2f | 18a72c9e704298dc782e2cc8d85d0a37e783a3f4 | /Bigop.lean | 75cbbf338c6fccccfd3e7347423a9600c223d72d | [] | no_license | Kha/macro-supplement | dfb6298f8aafc700a2aea1820ace70e3d0f6ab43 | 1d98fe918cc70433a489cae1dab5b2b2f889829d | refs/heads/master | 1,677,039,200,024 | 1,675,790,384,000 | 1,675,790,384,000 | 236,180,481 | 7 | 1 | null | 1,650,524,499,000 | 1,579,962,356,000 | Lean | UTF-8 | Lean | false | false | 4,208 | lean | namespace Bigop
section Preliminaries
def Seq (α : Type) := List α
def BigBody (β α) := α × (β → β → β) × Bool × β
def applyBig (body : BigBody β α) (x : β) : β :=
let (_, op, b, v) := body
if b then op v x else x
def reducebig (idx : β) (r : Seq α) (body : α → BigBody β α) : β :=
r.foldr (applyBig ∘ bod... |
5eb0b8467c30469715d51a6eba1b78914f760162 | 6065973b1fa7bbacba932011c9e2f32bf7bdd6c1 | /src/analysis/normed_space/basic.lean | cf5f423b3eb41ed9b411655a48cc6505231dd96b | [
"Apache-2.0"
] | permissive | khmacdonald/mathlib | 90a0fa2222369fa69ed2fbfb841b74d2bdfd66cb | 3669cb35c578441812ad30fd967d21a94b6f387e | refs/heads/master | 1,675,863,801,090 | 1,609,761,876,000 | 1,609,761,876,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 55,852 | lean | /-
Copyright (c) 2018 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Johannes Hölzl
-/
import topology.instances.nnreal
import topology.algebra.module
import topology.metric_space.antilipschitz
/-!
# Normed spaces
-/
variables {α : Typ... |
dc48a8a78e5820a0fb499a4e2d27a4b47e2e610f | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/analysis/calculus/mean_value.lean | dc6ec5ad5c8439c9deb4f3c28c01398af1752726 | [
"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 | 60,509 | 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, Yury Kudryashov
-/
import analysis.calculus.local_extr
import analysis.convex.topology
import data.complex.is_R_or_C
/-!
# The mean value inequality and equaliti... |
cfc5f6121ad18fea0fd0df457363657bbf822df3 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/data/set/disjointed.lean | 0b2213dad172ebfad0c92f33e828bcbbf3bf8264 | [
"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 | 4,390 | 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
Disjointed sets
-/
import data.set.lattice
import tactic.wlog
open set classical
open_locale classical
universes u v w x
variables {α : Type u} {β : Type v} {γ : Type ... |
12f3dee776865814309286ca595f20502dcab333 | 5f83eb0c32f15aeed5993a3ad5ededb6f31fe7aa | /lean/src/bv/basic.lean | 19a2ae4055a400fbb82cfcbf259330096efcf7b4 | [] | no_license | uw-unsat/jitterbug | 45b54979b156c0f5330012313052f8594abd6f14 | 78d1e75ad506498b585fbac66985ff9d9d05952d | refs/heads/master | 1,689,066,921,433 | 1,687,061,448,000 | 1,688,415,161,000 | 244,440,882 | 46 | 5 | null | null | null | null | UTF-8 | Lean | false | false | 6,640 | lean | import data.fin.tuple.basic
import data.fintype.pi
import tactic.omega.main
/-!
# Fixed-size bitvectors
This file defines fixed-sized bitvectors following the SMT-LIB standard.
## References
* http://smtlib.cs.uiowa.edu/Theories/FixedSizeBitVectors.smt2
* http://smtlib.cs.uiowa.edu/Logics/QF_BV.smt2
-/
/--
The typ... |
0e6d7c355e206f1912e2fc822e368c1c706ead8a | 4727251e0cd73359b15b664c3170e5d754078599 | /src/number_theory/class_number/admissible_absolute_value.lean | 9ba9b4345a66b9504bad8c192c809756a9e2c85f | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 5,776 | lean | /-
Copyright (c) 2021 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen
-/
import data.fin.tuple
import data.real.basic
import combinatorics.pigeonhole
import algebra.order.euclidean_absolute_value
/-!
# Admissible absolute values
This file defin... |
f89af5731f86901cccdbdadaab60525f6da8239f | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/skeletal_auto.lean | f3f93c1032c4d6cce2fc2d22c5ed1c55b58d5347 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,704 | 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.isomorphism_classes
import Mathlib.category_theory.thin
import Mathlib.PostPort... |
cbd7af5b965cf508ae4a6e9ef4bc4455abf1fe4f | 65b579fba1b0b66add04cccd4529add645eff597 | /lambda/with_primitives/src/types.lean | 65294fd950bb0198124958133078e6000db800c0 | [] | no_license | teodorov/sf_lean | ba637ca8ecc538aece4d02c8442d03ef713485db | cd4832d6bee9c606014c977951f6aebc4c8d611b | refs/heads/master | 1,632,890,232,054 | 1,543,005,745,000 | 1,543,005,745,000 | 108,566,115 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 407 | lean | namespace lambda_types
inductive Constant
| int : int → Constant
| nat : nat → Constant
| bool : bool → Constant
inductive AST
| var : string → AST
| literal : Constant → AST
| primitive : string → AST → AST → AST
| abstraction : string → AST → AST
| application : AST → AST → AST
| conditional : AST → AST → AST → AS... |
196809aa4b7febef9c7c8c39f2c62d689150d946 | 9ad8d18fbe5f120c22b5e035bc240f711d2cbd7e | /src/combinatorics/card_sign.lean | b6966f704199d30cb20d3d3ff24ffbc9fb01b2ca | [] | no_license | agusakov/lean_lib | c0e9cc29fc7d2518004e224376adeb5e69b5cc1a | f88d162da2f990b87c4d34f5f46bbca2bbc5948e | refs/heads/master | 1,642,141,461,087 | 1,557,395,798,000 | 1,557,395,798,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,952 | lean | /-
Copyright (c) 2019 Neil Strickland. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Neil Strickland
If J is a finite set then the sum of (-1)^{|K|} over subsets K ⊆ J
is usually zero, except that the sum is one if J is empty.
We will prove two versions of this, ... |
b42d3ce05f2d37c5db9a946011d0f5979cf066c7 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/category_theory/enriched/basic.lean | 8644f3bafb15a89be5deb81a06d7ad184e771d6f | [
"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 | 17,221 | 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.monoidal.types
import category_theory.monoidal.center
/-!
# Enriched categories
We set up the basic theory of `V`-enriched categories,
for `V... |
04453ccecd8b95d8f00f61332db3db6206e0d3dd | fef48cac17c73db8662678da38fd75888db97560 | /src/point7.lean | f2c3f8a34e025b0736b2cb7526b6ebd0b90c74af | [] | no_license | kbuzzard/lean-squares-in-fibonacci | 6c0d924f799d6751e19798bb2530ee602ec7087e | 8cea20e5ce88ab7d17b020932d84d316532a84a8 | refs/heads/master | 1,584,524,504,815 | 1,582,387,156,000 | 1,582,387,156,000 | 134,576,655 | 3 | 1 | null | 1,541,538,497,000 | 1,527,083,406,000 | Lean | UTF-8 | Lean | false | false | 1,594 | lean | import definitions
import point4
theorem fib_add (m n : ℕ) : fib (m + n + 1) =
fib m * fib n + fib (m + 1) * fib (n + 1) :=
nat.rec_on_two n (by unfold fib; rw [mul_zero, zero_add, mul_one]; refl)
(by unfold fib; rw [zero_add, mul_one, mul_one]; refl) $ λ n ih1 ih2,
calc fib (m + n + 1) + fib (m + nat.succ... |
ec1aa9267f98acfe2ca1d1f257d21345b101ae5b | 78269ad0b3c342b20786f60690708b6e328132b0 | /src/library_dev/data/list/perm.lean | a2a5789f33b8bf85fefa4903b0c27f6ed10961f9 | [] | no_license | dselsam/library_dev | e74f46010fee9c7b66eaa704654cad0fcd2eefca | 1b4e34e7fb067ea5211714d6d3ecef5132fc8218 | refs/heads/master | 1,610,372,841,675 | 1,497,014,421,000 | 1,497,014,421,000 | 86,526,137 | 0 | 0 | null | 1,490,752,133,000 | 1,490,752,132,000 | null | UTF-8 | Lean | false | false | 39,663 | 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, Jeremy Avigad
List permutations.
-/
import .basic .comb .set
-- TODO(Jeremy): Here is a common idiom: after simplifying, we have a goal 1 + t = nat.succ t
-... |
001cf9aed3e9d208fbb380bc7006cdb6b9f71726 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/group/ulift.lean | 2e65b7c46f8b0f33df9b68218f3d50d086b155ba | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 6,669 | 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 data.int.cast.defs
import algebra.hom.equiv.basic
import algebra.group_with_zero.inj_surj
/-!
# `ulift` instances for groups and monoids
This file defines in... |
15468b707a69e7f699539b65525baa01d4fea586 | 0845ae2ca02071debcfd4ac24be871236c01784f | /library/init/data/array/binsearch.lean | 5f1111a3d199d76fe9e43833e0b3afcadb9422a9 | [
"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 | 1,255 | 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.data.array.basic
universes u v
namespace Array
-- TODO: remove the [Inhabited α] parameters as soon as we have the tactic framework for... |
f7a52b0d77daa872b7b3db9aa6b7b7451b238d4a | f7c25cf719a8c52d384031424ca44d6dd755e06c | /src/abelian_inj_iff_div.lean | 79d1d772559484baed6f26950911e6dd9f7aef4d | [] | no_license | uzulim/lean_injective_divisible | 601e0a357f9b3908a1b3d803ef8a22c4087ea282 | 9b2b2aa0741af6a2fbbb6cf6897a937b1b83f2dc | refs/heads/master | 1,690,088,115,021 | 1,615,478,572,000 | 1,615,478,572,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,970 | lean | import group_theory.subgroup
import algebra
import tactic
import logic.function.basic
import order.zorn
import data.set.disjointed
open function
-- Injective abelian group
class is_inj_abgp (G : Type) [add_comm_group G] : Prop :=
(inj_extd : ∀ (H K : Type) [add_comm_group H] [add_comm_group K]
(i : H →+ K)
(h_... |
fe647f2df3986743816b57b3215ce99f82dec06e | b00eb947a9c4141624aa8919e94ce6dcd249ed70 | /src/Lean/Parser/Command.lean | 90bee9c1d60a4dab83a8eed4ee5b51b2704e2b2c | [
"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,745 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Sebastian Ullrich
-/
import Lean.Parser.Term
import Lean.Parser.Do
namespace Lean
namespace Parser
/--
Syntax quotation for terms and (lists of) commands.... |
ed5fb018d9ace30a5b8684299f0aa0cd62e71d7d | 432d948a4d3d242fdfb44b81c9e1b1baacd58617 | /src/group_theory/perm/sign.lean | e6c68be1980453dd05e3882177e488bd2595dc7f | [
"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 | 43,305 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import data.fintype.basic
import data.finset.sort
import data.nat.parity
import group_theory.perm.basic
import group_theory.order_of_element
import tactic.norm_swap
impor... |
e0ac520f1d08658c3fa4f8bdb64de92062a35313 | 0030aab32adb6325aa93cc2051c443945934d083 | /src/temp.lean | e1dbf68abaa35f74e5e4bb9215bbc85c07e52d56 | [] | no_license | JasonKYi/sylvester | 914e1abe9c82a3ab4edec15ef58faa8f31921d8f | dfa7a2f323cf9db5fca0a3b8f852b3b9a058bc56 | refs/heads/main | 1,682,286,953,450 | 1,620,149,451,000 | 1,620,149,451,000 | 362,582,788 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,485 | 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 linear_algebra.quadratic_form
import analysis.special_functions.pow
/-!
# Classification of quadratic forms
This file contains theorem regarding the classificatio... |
55761c51abdcceedba169a3d0fd4c9e1fbe7e190 | 618003631150032a5676f229d13a079ac875ff77 | /src/data/pnat/xgcd.lean | c5c3aacc21178a5bb38f4681a2c761af85494072 | [
"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 | 13,398 | lean | /-
Copyright (c) 2019 Neil Strickland. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Neil Strickland
This file sets up a version of the Euclidean algorithm that works
only with natural numbers. Given a, b > 0, it computes the unique
system (w, x, y, z, d) such that ... |
9059bba46354eafa1a49b34086d3b2d57fcff6b7 | 5ee26964f602030578ef0159d46145dd2e357ba5 | /src/for_mathlib/with_zero.lean | 602eb21ff81a7e8f565af401d2d325945b76c7bb | [
"Apache-2.0"
] | permissive | fpvandoorn/lean-perfectoid-spaces | 569b4006fdfe491ca8b58dd817bb56138ada761f | 06cec51438b168837fc6e9268945735037fd1db6 | refs/heads/master | 1,590,154,571,918 | 1,557,685,392,000 | 1,557,685,392,000 | 186,363,547 | 0 | 0 | Apache-2.0 | 1,557,730,933,000 | 1,557,730,933,000 | null | UTF-8 | Lean | false | false | 4,953 | lean | import data.equiv.basic
import group_theory.subgroup
universes u v
namespace with_zero
variables {α : Type u} {β : Type v}
@[simp] theorem zero_le [preorder α] {x : with_zero α} : 0 ≤ x :=
begin
intros y hy, cases hy
end
@[simp] theorem none_le [preorder α] {x : with_zero α} :
@has_le.le (with_zero α) _ none x... |
ae200b0c71d84dbe18037c32df32d653632ff1eb | 957a80ea22c5abb4f4670b250d55534d9db99108 | /library/init/algebra/order.lean | 9c5598237a3cfb00be5cb5d0641e9bc756eb795a | [
"Apache-2.0"
] | permissive | GaloisInc/lean | aa1e64d604051e602fcf4610061314b9a37ab8cd | f1ec117a24459b59c6ff9e56a1d09d9e9e60a6c0 | refs/heads/master | 1,592,202,909,807 | 1,504,624,387,000 | 1,504,624,387,000 | 75,319,626 | 2 | 1 | Apache-2.0 | 1,539,290,164,000 | 1,480,616,104,000 | C++ | UTF-8 | Lean | false | false | 8,385 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.logic init.classical init.meta.name
/- Make sure instances defined in this file have lower priority than the ones
defined for concret... |
62ae44e6009d4bf9877548ff0720e9444f4aa676 | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /stage0/src/Lean/Util/Recognizers.lean | 34b47d5dd09286f46e7bf1bb6f71e4d1faff837b | [
"Apache-2.0"
] | permissive | williamdemeo/lean4 | 72161c58fe65c3ad955d6a3050bb7d37c04c0d54 | 6d00fcf1d6d873e195f9220c668ef9c58e9c4a35 | refs/heads/master | 1,678,305,356,877 | 1,614,708,995,000 | 1,614,708,995,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,699 | 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.Environment
namespace Lean
namespace Expr
@[inline] def const? (e : Expr) : Option (Name × List Level) :=
match e with
| Expr.const n us _... |
4ea00e9bf01d182e13a2dfedbdff8bc29a3dff4b | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/analysis/complex/roots_of_unity.lean | 05f70eb5430d5efbda3673b9df70f94e16bc99a9 | [] | 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,132 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.ring_theory.roots_of_unity
import Mathlib.analysis.special_functions.trigonometric
import M... |
4bd20afe10a23ead582ad3dc725f5419d4ef1957 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/logic/function/basic_auto.lean | ecc863dfa07cdb82f5fccc5378b248f0b44f731a | [] | 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 | 27,366 | lean | /-
Copyright (c) 2016 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.logic.basic
import Mathlib.data.option.defs
import Mathlib.PostPort
univer... |
d670ce734242b482af2371adb7b2008e254c0301 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/order/atoms.lean | a30462556ce98de6ba46c0680fdc99ed638072f8 | [
"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 | 25,160 | lean | /-
Copyright (c) 2020 Aaron Anderson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson
-/
import order.complete_boolean_algebra
import order.cover
import order.modular_lattice
import data.fintype.basic
/-!
# Atoms, Coatoms, and Simple Lattices
This modu... |
0ad779e201968eb96ae084315daac6f31c85d9e7 | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /02_Dependent_Type_Theory.org.20.lean | f07f6d49f310fc8b53715a237a1f3cddea0eb8c7 | [] | 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 | 132 | lean | /- page 21 -/
import standard
import data.nat
open nat
-- BEGIN
constant n : ℕ
check let y := n + n, z := y + y in z * z
-- END
|
60f470fab7cdd8a0ac877b07c6b5c5f34c2a52b8 | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/algebra/big_operators/intervals.lean | 5794eebc362a5c75f03ff79888a231c5ed842413 | [
"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 | 6,672 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
-/
import algebra.big_operators.basic
import data.nat.interval
import tactic.linarith
/-!
# Results about big operators over intervals
We prove results about big oper... |
ea3065502999e85551eed2bbaa0a9c40fd300bbf | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/analysis/specific_limits/normed.lean | 291940cf21cc31c8ef575f12d67f5d1e728d11d2 | [
"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 | 30,330 | lean | /-
Copyright (c) 2020 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anatole Dedecker, Sébastien Gouëzel, Yury G. Kudryashov, Dylan MacKenzie, Patrick Massot
-/
import algebra.order.field.basic
import analysis.asymptotics.asymptotics
import analysis.... |
5248330eb51810d1b9b2a449a36c2af00ff5e0a9 | efa51dd2edbbbbd6c34bd0ce436415eb405832e7 | /20170116_POPL/profile/leanfmt_optimized2.lean | 3f8880c2cf2723ec81a4c16c609a5fba06e1fa93 | [
"Apache-2.0"
] | permissive | leanprover/presentations | dd031a05bcb12c8855676c77e52ed84246bd889a | 3ce2d132d299409f1de269fa8e95afa1333d644e | refs/heads/master | 1,688,703,388,796 | 1,686,838,383,000 | 1,687,465,742,000 | 29,750,158 | 12 | 9 | Apache-2.0 | 1,540,211,670,000 | 1,422,042,683,000 | Lean | UTF-8 | Lean | false | false | 2,444 | lean | open tactic
namespace fmt
meta def format.concat : list format -> format
| [] := format.nil
| (f :: fs) := f ++ format.concat fs
@[inline] meta definition mk_local (n : name) (ty : expr) : expr :=
expr.local_const n n binder_info.default ty
@[inline] meta def binder (n : format) (ty : format) : format :=
"(" ++... |
14ec719db99f03285e986aeb0a489a48b89743bd | 5883d9218e6f144e20eee6ca1dab8529fa1a97c0 | /src/aeq/subst.lean | 0646c1789827b4f428f3903ee4a213f25353a35a | [] | no_license | spl/alpha-conversion-is-easy | 0d035bc570e52a6345d4890e4d0c9e3f9b8126c1 | ed937fe85d8495daffd9412a5524c77b9fcda094 | refs/heads/master | 1,607,649,280,020 | 1,517,380,240,000 | 1,517,380,240,000 | 52,174,747 | 4 | 0 | null | 1,456,052,226,000 | 1,456,001,163,000 | Lean | UTF-8 | Lean | false | false | 4,613 | lean | /-
This file contains the proof that substitution preserves alpha equality.
-/
import .id
namespace acie -----------------------------------------------------------------
namespace aeq ------------------------------------------------------------------
variables {V : Type} [decidable_eq V] -- Type of variable names... |
2402fa7dda9709ae2cc580ab4a5a9a3ab1a96fda | 08bd4ba4ca87dba1f09d2c96a26f5d65da81f4b4 | /src/Lean/Parser/Attr.lean | bd3042d4885dfc1f247713502bf43bb2a0e8a15b | [
"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",
"Apache-2.0",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | gebner/lean4 | d51c4922640a52a6f7426536ea669ef18a1d9af5 | 8cd9ce06843c9d42d6d6dc43d3e81e3b49dfc20f | refs/heads/master | 1,685,732,780,391 | 1,672,962,627,000 | 1,673,459,398,000 | 373,307,283 | 0 | 0 | Apache-2.0 | 1,691,316,730,000 | 1,622,669,271,000 | Lean | UTF-8 | Lean | false | false | 2,189 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Parser.Basic
import Lean.Parser.Extra
namespace Lean.Parser
builtin_initialize
registerBuiltinParserAttribute `builtin_prio_parser ``Categor... |
6f2b550506028689d6ba0b35073ff70af47ab714 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/jpCasesDiscrM.lean | 6bdced3a7b166497ad17dd4e11c46c6ad157d50c | [
"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 | 752 | lean | set_option trace.Compiler.saveBase true in
def f1 (c : Bool) (a b : Nat) :=
let k d y z :=
match d with
| true => y + z + z*y
| false => z + y
match c with
| true => k true a b
| false => k false b a
set_option trace.Compiler.saveBase true in
def f2 (c : Bool) (a b : Nat) :=
let k d y z :=
ma... |
98583b03cc19afb2e6b6f22b41220b5c85344e81 | c8af905dcd8475f414868d303b2eb0e9d3eb32f9 | /examples/synthesis-degradation.lean | ae1e6e1aad126f7c7551467bff463b938a9876d5 | [
"BSD-3-Clause"
] | permissive | continuouspi/lean-cpi | 81480a13842d67ff5f3698643210d8ed5dd08de4 | 443bf2cb236feadc45a01387099c236ab2b78237 | refs/heads/master | 1,650,307,316,582 | 1,587,033,364,000 | 1,587,033,364,000 | 207,499,661 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,369 | lean | import .common
open cpi
open cpi.species
open_locale normalise
def k_ambient : ℍ := fin_poly.X "k₀"
def k_react : ℍ := fin_poly.X "k₁"
def k_degrade : ℍ := fin_poly.X "k₂"
def aff : affinity ℍ := ∅
def ω : context := context.extend 0 (context.extend 0 (context.extend 0 context.nil))
def Γ : context := context.exte... |
73b01b1763683f9df91db3ea90dd4a22a2d0b76a | 6094e25ea0b7699e642463b48e51b2ead6ddc23f | /library/algebra/lattice.lean | c01980753fd1214a85de31237d1d2cd5fc1477a2 | [
"Apache-2.0"
] | permissive | gbaz/lean | a7835c4e3006fbbb079e8f8ffe18aacc45adebfb | a501c308be3acaa50a2c0610ce2e0d71becf8032 | refs/heads/master | 1,611,198,791,433 | 1,451,339,111,000 | 1,451,339,111,000 | 48,713,797 | 0 | 0 | null | 1,451,338,939,000 | 1,451,338,939,000 | null | UTF-8 | Lean | false | false | 4,067 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad
-/
import .order
variable {A : Type}
/- lattices (we could split this to upper- and lower-semilattices, if needed) -/
structure lattice [class] (A : Type) extends weak_o... |
943b597e8b30247a64dfda04d68a5c422c07a553 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/logic/equiv/set.lean | ce3c95ec44b439f8fa9e1cb0f1a31db50e2f8d8e | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 25,443 | 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
-/
import data.set.function
import logic.equiv.defs
/-!
# Equivalences and sets
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to t... |
8c8f0a5def222b8926aa5e3106fa734bb1b3a303 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/by_contradiction.lean | 7d216cbe511c5f14ff63930ff7d92fef398fc611 | [
"Apache-2.0"
] | permissive | GaloisInc/lean | aa1e64d604051e602fcf4610061314b9a37ab8cd | f1ec117a24459b59c6ff9e56a1d09d9e9e60a6c0 | refs/heads/master | 1,592,202,909,807 | 1,504,624,387,000 | 1,504,624,387,000 | 75,319,626 | 2 | 1 | Apache-2.0 | 1,539,290,164,000 | 1,480,616,104,000 | C++ | UTF-8 | Lean | false | false | 612 | lean | open tactic nat
example (a b : nat) : a ≠ b → ¬ a = b :=
by do
intros,
by_contradiction `H,
trace_state,
contradiction
#print "-------"
example (a b : nat) : ¬¬ a = b → a = b :=
by do
intros,
by_contradiction `H,
trace_state,
contradiction
#print "-------"
example (p q : Prop) : ¬¬ p → p :=
by do
... |
271a0fd2521ad2e2a51612863ea23d76e9895dc9 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/hom/equiv/basic.lean | cedc374820889b7d562942cba0538fc1a3dee1e1 | [
"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 | 22,107 | 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, Callum Sutton, Yury Kudryashov
-/
import algebra.hom.group
import data.fun_like.equiv
import logic.equiv.basic
import data.pi.algebra
/-!
# Multiplicative and additive... |
df64ac1169eee251b174377da036e6bba4fe8363 | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/order/conditionally_complete_lattice.lean | 9c226ae06dd2694e377962070744c6f9eabb788b | [
"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 | 49,710 | lean | /-
Copyright (c) 2018 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import data.set.intervals.ord_connected
/-!
# Theory of conditionally complete lattices.
A conditionally complete lattice is a lattice in which every non-empt... |
abe9c28c243bdb42fec2b87d762d75d3421b7421 | 6065973b1fa7bbacba932011c9e2f32bf7bdd6c1 | /src/data/set/basic.lean | 3eec61aa88ab153dd31546663863eb555337c3fe | [
"Apache-2.0"
] | permissive | khmacdonald/mathlib | 90a0fa2222369fa69ed2fbfb841b74d2bdfd66cb | 3669cb35c578441812ad30fd967d21a94b6f387e | refs/heads/master | 1,675,863,801,090 | 1,609,761,876,000 | 1,609,761,876,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 95,211 | 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
-/
import logic.unique
import order.boolean_algebra
/-!
# Basic properties of sets
Sets in Lean are homogeneous; all their elements have the same type... |
53a94a2e502a5bb3be67cac9c42325751beeb7f2 | cf39355caa609c0f33405126beee2739aa3cb77e | /library/init/data/char/default.lean | 52f887199f3938cb58826cdf9c4e8fc68e99f26e | [
"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 | 245 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.data.char.basic init.data.char.lemmas init.data.char.classes
|
927eef837e3ac379ca3ac968c432a39bd129a373 | e031d1fbf8353b338e3189e0d9aec3adb5bb0512 | /src/data/malcev.lean | 968241f55a76de291eb611444326fe406b0385ec | [
"Apache-2.0"
] | permissive | UniversalAlgebra/lean-ualib | e64431a70007a835b1dd933d66be04ffca118601 | ab9cbddbb5bdf1eeac4b0d5994bd6cad2a3665d4 | refs/heads/master | 1,584,931,281,084 | 1,558,364,533,000 | 1,558,364,533,000 | 140,986,567 | 6 | 0 | Apache-2.0 | 1,532,718,578,000 | 1,531,613,794,000 | Lean | UTF-8 | Lean | false | false | 252 | lean | class has_ternary_op (α : Type*) := (ternary_op : α → α → α → α)
class has_malcev_op (α : Type*) extends has_ternary_op α :=
(malcev_op_left : ∀ x y : α, ternary_op x y y = x)
(malcev_op_right : ∀ x y : α, ternary_op y y x = x)
|
85973883f4ce6ebb338269547ce3394e020aae79 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /test/lint_simp_nf.lean | 6bdc26e2d635ccdf4b07d2f990e52baea82805a8 | [
"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 | 941 | lean | import tactic.lint
def f : ℕ → ℕ := default _
def c : ℕ := default _
def d : ℕ := default _
@[simp] lemma c_eq_d : c = d := rfl
-- The following lemma never applies when using simp, because c is first rewritten to d
@[simp] lemma f_c : f c = 0 := rfl
example : f c = 0 :=
begin
simp,
guard_target f d = 0, -- doe... |
d60b9b45e06859ae58b97908bf5452b7ca8e9ebd | 2bafba05c98c1107866b39609d15e849a4ca2bb8 | /src/week_2/Part_B_subgroups.lean | d0a94146b4eaa1ac02ccf58d8a0c86da416b3bcc | [
"Apache-2.0"
] | permissive | ImperialCollegeLondon/formalising-mathematics | b54c83c94b5c315024ff09997fcd6b303892a749 | 7cf1d51c27e2038d2804561d63c74711924044a1 | refs/heads/master | 1,651,267,046,302 | 1,638,888,459,000 | 1,638,888,459,000 | 331,592,375 | 284 | 24 | Apache-2.0 | 1,669,593,705,000 | 1,611,224,849,000 | Lean | UTF-8 | Lean | false | false | 17,544 | lean | /-
Change the below line to
import week_2.kb_solutions.Part_A_groups_solutions
(once the solutions are posted) if you want to get rid of the warning
-/
import week_2.Part_A_groups
/-!
## Subgroups
We define the structure `subgroup G`, whose terms are subgroups of `G`.
A subgroup of `G` is implemented as a subse... |
1f105431f61c716e480ddcaa9d717bcf2f307c78 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/analysis/convex/extrema.lean | 416e8a5a1fdcdb3043e0620f5c82bf006b9d32ab | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 4,318 | 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.convex.function
import topology.algebra.affine
import topology.local_extr
import topology.metric_space.basic
/-!
# Minima and maxima of convex func... |
42ac248083c989dafb8f5bc81c8397196625be51 | 8e6cad62ec62c6c348e5faaa3c3f2079012bdd69 | /src/group_theory/subgroup.lean | 74de473bc083cdbc9fd303fc4b12b10c8d310a3a | [
"Apache-2.0"
] | permissive | benjamindavidson/mathlib | 8cc81c865aa8e7cf4462245f58d35ae9a56b150d | fad44b9f670670d87c8e25ff9cdf63af87ad731e | refs/heads/master | 1,679,545,578,362 | 1,615,343,014,000 | 1,615,343,014,000 | 312,926,983 | 0 | 0 | Apache-2.0 | 1,615,360,301,000 | 1,605,399,418,000 | Lean | UTF-8 | Lean | false | false | 57,954 | 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
import algebra.pointwise
import order.modular_lattice
/-!
# Subgroups
This file defines multiplicative and additiv... |
7ab7e0d011697ad389e95ea5a1fd26ca192855b5 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/algebra/category/Module/limits.lean | 75a31d41ec65ac32771ab6898f7ff9d6c5b44035 | [
"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 | 6,567 | 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.Module.basic
import algebra.category.Group.limits
import algebra.direct_limit
/-!
# The category of R-modules has all limits
Further, these ... |
27455f5368fef8c8c528a12b0f4f3d19532e12ed | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/meta/rb_map_auto.lean | 6a4e003bfedaf8bcc068bdfb4fe0fd3deaa4d988 | [] | 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 | 684 | lean | /-
Copyright (c) 2018 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Robert Y. Lewis
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.option.defs
import Mathlib.data.list.defs
import Mathlib.PostPort
namespace Mathlib
... |
33fddfebc7cd517c23714b3023121d5aa8123b0f | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/topology/sequences.lean | 23aa7710aac56f824ace4ab28384afa8565aa1af | [
"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 | 18,782 | lean | /-
Copyright (c) 2018 Jan-David Salchow. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jan-David Salchow, Patrick Massot
-/
import topology.subset_properties
import topology.metric_space.basic
/-!
# Sequences in topological spaces
In this file we define sequences in... |
cee3ef5ae178bd41906f3c2a2a235ff903dac9cc | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/topology/algebra/group_completion.lean | 9e5c6fc538d430a9b199d313ff3e652779eae54c | [
"Apache-2.0"
] | permissive | stjordanis/mathlib | 51e286d19140e3788ef2c470bc7b953e4991f0c9 | 2568d41bca08f5d6bf39d915434c8447e21f42ee | refs/heads/master | 1,631,748,053,501 | 1,627,938,886,000 | 1,627,938,886,000 | 228,728,358 | 0 | 0 | Apache-2.0 | 1,576,630,588,000 | 1,576,630,587,000 | null | UTF-8 | Lean | false | false | 4,882 | lean | /-
Copyright (c) 2018 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Johannes Hölzl
Completion of topological groups:
-/
import topology.uniform_space.completion
import topology.algebra.uniform_group
noncomputable theory
universes u v... |
e84cc2f43684ea0a400a8602c10a723d75840840 | 947b78d97130d56365ae2ec264df196ce769371a | /src/Lean/Elab/Command.lean | 3cd6c267a65521f5ead75c47389001ec73b1a84c | [
"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 | 25,055 | 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.Elab.Alias
import Lean.Elab.Log
import Lean.Elab.ResolveName
import Lean.Elab.Term
import Lean.Elab.Binders
import Lean.Elab.SyntheticMVars
impo... |
b4ac475a0601ce3027ea63ed4138cd2b0c71a765 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /hott/hit/set_quotient.hlean | 9b75b648ef7e9e4fbcc3aa3740bf8b6c4f2a4a0c | [
"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,763 | 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
Declaration of set-quotients, i.e. quotient of a mere relation which is then set-truncated.
-/
import function algebra.relation types.trunc types.eq hit.quotient
... |
49f6cad5e39482051e81ac952ae5d343ab8a64d9 | e30ff3aabdac29f8ea40ad76887544d0f9be9018 | /ircbot/modules/default.lean | 9d14ec0af5018831e29db7382fd9858847de5c7c | [] | no_license | forked-from-1kasper/leanbot | bdef0efa3e4d0eb75b06c1707fb4e35086bb57fa | c61c8c7fdad7b05877e0d232719ce23d2999557f | refs/heads/master | 1,651,846,081,986 | 1,646,404,009,000 | 1,646,404,009,000 | 127,132,795 | 12 | 1 | null | 1,605,183,650,000 | 1,522,237,998,000 | Lean | UTF-8 | Lean | false | false | 105 | lean | import ircbot.modules.ping_pong ircbot.modules.print_date
import ircbot.modules.help ircbot.modules.admin |
44ba7dbce69ea085ba612d67d1182c21c05d16be | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/logic/relator.lean | 225cb3b08f536b28d670ba6240c8b6b3092230b9 | [
"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 | 3,500 | 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
Relator for functions, pairs, sums, and lists.
-/
import logic.basic
namespace relator
universes u₁ u₂ v₁ v₂
/- TODO(johoelzl):
* should we introduce relators of da... |
f8e242b313b1e4383189e741478f5b0acfb55098 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/number_theory/padics/padic_norm.lean | 6b5c5cd89fc6896779e6772f5a51f8ce07a2a225 | [
"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 | 13,049 | lean | /-
Copyright (c) 2018 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
-/
import number_theory.padics.padic_val
/-!
# p-adic norm
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding PR to mathli... |
d63152eeed1c1c60090e9676aa4f0c9e34267fc3 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /test/conv.lean | fe990ba4b0c179b80227a3dc792db06d75b56408 | [
"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 | 1,207 | lean | /-
Copyright (c) 2018 Keeley Hoek. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Keeley Hoek
-/
import tactic.converter.interactive
import tactic.ring
example : 0 + 0 = 0 :=
begin
conv_lhs {erw [add_zero]}
end
example : 0 + 0 = 0 :=
begin
conv_lhs {simp}
end
ex... |
baef20e879d0ca07b52c262b15058f5c789ef454 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/group_theory/submonoid/operations.lean | 58a2d41ed53808a952a38d951359de7c0155d908 | [
"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 | 21,391 | lean | /-
Copyright (c) 2018 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Kenny Lau, Johan Commelin, Mario Carneiro, Kevin Buzzard,
Amelia Livingston, Yury Kudryashov
-/
import group_theory.submonoid.basic
import data.equiv.mul_add
import al... |
a608cec1f463402ff0a44c6fb1c2c812966f972a | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/dsimplify2.lean | 26deea6ed7a052540d164ffc8645c06971e10d84 | [
"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 | 418 | lean | open tactic
def f : nat → nat := λ x, x + 10
@[simp] lemma f_lemma (x : nat) : f x = x + 10 :=
rfl
example (p : nat → Prop) (a : nat) (h : p (a + 10)) : p (f a) :=
by do
t ← target,
S ← simp_lemmas.mk_default,
new_t ← dsimplify (λ e, failed) (λ e, do new_e ← S^.drewrite e, return (new_e, tt)) t,
expected ← t... |
f2da4f756211eee9f20463f74eafb498329210f9 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/Process.lean | 863a22350e85c2e3920d9016595d290994de81fe | [
"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,731 | lean | --
open IO.Process
def usingIO {α} (x : IO α) : IO α := x
#eval usingIO do
let child ← spawn { cmd := "sh", args := #["-c", "exit 1"] };
child.wait
#eval usingIO do
let child ← spawn { cmd := "sh", args := #["-c", "echo hi!"] };
child.wait
#eval usingIO do
let child ← spawn { cmd := "sh", args := #["-c", ... |
c85bd1e667119647688ea2f458e963cbedb72c4b | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /04_Quantifiers_and_Equality.org.25.lean | 773e9bf91dc7ace7347d3ad58dd8197b61cb8c74 | [] | 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 | 5,174 | lean | /- page 57 -/
import standard
open classical
variables (A : Type) (p q : A → Prop)
variable r : Prop
example : (∃ x : A, r) → r :=
λ H, exists.elim H (λ x Hr, Hr)
example (a : A) : r → (∃ x : A, r) :=
λ Hr, exists.intro a Hr
example : (∃ x, p x ∧ r) ↔ (∃ x, p x) ∧ r :=
iff.intro (assume H,
obtai... |
950340515d8eadbfb37f3129f0f0bb30d9b151ff | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/analysis/inner_product_space/euclidean_dist.lean | 7cc795527ac2c2758e9c5971cf8b4945a62fa5ba | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 4,969 | lean | /-
Copyright (c) 2021 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import analysis.inner_product_space.calculus
import analysis.inner_product_space.pi_L2
/-!
# Euclidean distance on a finite dimensional space
> THIS FILE IS SYNCH... |
49b90317a0863af8086594fd1cf32045bd4baaa2 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/run/cases_crash1.lean | 33a29b32b84149b46ec0be086f261318e8fd56de | [
"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 | 349 | lean | open tactic
axiom Sorry : ∀ A : Type, A
inductive Enum : Type | ea | eb | ec | ed
attribute [instance]
noncomputable definition Enum_dec_eq : decidable_eq Enum :=
by do a ← intro `a, cases a,
b ← intro `b, cases b,
right >> reflexivity,
try (left >> intro `H >>= cases),
repeat $ intros >> mk_... |
4992a9e3fc00264398510299e4ee7ce07e001596 | efce24474b28579aba3272fdb77177dc2b11d7aa | /src/category_theory/simplex.lean | 7949464d1fcb245cbe7275f8dd6a5b252989f0fb | [
"Apache-2.0"
] | permissive | rwbarton/lean-homotopy-theory | cff499f24268d60e1c546e7c86c33f58c62888ed | 39e1b4ea1ed1b0eca2f68bc64162dde6a6396dee | refs/heads/lean-3.4.2 | 1,622,711,883,224 | 1,598,550,958,000 | 1,598,550,958,000 | 136,023,667 | 12 | 6 | Apache-2.0 | 1,573,187,573,000 | 1,528,116,262,000 | Lean | UTF-8 | Lean | false | false | 3,643 | lean | import data.fin order.basic tactic.split_ifs
import category_theory.base
open category_theory
def simplex_category := ℕ
local notation `Δ` := simplex_category
local notation `[`n`]` := fin (n + 1)
instance : has_coe_to_sort (Δ) :=
{S := Type, coe := λ n, [n]}
/- Nota bene: We will abuse the notation (n : Δ)
to ... |
c5198dbc41804c3c4b92f61f8e7675cf723a4d51 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/lean/moduleOf.lean | 3aba1981e29a27084f85b52ea30d300a81130e7e | [
"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 | 429 | lean | import Lean
def f (x : Nat) := x + x
open Lean
def tst : MetaM Unit := do
IO.println (← findModuleOf? `HAdd.hAdd)
IO.println (← findModuleOf? `Lean.Core.CoreM)
IO.println (← findModuleOf? `Lean.Elab.Term.elabTerm)
IO.println (← findModuleOf? `Std.HashMap.insert)
IO.println (← findModuleOf? `tst)
IO.print... |
0eb5ecc94838bcb91332ce511ad445d673e1bcd4 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/data/analysis/topology.lean | 4223f3adaf0e2ead3d6eea1dc3a4d3867e2d6c8a | [
"Apache-2.0"
] | permissive | gebner/mathlib | eab0150cc4f79ec45d2016a8c21750244a2e7ff0 | cc6a6edc397c55118df62831e23bfbd6e6c6b4ab | refs/heads/master | 1,625,574,853,976 | 1,586,712,827,000 | 1,586,712,827,000 | 99,101,412 | 1 | 0 | Apache-2.0 | 1,586,716,389,000 | 1,501,667,958,000 | Lean | UTF-8 | Lean | false | false | 8,452 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
Computational realization of topological spaces (experimental).
-/
import topology.bases data.analysis.filter
open set
open filter (hiding realizer)
open_locale topolog... |
6234240cf58f3c082d8775e9d857b2418ad736d4 | 4a092885406df4e441e9bb9065d9405dacb94cd8 | /src/adic_space.lean | e4fa5af62357834e9a698959f458517a1de7a83f | [
"Apache-2.0"
] | permissive | semorrison/lean-perfectoid-spaces | 78c1572cedbfae9c3e460d8aaf91de38616904d8 | bb4311dff45791170bcb1b6a983e2591bee88a19 | refs/heads/master | 1,588,841,765,494 | 1,554,805,620,000 | 1,554,805,620,000 | 180,353,546 | 0 | 1 | null | 1,554,809,880,000 | 1,554,809,880,000 | null | UTF-8 | Lean | false | false | 2,207 | lean |
import data.nat.prime
import algebra.group_power
import topology.algebra.ring
import topology.opens
import for_mathlib.prime
import for_mathlib.is_cover
import continuous_valuations
import Spa
import Huber_pair
/- An adic space is...
Vpre: p76
-/
universe u
open nat function
open topological_space
structure 𝓥... |
7af806f19888b354b50f82e5fa5a8fb114f15a96 | 2a70b774d16dbdf5a533432ee0ebab6838df0948 | /_target/deps/mathlib/src/analysis/normed_space/finite_dimension.lean | 2ad9470056959d33b3de0033e688eae636c4d23a | [
"Apache-2.0"
] | permissive | hjvromen/lewis | 40b035973df7c77ebf927afab7878c76d05ff758 | 105b675f73630f028ad5d890897a51b3c1146fb0 | refs/heads/master | 1,677,944,636,343 | 1,676,555,301,000 | 1,676,555,301,000 | 327,553,599 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 22,000 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import analysis.normed_space.operator_norm
import analysis.normed_space.add_torsor
import topology.bases
import linear_algebra.finite_dimensional
import tactic.... |
4e67b634f0a46e8804e4c1eac383dc6e888b100a | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/order/max.lean | 465f1fd7e27811c57b342b6f864fec65e661b8ff | [
"Apache-2.0"
] | permissive | ramonfmir/mathlib | c5dc8b33155473fab97c38bd3aa6723dc289beaa | 14c52e990c17f5a00c0cc9e09847af16fabbed25 | refs/heads/master | 1,661,979,343,526 | 1,660,830,384,000 | 1,660,830,384,000 | 182,072,989 | 0 | 0 | null | 1,555,585,876,000 | 1,555,585,876,000 | null | UTF-8 | Lean | false | false | 10,280 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Yury Kudryashov, Yaël Dillies
-/
import order.synonym
/-!
# Minimal/maximal and bottom/top elements
This file defines predicates for elements to be minimal/maximal or b... |
9539aa07f42f865208a2b0bd3691186ce576ce8e | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/lean/run/Reid1.lean | 15f0dbfda47176421a85e10bf41d8eec70bab324 | [
"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 | 701 | lean | structure ConstantFunction (α β : Type) :=
(f : α → β)
(h : ∀ a₁ a₂, f a₁ = f a₂)
instance constFunCoe {α β : Type} : CoeFun (ConstantFunction α β) (fun _ => α → β) :=
{ coe := fun c => c.f }
def myFun {α : Type} : ConstantFunction α (Option α) :=
{ f := fun a => none,
h := fun a₁ a₂ => rfl }
def myFun' (α : Type)... |
714347f4cbabc488fcf673be0918aac0cab5904c | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/hom/group_action.lean | 8c086115d579ee30868ed4f12a210f40e640899c | [
"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 | 13,913 | lean | /-
Copyright (c) 2020 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import algebra.group_ring_action.basic
import algebra.module.basic
/-!
# Equivariant homomorphisms
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file requi... |
70ba4efd3ebb0c0cb27c463327f244e103576768 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /test/lint_coe_to_fun.lean | ed4ee01642e51d33242f1cb5dd7fc6e8e4a7d986 | [
"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,433 | lean | import tactic.lint
-- see Note [function coercion]
structure equiv (α β : Sort*) :=
(to_fun : α → β)
(inv_fun : β → α)
instance {α β} : has_coe_to_fun (equiv α β) :=
⟨λ _, α → β, equiv.to_fun⟩
structure sparkling_equiv (α β) extends equiv α β
instance {α β} : has_coe (sparkling_equiv α β) (equiv α β) :=
⟨sparkling... |
a9753448ab795af0bcffa84681215190610f8b26 | d8820d2c92be8052d13f9c8f8c483a6e15c5f566 | /src/Stuff_for_reference/learning.lean | 4e5853b2b70848a16c13adf484129ae6de2d5d44 | [] | no_license | JasonKYi/M4000x_LEAN_formalisation | 4a19b84f6d0fe2e214485b8532e21cd34996c4b1 | 6e99793f2fcbe88596e27644f430e46aa2a464df | refs/heads/master | 1,599,755,414,708 | 1,589,494,604,000 | 1,589,494,604,000 | 221,759,483 | 8 | 1 | null | 1,589,494,605,000 | 1,573,755,201,000 | Lean | UTF-8 | Lean | false | false | 4,327 | lean | import data.real.basic
-- Tactics
-- revert is kinda the inverse of intro
example (x : ℕ) : x = x :=
begin
revert x,
-- goal is ⊢ ∀ (x : ℕ), x = x
intro y,
-- goal is y : ℕ ⊢ y = y
reflexivity
end
-- arbitary expressions can be generalized using genralize
example : 3 = 3 :=
begin
generalize : 3 = x,
-... |
d05bb657d3bcce84bd6f90f6215b2a568ac9cfc9 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/category_theory/limits/preserves/shapes/pullbacks.lean | 7b7086075200bc60dc08bda6296bd27d60426805 | [
"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 | 11,021 | lean | /-
Copyright (c) 2020 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta, Andrew Yang
-/
import category_theory.limits.shapes.pullbacks
import category_theory.limits.preserves.basic
/-!
# Preserving pullbacks
Constructions to relate the notions... |
b03ef1e389f6961e3bd3f4631081d8a43495453a | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/dynamics/periodic_pts.lean | 499fd5bfb137fc354e5a734a41fbe6a30c81eff8 | [
"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,301 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov
-/
import algebra.hom.iterate
import data.list.cycle
import data.nat.prime
import dynamics.fixed_points.basic
/-!
# Periodic points
A point `x : α` is a perio... |
8166bf6c395b574fe0fbea6d1f0958409b2ab486 | e0f9ba56b7fedc16ef8697f6caeef5898b435143 | /src/topology/metric_space/gromov_hausdorff_realized.lean | 491e31341e7072cc57a8f238b0040a80eaf02180 | [
"Apache-2.0"
] | permissive | anrddh/mathlib | 6a374da53c7e3a35cb0298b0cd67824efef362b4 | a4266a01d2dcb10de19369307c986d038c7bb6a6 | refs/heads/master | 1,656,710,827,909 | 1,589,560,456,000 | 1,589,560,456,000 | 264,271,800 | 0 | 0 | Apache-2.0 | 1,589,568,062,000 | 1,589,568,061,000 | null | UTF-8 | Lean | false | false | 26,971 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Sébastien Gouëzel
Construction of a good coupling between nonempty compact metric spaces, minimizing
their Hausdorff distance. This construction is instrumental to study the Gromov-... |
f89dd5c9c56172e22852fb84c037b3bd6c5b9387 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/topology/instances/ereal.lean | 3148a9199d1abf8dc8d3b47eb8c74f7ea6aed869 | [
"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 | 13,251 | lean | /-
Copyright (c) 2021 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import data.real.ereal
import topology.algebra.order.monotone_continuity
import topology.instances.ennreal
/-!
# Topological structure on `ereal`
We endow `er... |
84f539a99785b79d733bd43201fd772f764c38e8 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/coe.lean | f2414a799f9f8cbc253d9c8fad042ded3c7ec6de | [] | 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,718 | 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
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.data.list.basic
import Mathlib.Lean3Lib.init.data.subtype.basic
import Mathlib.Lean3Lib.init.data.prod
... |
c4f7e09eaf5b0700a910b7261e6786d4be6bc1ff | 367134ba5a65885e863bdc4507601606690974c1 | /src/data/set/intervals/unordered_interval.lean | 4ccb3b39bc29a3556f294c84ff6f34327b39933e | [
"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 | 8,179 | lean | /-
Copyright (c) 2020 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou
-/
import order.bounds
import data.set.intervals.image_preimage
/-!
# Intervals without endpoints ordering
In any decidable linear order `α`, we define the set of elemen... |
c946499b1c65c0607a04074559406a9ea3d54433 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/order/basic.lean | 68736eac7514bc525b31a4d760ec18a615aa4715 | [
"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 | 37,053 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Mario Carneiro
-/
import data.prod.basic
import data.subtype
/-!
# Basic definitions about `≤` and `<`
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> https://github.com/l... |
57f82de7b2ade58e0a69b3c905ab874bc0f1d2c5 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /hott/algebra/trunc_group.hlean | 9ea7e91fcb303db57f0c97026350c206c9fe065e | [
"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 | 2,733 | 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
truncating an ∞-group to a group
-/
import hit.trunc algebra.group
open eq is_trunc trunc
namespace algebra
section
parameters (n : trunc_index) {A : Type} ... |
476b753b0c68547fbf8b15ec324d3545a50af24e | b2e508d02500f1512e1618150413e6be69d9db10 | /src/measure_theory/integration.lean | c167da87c57eda8ccafef6cd636321e64aea5f92 | [
"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 | 46,262 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Johannes Hölzl
Lebesgue integral on `ennreal`.
We define simple functions and show that each Borel measurable function on `ennreal` can be
approximated by a sequence ... |
3e9c6c7f5039c55ec1f679bd343ae8e421c39b92 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/algebra/continued_fractions/terminated_stable_auto.lean | 9ac90dea9346218295bf9cca5dbad2a35b617912 | [] | 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,099 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.algebra.continued_fractions.translations
import Mathlib.PostPort
universes u_1
names... |
7a0ba47d6d9c9a8442627642fbea64c7899aaa69 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/list/dedup.lean | 4b42facffb4c63b2ed44ed3d8937fbe20aa4ba7c | [
"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 | 5,699 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.list.nodup
/-!
# Erasure of duplicates in a list
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding PR to mat... |
ec01db03692a9ebfaeaeee67a0ea9c5a3874bafc | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/topology/sheaves/sheafify.lean | 3c707fbc5aa5ef650814d889dfdd4efb9dbe551a | [
"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,414 | 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 topology.sheaves.local_predicate
import topology.sheaves.stalks
/-!
# Sheafification of `Type` valued presheaves
We construct the sheafification of a `Type` ... |
4d87dd2e2d36ac0a8e2c228aae989c59e0f58461 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/hide_cmd1.lean | 2a9f912d9df36ee85f3d9291ab4d37da1fd636dc | [
"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 | 1,034 | lean | section tst1
open nat
#check succ
hide succ
#check succ -- Error
end tst1
section tst2
open nat
hide succ
def succ := tt
#check succ -- Should not fail, it is not ambiguous since the alias nat.succ has been hidden
end tst2
section tst3
open nat
section nested
hide zero
#check zero -- Error
end nested
#check zero -- S... |
3c4809f414408320b3fe3754385ef274019b706c | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /test/induction.lean | 947cc28fdfd57ec079e620be03a78f185f428803 | [
"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 | 38,076 | lean | import tactic.induction
import tactic.linarith
universes u v w
--------------------------------------------------------------------------------
-- Setup: Some Inductive Types
--------------------------------------------------------------------------------
inductive le : ℕ → ℕ → Type
| zero {n} : le 0 n
| succ {n m} ... |
2dc83e13eefb429e643d797560d1d427470e584e | b7f22e51856f4989b970961f794f1c435f9b8f78 | /library/data/list/sorted.lean | bc07eaa1d006e1e245d48ae095714c9189671ac9 | [
"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 | 5,753 | 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
-/
import data.list.comb data.list.perm
namespace list
variable {A : Type}
variable (R : A → A → Prop)
inductive locally_sorted : list A → Prop :=
| base0 : loca... |
dd93d47136a6c447f472e24267a2db748a8a303a | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/category_theory/conj.lean | a3df2bd9d3853daa39e98cbefff4fabe5eb06225 | [
"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,465 | 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 category_theory.endomorphism
import algebra.group_power
/-!
# Conjugate morphisms by isomorphisms
An isomorphism `α : X ≅ Y` defines
- a monoid isomorphism... |
6ce736ea4648072f2c167ca8bdae7fa9360f4f9c | f0050a24971f1b7315211eec6e02a8eee618ce6b | /src/hoare/basic.lean | 82ac8d88d1335b7b52a6904b42b61b66d7566adc | [
"Apache-2.0"
] | permissive | ttowncompiled/excaLibur | 9574f2acb0bafcd59f59423b63a62c15442ea5f7 | 7d8371bf998012d4f8c49d3fe2bf540e2517c688 | refs/heads/master | 1,670,710,035,703 | 1,599,670,584,000 | 1,599,670,584,000 | 292,720,923 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 14,594 | lean | /-
Copyright (c) Ian Riley. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Ian Riley
-/
import common big_step.basic
def partial_hoare (P : scope → Prop) (S : stmt) (Q : scope → Prop) : Prop :=
∀ (s t : scope), P s → (S, s) ⟹ t → Q t
notation `{* ` P : 1 ` *} ` S... |
921fb41a057222f485afdf07d64c3ec797fe438f | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/measure_theory/measure/content.lean | b477cc4e45904b5a1e843a1fddfb5c94bd6e7a8b | [
"Apache-2.0"
] | permissive | AntoineChambert-Loir/mathlib | 64aabb896129885f12296a799818061bc90da1ff | 07be904260ab6e36a5769680b6012f03a4727134 | refs/heads/master | 1,693,187,631,771 | 1,636,719,886,000 | 1,636,719,886,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 17,010 | 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
-/
import measure_theory.measure.measure_space
import measure_theory.measure.regular
import topology.opens
import topology.compacts
/-!
# Contents
In this file we ... |
8bf4c25db3572f67b1dfc2ea42b68282eacd64cc | 7b02c598aa57070b4cf4fbfe2416d0479220187f | /move_to_lib.hlean | 59cd841b6e4f5edca810873212290d47bfc0c2af | [
"Apache-2.0"
] | permissive | jdchristensen/Spectral | 50d4f0ddaea1484d215ef74be951da6549de221d | 6ded2b94d7ae07c4098d96a68f80a9cd3d433eb8 | refs/heads/master | 1,611,555,010,649 | 1,496,724,191,000 | 1,496,724,191,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 20,605 | hlean | -- definitions, theorems and attributes which should be moved to files in the HoTT library
import homotopy.sphere2 homotopy.cofiber homotopy.wedge hit.prop_trunc hit.set_quotient eq2
open eq nat int susp pointed pmap sigma is_equiv equiv fiber algebra trunc trunc_index pi group
is_trunc function sphere unit sum ... |
2f3ea9f4269249fa7ab79881123fcbada9c0cf14 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/1184.lean | 296c38a738c123905784f40ea771c924a3790c4e | [
"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 | 159 | lean | @[simp] theorem one_le_of_lt (h: n < m) : 1 ≤ m := Nat.lt_of_le_of_lt (Nat.zero_le _) h
example (h: n < m) : 1 ≤ m := by
simp (disch := assumption) [h]
|
71071bab97421e585ff369c28da72ce8ede4e879 | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /stage0/src/Init/Classical.lean | 29ed50bb2fc36c1ab1c3d2b65a1b3d4a55a56f55 | [
"Apache-2.0"
] | permissive | williamdemeo/lean4 | 72161c58fe65c3ad955d6a3050bb7d37c04c0d54 | 6d00fcf1d6d873e195f9220c668ef9c58e9c4a35 | refs/heads/master | 1,678,305,356,877 | 1,614,708,995,000 | 1,614,708,995,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,392 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import Init.Core
import Init.NotationExtra
universes u v
/- Classical reasoning support -/
namespace Classical
axiom choice {α : Sort u} : Nonem... |
b44728c6fad13bdaefb5f9af0316c31f7295313a | 82b86ba2ae0d5aed0f01f49c46db5afec0eb2bd7 | /src/Lean/Meta/Basic.lean | 832b388f71f4f30c1e74bf86371c41b11fda0465 | [
"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 | 44,664 | 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.Data.LOption
import Lean.Environment
import Lean.Class
import Lean.ReducibilityAttrs
import Lean.Util.Trace
import Lean.Util.RecDepth
import Lea... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.