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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
c3a9efba0d3e297dd0ced0432dadfde97d328192 | 367134ba5a65885e863bdc4507601606690974c1 | /src/category_theory/action.lean | 2bf3bb2616f49a9903fa88e9301766ef067e5b74 | [
"Apache-2.0"
] | permissive | kodyvajjha/mathlib | 9bead00e90f68269a313f45f5561766cfd8d5cad | b98af5dd79e13a38d84438b850a2e8858ec21284 | refs/heads/master | 1,624,350,366,310 | 1,615,563,062,000 | 1,615,563,062,000 | 162,666,963 | 0 | 0 | Apache-2.0 | 1,545,367,651,000 | 1,545,367,651,000 | null | UTF-8 | Lean | false | false | 3,181 | lean | /-
Copyright (c) 2020 David Wärn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Wärn
-/
import category_theory.elements
import category_theory.single_obj
import group_theory.group_action.basic
/-!
# Actions as functors and as categories
From a multiplicative a... |
7633928e9c5f7835d34bbe9576d6e2edb763322c | 0403d75087eccd9fdec22713ec7cff4d40c93610 | /lean/love04_functional_programming_demo.lean | 359eecf64fe8ea21353d978cad4bf03c1481e5da | [] | no_license | 5l1v3r1/logical_verification_2020 | 9660ae5a83915be2103183490cae279b888be83c | 000aa1fe212813b8458bf26c16b8a97597b7417e | refs/heads/master | 1,621,861,800,557 | 1,586,181,042,000 | 1,586,181,042,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 12,943 | lean | import .lovelib
/-! # LoVe Demo 4: Functional Programming
We take a closer look at the basics of typed functional programming: inductive
types, pattern matching, recursive functions, and proofs by induction. -/
set_option pp.beta true
namespace LoVe
/-! ## Inductive Types
Recall the definition of type `nat` (=... |
fdbe3fff06f1a0bb42c3e2e338f1591075633790 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/algebra/lie/submodule.lean | a9b339dbdcf541edac683e469bade888b36e9d02 | [
"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 | 33,233 | lean | /-
Copyright (c) 2021 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import algebra.lie.subalgebra
import ring_theory.noetherian
/-!
# Lie submodules of a Lie algebra
In this file we define Lie submodules and Lie ideals, we construct the l... |
6ea8857319739ba651089112984be93e4a2b44c0 | 4950bf76e5ae40ba9f8491647d0b6f228ddce173 | /src/topology/subset_properties.lean | e1ec880dd58bb0af0677048468e30c306572f4fa | [
"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 | 59,288 | 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, Yury Kudryashov
-/
import topology.continuous_on
import data.finset.order
/-!
# Properties of subsets of topological spaces
## Main definitions
`comp... |
44aa3a1a77d584cb593ae727fee15fbfc2ab1d00 | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/analysis/convex/independent.lean | 796737008d762a430e2fc2a73c823686f12dd309 | [
"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 | 8,538 | lean | /-
Copyright (c) 2021 Yaël Dillies, Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies, Bhavik Mehta
-/
import analysis.convex.caratheodory
import analysis.convex.extreme
import linear_algebra.affine_space.independent
/-!
# Convex independence
... |
4fdc3b8c89a36d82ec9a3d3bb77b0fc8c57465a8 | 4e0d7c3132ce31edc5829849735dd25db406b144 | /lean/love05_inductive_predicates_exercise_sheet.lean | 783e2d3df5675e6058dc77a060ccde5075b00ee9 | [] | no_license | gonzalgu/logical_verification_2020 | a0013a6c22ea254e9f4d245f2948f0f4d44df4bb | 724d0457dff2c3ff10f9ab2170388f4c5e958b75 | refs/heads/master | 1,660,886,374,533 | 1,589,859,641,000 | 1,589,859,641,000 | 256,069,971 | 0 | 0 | null | 1,586,997,430,000 | 1,586,997,429,000 | null | UTF-8 | Lean | false | false | 5,185 | lean | import .love05_inductive_predicates_demo
/-! # LoVe Exercise 5: Inductive Predicates -/
set_option pp.beta true
namespace LoVe
/-! ## Question 1: Even and Odd
The `even` predicate is true for even numbers and false for odd numbers. -/
#check even
/-! We define `odd` as the negation of `even`: -/
def odd (n :... |
de1aba6a1ead8a4d851e37ce475542fb226b6824 | 4ec0e92c725fad3fd2871a0ab050a7da1c719444 | /src/mywork/exam1.lean | 72176bf8c7910cc323410fce64a086c5a2c5058c | [] | no_license | mitchelltaylor06/cs2120f21 | cc2c2b61a7e45c07faa849fcb8a66eb948753a25 | efb71a748d7c76e24834d03b8f01c3ae084c1756 | refs/heads/main | 1,693,841,444,092 | 1,633,713,850,000 | 1,633,713,850,000 | 399,946,415 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,320 | lean | /-
*******************************
PART 1 of 2: AXIOMS [50 points]
*******************************
-/
/-
Explain the inference (introduction and
elimination) rules of predicate logic as
directed below. To give you guidance on
how to answer these questions we include
answers for some questions.
-/
-- ------... |
69cb2fb8bd5971b1c9ad8d5efafce7b8e93a119b | 432d948a4d3d242fdfb44b81c9e1b1baacd58617 | /src/algebra/algebra/subalgebra.lean | 510a1a7300b059a61dc0c9e989e8731860304d04 | [
"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 | 26,331 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Yury Kudryashov
-/
import algebra.algebra.operations
/-!
# Subalgebras over Commutative Semiring
In this file we define `subalgebra`s and the usual operations on them (`map`, `... |
0cc4f64deb027e964c5630ed4ddf6fcf22663ae2 | 67190c9aacc0cac64fb4463d93e84c696a5be896 | /Lists of exercises/List 8/Lista8-LucasDomingues.lean | bec4229d3439b18ed3a946fe6cf839e23c31b81a | [] | no_license | lucasresck/Discrete-Mathematics | ffbaf55943e7ce2c7bc50cef7e3ef66a0212f738 | 0a08081c5f393e5765259d3f1253c3a6dd043dac | refs/heads/master | 1,596,627,857,734 | 1,573,411,500,000 | 1,573,411,500,000 | 212,489,764 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,966 | lean | -- Estudante: Lucas Emanuel Resck Domingues
open nat
--1.a.
example : ∀ m n k : nat, m * (n + k) = m * n + m * k :=
assume m n k,
nat.rec_on k
(show m * (n + 0) = m * n + m * 0, from calc
m * (n + 0) = m * n : by rw add_zero
... = m * n + 0 :... |
800b612c3062ec14a7db54c0d38b4b727516c03b | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/category_theory/with_terminal.lean | f56baf302a2bb80417c3309e71dd42e4c2f9d810 | [
"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 | 11,899 | lean | /-
Copyright (c) 2021 Adam Topaz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Adam Topaz
-/
import category_theory.limits.shapes.terminal
/-!
# `with_initial` and `with_terminal`
Given a category `C`, this file constructs two objects:
1. `with_terminal C`, the ca... |
6522aef6c23ca5335e5b29b1e1471783e55a5ad2 | 865fccc998322821ec90764a00c06aa38e8f371a | /monotone.lean | 51411184804095b8f9d64e099b6a0ff68fbf41d4 | [] | no_license | semorrison/lean-monotone-class | 2601316f7281dd398ef629e50ba34a760d2a632b | 312f8628ce2872f647ee42398dbf38d9ebf65493 | refs/heads/master | 1,627,247,514,511 | 1,510,001,892,000 | 1,510,001,892,000 | 103,790,048 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 15,372 | lean | import tidy.tidy
import data.set
open set
structure boolean_algebra ( α : Type ) :=
( contains : set (set α) )
( contains_universe : contains univ )
( complements : ∀ { s : set α }, contains s → contains (compl s) )
( unions : ∀ { s t : set α }, contains s → contains t → contains (s ∪ t) )
definition interse... |
3571f0cbda4e4de19b7bd9ad5c72acea7b4975d7 | caa1512363b76923d0e9cdb716122a5c26c3c6bc | /src/LP.lean | d38e8b8a2c2268e116bdfc763c92fe57d10da273 | [] | no_license | apurvanakade/cvx | deb20e425ce478159a98e1ffc0d37f9c88a89280 | b47784831339df5a3e45f5cddd84edc545f95808 | refs/heads/master | 1,687,403,288,536 | 1,555,930,740,000 | 1,555,930,740,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,075 | lean | import .NN .misc system.io
variables {α : Type} [has_mul α] [add_comm_monoid α] [has_le α]
variables {k m n : nat}
structure LP (α : Type) (m n : nat) :=
(obf : N α)
(lhs : NN α)
(rhs : N α)
def LP.feasible : LP α m n → N α → Prop
| ⟨m, n, c, A, b⟩ x := N.le m (mul_vec n A x) b ∧ (N.le n (N.zero α) x)
def LP.i... |
4fd664367586b94053cb084e1e5e46500850c3d8 | 30b012bb72d640ec30c8fdd4c45fdfa67beb012c | /algebra/group.lean | e16ef6efa3b2d399584839d1d460f45c59b9e4be | [
"Apache-2.0"
] | permissive | kckennylau/mathlib | 21fb810b701b10d6606d9002a4004f7672262e83 | 47b3477e20ffb5a06588dd3abb01fe0fe3205646 | refs/heads/master | 1,634,976,409,281 | 1,542,042,832,000 | 1,542,319,733,000 | 109,560,458 | 0 | 0 | Apache-2.0 | 1,542,369,208,000 | 1,509,867,494,000 | Lean | UTF-8 | Lean | false | false | 27,669 | 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
Various multiplicative and additive structures.
-/
import tactic.interactive data.option
section pending_1857
/- Transport multiplicative to additive... |
35dd9f06f505e1f4ede9a15258af9550be1ef458 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/number_theory/lucas_lehmer.lean | 7dcc83f26b14879744de61c4b74a75f568dbc0d7 | [
"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 | 16,994 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Scott Morrison, Ainsley Pahljina
-/
import data.nat.parity
import data.pnat.interval
import data.zmod.basic
import group_theory.order_of_element
import ring_theory.fint... |
a580dc9470a9482be5d42ae9d39fa3fb7f7cd2d9 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/tokenErrors.lean | 8a20c89612cd0180915f1e42a2d2ca3447a7cd38 | [
"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 | 65 | lean | #check 'hi
#check '\y'
#check "hi
#check hi.«
/--
#print Nat
/-
|
a3479ff2b1572bdcb0c1050fed6d25b7e9e89de8 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/fin/tuple/sort.lean | 27d0bcc70bfbf311f87f62e0ea7539cb061a1217 | [
"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,328 | lean | /-
Copyright (c) 2021 Kyle Miller. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kyle Miller
-/
import data.finset.sort
import data.list.fin_range
import data.prod.lex
import group_theory.perm.basic
/-!
# Sorting tuples by their values
> THIS FILE IS SYNCHRONIZED W... |
69c5311f493dbbca9b5b48a5b0ada6466232da3d | 5d166a16ae129621cb54ca9dde86c275d7d2b483 | /tests/lean/run/imp3.lean | c77cda007b36aaa184f1d9d17283519c6b57d4dd | [
"Apache-2.0"
] | permissive | jcarlson23/lean | b00098763291397e0ac76b37a2dd96bc013bd247 | 8de88701247f54d325edd46c0eed57aeacb64baf | refs/heads/master | 1,611,571,813,719 | 1,497,020,963,000 | 1,497,021,515,000 | 93,882,536 | 1 | 0 | null | 1,497,029,896,000 | 1,497,029,896,000 | null | UTF-8 | Lean | false | false | 237 | lean | structure [class] is_equiv {A B : Type} (f : A → B) :=
(inv : B → A)
#check @is_equiv.inv
namespace is_equiv
section
parameters A B : Type
parameter f : A → B
parameter c : is_equiv f
#check inv f
end
end is_equiv
|
a9c12553056a90d2f0f75cb05b4fbd55a5d57894 | 510e96af568b060ed5858226ad954c258549f143 | /data/list/comb.lean | 3becb23575b139d66f406d9551af013f4a9b4282 | [] | no_license | Shamrock-Frost/library_dev | cb6d1739237d81e17720118f72ba0a6db8a5906b | 0245c71e4931d3aceeacf0aea776454f6ee03c9c | refs/heads/master | 1,609,481,034,595 | 1,500,165,215,000 | 1,500,165,347,000 | 97,350,162 | 0 | 0 | null | 1,500,164,969,000 | 1,500,164,969,000 | null | UTF-8 | Lean | false | false | 19,924 | lean | /-
Copyright (c) 2015 Leonardo de Moura. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
αuthors: Leonardo de Moura, Haitao Zhang, Floris van Doorn, Jeremy Avigad
List combinators.
-/
-- TODO(Leo): uncomment data.equiv after refactoring
import .basic ..bool data.list.comb --dat... |
e50612088b790ec6820b57c755b876eaa2fd94cd | 0d7f5899c0475f9e105a439896d9377f80c0d7c3 | /src/.old/fron_ualg.lean | 5c9bbde67d60cf43fcd958172ca8dadf5113f0f1 | [] | no_license | adamtopaz/UnivAlg | 127038f320e68cdf3efcd0c084c9af02fdb8da3d | 2458d47a6e4fd0525e3a25b07cb7dd518ac173ef | refs/heads/master | 1,670,320,985,286 | 1,597,350,882,000 | 1,597,350,882,000 | 280,585,500 | 4 | 0 | null | 1,597,350,883,000 | 1,595,048,527,000 | Lean | UTF-8 | Lean | false | false | 933 | lean | import .add_rules
import .fron_ralg
namespace ualg
variables {L0 : lang} {R0 : rules L0}
variables {L : lang} {R : rules L}
variables (ι : R0 →$ R) (A : ualg L0 R0)
include ι A
def fron : ualg L R := addr (ralg.fron ι.lhom A.raw) R
namespace fron
def univ : A →% (fron ι A)⦃ι⦄ :=
(ralg.fron.univ ι.lhom A.raw).com... |
a1676ff1bbe51eaf059f36305b4512694ef4107b | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/topology/uniform_space/basic.lean | 2233c2ee3a6ea149375c7d726c7a31514662b31d | [
"Apache-2.0"
] | permissive | troyjlee/mathlib | e18d4b8026e32062ab9e89bc3b003a5d1cfec3f5 | 45e7eb8447555247246e3fe91c87066506c14875 | refs/heads/master | 1,689,248,035,046 | 1,629,470,528,000 | 1,629,470,528,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 68,572 | 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, Patrick Massot
-/
import order.filter.lift
import topology.separation
/-!
# Uniform spaces
Uniform spaces are a generalization of metric spaces and top... |
f7f4a3f16147008ba46f669b57557769c5e0e202 | 222111140d2023e142b07e9cd5119ac2829b36f5 | /src/gaussian_elimination.lean | df3fbe03d207a29af85718c04f0fb4237832b71e | [] | no_license | jjcrawford/lean-gaussian-elimination | 740dfdf2de89dc99c088c53e5221d9dfad3c0b92 | c473d33c07fa6f141d17d9dc42ad07956c33dd03 | refs/heads/master | 1,585,793,867,436 | 1,540,443,865,000 | 1,540,443,865,000 | 153,901,939 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 15,094 | lean | import ring_theory.matrix
import .row_equivalence
universes u
variables {m n : ℕ}
variable {α : Type u}
variable [division_ring α]
variable [decidable_eq α]
def ge_aux_findpivot : (fin m) → (fin m) → (fin n) → (matrix (fin m) (fin n) α) → (matrix (fin m) (fin n) α)
| ⟨0, h₁⟩ i₀ j₀ M := M
| ⟨(k + 1... |
2f6ab643f6890108eb3eb0761798ce36f546a141 | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/topology/instances/real_vector_space.lean | f9d990261d4a984587d65c507b82a3a4a0d17ba8 | [
"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 | 1,489 | 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 topology.algebra.module
import topology.instances.real
/-!
# Continuous additive maps are `ℝ`-linear
In this file we prove that a continuous map `f : E →+ ... |
fb969cbb33c163832f08725673e7cf6db988e746 | e38e95b38a38a99ecfa1255822e78e4b26f65bb0 | /src/certigrad/reference.lean | b899fb709c0b71cf54032b9f9473e0a17cd4b8eb | [
"Apache-2.0"
] | permissive | ColaDrill/certigrad | fefb1be3670adccd3bed2f3faf57507f156fd501 | fe288251f623ac7152e5ce555f1cd9d3a20203c2 | refs/heads/master | 1,593,297,324,250 | 1,499,903,753,000 | 1,499,903,753,000 | 97,075,797 | 1 | 0 | null | 1,499,916,210,000 | 1,499,916,210,000 | null | UTF-8 | Lean | false | false | 382 | lean | /-
Copyright (c) 2017 Daniel Selsam. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Daniel Selsam
References.
-/
import .id .tensor .util
namespace certigrad
@[reducible] def reference := ID × S
namespace reference
-- TODO(dhs): (much) better hash function
def hash... |
fc1a0329c20dda5cf16c7df37d9c337d269aa1e3 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/list/big_operators/lemmas.lean | 5cb2b62d1593fd7a5d9351020304c13917d0a464 | [
"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,834 | 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, Floris van Doorn, Sébastien Gouëzel, Alex J. Best
-/
import data.list.big_operators.basic
import algebra.group.opposite
import algebra.group_power.basic
import algebra.... |
58b4b5b7a2650fade242b827c6035f8c07264ae8 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /stage0/src/Init/Lean/Util/FindExpr.lean | 1b143f850574007fbc66def3ac7df65ca9b24875 | [
"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 | 2,086 | 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.Control.Option
import Init.Lean.Expr
namespace Lean
namespace Expr
namespace FindImpl
abbrev cacheSize : USize := 8192
structure Sta... |
acc3d85cb891edb812182b83274b1bc832bf9bbf | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/topology/vector_bundle.lean | b272000b597270f498001efdc78bbf2e8a7ec135 | [
"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 | 17,838 | lean | /-
Copyright © 2020 Nicolò Cavalleri. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nicolò Cavalleri, Sebastien Gouezel
-/
import topology.topological_fiber_bundle
import topology.algebra.module
/-!
# Topological vector bundles
In this file we define topological ve... |
7c5cd9de9b0843ee5f2906efdcf8070ba1d53f04 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/group_theory/perm/cycles.lean | 4658e5ed2ef7db3f829762a6885c3f536315c694 | [
"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 | 55,680 | lean | /-
Copyright (c) 2019 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import data.nat.parity
import data.equiv.fintype
import group_theory.perm.sign
import data.finset.noncomm_prod
/-!
# Cyclic permutations
## Main definitions
In the foll... |
1b5f52d6abc9bd860490583883326144c92fe9be | 9ad8d18fbe5f120c22b5e035bc240f711d2cbd7e | /src/exercises/mathcomp_book/odd.lean | 50367775ba5f5a580b88ac11655735102445d0b9 | [] | 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 | 3,100 | lean | import tactic.interactive tactic.squeeze data.nat.modeq
variables n m : nat
@[simp]
def is_odd_a : ℕ → bool
| 0 := ff
| (nat.succ n) := bnot (is_odd_a n)
#reduce is_odd_a (n + 2)
lemma odd_ss_a : is_odd_a (n + 2) = is_odd_a n :=
begin
dsimp[is_odd_a],
cases is_odd_a n; refl,
end
lemma odd_add_a : ∀ n m : ℕ ,
... |
16feec5c33a93f0562c1d32f9c90a85540b30627 | ae1e94c332e17c7dc7051ce976d5a9eebe7ab8a5 | /src/Lean/Meta/Match/Match.lean | b2395c6aa72cfb6406c301698098d9b05403309f | [
"Apache-2.0"
] | permissive | dupuisf/lean4 | d082d13b01243e1de29ae680eefb476961221eef | 6a39c65bd28eb0e28c3870188f348c8914502718 | refs/heads/master | 1,676,948,755,391 | 1,610,665,114,000 | 1,610,665,114,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 32,300 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Util.CollectLevelParams
import Lean.Util.Recognizers
import Lean.Compiler.ExternAttr
import Lean.Meta.Check
import Lean.Meta.Closure
import Lean... |
45dc925ba81db06cb5dc51f1c2545dac38c755fe | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/measure_theory/measure/finite_measure.lean | 08a21dd2b591e79253440b26446b003e33dfa332 | [
"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 | 33,204 | lean | /-
Copyright (c) 2021 Kalle Kytölä. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kalle Kytölä
-/
import topology.continuous_function.bounded
import topology.algebra.module.weak_dual
import measure_theory.integral.bochner
/-!
# Finite measures
This file defines the ... |
692099bd2752a098138fe5ef76f114f43f8d9b7b | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/set/n_ary.lean | 0ebf7b6ec2f87137700580cfeff713d3753b6695 | [
"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,138 | 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 data.set.prod
/-!
# N-ary images of sets
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding PR to mathlib4.
T... |
b67122a15e8db7e76d75d98b2f50d1627fd3df95 | 65807aed539a1b7077e26f006d2ee5724004fd5d | /src/partition.lean | 8abc1bcf1936069a0796c2f1fbc554963f429b2b | [] | no_license | b-mehta/generating-functions | d6c00769c751b3c4e5fd681a33fbcba43ab9243a | 2fc00b2ba7ed92d1e24682124cac146d23b47f92 | refs/heads/master | 1,671,586,110,726 | 1,601,063,036,000 | 1,601,063,036,000 | 296,391,458 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 23,419 | lean | import ring_theory.power_series
import combinatorics.composition
import data.nat.parity
import data.finset.nat_antidiagonal
import tactic.interval_cases
import tactic.apply_fun
import chap1
open finset
open_locale big_operators
lemma count_repeat_ite {α : Type*} [decidable_eq α] (a b : α) (n : ℕ) :
multiset.count ... |
7209b8d6f8ff694b82667c7ab7965f772230f1d0 | b70447c014d9e71cf619ebc9f539b262c19c2e0b | /hott/init/pointed.hlean | ecedb0e928f8b6d7ced148a39e453cf7acb3117e | [
"Apache-2.0"
] | permissive | ia0/lean2 | c20d8da69657f94b1d161f9590a4c635f8dc87f3 | d86284da630acb78fa5dc3b0b106153c50ffccd0 | refs/heads/master | 1,611,399,322,751 | 1,495,751,007,000 | 1,495,751,007,000 | 93,104,167 | 0 | 0 | null | 1,496,355,488,000 | 1,496,355,487,000 | null | UTF-8 | Lean | false | false | 4,122 | hlean | /-
Copyright (c) 2016 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
The definition of pointed types. This file is here to avoid circularities in the import graph
-/
prelude
import init.trunc
open eq equiv is_equiv is_trunc
struct... |
d51bba8ec05379025540210bc23e9af24ba95700 | 618003631150032a5676f229d13a079ac875ff77 | /src/category_theory/limits/shapes/equalizers.lean | 152a16cc1f03df4c9e3d019e677d4af715fa99a7 | [
"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 | 27,406 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Markus Himmel
-/
import category_theory.epi_mono
import category_theory.limits.shapes.finite_limits
/-!
# Equalizers and coequalizers
This file defines (co)equalizers... |
cd06b5422bdb03f401f12fffcfe97ba812711a6b | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/run/imp2.lean | 538d13aac82695759ec545976a7c160f82756f04 | [
"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 | 134 | lean | check (λ {A : Type.{1}} (a : A), a) (10:num)
set_option trace.app_builder true
check (λ {A} (a : A), a) 10
check (λ a, a) (10:num)
|
678442ffa2a11aa56940573f87276024671b7e2e | 2fbe653e4bc441efde5e5d250566e65538709888 | /src/topology/metric_space/closeds.lean | f7253cd47fb52a19474bce3769deacd08122aa23 | [
"Apache-2.0"
] | permissive | aceg00/mathlib | 5e15e79a8af87ff7eb8c17e2629c442ef24e746b | 8786ea6d6d46d6969ac9a869eb818bf100802882 | refs/heads/master | 1,649,202,698,930 | 1,580,924,783,000 | 1,580,924,783,000 | 149,197,272 | 0 | 0 | Apache-2.0 | 1,537,224,208,000 | 1,537,224,207,000 | null | UTF-8 | Lean | false | false | 22,272 | 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
-/
import topology.metric_space.hausdorff_distance topology.opens analysis.specific_limits
/-!
# Closed subsets
This file defines the metric and emetric space st... |
730966d0ef4edadd7bf6ddffcc5812eb10c04f34 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/pkg/user_ext/lakefile.lean | 370b5b551c6be402f84a1e32ac4647ca7edb2e8c | [
"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 | 85 | lean | import Lake
open System Lake DSL
package user_ext
@[defaultTarget] lean_lib UserExt
|
365f186743baea3d2fd89c79a523fc95e164901d | c777c32c8e484e195053731103c5e52af26a25d1 | /src/topology/category/Compactum.lean | 6bc1fc6992906e7bbe875ca6cec535f92cf80ee3 | [
"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 | 17,825 | lean | /-
Copyright (c) 2020 Adam Topaz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Adam Topaz
-/
import category_theory.monad.types
import category_theory.monad.limits
import category_theory.equivalence
import topology.category.CompHaus.basic
import topology.category.Pr... |
f4ffaf1afee9a704b5fa3ba4d99dbf3c71945b6b | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/rbtree/find.lean | 3d1ea6186417f8c36db94db034f51e46e15f49ef | [
"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,812 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import data.rbtree.basic
universe u
namespace rbnode
variables {α : Type u}
@[elab_simple]
lemma find.induction {p : rbnode α → Prop} (lt) [decidable_rel ... |
4250a94e705b4842ba556d32cc346635f8e16a5f | 0d4c30038160d9c35586ce4dace36fe26a35023b | /src/topology/metric_space/basic.lean | 5c8d9554f1044d48c19e80430209942230175cfe | [
"Apache-2.0"
] | permissive | b-mehta/mathlib | b0c8ec929ec638447e4262f7071570d23db52e14 | ce72cde867feabe5bb908cf9e895acc0e11bf1eb | refs/heads/master | 1,599,457,264,781 | 1,586,969,260,000 | 1,586,969,260,000 | 220,672,634 | 0 | 0 | Apache-2.0 | 1,583,944,480,000 | 1,573,317,991,000 | Lean | UTF-8 | Lean | false | false | 70,257 | lean | /-
Copyright (c) 2015, 2017 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Metric spaces.
Authors: Jeremy Avigad, Robert Y. Lewis, Johannes Hölzl, Mario Carneiro, Sébastien Gouëzel
Many definitions and theorems expected on metric spaces are already introduced o... |
4bcda603680ee457851acac45180ce066c809e1b | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/analysis/normed_space/matrix_exponential.lean | 423ad6dfbd9ea0c8bfce3fd1959f0d1535e40997 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 9,075 | 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 analysis.normed_space.exponential
import analysis.matrix
import linear_algebra.matrix.zpow
import topology.uniform_space.matrix
/-!
# Lemmas about the matrix expon... |
3c8ba143639fb0a7081a189388a882cd02fc5ca7 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/borrowBug.lean | 36869cbd1a701d500bc7a462da99c8493f1a4c3a | [
"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 | 360 | lean |
@[noinline] def g (x : Nat) : Nat × Nat := (x, x)
@[noinline] def p (x : Nat) : Bool := x > 10
set_option trace.compiler.ir.rc true
def f (x : Nat) (y : Nat) : Bool :=
let jp (x : Nat) : Bool := -- x must be owned
p x || p (x+1)
match x with
| 0 => let z := g y; jp z.1
| _ => let z := g x; jp z.1
def h (x : Nat)... |
f8f9f6b7cd757699b1230a755cbd8aa9b429a1ba | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/dlist/instances_auto.lean | 5694d428d9a573dcbbffa7ddee7e24ecc7c82461 | [] | 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 | 968 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
Traversable instance for dlists.
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.Lean3Lib.data.dlist
import Mathlib.control.traversable.equiv
im... |
61586bcb409724337559cc3ed72233ec8a3c209a | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/data/mv_polynomial.lean | 7e28f57724a38b7611e49c16e30cede6ceecc27c | [
"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 | 59,755 | 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, Johan Commelin, Mario Carneiro, Shing Tak Lam
-/
import data.polynomial.eval
import data.equiv.ring
import data.equiv.fin
import tactic.omega
/-!
# Multivariate polyno... |
f28e3192cd68b683579d56f8425b8a298243d186 | 2b0e277371df7056b343785ee43e0917e5844dac | /src/risk_measures.lean | 7752864a43be449f52c647984f5dd54dab05af40 | [] | no_license | kodyvajjha/lean-crm | f3795ddff12bbc04dc08f6b6e4708698929c1af1 | f6cbb0061e4521632d26a1ab23fbdfe231e4c18a | refs/heads/master | 1,587,882,457,792 | 1,553,563,945,000 | 1,553,563,945,000 | 173,365,069 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,074 | lean | import .random_variable
import measure_theory.measure_space
import measure_theory.integration
import tactic.find
open lattice measure_theory ennreal set
universe u
local attribute [instance] classical.prop_decidable
noncomputable theory
variables {s α : Type u} [probability_space s] (p : probability_measure s) {X... |
8702eda902b504c5430c1aae7f6fde2b8d933115 | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /stage0/src/Lean/Meta/PPGoal.lean | 4b22f4c6a2c6de92e6c32531098500b2a1ef5c96 | [
"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 | 9,165 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
import Lean.Hygiene
import Lean.Meta.InferType
namespace Lean.Meta
register_builtin_option pp.auxDecls : Bool := {
defValue := false
group := "pp"
... |
53109eebb4ec93380135f310db083b0969322d92 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/ring_theory/witt_vector/truncated.lean | 4aa9b539e664aacba9e8e529973adda2c8055c9f | [
"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 | 15,692 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Robert Y. Lewis
-/
import ring_theory.witt_vector.init_tail
/-!
# Truncated Witt vectors
The ring of truncated Witt vectors (of length `n`) is a quotient of the rin... |
85ce4a43f97097002f31ad4afd9e71ddada01ddf | 1dd482be3f611941db7801003235dc84147ec60a | /src/data/nat/prime.lean | 2c8066174c2196a9c323a40091ded102e1d3a633 | [
"Apache-2.0"
] | permissive | sanderdahmen/mathlib | 479039302bd66434bb5672c2a4cecf8d69981458 | 8f0eae75cd2d8b7a083cf935666fcce4565df076 | refs/heads/master | 1,587,491,322,775 | 1,549,672,060,000 | 1,549,672,060,000 | 169,748,224 | 0 | 0 | Apache-2.0 | 1,549,636,694,000 | 1,549,636,694,000 | null | UTF-8 | Lean | false | false | 16,536 | 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, Mario Carneiro
Prime numbers.
-/
import data.nat.sqrt data.nat.gcd data.list.basic data.list.perm
open bool subtype
namespace nat
open decida... |
df88423d046011ac8167e34cf5deacbdf61fb636 | 3dd1b66af77106badae6edb1c4dea91a146ead30 | /tests/lean/t3.lean | 1a3c30ad41575243ec1553959bd05441a1ea24fd | [
"Apache-2.0"
] | permissive | silky/lean | 79c20c15c93feef47bb659a2cc139b26f3614642 | df8b88dca2f8da1a422cb618cd476ef5be730546 | refs/heads/master | 1,610,737,587,697 | 1,406,574,534,000 | 1,406,574,534,000 | 22,362,176 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,073 | lean | universe u
print raw Type.{u}
namespace tst
universe v
print raw Type.{v}
print raw Type.{tst.v}
end
print raw Type.{tst.v}
print raw Type.{v} -- Error: alias 'v' is not available anymore
section
universe z -- Remark: this is a local universe
print raw Type.{z}
end
print raw Type.{z} -- Error: local ... |
f055683d87eb8b11e38d6100a88b6b89580cfbcf | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/category/Semigroup/basic.lean | 65bb2df05eb967197a6c851af7c0f5fdc12b61eb | [
"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 | 7,290 | 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.pempty_instances
import algebra.hom.equiv.basic
import category_theory.concrete_category.bundled_hom
import category_theory.functor.reflects_is... |
1c7a9ea73251c8835a923d1d0809a6b02fd5b91c | ea5678cc400c34ff95b661fa26d15024e27ea8cd | /ring_tac.lean | 6b6c460e1606c8f5d64114b700246184c5d3c8e3 | [] | no_license | ChrisHughes24/leanstuff | dca0b5349c3ed893e8792ffbd98cbcadaff20411 | 9efa85f72efaccd1d540385952a6acc18fce8687 | refs/heads/master | 1,654,883,241,759 | 1,652,873,885,000 | 1,652,873,885,000 | 134,599,537 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 684 | lean | import data.num.lemmas
inductive poly : Type
| const : znum → poly
| add : poly → poly → poly
| mul : poly → poly → poly
| pow : poly → num → poly
| var : ℕ → poly
instance : has_pow poly num := ⟨poly.pow⟩
instance : has_add poly := ⟨poly.add⟩
instance : has_mul poly := ⟨poly.mul⟩
inductive horner_po... |
63b89905a7473c00e5ebecafbd1c1b9f3a612c9e | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /library/data/nat/sqrt.lean | c051e773ab252a83bfd0c7bc629cf87c38e45460 | [
"Apache-2.0"
] | permissive | chubbymaggie/lean | 0d06ae25f9dd396306fb02190e89422ea94afd7b | d2c7b5c31928c98f545b16420d37842c43b4ae9a | refs/heads/master | 1,611,313,622,901 | 1,430,266,839,000 | 1,430,267,083,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,521 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: data.nat.sqrt
Authors: Leonardo de Moura
Very simple (sqrt n) function that returns s s.t.
s*s ≤ n ≤ s*s + s + s
-/
import data.nat.order data.nat.sub
namespace nat
open d... |
6c2617b21ba61a4f2f892813fcd5963e86795e98 | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /02_Dependent_Type_Theory.org.18.lean | a3e1248ddd061d5d9c782917de0adb1338e58453 | [] | 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 | 253 | lean | /- page 20 -/
import standard
import data.prod
open prod
definition curry (A B C : Type) (f : A × B → C) : A → B → C :=
λ a b, f (a, b)
definition uncurry (A B C : Type) (f : A → B → C) : A × B → C :=
λ p, f (pr₁ p) (pr₂ p)
|
02e63d15397c085e388685b41aec0f38496b59fb | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/blast_cc_subsingleton1.lean | 663eedb417b88a7e043e6bfe9e3a14c78ecf1639 | [
"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 | 581 | lean | import data.unit
open nat unit
constant f {A : Type} (a : A) {B : Type} (b : B) : nat
constant g : unit → nat
set_option blast.strategy "cc"
example (a b : unit) : g a = g b :=
by blast
example (a c : unit) (b d : nat) : b = d → f a b = f c d :=
by blast
constant h {A B : Type} : A → B → nat
example (a b c d : u... |
44fc3ee7fd09164f0847fd4a5bbf2b01275a4eee | 46125763b4dbf50619e8846a1371029346f4c3db | /src/tactic/alias.lean | 71af97aa7fd32aa805b2647207d85d4bc7eedb01 | [
"Apache-2.0"
] | permissive | thjread/mathlib | a9d97612cedc2c3101060737233df15abcdb9eb1 | 7cffe2520a5518bba19227a107078d83fa725ddc | refs/heads/master | 1,615,637,696,376 | 1,583,953,063,000 | 1,583,953,063,000 | 246,680,271 | 0 | 0 | Apache-2.0 | 1,583,960,875,000 | 1,583,960,875,000 | null | UTF-8 | Lean | false | false | 4,493 | 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.buffer.parser meta.expr
/-!
# The `alias` command
This file defines an `alias` command, which can be used to create copies
of a theorem or definition w... |
7003637bcf4f1c5f502c84e81800814958010fbd | d1a52c3f208fa42c41df8278c3d280f075eb020c | /stage0/src/Lean/Meta/Match/MatchEqs.lean | f12a0814473d9d90587e6959b61f323ebd9ac4d2 | [
"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 | 15,320 | 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.Match.Match
import Lean.Meta.Tactic.Apply
import Lean.Meta.Tactic.Delta
import Lean.Meta.Tactic.SplitIf
namespace Lean.Meta
/--
Helper ... |
bc82e487ce8b779f5b2fbae07e2c4479015629ab | 12dabd587ce2621d9a4eff9f16e354d02e206c8e | /world03/level04.lean | 56bbce0794dd83e7d27b2a6b83633d84bf627673 | [] | no_license | abdelq/natural-number-game | a1b5b8f1d52625a7addcefc97c966d3f06a48263 | bbddadc6d2e78ece2e9acd40fa7702ecc2db75c2 | refs/heads/master | 1,668,606,478,691 | 1,594,175,058,000 | 1,594,175,058,000 | 278,673,209 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 207 | lean | lemma mul_add (t a b : mynat) : t * (a + b) = t * a + t * b :=
begin
induction b with h hd,
rw mul_zero,
rw add_zero,
rw add_zero,
refl,
rw add_succ,
rw mul_succ,
rw hd,
rw mul_succ,
rw add_assoc,
refl,
end
|
9ad29302564f4736ba72f3e5b03259746fbb9330 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/linear_algebra/bilinear_map.lean | 164757c87cb16595dfcefb780dc75dd75f78f8b6 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 14,871 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Mario Carneiro
-/
import linear_algebra.basic
/-!
# Basics on bilinear maps
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding PR to... |
33cb76c583d332dc603721b4ed9513515aaede86 | df561f413cfe0a88b1056655515399c546ff32a5 | /2-addition-world/l5.lean | b130ef51907dd66a2579f3b3da919786157b9cd0 | [] | no_license | nicholaspun/natural-number-game-solutions | 31d5158415c6f582694680044c5c6469032c2a06 | 1e2aed86d2e76a3f4a275c6d99e795ad30cf6df0 | refs/heads/main | 1,675,123,625,012 | 1,607,633,548,000 | 1,607,633,548,000 | 318,933,860 | 3 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 118 | lean | theorem succ_eq_add_one (n : mynat) : succ n = n + 1 :=
begin
rw one_eq_succ_zero, rw add_succ, rw add_zero, refl,
end |
63bb47ac39dff8213c30040b4734294e9ea0084f | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /src/Lean/Compiler/LCNF/InferType.lean | a9714d5f9fa9caefc82e2a36408e03697079a445 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | tobiasgrosser/lean4 | ce0fd9cca0feba1100656679bf41f0bffdbabb71 | ebdbdc10436a4d9d6b66acf78aae7a23f5bd073f | refs/heads/master | 1,673,103,412,948 | 1,664,930,501,000 | 1,664,930,501,000 | 186,870,185 | 0 | 0 | Apache-2.0 | 1,665,129,237,000 | 1,557,939,901,000 | Lean | UTF-8 | Lean | false | false | 16,478 | lean | /-
Copyright (c) 2022 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Compiler.LCNF.CompilerM
import Lean.Compiler.LCNF.Types
import Lean.Compiler.LCNF.PhaseExt
import Lean.Compiler.LCNF.OtherDecl
namespace Lean.C... |
03a86bfda79f0e533f6ddbc266c15ff9407e754a | f4bff2062c030df03d65e8b69c88f79b63a359d8 | /kb_solns/sets_level08.lean | 10c9dd77c037741780d275ecdf361f1c835be9d0 | [
"Apache-2.0"
] | permissive | adastra7470/real-number-game | 776606961f52db0eb824555ed2f8e16f92216ea3 | f9dcb7d9255a79b57e62038228a23346c2dc301b | refs/heads/master | 1,669,221,575,893 | 1,594,669,800,000 | 1,594,669,800,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 934 | lean | import data.real.basic --hide
/-
# Chapter 1 : Sets
## Level 8
-/
/-
This is a very basic example of working with intervals of real numbers in Lean.
An interval that is closed at both endpoints $a$ and $b$ can be
constructed using `set.Icc a b`. For an open-closed interval, the notation
is `set.Ioc a b`, etc. The... |
b4442c34c3367c9ca78da3323eefdda6ab024e3d | 1abd1ed12aa68b375cdef28959f39531c6e95b84 | /src/analysis/normed_space/dual.lean | 5598997d78ffdfe03db0028af772009425f61b5f | [
"Apache-2.0"
] | permissive | jumpy4/mathlib | d3829e75173012833e9f15ac16e481e17596de0f | af36f1a35f279f0e5b3c2a77647c6bf2cfd51a13 | refs/heads/master | 1,693,508,842,818 | 1,636,203,271,000 | 1,636,203,271,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,286 | 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
/-!
# The topological dual of a normed space
In this file we define the topological dual `normed_space.dual` of a normed ... |
09fedd33a1562719efe85559def137994be9c2f6 | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /src/builtin/proof_irrel.lean | 018c00c5c54b38e56e71d55d3dba9607fe28643d | [
"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 | 2,702 | lean | import macros
definition has_fixpoint (A : Bool) : Bool
:= ∃ F : (A → A) → A, ∀ f : A → A, F f = f (F f)
theorem eq_arrow (A : Bool) : inhabited A → (A → A) = A
:= assume Hin : inhabited A,
obtain (p : A) (Hp : true), from Hin,
iff_intro
(assume Hl : A → A, p)
(assume Hr : A, (assume H : A, H))
theor... |
645faa50f22bcd874e784f5f5beab302eedd1d2e | 94e33a31faa76775069b071adea97e86e218a8ee | /src/ring_theory/chain_of_divisors.lean | afe5284d40bf91da3c1335010fc8530ab33bd9a0 | [
"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 | 21,269 | lean | /-
Copyright (c) 2021 Paul Lezeau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen, Paul Lezeau
-/
import algebra.is_prime_pow
import algebra.squarefree
import order.hom.bounded
import algebra.gcd_monoid.basic
/-!
# Chains of divisors
The results in this ... |
ef5637465f1f665b9f5d51000691d8458a45f1c7 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/category_theory/sites/left_exact.lean | a4e62d9e152186c536da47de1a168dc42bd45928 | [
"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 | 9,961 | lean | /-
Copyright (c) 2021 Adam Topaz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Adam Topaz
-/
import category_theory.sites.sheafification
import category_theory.sites.limits
import category_theory.limits.functor_category
import category_theory.limits.filtered_colimit_... |
6ca42b54c3265681cca17095430a0ca8376a914d | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/number_theory/legendre_symbol/quadratic_char.lean | 97b3738473c1fc80e74c1cdc3d9ca6cf2e4e4b91 | [
"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 | 18,451 | lean | /-
Copyright (c) 2022 Michael Stoll. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Michael Stoll
-/
import number_theory.legendre_symbol.zmod_char
import field_theory.finite.basic
import number_theory.legendre_symbol.gauss_sum
/-!
# Quadratic characters of finite fie... |
be218e4cee225b9eb37a0b2ef7ec0bcab25257ed | 94e33a31faa76775069b071adea97e86e218a8ee | /src/category_theory/preadditive/Mat.lean | 6e0685e0c24c758fd8b26d55e3104c037ae258a8 | [
"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 | 18,689 | lean | /-
Copyright (c) 2021 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import algebra.big_operators.basic
import algebra.big_operators.pi
import category_theory.limits.shapes.biproducts
import category_theory.preadditive
import category_... |
51a55449c89aecdd37fefe647bb2406d771b476f | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /tests/lean/notation2.lean | 306011cd201ace35e6b9b201f9507248cb856699 | [
"Apache-2.0"
] | permissive | codyroux/lean | 7f8dff750722c5382bdd0a9a9275dc4bb2c58dd3 | 0cca265db19f7296531e339192e9b9bae4a31f8b | refs/heads/master | 1,610,909,964,159 | 1,407,084,399,000 | 1,416,857,075,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 111 | lean | import data.list data.num
open list
infixr `::` := cons
check 1 :: 2 :: nil
check 1 :: 2 :: 3 :: 4 :: 5 :: nil
|
affb5de29fb8bf9596566d847935d4578bc37113 | 5d166a16ae129621cb54ca9dde86c275d7d2b483 | /tests/lean/run/using_smt1.lean | b1414206c52307dacbad0c2cb1cba6507ed678b1 | [
"Apache-2.0"
] | permissive | jcarlson23/lean | b00098763291397e0ac76b37a2dd96bc013bd247 | 8de88701247f54d325edd46c0eed57aeacb64baf | refs/heads/master | 1,611,571,813,719 | 1,497,020,963,000 | 1,497,021,515,000 | 93,882,536 | 1 | 0 | null | 1,497,029,896,000 | 1,497,029,896,000 | null | UTF-8 | Lean | false | false | 1,273 | lean | open smt_tactic tactic
lemma ex1 (a b c : nat) : a = c → a = b → b = c :=
by using_smt intros
set_option pp.all true
lemma ex2 (a b c : nat) : a > nat.zero → a = c → a = b → b = c :=
by using_smt intros
lemma ex3 (p q r : Prop) : p → q → ¬p → r :=
by using_smt intros
lemma ex4 (a b c : nat) : a > nat.zero → 0 < a ... |
07a5e2108e51b520717f12e19a3037cbf1fed124 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/topology/metric_space/antilipschitz.lean | 05db82f6f4b9a331e342c86bd45938e20dcab0b0 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 9,507 | 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 topology.metric_space.lipschitz
import topology.uniform_space.complete_separated
/-!
# Antilipschitz functions
We say that a map `f : α → β` between two (e... |
033d82cbed77b5b31901c67f69069d7a43c4aff4 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/simplifier2.lean | df3e1bd45dea49a5ae8be906103f20e1725db26c | [
"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 | 426 | lean | /- Basic rewriting with eq and lambda without congruence or conditionals -/
universe l
constant T : Type.{l}
constants (x y z : T) (f g h : T → T)
constants (Hfxgy : f x = g y) (Hgyhz : g y = h z)
namespace tst attribute Hfxgy [simp] end tst
#simplify eq tst 0 (λ a b c : bool, f x) -- λ (a b c : bool), g y
namespace t... |
ec02fb281128c961dff048e6b3818f352c489d74 | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /src/order/bounded_lattice.lean | 37ad7a3d5daaedb783e7b64bcd25d65450f31592 | [
"Apache-2.0"
] | permissive | dexmagic/mathlib | ff48eefc56e2412429b31d4fddd41a976eb287ce | 7a5d15a955a92a90e1d398b2281916b9c41270b2 | refs/heads/master | 1,693,481,322,046 | 1,633,360,193,000 | 1,633,360,193,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 48,170 | 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 data.option.basic
import logic.nontrivial
import order.lattice
import tactic.pi_instances
/-!
# ⊤ and ⊥, bounded lattices and variants
This file defines top ... |
169adbed3e24cf992dc4d26474f981cab4d74a5d | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/1829.lean | 8a53e8a0446762ca6b10fa76b368d21c871d19f5 | [
"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 | 551 | lean | theorem eq_iff_true_of_subsingleton [Subsingleton α] (x y : α) : x = y ↔ True :=
⟨fun _ => ⟨⟩, fun _ => (Subsingleton.elim ..)⟩
attribute [simp] eq_iff_true_of_subsingleton in
example : True := trivial
structure Func' (α : Sort _) (β : Sort _) :=
(toFun : α → β)
def r : Func' α α := ⟨id⟩
@[simp] theorem r_toFu... |
2209653d19994951e504bda079b14f85a362b087 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/number_theory/legendre_symbol/quadratic_reciprocity.lean | 9aca5e1c254d2a2f668927408046b1c2d0cc4c01 | [
"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 | 15,300 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Michael Stoll
-/
import number_theory.legendre_symbol.gauss_eisenstein_lemmas
import number_theory.legendre_symbol.quadratic_char
/-!
# Legendre symbol and quadratic recip... |
62fe836c8576d9974bbbff1112a1af9f25fb6b66 | 9ad8d18fbe5f120c22b5e035bc240f711d2cbd7e | /src/data/finset_transfer.lean | 699aa69de3712bfa5b928abf6343e068e6c75492 | [] | 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 | 11,285 | lean | /-
Copyright (c) 2019 Neil Strickland. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Neil Strickland
Suppose we have two types α and β with decidable equality, and
an equivalence between them (as defined in
mathlib/data/equiv/basic.lean). We then get an equivalenc... |
0b266166a0e9a8a06a8fcf2aa259ae0bab3accb1 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/number_theory/zsqrtd/quadratic_reciprocity.lean | bb4db5899c3c40fe57ac3da8343903995838c2ca | [
"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,432 | lean | /-
Copyright (c) 2019 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import number_theory.zsqrtd.gaussian_int
import number_theory.legendre_symbol.quadratic_reciprocity
/-!
# Facts about the gaussian integers relying on quadratic reciproc... |
02c8e8bc2ca66ef6cf54b6758ee00f0227fd4275 | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/data/quot.lean | 1a38f9a26fbf4a843bf921438965b5ba004a445e | [
"Apache-2.0"
] | permissive | rmitta/mathlib | 8d90aee30b4db2b013e01f62c33f297d7e64a43d | 883d974b608845bad30ae19e27e33c285200bf84 | refs/heads/master | 1,585,776,832,544 | 1,576,874,096,000 | 1,576,874,096,000 | 153,663,165 | 0 | 2 | Apache-2.0 | 1,544,806,490,000 | 1,539,884,365,000 | Lean | UTF-8 | Lean | false | false | 11,704 | 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
Quotients -- extends the core library
-/
import logic.relator
variables {α : Sort*} {β : Sort*}
namespace setoid
lemma ext {α : Sort*} :
∀{s t : setoid α}, (∀a b, ... |
dbc24ca1dd17c60ef4dcfb7f453f45818952b8c5 | a46270e2f76a375564f3b3e9c1bf7b635edc1f2c | /8.9.4.lean | 692679e7f9facbb9dd3293238cfa11876ae70177 | [
"CC0-1.0"
] | permissive | wudcscheme/lean-exercise | 88ea2506714eac343de2a294d1132ee8ee6d3a20 | 5b23b9be3d361fff5e981d5be3a0a1175504b9f6 | refs/heads/master | 1,678,958,930,293 | 1,583,197,205,000 | 1,583,197,205,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 683 | lean |
def fact: nat -> nat
| 0 := 1
| (n+1) := (n+1) * (fact n)
example: fact 5 = 120 := rfl
def c: nat -> nat
| 0 := 1
| 1 := 1
| (n+1) := (c n) * 2*(2*n + 1)/(n+2)
#eval c 1
#eval c 5
example: c 5 = 42 := rfl
#eval c 10
lemma lt_pred (x: nat) (h: 0 < x): (x-1) < x := nat.sub_lt h (nat.lt.base 0)
def ... |
4b6865e88f30f46415d3cc02fbaaa73e71e09f75 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /stage0/src/Lean/Compiler/IR/Basic.lean | bd8038e9f991eac3860bf33bd81b7334ae833c9b | [
"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 | 26,228 | 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.KVMap
import Lean.Data.Name
import Lean.Data.Format
import Lean.Compiler.ExternAttr
/-
Implements (extended) λPure and λRc proposed in the ... |
e30100c784dea85247147c2382f7ea674f78f712 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/inductive_resultant_level_inference.lean | 23d863907953112877abb1a4ebefe528d987781a | [
"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 | 3,227 | lean | set_option pp.all true
universe variables u v w
namespace X1
#print "\n1. ?U does not unify with anything"
inductive foo (A : Type u) (B : Type (v+1))
| mk : A → B → foo
#check @foo.{u v} -- : Type (max u (v+1))
end X1
namespace X2
#print "\n2. ?U unifies with a constant, no others above: done"
inductive bar (A... |
3524720882801d2b21ef79d90c405fd938340e5c | 64874bd1010548c7f5a6e3e8902efa63baaff785 | /tests/lean/run/have6.lean | b98b07533b2fc62cca0d9c91e5e4be609a905512 | [
"Apache-2.0"
] | permissive | tjiaqi/lean | 4634d729795c164664d10d093f3545287c76628f | d0ce4cf62f4246b0600c07e074d86e51f2195e30 | refs/heads/master | 1,622,323,796,480 | 1,422,643,069,000 | 1,422,643,069,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 659 | lean | prelude
definition Prop : Type.{1} := Type.{0}
constant and : Prop → Prop → Prop
infixl `∧`:25 := and
constant and_intro : forall (a b : Prop), a → b → a ∧ b
constants a b c d : Prop
axiom Ha : a
axiom Hb : b
axiom Hc : c
check
have a ∧ b, from and_intro a b Ha Hb,
have [visible] b ∧ a, from and_intro b a Hb Ha,
... |
8e91d569bb3348fbbb133ff025227cc003aa689e | a4673261e60b025e2c8c825dfa4ab9108246c32e | /tests/lean/run/funext.lean | 742386d2e4ddd900ca4ac23d04bd20beb9731248 | [
"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 | 844 | lean | theorem ex1 : (fun y => y + 0) = (fun x => 0 + x) := by
funext x
rw [Nat.zeroAdd]
rfl
theorem ex2 : (fun y x => y + x + 0) = (fun x y => y + x) := by
funext x y
rw [Nat.addZero, Nat.addComm]
rfl
theorem ex3 : (fun (x : Nat × Nat) => x.1 + x.2) = (fun (x : Nat × Nat) => x.2 + x.1) := by
funext (a, b)
s... |
dd6240ef5ead526e376e6c0d4370421f3fe13bb1 | b66669ef1ec06ddbd9526fe3afe0a68566dfbad3 | /src/hpp.lean | 67720d4d0cf582f7441d6aae683f06a59a002b36 | [
"MIT"
] | permissive | FerdoSil/LatticesAndCellularAutomata | 40185a9099bb3cf1371c85f1ca33a17c2e26fecb | 2a69d2e74a231addf0e446dca86ef90d50d60218 | refs/heads/master | 1,587,683,992,072 | 1,586,018,471,000 | 1,586,018,471,000 | 171,533,028 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,641 | lean | -- Implementation of HPP Lattice Gas CA.
-- Cell states 'cellT' are represented as constructors named as possible combinations of
-- of the four directly-connected cardinal directions. 'X' is an empty cell.
-- The definition 'mk_hpp' builds an instance of HPP
-- from an initial configuration of cell states.
import ce... |
6ed48f087382997f0f5695fae861b3ee2956ae46 | 1b8f093752ba748c5ca0083afef2959aaa7dace5 | /src/category_theory/graphs/category.lean | 6b7c2442b521a4ee6352b217babb541633e8b808 | [] | 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 | 1,238 | lean | -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Stephen Morgan and Scott Morrison
import category_theory.category
import category_theory.graphs
namespace category_theory
open category_theory.graphs
universe u
variable {C :... |
32e9b87ab90341a3aad1617784c8f63817e7ea7d | d1a52c3f208fa42c41df8278c3d280f075eb020c | /stage0/src/Init.lean | 54741d4ed829490deac0caf24392ec2b2fa6aea7 | [
"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 | 458 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import Init.Prelude
import Init.Notation
import Init.Core
import Init.Control
import Init.Data.Basic
import Init.WF
import Init.Data
import Init.Sys... |
ec1f20987453760964a1ebe832b9b3a95e7258bb | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/nat/choose/sum_auto.lean | 7eab27e2517a488fdcade6c0baeea1d8f6f4b3cd | [] | 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,880 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Patrick Stevens
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.nat.choose.basic
import Mathlib.tactic.linarith.default
import Mathlib.ta... |
7c4c56784a17d0d80a9683af0f654a2b8fb9e959 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/probability/density.lean | 7dcbe2022356095f3c3136a661e4fd5ca122d1df | [
"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 | 19,163 | lean | /-
Copyright (c) 2021 Kexing Ying. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kexing Ying
-/
import measure_theory.decomposition.radon_nikodym
import measure_theory.measure.lebesgue
/-!
# Probability density function
This file defines the probability density func... |
b88e6053a603e6abe41778347f6659be73427954 | 9dd3f3912f7321eb58ee9aa8f21778ad6221f87c | /tests/lean/run/968.lean | 90572184ff4f254690c50eda6b571682e25598cb | [
"Apache-2.0"
] | permissive | bre7k30/lean | de893411bcfa7b3c5572e61b9e1c52951b310aa4 | 5a924699d076dab1bd5af23a8f910b433e598d7a | refs/heads/master | 1,610,900,145,817 | 1,488,006,845,000 | 1,488,006,845,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 212 | lean | variables (A : Type) [inhabited A]
definition f (a : A) : A := a
check @f nat nat.inhabited
structure foo :=
(a : A)
check @foo nat nat.inhabited
inductive bla
| mk : A → bla
check @bla nat nat.inhabited
|
1798cbbd8d6f6278a998e5d099c0f06b96ced681 | 9a0b1b3a653ea926b03d1495fef64da1d14b3174 | /tidy/rewrite_search/bundles/arithmetic.lean | e39ef0d55f0d9eee8f8d89d436ce4ed438a3d781 | [
"Apache-2.0"
] | permissive | khoek/mathlib-tidy | 8623b27b4e04e7d598164e7eaf248610d58f768b | 866afa6ab597c47f1b72e8fe2b82b97fff5b980f | refs/heads/master | 1,585,598,975,772 | 1,538,659,544,000 | 1,538,659,544,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 329 | lean | import tidy.rewrite_search.discovery.bundle
namespace tidy.rewrite_search.discovery
@[bundle] meta def arithmetic : bundle := {}
attribute [search arithmetic] add_comm add_assoc
attribute [search arithmetic] mul_comm mul_assoc mul_one
attribute [search arithmetic] left_distrib right_distrib
end tidy.rewrite_search.... |
ae18fe6170d1d9cd4774f7ddc07cdfaf89dcbd79 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /archive/sensitivity.lean | 04390ac4239de0d427715ee5110959804cfc6394 | [
"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 | 15,513 | lean | /-
Copyright (c) 2019 Reid Barton, Johan Commelin, Jesse Han, Chris Hughes, Robert Y. Lewis, and
Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Reid Barton, Johan Commelin, Jesse Han, Chris Hughes, Robert Y. Lewis, and Patrick Massot
-/
import tactic.f... |
3a618661354203f96aa52f7ab35ee1b1fc7790b5 | 947b78d97130d56365ae2ec264df196ce769371a | /src/Lean/Elab/Quotation.lean | 9045152218d0062dc1064675a39d38f5eaf64e9e | [
"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 | 20,832 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
Elaboration of syntax quotations as terms and patterns (in `match_syntax`). See also `./Hygiene.lean` for the basic
hygiene workings and data types.
-/
import... |
ea093a241a3097908f2252a35d4d62c1e6609021 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /test/instance_diamonds.lean | 79f991a7b58e65e83d7616d64c54389376c4fa39 | [
"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,127 | lean | /-
Copyright (c) 2021 Eric Wieser. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Eric Wieser
-/
import algebra.module.pi
import data.polynomial.basic
import group_theory.group_action.prod
import group_theory.group_action.units
import data.complex.module
/-! # Tests ... |
96a771b692ae76543efcfb5c6885ed78ca2d5ec4 | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/category_theory/limits/shapes/products.lean | 41479cd6b1382728ee50ecf6ce408638fe1cff30 | [
"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 | 6,785 | 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.limits.has_limits
import category_theory.discrete_category
noncomputable theory
universes v u u₂
open category_theory
namespa... |
a1fe0c06aeb2b80ae82741a54e152349ec420f6b | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/ring_theory/subring.lean | 213ba699589ad970ae6b00eae7b23453917a0f52 | [
"Apache-2.0"
] | permissive | fpvandoorn/mathlib | b21ab4068db079cbb8590b58fda9cc4bc1f35df4 | b3433a51ea8bc07c4159c1073838fc0ee9b8f227 | refs/heads/master | 1,624,791,089,608 | 1,556,715,231,000 | 1,556,715,231,000 | 165,722,980 | 5 | 0 | Apache-2.0 | 1,552,657,455,000 | 1,547,494,646,000 | Lean | UTF-8 | Lean | false | false | 7,025 | lean | /-
Copyright (c) 2018 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import group_theory.subgroup
import algebra.ring
universes u v
open group
variables {R : Type u} [ring R]
/-- `S` is a subring: a set containing 1 and closed und... |
6291731e4ae676e1e08368a70acc2ce59872be4a | 968e2f50b755d3048175f176376eff7139e9df70 | /examples/pred_logic/unnamed_826.lean | 84cddb17dec8f0b3af7332261a486322e2552a04 | [] | no_license | gihanmarasingha/mth1001_sphinx | 190a003269ba5e54717b448302a27ca26e31d491 | 05126586cbf5786e521be1ea2ef5b4ba3c44e74a | refs/heads/master | 1,672,913,933,677 | 1,604,516,583,000 | 1,604,516,583,000 | 309,245,750 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,033 | lean | import tactic
namespace hidden
def even (a : ℕ) := ∃ b, a = 2 * b
def odd (a : ℕ) := ∃ b, a = 2 * b + 1
def parity : ℕ → ℕ
| 0 := 0
| (nat.succ n) := ite (parity n = 0) 1 0
lemma parity_eq_zero_or_one (n : ℕ) : parity n = 0 ∨ parity n = 1 :=
begin
induction n with k hk,
{ left, refl, },
unfold p... |
d8d16e88a487f2f80f2efa4b077dac801c680cb2 | 618003631150032a5676f229d13a079ac875ff77 | /src/category_theory/limits/creates.lean | 36797b4d2dfb6e2b53ed24a7c8ca53232c5030c0 | [
"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 | 14,788 | lean | /-
Copyright (c) 2020 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta
-/
import category_theory.reflect_isomorphisms
open category_theory category_theory.limits
namespace category_theory
universes v u₁ u₂ u₃
variables {C : Type u₁} [catego... |
d6ca23c74271d423aab9500e1f5cb23373ab86ae | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /library/smt/prove.lean | e97b62059c7b4b6359b982eb5e9410b0fbc75c63 | [
"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 | 390 | lean | namespace smt
open tactic
private meta_definition collect_props : list expr → tactic (list expr)
| [] := return []
| (H :: Hs) := do
Eqs ← collect_props Hs,
Htype ← infer_type H >>= whnf,
return $ if Htype = expr.prop then H :: Eqs else Eqs
meta_definition prove : tactic unit :=
do local_context >>= co... |
b10a22cb7edd819e94248326c24b79fefe1162fb | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/run/bug6.lean | 6e58b339d16dc074aaed99eb9dbb4cc53d46311a | [
"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 | 322 | lean | open eq
section
variable {A : Type}
theorem T {a b : A} (H : a = b) : b = a
:= symm H
variables x y : A
variable H : x = y
#check T H
#check T
end
section
variable {A : Type}
theorem T2 ⦃a b : A⦄ (H : a = b) : b = a
:= symm H
variables x y : A
variable H : x = y
#check T2 H
#check T2
end
|
e126efd3e5139360767b1c1bfb3e4aa5ed0fe6bb | 8930e38ac0fae2e5e55c28d0577a8e44e2639a6d | /data/semiquot.lean | fcea78e267a4c584af36e712f3347e7bbd15ce51 | [
"Apache-2.0"
] | permissive | SG4316/mathlib | 3d64035d02a97f8556ad9ff249a81a0a51a3321a | a7846022507b531a8ab53b8af8a91953fceafd3a | refs/heads/master | 1,584,869,960,527 | 1,530,718,645,000 | 1,530,724,110,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,938 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
A data type for semiquotients, which are classically equivalent to
nonempty sets, but are useful for programming; the idea is that
a semiquotient set `S` represents som... |
2f65ecf265dd3728881fd894ebf0296579e50c67 | 3446e92e64a5de7ed1f2109cfb024f83cd904c34 | /src/game/world3/level13.lean | 9e9afd806cdeac299def25a3c685f358ea4313bf | [] | no_license | kckennylau/natural_number_game | 019f4a5f419c9681e65234ecd124c564f9a0a246 | ad8c0adaa725975be8a9f978c8494a39311029be | refs/heads/master | 1,598,784,137,722 | 1,571,905,156,000 | 1,571,905,156,000 | 218,354,686 | 0 | 0 | null | 1,572,373,319,000 | 1,572,373,318,000 | null | UTF-8 | Lean | false | false | 869 | lean | import game.world3.level12 -- hide
import game.world2.level13 -- add_left_eq_zero -- hide
namespace mynat -- hide
/-
# Multiplication World
## Level 13: `mul_right_comm`
This is the last of the bonus multiplication levels.
`mul_right_comm` will be useful in power world.
The proof is basically the same as `add_righ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.