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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2bd0a5a32d75dd50e8bd4ed9f27319590b950eb5 | 4e0d7c3132ce31edc5829849735dd25db406b144 | /lean/love02_backward_proofs_demo.lean | 02880fe1ca38ab03e4581d0caa25a01eb8d5bba5 | [] | 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 | 7,755 | lean | import .love01_definitions_and_statements_demo
/-! # LoVe Demo 2: Backward Proofs
A __tactic__ operates on a proof goal and either proves it or creates new
subgoals. Tactics are a __backward__ proof mechanism: They start from the goal
and work towards the available hypotheses and lemmas. -/
set_option pp.beta true... |
6d82da2d085a74bb56e3b914dc1f4275a2d8cece | ec62863c729b7eedee77b86d974f2c529fa79d25 | /4/a.lean | 9507657f456ba3d8a544ebbb247c18126c9493ed | [] | no_license | rwbarton/advent-of-lean-4 | 2ac9b17ba708f66051e3d8cd694b0249bc433b65 | 417c7e2718253ba7148c0279fcb251b6fc291477 | refs/heads/main | 1,675,917,092,057 | 1,609,864,581,000 | 1,609,864,581,000 | 317,700,289 | 24 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 468 | lean | def isValid (para : String) : Bool :=
let fieldStrs : List String := para.split (λ c => c == ' ' || c == '\n');
let fields := List.map (λ s => s.takeWhile (λ c => c ≠ ':')) fieldStrs;
List.all ["byr", "iyr", "eyr", "hgt", "hcl", "ecl", "pid"] (λ f => fields.elem f)
def solve (input : String) : Int :=
let paras := inpu... |
9eba7c882d84f60909f667410456a3cd1e0bd5a6 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/394.lean | 7b09bfb15b37fe08b9ba2a6f7be349704fb2fbc3 | [
"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 | 316 | lean | def casesTFOn {motive : Prop → Sort _} (P) [inst : Decidable P] : (T : motive True) → (F : motive False) → motive P :=
λ ht hf => match inst with
| isTrue H => eq_true H ▸ ht
| isFalse H => eq_false H ▸ hf
example (P) [Decidable P] : ¬¬P → P := by
induction P using casesTFOn
admit
admit
|
0dd8866a747d262ac25ade3d756bffc5bacaf7d7 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/category_theory/subobject/lattice.lean | 5b8ddf5c71f67ae9e4fe28f5a5f4eeca651d1cb5 | [
"Apache-2.0"
] | permissive | AntoineChambert-Loir/mathlib | 64aabb896129885f12296a799818061bc90da1ff | 07be904260ab6e36a5769680b6012f03a4727134 | refs/heads/master | 1,693,187,631,771 | 1,636,719,886,000 | 1,636,719,886,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 22,451 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta, Scott Morrison
-/
import category_theory.subobject.factor_thru
import category_theory.subobject.well_powered
/-!
# The lattice of subobjects
We provide the `semilattice... |
40791cf19aeb2e4e6df1a43d282d3da3d0d390bc | f1b175e38ffc5cc1c7c5551a72d0dbaf70786f83 | /analysis/measure_theory/measure_space.lean | 0f0f1a2a78b0b86dc5bf0d769d756cfd662a815e | [
"Apache-2.0"
] | permissive | mjendrusch/mathlib | df3ae884dd5ce38c7edf452bcbfd3baf4e3a6214 | 5c209edb7eb616a26f64efe3500f2b1ba95b8d55 | refs/heads/master | 1,585,663,284,800 | 1,539,062,055,000 | 1,539,062,055,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 25,263 | 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
Measure spaces -- measures
Measures are restricted to a measurable space (associated by the type class `measurable_space`).
This allows us to prove equ... |
775d15eb82d879450d55f545b016dea2688c4274 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/analysis/convex/strict.lean | 8b9d0655d2936d379f2908956d4f3a15bd902003 | [
"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 | 15,547 | lean | /-
Copyright (c) 2021 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies
-/
import analysis.convex.basic
import topology.algebra.order.group
/-!
# Strictly convex sets
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file requir... |
13c444ab8e8e00372d65d43bc3a3709f553ef1d0 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/ring_theory/coprime/lemmas.lean | 6d6c98a25f7ac446b3cd67fa5adf4b70a2f595b9 | [
"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 | 8,298 | lean | /-
Copyright (c) 2020 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Ken Lee, Chris Hughes
-/
import algebra.big_operators.ring
import data.fintype.basic
import data.int.gcd
import ring_theory.coprime.basic
/-!
# Additional lemmas about elements ... |
70f670ac1a19544995c41fae38da53f47521c08e | f4bff2062c030df03d65e8b69c88f79b63a359d8 | /src/game/functions/bothBijective.lean | cd23364e567b1a17f4a47d5f1c713290e77bfedd | [
"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,018 | lean | import data.real.basic
import game.functions.bothInjective game.functions.bothSurjective
open function
/-
# Chapter 6 : Functions
## Level 3
Be sure to make use of the results in the previous two levels.
-/
/- Lemma
If $f : X \to Y$ and $g : Y \to Z$ are both bijective functions, then
the function resulting from th... |
f918dc01d35c3d6736685f78f854e09d12efa1f7 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/data/rbmap/basic.lean | d20b1c8801db684cde3a94e2433a7dbdab6f135f | [] | 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 | 5,272 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.data.rbtree.basic
universes u v w
namespace Mathlib
def rbmap_lt {α : Type u} {β : Type v} (lt : α... |
f7c441cbe9b120b76d611cd1ddd453faf167c93d | 3618c6e11aa822fd542440674dfb9a7b9921dba0 | /src/multirelation/approach2/test.lean | 3dd848265beb7fe3294fef276739781f3a25529b | [] | no_license | ChrisHughes24/single_relation | 99ceedcc02d236ce46d6c65d72caa669857533c5 | 057e157a59de6d0e43b50fcb537d66792ec20450 | refs/heads/master | 1,683,652,062,698 | 1,683,360,089,000 | 1,683,360,089,000 | 279,346,432 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,020 | lean | import .tactic
set_option profiler true
variables {G : Type} [group G]
(a b c d e f g h i j k l m n o p q r s t u v w x y z : G)
lemma test1
(h₁ : a * b^2 = b * a)
(h₂ : b * a^2 = a * b) :
a = 1 :=
begin
group_rel [h₁, h₂],
end
lemma test2 (h : a * b * a⁻¹ = 1) : b = 1 :=
by group_rel [h]
lemma test3 (h... |
cf599d9bee52d38e2597e28994536435b5a1f4c8 | 43390109ab88557e6090f3245c47479c123ee500 | /src/classical_logic/predicate_lemmas.lean | 1ab979d75e9654b399b4ee51f3ed63cef9c05a3d | [
"Apache-2.0"
] | permissive | Ja1941/xena-UROP-2018 | 41f0956519f94d56b8bf6834a8d39473f4923200 | b111fb87f343cf79eca3b886f99ee15c1dd9884b | refs/heads/master | 1,662,355,955,139 | 1,590,577,325,000 | 1,590,577,325,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,486 | lean | open classical
variables { α : Type } { p q : α → Prop }
variable { a : α }
variable { r: Prop }
theorem not_all_iff_ex_not : (¬ ∀ x, p x) ↔ (∃ x, ¬ p x) :=
by { split; intro h,
{ apply by_contradiction, intro h1, apply h,
intro h2, apply by_contradiction, intro h3,
apply h1, split, exact h3 },
... |
de230ccf5ef6045d59fdb0829f8654f3fff5f216 | eb586f8ae80b7045ba4ff08f1c7ba69403d61081 | /src/algebraic_countable_over_Z.lean | 54dbd383954f5843dcb88cfb765ee59b3ec1d0ec | [] | no_license | bryangingechen/transcendental | 926584f58c47d766b304d39d1aa6814284535394 | 3692ac5ebe85e49c5f65bc7f2ea4f873a973bac2 | refs/heads/master | 1,668,733,660,442 | 1,594,269,161,000 | 1,594,269,161,000 | 278,266,099 | 0 | 0 | null | 1,594,270,314,000 | 1,594,270,313,000 | null | UTF-8 | Lean | false | false | 35,620 | lean | import ring_theory.algebraic
import data.real.cardinality
import tactic
noncomputable theory
open_locale classical
/--
- For the purpose of this project, we define a real number $x$ to be algebraic if and only if
there is a non-zero polynomial $p ∈ ℤ[T]$ such that $p(x)=0$.
- `algebraic_set` is the set of all algeb... |
6b944782a96f0e1ce8ece62adce13576054bd0bf | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/data/list/nodup.lean | 8d3730a93baeb21a4399882127ab7dce9bdcd37d | [
"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 | 13,826 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Kenny Lau
-/
import data.list.pairwise
import data.list.forall2
/-!
# Lists with no duplicates
`list.nodup` is defined in `data/list/defs`. In this file we prove vari... |
ba8720f3fc6b6f1fe6e400f3670264a2a30a5666 | 853df553b1d6ca524e3f0a79aedd32dde5d27ec3 | /src/tactic/core.lean | d1b9a81a1f2aef45815b4269903a0c6c1b919d5d | [
"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 | 83,727 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Simon Hudon, Scott Morrison, Keeley Hoek
-/
import data.dlist.basic
import control.basic
import meta.expr
import meta.rb_map
import data.bool
import tactic.lean_core_do... |
a136923d7989aecd64562cb8b8c1c1755addd335 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/order/monotone.lean | e28880513f4b75d19bd7e943b4220947b51a8020 | [
"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 | 29,896 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Mario Carneiro, Yaël Dillies
-/
import order.compare
import order.max
import order.rel_classes
/-!
# Monotonicity
This file defines (strictly) monotone/antitone functio... |
06dcc55e69be6083a9e19ce221e4cf9cb3d241f5 | 7b66d83f3b69dae0a3dfb684d7ebe5e9e3f3c913 | /src/exercises_sources/friday/topology.lean | eb4df696a1356c70eefc98e7016a82204febad9a | [] | permissive | dpochekutov/lftcm2020 | 58a09e10f0e638075b97884d3c2612eb90296adb | cdfbf1ac089f21058e523db73f2476c9c98ed16a | refs/heads/master | 1,669,226,265,076 | 1,594,629,725,000 | 1,594,629,725,000 | 279,213,346 | 1 | 0 | MIT | 1,594,622,757,000 | 1,594,615,843,000 | null | UTF-8 | Lean | false | false | 12,130 | lean | import topology.metric_space.basic
open_locale classical filter topological_space
namespace lftcm
open filter set
/-!
# Filters
## Definition of filters
-/
def principal {α : Type*} (s : set α) : filter α :=
{ sets := {t | s ⊆ t},
univ_sets := begin
sorry
end,
sets_of_superset := begin
sorry
end,
... |
e7bf127ea3d4cad1aa1cdb1ac25ca88a40a8cbe1 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/playground/eval.lean | 12890df42d927c72a0d26f0c87ee5c3dbf7889e9 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 1,109 | lean | import init.lean.name
open Lean
abbrev ConstantTable (α : Type) := HashMap Name α
def mkSimpleFnTable : IO (IO.Ref (ConstantTable (Nat → Nat))) :=
IO.mkRef {}
@[init mkSimpleFnTable]
constant simpleFnTable : IO.Ref (ConstantTable (Nat → Nat)) := default _
def registerSimpleFn (n : Name) (fn : Nat → Nat) : IO Unit :... |
50f45be2bb21c8d5ca06d7cbd4c2a04ce8d3d80b | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/eta_bug.lean | d1078f875724c869a6d2a20cacdceb2f76e714bd | [
"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 | 145 | lean | --
eval λ (A : Type*) (x y : A) (H₁ : x = y) (H₂ : y = x), eq.trans H₁ H₂
-- Should not reduce to
-- λ (A : Type*) (x y : A), eq.trans
|
d02fba4e0b41118bf31809ca2f173954448c1208 | 3994e03e14a3cbe3858c1098d0ab9ed1113d6666 | /06-formalizacija-dokazov/davorin.lean | 470bf2add31be1287b3d07c1dc910a69ca94108e | [] | no_license | tadejpetric/tpj-coq | 15f2548ba8f012d9a5b5e0bfb78ab0860d048e96 | dda9fb2e635f9a1302739e34d8692a4252066b76 | refs/heads/master | 1,629,182,614,649 | 1,600,449,570,000 | 1,600,449,570,000 | 222,798,649 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,092 | lean | inductive natu : Type
| Zer : natu
| Suc : natu -> natu
#check natu.rec
theorem t1 : ∀ p q r : Prop, (p->(q->r)) ↔ (p ∧ q) -> r :=
begin
intros,
apply iff.intro,
{
intros,
apply a,
cases a_1,
assumption,
cases a_1,
assumption,
},
{
intros,
... |
2fdfdb9af933d33ae23474774c62211b04e43e7f | 0ed3609caf1962115b28aeb010d2bda5f67ddc4c | /src/data/fin.lean | da46b85279d4efe55b581e5d1caecf01d066b9a0 | [
"Apache-2.0"
] | permissive | jonaslippert/mathlib | 82dba29632969e3ed1c153a6454306f6bc9d9037 | 1435a196db69a7886a11e310e8923f3dcf249b81 | refs/heads/master | 1,609,938,673,069 | 1,582,018,388,000 | 1,582,018,388,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 23,499 | lean | /-
Copyright (c) 2017 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis, Keeley Hoek
More about finite numbers.
-/
import data.nat.basic
universe u
open fin nat function
/-- `fin 0` is empty -/
def fin_zero_elim {C : Sort*} : fin 0 → C ... |
d70583e549ddb5b65cee6592640712df03742dba | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/topology/alexandroff.lean | dac07a9dacc39282ac9574ddb15e0fe01a6b6da0 | [
"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 | 18,691 | lean | /-
Copyright (c) 2021 Yourong Zang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yourong Zang, Yury Kudryashov
-/
import topology.separation
import topology.sets.opens
/-!
# The Alexandroff Compactification
We construct the Alexandroff compactification (the one-poi... |
ab32e9bf794dc307490cb84db172e24d98e66b4f | 626e312b5c1cb2d88fca108f5933076012633192 | /src/data/nat/basic.lean | d57f78763ea2a44d7c7e61ccf75e6158062060e9 | [
"Apache-2.0"
] | permissive | Bioye97/mathlib | 9db2f9ee54418d29dd06996279ba9dc874fd6beb | 782a20a27ee83b523f801ff34efb1a9557085019 | refs/heads/master | 1,690,305,956,488 | 1,631,067,774,000 | 1,631,067,774,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 58,455 | lean | /-
Copyright (c) 2014 Floris van Doorn (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Leonardo de Moura, Jeremy Avigad, Mario Carneiro
-/
import algebra.ordered_ring
import algebra.ordered_sub
/-!
# Basic operations on... |
b920be14c58fd01e90d36238093f828b4314765e | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/category_theory/limits/lattice.lean | 21b98764fc46ea5a552008290ab94699bbe3167b | [
"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 | 2,434 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.limits.shapes.finite_limits
import order.complete_lattice
universes u
open category_theory
namespace category_theory.limits
variables {α : ... |
15826a97b76f1437a595831e6868dcd8f4b534b5 | aa5a655c05e5359a70646b7154e7cac59f0b4132 | /stage0/src/Lean/MetavarContext.lean | 435fd7fb3c46f2f2393eb412e5ecf957af9d0921 | [
"Apache-2.0"
] | permissive | lambdaxymox/lean4 | ae943c960a42247e06eff25c35338268d07454cb | 278d47c77270664ef29715faab467feac8a0f446 | refs/heads/master | 1,677,891,867,340 | 1,612,500,005,000 | 1,612,500,005,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 53,333 | 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.Util.MonadCache
import Lean.LocalContext
namespace Lean
/-
The metavariable context stores metavariable declarations and their
assignments. It... |
0719b902c8e8f298b44001337d51dc64350c5bd7 | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /src/Lean/Meta/SynthInstance.lean | 2cf607f805299092935ff7b74065f3e66c79c482 | [
"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 | 34,761 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Daniel Selsam, Leonardo de Moura
Type class instance synthesizer using tabled resolution.
-/
import Lean.Meta.Basic
import Lean.Meta.Instances
import Lean.Meta.AbstractMVars
im... |
d0904fdc032d1590944af2cf5f94e956b3a95d4c | ff5230333a701471f46c57e8c115a073ebaaa448 | /library/system/io_interface.lean | 8d6417a6405313e873cbe264db439b2c453ad3b7 | [
"Apache-2.0"
] | permissive | stanford-cs242/lean | f81721d2b5d00bc175f2e58c57b710d465e6c858 | 7bd861261f4a37326dcf8d7a17f1f1f330e4548c | refs/heads/master | 1,600,957,431,849 | 1,576,465,093,000 | 1,576,465,093,000 | 225,779,423 | 0 | 3 | Apache-2.0 | 1,575,433,936,000 | 1,575,433,935,000 | null | UTF-8 | Lean | false | false | 4,206 | 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
-/
import data.buffer system.random
inductive io.error
| other : string → io.error
| sys : nat → io.error
inductive io.mode
| read | write | read_w... |
27dcdb938b323a93c561ce1cb1cadf01c978f5a9 | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /library/logic/axioms/examples/diaconescu.lean | c013033415265b6cef893774c33344b3b20da657 | [
"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,691 | 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
import logic.axioms.hilbert logic.eq
open eq.ops nonempty inhabited
-- Diaconescu’s theorem
-- Show that Excluded middle follows from
-- Hilbert's cho... |
ee1e79d03977fc06783c0437b37c3aad3828f108 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/topology/vector_bundle/basic.lean | 67da394c060e5d02251aaeba4d59a142a66ccdd4 | [
"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 | 42,361 | lean | /-
Copyright © 2020 Nicolò Cavalleri. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nicolò Cavalleri, Sebastien Gouezel, Heather Macbeth, Patrick Massot, Floris van Doorn
-/
import analysis.normed_space.bounded_linear_maps
import topology.fiber_bundle.basic
/-!
# Ve... |
02ccb2fbe795c5ca47871fd565f4b9233fbec630 | 2a70b774d16dbdf5a533432ee0ebab6838df0948 | /_target/deps/mathlib/src/linear_algebra/alternating.lean | b20ecc22a0d3bf266fcf50657f3bca5b08220c6c | [
"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 | 15,731 | lean | /-
Copyright (c) 2020 Zhangir Azerbayev. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Eric Wieser, Zhangir Azerbayev
-/
import linear_algebra.multilinear
import linear_algebra.linear_independent
import group_theory.perm.sign
/-!
# Alternating Maps
We construct the ... |
ca77170a390ed10ee5ea7688220929ced4235f28 | fecda8e6b848337561d6467a1e30cf23176d6ad0 | /src/linear_algebra/basic.lean | 7c944f9d62a4735d72014add26fa1d4f9bf85ce4 | [
"Apache-2.0"
] | permissive | spolu/mathlib | bacf18c3d2a561d00ecdc9413187729dd1f705ed | 480c92cdfe1cf3c2d083abded87e82162e8814f4 | refs/heads/master | 1,671,684,094,325 | 1,600,736,045,000 | 1,600,736,045,000 | 297,564,749 | 1 | 0 | null | 1,600,758,368,000 | 1,600,758,367,000 | null | UTF-8 | Lean | false | false | 104,372 | 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, Kevin Buzzard, Yury Kudryashov
-/
import algebra.big_operators.pi
import algebra.module.pi
import algebra.module.prod
import algebra.module.submodule
im... |
50c753890986cb0754a398f9684d3f99b417c92f | 947b78d97130d56365ae2ec264df196ce769371a | /src/Lean/Elab/Tactic/Injection.lean | 1ac6f0e2324f755467b57a861e14b0e229a50cf4 | [
"Apache-2.0"
] | permissive | shyamalschandra/lean4 | 27044812be8698f0c79147615b1d5090b9f4b037 | 6e7a883b21eaf62831e8111b251dc9b18f40e604 | refs/heads/master | 1,671,417,126,371 | 1,601,859,995,000 | 1,601,860,020,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,252 | 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.Injection
import Lean.Elab.Tactic.ElabTerm
namespace Lean
namespace Elab
namespace Tactic
-- optional (" with " >> many1 ident')
p... |
52f86ea9d3a83c9db5f368ce462b04358b22e8c4 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/measure_theory/integration.lean | 9888b62eb197725db6161465e9bf716c6003684f | [
"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 | 98,235 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Johannes Hölzl
-/
import measure_theory.measure_space
import measure_theory.borel_space
import algebra.indicator_function
import algebra.support
/-!
# Lebesgue integra... |
650028a31230af312f76d04b9013ec97f2e926a6 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/809b.lean | 3b4197664d4c696cf98baec106f1d589eb5d524e | [
"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 | 375 | lean | import algebra.ring data.finset
open finset nat algebra
constant A : Type₁
constants a b : A
axiom decA : decidable_eq A
attribute decA [instance]
notation 5 := a
notation 5 := b
definition foo1 : finset nat :=
'{ 1, 2, 5, 5 }
definition foo2 : finset nat :=
'{ 1, 2, 3 }
definition foo3 : finset nat :=
'{ 1 }
nonc... |
9277e9599d65aa0b9c2eb2a893ed8db87eccf1f2 | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /library/logic/axioms/hilbert.lean | e844e3f188056b37cdc2591c788063102c5dc05f | [
"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 | 2,655 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: logic.axioms.hilbert
Authors: Leonardo de Moura, Jeremy Avigad
Follows Coq.Logic.ClassicalEpsilon (but our definition of "inhabited" is the constructive one).
-/
import logic.q... |
c8626f8f2f576429880b327c1a0cedbad0ebe23e | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /stage0/src/Lean/Server/Completion.lean | 717c1e0c80806c6110c0313a7c5eab89d7e30c95 | [
"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 | 22,318 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Environment
import Lean.Parser.Term
import Lean.Data.FuzzyMatching
import Lean.Data.Lsp.LanguageFeatures
import Lean.Data.Lsp.Capabilities
impor... |
eabb7fb7060cd3b14867cf653c49076480582d55 | 4875cfbb5f2115721bd194f1dc4d418a8ef9fb01 | /folklore/real_axiom.lean | aae773da48adc465cee899e7dad5f0d62a604163 | [
"CC-BY-4.0"
] | permissive | Kha/formalabstracts | 71f399c91b92148fea500edada8b12393040abf9 | 5f00ab2de2b22aa4c3011f6f8b87b76114368dd1 | refs/heads/master | 1,611,263,396,157 | 1,501,147,842,000 | 1,501,147,901,000 | 98,518,583 | 0 | 0 | null | 1,501,147,728,000 | 1,501,147,728,000 | null | UTF-8 | Lean | false | false | 5,666 | lean | /-
axiomatic development of the complete ordered field
of real numbers in classical logic.
At some point this should be replaced with an actual
construction.
T.Hales, July 15, 2017
-/
import meta_data
import data.list data.vector
noncomputable theory
namespace real_axiom
open classical nat int list vector
local a... |
8dfc2d702fcad25dd5761dc7768b14ba64dc0aae | c777c32c8e484e195053731103c5e52af26a25d1 | /src/order/category/HeytAlg.lean | efea6f68b1608f21309e20745297c76e45fbad62 | [
"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 | 1,752 | lean | /-
Copyright (c) 2022 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies
-/
import order.category.BddDistLat
import order.heyting.hom
/-!
# The category of Heyting algebras
This file defines `HeytAlg`, the category of Heyting algebras.
-/
univ... |
0e00836212096443110f370f270f1e634d48af8b | 22e97a5d648fc451e25a06c668dc03ac7ed7bc25 | /src/algebra/group/basic.lean | 4c64c43d3449e5a28c81af2b89719de6a4744422 | [
"Apache-2.0"
] | permissive | keeferrowan/mathlib | f2818da875dbc7780830d09bd4c526b0764a4e50 | aad2dfc40e8e6a7e258287a7c1580318e865817e | refs/heads/master | 1,661,736,426,952 | 1,590,438,032,000 | 1,590,438,032,000 | 266,892,663 | 0 | 0 | Apache-2.0 | 1,590,445,835,000 | 1,590,445,835,000 | null | UTF-8 | Lean | false | false | 21,355 | 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.to_additive
import tactic.simpa
import logic.function.basic
set_option default_priority 100
set_op... |
1bed219ead009b76bd5855b2d8e38f430d786e9a | b7f22e51856f4989b970961f794f1c435f9b8f78 | /library/data/nat/find.lean | c6dab51271079233219ac22d00c508f5026138c0 | [
"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 | 3,604 | 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
Choice function for decidable predicates on natural numbers.
This module provides the following two declarations:
choose {p : nat → Prop} [d : decidabl... |
59f0f369e15c7032cb48d3be6a1e8eaf11613b80 | 618003631150032a5676f229d13a079ac875ff77 | /src/topology/local_extr.lean | a75e8033bb6bd0e0048229e2a92cc4d0e198ca4b | [
"Apache-2.0"
] | permissive | awainverse/mathlib | 939b68c8486df66cfda64d327ad3d9165248c777 | ea76bd8f3ca0a8bf0a166a06a475b10663dec44a | refs/heads/master | 1,659,592,962,036 | 1,590,987,592,000 | 1,590,987,592,000 | 268,436,019 | 1 | 0 | Apache-2.0 | 1,590,990,500,000 | 1,590,990,500,000 | null | UTF-8 | Lean | false | false | 14,839 | 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.extr
import topology.continuous_on
/-!
# Local extrema of functions on topological spaces
## Main definitions
This file defines special versi... |
ecceecb6a258f6671dd3ce8b33857bded3e15fdd | 03577f7aaac416af2e8f734149669af300dc499c | /lean_exercises/ex2.lean | 8df7ab35c3678caf3d0753420ed296c9f40a81ee | [] | no_license | nymarya/algorithms | b4dc73389de588e6934da15b0e0b67ae354907aa | 1df987f82273a8ffe2b2042552bbb1428bf165bf | refs/heads/master | 1,609,629,118,479 | 1,600,087,537,000 | 1,600,087,537,000 | 99,489,969 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 438 | lean | -- Formalize em LEAN os axiomas para a Teoria de Grupos.
variables (α : Type)
variables (a b c e : α )
-- relation
variable p: α → α → α
local infix `+` := p
-- axioms
axiom closure: ∀ x y : α, ∃ c : α , ( a + b = c )
axiom ass : ∀ a b c : α , (a + ( b + c) = ( a + b) + c)
axiom group_id : ∃ e : α , ∀ x : α... |
432f98e93f84b85b8f804c55ed71320045abe089 | 367134ba5a65885e863bdc4507601606690974c1 | /src/ring_theory/polynomial/scale_roots.lean | c7fd4a443fddd24405e47509520e715be2d72039 | [
"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 | 5,307 | lean | /-
Copyright (c) 2020 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen, Devon Tuma
-/
import ring_theory.polynomial.basic
import ring_theory.non_zero_divisors
/-!
# Scaling the roots of a polynomial
This file defines `scale_roots p s` for a po... |
21ef9ab2cdb527517cef5da7118351b7999cc8e8 | 4950bf76e5ae40ba9f8491647d0b6f228ddce173 | /src/linear_algebra/finite_dimensional.lean | 069f9a1d3caacff83adae75fb176b77f56c828dc | [
"Apache-2.0"
] | permissive | ntzwq/mathlib | ca50b21079b0a7c6781c34b62199a396dd00cee2 | 36eec1a98f22df82eaccd354a758ef8576af2a7f | refs/heads/master | 1,675,193,391,478 | 1,607,822,996,000 | 1,607,822,996,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 52,705 | 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
import algebra.algebra.subalgebra
/-!
# Finite dimensional vector spaces
Definition and basic ... |
4c252a3b4b1f6d31f4410725fe9754604fa2fd13 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/analysis/special_functions/complex/circle.lean | 9da2facb23e5753ccf31a40f6deda64227ebcf71 | [
"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,269 | lean | /-
Copyright (c) 2021 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov
-/
import analysis.complex.circle
import analysis.special_functions.complex.log
/-!
# Maps on the unit circle
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any ... |
095edc837caf2e5eff770bace60b3db809403cd0 | f5f7e6fae601a5fe3cac7cc3ed353ed781d62419 | /src/category_theory/category.lean | fc3754dcdb13e3553480b8483ca09cee22522ce8 | [
"Apache-2.0"
] | permissive | EdAyers/mathlib | 9ecfb2f14bd6caad748b64c9c131befbff0fb4e0 | ca5d4c1f16f9c451cf7170b10105d0051db79e1b | refs/heads/master | 1,626,189,395,845 | 1,555,284,396,000 | 1,555,284,396,000 | 144,004,030 | 0 | 0 | Apache-2.0 | 1,533,727,664,000 | 1,533,727,663,000 | null | UTF-8 | Lean | false | false | 5,310 | 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, Johannes Hölzl, Reid Barton
Defines a category, as a typeclass parametrised by the type of objects.
Introduces notations
`X ⟶ Y` for the morphism spa... |
50683f44c97c7363eb53ee4a08d17b5d6b3582dd | 32025d5c2d6e33ad3b6dd8a3c91e1e838066a7f7 | /stage0/src/Init/Control/Monad.lean | dcb0eb6bbc7f1da27945a0a699be9050c28e2039 | [
"Apache-2.0"
] | permissive | walterhu1015/lean4 | b2c71b688975177402758924eaa513475ed6ce72 | 2214d81e84646a905d0b20b032c89caf89c737ad | refs/heads/master | 1,671,342,096,906 | 1,599,695,985,000 | 1,599,695,985,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,081 | lean | /-
Copyright (c) Luke Nelson and Jared Roesch. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Luke Nelson, Jared Roesch, Sebastian Ullrich
-/
prelude
import Init.Control.Applicative
import Init.Coe
universes u v w
open Function
class HasBind (m : T... |
936b685e2f80c8bbe68a9390738c00ee6c91ad35 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /library/init/funext.lean | 33081544a9a4f2616ba0123d99a2d8c4f830fad6 | [
"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 | 2,070 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad
Extensional equality for functions, and a proof of function extensionality from quotients.
-/
prelude
import init.data.quot init.logic
universes u v
namespace fu... |
d7ee0c99e1604e42f824fa6183eef316f26b0bed | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/def20.lean | 9e1bf81d4b3e45eae68fc985167943cb98205b7f | [
"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 | 955 | lean | def f : Char → Nat
| 'a' => 0
| 'b' => 1
| 'c' => 2
| 'd' => 3
| 'e' => 4
| _ => 5
theorem ex1 : (f 'a', f 'b', f 'c', f 'd', f 'e', f 'f') = (0, 1, 2, 3, 4, 5) :=
rfl
def g : Nat → Nat
| 100000 => 0
| 200000 => 1
| 300000 => 2
| 400000 => 3
| _ => 5
theorem ex2 : (g 100000, g 200000, g 300000, g 400000, g 0)... |
72468cd218cd94e916ade446ebcd635bdbf8005b | f3849be5d845a1cb97680f0bbbe03b85518312f0 | /library/init/meta/lean/parser.lean | 98456b8b0d8bac650d6cc5add12cd8eca769081c | [
"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 | 2,412 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
-/
prelude
import init.meta.tactic
namespace lean
-- TODO: make inspectable (and pure)
meta constant parser_state : Type
meta constant parser_state.cur_pos :... |
c805046c9ed4ab220c07e9c7c94dcd1c35d8ed02 | 367134ba5a65885e863bdc4507601606690974c1 | /src/algebra/category/Group/limits.lean | 877f0ec4b75df4f786e04fc907cecd81ec82cfaf | [
"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 | 9,718 | 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 algebra.category.Mon.limits
import algebra.category.Group.preadditive
import category_theory.over
import category_theory.limits.concrete_category
import catego... |
96816a1ba9924e0128f70a7b6d9ea3a42fa30489 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/analysis/normed_space/continuous_affine_map.lean | 14986351347f33b81c5745a49d8596ab20a0c4c8 | [
"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 | 9,559 | lean | /-
Copyright (c) 2021 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import topology.algebra.continuous_affine_map
import analysis.normed_space.add_torsor
import analysis.normed_space.affine_isometry
import analysis.normed_space.operator_nor... |
b1b3c9a76133c80cd3af16efdd3cda3332155111 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/geometry/euclidean/triangle.lean | 206f9f51dc9d7a0ac3751fc96a0236090b41a8c0 | [
"Apache-2.0"
] | permissive | lacker/mathlib | f2439c743c4f8eb413ec589430c82d0f73b2d539 | ddf7563ac69d42cfa4a1bfe41db1fed521bd795f | refs/heads/master | 1,671,948,326,773 | 1,601,479,268,000 | 1,601,479,268,000 | 298,686,743 | 0 | 0 | Apache-2.0 | 1,601,070,794,000 | 1,601,070,794,000 | null | UTF-8 | Lean | false | false | 17,080 | lean | /-
Copyright (c) 2020 Joseph Myers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Joseph Myers.
-/
import geometry.euclidean.basic
import tactic.interval_cases
noncomputable theory
open_locale big_operators
open_locale classical
open_locale real
/-!
# Triangles
This... |
7e197d01bcbc1b3c9090129f19dbf059ec7a3798 | 5ae26df177f810c5006841e9c73dc56e01b978d7 | /src/data/set/countable.lean | 2e74c30d6fb817623ed41124e891e8964b341b9b | [
"Apache-2.0"
] | permissive | ChrisHughes24/mathlib | 98322577c460bc6b1fe5c21f42ce33ad1c3e5558 | a2a867e827c2a6702beb9efc2b9282bd801d5f9a | refs/heads/master | 1,583,848,251,477 | 1,565,164,247,000 | 1,565,164,247,000 | 129,409,993 | 0 | 1 | Apache-2.0 | 1,565,164,817,000 | 1,523,628,059,000 | Lean | UTF-8 | Lean | false | false | 7,419 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Johannes Hölzl
Countable sets.
-/
import data.equiv.list data.set.finite logic.function data.set.function
noncomputable theory
open function set encodable
open classical (hiding som... |
753777f611baef463ab5230d8feebc99a98a4841 | ce89339993655da64b6ccb555c837ce6c10f9ef4 | /bluejam/topprover/14.lean | ef1ec4626af5418290442f47b2b9b46fe1173010 | [] | no_license | zeptometer/LearnLean | ef32dc36a22119f18d843f548d0bb42f907bff5d | bb84d5dbe521127ba134d4dbf9559b294a80b9f7 | refs/heads/master | 1,625,710,824,322 | 1,601,382,570,000 | 1,601,382,570,000 | 195,228,870 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,170 | lean | open nat
def mod2 : nat → nat
| 0 := 0
| (succ n) :=
match mod2 n with
| 0 := 1
| (succ n) := 0
end
lemma add2 : ∀ (n : nat), mod2 (n + 2) = mod2 n :=
begin
intros,
unfold mod2,
induction n,
simp [mod2],
simp [mod2, n_ih]
end
lemma lem : ∀ (k n: nat), mod2 (n + k + k) = mod2 n :=
begin
intro... |
9df1632d3117be268afa9ddf99e2d9fc9a9c31d3 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /stage0/src/Lean/Parser/Basic.lean | 79397a16194ca922628f155111058f79f26c84c2 | [
"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 | 74,334 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Sebastian Ullrich
-/
import Lean.Data.Trie
import Lean.Data.Position
import Lean.Syntax
import Lean.ToExpr
import Lean.Environment
import Lean.Attributes
impo... |
6c29ca48e59c4bfa824ccedbb1088ea2884d805b | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/computedFieldsCode.lean | 5f306667cb5ab77dba29e07692b22c78ae502e34 | [
"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 | 881 | lean | set_option trace.compiler.ir.result true
-- All generated case and ctor instructions should use the _impl version
inductive Exp
| var (i : UInt32)
| app (a b : Exp)
| a1
| a2
| a3
| a4
| a5
with
@[computed_field] hash : Exp → UInt64
| .var i => Hashable.hash i + 1000
| .app a b => mixHash (has... |
23fb1e18051f5e2ee0a27525c008c8ec7b2549cb | 9028d228ac200bbefe3a711342514dd4e4458bff | /src/set_theory/ordinal_notation.lean | 57a5fa182e9d0db0aa3d114526d23fb2fe819091 | [
"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 | 35,930 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
-/
import set_theory.ordinal_arithmetic
/-!
# Ordinal notations
constructive ordinal arithmetic for ordinals `< ε₀`.
-/
open ordinal
open_locale ordinal -- get notati... |
27cb12a3e8fc7913ce03d4a47dcf375b4632670b | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/parserPrio.lean | 1f3c99ec520285f253e457af056150e9ad17599c | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 1,059 | lean | --
-- New notation that overlaps with existing notation
syntax (name := myPair) (priority := high) "(" term "," term ")" : term
macro_rules (kind := myPair)
| `(($a, $b)) => `([$a, $b])
#eval (1, 2) -- not ambiguous since myPair parser has higher priority
theorem ex1 : (1, 2) = [1, 2] :=
rfl
-- Define macro for ex... |
4d7c7fe65683ded0a54782dea0766dff33470618 | aa44b2a5876642f9460205af61a5449b74465655 | /src/plausibility_check.lean | 5a1c797a35a743323e0d2522a6dfaf4597402994 | [] | no_license | robertylewis/mathematica_examples | d129d67de147dc2792dcf0b6b70fac9b2eaf8274 | e317381c49db032accef2a92e7650d029952ad76 | refs/heads/master | 1,632,630,516,240 | 1,631,905,726,000 | 1,631,905,726,000 | 80,952,455 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,336 | lean | /-
Copyright (c) 2017 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Robert Y. Lewis
-/
import mathematica
import analysis.special_functions.trigonometric
/-!
`plausibility_check` tries to find an assignment to the free variables that appear in the co... |
9e77e4a6279fcf51324c872f718b12c755b403e6 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/homology/quasi_iso.lean | 240c744648cef142f249f565bfd8c0afc273b294 | [
"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 | 8,067 | lean | /-
Copyright (c) 2021 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Joël Riou
-/
import algebra.homology.homotopy
import category_theory.abelian.homology
/-!
# Quasi-isomorphisms
A chain map is a quasi-isomorphism if it induces isomor... |
818afe7a9e6a78990355511a6797c74db11f82b5 | 9d2e3d5a2e2342a283affd97eead310c3b528a24 | /src/for_mathlib/category_theory/limits/shapes/kernels.lean | 959ec551464a1bed8f51d5eac1c7162162f1fae8 | [] | permissive | Vtec234/lftcm2020 | ad2610ab614beefe44acc5622bb4a7fff9a5ea46 | bbbd4c8162f8c2ef602300ab8fdeca231886375d | refs/heads/master | 1,668,808,098,623 | 1,594,989,081,000 | 1,594,990,079,000 | 280,423,039 | 0 | 0 | MIT | 1,594,990,209,000 | 1,594,990,209,000 | null | UTF-8 | Lean | false | false | 1,816 | lean | import category_theory.limits.shapes.kernels
open category_theory
namespace category_theory.limits
universes v u
variables {C : Type u} [category.{v} C] [has_zero_morphisms C]
@[simps]
def cokernel_comp_is_iso {X Y Z : C} (f : X ⟶ Y) (g : Y ⟶ Z)
[has_cokernel (f ≫ g)] [has_cokernel f] [is_iso g] :
cokernel (f ... |
2428445d76075e1d2936d4572b5761bda7a863ef | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/analysis/box_integral/basic.lean | 2245ab9942ac95ea12f6f9d797ad6892a61fd166 | [
"Apache-2.0"
] | permissive | ramonfmir/mathlib | c5dc8b33155473fab97c38bd3aa6723dc289beaa | 14c52e990c17f5a00c0cc9e09847af16fabbed25 | refs/heads/master | 1,661,979,343,526 | 1,660,830,384,000 | 1,660,830,384,000 | 182,072,989 | 0 | 0 | null | 1,555,585,876,000 | 1,555,585,876,000 | null | UTF-8 | Lean | false | false | 43,299 | lean | /-
Copyright (c) 2021 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import analysis.box_integral.partition.filter
import analysis.box_integral.partition.measure
import topology.uniform_space.compact_separated
/-!
# Integrals of Rie... |
62ea5df166f3d1ba1297835cd03f61d83895e108 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/model_theory/language_map.lean | 9c759c5a40d4d3cb95918818f4f279f200f43bf4 | [
"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 | 15,949 | lean | /-
Copyright (c) 2021 Aaron Anderson, Jesse Michael Han, Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson, Jesse Michael Han, Floris van Doorn
-/
import model_theory.basic
/-!
# Language Maps
Maps between first-order languages in the styl... |
7311feab7ae3ec33b8e5c64884dc67bdb5adc036 | 75db7e3219bba2fbf41bf5b905f34fcb3c6ca3f2 | /library/data/matrix.lean | acb4bfb6046e82c3d37fa130caaece63ec8c9f7f | [
"Apache-2.0"
] | permissive | jroesch/lean | 30ef0860fa905d35b9ad6f76de1a4f65c9af6871 | 3de4ec1a6ce9a960feb2a48eeea8b53246fa34f2 | refs/heads/master | 1,586,090,835,348 | 1,455,142,203,000 | 1,455,142,277,000 | 51,536,958 | 1 | 0 | null | 1,455,215,811,000 | 1,455,215,811,000 | null | UTF-8 | Lean | false | false | 3,284 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
Matrices
-/
import algebra.ring data.fin data.fintype
open fin nat
definition matrix [reducible] (A : Type) (m n : nat) := fin m → fin n → A
namespace matrix... |
007feef4ed5b80aa5d1806983130d159fdc58599 | 6b2a480f27775cba4f3ae191b1c1387a29de586e | /group_rep_2/Tools/sum_tools.lean | 60ff5c80222da77b8247bba1a3deed985f889f86 | [] | no_license | Or7ando/group_representation | a681de2e19d1930a1e1be573d6735a2f0b8356cb | 9b576984f17764ebf26c8caa2a542d248f1b50d2 | refs/heads/master | 1,662,413,107,324 | 1,590,302,389,000 | 1,590,302,389,000 | 258,130,829 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 2,774 | lean | import data.fintype.basic
import linear_algebra.basic
open_locale big_operators
notation f ` ⊚ `:80 g:80 := linear_map.comp f g
universes u v w w' w''
open linear_map
variables {G : Type u }[fintype G]
{R : Type v}[comm_ring R]
{M : Type w} [add_comm_group M] [module R M]
{M' : ... |
1bde586213a43f5a26dcdc587b83f1626d1a8b58 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/ring_theory/henselian.lean | eb5ff41b66ed14eb32a211f8d1795ba592f12877 | [
"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 | 11,867 | lean | /-
Copyright (c) 2021 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import data.polynomial.taylor
import ring_theory.ideal.local_ring
import linear_algebra.adic_completion
/-!
# Henselian rings
> THIS FILE IS SYNCHRONIZED WITH MATH... |
87b3601eae13724a228642968443d8b4e45a5f0e | 7a76361040c55ae1eba5856c1a637593117a6556 | /src/exercises/love04_functional_programming_exercise_sheet.lean | 5f25a283238995ab1bb2278f5a3940bc9007ad68 | [] | no_license | rgreenblatt/fpv2021 | c2cbe7b664b648cef7d240a654d6bdf97a559272 | c65d72e48c8fa827d2040ed6ea86c2be62db36fa | refs/heads/main | 1,692,245,693,819 | 1,633,364,621,000 | 1,633,364,621,000 | 407,231,487 | 0 | 0 | null | 1,631,808,608,000 | 1,631,808,608,000 | null | UTF-8 | Lean | false | false | 5,465 | lean | import ..lectures.love03_forward_proofs_demo
/-! # LoVe Exercise 4: Functional Programming -/
set_option pp.beta true
set_option pp.generalized_field_notation false
namespace LoVe
/-! ## Question 1: Reverse of a List
We define a new accumulator-based version of `reverse`. The first argument,
`as`, serves as the... |
3f83e0c59c8d14e0b30dee102237d85282e11020 | 36c7a18fd72e5b57229bd8ba36493daf536a19ce | /library/data/nat/order.lean | 6a0776fdc5a842836c0e3232cc2c297d35cd320e | [
"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 | 18,777 | lean | /-
Copyright (c) 2014 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Leonardo de Moura, Jeremy Avigad
The order relation on the natural numbers.
-/
import data.nat.basic algebra.ordered_ring
open eq.ops algebra
namespace nat
/- lt... |
6f3a293f0f4d28eaac35a29b99c0000c8c9a2d68 | ba4794a0deca1d2aaa68914cd285d77880907b5c | /src/game/world4/level5.lean | 08ac34379eeea75b811b313e4852e8cf87d6fb5c | [
"Apache-2.0"
] | permissive | ChrisHughes24/natural_number_game | c7c00aa1f6a95004286fd456ed13cf6e113159ce | 9d09925424da9f6275e6cfe427c8bcf12bb0944f | refs/heads/master | 1,600,715,773,528 | 1,573,910,462,000 | 1,573,910,462,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 431 | lean | import game.world4.level4 -- hide
namespace mynat -- hide
/-
# Power World
## Level 5: `pow_add`
-/
/- Lemma
For all naturals $m$, $a$, $b$, we have $a^{m + n} = a ^ m a ^ n$.
-/
lemma pow_add (a m n : mynat) : a ^ (m + n) = a ^ m * a ^ n :=
begin [less_leaky]
induction n with t ht,
rw [add_zero, pow_zero, ... |
29e74fe56c2fa0e87494bd5c8b13f404d971b437 | 07c76fbd96ea1786cc6392fa834be62643cea420 | /hott/hit/groupoid_quotient.hlean | 86c188546f29b6465741da6ec3d96e0617a7a81f | [
"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 | 9,578 | hlean | /-
Copyright (c) 2015-16 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
The groupoid quotient. This is a 1-type which path spaces is the same as the morphisms
a given groupoid. We define it as the 1-truncation of a two quotient.
-/
... |
c4c5bd63b0cd1c6d44dd76e05f8b7860911f9562 | febba19712b2aefe4d6c7fb0230b8d7e272c98c4 | /src/dependent_majorizability.lean | 1defb6a1c6d15f7c6e43b6c5e611442379a532fa | [] | no_license | hcheval/formalized-proof-mining | e6eb980feb644ae269f43d9af93ac584b7a47a17 | 216cc73fccd84900a1ba7eaae5f73732496d6afe | refs/heads/master | 1,689,621,410,792 | 1,629,912,272,000 | 1,629,912,272,000 | 399,855,572 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,351 | lean | import dialectica
variables {ι : Type} [decidable_eq ι] {gri : ground_interpretation ι}
local notation `𝔽` := formula ι gri
local notation `𝕋` := type ι gri
variables {greq : Π {i : ι}, ∥𝕏 i // gri ∥ → ∥𝕏 i // gri ∥ → 𝔽}
local infixr `≅` : 35 := formula.eqext @greq
section
-- a "reverse embedding" of a f... |
7e8cee7635de7adc18d4376ae61aabb3e0a3a804 | 8cb37a089cdb4af3af9d8bf1002b417e407a8e9e | /tests/lean/tc_caching.lean | f18bee69f5ffeef9f4b47fefb5771d7c2cd440d6 | [
"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 | 270 | lean | set_option trace.type_context_cache true
set_option trace.class_instances true
-- The following declaration should only do two type class searches, and each
-- only once: `has_one ℕ` and `has_add ℕ`
def foo : combinator.K ℕ (1 + 1 + 1) :=
show ℕ, from 1 + 1 + 1 |
390bd3ecc9a5b4f9817c9fc3705416c1b9852d0f | 6fca17f8d5025f89be1b2d9d15c9e0c4b4900cbf | /src/game/world10/level15.lean | 0d95e08dff9467fb516f718bf2c10e874afe2581 | [
"Apache-2.0"
] | permissive | arolihas/natural_number_game | 4f0c93feefec93b8824b2b96adff8b702b8b43ce | 8e4f7b4b42888a3b77429f90cce16292bd288138 | refs/heads/master | 1,621,872,426,808 | 1,586,270,467,000 | 1,586,270,467,000 | 253,648,466 | 0 | 0 | null | 1,586,219,694,000 | 1,586,219,694,000 | null | UTF-8 | Lean | false | false | 728 | lean | --import mynat.lt -- definition of <
import game.world10.level14 -- hide
namespace mynat -- hide
/-
# Inequality world.
## Level 15: introducing `<`
To get the remaining collectibles in this world, we need to
give a definition of `<`. By default, the definition of `a < b`
in Lean, once `≤` is defined, is this:
`a... |
73fd0692c66717f8101f7d533b7434087ef2ac5e | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /stage0/src/Init/Lean/Meta/WHNF.lean | 127912f1a142fe5cee5077c01b3845593a502e62 | [
"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 | 5,822 | 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
-/
prelude
import Init.Lean.AuxRecursor
import Init.Lean.Util.WHNF
import Init.Lean.Meta.Basic
import Init.Lean.Meta.LevelDefEq
namespace Lean
namespace Meta
... |
5d25f73e52ada8b7b7b56d430f43cc7e47c348f0 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/analysis/box_integral/partition/filter.lean | edff418ca0bcf782b4390d41c4f120055864a845 | [
"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 | 27,728 | lean | /-
Copyright (c) 2021 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import analysis.box_integral.partition.subbox_induction
import analysis.box_integral.partition.split
/-!
# Filters used in box-based integrals
First we define a s... |
c0b0f5d222f2d3e8347d0f38ef9cd89eed9801de | 4727251e0cd73359b15b664c3170e5d754078599 | /src/analysis/special_functions/trigonometric/angle.lean | b98fe6e55476f03807c906a8ef00fed5d5d1ad37 | [
"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,449 | lean | /-
Copyright (c) 2019 Calle Sönne. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Calle Sönne
-/
import analysis.special_functions.trigonometric.basic
/-!
# The type of angles
In this file we define `real.angle` to be the quotient group `ℝ/2πℤ` and prove a few simple... |
36f456d0d2b1265f0ec88a617f2247a5503f94d7 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/category_theory/sites/cover_preserving.lean | 753a7a0ad6e21247a1eef2f63445e330173d3d72 | [
"Apache-2.0"
] | permissive | urkud/mathlib | eab80095e1b9f1513bfb7f25b4fa82fa4fd02989 | 6379d39e6b5b279df9715f8011369a301b634e41 | refs/heads/master | 1,658,425,342,662 | 1,658,078,703,000 | 1,658,078,703,000 | 186,910,338 | 0 | 0 | Apache-2.0 | 1,568,512,083,000 | 1,557,958,709,000 | Lean | UTF-8 | Lean | false | false | 11,476 | lean | /-
Copyright (c) 2021 Andrew Yang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Andrew Yang
-/
import category_theory.sites.limits
import category_theory.functor.flat
import category_theory.limits.preserves.filtered
import category_theory.sites.left_exact
/-!
# Cove... |
f4b70ff0550c3d8bd2283b4f255b248ab422ece9 | 1a61aba1b67cddccce19532a9596efe44be4285f | /hott/types/W.hlean | fa074a90531b128d48c5ad9a5190c5ced3ea7336 | [
"Apache-2.0"
] | permissive | eigengrau/lean | 07986a0f2548688c13ba36231f6cdbee82abf4c6 | f8a773be1112015e2d232661ce616d23f12874d0 | refs/heads/master | 1,610,939,198,566 | 1,441,352,386,000 | 1,441,352,494,000 | 41,903,576 | 0 | 0 | null | 1,441,352,210,000 | 1,441,352,210,000 | null | UTF-8 | Lean | false | false | 4,678 | hlean | /-
Copyright (c) 2014 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Floris van Doorn
Theorems about W-types (well-founded trees)
-/
import .sigma .pi
open eq equiv is_equiv sigma sigma.ops
inductive Wtype.{l k} {A : Type.{l}} (B : A → Type.{k}) : T... |
bbd9f1e8e544a63017ca61004d37c1d95b7d41f6 | 3f7026ea8bef0825ca0339a275c03b911baef64d | /src/algebra/punit_instances.lean | 37d194c6977c93b2fd2e4741ed3afd7d7c0b7259 | [
"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,449 | lean | /-
Copyright (c) 2019 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
Instances on punit.
-/
import algebra.module algebra.group
universes u
open lattice
namespace punit
variables (x y : punit.{u+1}) (s : set punit.{u+1})
instance : comm_ring ... |
90890dce14ed5e31e29f33d50a060c3b0fee36be | 08bd4ba4ca87dba1f09d2c96a26f5d65da81f4b4 | /tests/bench/liasolver.lean | 9a1266f94ab38d85bb61e08816816c9cf3747138 | [
"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",
"Apache-2.0",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | gebner/lean4 | d51c4922640a52a6f7426536ea669ef18a1d9af5 | 8cd9ce06843c9d42d6d6dc43d3e81e3b49dfc20f | refs/heads/master | 1,685,732,780,391 | 1,672,962,627,000 | 1,673,459,398,000 | 373,307,283 | 0 | 0 | Apache-2.0 | 1,691,316,730,000 | 1,622,669,271,000 | Lean | UTF-8 | Lean | false | false | 13,881 | lean | /-
Linear Diophantine equation solver
Author: Marc Huisinga
-/
import Lean.Data.HashMap
open Lean
namespace Int
def roundedDiv (a b : Int) : Int := Id.run <| do
let mut div := a / b
let sgn := if a ≥ 0 ∧ b ≥ 0 ∨ a < 0 ∧ b < 0 then 1 else -1
let rest := (a % b).natAbs
if 2*rest ≥ b... |
24f699c8921c80f2f792b8018ad1785d192b68c0 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/comm_sq.lean | 7e9e2ad8bd04840e4adb48d006e9ab162fb29b8d | [
"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,891 | lean | /-
Copyright (c) 2022 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Joël Riou
-/
import category_theory.arrow
/-!
# Commutative squares
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding PR t... |
fd4b9dd098cc3243153dd527f5b9ea131e100f22 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/class2.lean | af6f2aa3c202da9e5154a415d05de5b5b0646720 | [
"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 | 120 | lean | open tactic
def H {A B : Type} (H1 : inhabited A) : inhabited (Prop × A × (B → nat))
:= by apply_instance
#print H
|
f367210d62935cb6e3ceee0aad85bb417214f6c6 | 5756a081670ba9c1d1d3fca7bd47cb4e31beae66 | /MathportApp.lean | 613ff141480e63f0f40d0c4b70a70d33b9f38d72 | [
"Apache-2.0"
] | permissive | leanprover-community/mathport | 2c9bdc8292168febf59799efdc5451dbf0450d4a | 13051f68064f7638970d39a8fecaede68ffbf9e1 | refs/heads/master | 1,693,841,364,079 | 1,693,813,111,000 | 1,693,813,111,000 | 379,357,010 | 27 | 10 | Apache-2.0 | 1,691,309,132,000 | 1,624,384,521,000 | Lean | UTF-8 | Lean | false | false | 1,825 | lean | import Mathport
open Mathport Lean
abbrev VisitResult := Task (Except IO.Error Unit)
partial def visit (pathToConfig : String) (config : Config) (path : Path) :
StateT (HashMap Path VisitResult) IO VisitResult := do
println! "[visit] {repr path}"
let pcfg := config.pathConfig
if let some task := (← get).fi... |
03f2f4a2767d2642a5cb756dc1eb9402426940f8 | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch5/ex0212.lean | 857ae3514e4f1ea97a3472eea98693cc89e4bba5 | [] | 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 | 90 | lean | example : ∃ a : ℕ, a = a :=
begin
fapply exists.intro,
exact 0,
reflexivity
end
|
a3056041bf5759dba2f8e8a68cd3720dae9e5d99 | cf39355caa609c0f33405126beee2739aa3cb77e | /library/init/data/sigma/basic.lean | 8603c52602ae2d9bcf663d1d632a94c8e1aa2873 | [
"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 | 964 | 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, Floris van Doorn
-/
prelude
import init.logic init.wf
notation `Σ` binders `, ` r:(scoped p, sigma p) := r
notation `Σ'` binders `, ` r:(scoped... |
acdd0aff20ad77cfecc19a5e27fd4f65a1c96621 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/topology/instances/discrete.lean | fef680bfeb5f63ec405a5311ee961f914582bec3 | [
"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,383 | lean | /-
Copyright (c) 2022 Rémy Degenne. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Rémy Degenne
-/
import order.succ_pred.basic
import topology.order.basic
import topology.metric_space.metrizable_uniformity
/-!
# Instances related to the discrete topology
> THIS FIL... |
361ffae091eba6bab382803b4b16eabadcaad6af | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/inst.lean | d441e569eaac7d2762df62e144af74818d430952 | [
"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 | 620 | lean | set_option pp.notation false
inductive [class] C (A : Type*)
| mk : A → C
definition val {A : Type*} (c : C A) : A :=
C.rec (λa, a) c
constant magic (A : Type*) : A
attribute [instance, priority std.priority.max]
noncomputable definition C_magic (A : Type*) : C A :=
C.mk (magic A)
attribute [instance]
definition C_... |
91ff58abcf246af55ac5d51d2047a2164373deb4 | b24beef0a8b1a8e92be756a25aa78e24908b2b14 | /src/hints/thursday/afternoon/category_theory/exercise1/hint2.lean | e43682182d4ddfe293ed5da28331264ae77b8604 | [] | permissive | ChristopheMargerin/lftcm2020 | 14967e74cbe92a7b61d32d8130f32cfa09b5172b | 589180047fa4fdfb3179636db58b0b0320549871 | refs/heads/master | 1,668,536,269,632 | 1,594,891,664,000 | 1,594,891,664,000 | 280,112,730 | 0 | 0 | MIT | 1,594,891,963,000 | 1,594,891,962,000 | null | UTF-8 | Lean | false | false | 899 | lean | import category_theory.isomorphism
import category_theory.yoneda
open category_theory
open opposite
variables {C : Type*} [category C]
def iso_of_hom_iso_attempt (X Y : C) (h : yoneda.obj X ≅ yoneda.obj Y) : X ≅ Y :=
{ hom :=
begin
-- We need to construct a morphism `X ⟶ Y`.
-- Recall that the components `... |
6b29310a4ffb7af9da7c44654e7115c3f27cf9f5 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/bug5.lean | 805caa815e212c9b91b4106a85bf038d919f8b2f | [
"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 | 81 | lean | theorem symm2 {A : Type} {a b : A} (H : a = b) : b = a
:= eq.subst H (eq.refl a)
|
3b17d66971ffbe73f556ae70dbb21bc632b7986e | 5719a16e23dfc08cdea7a5bf035b81690f307965 | /src/Init/Lean/Util/Trace.lean | a2a5cd6a385c2826e4ccbac8bf8cdceef1b4d195 | [
"Apache-2.0"
] | permissive | postmasters/lean4 | 488b03969a371e1507e1e8a4df9ebf63c7cbe7ac | f3976fc53a883ac7606fc59357d43f4b51016ca7 | refs/heads/master | 1,655,582,707,480 | 1,588,682,595,000 | 1,588,682,595,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,760 | lean | /-
Copyright (c) 2018 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich, Leonardo de Moura
-/
prelude
import Init.Lean.Message
universe u
namespace Lean
class MonadTracer (m : Type → Type u) :=
(traceCtx {α} : Name → m α → m α)
(... |
018d22e00e2c40f44e97ee7b3a3811826e947794 | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /src/Lean/Data/SMap.lean | 22d193348df806d6ac289ba9c36b183bb088befe | [
"Apache-2.0"
] | permissive | williamdemeo/lean4 | 72161c58fe65c3ad955d6a3050bb7d37c04c0d54 | 6d00fcf1d6d873e195f9220c668ef9c58e9c4a35 | refs/heads/master | 1,678,305,356,877 | 1,614,708,995,000 | 1,614,708,995,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,593 | 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 Std.Data.HashMap
import Std.Data.PersistentHashMap
universes u v w w'
namespace Lean
open Std (HashMap PHashMap)
/- Staged map for implementing th... |
ab0b921f0698b99d433742caf36e41c6cb8ff9c9 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/category_theory/quotient.lean | 5d90d26b9add30e45efee68d262d67d912e4cd4a | [
"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 | 4,043 | lean | /-
Copyright (c) 2020 David Wärn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Wärn
-/
import category_theory.functor
import category_theory.natural_isomorphism
/-!
# Quotient category
Constructs the quotient of a category by an arbitrary family of relations... |
4cac7093464e8376437e78689bacd8f2d15a65d6 | 78630e908e9624a892e24ebdd21260720d29cf55 | /src/logic_propositional/prop_06.lean | 35c50f74c055c7d2415fc3ea65d4d0836164cb4b | [
"CC0-1.0"
] | permissive | tomasz-lisowski/lean-logic-examples | 84e612466776be0a16c23a0439ff8ef6114ddbe1 | 2b2ccd467b49c3989bf6c92ec0358a8d6ee68c5d | refs/heads/master | 1,683,334,199,431 | 1,621,938,305,000 | 1,621,938,305,000 | 365,041,573 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 211 | lean | namespace prop_06
variables A B : Prop
theorem prop_6 : (A -> B) -> (A -> (A /\ B)) :=
assume h1: A → B,
assume h2: A,
have h3: B, from h1 h2,
show A ∧ B, from and.intro h2 h3
-- end namespace
end prop_06 |
246b0ecf59d1fb0cb9f235ea6f36eedd2dc03282 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /src/Lean/Elab/DefView.lean | a6570d5717f6a91faa38ae12e25fdd9265475d11 | [
"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 | 7,014 | 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, Sebastian Ullrich
-/
import Std.ShareCommon
import Lean.Parser.Command
import Lean.Util.CollectLevelParams
import Lean.Util.FoldConsts
import Lean.Meta.ForEac... |
f35fbd3397628a526d72e2f859c2c85732e0238a | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/dynamics/flow.lean | bbf3761d72638f10b8fd86692797578e536a9779 | [
"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 | 6,143 | 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... |
a5e94d72f5d12af55e02c66080696e86efe97158 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/tactic/lint/simp.lean | 8de35651f3aca94912fecab3678602d6ad81146a | [
"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 | 9,356 | lean | /-
Copyright (c) 2020 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner
-/
import tactic.lint.basic
/-!
# Linter for simplification lemmas
This files defines several linters that prevent common mistakes when declaring simp lemmas:
* `simp_... |
b7ff3de22c84002b5cbdf9213925b5466509906c | bb31430994044506fa42fd667e2d556327e18dfe | /src/measure_theory/measure/measure_space.lean | dc31c755e6e02ce60161754821f8a1b0f4a0ee26 | [
"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 | 186,545 | 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 measure_theory.measure.null_measurable
import measure_theory.measurable_space
import topology.algebra.order.liminf_limsup
/-!
# Measure spaces... |
02f08744b25cf4ad68475f50687f0c876a838e50 | 2fbe653e4bc441efde5e5d250566e65538709888 | /src/topology/uniform_space/uniform_embedding.lean | c4a672a3ee6f35d27d09b3fa64c485926d417c04 | [
"Apache-2.0"
] | permissive | aceg00/mathlib | 5e15e79a8af87ff7eb8c17e2629c442ef24e746b | 8786ea6d6d46d6969ac9a869eb818bf100802882 | refs/heads/master | 1,649,202,698,930 | 1,580,924,783,000 | 1,580,924,783,000 | 149,197,272 | 0 | 0 | Apache-2.0 | 1,537,224,208,000 | 1,537,224,207,000 | null | UTF-8 | Lean | false | false | 18,828 | 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, Sébastien Gouëzel, Patrick Massot
Uniform embeddings of uniform spaces. Extension of uniform continuous functions.
-/
import topology.uniform_space.cauchy topology.uni... |
9fef3fe156dda9fee62e77be9bc4798b8a11ca46 | 8e2026ac8a0660b5a490dfb895599fb445bb77a0 | /library/tools/super/cdcl_solver.lean | b512f66b8d9c4db5346e63277b6adb5221294ee8 | [
"Apache-2.0"
] | permissive | pcmoritz/lean | 6a8575115a724af933678d829b4f791a0cb55beb | 35eba0107e4cc8a52778259bb5392300267bfc29 | refs/heads/master | 1,607,896,326,092 | 1,490,752,175,000 | 1,490,752,175,000 | 86,612,290 | 0 | 0 | null | 1,490,809,641,000 | 1,490,809,641,000 | null | UTF-8 | Lean | false | false | 13,954 | lean | /-
Copyright (c) 2016 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner
-/
import .clause
open tactic expr monad super
namespace cdcl
@[reducible] meta def prop_var := expr
@[reducible] meta def proof_term := expr
@[reducible] meta def proof... |
dd0a71143a0e0686335095668d7eebea3a96209f | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/tactic/norm_cast_auto.lean | 741f217e8f0118d1256e9018bbfc7dbef26ba922 | [] | 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 | 9,114 | lean | /-
Copyright (c) 2019 Paul-Nicolas Madelaine. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Paul-Nicolas Madelaine, Robert Y. Lewis
Normalizing casts inside expressions.
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.tactic.converter.in... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.