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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
5c70e1a3d98fa0378adb0c1c74e69e5eddda2b07 | 5d166a16ae129621cb54ca9dde86c275d7d2b483 | /library/init/meta/tactic.lean | ef4391b47f1954ab7d72713eff355817c71921af | [
"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 | 42,146 | 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.function init.data.option.basic init.util
import init.category.combinators init.category.monad init.category.alternative init.category.m... |
addf62c5c24a0b7ada6b0b2f4954e4b3fbc28a45 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/measure_theory/integral/mean_inequalities.lean | 345e24c4de101cea828d8b83ecb8c6e94536fc94 | [
"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 | 19,761 | 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
-/
import measure_theory.integral.lebesgue
import analysis.mean_inequalities
import measure_theory.function.special_functions
/-!
# Mean value inequalities for integrals
I... |
6ddd3290042c96948dd6ab3e4c87ad421a333ace | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/436_lean3.lean | 48036257ced99856e87c2e4cded06baeb54ec821 | [
"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 | 923 | lean | inductive bvar : Type
| mk (n : Nat)
def bvar_eq : bvar → bvar → Bool
| bvar.mk n1, bvar.mk n2 => n1=n2
inductive bExpr : Type
| BLit (b: Bool)
| BVar (v: bvar)
def benv := bvar → Bool
def bEval : bExpr → benv → Bool
| bExpr.BLit b, i => b
| bExpr.BVar v, i => i v
def init_benv : benv := λ v => false
... |
5cad2ba0a72e6321cca1a188a626b465f2aacecc | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/algebra/group/units_hom.lean | bbdfba5c16275161b254cf44178e052c2f08cb57 | [
"Apache-2.0"
] | permissive | gebner/mathlib | eab0150cc4f79ec45d2016a8c21750244a2e7ff0 | cc6a6edc397c55118df62831e23bfbd6e6c6b4ab | refs/heads/master | 1,625,574,853,976 | 1,586,712,827,000 | 1,586,712,827,000 | 99,101,412 | 1 | 0 | Apache-2.0 | 1,586,716,389,000 | 1,501,667,958,000 | Lean | UTF-8 | Lean | false | false | 2,568 | lean | /-
Copyright (c) 2018 Johan Commelin All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Chris Hughes, Kevin Buzzard
-/
import algebra.group.units algebra.group.hom
/-!
# Lift monoid homomorphisms to group homomorphisms of their units subgroups.
-/
universe... |
d1998ed7b341d3ed960f299125709b189861ab1f | 367134ba5a65885e863bdc4507601606690974c1 | /src/tactic/omega/prove_unsats.lean | 7f0530263b7cd338814dd6bf3619261f62c8d3a4 | [
"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 | 2,085 | lean | /-
Copyright (c) 2019 Seul Baek. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Seul Baek
-/
/-
A tactic which constructs exprs to discharge
goals of the form `clauses.unsat cs`.
-/
import tactic.omega.find_ees
import tactic.omega.find_scalars
import tactic.omega.lin_... |
3bd7345cc36595a7a1d6723e3c547156ad7250d9 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/interactive/partialNamespace.lean | bad8339131ca50792c80a0c32a6b64c81ef95f3d | [
"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 | 42 | lean | namespace
--^ textDocument/documentSymbol
|
ecf08c086dae4ffc76a262a7e16836a3833ea15f | 83c8119e3298c0bfc53fc195c41a6afb63d01513 | /library/init/algebra/ring.lean | e536a21144bb59011b0bc923ade950cba56e8108 | [
"Apache-2.0"
] | permissive | anfelor/lean | 584b91c4e87a6d95f7630c2a93fb082a87319ed0 | 31cfc2b6bf7d674f3d0f73848b842c9c9869c9f1 | refs/heads/master | 1,610,067,141,310 | 1,585,992,232,000 | 1,585,992,232,000 | 251,683,543 | 0 | 0 | Apache-2.0 | 1,585,676,570,000 | 1,585,676,569,000 | null | UTF-8 | Lean | false | false | 12,871 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura
-/
prelude
import init.algebra.group
/- Make sure instances defined in this file have lower priority than the ones
defined for concrete stru... |
49d46c8f2c5bb4e1519fe8f90b4e07d6f4400bbc | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/geometry/euclidean/angle/sphere.lean | 27ffa53c11acd8c6ea92c289324b14933d9d1d1c | [
"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 | 5,819 | lean | /-
Copyright (c) 2022 Joseph Myers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Joseph Myers
-/
import geometry.euclidean.angle.oriented.affine
import geometry.euclidean.basic
/-!
# Angles in circles and sphere.
This file proves results about angles in circles and... |
36b039e8a667865f9bc4f51efeecbc499bbeda95 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /stage0/src/Lean/Util/Paths.lean | fcf7c02a48ff79c49ddde548088b1ca3112c94aa | [
"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 | 394 | lean | /-
Copyright (c) 2021 Sebastian Ullrich. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
-/
import Lean.Data.Json
import Lean.Util.Path
/-! Communicating Lean search paths between processes -/
namespace Lean
structure LeanPaths where
oleanPath : ... |
ed1101881c2ec9a12030aa9704ff6ba63b31d478 | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/probability_theory/independence.lean | 74576e8bd7a686d28506313caa3852f6260ca917 | [
"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 | 17,226 | lean | /-
Copyright (c) 2021 Rémy Degenne. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Rémy Degenne
-/
import measure_theory.measure.measure_space
import measure_theory.pi_system
import algebra.big_operators.intervals
import data.finset.intervals
/-!
# Independence of set... |
b94c6f278d110ae35c95b13b41c0bad15e81d5d4 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/playground/simpleTypes.lean | 237e69588619afc73a22e8be79a615e7ed595620 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 2,915 | lean | import Lean
notation "◾" => lcErased
notation "⊤" => lcAny
open Lean Compiler Meta
def test (declName : Name) : MetaM Unit := do
IO.println s!"{declName} : {← ppExpr (← getDeclLCNFType declName)}"
inductive Vec (α : Type u) : Nat → Type u
| nil : Vec α 0
| cons : α → Vec α n → Vec α (n+1)
def Vec.zip : Vec α... |
1217ffd5e902590c1ca62990ef567554ea4debaf | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/category_theory/limits/shapes/terminal.lean | c62e6e9261b7e3bc6c25127afb284533da93d70a | [
"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 | 15,645 | lean | /-
Copyright (c) 2019 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.pempty
import category_theory.limits.has_limits
import category_theory.epi_mono
/-!
# Initial and terminal objects in a category... |
0a614d04ba3013f866fd67f77be91c9d0eb7124f | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/analysis/calculus/inverse.lean | 3ef859903176b99502bd17af3d0f1dc5f04fec85 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 37,378 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov, Heather Macbeth, Sébastien Gouëzel
-/
import analysis.calculus.cont_diff
import tactic.ring_exp
import analysis.normed_space.banach
import topology.local_homeomorph
... |
f9b7b77a71e55a846744b86bb9b2d52c5f8f0536 | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /library/data/squash.lean | 2ef9b48cb59e27cefb70b005264529e2454a5f07 | [
"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 | 1,840 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: data.squash
Author: Leonardo de Moura
Define squash type (aka propositional truncation) using quotients.
This definition is slightly better than defining the squash type ∥A∥ as... |
2cd0578a6255aa1d77a0e1ba4e9d1445594cf76c | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/tactic/group.lean | 99a8ebb16824b7a2b6545c3bec2c120b784e1595 | [
"Apache-2.0"
] | permissive | jcommelin/mathlib | d8456447c36c176e14d96d9e76f39841f69d2d9b | ee8279351a2e434c2852345c51b728d22af5a156 | refs/heads/master | 1,664,782,136,488 | 1,663,638,983,000 | 1,663,638,983,000 | 132,563,656 | 0 | 0 | Apache-2.0 | 1,663,599,929,000 | 1,525,760,539,000 | Lean | UTF-8 | Lean | false | false | 3,802 | lean | /-
Copyright (c) 2020. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot
-/
import tactic.ring
import tactic.doc_commands
/-!
# `group`
Normalizes expressions in the language of groups. The basic idea is to use the simplifier
to put everything into a prod... |
8252da29ad4220adeacf59aeefd6a55a09ae9ea2 | 9b9a16fa2cb737daee6b2785474678b6fa91d6d4 | /src/number_theory/pell.lean | 1e7c298fd41a3a037a79112b6f9192c0cf03f433 | [
"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 | 62,282 | 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.int.basic data.nat.prime data.nat.modeq
/-- The ring of integers adjoined with a square root of `d`.
These have the form `a + b √d` where `a b : ℤ`. Th... |
507756e0ba165a13e2cbe760bb0b2a03520df28f | 32317185abf7e7c963f4c67c190aec61af6b3628 | /tests/lean/extra/show_goal.lean | 5dba4c039bb0add03423c1b6f3cb19cb2c71f942 | [
"Apache-2.0"
] | permissive | Andrew-Zipperer-unorganized/lean | 198a2317f21198cd8d26e7085e484b86277f17f7 | dcb35008e1474a0abebe632b1dced120e5f8c009 | refs/heads/master | 1,622,526,520,945 | 1,453,576,559,000 | 1,454,612,842,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 569 | lean | import data.nat
open nat algebra
example (a b c d : nat) : a + b = 0 → b = 0 → c + 1 + a = 1 → d = c - 1 → d = 0 :=
begin
intro h₁ h₂,
have aeq0 : a = 0, begin
rewrite h₂ at h₁,
exact h₁
end,
intro h₃ h₄,
have deq0 : d = 0, begin
have ceq : c = 0, begin
rewrite aeq0 at h₃,
rewrite add... |
5277ed2bbab37072f117b2fa5527675adc9fba82 | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /stage0/src/Lean/Compiler/LCNF/Simp/ConstantFold.lean | a0a2d4f8e26f90d461938af08ce9af9316ff9898 | [
"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 | 15,152 | lean | /-
Copyright (c) 2022 Henrik Böving. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Henrik Böving
-/
import Lean.Compiler.LCNF.CompilerM
import Lean.Compiler.LCNF.InferType
import Lean.Compiler.LCNF.PassManager
namespace Lean.Compiler.LCNF.Simp
namespace ConstantFold... |
3bf58569de4220f4894dd7ea829a37c84f1feb86 | 680fb1fcc7ff570fed489d49ab9e92006811c904 | /src/category/classes.lean | 7128cbe4fff2e5802ee8b5a021702974ebe4abfc | [] | no_license | unitb/lean-lens | 0432d9561d8459124e46f7fc590f12249eca570f | 42a50e1538ebed352a440b4c40ce81caab59a97f | refs/heads/master | 1,584,264,632,380 | 1,525,401,777,000 | 1,525,401,777,000 | 132,076,578 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,664 | lean |
import util.data.sum
universes u v
def arrow (α : Sort u) (β : Sort v) := α → β
class profunctor (p : Type u → Type u → Type u) :=
(dimap : Π {α α' β β'}, (α' → α) → (β → β') → p α β → p α' β')
(dimap_id : ∀ {α β} (x : p α β), dimap id id x = x)
(dimap_map : ∀ {α α' α'' β β' β''}
(f : α → α')... |
b4861e28fd100893f570f2248251943af06a83c0 | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/group_theory/p_group.lean | a823afe24c0fd290ddb1e124b4df9cbdbc63bb48 | [
"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 | 3,751 | lean | /-
Copyright (c) 2018 . All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import group_theory.group_action.basic
import data.fintype.card
import data.zmod.basic
/-!
# p-groups
This file contains a proof that if `G` is a `p`-group acting on a finite set `α... |
7b767be18f249a7ba85c31e8ab5626aeda086529 | 618003631150032a5676f229d13a079ac875ff77 | /test/logic_inline.lean | 132e74f862289e304c9a970b49673f0306127ca3 | [
"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 | 418 | lean | /-
Copyright (c) 2019 Keeley Hoek. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Keeley Hoek, Floris van Doorn
-/
import logic.basic
meta def error_msg (s : string) : bool := @undefined_core bool $ s ++ ".decidable not inlined"
meta def examine (b : Prop) [decidable... |
57985462695d09590b40c503bbe501ad4e3b191a | d450724ba99f5b50b57d244eb41fef9f6789db81 | /src/mywork/lectures/lecture_26.lean | 215130b0b501af43cf17aa06ef1165ee71eeb297 | [] | no_license | jakekauff/CS2120F21 | 4f009adeb4ce4a148442b562196d66cc6c04530c | e69529ec6f5d47a554291c4241a3d8ec4fe8f5ad | refs/heads/main | 1,693,841,880,030 | 1,637,604,848,000 | 1,637,604,848,000 | 399,946,698 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,350 | lean | import data.set
/-
Operations on relations
-/
/-
We now change our attention to binary relations
more generally: not just from β → β but between
different types, α and β. Not the change in the
type of r as defined here.
-/
variables {α β γ : Type} (r : α → β → Prop)
local infix `≺`:50 := r
/-
We will call the set of... |
64a4e6e987385f536a2e8256229027bc0dd04d23 | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /examples/lean/group.lean | dbd18ec95b313660877c408e94c02face0910dec | [
"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 | 6,389 | lean | import macros
definition associative {A : (Type U)} (f : A → A → A) := ∀ x y z, f (f x y) z = f x (f y z)
definition is_identity {A : (Type U)} (f : A → A → A) (id : A) := ∀ x, f x id = x
definition inverse_ex {A : (Type U)} (f : A → A → A) (id : A) := ∀ x, ∃ y, f x y = id
universe s ≥ 1
definition group :... |
85b8e855f827ed3319c017216421792760766afa | 2eab05920d6eeb06665e1a6df77b3157354316ad | /src/data/nat/totient.lean | add12c6e49f98d6d7586559f75ffbc253b82556d | [
"Apache-2.0"
] | permissive | ayush1801/mathlib | 78949b9f789f488148142221606bf15c02b960d2 | ce164e28f262acbb3de6281b3b03660a9f744e3c | refs/heads/master | 1,692,886,907,941 | 1,635,270,866,000 | 1,635,270,866,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,354 | 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.big_operators.basic
import data.nat.prime
import data.zmod.basic
/-!
# Euler's totient function
This file defines [Euler's totient function](https://en.w... |
07af7fb89872402f2c872df44b6f41f4d5dd3eaf | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Init/Data/ToString/Basic.lean | 97cb28c8f384f3fa935dbdaa4b85682c98db95f5 | [
"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 | 4,266 | 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.String.Basic
import Init.Data.UInt.Basic
import Init.Data.Nat.Div
import Init.Data.Repr
import Init.Data.Int.Basic
import Init.Data.... |
45cd320bd2c6436920640316f4ab37500847325b | ee8cdbabf07f77e7be63a449b8483ce308d37218 | /lean/src/valid/mathd-algebra-15.lean | a3f550343158b8eb90293d692f3a2ba43a772451 | [
"MIT",
"Apache-2.0"
] | permissive | zeta1999/miniF2F | 6d66c75d1c18152e224d07d5eed57624f731d4b7 | c1ba9629559c5273c92ec226894baa0c1ce27861 | refs/heads/main | 1,681,897,460,642 | 1,620,646,361,000 | 1,620,646,361,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 363 | lean | /-
Copyright (c) 2021 OpenAI. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kunhao Zheng
-/
import data.real.basic
example (s : ℕ+ → ℕ+ → ℕ+) (h₀ : ∀ a b, s a b = a ^ (b:ℕ) + b ^ (a:ℕ)) : s 2 6 = 100 :=
begin
rw h₀,
simp,
calc (2:ℕ+) ^ 6 + (6:ℕ+) ^ 2 = 100 : by... |
afe72c5617411b8019640e3c2766dc2c6d37c2c9 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/tactic/linarith/parsing.lean | f43291cd087eaea2e29a672843c14f3fd1c38c9e | [
"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,567 | lean | /-
Copyright (c) 2020 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
-/
import tactic.linarith.datatypes
/-!
# Parsing input expressions into linear form
`linarith` computes the linear form of its input expressions,
assuming (without... |
a24eabf7e765723af5e00ea3fb4481900a1f8bf3 | 29cc89d6158dd3b90acbdbcab4d2c7eb9a7dbf0f | /3.2/32_exercise_sheet.lean | 3548aa1118ca7798ed847db88dc7fe38cb36ec05 | [] | no_license | KjellZijlemaker/Logical_Verification_VU | ced0ba95316a30e3c94ba8eebd58ea004fa6f53b | 4578b93bf1615466996157bb333c84122b201d99 | refs/heads/master | 1,585,966,086,108 | 1,549,187,704,000 | 1,549,187,704,000 | 155,690,284 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,444 | lean | /- Exercise 3.2: Program Semantics — Hoare Logic -/
/- Download `x32_library.lean` from the "Logical Verification" homepage and put it in the same
directory as this exercise sheet. -/
import .x32_library
namespace lecture
/- Background material from the lecture. Do not prove the `sorry`s below. -/
def program.whi... |
0c8ea30b0a1c64a433024b7561bff9f0156d77b6 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/deprecated/group_auto.lean | cb4f71fa393255929bc3e89db1a98356fc71c7a9 | [] | 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,523 | lean | /-
Copyright (c) 2019 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Yury Kudryashov
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.algebra.group.type_tags
import Mathlib.algebra.group.units_hom
import Mathlib.algebra.ring... |
538ae12629937dede18a981056956e4cc3fd373a | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/analysis/special_functions/improper_integrals.lean | 89aa5354e61abbae342f1460f4f081899cfaf235 | [
"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,292 | lean | /-
Copyright (c) 2023 David Loeffler. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Loeffler
-/
import analysis.special_functions.integrals
import measure_theory.group.integration
import measure_theory.integral.exp_decay
import measure_theory.integral.integral_e... |
97ee7d9962323f353bab424838cfc2126c77ff3f | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/ring_theory/jacobson_ideal.lean | bf0721eee3caf6d611ee4f3d7111d7af61ee3f4c | [
"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 | 5,807 | lean | /-
Copyright (c) 2020 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Devon Tuma
-/
import ring_theory.ideal_operations
/-!
# Jacobson radical
The Jacobson radical of a ring `R` is defined to be the intersection of all maximal ideals of `R`.
Thi... |
fad83931f2148fcc6bccb03670a7bfc7664a6295 | 491068d2ad28831e7dade8d6dff871c3e49d9431 | /library/theories/number_theory/primes.lean | 30d005dbc9776a3176215b452629ef40b3250c22 | [
"Apache-2.0"
] | permissive | davidmueller13/lean | 65a3ed141b4088cd0a268e4de80eb6778b21a0e9 | c626e2e3c6f3771e07c32e82ee5b9e030de5b050 | refs/heads/master | 1,611,278,313,401 | 1,444,021,177,000 | 1,444,021,177,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,174 | 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
Prime numbers.
-/
import data.nat logic.identities
open bool
namespace nat
open decidable
definition prime [reducible] (p : nat) := p ≥ 2 ∧ ∀... |
1b81abaf0f450108b554c405ad2317c9a054407d | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/category_theory/adjunction/fully_faithful.lean | dd3b06ba3e2ab9748db1f522074f947961b098cf | [
"Apache-2.0"
] | permissive | gebner/mathlib | eab0150cc4f79ec45d2016a8c21750244a2e7ff0 | cc6a6edc397c55118df62831e23bfbd6e6c6b4ab | refs/heads/master | 1,625,574,853,976 | 1,586,712,827,000 | 1,586,712,827,000 | 99,101,412 | 1 | 0 | Apache-2.0 | 1,586,716,389,000 | 1,501,667,958,000 | Lean | UTF-8 | Lean | false | false | 2,258 | 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.adjunction.basic
import category_theory.yoneda
open category_theory
namespace category_theory
universes v₁ v₂ u₁ u₂
open category
open oppos... |
7f75e03cb0b32ddfae0bf10d5cbfe4eebbebeda4 | 5d166a16ae129621cb54ca9dde86c275d7d2b483 | /tests/lean/run/simp_univ_metavars.lean | c6b738808ccae358712c37c9ed6bcfa62116e242 | [
"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 | 2,614 | lean | meta def blast : tactic unit := using_smt $ return ()
structure { u v } Category :=
(Obj : Type u )
(Hom : Obj -> Obj -> Type v)
(identity : Π X : Obj, Hom X X)
(compose : Π ⦃X Y Z : Obj⦄, Hom X Y → Hom Y Z → Hom X Z)
(left_identity : ∀ ⦃X Y : Obj⦄ (f : Hom X Y), compose (identity _) f = f)
structure Func... |
4191c8b09f0a2aa053084eda8ee8bfdf98586543 | bb31430994044506fa42fd667e2d556327e18dfe | /src/topology/algebra/module/strong_topology.lean | 9d2aeab58b238fc0876ddb5551cdbac415443e19 | [
"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 | 12,441 | lean | /-
Copyright (c) 2022 Anatole Dedecker. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anatole Dedecker
-/
import topology.algebra.uniform_convergence
import topology.algebra.module.locally_convex
/-!
# Strong topologies on the space of continuous linear maps
In this... |
87c1c8d2ffa3e44ea0c8a4d71fb3ade71122adf9 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/analysis/normed_space/units.lean | 5120eae715bb4177e52def479ac20cba4f3931ee | [
"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 | 13,705 | 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 topology.algebra.ring.ideal
import analysis.specific_limits.normed
/-!
# The group of units of a complete normed ring
This file contains the basic theory f... |
781452dff158b971a4fc036f1e7a2d54439bb6bd | b7f22e51856f4989b970961f794f1c435f9b8f78 | /hott/cubical/square.hlean | 96b095b6d919e3dfd0f5b54c7c35e48f01b15159 | [
"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 | 30,826 | 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, Jakob von Raumer
Squares in a type
-/
import types.eq
open eq equiv is_equiv sigma
namespace eq
variables {A B : Type} {a a' a'' a₀₀ a₂₀ a₄₀ a₀₂ a₂₂ a₂₄ a₀₄ a₄... |
31ff41bb30e2e98e541c0f032c64166dac3ce57a | 07c76fbd96ea1786cc6392fa834be62643cea420 | /hott/homotopy/susp.hlean | 7d8eba65e92da919d43fe06f58609eb0a3a8da7f | [
"Apache-2.0"
] | permissive | fpvandoorn/lean2 | 5a430a153b570bf70dc8526d06f18fc000a60ad9 | 0889cf65b7b3cebfb8831b8731d89c2453dd1e9f | refs/heads/master | 1,592,036,508,364 | 1,545,093,958,000 | 1,545,093,958,000 | 75,436,854 | 0 | 0 | null | 1,480,718,780,000 | 1,480,718,780,000 | null | UTF-8 | Lean | false | false | 17,816 | 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, Ulrik Buchholtz
Declaration of suspension
-/
import hit.pushout types.pointed2 cubical.square .connectedness
open pushout unit eq equiv pointed is_equiv
definit... |
e0e4737cc2b7b12b868dc552bd30c48f7b49d598 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/forest.lean | c21dbddd77255d60833aed905ab223b1076b92ed | [
"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 | 4,499 | lean | import data.prod
open prod
inductive tree (A : Type) : Type :=
| node : A → forest A → tree A
with forest : Type :=
| nil : forest A
| cons : tree A → forest A → forest A
namespace manual
definition tree.below.{l₁ l₂}
(A : Type.{l₁})
(C₁ : tree A → Type.{l₂})
(C₂ : forest A → Type.{l₂})
(t : tree... |
5806943b5ff9369bc304c07fa2983f640f0b262a | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/topology/dense_embedding.lean | 6464cdc2f68e7cf8ad00de1ce4dd02601290d55f | [
"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 | 12,459 | lean | /-
Copyright (c) 2019 Reid Barton. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro, Patrick Massot
-/
import topology.separation
import topology.bases
/-!
# Dense embeddings
This file defines three properties of functions:
* `dense_rang... |
c0c71d729d1aad2c35976fbb9d84714abd69fa31 | 53618200bef52920c1e974173f78cd378d268f3e | /hott/homotopy/cofiber.hlean | 5c789151819964a128f306973666a8ee283fb4f8 | [
"Apache-2.0"
] | permissive | sayantangkhan/lean2 | cc41e61102e0fcc8b65e8501186dcca40b19b22e | 0fc0378969678eec25ea425a426bb48a184a6db0 | refs/heads/master | 1,590,323,112,724 | 1,489,425,932,000 | 1,489,425,932,000 | 84,854,525 | 0 | 0 | null | 1,489,425,509,000 | 1,489,425,509,000 | null | UTF-8 | Lean | false | false | 3,521 | hlean | /-
Copyright (c) 2016 Jakob von Raumer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jakob von Raumer
The Cofiber Type
-/
import hit.pushout function .susp types.unit
open eq pushout unit pointed is_trunc is_equiv susp unit equiv
definition cofiber {A B : Type} (f... |
bd93bf0af3791232da79173a8b27a1a3cd449439 | 77cc0c0aa84a25574cde49a43e1ea911e4992d9b | /Lean Proof RSA.lean | 91a5d70d550d301d2b2e59c80c46685fe1166e01 | [] | no_license | GGFSilva/LeanCryptographyProof | 41ed2cb4d67949f2e2dc6eba63d82c786aa179d3 | bea98d6201546f1e38a08fd3eb7be494e589b006 | refs/heads/master | 1,621,411,996,962 | 1,585,665,794,000 | 1,585,665,794,000 | 251,599,965 | 2 | 2 | null | null | null | null | UTF-8 | Lean | false | false | 6,506 | lean | open nat
variables one x n p q d e : nat
variable gcd (a b : nat) : nat
variable phi (n : nat) : nat
variable prime (a : nat) : Prop
variable congruent (a b modulus : nat) : Prop
premise nDef : n = p * q
premise pPhi : phi p = p - one
premise qPhi : phi q = q - one
premise nP... |
2372ffbc04400a4d5a6b8b5029b3ab42867f31d9 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/sites/types_auto.lean | 0a6318cd4b5907d3563cc4a4298b8d5eb9219e85 | [] | 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 | 6,084 | lean | /-
Copyright (c) 2020 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.category_theory.sites.canonical
import Mathlib.category_theory.sites.sheaf_of_types
import Mathlib.Po... |
f2768624e40ccdb679da36fff9d6206319540328 | 3dd1b66af77106badae6edb1c4dea91a146ead30 | /tests/lean/run/nat_bug5.lean | 4927a318f10a4c6374faa71f7c3c69c0cf075838 | [
"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,393 | lean | import logic num
using num eq_proofs
inductive nat : Type :=
| zero : nat
| succ : nat → nat
definition add (x y : nat) : nat := nat_rec x (λn r, succ r) y
infixl `+`:65 := add
definition mul (n m : nat) := nat_rec zero (fun m x, x + n) m
infixl `*`:75 := mul
axiom add_one (n:nat) : n + (succ zero) = succ n
axiom mu... |
d9ec8701d7ae63dfbcb34b5b3e7a7417add8d876 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/ring_theory/matrix_algebra.lean | 13d9febcf028405b213624d141b06b326e1100b7 | [
"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 | 6,085 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import data.matrix.basis
import ring_theory.tensor_product
/-!
We show `matrix n n A ≃ₐ[R] (A ⊗[R] matrix n n R)`.
-/
universes u v w
open_locale tensor_product
op... |
0fc004ea5208b2f446e6c5643ce68819719c7244 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/ctxopt.lean | fee9de0b61100b7c62bbf3458e8afeaef9d9b4ae | [
"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 | 80 | lean | --
section
set_option pp.implicit true
#check id true
end
#check id true
|
a59459244e6176201c694ef2a448dfe7c3f5c9c2 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/data/fin_enum.lean | ef23e23a864668bea92d1fae118c4a44e1b16ca6 | [
"Apache-2.0"
] | permissive | gebner/mathlib | eab0150cc4f79ec45d2016a8c21750244a2e7ff0 | cc6a6edc397c55118df62831e23bfbd6e6c6b4ab | refs/heads/master | 1,625,574,853,976 | 1,586,712,827,000 | 1,586,712,827,000 | 99,101,412 | 1 | 0 | Apache-2.0 | 1,586,716,389,000 | 1,501,667,958,000 | Lean | UTF-8 | Lean | false | false | 9,016 | lean | /-
Copyright (c) 2019 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Simon Hudon
-/
import category.monad.basic
import data.list.basic
import data.equiv.basic
import data.finset
import data.fintype.basic
/-!
Type class for finitely enumerable types. The... |
88e54cd740de96939bc722a4c5275fa5345d4c32 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/back1.lean | 73722b941c2faa09ec14de477fc51a4dab7644ad | [
"Apache-2.0"
] | permissive | leanprover-community/lean | 12b87f69d92e614daea8bcc9d4de9a9ace089d0e | cce7990ea86a78bdb383e38ed7f9b5ba93c60ce0 | refs/heads/master | 1,687,508,156,644 | 1,684,951,104,000 | 1,684,951,104,000 | 169,960,991 | 457 | 107 | Apache-2.0 | 1,686,744,372,000 | 1,549,790,268,000 | C++ | UTF-8 | Lean | false | false | 4,740 | lean | /- In this example, we show how to write a simple tactic for performing
backward chaining.
The tactic builds list membership proofs for goals such as
a ∈ [b, c] ++ [b, a, b]
-/
open list expr tactic
universe variable u
/- The tactic uses the following 4 theorems from the standard library.
Here, we ju... |
08bef1a3522f2661198ae84bd759119ece1723f8 | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/order/conditionally_complete_lattice.lean | a5b6b54e5dbe30e2d25ae5955d2a961b8389c601 | [
"Apache-2.0"
] | permissive | abentkamp/mathlib | d9a75d291ec09f4637b0f30cc3880ffb07549ee5 | 5360e476391508e092b5a1e5210bd0ed22dc0755 | refs/heads/master | 1,682,382,954,948 | 1,622,106,077,000 | 1,622,106,077,000 | 149,285,665 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 43,947 | lean | /-
Copyright (c) 2018 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import data.nat.enat
import data.set.intervals.ord_connected
/-!
# Theory of conditionally complete lattices.
A conditionally complete lattice is a lattice in... |
c0358198479eb99f980bccda1e512670431e938e | 4727251e0cd73359b15b664c3170e5d754078599 | /src/measure_theory/measure/content.lean | 6f90df01249751ea07d886110f7e7220ca623899 | [
"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 | 17,064 | lean | /-
Copyright (c) 2020 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
-/
import measure_theory.measure.measure_space
import measure_theory.measure.regular
import topology.sets.compacts
/-!
# Contents
In this file we work with *conten... |
4ee0cfdf3fdafb535356bd32dfb4680dbd137049 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/enum.lean | 77b9899e015b42c32777b588a3602833b6f3204c | [
"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 | 406 | lean | import logic
inductive Three :=
| zero : Three
| one : Three
| two : Three
namespace Three
theorem disj (a : Three) : a = zero ∨ a = one ∨ a = two :=
Three.rec (or.inl rfl) (or.inr (or.inl rfl)) (or.inr (or.inr rfl)) a
example (a : Three) : a ≠ zero → a ≠ one → a = two :=
Three.rec (λ h₁ h₂, absurd rfl h₁... |
870a504f535c04ac9fc0600db42e87fa7120ac4e | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/analysis/ODE/gronwall.lean | 045f5bcd8098b4c95ac83ea16077af15111b934f | [
"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 | 13,195 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import analysis.special_functions.exp_deriv
/-!
# Grönwall's inequality
The main technical result of this file is the Grönwall-like inequality
`norm_le_gronwall_b... |
4294c9f4a001ee04553bd00448eb71fd1206bd71 | 9028d228ac200bbefe3a711342514dd4e4458bff | /src/analysis/specific_limits.lean | 2972df8ea0180fd11b9f2de90ec30d64c4c6a08f | [
"Apache-2.0"
] | permissive | mcncm/mathlib | 8d25099344d9d2bee62822cb9ed43aa3e09fa05e | fde3d78cadeec5ef827b16ae55664ef115e66f57 | refs/heads/master | 1,672,743,316,277 | 1,602,618,514,000 | 1,602,618,514,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 27,149 | 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 analysis.normed_space.basic
import algebra.geom_sum
import order.filter.archimedean
import topology.instances.ennreal
import tactic.ring_exp
/-!
# A collectio... |
4878fbb2c02112e79298237f23810bec142105ef | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /hott/init/axioms/funext_varieties.hlean | c1a8e1faa6ac71e60f93dc7654f84397519bd77c | [
"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,350 | hlean | /-
Copyright (c) 2014 Jakob von Raumer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: init.axioms.funext_varieties
Authors: Jakob von Raumer
Ported from Coq HoTT
-/
prelude
import ..path ..trunc ..equiv
open eq is_trunc sigma function
/- In init.axioms.funext, we ... |
86e0b3a42b8d3991a1685e1f491735efc4a44b85 | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/data/padics/padic_numbers.lean | b13725cb3a0cdef44424aaef8f78db6c29d86e4a | [
"Apache-2.0"
] | permissive | abentkamp/mathlib | d9a75d291ec09f4637b0f30cc3880ffb07549ee5 | 5360e476391508e092b5a1e5210bd0ed22dc0755 | refs/heads/master | 1,682,382,954,948 | 1,622,106,077,000 | 1,622,106,077,000 | 149,285,665 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 38,165 | lean | /-
Copyright (c) 2018 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
-/
import data.padics.padic_norm
import analysis.normed_space.basic
/-!
# p-adic numbers
This file defines the p-adic numbers (rationals) `ℚ_p` as
the completion of... |
f9ce5b048542e150d195f12f757b82e75b302d5b | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/ring_theory/ideal/operations.lean | b5fe2f015cec76047f996a0d9622cfd11643b5c2 | [
"Apache-2.0"
] | permissive | abentkamp/mathlib | d9a75d291ec09f4637b0f30cc3880ffb07549ee5 | 5360e476391508e092b5a1e5210bd0ed22dc0755 | refs/heads/master | 1,682,382,954,948 | 1,622,106,077,000 | 1,622,106,077,000 | 149,285,665 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 66,969 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import algebra.algebra.operations
import algebra.algebra.tower
import data.equiv.ring
import data.nat.choose.sum
import ring_theory.ideal.basic
import ring_theory.non_zero_divi... |
1cc5c817a8c9217cb4539405bc38dac77573a336 | 7850aae797be6c31052ce4633d86f5991178d3df | /src/Lean/Server/Requests.lean | ceb13dbdbdc381f3b96c56775f7fa8146cb08bd2 | [
"Apache-2.0"
] | permissive | miriamgoetze/lean4 | 4dc24d4dbd360cc969713647c2958c6691947d16 | 062cc5d5672250be456a168e9c7b9299a9c69bdb | refs/heads/master | 1,685,865,971,011 | 1,624,107,703,000 | 1,624,107,703,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,449 | lean | /-
Copyright (c) 2021 Wojciech Nawrocki. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Wojciech Nawrocki, Marc Huisinga
-/
import Lean.DeclarationRange
import Lean.Data.Json
import Lean.Data.Lsp
import Lean.Server.FileSource
import Lean.Server.FileWorker.Utils
/-!... |
6a6378f885300e8e61ea2babb1fcc96565833703 | 618003631150032a5676f229d13a079ac875ff77 | /src/algebra/lie_algebra.lean | 05f139c6c44102e5709c83b5c7d10d0d3c376347 | [
"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 | 30,028 | lean | /-
Copyright (c) 2019 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import ring_theory.algebra
import linear_algebra.linear_action
import linear_algebra.bilinear_form
import tactic.noncomm_ring
/-!
# Lie algebras
This file defines Lie rin... |
d0f3882a5b40dc98180d6e6a4e964adda47e6a78 | 4fa161becb8ce7378a709f5992a594764699e268 | /src/topology/separation.lean | 6479746274c4373da085a12af55cc22978231622 | [
"Apache-2.0"
] | permissive | laughinggas/mathlib | e4aa4565ae34e46e834434284cb26bd9d67bc373 | 86dcd5cda7a5017c8b3c8876c89a510a19d49aad | refs/heads/master | 1,669,496,232,688 | 1,592,831,995,000 | 1,592,831,995,000 | 274,155,979 | 0 | 0 | Apache-2.0 | 1,592,835,190,000 | 1,592,835,189,000 | null | UTF-8 | Lean | false | false | 16,398 | 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
Separation properties of topological spaces.
-/
import topology.subset_properties
open set filter
open_locale topological_space
local attribute [instan... |
6b46a2a0a6d42b1facf916b759565a3ff91fbdae | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /library/algebra/ordered_group.lean | 1997c68553bc59c1d267345dccfc8b14947d313e | [
"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 | 39,709 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
Partially ordered additive groups, modeled on Isabelle's library. These classes can be refined
if necessary.
-/
import algebra.group algebra.order algebra.monotone
open e... |
76d8cc39306dd5b4b06930c05aecddab77bdb42a | 6772a11d96d69b3f90d6eeaf7f9accddf2a7691d | /examples/universal_algebra.lean | c8bf6a8b3607f9daaa53aaf37f90927acda8c710 | [] | no_license | lbordowitz/lean-category-theory | 5397361f0f81037d65762da48de2c16ec85a5e4b | 8c59893e44af3804eba4dbc5f7fa5928ed2e0ae6 | refs/heads/master | 1,611,310,752,156 | 1,487,070,172,000 | 1,487,070,172,000 | 82,003,141 | 0 | 0 | null | 1,487,118,553,000 | 1,487,118,553,000 | null | UTF-8 | Lean | false | false | 873 | lean | import data.vector
inductive {u} hlist : list (Type u) → Type (u+1)
| nil : hlist []
| cons : Π {α : Type u} {l : list (Type u)}, α → hlist l → hlist (α::l)
notation a :: b := hlist.cons a b
notation `[` l:(foldr `, ` (h t, hlist.cons h t) hlist.nil `]`) := l
structure Operad :=
(operations : list (ℕ × ℕ))
-- TOD... |
045535d8d978e46b84b53484e67e1fb72139f9c2 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/nat/part_enat.lean | 4cb2cab0e2b73a67754a03af9f0e7d3a3d25fa98 | [
"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,107 | 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.hom.equiv.basic
import data.part
import data.enat.basic
import tactic.norm_num
/-!
# Natural numbers with infinity
The natural numbers and an extra `top`... |
31fcb179b4d22fd528851ccb50271d569f5661f1 | 130c49f47783503e462c16b2eff31933442be6ff | /stage0/src/Lean/Elab/Tactic/Simp.lean | f5c3b2e11b988e853dda2c514dfeeda96279a62f | [
"Apache-2.0"
] | permissive | Hazel-Brown/lean4 | 8aa5860e282435ffc30dcdfccd34006c59d1d39c | 79e6732fc6bbf5af831b76f310f9c488d44e7a16 | refs/heads/master | 1,689,218,208,951 | 1,629,736,869,000 | 1,629,736,896,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,933 | 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.Tactic.Simp
import Lean.Elab.Tactic.Basic
import Lean.Elab.Tactic.ElabTerm
import Lean.Elab.Tactic.Location
import Lean.Meta.Tactic.Replace... |
027ec436ab4400ffe54cb470a515bab99a31b8dd | d436468d80b739ba7e06843c4d0d2070e43448e5 | /src/topology/algebra/uniform_ring.lean | dfd5fb95fea3550ca27664df31b007cc79117973 | [
"Apache-2.0"
] | permissive | roro47/mathlib | 761fdc002aef92f77818f3fef06bf6ec6fc1a28e | 80aa7d52537571a2ca62a3fdf71c9533a09422cf | refs/heads/master | 1,599,656,410,625 | 1,573,649,488,000 | 1,573,649,488,000 | 221,452,951 | 0 | 0 | Apache-2.0 | 1,573,647,693,000 | 1,573,647,692,000 | null | UTF-8 | Lean | false | false | 7,519 | lean | /-
Copyright (c) 2018 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Johannes Hölzl
Theory of topological rings with uniform structure.
-/
import topology.algebra.group_completion topology.algebra.ring
open classical set lattice filte... |
2388421e0088149fd64182ea7d9a00c14ce02352 | f3849be5d845a1cb97680f0bbbe03b85518312f0 | /library/tools/super/utils.lean | 94cbb6f0d07666a481884350e4627e995c373da5 | [
"Apache-2.0"
] | permissive | bjoeris/lean | 0ed95125d762b17bfcb54dad1f9721f953f92eeb | 4e496b78d5e73545fa4f9a807155113d8e6b0561 | refs/heads/master | 1,611,251,218,281 | 1,495,337,658,000 | 1,495,337,658,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,833 | lean | /-
Copyright (c) 2016 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner
-/
open tactic expr list
meta def get_metas : expr → list expr
| (var _) := []
| (sort _) := []
| (const _ _) := []
| (mvar n t) := expr.mvar n t :: get_metas t
| (local_... |
2dfd4ea0058c1b7bcba99ca44f59a14a28ec0f0b | b6f0d4562078d09b2d51c6aa5216cf0e07e8090f | /LeanRanges.lean | 846661ae221a28c9d805a00a59f3a1eb2d99244b | [
"Apache-2.0"
] | permissive | pnwamk/lean4-ranges | 206a46e0ded663f546927f598549efacc36492f2 | 6c6a7e21edc1c2ad319749b75a222d77b1340f7d | refs/heads/master | 1,680,233,414,507 | 1,617,384,186,000 | 1,617,384,186,000 | 349,486,531 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,878 | lean | import AssertCmd
import LeanRanges.ToRange
import LeanRanges.NatRange
import LeanRanges.IntRange
import LeanRanges.FinRange
import LeanRanges.UInt8Range
#check [0⋯5]
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- Nat
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
#assert [⋯(4:Nat)].toArray == #[0,1,2,3]
#assert ... |
ea387da6397e7430db7b91c21381a5f819317fbe | f4bff2062c030df03d65e8b69c88f79b63a359d8 | /src/game/order/level03.lean | e4746853dd211215fedca20f68e8f01fee7e6587 | [
"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 | 1,172 | lean | import game.order.level02
namespace xena -- hide
/-
# Chapter 2 : Order
## Level 3
Another property of the absolute value.
-/
notation `|` x `|` := abs x --hide
/- Lemma
For any two real numbers $a$ and $b$, we have that
$$|a| ≤ c ↔ -c ≤ a ≤ c$$.
-/
theorem abs_le (a c : ℝ) (h : 0 ≤ c): |a| ≤ c ↔ (-c) ≤ a ∧ a ≤ c... |
2c48637d1651e6428809c2b123dc78174f2a7977 | 94637389e03c919023691dcd05bd4411b1034aa5 | /src/inClassNotes/final/bool_expr.lean | 595d7fa3004cdafdd3ce5140ff08dbd8a551f4a3 | [] | no_license | kevinsullivan/complogic-s21 | 7c4eef2105abad899e46502270d9829d913e8afc | 99039501b770248c8ceb39890be5dfe129dc1082 | refs/heads/master | 1,682,985,669,944 | 1,621,126,241,000 | 1,621,126,241,000 | 335,706,272 | 0 | 38 | null | 1,618,325,669,000 | 1,612,374,118,000 | Lean | UTF-8 | Lean | false | false | 2,195 | lean | import .env
import .arith_expr
/-
inductive bool_var : Type
| mk (n : nat)
-/
abbreviation bool_var := var bool
/-
Abstract syntax
-/
inductive bool_expr : Type
| lit_expr : bool → bool_expr
| var_expr : bool_var → bool_expr
| and_expr : bool_expr → bool_expr → bool_expr
| or_expr : bool_expr → bool_expr → bool_e... |
ed8640c14b8fc3031afd948056500dcfbbf16ad7 | ac2987d8c7832fb4a87edb6bee26141facbb6fa0 | /Mathlib/Tactic/PrintPrefix.lean | f4db38b5d67b6fa263270f8d7cf2de238035289b | [
"Apache-2.0"
] | permissive | AurelienSaue/mathlib4 | 52204b9bd9d207c922fe0cf3397166728bb6c2e2 | 84271fe0875bafdaa88ac41f1b5a7c18151bd0d5 | refs/heads/master | 1,689,156,096,545 | 1,629,378,840,000 | 1,629,378,840,000 | 389,648,603 | 0 | 0 | Apache-2.0 | 1,627,307,284,000 | 1,627,307,284,000 | null | UTF-8 | Lean | false | false | 1,882 | lean | /-
Copyright (c) 2021 Shing Tak Lam. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Shing Tak Lam, Daniel Selsam, Mario Carneiro
-/
import Lean.Elab.Command
open Lean Meta Elab Command
namespace Lean
namespace Meta
deriving instance Inhabited for ConstantInfo -- req... |
de0064a1805b26dc01fd213c62451066ea93564c | 26ac254ecb57ffcb886ff709cf018390161a9225 | /src/data/dfinsupp.lean | df9a254aa8d14f2ef53c130fb47c34841f1019df | [
"Apache-2.0"
] | permissive | eric-wieser/mathlib | 42842584f584359bbe1fc8b88b3ff937c8acd72d | d0df6b81cd0920ad569158c06a3fd5abb9e63301 | refs/heads/master | 1,669,546,404,255 | 1,595,254,668,000 | 1,595,254,668,000 | 281,173,504 | 0 | 0 | Apache-2.0 | 1,595,263,582,000 | 1,595,263,581,000 | null | UTF-8 | Lean | false | false | 32,976 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Kenny Lau
-/
import algebra.pi_instances
/-!
# Dependent functions with finite support
For a non-dependent version see `data/finsupp.lean`.
-/
universes u u₁ u₂ v v₁ v₂ v... |
93a8864a3f1dc64b0ad95a95e4f959697a6b66b7 | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/analysis/normed_space/riesz_lemma.lean | 1c979d69f13a8759d0a86b4010358a06d0179bf5 | [
"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 | 2,377 | lean | /-
Copyright (c) 2019 Jean Lo. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean Lo
-/
import analysis.normed_space.basic
import topology.metric_space.hausdorff_distance
/-!
# Riesz's lemma
Riesz's lemma, stated for a normed space over a normed field: for any
clos... |
d9fe236f207c60ed612b7ae732cadbdb8ea2f3e3 | 510e96af568b060ed5858226ad954c258549f143 | /algebra/group_power.lean | c2d7ee23a0d32679a0f35e6da3137fd784be45c4 | [] | 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 | 5,717 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Robert Y. Lewis
The power operation on monoids and groups. We separate this from group, because it depends on
nat, which in turn depends on other parts of algebra.
We h... |
c6a60fd2dca3750b37561bd77b43412d64aeebf3 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/category_theory/monad/types.lean | f2de381d04e1067ca5df7b71fe6bec914b34078c | [
"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,901 | lean | /-
Copyright (c) 2019 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Bhavik Mehta
-/
import category_theory.monad.basic
import category_theory.monad.kleisli
import category_theory.category.Kleisli
import category_theory.types
/-!
# Con... |
61216007c5847bcf70d41b3b933b1a6cbb7060ec | ec040be767d27b10d2f864ddcfdf756aeb7a9a0a | /src/assignments/assignment_5/assignment_5.lean | 2701bf8f9449b6cc25601808147e08b2b33b7a2b | [] | no_license | RoboticPanda77/complogic-s21 | b26a9680dfb98ac650e40539296c0cafc86f5cb4 | 93c5bcc0139c0926cc261075f50a8b1ead6aa40c | refs/heads/master | 1,682,196,614,558 | 1,620,625,035,000 | 1,620,625,035,000 | 337,230,148 | 0 | 0 | null | 1,620,625,036,000 | 1,612,824,240,000 | Lean | UTF-8 | Lean | false | false | 114 | lean | /-
Formalizing algebraic structures. Typeclasses
and group theory. See Collab site for details.
-/
import algebra |
a105205f2a7805eaf94ef87ca407ad2a7591be21 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/data/rat/order.lean | 7572764f738757b7e756095ff873765c3c576d42 | [
"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 | 8,602 | lean | /-
Copyright (c) 2019 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro
-/
import data.rat.basic
/-!
# Order for Rational Numbers
## Summary
We define the order on `ℚ`, prove that `ℚ` is a discrete, linearly ordered field,... |
04197b3751b76eb774f63d60a6bf1d2acf1ec5d0 | e0f9ba56b7fedc16ef8697f6caeef5898b435143 | /src/order/filter/extr.lean | 6a207a9afa8262a25b7fa31d26dcd403ce1fe20b | [
"Apache-2.0"
] | permissive | anrddh/mathlib | 6a374da53c7e3a35cb0298b0cd67824efef362b4 | a4266a01d2dcb10de19369307c986d038c7bb6a6 | refs/heads/master | 1,656,710,827,909 | 1,589,560,456,000 | 1,589,560,456,000 | 264,271,800 | 0 | 0 | Apache-2.0 | 1,589,568,062,000 | 1,589,568,061,000 | null | UTF-8 | Lean | false | false | 18,647 | lean | /-
Copyright (c) 2019 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import order.filter.basic
/-! # Minimum and maximum w.r.t. a filter and on a aet
## Main Definitions
This file defines six predicates of the form `is_A_B`, where... |
7cb31f47549ac1e1b44f9be554994a15b2c8f16d | 6094e25ea0b7699e642463b48e51b2ead6ddc23f | /library/algebra/ordered_ring.lean | 1379dde85741884ee56a4150699e7383061deb43 | [
"Apache-2.0"
] | permissive | gbaz/lean | a7835c4e3006fbbb079e8f8ffe18aacc45adebfb | a501c308be3acaa50a2c0610ce2e0d71becf8032 | refs/heads/master | 1,611,198,791,433 | 1,451,339,111,000 | 1,451,339,111,000 | 48,713,797 | 0 | 0 | null | 1,451,338,939,000 | 1,451,338,939,000 | null | UTF-8 | Lean | false | false | 27,565 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
Here an "ordered_ring" is partially ordered ring, which is ordered with respect to both a weak
order and an associated strict order. Our numeric structures (int, rat, and... |
0113c9b1bca5e400783f7329127f1b44fc32ed92 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/linear_algebra/matrix/reindex.lean | cca2c1b3d737a19859d6679f0b2dc85a3d5e0003 | [
"Apache-2.0"
] | permissive | AntoineChambert-Loir/mathlib | 64aabb896129885f12296a799818061bc90da1ff | 07be904260ab6e36a5769680b6012f03a4727134 | refs/heads/master | 1,693,187,631,771 | 1,636,719,886,000 | 1,636,719,886,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,436 | lean | /-
Copyright (c) 2019 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Patrick Massot, Casper Putz, Anne Baanen
-/
import linear_algebra.matrix.determinant
/-!
# Changing the index type of a matrix
This file concerns the map `matrix.rei... |
914f4ac7734b732dd4670ec77ed8dc4964e5ea8c | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/data/finset/preimage.lean | fa69ca229e1e6c4b61bb623e6bae640a311d0cf2 | [
"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 | 5,514 | 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 data.set.finite
import algebra.big_operators.basic
/-!
# Preimage of a `finset` under an injective map.
-/
open set function
open_locale big... |
e5a7afbaf9d5530fee4c8c67240800ed1fc460aa | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/group_theory/congruence.lean | 649c3a7d74cac7743468b3cfcae570a2506e5769 | [] | 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 | 36,349 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.setoid.basic
import Mathlib.algebra.group.pi
import Mathlib.algebra.group.prod
i... |
e70dec4cf0e7919ac2d32fcaa91f11f8ed550fe1 | 9028d228ac200bbefe3a711342514dd4e4458bff | /src/algebra/algebra/subalgebra.lean | d6add8937eaa2c4467a4ed295ecbb62a5bb62fe2 | [
"Apache-2.0"
] | permissive | mcncm/mathlib | 8d25099344d9d2bee62822cb9ed43aa3e09fa05e | fde3d78cadeec5ef827b16ae55664ef115e66f57 | refs/heads/master | 1,672,743,316,277 | 1,602,618,514,000 | 1,602,618,514,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 16,581 | 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
/-!
# Subalgebras over Commutative Semiring
In this file we define `subalgebra`s and the usual operations on them (`map`, `comap... |
988c74969c8030008514c56cfcba334771623795 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/category_theory/limits/shapes/binary_products.lean | 2acc45e42b173e0f71e63d742fbc50e60624bab4 | [
"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 | 39,397 | lean | /-
Copyright (c) 2019 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.shapes.terminal
import category_theory.discrete_category
import category_theory.epi_mono
import category_theory.over
/-!
... |
28b1be7a69e936ac690393364847a10a6fcea9fa | cfef816283af58a9ea4678b69595e86562fd4c6a | /src/scone/edge.lean | 08baea02408e99e4db666fc6f76edbd3bae752c6 | [] | no_license | rwbarton/scone | 6fc5bee6766c170d2edeefaf608ee32d665c7c77 | 6f3d35f7a3bed772475ff7954875b9ee7554aae3 | refs/heads/master | 1,672,462,177,915 | 1,603,245,162,000 | 1,603,245,162,000 | 305,762,158 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,804 | lean | import data.equiv.basic
import tactic.binder_matching
import scone.deq
namespace scone
universes v w u u'
/-
Packed contexts
~~~~~~~~~~~~~~~
In order to directly represent a context by a Lean type we would need induction-recursion:
simultaneously define contexts and type families in those contexts.
There might be a... |
204a62d156813b8011d2ce8dac8236eea2993cf7 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /library/init/meta/expr.lean | 96a67c575588ca91e1933a0db8d96db5bc1bda83 | [
"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 | 13,534 | 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.level init.category.monad init.meta.rb_map
universes u v
structure pos :=
(line : nat)
(column : nat)
instance : decidable_eq p... |
bad230b306aa8edfde28de6f338c5c496f630a12 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/data/set/finite.lean | 585d047ad993b78bc62099281c5bf5dc458bc544 | [
"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 | 37,623 | 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 data.finset.sort
import data.set.functor
/-!
# Finite sets
This file defines predicates `finite : set α → Prop` and `infinite : set α → Prop`... |
1ec2a5b934b8a215902b41d1200264d938a2fdb6 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/measure_theory/measure/regular.lean | 49c5c34b32eb7de321a3663b25496dc07f552a01 | [
"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 | 33,793 | lean | /-
Copyright (c) 2021 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris Van Doorn, Yury Kudryashov
-/
import measure_theory.constructions.borel_space
/-!
# Regular measures
A measure is `outer_regular` if the measure of any measurable set `A` ... |
993f8a4ac8b48215f7d337110f5a6a395dc4f948 | e0f9ba56b7fedc16ef8697f6caeef5898b435143 | /src/analysis/special_functions/trigonometric.lean | 69894143625da007d95d93b808abb0fafe1538d4 | [
"Apache-2.0"
] | permissive | anrddh/mathlib | 6a374da53c7e3a35cb0298b0cd67824efef362b4 | a4266a01d2dcb10de19369307c986d038c7bb6a6 | refs/heads/master | 1,656,710,827,909 | 1,589,560,456,000 | 1,589,560,456,000 | 264,271,800 | 0 | 0 | Apache-2.0 | 1,589,568,062,000 | 1,589,568,061,000 | null | UTF-8 | Lean | false | false | 65,906 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Abhimanyu Pallavi Sudhir, Jean Lo, Calle Sönne
-/
import analysis.special_functions.exp_log
/-!
# Trigonometric functions
## Main definitions
This file contains the foll... |
ee10cbab94ec2e917c89ab27682a3bc9f835d2a3 | 2a70b774d16dbdf5a533432ee0ebab6838df0948 | /_target/deps/mathlib/src/order/filter/bases.lean | ec89de1f6f70fd351a959780580d6c70f4f8b579 | [
"Apache-2.0"
] | permissive | hjvromen/lewis | 40b035973df7c77ebf927afab7878c76d05ff758 | 105b675f73630f028ad5d890897a51b3c1146fb0 | refs/heads/master | 1,677,944,636,343 | 1,676,555,301,000 | 1,676,555,301,000 | 327,553,599 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 36,167 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Yury Kudryashov, Johannes Hölzl, Mario Carneiro, Patrick Massot
-/
import order.filter.basic
import data.set.countable
/-!
# Filter bases
A filter basis `B : filter_basis α` on a typ... |
e48032d4e6da37db6d1c54bb9428b1a5eaf26340 | f57749ca63d6416f807b770f67559503fdb21001 | /hott/types/cubical/cube.hlean | 8951aca5648f293451c025f7a38a64ea4f9376b5 | [
"Apache-2.0"
] | permissive | aliassaf/lean | bd54e85bed07b1ff6f01396551867b2677cbc6ac | f9b069b6a50756588b309b3d716c447004203152 | refs/heads/master | 1,610,982,152,948 | 1,438,916,029,000 | 1,438,916,029,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,983 | hlean | /-
Copyright (c) 2015 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Floris van Doorn
Cubes
-/
import .square
open equiv is_equiv
namespace eq
inductive cube {A : Type} {a₀₀₀ : A}
: Π{a₂₀₀ a₀₂₀ a₂₂₀ a₀₀₂ a₂₀₂ a₀₂₂ a₂₂₂ : A}
{p₁₀₀ : a₀... |
3a9b99edf38a81ea245ddc41a7b1f683d5c8b929 | e030b0259b777fedcdf73dd966f3f1556d392178 | /tests/lean/defeq_simp1.lean | 6413421877cde4a158f68bf1fe64dd2c3c76f542 | [
"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 | 693 | lean | attribute [reducible]
definition nat_has_add2 : has_add nat :=
has_add.mk (λ x y : nat, x + y)
set_option pp.all true
open tactic
example (a b : nat) (H : @add nat (id (id nat.has_add)) a b = @add nat nat_has_add2 a b) : true :=
by do
s ← simp_lemmas.mk_default,
get_local `H >>= infer_type >>= s^.dsimplify >>= t... |
69985b6c9b625f90431145d8c687f83cc70fbc25 | ae1e94c332e17c7dc7051ce976d5a9eebe7ab8a5 | /tests/lean/run/typeclass_diamond.lean | 519c30f983e09f722f6c87a30df57826c0e566b0 | [
"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 | 1,738 | lean |
class Top₁ (n : Nat) : Type := (u : Unit := ())
class Bot₁ (n : Nat) : Type := (u : Unit := ())
class Left₁ (n : Nat) : Type := (u : Unit := ())
class Right₁ (n : Nat) : Type := (u : Unit := ())
instance Bot₁Inst : Bot₁ Nat.zero := {}
instance Left₁ToBot₁ (n : Nat) [Left₁ n] : Bot₁ n := {}
instance Right₁ToB... |
2f086b4014ceac9e32ace8d20b0060482e4853bb | d1a52c3f208fa42c41df8278c3d280f075eb020c | /src/Init/Data/Int/Basic.lean | f09be2bf6e5fc4942b5094abefe2b314ec911539 | [
"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 | 4,541 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura
The integers, with addition, multiplication, and subtraction.
-/
prelude
import Init.Coe
import Init.Data.Nat.Div
import Init.Data.List.Basic
open Nat
... |
939d99718bda8f093781940a2ab1468409dd77da | 8930e38ac0fae2e5e55c28d0577a8e44e2639a6d | /data/set/basic.lean | 5d94b4e01ac2b41d2f0285638586a9ca3cf78b0f | [
"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 | 36,024 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad, Leonardo de Moura
-/
import tactic tactic.finish data.sigma
open function
namespace set
universes u v w x
variables {α : Type u} {β : Type v} {γ : Type w} {ι : Sort x} {a... |
0db31f734ba325fb2b054cd0ac79b5e2e8f76c5c | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/algebra/homology/chain_complex.lean | 41dcb35b29bddd342c186d86171b98a5c1515970 | [
"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 | 3,654 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import data.int.basic
import category_theory.graded_object
import category_theory.differential_object
/-!
# Chain complexes
We define a chain complex in `V` as a di... |
91cdbab9eb8d9ce4a39db396dc7ef484cfaa87ba | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/system/random/basic_auto.lean | d693239bf28e23de6295e83535d69cc7d4637809 | [] | 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,251 | lean | /-
Copyright (c) 2020 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Simon Hudon
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.algebra.group_power.default
import Mathlib.control.uliftable
import Mathlib.control.monad.basic... |
5ff3ab19605d21974536d18d873d8197bd8a6f84 | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /library/standard/logic/connectives/if.lean | 44bb046ee8721b5df57bcbf00775b003697a4b57 | [
"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 | 1,502 | lean | ----------------------------------------------------------------------------------------------------
-- Copyright (c) 2014 Microsoft Corporation. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Author: Leonardo de Moura
-----------------------------------------------------... |
73fdda70716c7d928b341c23cad9e4c238047232 | 3f7026ea8bef0825ca0339a275c03b911baef64d | /src/category_theory/limits/shapes/constructions/limits_of_products_and_equalizers.lean | 2eebf57802662e66bac07ae6d505f07fe28eaa80 | [
"Apache-2.0"
] | permissive | rspencer01/mathlib | b1e3afa5c121362ef0881012cc116513ab09f18c | c7d36292c6b9234dc40143c16288932ae38fdc12 | refs/heads/master | 1,595,010,346,708 | 1,567,511,503,000 | 1,567,511,503,000 | 206,071,681 | 0 | 0 | Apache-2.0 | 1,567,513,643,000 | 1,567,513,643,000 | null | UTF-8 | Lean | false | false | 3,141 | lean | /-
-- Copyright (c) 2017 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.products
import category_theory.limits.shapes.equalizers
/-!
# Constructing limits from products and equalizers.
If a... |
b57ad444f5a7f7fdb4e70f7cf174ce2568e3659b | 41ebf3cb010344adfa84907b3304db00e02db0a6 | /uexp/src/uexp/rules/fkPennTR.lean | 27343dbad25d5c8b72ef0263a22d0a2488d16006 | [
"BSD-2-Clause"
] | permissive | ReinierKoops/Cosette | e061b2ba58b26f4eddf4cd052dcf7abd16dfe8fb | eb8dadd06ee05fe7b6b99de431dd7c4faef5cb29 | refs/heads/master | 1,686,483,953,198 | 1,624,293,498,000 | 1,624,293,498,000 | 378,997,885 | 0 | 0 | BSD-2-Clause | 1,624,293,485,000 | 1,624,293,484,000 | null | UTF-8 | Lean | false | false | 2,855 | lean | import ..sql
import ..tactics
import ..u_semiring
import ..extra_constants
import ..meta.cosette_tactics
open Expr
open Proj
open Pred
open SQL
variable str_security_ : const datatypes.int
theorem rule :
forall (Γ scm_payroll scm_teams scm_depts : Schema)
(rel_payroll : relation scm_payroll)
... |
da8efd6615d2b1aed5b7df2015131fd4506ebaed | 85cd896397311530f27039b95aa3371919ce74cd | /sphinx/hanoi_project/ngaHW.lean | 72a6c138a5307e5cf0437acaa68b4ffe225f2a21 | [
"CC-BY-4.0"
] | permissive | ngamt/formalabstracts | 4c556378b417fea39f8a56447929a90fab9ad368 | 30cafc6c16cec733022babcdfbd9d81be5ae40bd | refs/heads/master | 1,584,621,015,487 | 1,528,685,558,000 | 1,528,685,558,000 | 136,272,052 | 0 | 0 | null | 1,528,259,509,000 | 1,528,259,508,000 | null | UTF-8 | Lean | false | false | 661 | lean | open nat int
--check prime number
def isPrime (n : ℕ) : Prop :=
(n ≥ 2) ∧ (∀ m : ℕ , m ≥ 1 ∧ m ∣ n → (m = 1 ∨ m = n))
--GoldBach Conjecture
theorem goldBach (n : ℕ) : n > 2 →
∃ p q : ℕ , isPrime p ∧ isPrime q ∧ (n = p + q) :=
begin
admit,
end
-- Opperman Conjecture
def isOpperman (n : ℕ) : Prop :=
(∃ ... |
a421af6463ff866c2ca17855ed1b8945a50a9a65 | 86f6f4f8d827a196a32bfc646234b73328aeb306 | /examples/logic/unnamed_1531.lean | 2163b5cc0135d4005d58488636f34e6b8404242f | [] | no_license | jamescheuk91/mathematics_in_lean | 09f1f87d2b0dce53464ff0cbe592c568ff59cf5e | 4452499264e2975bca2f42565c0925506ba5dda3 | refs/heads/master | 1,679,716,410,967 | 1,613,957,947,000 | 1,613,957,947,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 326 | lean | import data.real.basic
-- BEGIN
example {x y : ℝ} (h₀ : x ≤ y) (h₁ : ¬ y ≤ x) : x ≤ y ∧ x ≠ y :=
⟨h₀, λ h, h₁ (by rw h)⟩
example {x y : ℝ} (h₀ : x ≤ y) (h₁ : ¬ y ≤ x) : x ≤ y ∧ x ≠ y :=
begin
have h : x ≠ y,
{ contrapose! h₁,
rw h₁ },
exact ⟨h₀, h⟩
end
-- END |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.