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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
508bc8d3554af5403db20f7c9f0b494d1ec07dfa | a4673261e60b025e2c8c825dfa4ab9108246c32e | /tests/lean/run/incmd.lean | 7333fcbfd6e3f6402175c98ebe8839e268f183c6 | [
"Apache-2.0"
] | permissive | jcommelin/lean4 | c02dec0cc32c4bccab009285475f265f17d73228 | 2909313475588cc20ac0436e55548a4502050d0a | refs/heads/master | 1,674,129,550,893 | 1,606,415,348,000 | 1,606,415,348,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 223 | lean |
variable {α : Type} in
def f : α → α :=
fun x => x
#check @f
variables {α : Type} {β : Type} in
variable (h : α → α) in
set_option syntaxMaxDepth 1000 in
def g : α → β → α :=
fun x _ => h x
#check @g
|
3fc3d395939695301a4b60221f8a7a6c856eb557 | 958488bc7f3c2044206e0358e56d7690b6ae696c | /lean/nat.lean | ef2b259f316ab3df2a3e3a1e0fc2a6b3e456f5b1 | [] | no_license | possientis/Prog | a08eec1c1b121c2fd6c70a8ae89e2fbef952adb4 | d4b3debc37610a88e0dac3ac5914903604fd1d1f | refs/heads/master | 1,692,263,717,723 | 1,691,757,179,000 | 1,691,757,179,000 | 40,361,602 | 3 | 0 | null | 1,679,896,438,000 | 1,438,953,859,000 | Coq | UTF-8 | Lean | false | false | 1,939 | lean | namespace hidden1
inductive nat : Type
| zero : nat
| succ : nat → nat
open nat
--#check @nat.succ
--#check @nat.rec
--#check @nat.rec_on
def add2 (m n : nat) : nat :=
nat.rec_on n m (λ n add_m_n, nat.succ add_m_n)
end hidden1
open nat
lemma L1 : ∀ (n : ℕ), 0 + n = n :=
assume n,
nat.rec_on n
(sho... |
b0cd6bef82ada50e2790934b5b47b909a36bbf77 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/topology/uniform_space/basic.lean | 733ea8c3e668ab413a09cc9b7267b997f9ba173d | [
"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 | 68,359 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro, Patrick Massot
-/
import order.filter.lift
import topology.separation
/-!
# Uniform spaces
Uniform spaces are a generalization of metric spaces and top... |
bd0c49b5403f287daf40fd4aa20911101e02cf35 | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch5/ex0510.lean | 7520a6f790961c368e58673254a954f8ff9c0607 | [] | 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 | 140 | lean | example (p q r : Prop) (hp : p) (hq : q) (hr : r) : p ∧ q ∧ r :=
begin
repeat { any_goals { split } },
all_goals { assumption }
end
|
2c653f9cae7bf938ae30c279b01364922d8cc5ff | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/compiler/rbmap_library.lean | 4455cd46593ea2d682056c3411f8e2a170b80e9e | [
"Apache-2.0"
] | permissive | mhuisi/lean4 | 28d35a4febc2e251c7f05492e13f3b05d6f9b7af | dda44bc47f3e5d024508060dac2bcb59fd12e4c0 | refs/heads/master | 1,621,225,489,283 | 1,585,142,689,000 | 1,585,142,689,000 | 250,590,438 | 0 | 2 | Apache-2.0 | 1,602,443,220,000 | 1,585,327,814,000 | C | UTF-8 | Lean | false | false | 2,274 | lean | def check (b : Bool) : IO Unit :=
unless b $ IO.println "ERROR"
def sz {α β : Type} {lt : α → α → Bool} (m : RBMap α β lt) : Nat :=
m.fold (fun sz _ _ => sz+1) 0
def depth {α β : Type} {lt : α → α → Bool} (m : RBMap α β lt) : Nat :=
m.depth Nat.max
def tst1 : IO Unit :=
do let Map := RBMap String Nat (fun a b => a <... |
f19e06ef1d2be9a9eb86f137971e4dfd1e3cc084 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/data/multiset/functor.lean | 588cf6028971918a04d7df7b70b6d48e31ad5579 | [
"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 | 4,249 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro, Johannes Hölzl, Simon Hudon, Kenny Lau
-/
import data.multiset.basic
import control.traversable.lemmas
import control.traversable.instances
/-!
# Functoriality of `multise... |
5d5b5b72d841d9db8fca923ffc6f0b19bb990bba | 432d948a4d3d242fdfb44b81c9e1b1baacd58617 | /src/data/set/intervals/image_preimage.lean | dad65888833c868fc95df68667f21674b36b6acf | [
"Apache-2.0"
] | permissive | JLimperg/aesop3 | 306cc6570c556568897ed2e508c8869667252e8a | a4a116f650cc7403428e72bd2e2c4cda300fe03f | refs/heads/master | 1,682,884,916,368 | 1,620,320,033,000 | 1,620,320,033,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 20,341 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov, Patrick Massot
-/
import data.set.intervals.basic
import data.equiv.mul_add
import algebra.pointwise
/-!
# (Pre)images of intervals
In this file we prove a bu... |
379fc528ed50bdf94e2b69751e13f7435eea661e | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/lake/examples/deps/a/lakefile.lean | 1371c0ce1ea3f36806064cb25d35129e487d54e8 | [
"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 | 103 | lean | import Lake
open System Lake DSL
package a
require root from ".."/"root"
@[default_target] lean_lib A
|
c6e0e04f635e8b21697f4459411bd44c11709792 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/group_theory/group_action/basic.lean | 4a536bbd7f335c236433e9095985a11344d5e432 | [
"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 | 14,085 | 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.group_action
import group_theory.group_action.defs
import group_theory.group_action.group
import data.setoid.basic
import data.fintype.card
/-!
# Basi... |
d2c824fe3d1ba3e9be23caf821930f05ecfd434f | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/data/option/basic.lean | 191596d0ea473ec67d95413daf62511232292983 | [
"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 | 4,742 | 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 logic.basic data.bool data.option.defs tactic.ext tactic.simpa
namespace option
variables {α : Type*} {β : Type*}
@[simp] theorem get_mem : ∀ {o : option α} ... |
b5a19c3d10a4073362924240c9054e18121e2b5a | 4d3f29a7b2eff44af8fd0d3176232e039acb9ee3 | /LAMR/Examples/using_lean/examples3.lean | 4249880c3531396ee7a6d640413d9d0a616e80e9 | [] | no_license | marijnheule/lamr | 5fc5d69d326ff92e321242cfd7f72e78d7f99d7e | 28cc4114c7361059bb54f407fa312bf38b48728b | refs/heads/main | 1,689,338,013,620 | 1,630,359,632,000 | 1,630,359,632,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 584 | lean | -- textbook: BinTree
import Init
inductive BinTree
| empty : BinTree
| node : BinTree → BinTree → BinTree
open BinTree
-- end textbook: BinTree
-- textbook: recursion on BinTree
def size : BinTree → Nat
| empty => 0
| node a b => 1 + size a + size b
def depth : BinTree → Nat
| empty => 0
| node a... |
ba337794b41d870937a2e12f50c1cc5dae24109f | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/analysis/calculus/tangent_cone.lean | c9c5a5b788ba5845a7166e8a42c4cef997f5bf40 | [
"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 | 18,798 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import analysis.convex.basic
import analysis.normed_space.bounded_linear_maps
import analysis.specific_limits
/-!
# Tangent cone
In this file, we define two p... |
a3a23f7c7d7ba63688e7fc7b380455b6b406af69 | ed544fdbb470075305eb2a01b0491ce8a6ba05c8 | /src/certigrad/predicates.lean | 0b7ca23f23ba322a107d4ee09a36af6b614b3c1d | [
"Apache-2.0"
] | permissive | gazimahmud/certigrad | d12caa30c6fc3adf9bb1fcd61479af0faad8b6c3 | 38cc6377dbd5025eb074188a1acd02147a92bdba | refs/heads/master | 1,606,977,759,336 | 1,498,686,571,000 | 1,498,686,571,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,354 | 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... |
d8044b4c3e82dd623a41b846be853f51637522e9 | 3dd1b66af77106badae6edb1c4dea91a146ead30 | /tests/lean/run/tactic21.lean | 2f721b8c9ec0a6b53e0274ba3d678112c7efc846 | [
"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 | 477 | lean | import standard
using tactic
definition assump := eassumption
theorem tst1 {A : Type} {a b c : A} {p : A → A → Prop} (H1 : p a b) (H2 : p b c) : ∃ x, p a x ∧ p x c
:= by apply exists_intro; apply and_intro; assump; assump
theorem tst2 {A : Type} {a b c d : A} {p : A → A → Prop} (Ha : p a c) (H1 : p a b) (Hb : p b d)... |
274200623dc1a3e939424d0ceaee901d0c388d12 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/ring_theory/valuation/integers.lean | 1f8c31afc06659672deed8c45dc958d5be4d5320 | [
"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,220 | 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 ring_theory.valuation.basic
/-!
# Ring of integers under a given valuation
The elements with valuation less than or equal to 1.
TODO: Define characteristic predicate... |
2b6728bd0060f03f862529dbece0c2a3ef6e84f3 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/435b.lean | 9acb748d318bfabf510d9cb50bd3205e97a7a0c6 | [
"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 | 267 | lean | structure Op (α : Type _) where op : α → α → α
variable {α}
variable (s : Op α)
local infixr:60 " ∙ " => s.op
local infixr:60 " ∙1 " => s.op1 -- TODO: generate error
def x := 0
notation "x++" => x.succ
notation "x++" => x.foo -- TODO: generate error
|
45162f033092a1d508b511236c570a26c334fea7 | c31182a012eec69da0a1f6c05f42b0f0717d212d | /src/normed_snake.lean | 00bf3e6264af931e26a35b2d935e39fd0227da0d | [] | no_license | Ja1941/lean-liquid | fbec3ffc7fc67df1b5ca95b7ee225685ab9ffbdc | 8e80ed0cbdf5145d6814e833a674eaf05a1495c1 | refs/heads/master | 1,689,437,983,362 | 1,628,362,719,000 | 1,628,362,719,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,371 | lean | import system_of_complexes.basic
universe variables u
noncomputable theory
open_locale nnreal
open category_theory opposite normed_group_hom system_of_complexes
variables (M M' N : system_of_complexes.{u}) (f : M ⟶ M') (g : M' ⟶ N)
/-- The normed snake lemma, weak version. See Proposition 9.10 from Analytic.pdf -/
... |
769ced5eba60fc4af971621258d8b557ba2bf01f | 367134ba5a65885e863bdc4507601606690974c1 | /src/analysis/convex/specific_functions.lean | 43317b577b7d97d97bfd0f3f60e9bb284a690a6b | [
"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 | 6,657 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov, Sébastien Gouëzel
-/
import analysis.calculus.mean_value
import data.nat.parity
import analysis.special_functions.pow
/-!
# Collection of convex functions
In this f... |
4e81395e4fc75aa1b562e0209fb082e1534d2eca | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/hott/ind_tac3.hlean | 40370f87d978a8c7cabe5d267a75e47face229ff | [
"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 | 176 | hlean | open eq
set_option pp.implicit true
set_option pp.universes true
set_option pp.notation false
check @idp_rec_on
attribute idp_rec_on [recursor]
print [recursor] idp_rec_on
|
610428af1d94940473a2198fb667bf6ae31c4403 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/char_p/char_and_card.lean | 10d61ec6c37081009365042ffdd1d367056b6ca6 | [
"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 | 3,286 | lean | /-
Copyright (c) 2022 Michael Stoll. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Michael Stoll
-/
import algebra.char_p.basic
import group_theory.perm.cycle.type
/-!
# Characteristic and cardinality
We prove some results relating characteristic and cardinality of ... |
aa6118bd08d8f19929713e7ac27c01660990845f | 437dc96105f48409c3981d46fb48e57c9ac3a3e4 | /src/algebra/midpoint.lean | e9da35f1e76f57094a3c93b64ca595a4a0317e12 | [
"Apache-2.0"
] | permissive | dan-c-k/mathlib | 08efec79bd7481ee6da9cc44c24a653bff4fbe0d | 96efc220f6225bc7a5ed8349900391a33a38cc56 | refs/heads/master | 1,658,082,847,093 | 1,589,013,201,000 | 1,589,013,201,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,247 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Yury Kudryashov
-/
import algebra.module
import algebra.invertible
/-!
# Midpoint of a segment
## Main definitions
* `midpoint R x y`: midpoint of the segment `[x, y]`. We define it... |
ddf9346771cc76ad3ee6ed7a75d9a25d86ad76da | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/ring_theory/matrix_algebra_auto.lean | 3028966e1c6363257ea4778e29da5493fd42bedb | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,232 | 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.ring_theory.tensor_product
import Mathlib.PostPort
universes u v w
namespace Mathlib
/-... |
acae21a86a81860c8b2a46af3d432a5555bf4448 | 853df553b1d6ca524e3f0a79aedd32dde5d27ec3 | /src/measure_theory/outer_measure.lean | 57e561d1bba7a5abc1cb8640427aee15af43aed6 | [
"Apache-2.0"
] | permissive | DanielFabian/mathlib | efc3a50b5dde303c59eeb6353ef4c35a345d7112 | f520d07eba0c852e96fe26da71d85bf6d40fcc2a | refs/heads/master | 1,668,739,922,971 | 1,595,201,756,000 | 1,595,201,756,000 | 279,469,476 | 0 | 0 | null | 1,594,696,604,000 | 1,594,696,604,000 | null | UTF-8 | Lean | false | false | 20,993 | 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
Outer measures -- overapproximations of measures
-/
import analysis.specific_limits
import measure_theory.measurable_space
/-!
# Outer Measures
An out... |
56ee0d3d34b1b1d47bc618c2dd850a18e12a6924 | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /src/topology/uniform_space/completion.lean | dfe0d963e30f24705cdb2115d463500410bf0184 | [
"Apache-2.0"
] | permissive | kmill/mathlib | ea5a007b67ae4e9e18dd50d31d8aa60f650425ee | 1a419a9fea7b959317eddd556e1bb9639f4dcc05 | refs/heads/master | 1,668,578,197,719 | 1,593,629,163,000 | 1,593,629,163,000 | 276,482,939 | 0 | 0 | null | 1,593,637,960,000 | 1,593,637,959,000 | null | UTF-8 | Lean | false | false | 23,262 | 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
Hausdorff completions of uniform spaces.
The goal is to construct a left-adjoint to the inclusion of complete Hausdorff uniform spaces
into all uniform... |
1d24d036506048abc2443c6a5e21dcb35a70d739 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/blast_congr_bug.lean | 0604421da1d67f92b2db441d190644d54bf58528 | [
"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 | 270 | lean | constant P : Type₁
constant P_sub : subsingleton P
attribute P_sub [instance]
constant q : P → Prop
section
example (h₁ h₂ : P) : q h₁ = q h₂ :=
by simp
end
section
set_option blast.strategy "cc"
example (h₁ h₂ : P) : q h₁ = q h₂ :=
by blast
end
|
51321ae7d036a942fc6931892321385ddd6e4b1e | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/data/nat/modeq.lean | 0ca861770fde338c33134380ef831bd661490095 | [
"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 | 12,140 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
Modular equality relation.
-/
import data.int.gcd algebra.ordered_ring tactic.abel
namespace nat
/-- Modular equality. `modeq n a b`, or `a ≡ b [MOD n]`, means
that... |
f6d795e7883392f032fb40f0e3da0c922e2bb613 | 32c054a763e4aa96bcb6e8bc87775e0f403a1804 | /src/smtexpr.lean | 2fc267089b9c15036f081ee0b1e10dde0b2a1bb8 | [
"LicenseRef-scancode-generic-cla",
"MIT"
] | permissive | Claudiusgonzo/AliveInLean | 7fac3f82722c27acc5551260ea12a36519f6e24e | a21bfb90dee0c6c6e00a955b6de92c631198c5ba | refs/heads/master | 1,635,381,727,801 | 1,555,783,536,000 | 1,555,783,536,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,284 | lean | -- Copyright (c) Microsoft Corporation. All rights reserved.
-- Licensed under the MIT license.
import .common
import .ops
import .bitvector
import smt2.syntax
import smt2.builder
universes u
mutual inductive sbool, sbitvec
with sbool : Type
| tt: sbool | ff:sbool
| var: string → sbool -- unbound variable
| and: sbo... |
597e0f6d21af416eae43e6baaf8dcaa8a0076da7 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/order/extension/well.lean | 2aeeb6c1b5e949d60ea9b986182482147fbf89de | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 3,380 | lean | /-
Copyright (c) 2022 Yaël Dillies, Junyan Xu. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies, Junyan Xu
-/
import data.prod.lex
import set_theory.ordinal.arithmetic
/-!
# Extend a well-founded order to a well-order
> THIS FILE IS SYNCHRONIZED WITH MATHL... |
8ee2bb7181dccfb512d41a0d0e9fc0a58bc98b6c | b074a51e20fdb737b2d4c635dd292fc54685e010 | /src/ring_theory/algebra.lean | 358fbcde7c630bfbabdd219261410872ad16d599 | [
"Apache-2.0"
] | permissive | minchaowu/mathlib | 2daf6ffdb5a56eeca403e894af88bcaaf65aec5e | 879da1cf04c2baa9eaa7bd2472100bc0335e5c73 | refs/heads/master | 1,609,628,676,768 | 1,564,310,105,000 | 1,564,310,105,000 | 99,461,307 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 19,835 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
Algebra over Commutative Ring (under category)
-/
import data.polynomial data.mv_polynomial
import data.complex.basic
import linear_algebra.tensor_product
import ring_theory.sub... |
569a29417287671aec8e7baad0cc513ede10a83a | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/tactic/push_neg.lean | 0444e836c074106289d0b72d27070491794ff6ac | [
"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 | 7,941 | lean | /-
Copyright (c) 2019 Patrick Massot All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Patrick Massot, Simon Hudon
A tactic pushing negations into an expression
-/
import logic.basic
import algebra.order
open tactic expr
namespace push_neg
section
universe u
variable ... |
793a9db1e25b5babb72f4f7bd69caff8b3e6fce5 | f3849be5d845a1cb97680f0bbbe03b85518312f0 | /old_library/init/logic.lean | ac6eefbade516fcf5d711cceed76e620aab077c5 | [
"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 | 34,391 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Jeremy Avigad, Floris van Doorn
-/
prelude
import init.datatypes
universe variables u v
attribute [reducible]
definition id {A : Type u} (a : A) : A :=
a
/... |
4628ec69d55cc7aec1fc5366fa6b3bf5ffd4f541 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/tactic/lint/basic_auto.lean | dd29e9704541f9bc24e20596009e8fa424c9d7b7 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,095 | 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, Robert Y. Lewis, Gabriel Ebner
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.tactic.core
import Mathlib.PostPort
namespace Mathlib
... |
3d8f0d4fd8b6a6b743c9898d6cfcc5b44da85282 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/order/category/PartialOrder.lean | 37ff957e819a44f10b7478a3acbd4eb08e18465e | [
"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 | 873 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import order.category.Preorder
/-! # Category of partially ordered types -/
open category_theory
/-- The category of partially ordered types. -/
def PartialOrder ... |
cead5ac87ead124bb14fb478f890d256c8efed79 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/def_inaccessible_issue.lean | 422e21a0781336150aee6e39d10f012fc2c496cc | [
"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 | 764 | lean | set_option eqn_compiler.dsimp true
open nat
set_option pp.binder_types true
inductive bv : nat → Type
| nil : bv 0
| cons : ∀ (n) (hd : bool) (tl : bv n), bv (succ n)
open bv
variable (f : bool → bool → bool)
definition map2 : ∀ {n}, bv n → bv n → bv n
| 0 nil nil := nil
| (n+1) (cons .... |
9b2d63a73729eb9e6373d700ba6d2f1851801ad2 | 3984ab8555ab1e1084e22ef652544acdfc231f27 | /src/script.lean | 7fd9e5d649e1ab0caf64f74cac470f8c23af20e6 | [] | no_license | mrakgr/CFR-in-Lean | a35c7a478795cc794cc0caff3199cf28c8ee5448 | 720a3260297bcc158e08833d38964450dcaad2eb | refs/heads/master | 1,598,515,917,940 | 1,572,612,355,000 | 1,572,612,355,000 | 217,296,108 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 73 | lean | def T : Type := ∃ (q : nat), {i // i = q}
def q : T := sorry
#check q |
8c2d45e2d2fad9a63df3c35747f43d2195c5eb3b | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/continued_fractions/basic.lean | 6d2c43d0f36d74cd51bf60e0886ce376eaf30d84 | [
"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 | 13,777 | lean | /-
Copyright (c) 2019 Kevin Kappelmann. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Kappelmann
-/
import data.seq.seq
import algebra.field.defs
/-!
# Basic Definitions/Theorems for Continued Fractions
## Summary
We define generalised, simple, and regular con... |
3ad5a3b109a91f0e70f3d0eb128545fe8e4788d2 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/group_theory/abelianization.lean | e7be75497aac901a5a17e411bdf1c3b84fb9099b | [
"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 | 7,242 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Michael Howes
-/
import group_theory.commutator
import group_theory.quotient_group
/-!
# The abelianization of a group
This file defines the commutator and the abelianization o... |
d6c8ba31d3df3eed4fa8819f6d5bf615200ea7b5 | 36c7a18fd72e5b57229bd8ba36493daf536a19ce | /library/algebra/simplifier.lean | e766982525b92f6eaed18589b467385bed8e653f | [
"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 | 3,809 | lean | /-
Copyright (c) 2015 Daniel Selsam. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Daniel Selsam
-/
import algebra.ring algebra.numeral
namespace simplifier
namespace empty
end empty
namespace iff
attribute eq_self_iff_true [simp]
end iff
-- TODO(dhs): make these [... |
5a1332ad8d69c9e15503689b2429a41e3e10c4af | 0845ae2ca02071debcfd4ac24be871236c01784f | /library/init/data/rbtree/basic.lean | 52d3a940ed08e837d7557fb25a1f4f986b7e4ff8 | [
"Apache-2.0"
] | permissive | GaloisInc/lean4 | 74c267eb0e900bfaa23df8de86039483ecbd60b7 | 228ddd5fdcd98dd4e9c009f425284e86917938aa | refs/heads/master | 1,643,131,356,301 | 1,562,715,572,000 | 1,562,715,572,000 | 192,390,898 | 0 | 0 | null | 1,560,792,750,000 | 1,560,792,749,000 | null | UTF-8 | Lean | false | false | 2,907 | 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
-/
prelude
import init.data.rbmap.basic
universes u v w
def RBTree (α : Type u) (lt : α → α → Bool) : Type u :=
RBMap α Unit lt
@[inline] def mkRBTree (α : T... |
de4a3ce90c0db91e6e28f9cd061afc16d9db0178 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/dynamics/flow.lean | 7cb4766756e7b3462d91c81f3d0c156e3af3f217 | [
"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 | 6,140 | lean | /-
Copyright (c) 2020 Jean Lo. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean Lo
-/
import topology.algebra.group
import logic.function.iterate
/-!
# Flows and invariant sets
This file defines a flow on a topological space `α` by a topological
monoid `τ` as a c... |
fec48e765d5a9d86c521f04f8e5133623d790cea | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/algebra/category/CommRing/colimits.lean | 4b5560526a8dafc5bcb31245762e0191496b2af0 | [
"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 | 13,323 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import algebra.category.CommRing.basic
import category_theory.limits.limits
/-!
# The category of commutative rings has all colimits.
This file uses a "pre-automate... |
5c3e0f2e3943f4cee07ada1783810974927d0441 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /src/Init/Data/Array/InsertionSort.lean | 0f8a76610b4d0968811773ce00b11b88a98ea9ae | [
"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 | 929 | lean | /-
Copyright (c) 2018 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import Init.Data.Array.Basic
@[inline] def Array.insertionSort (a : Array α) (lt : α → α → Bool) : Array α :=
traverse a 0 a.size
where
@[speci... |
b22280aaf0588e431be83d04728e3f365d831aa0 | b815abf92ce063fe0d1fabf5b42da483552aa3e8 | /library/init/meta/expr.lean | 8231d3128cc89bd997a41c8296ae425b4773127a | [
"Apache-2.0"
] | permissive | yodalee/lean | a368d842df12c63e9f79414ed7bbee805b9001ef | 317989bf9ef6ae1dec7488c2363dbfcdc16e0756 | refs/heads/master | 1,610,551,176,860 | 1,481,430,138,000 | 1,481,646,441,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,032 | 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
inductive binder_info
| default | implicit | strict_implicit | inst_implicit | other
meta constant macro_def : Type
/- Ref... |
f446bbbc323021f32754838e715f3c0d46fdf7d5 | 26ac254ecb57ffcb886ff709cf018390161a9225 | /src/group_theory/submonoid/membership.lean | f06a5c8c6c36f37f0e3d00654c8992fce85a6cd1 | [
"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 | 7,428 | lean | /-
Copyright (c) 2018 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Kenny Lau, Johan Commelin, Mario Carneiro, Kevin Buzzard,
Amelia Livingston, Yury Kudryashov
-/
import group_theory.submonoid.operations
import algebra.big_operators
im... |
021c3255b93bbfd812047b770bbd6b8fdbcd102c | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/mem_nil.lean | 2848d9581d3c0b2b92572fe0151724b59fa84326 | [
"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 | 85 | lean | universe variables u
example {α : Type u} (a : α) : a ∉ ([] : list α) :=
sorry
|
446f97ea3535aa8fa2694ffe104ab48991a8add6 | 5d166a16ae129621cb54ca9dde86c275d7d2b483 | /tests/lean/run/check_constants.lean | 194ac667224003d2f15d4ead54945167bb49726e | [
"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 | 14,805 | lean | -- DO NOT EDIT, automatically generated file, generator scripts/gen_constants_cpp.py
import smt system.io
open tactic
meta def script_check_id (n : name) : tactic unit :=
do env ← get_env, (env^.get n >> return ()) <|> (guard $ env^.is_namespace n) <|> (attribute.get_instances n >> return ()) <|> fail ("identifier '" +... |
b15fbe410d68fcc460fbbb223590b6ced3384dc5 | 4fc5f02f6ed9423b87987589bcc202f985d7e9ff | /src/game/world7/level1.lean | ceee09f657f01818e32506a59289ca1b90f2e18f | [
"Apache-2.0"
] | permissive | grthomson/natural_number_game | 2937533df0b83e73e6a873c0779ee21e30f09778 | 0a23a327ca724b95406c510ee27c55f5b97e612f | refs/heads/master | 1,599,994,591,355 | 1,588,869,073,000 | 1,588,869,073,000 | 222,750,177 | 0 | 0 | Apache-2.0 | 1,574,183,960,000 | 1,574,183,960,000 | null | UTF-8 | Lean | false | false | 1,609 | lean | -- World name : Advanced Proposition world
/-
# Advanced proposition world.
In this world we will learn five key tactics needed to solve all the
levels of the Natural Number Game, namely `split`, `cases`, `left`, `right`, and `exfalso`.
These, and `use` (which we'll get to in Inequality World) are all the
tactics y... |
f61e7ce939db9b21be4861b97405813b8d3226d4 | 64874bd1010548c7f5a6e3e8902efa63baaff785 | /hott/init/hedberg.hlean | ce9c2799b076a107af950f714ba3ecf9d85fc527 | [
"Apache-2.0"
] | permissive | tjiaqi/lean | 4634d729795c164664d10d093f3545287c76628f | d0ce4cf62f4246b0600c07e074d86e51f2195e30 | refs/heads/master | 1,622,323,796,480 | 1,422,643,069,000 | 1,422,643,069,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,499 | hlean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
Hedberg's Theorem: every type with decidable equality is a hset
-/
prelude
import init.trunc
open eq eq.ops nat truncation sigma
-- TODO(Leo): move const col... |
0bf7211b26592b965fe1d998b778be1e9742ae31 | 03bd658c402412f41d3026d1040ee8ca8c0fc579 | /src/list/simple_value.lean | 484ebb7691e2158f1e95a6bd62aa62f4498f05b5 | [] | no_license | ImperialCollegeLondon/dots_and_boxes | c205f6dbad8af9625f56715e4d1bed96b0ac1022 | f7bd0b1603674a657170c5395adb717c4f670220 | refs/heads/master | 1,663,752,058,476 | 1,591,438,614,000 | 1,591,438,614,000 | 139,707,103 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,878 | lean | import tactic.linarith list.min.basic
-- tf = 2 if we are talking about chains and 4 otherwise
-- all games are assumed to consist only of loops or only of chains
/-- Let G be all chains or loops. If m is the length of a component of G, and
vL = value of game G with that component removed, list.aux_fun this is the... |
2877e70e226484541cb5f5a3f8eb1c37faed4337 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/data/list/nodup_equiv_fin.lean | ed043c98fccf0b5cbbf0b2251de565a14f7e166d | [
"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 | 2,382 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov
-/
import data.list.sort
import data.fin
/-!
# Isomorphism between `fin (length l)` and `{x // x ∈ l}`
Given a list `l,
* if `l` has no duplicates, then `list... |
eebc4d6c659e0f7b011cfbaac84398d92e46686e | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/data/list/basic.lean | 325fb426f705b0eb97a5da8a761cef963888dc35 | [
"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 | 160,491 | lean | /-
Copyright (c) 2014 Parikshit Khanna. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Parikshit Khanna, Jeremy Avigad, Leonardo de Moura, Floris van Doorn, Mario Carneiro
-/
import control.monad.basic
import data.nat.basic
/-!
# Basic properties of lists
-/
open fun... |
01fd7c351ec50d59479969a71ec409f3dcc4e8f3 | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /stage0/src/Lean/Data/Lsp/Basic.lean | a114197c7b96b29db81b0d664b6044b99ddfaccd | [
"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 | 12,677 | lean | /-
Copyright (c) 2020 Marc Huisinga. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Marc Huisinga, Wojciech Nawrocki
-/
import Lean.Data.Json
import Lean.Data.JsonRpc
/-! Defines most of the 'Basic Structures' in the LSP specification
(https://microsoft.github.io/lan... |
affb91d6d49c60b9ade928ee6465d29ed557d6a3 | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/algebra/group_with_zero_power.lean | 9fc34d80bdb6cd92d7c83b78efd289b40874f49e | [
"Apache-2.0"
] | permissive | agjftucker/mathlib | d634cd0d5256b6325e3c55bb7fb2403548371707 | 87fe50de17b00af533f72a102d0adefe4a2285e8 | refs/heads/master | 1,625,378,131,941 | 1,599,166,526,000 | 1,599,166,526,000 | 160,748,509 | 0 | 0 | Apache-2.0 | 1,544,141,789,000 | 1,544,141,789,000 | null | UTF-8 | Lean | false | false | 7,870 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import algebra.group_power
/-!
# Powers of elements of groups with an adjoined zero element
In this file we define integer power functions for groups with an adjoin... |
0c2fcfdf9d0e8594d712b5dca5f26f72a5b7b383 | 9cb9db9d79fad57d80ca53543dc07efb7c4f3838 | /src/pseudo_normed_group/LC.lean | 7b564d21a28d8255b9eb325f9a40bb51b4e7a4f9 | [] | no_license | mr-infty/lean-liquid | 3ff89d1f66244b434654c59bdbd6b77cb7de0109 | a8db559073d2101173775ccbd85729d3a4f1ed4d | refs/heads/master | 1,678,465,145,334 | 1,614,565,310,000 | 1,614,565,310,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 14,062 | lean | import pseudo_normed_group.FiltrationPow
import locally_constant.NormedGroup
import locally_constant.Vhat
open_locale classical nnreal big_operators
noncomputable theory
local attribute [instance] type_pow
open NormedGroup opposite Profinite pseudo_normed_group category_theory breen_deligne
open profinitely_filtered_... |
1a7b640a1601be3331d48c97abb858319ff8cc0c | 1abd1ed12aa68b375cdef28959f39531c6e95b84 | /src/data/buffer/parser/basic.lean | 00905223fea94c9a302b891b0e9210aadf0e1502 | [
"Apache-2.0"
] | permissive | jumpy4/mathlib | d3829e75173012833e9f15ac16e481e17596de0f | af36f1a35f279f0e5b3c2a77647c6bf2cfd51a13 | refs/heads/master | 1,693,508,842,818 | 1,636,203,271,000 | 1,636,203,271,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 110,110 | lean | /-
Copyright (c) 2020 Yakov Pechersky. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yakov Pechersky
-/
import data.string.basic
import data.buffer.basic
import data.nat.digits
/-!
# Parsers
`parser α` is the type that describes a computation that can ingest a `char... |
6dbdd7d00dd3d5b3a97b4192b4213d0673c64291 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/real/nnreal_auto.lean | e3fafa56ce7f9a07472d10d1f8b845b25b5596c2 | [] | 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 | 26,018 | lean | /-
Copyright (c) 2018 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.algebra.linear_ordered_comm_group_with_zero
import Mathlib.algebra.big_operators.ring
impor... |
0c855989356947f212886fea043bc7dbebafbe4d | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/tactic/cache.lean | 69d850c521afe8afaac3767fcc2fe0762980b2a1 | [
"Apache-2.0"
] | permissive | waynemunro/mathlib | e3fd4ff49f4cb43d4a8ded59d17be407bc5ee552 | 065a70810b5480d584033f7bbf8e0409480c2118 | refs/heads/master | 1,693,417,182,397 | 1,634,644,781,000 | 1,634,644,781,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,234 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import tactic.doc_commands
/-!
# Instance cache tactics
For performance reasons, Lean does not automatically update its database
of class instances during a proof. T... |
3f40a1de74d38d6da3946ce1348b688737357ffd | efa51dd2edbbbbd6c34bd0ce436415eb405832e7 | /20170116_POPL/super/heapex.lean | e183d13030d1564131a36fd8caa56df9d4a0b6be | [
"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 | 1,072 | lean | import tools.super
-- This is the same example we used for ematching. (see ???)
constant heap : Type
constant ptr : Type
constant val : Type
constant pt : ptr → val → heap
constant hunion : heap → heap → heap
constant is_def : heap → Prop
infix ` ∙ `:60 := hunion
infix `↣`:70 := pt
axiom hcomm : ∀ x... |
4c48bb02b9ca79c304cab562421926503f54cf41 | 8cb37a089cdb4af3af9d8bf1002b417e407a8e9e | /library/init/logic.lean | b054cd1add6a2f549702570ee92f733812c81b59 | [
"Apache-2.0"
] | permissive | kbuzzard/lean | ae3c3db4bb462d750dbf7419b28bafb3ec983ef7 | ed1788fd674bb8991acffc8fca585ec746711928 | refs/heads/master | 1,620,983,366,617 | 1,618,937,600,000 | 1,618,937,600,000 | 359,886,396 | 1 | 0 | Apache-2.0 | 1,618,936,987,000 | 1,618,936,987,000 | null | UTF-8 | Lean | false | false | 39,006 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Jeremy Avigad, Floris van Doorn
-/
prelude
import init.core
universes u v w
@[simp] lemma opt_param_eq (α : Sort u) (default : α) : opt_param α default = α ... |
77d983ed602d777e4ac237adc2776834be51ff32 | 41ebf3cb010344adfa84907b3304db00e02db0a6 | /uexp/src/uexp/rules/decorrelateExists.lean | 80a5b53ecaa4d020b7bebfefdb59a74922bbe174 | [
"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 | 1,641 | lean | import ..sql
import ..tactics
import ..u_semiring
import ..meta.cosette_lemmas
import ..extra_constants
import ..meta.TDP
import ..meta.cosette_tactics
open Expr
open Proj
open Pred
open SQL
variable i : const datatypes.int
theorem rule :
forall (Γ scm_emp : Schema)
(rel_emp : relation scm_emp)
... |
036eab9ca4560b20084764d0a7dccdb84e1dea84 | 471bedbd023d35c9d078c2f936dd577ace7f5813 | /library/init/logic.lean | f1d67aef5226788755f3747eeb0b4eb5024b86ec | [
"Apache-2.0"
] | permissive | lambdaxymox/lean | e06f0fa503666df827edd9867d7f49ca017aae64 | fc13c8c72a15dab71a2c2b31410c2cadc3526bd7 | refs/heads/master | 1,666,785,407,985 | 1,666,153,673,000 | 1,666,153,673,000 | 310,165,986 | 0 | 0 | Apache-2.0 | 1,604,542,096,000 | 1,604,542,095,000 | null | UTF-8 | Lean | false | false | 38,948 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Jeremy Avigad, Floris van Doorn
-/
prelude
import init.core
universes u v w
@[simp] lemma opt_param_eq (α : Sort u) (default : α) : opt_param α default = α ... |
8b546166e4bc4559ce4fdca4f5fee28789df7eac | 97f752b44fd85ec3f635078a2dd125ddae7a82b6 | /hott/hit/pushout.hlean | 4d99b9d2c07aa943dbed06414fb61084df6042d6 | [
"Apache-2.0"
] | permissive | tectronics/lean | ab977ba6be0fcd46047ddbb3c8e16e7c26710701 | f38af35e0616f89c6e9d7e3eb1d48e47ee666efe | refs/heads/master | 1,532,358,526,384 | 1,456,276,623,000 | 1,456,276,623,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,617 | 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 pushout
-/
import .quotient cubical.square types.sigma
open quotient eq sum equiv equiv.ops is_trunc
namespace pushout
section
parameters {TL... |
e5b4815b3ce8395516a35c4dfc0872fbee7e8f4a | 8eeb99d0fdf8125f5d39a0ce8631653f588ee817 | /src/topology/uniform_space/cauchy.lean | 46ecf007939e85599955ac0be62c42b415d27d7c | [
"Apache-2.0"
] | permissive | jesse-michael-han/mathlib | a15c58378846011b003669354cbab7062b893cfe | fa6312e4dc971985e6b7708d99a5bc3062485c89 | refs/heads/master | 1,625,200,760,912 | 1,602,081,753,000 | 1,602,081,753,000 | 181,787,230 | 0 | 0 | null | 1,555,460,682,000 | 1,555,460,682,000 | null | UTF-8 | Lean | false | false | 26,223 | 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.uniform_space.basic
import topology.bases
import data.set.intervals
/-!
# Theory of Cauchy filters in uniform spaces. Complete uniform... |
323fb9b1dae6cd1c29e0eb53f8068f7c3c945ee4 | 6329dd15b8fd567a4737f2dacd02bd0e8c4b3ae4 | /src/game/intro.lean | 4da3239e6ef5f01ec30d7d9b275ff49750219517 | [
"Apache-2.0"
] | permissive | agusakov/mathematics_in_lean_game | 76e455a688a8826b05160c16c0490b9e3d39f071 | ad45fd42148f2203b973537adec7e8a48677ba2a | refs/heads/master | 1,666,147,402,274 | 1,592,119,137,000 | 1,592,119,137,000 | 272,111,226 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,419 | lean | /-
# Mathematics in Lean, The Game
## version Beta maybe idk
## By <a href="https://youtu.be/gXlfXirQF3A" title="Plagiarize!!" target="blank">Nikolai Ivanovich Lobachevsky</a>
*Just kidding it's mostly Kevin Buzzard and Mohammad Pedramfar*
# What is this game?
Well, it's not the natural number game. It's much worse ... |
cc132cb7642bee759b7858f59305d4834d3e0bc3 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/category_theory/monad/equiv_mon.lean | 44745ffeda1d739a1782902ad6204b9ce4dbbaa7 | [
"Apache-2.0"
] | permissive | jjgarzella/mathlib | 96a345378c4e0bf26cf604aed84f90329e4896a2 | 395d8716c3ad03747059d482090e2bb97db612c8 | refs/heads/master | 1,686,480,124,379 | 1,625,163,323,000 | 1,625,163,323,000 | 281,190,421 | 2 | 0 | Apache-2.0 | 1,595,268,170,000 | 1,595,268,169,000 | null | UTF-8 | Lean | false | false | 3,554 | lean | /-
Copyright (c) 2020 Adam Topaz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Adam Topaz
-/
import category_theory.monad.basic
import category_theory.monoidal.End
import category_theory.monoidal.Mon_
import category_theory.category.Cat
/-!
# The equivalence betwee... |
374c9711f216a05838d70d7ce00a781bb56fc322 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/data/bool.lean | b76d50eee9d4d42172f1d2f141dee27db5ce69d5 | [
"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 | 6,574 | 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, Jeremy Avigad
-/
/-!
# booleans
This file proves various trivial lemmas about booleans and their
relation to decidable propositions.
## Notations
This file... |
c29ac22cdaedc7c1819ca0c911ca1d84333168da | 367134ba5a65885e863bdc4507601606690974c1 | /src/topology/metric_space/completion.lean | 8c410f49190ea52a6857b8a9edc94af526ddb240 | [
"Apache-2.0"
] | permissive | kodyvajjha/mathlib | 9bead00e90f68269a313f45f5561766cfd8d5cad | b98af5dd79e13a38d84438b850a2e8858ec21284 | refs/heads/master | 1,624,350,366,310 | 1,615,563,062,000 | 1,615,563,062,000 | 162,666,963 | 0 | 0 | Apache-2.0 | 1,545,367,651,000 | 1,545,367,651,000 | null | UTF-8 | Lean | false | false | 8,602 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Sébastien Gouëzel
-/
import topology.uniform_space.completion
import topology.metric_space.isometry
/-!
# The completion of a metric space
Completion of uniform spaces are already ... |
1ad4dea53062f329ba80d9321d6b8245a34a6dee | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/category/Groupoid.lean | cac379bf9cb2239ad3766c537ebcd0ca406eb30c | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 4,054 | lean | /-
Copyright (c) 2019 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import category_theory.single_obj
import category_theory.limits.shapes.products
import category_theory.pi.basic
import category_theory.limits.is_limit
/-!
# Catego... |
ff5c44521c3da24c0cda081ac38aafdff58a4881 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/topology/path_connected.lean | d830dcd2ca5dfa52d7c4e9e99b27691982fd5cb6 | [] | 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 | 28,792 | lean | /-
Copyright (c) 2020 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.topology.instances.real
import Mathlib.topology.algebra.ordered.proj_Icc
import Mathlib.Pos... |
adbf9c9fe9ff6b915f7ca35761def615cadbaab8 | 556aeb81a103e9e0ac4e1fe0ce1bc6e6161c3c5e | /src/starkware/cairo/common/bool_spec.lean | cd1b180dc1e466ffbfc806a906055c702898c30d | [] | permissive | starkware-libs/formal-proofs | d6b731604461bf99e6ba820e68acca62a21709e8 | f5fa4ba6a471357fd171175183203d0b437f6527 | refs/heads/master | 1,691,085,444,753 | 1,690,507,386,000 | 1,690,507,386,000 | 410,476,629 | 32 | 9 | Apache-2.0 | 1,690,506,773,000 | 1,632,639,790,000 | Lean | UTF-8 | Lean | false | false | 720 | lean | /-
Specifications file for bool_spec.cairo
Do not modify the constant definitions, structure definitions, or automatic specifications.
Do not change the name or arguments of the user specifications and soundness theorems.
You may freely move the definitions around in the file.
You may add definitions and th... |
377cc9e3e936308fccfa6f47aa90603c0113a673 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/ring_theory/euclidean_domain.lean | 7cd5517f9684bb7b10feb8f82cb759889a0965a0 | [
"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 | 3,360 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Chris Hughes
-/
import algebra.gcd_monoid.basic
import ring_theory.coprime.basic
import ring_theory.ideal.basic
/-!
# Lemmas about Euclidean domains
Various about Euc... |
f4550ea375b081278c55f654c049061c5bc1fa2e | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/group_with_zero/units/lemmas.lean | b299f7ce0cffa8ac6d2d0b6b3cb77fe7dc32cd12 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 7,349 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import algebra.group_with_zero.commute
import algebra.hom.units
import group_theory.group_action.units
/-!
# Further lemmas about units in a `monoid_with_zero` or a ... |
dd6e4357dfa5594c073e21937e1f49adef09d380 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/fingerprint.lean | 8296af5ea95aef1271d8c129fba4213652451937 | [
"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 | 744 | lean | open tactic
meta def nat.to_expr (n : nat) : expr := reflect n
run_cmd attribute.fingerprint `reducible >>= trace
definition ex0 : nat :=
by nat.to_expr <$> attribute.fingerprint `reducible >>= exact
attribute [reducible]
definition f : nat := 10
run_cmd attribute.fingerprint `reducible >>= trace
definition ex1 : n... |
09f1115f00cd3909c3da1fa9892f5c141d46cb9c | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/ring_theory/witt_vector/frobenius.lean | 2f9692e4afaa40f21a7819bbe16da626484f0e2d | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 13,571 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import data.nat.multiplicity
import data.zmod.algebra
import ring_theory.witt_vector.basic
import ring_theory.witt_vector.is_poly
import field_theory.perfect_closure... |
d318487671e0af02f63ac9089bdc83809753d7de | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /stage0/src/Init/Data/ToString/Basic.lean | 865e916cc9dbf5ec5ea076344f9e0f43493ae00d | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | EdAyers/lean4 | 57ac632d6b0789cb91fab2170e8c9e40441221bd | 37ba0df5841bde51dbc2329da81ac23d4f6a4de4 | refs/heads/master | 1,676,463,245,298 | 1,660,619,433,000 | 1,660,619,433,000 | 183,433,437 | 1 | 0 | Apache-2.0 | 1,657,612,672,000 | 1,556,196,574,000 | Lean | UTF-8 | Lean | false | false | 4,457 | 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
import Init.Data.Nat.Div
import Init.Data.Repr
import Init.Data.Int.Basic
import Init.Data.Format... |
0329f724a8ef139a9fbc1f36ad63cbb9b289b42c | d7189ea2ef694124821b033e533f18905b5e87ef | /galois/crypto/merkle/merkle.lean | 8c045e84eefbaaaeda9a6f4722edee4ec69abd26 | [
"Apache-2.0"
] | permissive | digama0/lean-protocol-support | eaa7e6f8b8e0d5bbfff1f7f52bfb79a3b11b0f59 | cabfa3abedbdd6fdca6e2da6fbbf91a13ed48dda | refs/heads/master | 1,625,421,450,627 | 1,506,035,462,000 | 1,506,035,462,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,273 | lean | import galois.data.bounded_list
import galois.list.take_drop_lemmas
import galois.list.member
universes u v
namespace merkle
structure combine_result (Link Data : Type) :=
(root : Data)
(left : Link)
(right : Link)
/-- Operations needed to build a Merkle tree.-/
structure ops (Leaf Link Data : Type) :=
(empty_root ... |
97aeeb4dd413defd5b4a4416261db064b1295a35 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/algebra/group/basic.lean | 3f3ba7f1dea99b5952f06dc2b8da338a6a2537a6 | [
"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 | 13,603 | 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, Simon Hudon, Mario Carneiro
-/
import algebra.group.defs
import logic.function.basic
universe u
section monoid
variables {M : Type u} [monoid M]
@[t... |
ff838e641cdb7c096673149c537491f2ec516b6b | bb31430994044506fa42fd667e2d556327e18dfe | /src/measure_theory/function/locally_integrable.lean | fc98e48967e7584b6081003d9c25f60957c9ab4d | [
"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,586 | lean | /-
Copyright (c) 2022 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.integral.integrable_on
/-!
# Locally integrable functions
A function is called *locally integrable* (`measure_theory.locally_integrable`) ... |
c3931566fac2515595be2709b77c1d2080efe7c3 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/pkg/user_attr/lakefile.lean | 89e82affdff50fe42a093cb2adf96cba0e70d6a1 | [
"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 | 88 | lean | import Lake
open System Lake DSL
package user_attr
@[default_target] lean_lib UserAttr
|
17971a5b13eba7b2d94533c33ab55030a903d9fa | 96e0c08045ccd89f1e6556c1437c2ba0f560218b | /src/annihilator.lean | 95d657c0fc7527fa58a91b0e98417f48f212f237 | [] | no_license | JasonKYi/bilinear_sesquilinear_forms | 8fc78ea6716cc4b884c9ff7e27ddaa77bbd1f3f0 | d54ff4537426e180473c8091375df2e3e528693d | refs/heads/master | 1,678,081,159,270 | 1,613,904,502,000 | 1,613,904,502,000 | 329,987,442 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,734 | lean | import linear_algebra.projection
import linear_algebra.dual
universes u v w
variables {R : Type u} {M : Type v} [comm_ring R] [add_comm_group M] [module R M]
/-- The first isomorphism theorem for surjective linear maps. -/
noncomputable def linear_map.quot_ker_equiv_of_surjective
{R : Type u} {M : Type v} {M₂ : T... |
d6087e4d219a1242a25f4395b8e7e9ea6712aa54 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/category_theory/discrete_category.lean | f5278f965861abc52bfa0f5e9556f49373ab54d5 | [
"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,574 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Stephen Morgan, Scott Morrison, Floris van Doorn
-/
import category_theory.eq_to_hom
import data.ulift
/-!
# Discrete categories
We define `discrete α := α` for any type `α`, and use... |
8de1f7c387b329e010d8d42c7fb5b128302cf495 | e898bfefd5cb60a60220830c5eba68cab8d02c79 | /uexp/src/uexp/rules/transitiveInferenceNoPullUpExprs.lean | c74f0fba557450b516a7f5ac8b96d45b6ab2cc07 | [
"BSD-2-Clause"
] | permissive | kkpapa/Cosette | 9ed09e2dc4c1ecdef815c30b5501f64a7383a2ce | fda8fdbbf0de6c1be9b4104b87bbb06cede46329 | refs/heads/master | 1,584,573,128,049 | 1,526,370,422,000 | 1,526,370,422,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,549 | lean | import ..sql
import ..tactics
import ..u_semiring
import ..extra_constants
import ..ucongr
import ..TDP
open Expr
open Proj
open Pred
open SQL
open tree
open binary_operators
set_option profiler true
notation `int` := datatypes.int
variable integer_1: const datatypes.int
variable integer_7: const datatypes.int
vari... |
0dc7387d496d244ce1ef5f6b3a1176b3ac69e6c4 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/number_theory/von_mangoldt.lean | cbff35d3fb5e20b3591949a88b05307a8f8430b8 | [
"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,779 | lean | /-
Copyright (c) 2022 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta
-/
import algebra.is_prime_pow
import number_theory.arithmetic_function
import analysis.special_functions.log.basic
/-!
# The von Mangoldt Function
In this file we define... |
eef2cc1ef770167e4d491212772d8e6648468910 | 88fb7558b0636ec6b181f2a548ac11ad3919f8a5 | /library/init/meta/smt/rsimp.lean | 073e64cf9c6d11622bf3ca538bd1595a995545f5 | [
"Apache-2.0"
] | permissive | moritayasuaki/lean | 9f666c323cb6fa1f31ac597d777914aed41e3b7a | ae96ebf6ee953088c235ff7ae0e8c95066ba8001 | refs/heads/master | 1,611,135,440,814 | 1,493,852,869,000 | 1,493,852,869,000 | 90,269,903 | 0 | 0 | null | 1,493,906,291,000 | 1,493,906,291,000 | null | UTF-8 | Lean | false | false | 6,578 | 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
-/
prelude
import init.meta.smt.smt_tactic init.meta.fun_info init.meta.rb_map
open tactic
private meta def add_lemma (m : transparency) (h : name) (hs : hin... |
db726786ff5010e1025a98fa31dafec7b5a8bfc3 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/ginductive_pred.lean | 2db4af17d8611e03c7712560b1596fc9d5b9cd13 | [
"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 | 711 | lean | inductive term : Type
| var : nat → term
| app : string → list term → term
/- In the current system, it will be hard to work with mutually inductive predicates.
Reason: we cannot use well-founded recursion, and the induction principle for it
is too weak. -/
mutual inductive var_occ, var_occ_list
with var_occ : n... |
b49b36c7a458b5e0732bad7eb10e6590523f93b8 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/ring_theory/hahn_series.lean | 03abade5fa66326cd4fa6ba8269977b362baa47d | [
"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 | 61,625 | lean | /-
Copyright (c) 2021 Aaron Anderson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson
-/
import order.well_founded_set
import algebra.big_operators.finprod
import ring_theory.valuation.basic
import ring_theory.power_series.basic
import data.finsupp.pwo
im... |
7b5ff40563f1b1a507cab6c3ecdcc83fd3d265ed | 4727251e0cd73359b15b664c3170e5d754078599 | /src/set_theory/game/ordinal.lean | 93409d6988639012be8d790986d19fec95de3825 | [
"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 | 3,872 | lean | /-
Copyright (c) 2022 Violeta Hernández Palacios. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Violeta Hernández Palacios
-/
import set_theory.game.pgame
import set_theory.ordinal.basic
/-!
# Ordinals as games
We define the canonical map `ordinal → pgame`, where e... |
d6422fb5cdb4eb8cb0fb710012e38c0039f0b141 | 6b45072eb2b3db3ecaace2a7a0241ce81f815787 | /tools/auto/experiments/test1.lean | edef53f867659cd3cc0a8172bf634c9b85916047 | [] | no_license | avigad/library_dev | 27b47257382667b5eb7e6476c4f5b0d685dd3ddc | 9d8ac7c7798ca550874e90fed585caad030bbfac | refs/heads/master | 1,610,452,468,791 | 1,500,712,839,000 | 1,500,713,478,000 | 69,311,142 | 1 | 0 | null | 1,474,942,903,000 | 1,474,942,902,000 | null | UTF-8 | Lean | false | false | 4,960 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
Examples to test finish. (The designations "clarify," "safe," "iauto," etc. are
from a previous tableau prover.)
-/
import ..finish
open auto
section
variables A... |
9a42ab6f857ecd166833dea28914abb40ff0c052 | 5e3548e65f2c037cb94cd5524c90c623fbd6d46a | /IMO_2007_Pb_5.lean | c9afc5b2bba529f5a8ee7d773be8c72c80a1f06e | [] | no_license | ahayat16/lean_exos | d4f08c30adb601a06511a71b5ffb4d22d12ef77f | 682f2552d5b04a8c8eb9e4ab15f875a91b03845c | refs/heads/main | 1,693,101,073,585 | 1,636,479,336,000 | 1,636,479,336,000 | 415,000,441 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 167 | lean |
import data.pnat.basic
import number_theory.divisors
theorem IMO_2007_Pb_5 (a b: pnat) (h: ↑(4*a*b-1) ∈ (nat.divisors ((4*a^2-1)^2))): a=b :=
begin
sorry
end
|
72d0643364ed80b87829d5951b92976bb2e17232 | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/linear_algebra/finite_dimensional.lean | 48c38619fea1e32015923bb5ea8e322829f60ac1 | [
"Apache-2.0"
] | permissive | agjftucker/mathlib | d634cd0d5256b6325e3c55bb7fb2403548371707 | 87fe50de17b00af533f72a102d0adefe4a2285e8 | refs/heads/master | 1,625,378,131,941 | 1,599,166,526,000 | 1,599,166,526,000 | 160,748,509 | 0 | 0 | Apache-2.0 | 1,544,141,789,000 | 1,544,141,789,000 | null | UTF-8 | Lean | false | false | 40,665 | lean | /-
Copyright (c) 2019 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import linear_algebra.dimension
import ring_theory.principal_ideal_domain
/-!
# Finite dimensional vector spaces
Definition and basic properties of finite dimensional v... |
ef3b42a84c3abe853eb458b30ab6722998c2e0ff | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/tactic/converter/old_conv.lean | c0b9db07729becf7e2307a6a237a8d83501ebd61 | [] | 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 | 340 | 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
Converter monad for building simplifiers.
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.control.basic
import Mathlib.PostPort
... |
d78836b0a1b450433af469d0e4552d6e8b48b3d2 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/tactic13.lean | d77e4981236114e6e45e739f97cc36b8a0343994 | [
"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 | 244 | lean | import logic
open tactic
theorem tst (a b : Prop) (H : ¬ a ∨ ¬ b) (Hb : b) : ¬ a ∧ b :=
begin
apply and.intro,
assume Ha, or.elim H
(assume Hna, @absurd _ false Ha Hna)
(assume Hnb, @absurd _ false Hb Hnb),
assumption
end
|
241c77c6e0cf771080c32ee842ae639282734fbf | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /src/Lean/Compiler/LCNF/Basic.lean | 589b5fc61268b21181cec18e5409d90ec7d1f56f | [
"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 | 19,034 | lean | /-
Copyright (c) 2022 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Expr
namespace Lean.Compiler.LCNF
/-!
# Lean Compiler Normal Form (LCNF)
It is based on the [A-normal form](https://en.wikipedia.org/wiki/A-n... |
832075b272b71771781f30eff77ec61bf23ba7e0 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Compiler/IR.lean | 9fa99393158b03b7041fd348e15f88a71b0d8584 | [
"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,946 | 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.Compiler.IR.Basic
import Lean.Compiler.IR.Format
import Lean.Compiler.IR.CompilerM
import Lean.Compiler.IR.PushProj
import Lean.Compiler.IR.Elim... |
21adcc3e0332dd7881f8c3307bc8d0e242c0f5c0 | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /src/data/set/intervals/surj_on.lean | df51af5570fd15db2f9dbc442ad9528b3e4d0600 | [
"Apache-2.0"
] | permissive | dexmagic/mathlib | ff48eefc56e2412429b31d4fddd41a976eb287ce | 7a5d15a955a92a90e1d398b2281916b9c41270b2 | refs/heads/master | 1,693,481,322,046 | 1,633,360,193,000 | 1,633,360,193,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,937 | 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 data.set.intervals.basic
import data.set.function
/-!
# Monotone surjective functions are surjective on intervals
A monotone surjective function sends any ... |
d5b7795a8da1b623f483d353feaccb740b111326 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/analysis/normed_space/multilinear.lean | 73546f022c1f38279fa10222a03b838b2921c4bc | [
"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 | 79,921 | lean | /-
Copyright (c) 2020 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import analysis.normed_space.operator_norm
import topology.algebra.module.multilinear
/-!
# Operator norm on the space of continuous multilinear maps
When `f`... |
449620dba9b451206c3b7964d6f6bea0eae13fe7 | 2d34dfb0a1cc250584282618dc10ea03d3fa858e | /src/for_mathlib/tsum.lean | 118fa233fa1d974d4d8a0abc59a2b1295f4b8d4e | [] | no_license | zeta1999/lean-liquid | 61e294ec5adae959d8ee1b65d015775484ff58c2 | 96bb0fa3afc3b451bcd1fb7d974348de2f290541 | refs/heads/master | 1,676,579,150,248 | 1,610,771,445,000 | 1,610,771,445,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,024 | lean | import topology.algebra.infinite_sum
import topology.instances.nnreal
open_locale big_operators nnreal
lemma tsum_abs_eq_coe_tsum_nnabs {α : Type*} (f : α → ℝ) :
(∑' i, abs (f i)) = ∑' i, real.nnabs (f i) :=
by simp only [nnreal.coe_nnabs]
open nnreal finset
lemma has_sum_nat_add_iff'' {f : ℕ → ℝ≥0} (k : ℕ) {a : ... |
226574adda878094e88f09b3b49c5001cda98cdf | 4e0d7c3132ce31edc5829849735dd25db406b144 | /lean/love06_monads_demo.lean | e8fd27999ef80440f5110eb4f86a9bf1dd3828c1 | [] | no_license | gonzalgu/logical_verification_2020 | a0013a6c22ea254e9f4d245f2948f0f4d44df4bb | 724d0457dff2c3ff10f9ab2170388f4c5e958b75 | refs/heads/master | 1,660,886,374,533 | 1,589,859,641,000 | 1,589,859,641,000 | 256,069,971 | 0 | 0 | null | 1,586,997,430,000 | 1,586,997,429,000 | null | UTF-8 | Lean | false | false | 11,543 | lean | import .lovelib
/-! # LoVe Demo 6: Monads
We take a look at an important functional programming abstraction: monads.
Monads generalize computation with side effects. Haskell has shown that monads
can be used very successful to write imperative programs. For us, they are
interesting in three ways:
* They are a usefu... |
d552ac502e1bf359f18f7a18e46098fb8c632cfc | 592ee40978ac7604005a4e0d35bbc4b467389241 | /Library/generated/mathscheme-lean/CommutativePointedMagma.lean | 88c4e8ed2cdbe9e3b9e164fc0a73092dcd021063 | [] | 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,468 | 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 CommutativePointedMagma
structure CommutativePointedMagma (A : Type) : Type :=
(op : (A → (A → A)))
(e : A)
(commutative_op : (∀ {x y : A} , (op x y) = (... |
7e1e6b186a3147c5f9cc629e141e94ec9bd13392 | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch4/ex0208.lean | 653b1009da54d740835230de9dfccd15b88a524f | [] | 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 | 229 | lean | variable α : Type
variables a b : α
variables f g : α → ℕ
variable h₁ : a = b
variable h₂ : f = g
example : f a = f b := congr_arg f h₁
example : f a = g a := congr_fun h₂ a
example : f a = g b := congr h₂ h₁
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.