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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
925138137b926a4ce918488e82b186c19f3c59ba | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/data/polynomial/eval.lean | 79a3efc053c6d194bfd046b90d0b50561111b5a6 | [
"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 | 26,596 | 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 data.polynomial.induction
import data.polynomial.degree.definitions
import deprecated.ring
/-!
# Theory of univari... |
f5e33160cce4db2e035064ab3f9749913691119d | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/category_theory/monoidal/types.lean | 3b60782d14527d9d61d946e9bd5619fde1629b06 | [
"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 | 675 | lean | /-
Copyright (c) 2018 Michael Jendrusch. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Michael Jendrusch, Scott Morrison
-/
import category_theory.monoidal.of_has_finite_products
import category_theory.limits.shapes.finite_products
import category_theory.limits.types
... |
5b3490b985a846e6be8b7d252982888cd5c8e5a6 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/data/pnat/basic.lean | ff291fae61c6b7f115a9ccf03869976c360d807d | [
"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 | 15,499 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Neil Strickland
-/
import data.nat.basic
/-!
# The positive natural numbers
This file defines the type `ℕ+` or `pnat`, the subtype of natural numbers that are ... |
3b503881ed1047abbc15c2860b4485e108359e66 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/data/equiv/basic.lean | 211dc09bf4a90da79f95b2f5acda117d1e82d019 | [
"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 | 89,231 | 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.fun_like.equiv
import data.option.basic
import data.prod
import data.quot
import data.sigma.basic
import data.sum.basic
import d... |
a534deb422ad6af571bcf772b440c9c069b2f8cc | a76f677b87d42a9470ba3a0a78cfddd3063118e6 | /src/congruence/perpendicular.lean | 4dd13793b487905c2a7644b74379dd65db0e1d88 | [] | no_license | Ja1941/hilberts-axioms | 50219c732ad5fa167408432e8c8baae259777a40 | 5b653a92e448b77da41c9893066b641bc4e6b316 | refs/heads/master | 1,693,238,884,856 | 1,635,702,120,000 | 1,635,702,120,000 | 385,546,384 | 9 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 6,664 | lean | /-
Copyright (c) 2021 Tianchen Zhao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Tianchen Zhao
-/
import congruence.ang_lt
/-!
# Right angles and perpendicularity
This file defines right angles using `supplementary` and how two lines
are perpendicular, proves that... |
cfbeeb19cf10a795d2b9699520453cc91b0b7399 | 0f5090f82d527e0df5bf3adac9f9e2e1d81d71e2 | /src/apurva/algebraically_closed.lean | ffb96fe136dec86764b896b4ba7a45cfe3721a16 | [] | no_license | apurvanakade/mc2020-lean-projects | 36eb42c4baccc37183635c36f8e1b3afa4ec1230 | 02466225aa629ab1232043bcc0a053a099fdb939 | refs/heads/master | 1,688,791,717,534 | 1,597,874,092,000 | 1,597,874,092,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 646 | lean | import tactic
import algebra.field
import analysis.complex.polynomial
import data.multiset.basic
import field_theory.splitting_field
noncomputable theory
open_locale classical
open complex polynomial
universes u
variables {k : Type u} [field k]
class algebraically_closed (k : Type u) extends field k :=
(exists_... |
88e4ddeaa2f8ef3428df72ee95ae1f3a6ef37751 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/algebra/big_operators/basic.lean | 1b65746cbb1ed2cc5d1c3f1163a410d4a93b4303 | [
"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 | 74,610 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
-/
import algebra.group.pi
import algebra.hom.equiv
import algebra.ring.opposite
import data.finset.fold
import data.fintype.basic
import data.set.pairwise
/-!
# Big o... |
c546ad147ef6e12b58b13333588401491376274f | da2388aff16df48b4a928b575bcec678b8e7f2cf | /src/equivalent.lean | dadc75e70436e7dd0f15dda6194c308f7cff1e07 | [] | no_license | ADedecker/series | 1d0d282d4333c7599f07cc705a35cf5edfb87a3b | 12fbcdd16b3cdeda4476165a4645fcccc0fb3234 | refs/heads/master | 1,674,828,739,868 | 1,607,618,619,000 | 1,607,618,619,000 | 304,379,894 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,378 | lean | import analysis.calculus.deriv
import data.polynomial.erase_lead
import asymptotics2
import analysis.asymptotic_equivalent
import topology.algebra.ordered
import algebra.group.pi
open_locale asymptotics
open filter
namespace asymptotics
section
variables {α β : Type*} {u v w : α → β} [normed_group β] {l : filter α}... |
63b571618aaa5d988b8ab48bcf48b2bd6fc2cf0b | 4727251e0cd73359b15b664c3170e5d754078599 | /src/measure_theory/measure/null_measurable.lean | f64dcb5ca470d7eaf2ddd37aa991700b1b21049f | [
"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 | 19,221 | 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 measure_theory.measure.ae_disjoint
/-!
# Null measurable sets and complete measures
## Main definitions
### Null measurable... |
31bd2933892be904e735cd05181b7764d52dcca0 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /library/init/data/sigma/lex.lean | 7daa175c84699b9e4bc0902329954a2b6f236b0e | [
"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 | 5,715 | 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.data.sigma.basic init.meta
universes u v
namespace psigma
section
variables {α : Sort u} {β : α → Sort v}
variable (r : α → α → Pro... |
53b6222b8e099455d9f7655d285513f8f66e5c18 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/ring_theory/witt_vector/init_tail.lean | 2be11f7e6b5d19ff19bba4160107d86e35cb7725 | [
"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 | 7,174 | lean | /-
Copyright (c) 2020 Johan Commelin, Robert Y. Lewis. 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.basic
import ring_theory.witt_vector.is_poly
/-!
# `init` and `tail`
> THIS FILE IS SYNCHRONIZED ... |
d7e95d34f05379145e0b38d59b9c8c0d1c9c7bfc | 19cc34575500ee2e3d4586c15544632aa07a8e66 | /src/data/finset/pi.lean | cc1a37eb506d84d3967812ecc3a603cdbe2a77f1 | [
"Apache-2.0"
] | permissive | LibertasSpZ/mathlib | b9fcd46625eb940611adb5e719a4b554138dade6 | 33f7870a49d7cc06d2f3036e22543e6ec5046e68 | refs/heads/master | 1,672,066,539,347 | 1,602,429,158,000 | 1,602,429,158,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,471 | lean | /-
Copyright (c) 2018 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Johannes Hölzl
-/
import data.finset.basic
import data.multiset.pi
/-!
# The cartesian product of finsets
-/
namespace finset
open multiset
/-! ### pi -/
section pi
variables {α : Ty... |
471b33581ffd4d08c09e53aab512b2f46653ad34 | 36c7a18fd72e5b57229bd8ba36493daf536a19ce | /tests/lean/run/blast18.lean | 935ad4e89e05066f60602207cfe478ce21267ea6 | [
"Apache-2.0"
] | permissive | YHVHvx/lean | 732bf0fb7a298cd7fe0f15d82f8e248c11db49e9 | 038369533e0136dd395dc252084d3c1853accbf2 | refs/heads/master | 1,610,701,080,210 | 1,449,128,595,000 | 1,449,128,595,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 578 | lean | -- Backward chaining with tagged rules
constants {P Q R S T U : Prop} (Hpq : P → Q) (Hqr : Q → R) (Hrs : R → S) (Hst : S → T)
constants (Huq : U → Q) (Hur : U → R) (Hus : U → S) (Hut : U → T)
attribute Hpq [backward]
attribute Hqr [backward]
attribute Hrs [backward]
attribute Hst [backward]
attribute Huq [backward]
at... |
dc665b0915646a6b62537a70c71853936ca66b6e | 4727251e0cd73359b15b664c3170e5d754078599 | /src/category_theory/preadditive/yoneda.lean | ee5bcc9ac3c17522c485033e90faeb34c9e78aeb | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 5,269 | lean | /-
Copyright (c) 2022 Markus Himmel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel
-/
import category_theory.preadditive.opposite
import algebra.category.Module.basic
import algebra.category.Group.preadditive
/-!
# The Yoneda embedding for preadditive c... |
94dabd8a8a6925c0176383e58dabddcd39481134 | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /src/Lean/Meta/Check.lean | 2a303760c78ff61338dc3c346695e9210986066c | [
"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,663 | 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.Meta.InferType
import Lean.Meta.LevelDefEq
/-
This is not the Kernel type checker, but an auxiliary method for checking
whether terms produced ... |
1284668879f59bafe25ade8ccd97c877bc7dc2ca | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /archive/imo/imo2008_q4.lean | b82ea5691640db1bb01c32c18419b300058db018 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 4,593 | lean | /-
Copyright (c) 2021 Manuel Candales. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Manuel Candales
-/
import data.real.basic
import data.real.sqrt
import data.real.nnreal
import tactic.linear_combination
/-!
# IMO 2008 Q4
Find all functions `f : (0,∞) → (0,∞)` (so,... |
c357f1b41648bcfc203e069cbf4abe39b3003e92 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/diamond6.lean | 50ebd663f3ca438282899f5f5aebbdcd5d6f7ea2 | [
"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 | 828 | lean | set_option structureDiamondWarning false
class Foo (α : Type) extends Add α where
zero : α
class FooComm (α : Type) extends Foo α where
comm (a b : α) : a + b = b + a
class FooAssoc (α : Type) extends Foo α, Mul α where
add_assoc (a b c : α) : (a + b) + c = a + (b + c)
mul_assoc (a b c : α) : (a * b) * c = a... |
7a4ed96d29bca3b7e759b99c7ef4c4cc6aa9c191 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/congrTactic.lean | 07e90a52ba0e0332f9df607bdcbc206b0093ed8c | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 1,013 | lean | example (h : a = b) : Nat.succ (a + 1) = Nat.succ (b + 1) := by
congr
example (h : a = b) : Nat.succ (a + 1) = Nat.succ (b + 1) := by
congr 1
show a + 1 = b + 1
rw [h]
def f (p : Prop) (a : Nat) (h : a > 0) [Decidable p] : Nat :=
if p then
a - 1
else
a + 1
example (h : a = b) : f True (a + 1) (by... |
dc57e22ba6069d835b28352a14e64b39e7f8ee4f | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /library/algebra/ordered_field.lean | 56085f47840a0daf6bddd08e8e774097bba7a8dc | [
"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 | 14,301 | lean | /-
Copyright (c) 2014 Robert Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: algebra.ordered_field
Authors: Robert Lewis
-/
import algebra.ordered_ring algebra.field
open eq eq.ops
namespace algebra
structure linear_ordered_field [class] (A : Type) extends li... |
55ce5d25a00d803cfb0aeab157d6cde8314865fc | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /tests/lean/t7.lean | 3eb8ebc18e38017319193056e5aa94b85c0dc637 | [
"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 | 621 | lean | definition Prop : Type.{1} := Type.{0}
constant and : Prop → Prop → Prop
context
parameter {A : Type} -- Mark A as implicit parameter
parameter R : A → A → Prop
parameter B : Type
definition id (a : A) : A := a
private definition refl : Prop := ∀ (a : A), R a a
definition symm : Prop := ∀ (a b : A),... |
bc4f40ccc13d32059c6a66c8e2e7f4f067ca9162 | c76cc4eaee3c806716844e49b5175747d1aa170a | /src/problems_sheet_five.lean | 2116df1497de0f5fc246613f88ff707ee5d96ad3 | [] | no_license | ImperialCollegeLondon/M40002 | 0fb55848adbb0d8bc4a65ca5d7ed6edd18764c28 | a499db70323bd5ccae954c680ec9afbf15ffacca | refs/heads/master | 1,674,878,059,748 | 1,607,624,828,000 | 1,607,624,828,000 | 309,696,750 | 3 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 785 | lean | import tactic
import data.real.basic
import data.pnat.basic
local notation `|` x `|` := abs x
def is_limit (a : ℕ → ℝ) (l : ℝ) : Prop :=
∀ ε > 0, ∃ N, ∀ n ≥ N, | a n - l | < ε
def tends_to_plus_infinity (a : ℕ → ℝ) : Prop :=
∀ B, ∃ N, ∀ n ≥ N, B < a n
def is_convergent (a : ℕ → ℝ) : Prop :=
∃ l : ℝ, is_limit a l
... |
ac39b3f02603b860fedc1ee857b8d3c5c82b4824 | 8e6cad62ec62c6c348e5faaa3c3f2079012bdd69 | /src/analysis/convex/integral.lean | e3a5f71a2bd1f5d076420d0006ab59a03c918cd5 | [
"Apache-2.0"
] | permissive | benjamindavidson/mathlib | 8cc81c865aa8e7cf4462245f58d35ae9a56b150d | fad44b9f670670d87c8e25ff9cdf63af87ad731e | refs/heads/master | 1,679,545,578,362 | 1,615,343,014,000 | 1,615,343,014,000 | 312,926,983 | 0 | 0 | Apache-2.0 | 1,615,360,301,000 | 1,605,399,418,000 | Lean | UTF-8 | Lean | false | false | 7,685 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Yury G. Kudryashov
-/
import analysis.convex.basic
import measure_theory.set_integral
/-!
# Jensen's inequality for integrals
In this file we prove four theorems:
* `convex.smul_... |
eebaaf13afefba24439ae3b002358116ab3e49ed | ea4aee6b11f86433e69bb5e50d0259e056d0ae61 | /src/tidy/propositional_goals.lean | 4d6733b14ff335583b9fbbb9e220da8b92b46ff1 | [] | no_license | timjb/lean-tidy | e18feff0b7f0aad08c614fb4d34aaf527bf21e20 | e767e259bf76c69edfd4ab8af1b76e6f1ed67f48 | refs/heads/master | 1,624,861,693,182 | 1,504,411,006,000 | 1,504,411,006,000 | 103,740,824 | 0 | 0 | null | 1,505,553,968,000 | 1,505,553,968,000 | null | UTF-8 | Lean | false | false | 1,152 | lean | -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Scott Morrison
open tactic
private meta def propositional_goals_core { α : Type } (tac : tactic α) : list expr → list expr → (list (option α)) → bool → tactic (list (option α)... |
a35e898d5b85aa96bb39add890f89ecc7b4553f2 | 5a5e1bb8063d7934afac91f30aa17c715821040b | /lean3SOS/src/lib/psd_float.lean | 5a215bff379d6d1159b4e84941f23e913a3353f0 | [] | no_license | ramonfmir/leanSOS | 1883392d73710db5c6e291a2abd03a6c5b44a42b | 14b50713dc887f6d408b7b2bce1f8af5bb619958 | refs/heads/main | 1,683,348,826,105 | 1,622,056,982,000 | 1,622,056,982,000 | 341,232,766 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 12,290 | lean | import data.rat.order
import to_mathlib.matrix float.basic float.div lib.psd
-- We have A ∈ 𝒮(𝔽)ⁿˣⁿ.
open matrix float
open_locale matrix big_operators
variables (n : nat) (hn : 0 < n) (A : matrix (fin n) (fin n) float) (h : symmetric A)
theorem psd_of_ldlt
(L : matrix (fin n) (fin n) float)
(hL : symmetri... |
d5784d9ab1188aefd5f2a6f463b3236fb5f5baf2 | 19a24126e4b7677703434d80717041622a5f1d61 | /Type_Theory_and_Functional_Programming.lean | 3e772fbd23c89fc4a43ad0691ad1312bc2427180 | [] | no_license | JoseBalado/lean-notes | f5ff8d4c99ba8c1f79d7894ba0f130fa4eb09695 | 0b579f83988cc844ac1ff0592d885061959a852e | refs/heads/master | 1,587,743,561,316 | 1,567,181,955,000 | 1,567,181,955,000 | 172,086,145 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,907 | lean | -- Prove ¬(p ∨ q) ↔ ¬p ∧ ¬q
example (p q : Prop) : ¬(p ∨ q) ↔ ¬p ∧ ¬q :=
⟨λ h, ⟨λ hp, h (or.inl hp), λ hq, h (or.inr hq)⟩,
λ hn h, or.elim h hn.1 hn.2⟩
-- Page 83
-- Prove (A ∧ B) → (B ∧ A)
example (A B : Prop) : (A ∧ B) → (B ∧ A) :=
λ ⟨A, B⟩, ⟨B, A⟩
example (A B : Prop) : (A ∧ B) → (B ∧ A) :=
λ p : A ∧ B, ⟨and.ri... |
737db74f6ab98dd6a140052d2fdfc33e9e9ee5d6 | 9b9a16fa2cb737daee6b2785474678b6fa91d6d4 | /src/topology/instances/ennreal.lean | cc89d799241d7ef044d902da286022db546587ca | [
"Apache-2.0"
] | permissive | johoelzl/mathlib | 253f46daa30b644d011e8e119025b01ad69735c4 | 592e3c7a2dfbd5826919b4605559d35d4d75938f | refs/heads/master | 1,625,657,216,488 | 1,551,374,946,000 | 1,551,374,946,000 | 98,915,829 | 0 | 0 | Apache-2.0 | 1,522,917,267,000 | 1,501,524,499,000 | Lean | UTF-8 | Lean | false | false | 28,680 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Johannes Hölzl
Extended non-negative reals
-/
import topology.instances.nnreal data.real.ennreal
noncomputable theory
open classical set lattice filter metric
local attribute [instance... |
5929f9f9376c0720ed56524508e6c6545b889914 | e151e9053bfd6d71740066474fc500a087837323 | /src/hott/algebra/order.lean | 0841efd9279634d3622c38e008c3aab52549d2e2 | [
"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 | 19,004 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad
Weak orders "≤", strict orders "<", and structures that include both.
-/
import .binary
universes u v w
hott_theory
set_option old_structure_cmd true
namespace hott
open... |
4695aaa6882df5caa2d24de3f0406f736cf7ff1e | c777c32c8e484e195053731103c5e52af26a25d1 | /src/algebraic_geometry/morphisms/open_immersion.lean | 62465fea56bb8b5f4b0fd77fa0d1199fa6132dd1 | [
"Apache-2.0"
] | permissive | kbuzzard/mathlib | 2ff9e85dfe2a46f4b291927f983afec17e946eb8 | 58537299e922f9c77df76cb613910914a479c1f7 | refs/heads/master | 1,685,313,702,744 | 1,683,974,212,000 | 1,683,974,212,000 | 128,185,277 | 1 | 0 | null | 1,522,920,600,000 | 1,522,920,600,000 | null | UTF-8 | Lean | false | false | 3,790 | lean | /-
Copyright (c) 2022 Andrew Yang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Andrew Yang
-/
import topology.local_at_target
import algebraic_geometry.morphisms.basic
/-!
# Open immersions
A morphism is an open immersions if the underlying map of spaces is an op... |
99893cbf9c97e1a14cfa9b5d40afb9e6b7536a62 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/html_cmd.lean | 138ce797c6ea2b056d80a80c05069cc5562e05e9 | [
"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 | 184 | lean | open widget
variables {α:Type}
meta def Hello : component string α := component.pure (λ s, ["hello, ", s, ", good day!"])
#html (Hello "lean") -- renders "hello, lean, good day!" |
754ebf3380dd407f296b9475b6e5512f9891dd99 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/category_theory/preadditive/projective.lean | eed19d811b4596a049b3122fcf0e35d3298ffd70 | [
"Apache-2.0"
] | permissive | robertylewis/mathlib | 3d16e3e6daf5ddde182473e03a1b601d2810952c | 1d13f5b932f5e40a8308e3840f96fc882fae01f0 | refs/heads/master | 1,651,379,945,369 | 1,644,276,960,000 | 1,644,276,960,000 | 98,875,504 | 0 | 0 | Apache-2.0 | 1,644,253,514,000 | 1,501,495,700,000 | Lean | UTF-8 | Lean | false | false | 6,487 | lean | /-
Copyright (c) 2020 Markus Himmel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel, Scott Morrison
-/
import algebra.homology.exact
import category_theory.types
import category_theory.limits.shapes.biproducts
/-!
# Projective objects and categories with... |
306f229f5b5d45d983f8b856aae456f8f9fa08c5 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/topology/bases.lean | de9eec02d31e63b1373d519b58667032ef830e55 | [
"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 | 38,825 | 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
-/
import topology.constructions
import topology.continuous_on
/-!
# Bases of topologies. Countability axioms.
A topological basis on a topological spa... |
9481bb751533fa4808eac8ccefa7a1cb4fc284f9 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /stage0/src/Lean/Elab/StructInst.lean | 8630cad04bb88b2826ea12cb49157d6ecf0255a1 | [
"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 | 37,941 | 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.FindExpr
import Lean.Parser.Term
import Lean.Meta.Structure
import Lean.Elab.App
import Lean.Elab.Binders
namespace Lean.Elab.Term.StructI... |
a49af7809caf59e955a66e1927a9e325b1669726 | 2cf781335f4a6706b7452ab07ce323201e2e101f | /lean/list/lemmas.lean | 6f2cb0c78297b4a89b08b0346afc6b3ceccb7cac | [
"Apache-2.0"
] | permissive | simonjwinwood/reopt-vcg | 697cdd5e68366b5aa3298845eebc34fc97ccfbe2 | 6aca24e759bff4f2230bb58270bac6746c13665e | refs/heads/master | 1,586,353,878,347 | 1,549,667,148,000 | 1,549,667,148,000 | 159,409,828 | 0 | 0 | null | 1,543,358,444,000 | 1,543,358,444,000 | null | UTF-8 | Lean | false | false | 1,493 | lean | /-
Copyright (c) 2018 Galois. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Additional lemmas for lists.
This is a work-in-progress, and contains additions to other theories.
-/
import tactic.find
import ..tactic
open nat
section reverse
universes u
lemma reverse_cor... |
1f1bfdc803dc138ba315e33c30ff0d9ffd858db1 | 46125763b4dbf50619e8846a1371029346f4c3db | /src/field_theory/splitting_field.lean | ab2558f2fad5a92b4e80020a7fe841445fa5b51e | [
"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 | 7,771 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
Definition of splitting fields, and definition of homomorphism into any field that splits
-/
import ring_theory.unique_factorization_domain
import data.polynomial ring_the... |
3125ff7f11f1c43c59b81475ed5d867531fcb12d | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/topology/algebra/ordered.lean | 71ab346d975642f8878f2d21ce902253f2bff08d | [
"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 | 78,145 | 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 tactic.tfae
import order.liminf_limsup
import data.set.intervals
import topology.algebra.group
import topology.constructions
... |
46a7a307e8f558d52fa47d82f8939ec3f3f01b0a | 1437b3495ef9020d5413178aa33c0a625f15f15f | /data/complex/exponential.lean | 389c159db635dbd8ab1308a6bf802f3835971862 | [
"Apache-2.0"
] | permissive | jean002/mathlib | c66bbb2d9fdc9c03ae07f869acac7ddbfce67a30 | dc6c38a765799c99c4d9c8d5207d9e6c9e0e2cfd | refs/heads/master | 1,587,027,806,375 | 1,547,306,358,000 | 1,547,306,358,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 46,777 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import algebra.archimedean
import data.nat.choose data.complex.basic
import tactic.linarith
local attribute [instance, priority 0] classical.prop_decidable
loc... |
bf038f03922ded7e815321e7b67d21a053849182 | 4fa161becb8ce7378a709f5992a594764699e268 | /src/data/pnat/factors.lean | 32fd431cf819734d424603101204c364674266b7 | [
"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 | 13,933 | lean | /-
Copyright (c) 2019 Neil Strickland. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Neil Strickland
-/
import data.pnat.basic
import data.multiset
import data.int.gcd
import algebra.group
/-- The type of multisets of prime numbers. Unique factorization
gives an equ... |
e855c9f4de0be073e7a5dfba4d2a1137d2f736cd | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/tactic/rename_var_auto.lean | db4f18db38d75b3008f1c98acdcc5cb205758724 | [] | 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,429 | lean | /-
Copyright (c) 2019 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.tactic.interactive
import Mathlib.PostPort
namespace Mathlib
/-!
# Rename bound variable ... |
10381abef690be4e089961e79a0a9606c5b2e752 | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/data/polynomial.lean | 5ad76466ddba244397b2bada1fd1886e5443175c | [
"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 | 96,955 | 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, Jens Wagemaker
Theory of univariate polynomials, represented as `ℕ →₀ α`, where α is a commutative semiring.
-/
import data.finsupp algebra.gcd_domain ring... |
aedbf05f529198369da3be60504f8cdd4a155111 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/constProp.lean | 67ecfb8e57c8d9b0f1cef5b200f1c0eb47e7ec0e | [
"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 | 20,539 | lean | abbrev Var := String
inductive Val where
| int (i : Int)
| bool (b : Bool)
deriving DecidableEq, Repr
instance : Coe Bool Val where
coe b := .bool b
instance : Coe Int Val where
coe i := .int i
instance : OfNat Val n where
ofNat := .int n
#check (true : Val)
#check (0 : Val)
inductive BinOp where
... |
94c071e55bc24db1a47f224619578d9ce289f899 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/order/complete_lattice.lean | 0dfaaca61b75701cd15e64d079e33969e1d17226 | [
"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 | 55,059 | 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.bool.set
import data.nat.basic
import order.bounds
/-!
# Theory of complete lattices
## Main definitions
* `Sup` and `Inf` are the supremum and the inf... |
ec2f3c21fd190efd9e0f26b6638ae871c1c46885 | 30b012bb72d640ec30c8fdd4c45fdfa67beb012c | /analysis/real.lean | a317762d26eb3ed5a2099fa7eeba6a4bcb9e8671 | [
"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 | 17,444 | 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
The real numbers ℝ.
They are constructed as the topological completion of ℚ. With the following steps:
(1) prove that ℚ forms a uniform space.
(2) subt... |
4dd878941aad934f94a7d118829f38de36c19c5d | 4fa161becb8ce7378a709f5992a594764699e268 | /src/analysis/specific_limits.lean | 7abc333e93fedc93738e6a6d6b1e9e40baba91cb | [
"Apache-2.0"
] | permissive | laughinggas/mathlib | e4aa4565ae34e46e834434284cb26bd9d67bc373 | 86dcd5cda7a5017c8b3c8876c89a510a19d49aad | refs/heads/master | 1,669,496,232,688 | 1,592,831,995,000 | 1,592,831,995,000 | 274,155,979 | 0 | 0 | Apache-2.0 | 1,592,835,190,000 | 1,592,835,189,000 | null | UTF-8 | Lean | false | false | 25,502 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
A collection of specific limit computations.
-/
import analysis.normed_space.basic
import algebra.geom_sum
import topology.instances.ennreal
import tactic.ring_exp
non... |
2484d46154a6f19804f4fdf1686b2858c39b9bef | bb31430994044506fa42fd667e2d556327e18dfe | /src/measure_theory/function/lp_space.lean | 9c98bf1ea7d94f3b039c2ec8505c38b329d4ce46 | [
"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 | 128,957 | lean | /-
Copyright (c) 2020 Rémy Degenne. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Rémy Degenne, Sébastien Gouëzel
-/
import analysis.normed_space.indicator_function
import analysis.normed.group.hom
import measure_theory.function.ess_sup
import measure_theory.function.... |
89383e2ee5b195e491c73ca350f02dddae817716 | c1a29ca460720df88ab68dc42d9a1a02e029d505 | /examples/introduction/unnamed_237.lean | e023dd96f15255302eae936123bbf1280a3f0fdf | [] | no_license | agusakov/mathematics_in_lean | acb5b3d659e4522ae4b4836ea550527f03f6546c | 2539562e4d91c858c73dbecb5b282ce1a7d38b6d | refs/heads/master | 1,665,963,365,241 | 1,592,080,022,000 | 1,592,080,022,000 | 272,078,062 | 0 | 0 | null | 1,592,078,772,000 | 1,592,078,772,000 | null | UTF-8 | Lean | false | false | 163 | lean | import data.nat.parity tactic
open nat
-- BEGIN
example : ∀ m n, even n → even (m * n) :=
by rintros m n ⟨k, hk⟩; use m * k; rw [hk, mul_left_comm]
-- END |
1b62f636afa9211915cf1d8f9d30fb3696a470a3 | f3a5af2927397cf346ec0e24312bfff077f00425 | /src/game/world8/level1.lean | ad5359ed70c9ce880102e47c2abd12975cc4f944 | [
"Apache-2.0"
] | permissive | ImperialCollegeLondon/natural_number_game | 05c39e1586408cfb563d1a12e1085a90726ab655 | f29b6c2884299fc63fdfc81ae5d7daaa3219f9fd | refs/heads/master | 1,688,570,964,990 | 1,636,908,242,000 | 1,636,908,242,000 | 195,403,790 | 277 | 84 | Apache-2.0 | 1,694,547,955,000 | 1,562,328,792,000 | Lean | UTF-8 | Lean | false | false | 1,894 | lean | import mynat.definition -- hide
import mynat.add -- hide
import game.world2.level6 -- hide
namespace mynat -- hide
/- Axiom : succ_inj {a b : mynat} :
succ(a) = succ(b) → a = b
-/
/-
# Advanced Addition World
## Level 1: `succ_inj`. A function.
Peano's original collection of axioms for the natural numbers contai... |
bdf1bf0f4bda0144206f2baf240caf0068036b0a | 592ee40978ac7604005a4e0d35bbc4b467389241 | /Library/generated/mathscheme-lean/PointedTimesMagma.lean | 354ca2ff73c40e5797e9f3dc6fc459289885bc70 | [] | no_license | ysharoda/Deriving-Definitions | 3e149e6641fae440badd35ac110a0bd705a49ad2 | dfecb27572022de3d4aa702cae8db19957523a59 | refs/heads/master | 1,679,127,857,700 | 1,615,939,007,000 | 1,615,939,007,000 | 229,785,731 | 4 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,118 | lean | import init.data.nat.basic
import init.data.fin.basic
import data.vector
import .Prelude
open Staged
open nat
open fin
open vector
section PointedTimesMagma
structure PointedTimesMagma (A : Type) : Type :=
(times : (A → (A → A)))
(e : A)
open PointedTimesMagma
structure Sig (AS : Type) : T... |
aee6affb12c071c27f95a05362c03f5993a928a7 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/field_theory/galois_auto.lean | ca225a61ea0950e62fe141b1134f7679e7055797 | [] | 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 | 13,219 | lean | /-
Copyright (c) 2020 Thomas Browning and Patrick Lutz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Thomas Browning and Patrick Lutz
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.field_theory.normal
import Mathlib.field_theory.primiti... |
7889c035abda060b7f4b7707482c0e6ffc5c97c5 | 076f5040b63237c6dd928c6401329ed5adcb0e44 | /answers/hw3_function_terms_lambda.lean | a9eb456c9dcf976fc762deefb6827788df6adf92 | [] | no_license | kevinsullivan/uva-cs-dm-f19 | 0f123689cf6cb078f263950b18382a7086bf30be | 09a950752884bd7ade4be33e9e89a2c4b1927167 | refs/heads/master | 1,594,771,841,541 | 1,575,853,850,000 | 1,575,853,850,000 | 205,433,890 | 4 | 9 | null | 1,571,592,121,000 | 1,567,188,539,000 | Lean | UTF-8 | Lean | false | false | 7,206 | lean | -- You can ignore this line for now, but don't remove it.
namespace hw3
/-
In this assignment, you will put into practice your new
knowledge of terms and definitions in predicate logic by
using it to implement a library of Boolean functions. You
will also gain practice using different forms of syntax
for defining func... |
19d6c6b97b6a298adb0fa691090f8c25801871de | b7f22e51856f4989b970961f794f1c435f9b8f78 | /library/data/list/set.lean | 197c41d94aaecee0acfb83ab78393731bd866e34 | [
"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 | 37,214 | lean | /-
Copyright (c) 2015 Leonardo de Moura. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
Set-like operations on lists
-/
import data.list.basic data.list.comb
open nat function decidable helper_tactics eq.ops
namespace list
section erase
variable {A ... |
987de05056cdc88d13f456f625d927b4aa65c1e5 | e9ac8fc7b80f2e90e26764c906f915cc016c920f | /colimit/seq_colim.hlean | ed7b510761cbdaafbb31b47ab28ede7109ceba1a | [
"Apache-2.0"
] | permissive | sinhp/Spectral | bb7e02dbfd7213e05e1d5c5e2f156254bbaab8ef | 234d9a703c0854b6f8ec1f564e8e6311eea25121 | refs/heads/master | 1,643,018,677,958 | 1,562,821,654,000 | 1,562,821,654,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 37,544 | hlean | import hit.colimit .sequence cubical.squareover types.arrow types.equiv
cubical.pathover2
open eq nat sigma sigma.ops quotient equiv pi is_trunc is_equiv fiber function trunc
namespace seq_colim
-- note: this clashes with the abbreviation defined in namespace "colimit"
abbreviation ι [constructor] := @inclus... |
6e47c42c6ed2a1380e902b86c5dd5173492d9706 | 0d2e44896897eda703992595d71a0b19ed30b8a1 | /uexp/src/uexp/rules/aggregation.lean | d32b3423b7d2c5a7e6c7de6340ff25d94d43737f | [
"BSD-2-Clause"
] | permissive | wwombat/Cosette | a87312aabefdb53ea8b67c37731bd58c7485afb6 | 4c5dc6172e24d3546c9818ac1fad06f72fe1c991 | refs/heads/master | 1,619,479,568,051 | 1,520,292,502,000 | 1,520,292,502,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,082 | lean | import ..sql
import ..tactics
import ..u_semiring
import ..extra_constants
open Expr
open Proj
open Pred
open SQL
open tree
theorem aggegation_query :
forall (Γ : Schema) s (a : relation s) C0 (value : Column C0 s) C1 (label: Column C1 s) (l : const C1),
let lbl : Expr (Γ ++ s) C1 := uvariable (right⋅label),
... |
33f654b8fb7a1b692bcd50b3f427e2345887482c | 1d265c7dd8cb3d0e1d645a19fd6157a2084c3921 | /src/other/n_sq_even_n_even.lean | ce7bec7be48fa8b098cd90b636e818bc816427ad | [
"MIT"
] | permissive | hanzhi713/lean-proofs | de432372f220d302be09b5ca4227f8986567e4fd | 4d8356a878645b9ba7cb036f87737f3f1e68ede5 | refs/heads/master | 1,585,580,245,658 | 1,553,646,623,000 | 1,553,646,623,000 | 151,342,188 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 1,357 | lean | import .odd_and_even_nat
example : ∀ n:ℕ, even (n * n) ↔ even(n) :=
begin
assume n,
split,
assume h,
apply exists.elim h,
assume a h1,
apply classical.by_contradiction,
assume noteven,
have oddn := (not_even_odd n).1 noteven,
apply exists.eli... |
c1811c5af6c6f37b35c7f0a99450b2066276125a | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/analysis/inner_product_space/l2_space.lean | 1a07d1c490c3aab0a03c749f77952b3df8534a8c | [
"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 | 24,373 | lean | /-
Copyright (c) 2022 Heather Macbeth. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Heather Macbeth
-/
import analysis.inner_product_space.projection
import analysis.normed_space.lp_space
import analysis.inner_product_space.pi_L2
/-!
# Hilbert sum of a family of inn... |
d75d5d797d435b1795b490d3b2ca99f00eda368b | f5f7e6fae601a5fe3cac7cc3ed353ed781d62419 | /src/data/set/lattice.lean | 13db8711955f7809f0b3682e88d9eff193ddf508 | [
"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 | 31,469 | 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, Johannes Hölzl, Mario Carneiro
-- QUESTION: can make the first argument in ∀ x ∈ a, ... implicit?
-/
import logic.basic data.set.basic data.equiv.basic... |
71f64fcfdb9d779f3c7cf7618e279459797b16a1 | e38e95b38a38a99ecfa1255822e78e4b26f65bb0 | /src/certigrad/predicates.lean | bdab074eb3421699c9abd206b68b6e05fe9e949c | [
"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 | 7,153 | lean | /-
Copyright (c) 2017 Daniel Selsam. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Daniel Selsam
Predicates.
-/
import .util .id .reference .graph .compute_grad
open list
namespace certigrad
def is_downstream (cost : ID) : reference → list node → Prop
| _ [] := fa... |
44aa38993e467fae7b8eb9266b539a8069142fa0 | 92b1c7f0343a6a5cd36bc0f623a7490da3f1e0f3 | /src/stump/algorithm_definition.lean | 4f129eb3288f84e6d362294993c1e2521e9f3bc8 | [
"Apache-2.0"
] | permissive | jtristan/stump-learnable | 717453eb590af16e60c7d3806cc9e66492fab091 | aa3c089f41602efa08d31ef6b41e549456186d57 | refs/heads/master | 1,625,630,634,360 | 1,607,552,106,000 | 1,607,552,106,000 | 218,629,406 | 15 | 2 | null | null | null | null | UTF-8 | Lean | false | false | 577 | lean | /-
Copyright © 2019, Oracle and/or its affiliates. All rights reserved.
-/
import .setup_definition
namespace stump
variables (target: ℍ) (n: ℕ)
noncomputable
def label_sample := vec_map (label target)
def filter := vec_map (λ p: (ℍ × bool), if p.snd then p.fst else 0)
noncomputable
def max: Π n: ℕ, vec ℍ n → ℍ
... |
118cf878a58cbce865846df0b623d4436fe7a3fc | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/monoidal/End_auto.lean | 00d11d28b0b72b17973a1f7c1fbf9ff3a34dbe5e | [] | 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,797 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.category_theory.monoidal.functor
import Mathlib.PostPort
universes u v
namespace Mathlib... |
6f886b15b93c3480eaf4e67b56068ddb52b6d933 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/topology/category/CompHaus/default.lean | 4c7d7325ab7e4672c53c6af66fe6f430adc37923 | [
"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,633 | lean | /-
Copyright (c) 2020 Adam Topaz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Adam Topaz, Bhavik Mehta
-/
import category_theory.adjunction.reflective
import topology.category.Top
import topology.stone_cech
import category_theory.monad.limits
import topology.urysoh... |
7047a3da970ea8220d74bf1c7d04dc97a78ae493 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/field_theory/polynomial_galois_group.lean | 3f192ae04a2d3300037aaf32bd6ae430baecdd54 | [
"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 | 21,707 | lean | /-
Copyright (c) 2020 Thomas Browning, Patrick Lutz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Thomas Browning, Patrick Lutz
-/
import analysis.complex.polynomial
import field_theory.galois
import group_theory.perm.cycle.type
/-!
# Galois Groups of Polynomials
I... |
d4414d1b34384c3800e8713649378014a6983706 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/1156.lean | d8b5253e1f12ec260fdcbde7c136a356e98f1e4b | [
"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 | 336 | lean | inductive Foo : Nat -> Type where
| mk (a b : Nat) : Foo a -> Foo b
#check @Foo.mk
example : (a b : Nat) → Foo a → Foo b := @Foo.mk
#print Foo
namespace Ex2
def natToType : Nat → Type
| 0 => Unit
| _ => Bool
inductive Foo : Nat → Char → Prop
| mk (n : Nat) (elem : natToType n) (c : Char) : Foo n c
#print Foo
en... |
373718acf9075f9ba28f963f7d90366e569abe96 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/tactic/suggest.lean | 55259d0db3e0dbe199fcab01bebd8c45ee36b606 | [
"Apache-2.0"
] | permissive | AntoineChambert-Loir/mathlib | 64aabb896129885f12296a799818061bc90da1ff | 07be904260ab6e36a5769680b6012f03a4727134 | refs/heads/master | 1,693,187,631,771 | 1,636,719,886,000 | 1,636,719,886,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 22,126 | lean | /-
Copyright (c) 2019 Lucas Allen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Lucas Allen, Scott Morrison
-/
import data.mllist
import tactic.solve_by_elim
/-!
# `suggest` and `library_search`
`suggest` and `library_search` are a pair of tactics for applying lemm... |
aaba243af81c9b4a267a5cfd183aed1b85852708 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/hott/unfold_test.hlean | b5e398fcf62d6edb97bde6ed121ea0db45acd91b | [
"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,059 | hlean | import algebra.e_closure
open eq
namespace relation
section
parameters {A : Type}
(R : A → A → Type)
local abbreviation T := e_closure R
variables ⦃a a' : A⦄ {s : R a a'} {r : T a a}
parameter {R}
theorem ap_ap_e_closure_elim_h₁ {B C D : Type} {f : A → B}
{g : B → C} (h : C → D)
(e :... |
ee9904f2e5ea0e375f7ce0cf56d242d925257e6c | d0f9af2b0ace5ce352570d61b09019c8ef4a3b96 | /final_exam/final_exam.lean | 7cc2d67325dcb7b7993d4ad3207639bb95968122 | [] | no_license | jngo13/Discrete-Mathematics | 8671540ef2da7c75915d32332dd20c02f001474e | bf674a866e61f60e6e6d128df85fa73819091787 | refs/heads/master | 1,675,615,657,924 | 1,609,142,011,000 | 1,609,142,011,000 | 267,190,341 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 12,534 | lean | /-
Justin Ngo
jmn4fms
5/4/20
Sullivan 2102-001
-/
/-
CS2102 Spring 2020 Final Exam. You are
to take this exam entirely on your own.
You may not discuss it with anyone but
the instructor and TAs. The exam has 6
qustions, some with several parts. Read
the entire exam first to get a sense of
the easy and hard parts. Do t... |
631e66483afe34e209e720baba68f1f73b3047f6 | abd85493667895c57a7507870867b28124b3998f | /src/category_theory/limits/shapes/zero.lean | e1587323a482e9e78c4f87b251287e451e956341 | [
"Apache-2.0"
] | permissive | pechersky/mathlib | d56eef16bddb0bfc8bc552b05b7270aff5944393 | f1df14c2214ee114c9738e733efd5de174deb95d | refs/heads/master | 1,666,714,392,571 | 1,591,747,567,000 | 1,591,747,567,000 | 270,557,274 | 0 | 0 | Apache-2.0 | 1,591,597,975,000 | 1,591,597,974,000 | null | UTF-8 | Lean | false | false | 8,987 | 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 category_theory.limits.shapes.binary_products
import category_theory.limits.shapes.images
import category_theory.epi_mono
import category_theory.punit
/-!
# Z... |
15cb3bdf21e45280c5e9c9fb5ef11cf9f7e1f356 | 3446e92e64a5de7ed1f2109cfb024f83cd904c34 | /src/game/world2/level15.lean | 52568dde51e3825a27759e95a00ed8ee4749c88b | [] | 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 | 532 | lean | import mynat.definition -- hide
import mynat.add -- hide
import game.world2.level14 -- hide
namespace mynat -- hide
/-
# World 2 -- Addition World
## Level 15 -- `eq_zero_of_add_right_eq_self`
We have
* `succ_eq_add_one : ∀ (n : mynat), succ n = n + 1`
but sometimes the other way is also convenient.
-/
/- Theo... |
847f9debfd0ba6bb589a304b6898a2a716375899 | 88892181780ff536a81e794003fe058062f06758 | /src/100_theorems/t051.lean | dfe16bdd50b0bb68286720eab50b9d701e29e123 | [] | no_license | AtnNn/lean-sandbox | fe2c44280444e8bb8146ab8ac391c82b480c0a2e | 8c68afbdc09213173aef1be195da7a9a86060a97 | refs/heads/master | 1,623,004,395,876 | 1,579,969,507,000 | 1,579,969,507,000 | 146,666,368 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 177 | lean | import data.zmod.quadratic_reciprocity
-- Wilson’s Theorem
open nat
theorem t051 {p : ℕ} : Π (hp : nat.prime p), (fact (p - 1) : zmodp p hp) = -1
:= zmodp.wilsons_lemma
|
65e3a2f5c6d48b95ef4de49f6ae71f3198e6a4e8 | 9bb72db9297f7837f673785604fb89b3184e13f8 | /library/data/buffer.lean | 388f2785e9098450ea27d2c004a7a27279f63c4a | [
"Apache-2.0"
] | permissive | dselsam/lean | ec83d7592199faa85687d884bbaaa570b62c1652 | 6b0bd5bc2e07e13880d332c89093fe3032bb2469 | refs/heads/master | 1,621,807,064,966 | 1,611,454,685,000 | 1,611,975,642,000 | 42,734,348 | 3 | 3 | null | 1,498,748,560,000 | 1,442,594,289,000 | C++ | UTF-8 | Lean | false | false | 4,838 | 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
-/
universes u w
def buffer (α : Type u) := Σ n, array n α
def mk_buffer {α : Type u} : buffer α :=
⟨0, {data := λ i, fin.elim0 i}⟩
def array.to_buffer {α :... |
a4a13d5e36c10a86c9eb121169f96183db916348 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/data/array/basic.lean | 7dd51d77be47f8bf8ab4d1d30f0bfb17285c7f26 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,407 | 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, Mario Carneiro
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.data.nat.default
import Mathlib.Lean3Lib.init.data.bool.default
import Mathlib.Lean3Lib.... |
64a3e68a71f582dc47fc0fdcba409ca189491dfc | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /examples/lean/even.lean | 15081fa686ae1ccabeb7da7a9a87b2c226fecd59 | [
"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,840 | lean | import macros
using Nat
-- In this example, we prove two simple theorems about even/odd numbers.
-- First, we define the predicates even and odd.
definition even (a : Nat) := ∃ b, a = 2*b
definition odd (a : Nat) := ∃ b, a = 2*b + 1
-- Prove that the sum of two even numbers is even.
--
-- Notes: we use the macro
-... |
5f6b04d79ba14af680c680d6e6bdf7b0cc3d8730 | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/category_theory/limits/constructions/limits_of_products_and_equalizers.lean | c4675b02be588404717345f403a128c987c6bbca | [
"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,815 | lean | /-
Copyright (c) 2020 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta, Scott Morrison
-/
import category_theory.limits.shapes.equalizers
import category_theory.limits.shapes.finite_products
import category_theory.limits.preserves.shapes.produc... |
426ff1badc9003fc383a1dd3a4416326b7274b76 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/algebra/continued_fractions/computation/terminates_iff_rat_auto.lean | 53f0fbdb31854ca263d162ba2d40f0d9853247bb | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,350 | lean | /-
Copyright (c) 2020 Kevin Kappelmann. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Kappelmann
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.algebra.continued_fractions.computation.approximations
import Mathlib.algebra.continued... |
397aef2a2abbc2eaf4ab7bec5c55322f46a37772 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/multiset/intervals_auto.lean | dbb044a5f592d5f026db756d588c3956a78a93c9 | [] | 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 | 4,215 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.multiset.nodup
import Mathlib.data.list.intervals
import Mathlib.PostPort
namespace M... |
50732a2f50a2fb946d8b57289d7c3dbffd054b59 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/group_theory/congruence.lean | ecf6cd1c003ec98c1225a9d4fab059321847516f | [
"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 | 51,257 | lean | /-
Copyright (c) 2019 Amelia Livingston. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Amelia Livingston
-/
import algebra.group.prod
import algebra.hom.equiv.basic
import data.setoid.basic
import group_theory.submonoid.operations
/-!
# Congruence relations
This fil... |
3120f918437170dc659b436b4d5068cc54e75367 | 4bcaca5dc83d49803f72b7b5920b75b6e7d9de2d | /stage0/src/Lean/Meta/Match/Basic.lean | f10d04373c17096652b7402007bf1c01d37141ce | [
"Apache-2.0"
] | permissive | subfish-zhou/leanprover-zh_CN.github.io | 30b9fba9bd790720bd95764e61ae796697d2f603 | 8b2985d4a3d458ceda9361ac454c28168d920d3f | refs/heads/master | 1,689,709,967,820 | 1,632,503,056,000 | 1,632,503,056,000 | 409,962,097 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 12,606 | 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.Meta.Check
import Lean.Meta.Match.MatcherInfo
import Lean.Meta.Match.CaseArraySizes
namespace Lean.Meta.Match
/--
Auxiliary annotation used ... |
2565bd664fcafe8acc9bce583adb0d4b01a5faff | 9dd3f3912f7321eb58ee9aa8f21778ad6221f87c | /tests/lean/by_contradiction.lean | e6f49eaad1ae86df6348a6f5b030b6c148f8115d | [
"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 | 609 | lean | open tactic nat
example (a b : nat) : a ≠ b → ¬ a = b :=
by do
intros,
by_contradiction `H,
trace_state,
contradiction
print "-------"
example (a b : nat) : ¬¬ a = b → a = b :=
by do
intros,
by_contradiction `H,
trace_state,
contradiction
print "-------"
example (p q : Prop) : ¬¬ p → p :=
by do
i... |
b1ddf34f3e4f58ebb429cf4d26a3397e24165f06 | 9c2e8d73b5c5932ceb1333265f17febc6a2f0a39 | /src/KT/rules.lean | ab3897b78e577ab04deff48af12c07e41195ea98 | [
"MIT"
] | permissive | minchaowu/ModalTab | 2150392108dfdcaffc620ff280a8b55fe13c187f | 9bb0bf17faf0554d907ef7bdd639648742889178 | refs/heads/master | 1,626,266,863,244 | 1,592,056,874,000 | 1,592,056,874,000 | 153,314,364 | 12 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 3,889 | lean | import .semantics
open nnf subtype list
-- TODO: we could redefine satisfiability.
inductive node (Γ : seqt) : Type
| closed : unsatisfiable (Γ.main ++ Γ.hdld) → node
| open_ : {s // sat builder s (Γ.main ++ Γ.hdld)} → node
open node
def contra_rule_seqt {Δ : seqt} {n} (h : var n ∈ Δ.main ∧ neg n ∈ Δ.main) : node Δ ... |
bd0e69db0df63772cfd718fcbd423ebba9c5a9fb | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/interactive/t3.lean | 2f3e3ecce829420e8803e5dee8df8ac9b53a76ef | [
"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 | 132 | lean | (* import("tactic.lua") *)
theorem T2 (a b : Bool) : b → a \/ b.
(* disj_tac() *).
back.
back.
exact.
done.
print environment 1. |
8695140cd9019c9cbfbad886b6b96d3182a6170f | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/vm_inline_aux.lean | ec585f38d4fbdf23df74880b58de2dba699ca4b4 | [
"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 | 242 | lean | namespace ex
set_option trace.compiler.optimize_bytecode true
@[inline] def {u} cond {a : Type u} : bool → a → a → a
| tt x y := x
| ff x y := y
-- cond should be inlined here
def foo (x : bool) :=
100 + cond x (10*10) (20*20)
end ex
|
42cee6910ed2df51ac0199358741e931da83af36 | 947b78d97130d56365ae2ec264df196ce769371a | /stage0/src/Init/Data/FloatArray/Basic.lean | 8840cd937d900f93875ea1dcd1f99bf597b86598 | [
"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 | 2,100 | 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
-/
prelude
import Init.Data.Array.Basic
import Init.Data.Float
import Init.Data.Option.Basic
universes u
structure FloatArray :=
(data : Array Float)
attribut... |
6586082484763465389b529e677baf4e0ce41940 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/measure_theory/integral/exp_decay.lean | 2090e724c7a2db2de50bfc5d2e41800e1f9d54ee | [
"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 | 2,866 | lean | /-
Copyright (c) 2022 David Loeffler. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Loeffler
-/
import measure_theory.integral.interval_integral
import measure_theory.integral.integral_eq_improper
/-!
# Integrals with exponential decay at ∞
As easy special cas... |
1aca298b95a7a7ef8ec85671d7096e8d3e8d8885 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/algebra/module/prod.lean | bbd6b05c243647da551260c8a24bbee59af2ac81 | [
"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 | 1,579 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon, Patrick Massot
-/
import algebra.module.basic
/-!
# Prod instances for module and multiplicative actions
This file defines instances for binary product of modules
-/
variab... |
6550906f28f0e3094de0f7615fc7a0a84cd96351 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/analysis/special_functions/trigonometric/arctan_deriv.lean | e59749afd64dadf833047097136e9b74e78ce23c | [
"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,816 | 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.arctan
import analysis.special_functions.trigonometric.... |
d31418a9f5c0441ef8a88e90fcc12fff7b8e6ce5 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/algebra/bilinear.lean | b51a110222f82290b59091f0a9cde39ac0524eae | [
"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,444 | 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.basic
import algebra.hom.iterate
import algebra.hom.non_unital_alg
import linear_algebra.tensor_product
/-!
# Facts about algebras invo... |
6b6992bc2fadd842ea16e15cdcc1e7fe233326a9 | 36c7a18fd72e5b57229bd8ba36493daf536a19ce | /hott/homotopy/susp.hlean | ba3d0dc22e7776c2ebe62d0057997875a341c4a1 | [
"Apache-2.0"
] | permissive | YHVHvx/lean | 732bf0fb7a298cd7fe0f15d82f8e248c11db49e9 | 038369533e0136dd395dc252084d3c1853accbf2 | refs/heads/master | 1,610,701,080,210 | 1,449,128,595,000 | 1,449,128,595,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,559 | hlean | /-
Copyright (c) 2015 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
Declaration of suspension
-/
import hit.pushout types.pointed cubical.square
open pushout unit eq equiv equiv.ops
definition susp (A : Type) : Type := pushout (λ... |
2345b11b0af39441e64308da181a99616ab564d9 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Init/Data/ByteArray.lean | b6ee6ccf4b4f63a5ccc293dbe46850a9106b6952 | [
"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 | 204 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
prelude
import Init.Data.ByteArray.Basic
|
98973d4528aa009aa7e82272fc43f544db84ae4d | efa51dd2edbbbbd6c34bd0ce436415eb405832e7 | /20161026_ICTAC_Tutorial/ex48.lean | c10f4aa1e3b15538608a8be8b316a771776f9135 | [
"Apache-2.0"
] | permissive | leanprover/presentations | dd031a05bcb12c8855676c77e52ed84246bd889a | 3ce2d132d299409f1de269fa8e95afa1333d644e | refs/heads/master | 1,688,703,388,796 | 1,686,838,383,000 | 1,687,465,742,000 | 29,750,158 | 12 | 9 | Apache-2.0 | 1,540,211,670,000 | 1,422,042,683,000 | Lean | UTF-8 | Lean | false | false | 350 | lean | variable g : ℕ → ℕ → ℕ
variable hg : g 0 0 = 0
theorem gex1 : ∃ x, g x x = x := ⟨0, hg⟩
theorem gex2 : ∃ x, g x 0 = x := ⟨0, hg⟩
theorem gex3 : ∃ x, g 0 0 = x := ⟨0, hg⟩
theorem gex4 : ∃ x, g x x = 0 := ⟨0, hg⟩
set_option pp.implicit true -- display implicit arguments
print gex1
print gex2
print gex3
print gex4
|
6b0c6b00d55de58b4eeb83541f488fa022611c63 | 07c6143268cfb72beccd1cc35735d424ebcb187b | /src/topology/metric_space/emetric_space.lean | 0ede137586a5967b9b693a76e29f12e2eb3241b1 | [
"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 | 40,317 | lean | /-
Copyright (c) 2015, 2017 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Robert Y. Lewis, Johannes Hölzl, Mario Carneiro, Sébastien Gouëzel
-/
import data.real.nnreal data.real.ennreal
import topology.uniform_space.separation topology.u... |
c8afc2b48f73f54ef2e2c65e52104f787729118e | 92b50235facfbc08dfe7f334827d47281471333b | /library/data/pnat.lean | b171b42a32747f623bb45be98d03ff2dbcc47567 | [
"Apache-2.0"
] | permissive | htzh/lean | 24f6ed7510ab637379ec31af406d12584d31792c | d70c79f4e30aafecdfc4a60b5d3512199200ab6e | refs/heads/master | 1,607,677,731,270 | 1,437,089,952,000 | 1,437,089,952,000 | 37,078,816 | 0 | 0 | null | 1,433,780,956,000 | 1,433,780,955,000 | null | UTF-8 | Lean | false | false | 10,166 | lean | /-
Copyright (c) 2015 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Robert Y. Lewis
Basic facts about the positive natural numbers.
Developed primarily for use in the construction of ℝ. For the most part, the only theorems here
are those needed for t... |
07b1567faf95dc872c7aafb7d8fe164a9120aeec | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch5/ex0214.lean | 6efffa429f7b808b742adfebf9d67e8ef1d2bd91 | [] | 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 | 104 | lean | example (x y : ℕ) (h : x = y) : y = x :=
begin
revert h,
intro h₁,
symmetry,
assumption
end
|
6f6cab1f4e2a047ffdef1d8c8162f9a7fbb68fd1 | b19a1b7dc79c802247fdce4c04708e070863b4d2 | /universal-quantifier.lean | 47d4d80f4543de73daa4d6fac4fd82341d4b8545 | [] | no_license | utanapishtim/promethazine | 99a1e80311fb20251a54ba78a534b23852b88c40 | 08a6f9bd6dd08feb3df8d4697e19ffc8d333b249 | refs/heads/master | 1,653,595,504,487 | 1,480,129,933,000 | 1,480,129,933,000 | 74,801,596 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,059 | lean | /-
if A is some type, then a unary predicate p on A can be represented as an object
of type A → Prop. In that case, given x : A, 'p x' dentoes the assertion that p
holds of x.
In a similar manner, an object r : A → A → Prop denotes a binary relation A.
Then, if x y : A, 'r x y' denotes the assertion that x ... |
880db33959d5aa5e89b7f1a7760a7b0f1e7b7f7e | ac92829298855d39b757cf1fddca8f058436f027 | /hott/homotopy/circle.hlean | 4166fabbd05f559bc80c9cb898fe290065a88eb5 | [
"Apache-2.0"
] | permissive | avigad/lean2 | 7af27190b9697b69a13268a133c1d3c8df85d2cf | 34dbd6c3ae612186b8f0f80d12fbf5ae7a059ec9 | refs/heads/master | 1,592,027,477,851 | 1,500,732,234,000 | 1,500,732,234,000 | 75,484,066 | 0 | 0 | null | 1,480,781,056,000 | 1,480,781,056,000 | null | UTF-8 | Lean | false | false | 13,760 | hlean | /-
Copyright (c) 2015 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
Declaration of the circle
-/
import .sphere
import types.int.hott
import algebra.homotopy_group .connectedness
open eq susp bool is_equiv equiv is_trunc is_conn p... |
8b84399186d2157aaf713856e418eb153f7ecc27 | acc85b4be2c618b11fc7cb3005521ae6858a8d07 | /data/set/function.lean | 5db407f06867d19eb4253564fa5bb2b3a6ea8c1d | [
"Apache-2.0"
] | permissive | linpingchuan/mathlib | d49990b236574df2a45d9919ba43c923f693d341 | 5ad8020f67eb13896a41cc7691d072c9331b1f76 | refs/heads/master | 1,626,019,377,808 | 1,508,048,784,000 | 1,508,048,784,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,216 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad, Andrew Zipperer, Haitao Zhang, Minchao Wu
Functions over sets.
-/
import data.set.basic
open function
namespace set
universes u v w x
variables {α : Type u} {β : Type v}... |
0289ba403155f3eed5411ebeb18c88eda395f95d | e030b0259b777fedcdf73dd966f3f1556d392178 | /library/data/stream.lean | d2fac509c72edb491e79d2ff093d1703e3464df5 | [
"Apache-2.0"
] | permissive | fgdorais/lean | 17b46a095b70b21fa0790ce74876658dc5faca06 | c3b7c54d7cca7aaa25328f0a5660b6b75fe26055 | refs/heads/master | 1,611,523,590,686 | 1,484,412,902,000 | 1,484,412,902,000 | 38,489,734 | 0 | 0 | null | 1,435,923,380,000 | 1,435,923,379,000 | null | UTF-8 | Lean | false | false | 21,352 | 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
-/
open nat function option
universe variables u v w
def stream (α : Type u) := nat → α
namespace stream
variables {α : Type u} {β : Type v} {δ : Type w}
def... |
6e32dd1b4970e501fd906da656383da0473b2da2 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/fieldIssue.lean | 5ae180ba7c0481310362c8e2d1c34f03fef33110 | [
"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 | 306 | lean |
structure SCore (α : Type) :=
(x : α) (y : Nat)
inductive M
| leaf : Nat → M
| node : SCore M → M
abbrev S := SCore M
/- We use `s : S` for convenience here -/
def SCore.doubleY (s : S) : Nat :=
2 * s.y
def f (s : S) : Nat :=
s.doubleY
def g : M → Nat
| M.leaf n => n
| M.node s => s.doubleY
|
9a1067d2f404b7fd6b84bd54bd38acd4a9ec30f2 | 3dc4623269159d02a444fe898d33e8c7e7e9461b | /.github/workflows/project_1_a_decrire/group_action/action_groupe_to_groupoid.lean | 744a7ca4ddabfb63054f72aed26d63a668ea5c26 | [] | no_license | Or7ando/lean | cc003e6c41048eae7c34aa6bada51c9e9add9e66 | d41169cf4e416a0d42092fb6bdc14131cee9dd15 | refs/heads/master | 1,650,600,589,722 | 1,587,262,906,000 | 1,587,262,906,000 | 255,387,160 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,108 | lean | import group_theory.group_action
import algebra.group
import category_theory.category.Groupoid
/--
## Let G be a group and X a G-set (i.e a set with an G action), we make the so called 'action groupoid'
## This is a category with obj : X and for x y ∈ X, hom(x,y) = Transporteur (x,y) := { g ∈ G | g • x = y}
## The... |
0ba24d6df55789c19ef8f1850fd8afd65fbfcd13 | 8e2026ac8a0660b5a490dfb895599fb445bb77a0 | /tests/lean/interactive/complete.lean | 9b818104959d37aaffb3c7960cf1216e8fe16860 | [
"Apache-2.0"
] | permissive | pcmoritz/lean | 6a8575115a724af933678d829b4f791a0cb55beb | 35eba0107e4cc8a52778259bb5392300267bfc29 | refs/heads/master | 1,607,896,326,092 | 1,490,752,175,000 | 1,490,752,175,000 | 86,612,290 | 0 | 0 | null | 1,490,809,641,000 | 1,490,809,641,000 | null | UTF-8 | Lean | false | false | 353 | lean | prelude
inductive foo
example := foo
--^ "command": "complete"
-- should not complete empty declaration completion
example := foo
--^ "command": "complete"
@[reducible]
--^ "command": "complete", "skip_completions": true
example := foo
set_option trace.simplify true
--^ "command": "com... |
7957a3daf0f8dc391f4f5832f128cd9e96cddbc1 | 74caf7451c921a8d5ab9c6e2b828c9d0a35aae95 | /library/init/meta/rewrite_tactic.lean | adc8f53ce76b23841fecca8e69dd9d0f9f0f9634 | [
"Apache-2.0"
] | permissive | sakas--/lean | f37b6fad4fd4206f2891b89f0f8135f57921fc3f | 570d9052820be1d6442a5cc58ece37397f8a9e4c | refs/heads/master | 1,586,127,145,194 | 1,480,960,018,000 | 1,480,960,635,000 | 40,137,176 | 0 | 0 | null | 1,438,621,351,000 | 1,438,621,351,000 | null | UTF-8 | Lean | false | false | 855 | 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.relation_tactics init.meta.occurrences
namespace tactic
/- (rewrite_core m use_instances occs symm H) -/
meta constant rewrite_cor... |
116f54c0fb7afa3560fed4cf39bda44fd6f58aeb | b328e8ebb2ba923140e5137c83f09fa59516b793 | /src/Init/Notation.lean | a0f95e5b61fc14a99937f22ab588a2d549affec0 | [
"Apache-2.0"
] | permissive | DrMaxis/lean4 | a781bcc095511687c56ab060e816fd948553e162 | 5a02c4facc0658aad627cfdcc3db203eac0cb544 | refs/heads/master | 1,677,051,517,055 | 1,611,876,226,000 | 1,611,876,226,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 11,454 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
Notation for operators defined at Prelude.lean
-/
prelude
import Init.Prelude
-- DSL for specifying parser precedences and priorities
namespace Lean.Parser.... |
cd1a80f7562c7d344f3716dea75f1b0fed894934 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/analysis/normed/group/completion.lean | 4c98a50f46158ffac49d04551375e6c3b504fb9e | [
"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 | 1,341 | lean | /-
Copyright (c) 2021 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import analysis.normed.group.basic
import topology.algebra.group_completion
import topology.metric_space.completion
/-!
# Completion of a normed group
In this file ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.