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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
d393218b5b6d244f607b0a8a0f2dde7b999e54b0 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/ring_theory/ideal/quotient.lean | c12b73e5d7ac65431d3442f5ace16004a0b199f7 | [
"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 | 18,484 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Chris Hughes, Mario Carneiro, Anne Baanen
-/
import algebra.ring.fin
import linear_algebra.quotient
import ring_theory.ideal.basic
import tactic.fin_cases
/-!
# Ideal quotients
... |
3a870de43f6d38a2cc356b0ccdec01c4a864a26e | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/ind7.lean | 52f13c1b87e336bda26eb76221e7d6999dbcd809 | [
"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 | 202 | lean | namespace list
inductive {u} list (A : Type u) : Type u
| nil : list
| cons : A → list → list
#check list.{1}
#check list.cons.{1}
#check list.rec.{1 1}
end list
#check list.list.{1}
|
3f69453ce30bc36d4f48e889fd49399b64f082dc | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/apply3.lean | fc0a4a019bd075e4d24d3cd387344586678797f3 | [
"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 | 614 | lean | open tactic
#print "------- fapply version ----------"
example (a : nat) : ∃ x : nat, x = a :=
by do
c₁ ← return (expr.const `Exists.intro [level.of_nat 1]),
fapply c₁, /- fapply adds all unassigned variables -/
trace_state,
swap, /- swap witness and ?M = a -/
a ← get_local `a,
mk_app `eq.refl [a] >>= exa... |
b2416fd1f4f836fac65a32ec989eecf4bf396915 | 359199d7253811b032ab92108191da7336eba86e | /src/instructor/lectures/lecture_1a.lean | 9fa4aaab2e8d4c44196fd084c9ed70dc18927c9c | [] | no_license | arte-et-marte/my_cs2120f21 | 0bc6215cb5018a3b7c90d9d399a173233f587064 | 91609c3609ad81fda895bee8b97cc76813241e17 | refs/heads/main | 1,693,298,928,348 | 1,634,931,202,000 | 1,634,931,202,000 | 399,946,705 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,092 | lean | -- import definitions of real and rational numbers from mathlib
import data.real.basic
namespace cs2120
/-
The first part of this lesson is in the file, lecture_1.md.
Please start there then return here when you're done with
that document.
-/
/-
NUMBER SYSTEMS
-/
/-
Mathematicians think about operations on many ki... |
337f12e94113bf98824244a72de016236cd13636 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tests/lean/run/sizeof4.lean | 5e66efa29c0eea2e4603ceff719114b9e1b00ce7 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | cipher1024/lean4 | 6e1f98bb58e7a92b28f5364eb38a14c8d0aae393 | 69114d3b50806264ef35b57394391c3e738a9822 | refs/heads/master | 1,642,227,983,603 | 1,642,011,696,000 | 1,642,011,696,000 | 228,607,691 | 0 | 0 | Apache-2.0 | 1,576,584,269,000 | 1,576,584,268,000 | null | UTF-8 | Lean | false | false | 375 | lean | inductive Foo (β : Type u) : Sort v → Type (max u v)
| mk {α : Sort v} (b : β) (a : α) : Foo β α
inductive Bla (α : Type u) : Type (u+1) where
| mk₁ (x : Foo (Bla α) Nat)
| mk₂ (n m : Nat) (x : Foo (Bla α) (n = m))
#print Bla.rec
#print Bla._sizeOf_1
#print Bla._sizeOf_2
#print Bla._sizeOf_3
#print Bla.mk₁.siz... |
0bcbad4907900ae6afbae1ebf2474c40e07779f1 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/order/hom/lattice.lean | 214fb509677d1e3efb51c0bead977c012bee6ae0 | [
"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,938 | lean | /-
Copyright (c) 2022 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies
-/
import data.finset.lattice
import order.hom.bounded
import order.symm_diff
/-!
# Lattice homomorphisms
This file defines (bounded) lattice homomorphisms.
We use the `f... |
02efe867b431b55143dcd26c239508e60b0b7d7f | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/sanitychecks.lean | 33ed41a6cd7713177e3c61ee8d5434442d0f0e0a | [
"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 | 792 | lean | theorem unsound : False := -- Error
unsound
partial theorem unsound2 : False := -- Error
unsound2
unsafe theorem unsound3 : False := -- Error
unsound3
opaque unsound4 : False -- Error
axiom magic : False -- OK
namespace Foo
partial def foo (x : Nat) : Nat := foo x -- OK
unsafe def unsound2 : False := unsou... |
b744ffdec5de35c630713c7f9dbb327e7789fcba | 36938939954e91f23dec66a02728db08a7acfcf9 | /lean4/deps/x86_semantics/src/X86Semantics/Common.lean | ab7c339631d05be92f37f5d4bbf758a9e3e00368 | [] | no_license | pnwamk/reopt-vcg | f8b56dd0279392a5e1c6aee721be8138e6b558d3 | c9f9f185fbefc25c36c4b506bbc85fd1a03c3b6d | refs/heads/master | 1,631,145,017,772 | 1,593,549,019,000 | 1,593,549,143,000 | 254,191,418 | 0 | 0 | null | 1,586,377,077,000 | 1,586,377,077,000 | null | UTF-8 | Lean | false | false | 39,018 | lean | /-
This module defines the core datatypes used to represent x86 instruction semantics.
-/
import Galois.Category.Coe1
-- import galois.sexpr
-- No lemma length (x :: xs) = succ (length xs)
-- namespace List
-- def get {a : Type}: forall (ls : List a) (n : Nat) (pf : n < ls.length), a
-- | x :: _, 0, _ => x
-- | (_ ::... |
d56783d9a4f5084c416fb0359a1841f0f88335e7 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/category/Quiv.lean | b01b516fd8fcc4ec0d6c74e59aed4bdf38367517 | [
"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 | 3,284 | 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.adjunction.basic
import category_theory.category.Cat
import category_theory.path_category
/-!
# The category of quivers
> THIS FILE IS SYNCHR... |
766bfa5b32c62a6fd8d4a1776a972365919f296e | c777c32c8e484e195053731103c5e52af26a25d1 | /src/data/fin/interval.lean | 41a0f2409e519138dc70e4695a41bb262a0d8732 | [
"Apache-2.0"
] | permissive | kbuzzard/mathlib | 2ff9e85dfe2a46f4b291927f983afec17e946eb8 | 58537299e922f9c77df76cb613910914a479c1f7 | refs/heads/master | 1,685,313,702,744 | 1,683,974,212,000 | 1,683,974,212,000 | 128,185,277 | 1 | 0 | null | 1,522,920,600,000 | 1,522,920,600,000 | null | UTF-8 | Lean | false | false | 5,142 | lean | /-
Copyright (c) 2021 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies
-/
import data.nat.interval
import data.finset.locally_finite
/-!
# Finite intervals in `fin n`
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file requi... |
6d5cd959584d0ae2362b2c17c0350c4b846649c8 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/analysis/normed_space/dual.lean | df2d46bb7709b766238304fb832ea9560bbcf183 | [
"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 | 11,416 | lean | /-
Copyright (c) 2020 Heather Macbeth. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Heather Macbeth
-/
import analysis.normed_space.hahn_banach
import analysis.normed_space.is_R_or_C
/-!
# The topological dual of a normed space
In this file we define the topologica... |
220271023322233c23877f0c1aa55e4fb92e6f38 | bb31430994044506fa42fd667e2d556327e18dfe | /src/data/list/rotate.lean | 17fbef984564c2a15564e576879097722c0a6df4 | [
"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 | 22,682 | lean | /-
Copyright (c) 2019 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Yakov Pechersky
-/
import data.list.perm
import data.list.range
/-!
# List rotation
This file proves basic results about `list.rotate`, the list rotation.
## Main declar... |
2dbff2f1b9cd64fe0f90bb5f2d60727706b030e6 | 26ac254ecb57ffcb886ff709cf018390161a9225 | /src/ring_theory/ideals.lean | 6d2f03f5d5ddeebe341e7b05420697cf67383565 | [
"Apache-2.0"
] | permissive | eric-wieser/mathlib | 42842584f584359bbe1fc8b88b3ff937c8acd72d | d0df6b81cd0920ad569158c06a3fd5abb9e63301 | refs/heads/master | 1,669,546,404,255 | 1,595,254,668,000 | 1,595,254,668,000 | 281,173,504 | 0 | 0 | Apache-2.0 | 1,595,263,582,000 | 1,595,263,581,000 | null | UTF-8 | Lean | false | false | 20,207 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Chris Hughes, Mario Carneiro
-/
import algebra.associated
import algebra.pointwise
import linear_algebra.basic
import order.zorn
universes u v
variables {α : Type u} {β : Type v... |
859317140dceca98783aade602270c0f120c46b0 | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch2/ex0901.lean | 4eee572fa39c9e2829e0a5ebdcd6ec1e92eff963 | [] | no_license | Ailrun/Theorem_Proving_in_Lean | ae6a23f3c54d62d401314d6a771e8ff8b4132db2 | 2eb1b5caf93c6a5a555c79e9097cf2ba5a66cf68 | refs/heads/master | 1,609,838,270,467 | 1,586,846,743,000 | 1,586,846,743,000 | 240,967,761 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 282 | lean | namespace hidden
universe u
constant list : Type u → Type u
namespace list
constant cons : Π α : Type u, α → list α → list α
constant nil : Π α : Type u, list α
constant append : Π α : Type u, list α → list α → list α
end list
end hidden
|
5e77174a4acdcd99b8579db499411527c0c49881 | 947b78d97130d56365ae2ec264df196ce769371a | /src/Lean/Meta/Offset.lean | 8b0593610787e2b3f0260116ede5214db0776d3a | [
"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 | 4,185 | 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.LBool
import Lean.Meta.InferType
namespace Lean
namespace Meta
partial def evalNat : Expr → Option Nat
| Expr.lit (Literal.natVal n) _ =>... |
621355fa08cd8595b3e64e3abb8ed8f153b3cebe | 94e33a31faa76775069b071adea97e86e218a8ee | /src/ring_theory/derivation.lean | 47830ba359c883daca75feb1cd60df91dd2df72b | [
"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 | 13,436 | lean | /-
Copyright © 2020 Nicolò Cavalleri. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nicolò Cavalleri
-/
import ring_theory.adjoin.basic
import algebra.lie.of_associative
/-!
# Derivations
This file defines derivation. A derivation `D` from the `R`-algebra `A` to th... |
07aba5bbf1882e1ecda8e0a7830489870bdec0f0 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/wfEqnsIssue.lean | 1f81042becb59039eb8484572a3e521f21b213ad | [
"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,764 | lean | def HList (αs : List (Type u)) : Type u := αs.foldr Prod.{u, u} PUnit
@[match_pattern] def HList.nil : HList [] := ⟨⟩
@[match_pattern] def HList.cons (a : α) (as : HList αs): HList (α :: αs) := (a, as)
def HList.set : {αs : _} → HList αs → (i : Fin αs.length) → αs.get i → HList αs
| _ :: _, cons a as, ⟨0, ... |
e5deae9721dd7d8f6f86b31ad7b999b58b46c0f3 | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /src/Lean/Parser/Syntax.lean | 8fd0120373a4eb049f358f9152801041d07b1719 | [
"Apache-2.0"
] | permissive | WojciechKarpiel/lean4 | 7f89706b8e3c1f942b83a2c91a3a00b05da0e65b | f6e1314fa08293dea66a329e05b6c196a0189163 | refs/heads/master | 1,686,633,402,214 | 1,625,821,189,000 | 1,625,821,258,000 | 384,640,886 | 0 | 0 | Apache-2.0 | 1,625,903,617,000 | 1,625,903,026,000 | null | UTF-8 | Lean | false | false | 6,011 | 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.Command
import Lean.Parser.Tactic
namespace Lean
namespace Parser
builtin_initialize
registerBuiltinParserAttribut... |
a02571cc7508ef6b310fd233c9cea4dfe06e74f8 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/mixed_tmp_non_tmp_universe_bug.lean | 89f8f15a0779a7fe7d81919394201ea412f1acb7 | [
"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 | 89 | lean | #reduce (default : bool × unit × nat)
#reduce (default : bool × bool × bool × bool)
|
71c33ea71b4e07450c106856c716d6b152233f0b | f20db13587f4dd28a4b1fbd31953afd491691fa0 | /library/init/algebra/order.lean | ab424df157628a3fcbd42e79727c57e0a12a655b | [
"Apache-2.0"
] | permissive | AHartNtkn/lean | 9a971edfc6857c63edcbf96bea6841b9a84cf916 | 0d83a74b26541421fc1aa33044c35b03759710ed | refs/heads/master | 1,620,592,591,236 | 1,516,749,881,000 | 1,516,749,881,000 | 118,697,288 | 1 | 0 | null | 1,516,759,470,000 | 1,516,759,470,000 | null | UTF-8 | Lean | false | false | 9,175 | 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 init.algebra.classes
/- Make sure instances defined in this file have lower priority than the ones
... |
f5302e198b56088e0f04ebdb327ec4251aafe6ae | 75db7e3219bba2fbf41bf5b905f34fcb3c6ca3f2 | /tests/lean/congr1.lean | 936c95d588662911fbef3321aaa5b6e361793796 | [
"Apache-2.0"
] | permissive | jroesch/lean | 30ef0860fa905d35b9ad6f76de1a4f65c9af6871 | 3de4ec1a6ce9a960feb2a48eeea8b53246fa34f2 | refs/heads/master | 1,586,090,835,348 | 1,455,142,203,000 | 1,455,142,277,000 | 51,536,958 | 1 | 0 | null | 1,455,215,811,000 | 1,455,215,811,000 | null | UTF-8 | Lean | false | false | 622 | lean | import data.list
#congr_simp @add
#congr_simp @ite
#congr_simp @perm
section
variables p : nat → Prop
variables q : nat → nat → Prop
variables f : Π (x y : nat), p x → q x y → nat
#congr_simp f
end
constant p : Π {A : Type}, A → Prop
constant q : Π {A : Type} (n m : A), p n → p m → Prop
constant r : Π {A : Type} (... |
085a3eda2a0d40ebbcbed5c5d98748762f51b5a9 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/algebra/category/Module/filtered_colimits.lean | 796ad0b6fd8ac0b42b12c721f1868e8780e6e2f4 | [
"Apache-2.0"
] | permissive | robertylewis/mathlib | 3d16e3e6daf5ddde182473e03a1b601d2810952c | 1d13f5b932f5e40a8308e3840f96fc882fae01f0 | refs/heads/master | 1,651,379,945,369 | 1,644,276,960,000 | 1,644,276,960,000 | 98,875,504 | 0 | 0 | Apache-2.0 | 1,644,253,514,000 | 1,501,495,700,000 | Lean | UTF-8 | Lean | false | false | 7,212 | lean | /-
Copyright (c) 2021 Justus Springer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Justus Springer
-/
import algebra.category.Group.filtered_colimits
import algebra.category.Module.basic
/-!
# The forgetful functor from `R`-modules preserves filtered colimits.
For... |
62db7bdbd1d2d53d07661bac6cfdcb784f2655d1 | 5ae26df177f810c5006841e9c73dc56e01b978d7 | /src/data/padics/padic_numbers.lean | 6bc733f6fe301b31d620f2e9ed0274ae7f9acde6 | [
"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 | 32,576 | 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 data.real.cau_seq_completion topology.metric_space.cau_seq_filter
import data.padics.padic_norm algebra.archimedean analysis.normed_space.basic
import tact... |
501fcf2f0936ecb95c00175f53e590eb8241a9b9 | bb31430994044506fa42fd667e2d556327e18dfe | /src/data/nat/order/lemmas.lean | 29c162696faecf05d61c1eb40fa335285f5821e9 | [
"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 | 8,852 | lean | /-
Copyright (c) 2014 Floris van Doorn (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Leonardo de Moura, Jeremy Avigad, Mario Carneiro
-/
import data.nat.order.basic
import data.set.basic
import algebra.ring.divisibilit... |
64e195d19cc78c8b4df167ad3f9b99788c70aea5 | 618003631150032a5676f229d13a079ac875ff77 | /src/category_theory/limits/shapes/products.lean | 56851677c52db5d5bc95bf858f8d18cb8e2b017d | [
"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 | 3,104 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.limits.limits
import category_theory.discrete_category
universes v u
open category_theory
namespace category_theory.limits
variables {β : T... |
cbccbdc4f1a4c2cd0748c129f507701e13c98946 | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/data/real/pi.lean | 6a68ddaf1a6c53d2ed5a1990fb3e2c7782fec6c4 | [
"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 | 19,190 | lean | /-
Copyright (c) 2019 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Benjamin Davidson
-/
import analysis.special_functions.integrals
/-!
# Pi
This file contains lemmas which establish bounds on or approximations of `real.pi`. Notab... |
ced7c23931a0d097f8e99142208395741bcaadc5 | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/tactic/simp_rw.lean | 66684d24bffb642dc5a58966f9cc8235a56d0e86 | [
"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 | 2,377 | lean | /-
Copyright (c) 2020 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen
The `simp_rw` tactic, a mix of `simp` and `rewrite`.
-/
import tactic.core
/-!
# The `simp_rw` tactic
This module defines a tactic `simp_rw` which functions as a mix of `si... |
329d3339dcebd51bc906aeb3fb4c38883e6c50b0 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/analysis/special_functions/trigonometric/inverse.lean | 81ce4c01ad38c22df0c2bd4b8d7a7b73aef0b8c6 | [
"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 | 15,392 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Abhimanyu Pallavi Sudhir, Jean Lo, Calle Sönne, Benjamin Davidson
-/
import analysis.special_functions.trigonometric.basic
import topology.algebra.order.proj_Icc
/-!
# In... |
0c7270f032f3218fb376ed58aa6e5a4899a49007 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/float.lean | 5434a8b8746d6dd5578cdad45b080132ce274e32 | [
"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 | 4,131 | lean |
open native native.float
meta def close_enough (a b : float) : bool := abs (a - b) < 10 * epsilon
local infixr ` ≃ `:2 := close_enough
meta def floats := [0,1,-1,pi,epsilon, 1/epsilon, pi / 2, pi / 4, -pi]
meta def floats2 := list.bind floats (λ x, floats.map (λ y, (x,y)))
meta def check1 (prop : float → bool) :=... |
3885c84de6481ab86fe122ea23e13cd178006806 | f3849be5d845a1cb97680f0bbbe03b85518312f0 | /library/init/meta/pexpr.lean | c369ab68c9b2a2ee06bcf4448a9a932d4884a729 | [
"Apache-2.0"
] | permissive | bjoeris/lean | 0ed95125d762b17bfcb54dad1f9721f953f92eeb | 4e496b78d5e73545fa4f9a807155113d8e6b0561 | refs/heads/master | 1,611,251,218,281 | 1,495,337,658,000 | 1,495,337,658,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 915 | 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.meta.expr
universe u
/- Quoted expressions. They can be converted into expressions by using a tactic. -/
@[reducible] meta def pexpr :=... |
54213e873db3f2bf6c5238bc818c3a51a51db482 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/lean/run/exfalsoBug.lean | 441139a9278002127222df2bb5eb77a92a1a7130 | [
"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 | 2,308 | lean | namespace Ex1
def f (n : Nat) : Option { r : Nat // r ≤ n } :=
match n with
| 0 => some ⟨0, Nat.le_refl _⟩
| n+1 => match f n with
| some ⟨m, h₁⟩ =>
have : m < n+1 := Nat.lt_of_le_of_lt h₁ (Nat.lt_succ_self _)
match f m with
| some ⟨r, h₂⟩ => some ⟨r, Nat.le_trans h₂ (Nat.le_trans h₁ (Nat... |
db315308c89c472ff91110f4c80565af286a0c88 | 86f6f4f8d827a196a32bfc646234b73328aeb306 | /examples/sets_functions_and_relations/unnamed_1176.lean | ae88cb9de0d7f5a92588dceb9c900d1e6c5878c9 | [] | 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 | 266 | lean | import data.real.sqrt
open set real
example : inj_on sqrt { x | x ≥ 0 } :=
sorry
example : inj_on (λ x, x^2) { x : ℝ | x ≥ 0 } :=
sorry
example : sqrt '' { x | x ≥ 0 } = {y | y ≥ 0} :=
sorry
example : range (λ x, x^2) = {y : ℝ | y ≥ 0} :=
sorry |
059c78d2ef713273fb6e423c605634819dbc0387 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebra/continued_fractions/terminated_stable.lean | 2e593c632282f17373dba5c10f21d8e66052b8cd | [
"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 | 4,625 | lean | /-
Copyright (c) 2020 Kevin Kappelmann. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Kappelmann
-/
import algebra.continued_fractions.translations
/-!
# Stabilisation of gcf Computations Under Termination
## Summary
We show that the continuants and convergent... |
df4ee930d30c460acd48466f711850b85794c4f2 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/set_theory/cardinal/basic.lean | 01f7fbc239a170915afc0798ec06792f6fac6fdf | [
"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 | 65,295 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro, Floris van Doorn
-/
import data.nat.enat
import data.set.countable
import logic.small
import order.conditionally_complete_lattice
import set_theory.schr... |
8e021efaa5c16def4d148479a55e0a9ceb3e0908 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/category/Mon/adjunctions.lean | 54e756448f059e1a3614fb2afae3fdd534180d90 | [
"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,274 | lean | /-
Copyright (c) 2021 Julian Kuelshammer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Julian Kuelshammer
-/
import algebra.category.Mon.basic
import algebra.category.Semigroup.basic
import algebra.group.with_one.basic
import algebra.free_monoid.basic
/-!
# Adjuncti... |
0424d68193c1b522d966cc180e8443e36eeeb648 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/run/simplifier_canonize_instances.lean | b92438b330016e893c64f28d547ac74daf7e8297 | [
"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 | 1,028 | lean | open tactic
set_option simplify.theory false
set_option pp.implicit true
meta_definition simplify_goal_force : tactic unit :=
do (new_target, Heq) ← target >>= simplify failed [],
assert `Htarget new_target, swap,
Ht ← get_local `Htarget,
mk_app `eq.mpr [Heq, Ht] >>= apply_core transparency.all ff tt,
try... |
759da11042497b2699ba2f830ebd54f416e26838 | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/geometry/manifold/algebra/monoid.lean | 3fdb0b05acb4dcf8234b6d1743a7b66a593d1aca | [
"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 | 7,664 | lean | /-
Copyright © 2020 Nicolò Cavalleri. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nicolò Cavalleri
-/
import geometry.manifold.times_cont_mdiff
/-!
# Smooth monoid
A smooth monoid is a monoid that is also a smooth manifold, in which multiplication is a smooth map
... |
760c05ec322e8814fba4b646eb3dc7085afb131c | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/simpArgTypeMismatch.lean | 70d5241db27c3a025a041990ae7bbac04e3668a8 | [
"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 | 127 | lean | example (p : Prop) [Decidable p] (hnp : ¬ p) :
if decide p then 0 = 1 else 1 = 1 := by
simp [hnp, decide_eq_false Unit]
|
5282015983b69c6e581af28593910f2339308929 | 26ac254ecb57ffcb886ff709cf018390161a9225 | /src/algebra/category/CommRing/limits.lean | edfff9b8c610993c2b78b73481fe3509ee70ac33 | [
"Apache-2.0"
] | permissive | eric-wieser/mathlib | 42842584f584359bbe1fc8b88b3ff937c8acd72d | d0df6b81cd0920ad569158c06a3fd5abb9e63301 | refs/heads/master | 1,669,546,404,255 | 1,595,254,668,000 | 1,595,254,668,000 | 281,173,504 | 0 | 0 | Apache-2.0 | 1,595,263,582,000 | 1,595,263,581,000 | null | UTF-8 | Lean | false | false | 4,794 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import algebra.category.CommRing.basic
/-!
# The category of commutative rings has all limits
Further, these limits are preserved by the forgetful functor --- that ... |
c1dfe4af27197baf2f0402cdec057c3c3be2193e | 94e33a31faa76775069b071adea97e86e218a8ee | /src/analysis/special_functions/exp.lean | 2816bdfc15847c23d01e2df1fadc7b964488e489 | [
"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 | 13,726 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Abhimanyu Pallavi Sudhir, Jean Lo, Calle Sönne
-/
import analysis.complex.basic
import data.complex.exponential
/-!
# Complex and real exponential
In this file we prove c... |
8827d6959097265b11a4b6b3284c7560144f8314 | 5e3548e65f2c037cb94cd5524c90c623fbd6d46a | /AMC_2021_A_18.lean | 6fd31c8ca01f1c321d95e36dc48179a4597e3cf4 | [] | no_license | ahayat16/lean_exos | d4f08c30adb601a06511a71b5ffb4d22d12ef77f | 682f2552d5b04a8c8eb9e4ab15f875a91b03845c | refs/heads/main | 1,693,101,073,585 | 1,636,479,336,000 | 1,636,479,336,000 | 415,000,441 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 217 | lean | import data.real.basic
import data.nat.prime
theorem AMC_2021_A_18 (f:ℚ → ℝ)
(h:∀ (a b:ℚ), (a≥0∧b≥0)→f a*b=f a + f b)
(hp: ∀ (p:ℕ), nat.prime p→ f ↑p = p):
f (25/11) <0
:=
begin
sorry
end |
d5779a7d67a070220f74288e9da1db6fc969e894 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/analysis/normed_space/algebra.lean | dde5957d77518c00016b6145c791c56ef945f73b | [
"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 | 1,740 | lean | /-
Copyright (c) 2022 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 topology.algebra.module.character_space
import analysis.normed_space.weak_dual
import analysis.normed_space.spectrum
/-!
# Normed algebras
This file conta... |
2051d210d5c192eebb880e6710e779330d83d10e | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/topology/compact_open.lean | 9fbac94babe762ecf7c5c1afc20fbd951834f3ad | [
"Apache-2.0"
] | permissive | lacker/mathlib | f2439c743c4f8eb413ec589430c82d0f73b2d539 | ddf7563ac69d42cfa4a1bfe41db1fed521bd795f | refs/heads/master | 1,671,948,326,773 | 1,601,479,268,000 | 1,601,479,268,000 | 298,686,743 | 0 | 0 | Apache-2.0 | 1,601,070,794,000 | 1,601,070,794,000 | null | UTF-8 | Lean | false | false | 3,810 | lean | /-
Copyright (c) 2018 Reid Barton. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Reid Barton
Type of continuous maps and the compact-open topology on them.
-/
import topology.subset_properties
import topology.continuous_map
import tactic.tidy
open set
open_locale to... |
4cb08d80ab0140a307faa6bc65538028b0a14a13 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /archive/wiedijk_100_theorems/ballot_problem.lean | f539b407b87e4ee19e8809eaa45e1e5a47a1e515 | [
"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 | 18,122 | lean | /-
Copyright (c) 2022 Bhavik Mehta, Kexing Ying. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta, Kexing Ying
-/
import probability.cond_count
/-!
# Ballot problem
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a correspondi... |
eb287fe40cd87cc097eb493831e1ade8fdd4851f | 432d948a4d3d242fdfb44b81c9e1b1baacd58617 | /src/order/galois_connection.lean | 43240d2872534330f0f1d596bab15d3b6563b1ba | [
"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 | 25,262 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
-/
import order.complete_lattice
import order.rel_iso
/-!
# Galois connections, insertions and coinsertions
Galois connections are order theoretic adjoints, i.e. a pair... |
db044be2964872753da835b45ec0236e87a57ee0 | cf39355caa609c0f33405126beee2739aa3cb77e | /library/init/meta/smt/congruence_closure.lean | 54d8a80bb1781161d0fbca2cab1169c448b2ec91 | [
"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 | 7,381 | 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.meta.interactive_base init.meta.tactic init.meta.set_get_option_tactics
structure cc_config :=
/- If tt, congruence closure will treat ... |
8ed52ccc9728b7c8d496c685de73364978ba4843 | 2bafba05c98c1107866b39609d15e849a4ca2bb8 | /src/week_2/Part_A_groups.lean | f3feb6d958d533f1d75cdfe35d3ddecef2d9e2aa | [
"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 | 10,529 | lean | import tactic
/-!
# Groups
Definition and basic properties of a group.
-/
-- Technical note: We work in a namespace `xena` because Lean already has groups.
namespace xena
-- Now our definition of a group will really be called `xena.group`.
/-
## Definition of a group
The `group` class will extend `has_mul`, `h... |
c92586abea872035e4c7d7427db6c66a9701c858 | 570f46c4bf91dd2d8b97fc9d43ce1c435867f7dc | /src/solutions/tuto_lib.lean | c5945683d37bff7efe6d5df3be4c48f7f601cb17 | [
"Apache-2.0"
] | permissive | Timeroot/tutorials | ef586f20e059c2cfa2b044e5663ea98f32c86646 | ff7a6c1ad58b2eedfdc7303661e19409656467ab | refs/heads/master | 1,691,446,431,254 | 1,633,556,762,000 | 1,633,556,762,000 | 414,377,840 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,775 | lean | import analysis.specific_limits
import data.int.parity
import topology.sequences
attribute [instance] classical.prop_decidable
/-
Lemmas from that file were hidden in my course, or restating things which
were proved without name in previous files.
-/
notation `|`x`|` := abs x
-- The mathlib version is unusable bec... |
99ec145612331767bc1a95e9ddfdc6c60c208a90 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tests/lean/run/extmacro.lean | edebeeccebcaa953bdc410d51096d813278d5845 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | cipher1024/lean4 | 6e1f98bb58e7a92b28f5364eb38a14c8d0aae393 | 69114d3b50806264ef35b57394391c3e738a9822 | refs/heads/master | 1,642,227,983,603 | 1,642,011,696,000 | 1,642,011,696,000 | 228,607,691 | 0 | 0 | Apache-2.0 | 1,576,584,269,000 | 1,576,584,268,000 | null | UTF-8 | Lean | false | false | 465 | lean | macro "ext_tactic" t:tactic "=>" newT:tactic : command => `(macro_rules | `($t) => `($newT))
syntax "trivial'" : tactic
ext_tactic trivial' => apply Eq.refl
theorem tst1 (x : Nat) : x = x :=
by trivial'
-- theorem tst2 (x y : Nat) (h : x = y) : x = y :=
-- by trivial' -- fail as expected
ext_tactic trivial' => ass... |
4eb47abc90b76af220a5d0e302fda4f1cb406602 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/topology/uniform_space/complete_separated.lean | 2fe96b6f882b9ff8825da9538f18e109b91ec674 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,205 | 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.topology.uniform_space.cauchy
import Mathlib.topology.uniform_space.separation
import... |
ee5c681df2ac033881ee0e62febe7c9307350bf9 | 1a61aba1b67cddccce19532a9596efe44be4285f | /library/init/quot.lean | c28104ace8bf5e32bab7e463f7958e80c3e22207 | [
"Apache-2.0"
] | permissive | eigengrau/lean | 07986a0f2548688c13ba36231f6cdbee82abf4c6 | f8a773be1112015e2d232661ce616d23f12874d0 | refs/heads/master | 1,610,939,198,566 | 1,441,352,386,000 | 1,441,352,494,000 | 41,903,576 | 0 | 0 | null | 1,441,352,210,000 | 1,441,352,210,000 | null | UTF-8 | Lean | false | false | 7,834 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
Quotient types.
-/
prelude
import init.sigma init.setoid init.logic
open sigma.ops setoid
constant quot.{l} : Π {A : Type.{l}}, setoid A → Type.{l}
-- Remar... |
f5b775e2e8e4373a5e85235f82f0525b95b61f8a | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/monoid_algebra/division.lean | 4478367e461e095ade6e8de0daa9d98a02576bac | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 6,722 | lean | /-
Copyright (c) 2022 Eric Wieser. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Eric Wieser
-/
import algebra.monoid_algebra.basic
import data.finsupp.order
/-!
# Division of `add_monoid_algebra` by monomials
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes... |
7766b180eb06a8828d9920adcbd4f08b09006b19 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/linear_algebra/contraction.lean | 5ba16aa6dd0097530f76c3a906a08f4857074a15 | [
"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 | 12,348 | lean | /-
Copyright (c) 2020 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash, Antoine Labelle
-/
import linear_algebra.dual
import linear_algebra.matrix.to_lin
import linear_algebra.tensor_product_basis
import linear_algebra.free_module.finite.rank
/-... |
fe703425e70cc5f34108e6a32f5d091d8724cfa8 | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/data/multiset/nat_antidiagonal.lean | 2ffeba956d9dd14c60bd1711605ca55506b6d0a5 | [
"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 | 1,276 | 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.multiset.nodup
import data.list.nat_antidiagonal
/-!
# The "antidiagonal" {(0,n), (1,n-1), ..., (n,0)} as a multiset.
-/
namespace multiset
namespace na... |
c0dfc482c78eb73057e41b74ad9fafacf3d84022 | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/topology/sheaves/sheaf_condition/unique_gluing.lean | 75cf8c722ad3e89ddd1d12f4235618ebcbed1faf | [
"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 | 10,818 | lean | /-
Copyright (c) 2021 Justus Springer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Justus Springer
-/
import algebra.category.CommRing.limits
import topology.sheaves.forget
import topology.sheaves.sheaf
import category_theory.limits.shapes.types
import category_theo... |
b180b8deda9ea08a8ed6ba21fc3091c1f4b1d689 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/polynomial/div_auto.lean | cd3db3ec7ae5d7f136a83c09b771978c320dc01a | [] | 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 | 11,458 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Johannes Hölzl, Scott Morrison, Jens Wagemaker
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.polynomial.monic
import Mathlib.ring_theor... |
4068c563e4b554c86131f40f239e29bdbf98a11b | bb31430994044506fa42fd667e2d556327e18dfe | /src/measure_theory/covering/density_theorem.lean | a17f343fa85119edfa815003716f4c6b1d4c0fe1 | [
"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 | 8,564 | lean | /-
Copyright (c) 2022 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import measure_theory.measure.doubling
import measure_theory.covering.vitali
import measure_theory.covering.differentiation
/-!
# Doubling measures and Lebesgue's density ... |
b7c51efa429321dba128ada7a728b25a076241b5 | 4727251e0cd73359b15b664c3170e5d754078599 | /archive/imo/imo1964_q1.lean | ac90068a7afb6b243b949412a9741c84e125bf9b | [
"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 | 2,765 | lean | /-
Copyright (c) 2020 Kevin Buzzard. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Buzzard
-/
import tactic.interval_cases
import data.nat.modeq
/-!
# IMO 1964 Q1
(a) Find all positive integers $n$ for which $2^n-1$ is divisible by $7$.
(b) Prove that there ... |
6cc09760e7d6a86cc04d7f9e6d288af6291ae922 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/imp2.lean | 64a83dc4f2387c0e00030396f33b7556c9c93ecb | [
"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 | 133 | lean | #check (λ {A : Type} (a : A), a) (10:nat)
set_option trace.app_builder true
#check (λ {A} (a : A), a) 10
#check (λ a, a) (10:nat)
|
ea20ce0d09f41acdae842903bf521612ede01860 | 66a6486e19b71391cc438afee5f081a4257564ec | /higher_groups.hlean | 9655088e794d0f9633a7fcbbf36b4c4ba2f5d2fc | [
"Apache-2.0"
] | permissive | spiceghello/Spectral | c8ccd1e32d4b6a9132ccee20fcba44b477cd0331 | 20023aa3de27c22ab9f9b4a177f5a1efdec2b19f | refs/heads/master | 1,611,263,374,078 | 1,523,349,717,000 | 1,523,349,717,000 | 92,312,239 | 0 | 0 | null | 1,495,642,470,000 | 1,495,642,470,000 | null | UTF-8 | Lean | false | false | 5,492 | hlean | /-
Copyright (c) 2015 Ulrik Buchholtz, Egbert Rijke and Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Ulrik Buchholtz, Egbert Rijke, Floris van Doorn
Formalization of the higher groups paper
-/
import .move_to_lib
open eq is_conn pointed is_trunc t... |
9e6676d25cb8421e4ed5f6205d1f980cf9f5b638 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebra/order/hom/monoid.lean | c4ad367c017c9ab6317bb2fd21d60829538b37ff | [
"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 | 18,726 | lean | /-
Copyright (c) 2022 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies
-/
import algebra.hom.group
import algebra.order.with_zero
import order.hom.basic
/-!
# Ordered monoid and group homomorphisms
This file defines morphisms between (additiv... |
2486d7733cdbe485edb2aa74909cbfcfd184931b | 2a8b9c9fb34993732e24b7934050207f28675948 | /lua/tests/fixtures/example-lean4-project/foo/Foo.lean | b93dae5568b7484a9107f6c3c5cb22f5cbd103fe | [
"MIT"
] | permissive | jcommelin/lean.nvim | 471b8c2c16f47e76dfc36dc85d1e9cf6938b58e6 | b10a525f65cd2fda1c2e629d4b68f241caf67d64 | refs/heads/main | 1,691,387,304,436 | 1,633,447,198,000 | 1,633,447,198,000 | 413,898,327 | 0 | 0 | MIT | 1,633,451,737,000 | 1,633,451,737,000 | null | UTF-8 | Lean | false | false | 15 | lean | def best := 37
|
dfc73775336171fa3720f49f326a738a591a1208 | e151e9053bfd6d71740066474fc500a087837323 | /src/hott/init/function.lean | b32a8c276b81504b8ee92075f31da964e2f4000a | [
"Apache-2.0"
] | permissive | daniel-carranza/hott3 | 15bac2d90589dbb952ef15e74b2837722491963d | 913811e8a1371d3a5751d7d32ff9dec8aa6815d9 | refs/heads/master | 1,610,091,349,670 | 1,596,222,336,000 | 1,596,222,336,000 | 241,957,822 | 0 | 0 | Apache-2.0 | 1,582,222,839,000 | 1,582,222,838,000 | null | UTF-8 | Lean | false | false | 854 | 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
General operations on functions.
-/
import .meta.support .path0
universes u v w
hott_theory
namespace function
@[hott] def compose_right {A B} (f : B → B → ... |
bcb3c989ca88c98e198a20eb4ed1c243d02dc507 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/data/padics/padic_norm.lean | 33d9c7d24b93838c1f8cd46eae95cadb6648aacb | [
"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 | 25,148 | 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 ring_theory.int.basic
import algebra.field_power
import ring_theory.multiplicity
import data.real.cau_seq
import tactic.ring_exp
import tactic.basic
/-!
# p... |
0e80c36016ccf4509167792f0e8096cc1d46e531 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Elab/PreDefinition/Structural/Basic.lean | c3f392129ecbe7d0f084babdd028e2773c6bd03d | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 2,832 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Meta.Basic
import Lean.Meta.ForEachExpr
namespace Lean.Elab.Structural
structure RecArgInfo where
/-- `fixedParams ++ ys` are the arguments ... |
258c022062992703d9e7e80a60a0ea3cd0cfd8c9 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/monad/types_auto.lean | e967b02c88a3a09fa6e981f876cb0701c0c0f33a | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,233 | 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, Bhavik Mehta
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.category_theory.monad.basic
import Mathlib.category_theory.monad.kleisli
impo... |
34a9d0ab2a3c11c930b7b85c491432e6f8109a1e | 4fa161becb8ce7378a709f5992a594764699e268 | /src/analysis/calculus/tangent_cone.lean | 1e39cc645272211ee0c8a4bfe02be8e77ea3d00f | [
"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 | 16,511 | 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.convex.basic
import analysis.normed_space.bounded_linear_maps
import analysis.specific_limits
/-!
# Tangent cone
In this file, we define two p... |
d441a5aa8ca6773f0fdce38f9782e800db638207 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /library/init/relation.lean | f43b4f70937caab24f93fce7bae89694afd86074 | [
"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,709 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module init.relation
Authors: Leonardo de Moura
-/
prelude
import init.logic
-- TODO(Leo): remove duplication between this file and algebra/relation.lean
-- We need some of the followi... |
226f5ad9fb9a62bc4d8720b5058137ffdfcd7cec | f5f7e6fae601a5fe3cac7cc3ed353ed781d62419 | /src/tactic/rcases.lean | 2cac91bd155830addc5fb407c85beeea0eb50dec | [
"Apache-2.0"
] | permissive | EdAyers/mathlib | 9ecfb2f14bd6caad748b64c9c131befbff0fb4e0 | ca5d4c1f16f9c451cf7170b10105d0051db79e1b | refs/heads/master | 1,626,189,395,845 | 1,555,284,396,000 | 1,555,284,396,000 | 144,004,030 | 0 | 0 | Apache-2.0 | 1,533,727,664,000 | 1,533,727,663,000 | null | UTF-8 | Lean | false | false | 14,558 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.dlist tactic.cache
open lean lean.parser
namespace tactic
/-
These synonyms for `list` are used to clarify the meanings of the many
usages of lists in ... |
7f72631db8a7be60040e5313020fa87334eefa1f | 8c433fccc85bae2c68bb34c8969dd5f6fe94945b | /src/mywork/practice_1.lean | 3bc95ef8aa87e4352ce97cea0a1972ec6a15d410 | [] | no_license | arh4uwe/cs2120f21 | f2a844538124e9739b94bdb99a86221866c854ac | 2cfb17c7b84a07a672b792fc85824f3de7c27e7a | refs/heads/main | 1,691,945,681,056 | 1,632,839,762,000 | 1,632,839,762,000 | 400,231,555 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,234 | lean | /-
EQUALITY
-/
/- #1
Suppose that x, y, z, and w are arbitrary objects of some type,
T; and suppose further that we know (have proofs of the facts)
that x = y, y = z, and w = z. Give a very, very short English
proof of the conjecture that z = w. You can use not only the
axioms of equality, but either of the theo... |
341e284ec92ccb786aa76c817524f2993e7cc589 | 5ae26df177f810c5006841e9c73dc56e01b978d7 | /src/logic/basic.lean | 33c250201cb2921ad2d463c2e32e3eb3ae7d83a4 | [
"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 | 28,042 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura
Theorems that require decidability hypotheses are in the namespace "decidable".
Classical versions are in the namespace "classical".
Note: in the pres... |
293e7760799bca8bcc2e21ac6136da18985151ce | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /stage0/src/Lean/Meta/ExprDefEq.lean | 268ecbc21d617cf0cd49dd1a3225c6585caf9ee4 | [
"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 | 57,204 | 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.ProjFns
import Lean.Meta.WHNF
import Lean.Meta.InferType
import Lean.Meta.FunInfo
import Lean.Meta.LevelDefEq
import Lean.Meta.Check
import Lean... |
fc6d58b7b2dcf77a99bb97ce8781d7fecac629ae | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/order/cover.lean | e654312d37f98e557be5ad150616ff10e29a5283 | [
"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 | 16,494 | lean | /-
Copyright (c) 2021 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies, Violeta Hernández Palacios, Grayson Burton, Floris van Doorn
-/
import data.set.intervals.ord_connected
import order.antisymmetrization
/-!
# The covering relation
> THIS... |
043f099c50f4f1227f261f137e7e8e25ef129573 | 7cdf3413c097e5d36492d12cdd07030eb991d394 | /src/game/world6/level6.lean | 3cfdbd1b6f1df3705b971053b9e9a82b4306068c | [] | no_license | alreadydone/natural_number_game | 3135b9385a9f43e74cfbf79513fc37e69b99e0b3 | 1a39e693df4f4e871eb449890d3c7715a25c2ec9 | refs/heads/master | 1,599,387,390,105 | 1,573,200,587,000 | 1,573,200,691,000 | 220,397,084 | 0 | 0 | null | 1,573,192,734,000 | 1,573,192,733,000 | null | UTF-8 | Lean | false | false | 1,318 | lean | /-
# Proposition world.
## Level 6 : `(P → (Q → R)) → ((P → Q) → (P → R))`.
You can solve this level completely just using `intro`, `apply` and `exact`,
but if you want to argue forwards instead of backwards then don't forget
that you can do things like `have j : Q → R := f p` if `f : P → (Q → R)`
and `p : P`. I rec... |
73fd3c0fcc3ce936e3a46ac29a9177cf9f864466 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/order/rel_iso/basic.lean | 5975e5bc02c64d9e749b04d2c4c81f99cd856fbe | [
"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 | 26,022 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.fun_like.basic
import logic.embedding.basic
import order.rel_classes
/-!
# Relation homomorphisms, embeddings, isomorphisms
> THIS FILE IS SYNCHRONIZED ... |
666d765a1fdf5f13a58deeef906b09b3e55b5d24 | 07c6143268cfb72beccd1cc35735d424ebcb187b | /src/analysis/ODE/gronwall.lean | ede54e6c6dd20893ab0dbe2513be14ef1af66340 | [
"Apache-2.0"
] | permissive | khoek/mathlib | bc49a842910af13a3c372748310e86467d1dc766 | aa55f8b50354b3e11ba64792dcb06cccb2d8ee28 | refs/heads/master | 1,588,232,063,837 | 1,587,304,803,000 | 1,587,304,803,000 | 176,688,517 | 0 | 0 | Apache-2.0 | 1,553,070,585,000 | 1,553,070,585,000 | null | UTF-8 | Lean | false | false | 13,198 | 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 analysis.calculus.mean_value analysis.complex.exponential
/-!
# Grönwall's inequality
The main technical result of this file is the Grönwall-like inequalit... |
95cba98c600b341c460c39d3438f18cc4fc8362e | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/topology/unit_interval.lean | 747f0252a9b0ac3496251e880affed55eeadf6be | [
"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,848 | lean | /-
Copyright (c) 2020 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Scott Morrison
-/
import topology.instances.real
import topology.algebra.field
/-!
# The unit interval, as a topological space
Use `open_locale unit_interval` to turn... |
2e0c7b54a37e119c0e08491a151033cb994dcf86 | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /stage0/src/Leanpkg/Proc.lean | aeb5c05b4436f283ca4de54d7e9c633f14b006e5 | [
"Apache-2.0"
] | permissive | collares/lean4 | 861a9269c4592bce49b71059e232ff0bfe4594cc | 52a4f535d853a2c7c7eea5fee8a4fa04c682c1ee | refs/heads/master | 1,691,419,031,324 | 1,618,678,138,000 | 1,618,678,138,000 | 358,989,750 | 0 | 0 | Apache-2.0 | 1,618,696,333,000 | 1,618,696,333,000 | null | UTF-8 | Lean | false | false | 731 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner, Sebastian Ullrich
-/
namespace Leanpkg
def execCmd (args : IO.Process.SpawnArgs) : IO Unit := do
let envstr := String.join <| args.env.toList.map fun (k, v) =>... |
5dd87b1a56ed661662ba1dd773b2f45a80186ada | 618003631150032a5676f229d13a079ac875ff77 | /src/ring_theory/algebra_operations.lean | 6960afd00de96bcfa88896f0a8188cd0499a29f3 | [
"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 | 8,928 | lean | /-
Copyright (c) 2019 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
Multiplication and division of submodules of an algebra.
-/
import ring_theory.algebra
import ring_theory.ideals
import algebra.pointwise
universes u v
open algebra
local attr... |
7e1d52ab2135bcb5677cf160997a7dd386ba1321 | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/elab3.lean | 4d0a0a9560f67557fbf4a6f62f52864fca0493d3 | [
"Apache-2.0"
] | permissive | codyroux/lean0.1 | 1ce92751d664aacff0529e139083304a7bbc8a71 | 0dc6fb974aa85ed6f305a2f4b10a53a44ee5f0ef | refs/heads/master | 1,610,830,535,062 | 1,402,150,480,000 | 1,402,150,480,000 | 19,588,851 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 525 | lean | variable C : forall (A B : Type) (H : A = B) (a : A), B
variable D : forall (A A' : Type) (B : A -> Type) (B' : A' -> Type) (H : (forall x : A, B x) = (forall x : A', B' x)), A = A'
variable R : forall (A A' : Type) (B : A -> Type) (B' : A' -> Type) (H : (forall x : A, B x) = (forall x : A', B' x)) (a : A),
... |
657ae5f5e4f48774ff51ff4040903206fcb1351d | 4950bf76e5ae40ba9f8491647d0b6f228ddce173 | /src/order/filter/archimedean.lean | dc8229a33ba803807c9d377286b37b6217e16c90 | [
"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 | 1,978 | 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 order.filter.at_top_bot
import algebra.archimedean
/-!
# `at_top` filter and archimedean (semi)rings/fields
In this file we prove that for a... |
8cdae94ef6d539f5d0769ef50581fc55449b656a | 1b8f093752ba748c5ca0083afef2959aaa7dace5 | /src/category_theory/over.lean | 8cbccbd82ebdd0f93d02fcdf85ae0351a556aa70 | [] | no_license | khoek/lean-category-theory | 7ec4cda9cc64a5a4ffeb84712ac7d020dbbba386 | 63dcb598e9270a3e8b56d1769eb4f825a177cd95 | refs/heads/master | 1,585,251,725,759 | 1,539,344,445,000 | 1,539,344,445,000 | 145,281,070 | 0 | 0 | null | 1,534,662,376,000 | 1,534,662,376,000 | null | UTF-8 | Lean | false | false | 478 | lean | import category_theory.category
import category_theory.tactics.obviously
universes u₁ v₁
namespace category_theory
variables {C : Type u₁} [𝒞 : category.{u₁ v₁} C]
include 𝒞
def over (Z : C) := Σ X : C, X ⟶ Z
instance category_over {Z : C} : category (over Z) :=
{ hom := λ X Y, { f : X.1 ⟶ Y.1 // f ≫ Y.2 = X.2 ... |
cbf6bc2f66e0a58c76a74871492f4c30d16e5075 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/let4.lean | d44ba795b1636640dec5ddd121e8785623adcca3 | [
"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 | 318 | lean | --
constant f : nat → nat → nat → nat
#check
let a : nat := 10,
b : nat := 10,
c : nat := 10
in f a b (f a 10 c)
#check
let a : nat := 10,
b : nat := let c : nat := 10 in f a c (f a a (f 10 a c)),
d : nat := 10,
e : nat := f (f 10 10 d) (f d 10 10) a
in f a b (f e d 10)
|
2d522632d716d12d9c084a897842f47d4dae3f18 | d29d82a0af640c937e499f6be79fc552eae0aa13 | /src/algebra/ring/basic.lean | abf510bcc3872f1e9dcb3dda0e0bf26859276ce6 | [
"Apache-2.0"
] | permissive | AbdulMajeedkhurasani/mathlib | 835f8a5c5cf3075b250b3737172043ab4fa1edf6 | 79bc7323b164aebd000524ebafd198eb0e17f956 | refs/heads/master | 1,688,003,895,660 | 1,627,788,521,000 | 1,627,788,521,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 46,206 | 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, Floris van Doorn, Amelia Livingston, Yury Kudryashov,
Neil Strickland
-/
import algebra.divisibility
import data.set.basic
/-!
# Properties and homomo... |
c479ee4056cc9f0cd4218ed272f94ca5a547a807 | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /tests/lean/277a.lean | 3a6d7948b6ec71c59488c663e108e88b39f2d520 | [
"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 | 61 | lean | infixl:67 " <<< " => nonexistant
#eval (1 <<< 11 : UInt64)
|
66ee2203016c460913749ca97fc50378396e4946 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/nat_sub_ematch.lean | b92e94b20fd31bf16ac60b1b2bd3af61364c8f83 | [
"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 | 273 | lean | set_option trace.smt.ematch true
example (a b c d : nat) (f : nat → nat) : f d = a + b → f d - a + c = b + c :=
begin [smt]
intros,
eblast
end
example (a b c d : nat) (f : nat → nat) : f d = a + b → f d - (a + c) = b - c :=
begin [smt]
intros,
eblast
end
|
a86136ddc61fb8472a6024a5d90b23c8115fc9a3 | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/data/equiv/basic.lean | 3e774cca60a9288bdf016b7a0f6bf0d35c5aca17 | [
"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 | 104,965 | 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 data.sigma.basic
/-!
# Equivalence between types
In this file we define two types:
* `equiv α β` a.k.a. `... |
f9c9fdff1be2eea4dd5b0c7659dcea44693e8868 | 5ec8f5218a7c8e87dd0d70dc6b715b36d61a8d61 | /archi/sorry.lean | 5c31f54f2e44a99a72eba23c8e2e112e2846916e | [] | no_license | mbrodersen/kremlin | f9f2f9dd77b9744fe0ffd5f70d9fa0f1f8bd8cec | d4665929ce9012e93a0b05fc7063b96256bab86f | refs/heads/master | 1,624,057,268,130 | 1,496,957,084,000 | 1,496,957,084,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 654 | lean | import ..flocq
/- Indeterminate architecture -/
namespace archi
open flocq
def ptr64 : bool := sorry
def big_endian : bool := sorry
def align_int64 : ℕ := sorry
def align_float64 : ℕ := sorry
def splitlong : bool := sorry
lemma splitlong_ptr32 : splitlong = tt → ptr64 = ff := sorry
def default_pl_64 : bool × na... |
112b06eb67fbced7183a0a76f658fc2937de0d30 | bb31430994044506fa42fd667e2d556327e18dfe | /src/analysis/convex/star.lean | e0a9eaeb1ec41f89d63ed6a14f1711f73297fe52 | [
"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 | 15,886 | lean | /-
Copyright (c) 2021 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies
-/
import analysis.convex.segment
/-!
# Star-convex sets
This files defines star-convex sets (aka star domains, star-shaped set, radially convex set).
A set is star-conve... |
dfd94866d91f70ae78d0d48a6c1d53b373ef9127 | 1cf22246c4b252de3413c52c648141eae89ad1d7 | /list.lean | dfac7b15b2a9abae2214e3fe35813a4965122ccd | [] | no_license | makenowjust-labs/lean-playground | 45c52b6095c8a8832654f02344f99ae9da0b81bb | a0ce8655776cab37ed212814eb5443667f75ecbc | refs/heads/master | 1,644,228,245,917 | 1,542,554,565,000 | 1,542,554,565,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,490 | lean | namespace hidden
universe u
variables {α : Type u}
inductive list (α : Type u)
| nil {} : list
| cons : α → list → list
notation h :: t := list.cons h t
namespace list
def append (s t : list α) : list α :=
list.rec t (λ x l u, x :: u) s
instance list_has_append : has_append (list α) := ⟨append⟩
lemma ni... |
1f7628c820c00c00694e4cef04efd332f3502490 | a4673261e60b025e2c8c825dfa4ab9108246c32e | /stage0/src/Init/Data/List/Basic.lean | f8cf06a262bba469ab4c3630d9b66ae49cff7392 | [
"Apache-2.0"
] | permissive | jcommelin/lean4 | c02dec0cc32c4bccab009285475f265f17d73228 | 2909313475588cc20ac0436e55548a4502050d0a | refs/heads/master | 1,674,129,550,893 | 1,606,415,348,000 | 1,606,415,348,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 11,898 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
prelude
import Init.Core
import Init.Data.Nat.Basic
open Decidable List
universes u v w
variables {α : Type u} {β : Type v} {γ : Type w}
namespace List
d... |
284ebed4cbb2bee0fec7e7c364147a86d5aa73f4 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /library/init/wf.lean | 6e3809871774c1fb3f9c7752516efd6bb11b8265 | [
"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 | 7,088 | 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.data.nat.basic init.data.prod
universes u v
inductive acc {α : Sort u} (r : α → α → Prop) : α → Prop
| intro : ∀ x, (∀ y, r y x → acc y... |
9152a60be2624cf5acbad5f57ab3b8631b2dc4ac | 4fa161becb8ce7378a709f5992a594764699e268 | /src/linear_algebra/linear_pmap.lean | 8de5b18a260585a90aa880f1c90e68720b8a2996 | [
"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 | 15,697 | 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 linear_algebra.basic
/-!
# Partially defined linear maps
A `linear_pmap R E F` is a linear map from a submodule of `E` to `F`. We define
a `semilattice_inf_... |
2b043d5acbcbc668fae9546e70e5f8167ad5a8ce | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/blast_safe_log_issue2.lean | 9469d4c8bf92d5a9b87358935d369b50798f4c48 | [
"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,334 | lean | import data.real
open real
namespace safe
definition pos (x : ℝ) := x > 0
definition nzero (x : ℝ) := x ≠ 0
constants (exp : ℝ → ℝ)
constants (safe_log : Π (x : ℝ), pos x → ℝ)
constants (safe_inv : Π (x : ℝ), nzero x → ℝ)
notation `log`:max x:max := (@safe_log x (by grind))
notation [priority 100000] x:max ⁻¹ := (... |
cc8748ffa57d31ca14fcf1773999771c77b2695b | 367134ba5a65885e863bdc4507601606690974c1 | /src/category_theory/pempty.lean | f43842b23686f39c5ca1d1cb07120a2d40de1180 | [
"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 | 1,295 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Bhavik Mehta.
-/
import category_theory.discrete_category
/-!
# The empty category
Defines a category structure on `pempty`, and the unique functor `pempty ⥤ C` for a... |
4ea6efd61efc0cc158bd81deeeb5c5f6bfeca984 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/category_theory/concrete_category/bundled_hom.lean | 9ead97076a4d19126db7f1ae458daf8ed7f758a1 | [
"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 | 3,843 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Yury Kudryashov
-/
import category_theory.concrete_category.basic
import category_theory.concrete_category.bundled
/-!
# Category instances for algebraic structures th... |
9ceb7884665f50d85fd97f000514036d2799f0b1 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/category_theory/triangulated/basic.lean | fb6ce12029b9d0b5001c856f53bc89b3f3c45d38 | [
"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 | 4,006 | lean | /-
Copyright (c) 2021 Luke Kershaw. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Luke Kershaw
-/
import data.int.basic
import category_theory.shift
/-!
# Triangles
This file contains the definition of triangles in an additive category with an additive shift.
It als... |
9d67e868c38edca173298db8a0ce540ff9af2e4d | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/logic/function/iterate.lean | 92a8484d368929028b83a6284b69a495c3734ea5 | [
"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,598 | 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 logic.function.conjugate
/-!
# Iterations of a function
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> https://github.com/leanprover-community/mathlib4/pull/... |
f098678496b8b14847ba4b9e86afe2ba7ce29de4 | f083c4ed5d443659f3ed9b43b1ca5bb037ddeb58 | /category_theory/functor_category.lean | 9fb641bda5ceceb5cca5da7e2ab9a0366493027b | [
"Apache-2.0"
] | permissive | semorrison/mathlib | 1be6f11086e0d24180fec4b9696d3ec58b439d10 | 20b4143976dad48e664c4847b75a85237dca0a89 | refs/heads/master | 1,583,799,212,170 | 1,535,634,130,000 | 1,535,730,505,000 | 129,076,205 | 0 | 0 | Apache-2.0 | 1,551,697,998,000 | 1,523,442,265,000 | Lean | UTF-8 | Lean | false | false | 2,441 | 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
import category_theory.natural_transformation
namespace category_theory
universes u₁ v₁ u₂ v₂ u₃ v₃
open nat_trans
/--
`functor.c... |
febc57331a1ad0e80b06d84136acc393456bdcb0 | 367134ba5a65885e863bdc4507601606690974c1 | /src/algebraic_geometry/presheafed_space/has_colimits.lean | 9039b49433eae32131e78866b8a8e97d25e33da4 | [
"Apache-2.0"
] | permissive | kodyvajjha/mathlib | 9bead00e90f68269a313f45f5561766cfd8d5cad | b98af5dd79e13a38d84438b850a2e8858ec21284 | refs/heads/master | 1,624,350,366,310 | 1,615,563,062,000 | 1,615,563,062,000 | 162,666,963 | 0 | 0 | Apache-2.0 | 1,545,367,651,000 | 1,545,367,651,000 | null | UTF-8 | Lean | false | false | 10,246 | 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 algebraic_geometry.presheafed_space
import topology.category.Top.limits
import topology.sheaves.limits
import category_theory.limits.concrete_category
/-!
# `... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.