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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
8826d91e03222c9c00b97980f448dee84ee3ef1f | a30803705b058bf4d3fe292d2e2b73b6d0189758 | /src/config.lean | 2b185f12ae92ad83bfcb6f4a159d392862040b9b | [
"MIT"
] | permissive | jroesch/muri | 2ff3630899261cb4ecacba2708e0bc25837e4dd2 | 4700936f4928ad371ed1e8ed999f54b377b87b1d | refs/heads/master | 1,609,206,122,077 | 1,473,129,664,000 | 1,473,129,664,000 | 64,623,415 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 160 | lean | set_option native.library_path "/Users/jroesch/Git/lean/build/debug"
set_option native.include_path "/Users/jroesch/Git/lean/src"
definition config : nat := 0
|
64c111cdce04c24211af547b006c17cdfe1cea5d | fef48cac17c73db8662678da38fd75888db97560 | /src/point4.lean | 0aa5a6d46c03a94cf0e0cbae6da9955ff217d8e8 | [] | no_license | kbuzzard/lean-squares-in-fibonacci | 6c0d924f799d6751e19798bb2530ee602ec7087e | 8cea20e5ce88ab7d17b020932d84d316532a84a8 | refs/heads/master | 1,584,524,504,815 | 1,582,387,156,000 | 1,582,387,156,000 | 134,576,655 | 3 | 1 | null | 1,541,538,497,000 | 1,527,083,406,000 | Lean | UTF-8 | Lean | false | false | 1,310 | lean | import definitions
import point3
import data.nat.prime
open nat
/-- point 4, first part-/
lemma luc_fib (m : ℕ) : luc (m + 3) = 2 * fib (m + 3) + fib m :=
int.coe_nat_inj $ by rw [int.coe_nat_add, int.coe_nat_mul];
rw [← fib_down, ← fib_down, ← luc_down, Luc, Fib, Fib];
rw [α_Fib, α_Fib, β_Fib]; dsimp;
rw [add_... |
39a609c4bf19b8c3defb46791108983eac571a8f | b2fe74b11b57d362c13326bc5651244f111fa6f4 | /src/field_theory/galois.lean | 84825c53d02d8e21c0617dcd970316bbe12382dd | [
"Apache-2.0"
] | permissive | midfield/mathlib | c4db5fa898b5ac8f2f80ae0d00c95eb6f745f4c7 | 775edc615ecec631d65b6180dbcc7bc26c3abc26 | refs/heads/master | 1,675,330,551,921 | 1,608,304,514,000 | 1,608,304,514,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 12,927 | lean | /-
Copyright (c) 2020 Thomas Browning and Patrick Lutz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Thomas Browning and Patrick Lutz
-/
import field_theory.normal
import field_theory.primitive_element
import field_theory.fixed
import ring_theory.power_basis
/-!
# ... |
d3c3f66ba00daa22e633c112750b34e39ad7268f | 2b2a05a7af89c79da194505bf88205a6c4e05d68 | /src/game/world_06_proposition.lean | f977c54b7e0058f513d5fe420fd2b9f8a586a20d | [] | no_license | lacrosse/natural_number_game | 6401a11a8c965da3903ae6695f84586edf6fac85 | 400179cde1d3fcc9744901dabff98813ba2b544f | refs/heads/master | 1,677,566,006,582 | 1,612,576,917,000 | 1,612,576,917,000 | 335,655,947 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,288 | lean | import game.world_05_function
namespace mynat
example (P Q : Prop) (p : P) (h : P → Q) : Q := begin[nat_num_game]
exact h p,
end
lemma imp_self (P : Prop) : P → P := begin[nat_num_game]
intro p,
exact p,
end
lemma maze (P Q R S T U: Prop) (p : P) (h : P → Q) (i : Q → R) (j : Q → T) (k : S → T) (l : T → U) : U ... |
85bd58c6a1cac4d483062580b113437d18dcc050 | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/geometry/euclidean/circumcenter.lean | 63d25fbc9ea23c56acbb3bc60d8ea2156e257b78 | [
"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 | 24,536 | 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 linear_algebra.affine_space.finite_dimensional
import tactic.derive_fintype
noncomputable theory
open_locale big_operators
open_lo... |
5b0b62db9ca6009f982fa868e33de5f73e33c79e | 4f065978c49388d188224610d9984673079f7d91 | /p_adic.lean | 28e693d1fc81762ecaba33af7182a591b1881e7a | [] | no_license | kckennylau/Lean | b323103f52706304907adcfaee6f5cb8095d4a33 | 907d0a4d2bd8f23785abd6142ad53d308c54fdcb | refs/heads/master | 1,624,623,720,653 | 1,563,901,820,000 | 1,563,901,820,000 | 109,506,702 | 3 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 2,523 | lean | import data.nat.prime tactic.norm_num
structure Z_p (p : ℕ) (hp : nat.prime p) :=
(f : ℕ → fin p)
namespace Z_p
variables (p : ℕ) (hp : nat.prime p)
variables {p}
theorem nat.prime.gt_zero : p > 0 := lt_of_lt_of_le (by norm_num : 0 < 2) (nat.prime.ge_two hp)
variables (p)
def pre_add_aux (n : ℕ) : fin p × bool :... |
e192a1552fdb88286aa60aaa3819c5991e6e10c1 | 9d2e3d5a2e2342a283affd97eead310c3b528a24 | /src/exercises_sources/tuesday/afternoon/sets.lean | bd21b286e6d7d9ba04c80198058c6069984bb5ea | [] | 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 | 8,121 | lean | import data.set.basic data.set.lattice data.nat.parity
import tactic.linarith
open set nat function
open_locale classical
variables {α : Type*} {β : Type*} {γ : Type*} {I : Type*}
/-!
## Set exercises
These are collected from *Mathematics in Lean*.
We will go over the examples together, and then let you
work on t... |
0e6b35b830805362cb08235ebf5a0d7851f456f9 | 46125763b4dbf50619e8846a1371029346f4c3db | /src/data/zmod/basic.lean | 23005ef7ca055b03b59ba8db1a0ceef114802922 | [
"Apache-2.0"
] | permissive | thjread/mathlib | a9d97612cedc2c3101060737233df15abcdb9eb1 | 7cffe2520a5518bba19227a107078d83fa725ddc | refs/heads/master | 1,615,637,696,376 | 1,583,953,063,000 | 1,583,953,063,000 | 246,680,271 | 0 | 0 | Apache-2.0 | 1,583,960,875,000 | 1,583,960,875,000 | null | UTF-8 | Lean | false | false | 21,069 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Chris Hughes
-/
import data.int.modeq data.int.gcd data.fintype data.pnat.basic tactic.ring
/-!
# Integers mod `n`
Definition of the integers mod n, and the field structure on the inte... |
33c675c7f90076f7564054ea62b83eef662a9b7f | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/updateExprIssue.lean | ea9cced25cbae00f280114dfed1d384221fd52f8 | [
"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 | 459 | lean | import Lean
open Lean
unsafe def tst1 : MetaM Unit := do
let e := mkApp (mkSort levelZero) (mkSort levelZero)
let e' := e.updateApp! (mkSort levelZero) (mkSort levelZero)
assert! ptrAddrUnsafe e == ptrAddrUnsafe e'
let e' := e.replace fun _ => none
assert! ptrAddrUnsafe e == ptrAddrUnsafe e'
#eval tst1
s... |
9586e8e1cee45c7a3a2c7ef1aa087bb40bb6684c | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/pprod.lean | c3b1846051ed1237cb390aab4499c6a50044200f | [] | 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 | 488 | lean | /-
Copyright (c) 2020 Eric Wieser. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Eric Wieser
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.PostPort
universes u_1 u_2
namespace Mathlib
/-!
# Extra facts about `pprod`
-/
@[simp] theo... |
a4876d32a04237042ccc0037e1fba2d787bb7918 | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/ring_theory/roots_of_unity.lean | 5e385a0dcb8ed69a2c5ccae4a9ba36852d4a54bb | [
"Apache-2.0"
] | permissive | hikari0108/mathlib | b7ea2b7350497ab1a0b87a09d093ecc025a50dfa | a9e7d333b0cfd45f13a20f7b96b7d52e19fa2901 | refs/heads/master | 1,690,483,608,260 | 1,631,541,580,000 | 1,631,541,580,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 40,411 | 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.parity
import data.polynomial.ring_division
import group_theory.specific_groups.cyclic
import ring_theory.integral_domain
import number_theory.diviso... |
b4a5bdb83a180928b348eb68ef77d338f94da64e | 35677d2df3f081738fa6b08138e03ee36bc33cad | /test/hint.lean | 50ace2e0615b675d88c44ef312f036d797f81100 | [
"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 | 972 | lean | import tactic.hint
import tactic.split_ifs
import tactic.finish
example : 1 = 1 :=
begin
(do hints ← tactic.hint, guard $ "refl" ∈ hints),
refl
end
-- `split_ifs` is designated as a `hint_tactic` in its own file
example : if 1 = 1 then true else false :=
begin
(do hints ← tactic.hint, guard $ "split_ifs" ∈ hint... |
bf002cee1b9629c3b82341e63ea579fb678c0d8f | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/uni_var_bug.lean | 226a6127f945d938fce761b0207d6a54548f213e | [
"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 | 292 | lean | section
universe variable u
variables {A B : Type.{u}}
theorem foo (H : A = B) : A = B := H
theorem bar {C D : Type} (H : C = D) : C = D :=
foo H
end
universe variable u
variables {A B : Type.{u}}
theorem foo2 (H : A = B) : A = B := H
theorem bar2 {C D : Type} (H : C = D) : C = D :=
foo2 H
|
3c8034d6eeea6074a8d1c5ae709c607287ccf57a | 4727251e0cd73359b15b664c3170e5d754078599 | /src/data/finset/slice.lean | d3a729689bb02be26d232bb37e0089bf728635c4 | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 5,251 | lean | /-
Copyright (c) 2021 Bhavik Mehta, Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta, Alena Gusakov, Yaël Dillies
-/
import algebra.big_operators.basic
import data.nat.interval
import order.antichain
/-!
# `r`-sets and slice
This file defines... |
7e11405ce6857d0894cf2213cf3bfa8eadfd1326 | 271e26e338b0c14544a889c31c30b39c989f2e0f | /stage0/src/Init/Lean/Compiler/IR.lean | b2c159b646417016337ba71679ff2ac7acf5864b | [
"Apache-2.0"
] | permissive | dgorokho/lean4 | 805f99b0b60c545b64ac34ab8237a8504f89d7d4 | e949a052bad59b1c7b54a82d24d516a656487d8a | refs/heads/master | 1,607,061,363,851 | 1,578,006,086,000 | 1,578,006,086,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,696 | 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.Compiler.IR.Basic
import Init.Lean.Compiler.IR.Format
import Init.Lean.Compiler.IR.CompilerM
import Init.Lean.Compiler.IR.PushProj
... |
235461c034f648c2435aa5bb4a809621a02e7279 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/analysis/analytic/basic.lean | c3a27bea9f4f6ace3cbbac6595363f41f078d5b6 | [
"Apache-2.0"
] | permissive | dupuisf/mathlib | 62de4ec6544bf3b79086afd27b6529acfaf2c1bb | 8582b06b0a5d06c33ee07d0bdf7c646cae22cf36 | refs/heads/master | 1,669,494,854,016 | 1,595,692,409,000 | 1,595,692,409,000 | 272,046,630 | 0 | 0 | Apache-2.0 | 1,592,066,143,000 | 1,592,066,142,000 | null | UTF-8 | Lean | false | false | 37,772 | 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.calculus.times_cont_diff
import tactic.omega
import analysis.special_functions.pow
/-!
# Analytic functions
A function is analytic in one dime... |
8f2cedb5e073145eb6fff3c9647c41b234be394e | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/meta/widget/html_cmd_auto.lean | b0f556580af5daefbf9869f0886ff21cc00c16af | [] | 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 | 491 | lean | /-
Copyright (c) E.W.Ayers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: E.W.Ayers
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.meta.widget.basic
import Mathlib.Lean3Lib.init.meta.lean.parser
import Mathlib.Lean3Lib.init.meta.interactive_base
import Mathlib... |
5c33fcd74ecfc967f9ca42177042f375da559e3c | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/category_theory/full_subcategory.lean | 7b559cc02ee2221fa62e7947eb1f6dba08591a16 | [
"Apache-2.0"
] | permissive | robertylewis/mathlib | 3d16e3e6daf5ddde182473e03a1b601d2810952c | 1d13f5b932f5e40a8308e3840f96fc882fae01f0 | refs/heads/master | 1,651,379,945,369 | 1,644,276,960,000 | 1,644,276,960,000 | 98,875,504 | 0 | 0 | Apache-2.0 | 1,644,253,514,000 | 1,501,495,700,000 | Lean | UTF-8 | Lean | false | false | 3,767 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Reid Barton
-/
import category_theory.fully_faithful
/-!
# Induced categories and full subcategories
Given a category `D` and a function `F : C → D `from a type `C` t... |
67ab59eb589e25fca52520bfd9842a0eaec5bdce | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /src/Init/SimpLemmas.lean | 57651d34c929021e408bf7708d81e99027482f65 | [
"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 | 4,403 | 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
notation, basic datatypes and type classes
-/
prelude
import Init.Core
@[simp] theorem eqSelf (a : α) : (a = a) = True :=
propext <| Iff.intro (fun _ => tr... |
95b035a6257478edfbbaad91a0f7bf2a50e42528 | 618003631150032a5676f229d13a079ac875ff77 | /src/field_theory/minimal_polynomial.lean | 0acc98f4531c5f387bd322a3cfa01a283d0e13ec | [
"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 | 8,790 | lean | /-
Copyright (c) 2019 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Johan Commelin
-/
import ring_theory.integral_closure
/-!
# Minimal polynomials
This file defines the minimal polynomial of an element x of an A-algebra B,
under the assu... |
2b07cf8b4a42d60f5151ff0478a8b60f30eca0d6 | 7da5ceac20aaab989eeb795a4be9639982e7b35a | /src/category_theory/limits/shapes/products.lean | 62c069541630f255f8728d448b652e5c7e06ddf8 | [
"MIT"
] | permissive | formalabstracts/formalabstracts | 46c2f1b3a172e62ca6ffeb46fbbdf1705718af49 | b0173da1af45421239d44492eeecd54bf65ee0f6 | refs/heads/master | 1,606,896,370,374 | 1,572,988,776,000 | 1,572,988,776,000 | 96,763,004 | 165 | 28 | null | 1,555,709,319,000 | 1,499,680,948,000 | Lean | UTF-8 | Lean | false | false | 1,330 | lean | -- Copyright (c) 2018 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Scott Morrison
import category_theory.limits.limits
import category_theory.discrete_category
import ...basic
open category_theory
namespace category_theory.limits
universes v... |
746141bb1dafbad72d1c91b3119320385687f10f | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/appFinalizeIssue.lean | f7364d28f15baac6182fabba1f746d28424f693b | [
"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 | 553 | lean | namespace Ex
class GetElem (Cont : Type u) (Idx : Type v) (Elem : outParam (Type w)) where
getElem' (xs : Cont) (i : Idx) : Elem
export GetElem (getElem')
instance : GetElem Lean.Syntax Nat Lean.Syntax where
getElem' xs i := xs.getArg i
instance : GetElem (Array α) Nat α where
getElem' xs i := xs.get ⟨i, sorr... |
3b44a9ec52a24d03e02a68a12fbf51f5d2cafff3 | 38ee9024fb5974f555fb578fcf5a5a7b71e669b5 | /test/runTac.lean | 89b73318fb88c0daa075cc0289aad8998f8a6bda | [
"Apache-2.0"
] | permissive | denayd/mathlib4 | 750e0dcd106554640a1ac701e51517501a574715 | 7f40a5c514066801ab3c6d431e9f405baa9b9c58 | refs/heads/master | 1,693,743,991,894 | 1,636,618,048,000 | 1,636,618,048,000 | 373,926,241 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 174 | lean | import Lean.Elab.Tactic.ElabTerm
import Mathlib.Tactic.RunTac
open Lean Elab Tactic
example : True := by
runTac do
evalApplyLikeTactic Meta.apply (← `(True.intro))
|
7b6ee89af2fdcd5253dd139c33c9d7025803fa66 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/order/imp.lean | 30e3b3cc2fc3a1807b86c78c8a41774a912f0166 | [
"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,761 | lean | /-
Copyright (c) 2021 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Yury Kudryashov
-/
import order.symm_diff
import tactic.monotonicity.basic
/-!
# Implication and equivalence as operations on a boolean algebra
In this file we de... |
1ac5eb37e574cfd45baff9e973b23c35bba31f70 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Init/Data/Nat.lean | 5d71ac093b753ac99e42cde8ecf47f8f757ff6e5 | [
"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 | 414 | 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.Data.Nat.Basic
import Init.Data.Nat.Div
import Init.Data.Nat.Gcd
import Init.Data.Nat.Bitwise
import Init.Data.Nat.Control
import Init.D... |
9d9a729d407a74ae53b990422527087ae603bb13 | 5ae26df177f810c5006841e9c73dc56e01b978d7 | /src/data/complex/basic.lean | 10874d9575ac77bd1bca9093ee714a850685bb85 | [
"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 | 19,417 | lean | /-
Copyright (c) 2017 Kevin Buzzard. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Buzzard, Mario Carneiro
The complex numbers, modelled as R^2 in the obvious way.
-/
import data.real.basic tactic.ring algebra.field_power
import tactic.norm_cast
structure comp... |
e1ba642be5785d0fff3bd8ef708ade27304ab7d7 | 02005f45e00c7ecf2c8ca5db60251bd1e9c860b5 | /src/algebra/ordered_ring.lean | 8de14353aef3719f1a53c02a6c4ace52e9d6702a | [
"Apache-2.0"
] | permissive | anthony2698/mathlib | 03cd69fe5c280b0916f6df2d07c614c8e1efe890 | 407615e05814e98b24b2ff322b14e8e3eb5e5d67 | refs/heads/master | 1,678,792,774,873 | 1,614,371,563,000 | 1,614,371,563,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 45,991 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Mario Carneiro
-/
import algebra.ordered_group
import data.set.intervals.basic
set_option old_structure_cmd true
universe u
variable {α : Type u}
/-... |
01f7db1a718ede6f9eba31bd8c7e0d28d389d7d4 | 95dcf8dea2baf2b4b0a60d438f27c35ae3dd3990 | /src/category_theory/limits/types.lean | 913ff6ca6bb45a9f382e8a8b8b53e130fdd9375d | [
"Apache-2.0"
] | permissive | uniformity1/mathlib | 829341bad9dfa6d6be9adaacb8086a8a492e85a4 | dd0e9bd8f2e5ec267f68e72336f6973311909105 | refs/heads/master | 1,588,592,015,670 | 1,554,219,842,000 | 1,554,219,842,000 | 179,110,702 | 0 | 0 | Apache-2.0 | 1,554,220,076,000 | 1,554,220,076,000 | null | UTF-8 | Lean | false | false | 3,657 | lean | -- Copyright (c) 2018 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Scott Morrison, Reid Barton
import category_theory.limits.limits
universes v u -- declare the `v`'s first; see `category_theory.category` for an explanation
open category_theo... |
575ed67c833205b0d26de017d8926f64408c87c7 | 7b02c598aa57070b4cf4fbfe2416d0479220187f | /archive/smash_assoc.hlean | 772bd3d4ac52a13e0c80438e8ec96755ed6f4834 | [
"Apache-2.0"
] | permissive | jdchristensen/Spectral | 50d4f0ddaea1484d215ef74be951da6549de221d | 6ded2b94d7ae07c4098d96a68f80a9cd3d433eb8 | refs/heads/master | 1,611,555,010,649 | 1,496,724,191,000 | 1,496,724,191,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 24,008 | hlean | -- Authors: Floris van Doorn
-- In collaboration with Stefano, Robin
import ..homotopy.smash
open bool pointed eq equiv is_equiv sum bool prod unit circle cofiber prod.ops wedge is_trunc
function red_susp unit sigma
namespace smash
variables {A B C : Type*}
open pushout
definition prod3_of_sum3 [unfold ... |
c0c9b40b7a366f676fa0fdf395aa41c098246ad1 | 1abd1ed12aa68b375cdef28959f39531c6e95b84 | /src/data/polynomial/derivative.lean | b95c210e4d7cf8d61a97b0465780bcaacc1fd66f | [
"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 | 13,977 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Johannes Hölzl, Scott Morrison, Jens Wagemaker
-/
import data.polynomial.eval
/-!
# The derivative map on polynomials
## Main definitions
* `polynomial.derivative`: The ... |
89b2f69bafefa7d585eec998f30e029219dedcd3 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/algebra/free.lean | 3718548a956905e075ff8d6a6adfee5c8ed8aee2 | [
"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 | 15,556 | lean | /-
Copyright (c) 2019 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
1. Free magma of a type (traversable, decidable equality).
2. Free semigroup of a magma.
3. Free semigroup of a type (traversable, decidable equality).
And finally, magma.free_s... |
e2ab2bcb9871fbcf9b7102e6521996a39745eb62 | 97f752b44fd85ec3f635078a2dd125ddae7a82b6 | /hott/init/funext.hlean | 44af4eff029c0acd2b5afee59ce0bb1556f15ad9 | [
"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 | 10,553 | hlean | /-
Copyright (c) 2014 Jakob von Raumer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jakob von Raumer, Floris van Doorn
Ported from Coq HoTT
-/
prelude
import .trunc .equiv .ua
open eq is_trunc sigma function is_equiv equiv prod unit prod.ops lift
/-
We now pro... |
f9beaaaa1d2f193714938fc5dba0e2ca38113df1 | 9a0b1b3a653ea926b03d1495fef64da1d14b3174 | /tidy/rewrite_search/metric/edit_distance_svm.lean | 3e81e1be76149f536fa4aa87982ce01e1fb1a4e3 | [
"Apache-2.0"
] | permissive | khoek/mathlib-tidy | 8623b27b4e04e7d598164e7eaf248610d58f768b | 866afa6ab597c47f1b72e8fe2b82b97fff5b980f | refs/heads/master | 1,585,598,975,772 | 1,538,659,544,000 | 1,538,659,544,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,574 | lean | import tidy.rewrite_search.core
import tidy.rewrite_search.metric.edit_distance
import libk
open tidy.rewrite_search
open tidy.rewrite_search.edit_distance
open tidy.rewrite_search.metric.edit_distance
namespace tidy.rewrite_search.metric.edit_distance.weight.svm
variables {α δ : Type} (g : search_state α ed_state ... |
988ab803ec19fd9639604f0e0f753b868788bbd3 | 3dc4623269159d02a444fe898d33e8c7e7e9461b | /.github/workflows/project_1_a_decrire/lean-scheme-submission/src/to_mathlib/localization/localization_tests/localisation_test_2.lean | e256e0ecd8217dc54c4c7c67aa328ad2fae56d60 | [] | no_license | Or7ando/lean | cc003e6c41048eae7c34aa6bada51c9e9add9e66 | d41169cf4e416a0d42092fb6bdc14131cee9dd15 | refs/heads/master | 1,650,600,589,722 | 1,587,262,906,000 | 1,587,262,906,000 | 255,387,160 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,508 | lean | /-
Second localization test. If e^2 = e then R[1/e] ≅ R[1/(1-e)].
-/
import to_mathlib.localization.localization_alt
-- By Kenny.
example {R : Type*} [comm_ring R] (e : R) (he : e * e = e) : localization_alt.is_localization (powers e) (ideal.quotient.mk (ideal.span {1-e})) :=
begin
have H1 : ideal.quotient.mk (... |
f7d754f63cd97072d6a734a706deb251ac0aaecc | 3bdd27ffdff3ffa22d4bb010eba695afcc96bc4a | /src/combinatorics/simplicial_complex/sperner.lean | f4bc1be6d3a9660956732e4d26c114ce314b8546 | [] | no_license | mmasdeu/brouwerfixedpoint | 684d712c982c6a8b258b4e2c6b2eab923f2f1289 | 548270f79ecf12d7e20a256806ccb9fcf57b87e2 | refs/heads/main | 1,690,539,793,996 | 1,631,801,831,000 | 1,631,801,831,000 | 368,139,809 | 4 | 3 | null | 1,624,453,250,000 | 1,621,246,034,000 | Lean | UTF-8 | Lean | false | false | 9,060 | lean | /-
Copyright (c) 2021 Yaël Dillies, Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies, Bhavik Mehta
-/
import combinatorics.simplicial_complex.topology
import data.nat.parity
namespace affine
open_locale classical affine big_operators
open set... |
c824bc55e8ca99b052c73ee77fa8e9aef88b39eb | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/private_names.lean | 6013ed6c35f5a477c6708457827221bcce6254c9 | [
"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 | 190 | lean | namespace bla
section
private definition foo : inhabited Prop :=
inhabited.mk false
attribute [instance, priority 1000] foo
example : (default : Prop) = false :=
rfl
end
end bla
|
3a965472274de1a6b1fdec4a5e6fc3efb91b0791 | 60bf3fa4185ec5075eaea4384181bfbc7e1dc319 | /src/game/sets/sets_level01.lean | 9a51bd7a8a0057d9ca0833861aab08427fb44569 | [
"Apache-2.0"
] | permissive | anrddh/real-number-game | 660f1127d03a78fd35986c771d65c3132c5f4025 | c708c4e02ec306c657e1ea67862177490db041b0 | refs/heads/master | 1,668,214,277,092 | 1,593,105,075,000 | 1,593,105,075,000 | 264,269,218 | 0 | 0 | null | 1,589,567,264,000 | 1,589,567,264,000 | null | UTF-8 | Lean | false | false | 2,194 | lean | import data.set.basic -- hide
import kb_defs -- hide
namespace xena -- hide
open_locale classical -- hide
variable X : Type -- we will think of X as a set here
/-
# Chapter 1 : Sets
## Level 1 : Introduction to sets.
This chapter assumes you are familiar with the following tactics:
`rw`, `intro`, `apply`, `exact... |
456cd8e90808138c3d17e8393b2e5795f86193cf | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/ring_theory/algebraic_independent.lean | 2cafbefcdae849f14f9b8263c6debdc44b8e2f6d | [
"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 | 22,082 | lean | /-
Copyright (c) 2021 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import ring_theory.adjoin.basic
import linear_algebra.linear_independent
import ring_theory.mv_polynomial.basic
import data.mv_polynomial.supported
import ring_theory.alg... |
b52cd72b7a4ae51eddcb446783837259be4552c6 | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /tests/lean/run/meta7.lean | b4b976f6598d783b6b60d4abb4d421c883c2d2ed | [
"Apache-2.0"
] | permissive | WojciechKarpiel/lean4 | 7f89706b8e3c1f942b83a2c91a3a00b05da0e65b | f6e1314fa08293dea66a329e05b6c196a0189163 | refs/heads/master | 1,686,633,402,214 | 1,625,821,189,000 | 1,625,821,258,000 | 384,640,886 | 0 | 0 | Apache-2.0 | 1,625,903,617,000 | 1,625,903,026,000 | null | UTF-8 | Lean | false | false | 4,862 | lean | import Lean.Meta
open Lean
open Lean.Meta
partial def fact : Nat → Nat
| 0 => 1
| n+1 => (n+1)*fact n
set_option trace.Meta.debug true
set_option trace.Meta.check false
def print (msg : MessageData) : MetaM Unit := do
trace[Meta.debug] msg
def checkM (x : MetaM Bool) : MetaM Unit :=
unless (← x) do throwError "c... |
de4de36ab33b1e420638d7d59fb22dcf8dab1de4 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Init/Data/UInt/Log2.lean | 3e6bb6e18f0a4497e88bdb8618e01833b5372922 | [
"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 | 640 | lean | /-
Copyright (c) 2022 Henrik Böving. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Henrik Böving
-/
prelude
import Init.Data.Fin.Log2
@[extern "lean_uint8_log2"]
def UInt8.log2 (a : UInt8) : UInt8 := ⟨Fin.log2 a.val⟩
@[extern "lean_uint16_log2"]
def UInt16.log2 (a :... |
40e623c2558c0577bb62e8cf2f3247aba94b03df | 130c49f47783503e462c16b2eff31933442be6ff | /src/Lean/Elab/Match.lean | f3ce6a9d37da9c83640952693cb487f3697c74fe | [
"Apache-2.0"
] | permissive | Hazel-Brown/lean4 | 8aa5860e282435ffc30dcdfccd34006c59d1d39c | 79e6732fc6bbf5af831b76f310f9c488d44e7a16 | refs/heads/master | 1,689,218,208,951 | 1,629,736,869,000 | 1,629,736,896,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 44,848 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Util.CollectFVars
import Lean.Meta.Match.MatchPatternAttr
import Lean.Meta.Match.Match
import Lean.Meta.SortLocalDecls
import Lean.Meta.Generali... |
39e55cd8a65ebc48f3d690d40260e147ab907e69 | efa51dd2edbbbbd6c34bd0ce436415eb405832e7 | /20170116_POPL/debug/has_to_string_break.lean | 755972072736c8e7c1a10e873756b230bbf8fac2 | [
"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,828 | lean | /- We revist an example from earlier, showing how the debugger
can be used to interactively debug & introspect on tactics. -/
/- First we import the debugger. -/
import tools.debugger
/- Then we set the option which enables the debugger. -/
set_option debugger true
/- We then set the option which enables autorun, wh... |
df5bf1ce30d026d04a825f1b539bc4ed9c1925d2 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/group_theory/submonoid/centralizer.lean | 23c2c3fb1e0e5a1897244e6212f35fe70beb02f0 | [
"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 | 2,412 | lean | /-
Copyright (c) 2021 Thomas Browning. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Thomas Browning
-/
import group_theory.subsemigroup.centralizer
import group_theory.submonoid.center
/-!
# Centralizers of magmas and monoids
> THIS FILE IS SYNCHRONIZED WITH MATHLI... |
68534bb66b6bd0d7f8ed28fc7ef92125222a11a0 | ba4794a0deca1d2aaa68914cd285d77880907b5c | /src/game/world8/level6.lean | ab52e9cb80c7dea9739e8dc53548fa2bc220f50d | [
"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 | 807 | lean | import game.world8.level5 -- hide
namespace mynat -- hide
/-
# Advanced Addition World
## Level 5: `add_left_cancel`
The theorem `add_left_cancel` is the theorem that you can cancel on the left
when you're doing addition -- if `t + a = t + b` then `a = b`.
There is a three-line proof which ends in `exact add_right... |
2b0022e2bf45b2756b4d892a0cd2e239bf32eba3 | 5ae26df177f810c5006841e9c73dc56e01b978d7 | /src/category_theory/limits/opposites.lean | 3d417f6813bc1dc1950c8391c2605d3268dcd7c8 | [
"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 | 3,442 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Floris van Doorn
-/
import category_theory.limits.limits category_theory.discrete_category
universes v u
open category_theory
open category_theory.functor
open opposi... |
aeafbea8233240c2b37ebafa17edff54dea934e5 | 26bff4ed296b8373c92b6b025f5d60cdf02104b9 | /tests/lean/run/match_tac4.lean | b7e9ec153e3c4e5951f695b387c70410d3003831 | [
"Apache-2.0"
] | permissive | guiquanz/lean | b8a878ea24f237b84b0e6f6be2f300e8bf028229 | 242f8ba0486860e53e257c443e965a82ee342db3 | refs/heads/master | 1,526,680,092,098 | 1,427,492,833,000 | 1,427,493,281,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 736 | lean | notation `⟪`:max t:(foldr `,` (e r, and.intro e r)) `⟫`:0 := t
check ⟪ trivial, trivial, trivial ⟫
theorem tst (a b c d : Prop) : a ∧ b ∧ c ∧ d ↔ d ∧ c ∧ b ∧ a :=
begin
apply iff.intro,
begin
intro H,
match H with
| ⟪ H₁, H₂, H₃, H₄ ⟫ := ⟪ H₄, H₃, H₂, H₁ ⟫
end
end,
begin
intro H,
match... |
153e6f3b03780a409c076205e2155b630a5d6ea9 | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/algebra/gcd_monoid/basic.lean | c2102df132c3fcee2967a78fa2e92052a0eb9990 | [
"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 | 46,439 | 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, Jens Wagemaker
-/
import algebra.associated
import algebra.group_power.lemmas
import data.nat.gcd
/-!
# Monoids with normalization functions, `gcd`, and `lcm`
This f... |
8dafe20311360b238c91909ca2003cd567adbee5 | 40ad357bbd0d327dd1e3e7f7beb868bd4e5b0a9d | /src/temporal_logic/default.lean | 2acf527207e1314901d355962c2776e718f2ffcc | [] | no_license | unitb/temporal-logic | 9966424f015976d5997a9ffa30cbd77cc3a9cb1c | accec04d1b09ca841be065511c9e206b725b16e9 | refs/heads/master | 1,633,868,382,769 | 1,541,072,223,000 | 1,541,072,223,000 | 114,790,987 | 5 | 3 | null | null | null | null | UTF-8 | Lean | false | false | 73 | lean |
import .lemmas
import .refinement
import .instances
import .feasibility
|
91bb7e1c723c58090603f3e7b53daa908054dbad | aa0f036c35a21f3f7b2e216128bf71bb1c7e945d | /semantics.lean | e40d4ea137bf61212df2bf88cdbcc581a8c3117b | [] | no_license | Kha/semantics-lean | 575c2e91f0b8faad0d1bb997f43a7a113c107c34 | 8f38ae8a94b0870857f1d7bc11af351dbac9c982 | refs/heads/master | 1,589,907,286,533 | 1,500,454,312,000 | 1,500,466,025,000 | 34,985,640 | 3 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 6,879 | lean | /- Formulization of the operational semantics of a simple While language
Based on the lecture notes of 'Semantics of programming languages', KIT, 2015
https://pp.info.uni-karlsruhe.de/lehre/SS2015/semantik/
-/
import tools.auto.finish
namespace function
variables {α β : Type}
variables [decidable_eq α]
d... |
2e289bed5997e81c5bf9cf4d992a274d2882c68d | 75db7e3219bba2fbf41bf5b905f34fcb3c6ca3f2 | /tests/lean/run/app_builder4.lean | 464f9305fe3cf8f7277088ce82df148587da80e3 | [
"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 | 351 | lean | import data.list
constants f : nat → nat → nat
constants a b : nat
axiom H2 : a = b
set_option pp.all true
#app_builder congr (eq.refl (f a)), H2
constants g : ∀ {A :Type}, A → A → A
variables A : Type
variables l₁ l₂ l₃: list A
variables H : l₂ = l₃
#app_builder congr (eq.refl (g l₁)), H
#app_builder congr_arg (g ... |
a6209aba5b7473dc5ff56cc00ba13fdd5c8c45bd | 1a61aba1b67cddccce19532a9596efe44be4285f | /hott/algebra/category/yoneda.hlean | 2fdb50d061b9dd406b8c6fd8ccaa336ee1276ec0 | [
"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 | 9,380 | 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
-/
--note: modify definition in category.set
import .constructions.functor .constructions.hset .constructions.product .constructions.opposite
open category eq cate... |
8d47e2e864f3a4bef51d09a153e30622335cde3c | a8c03ed21a1bd6fc45901943b79dd6574ea3f0c2 | /lpo.lean | 1e0249af85c8788e14074df6fcbde112b114e7cb | [] | no_license | gebner/resolution.lean | 716c355fbb5204e5c4d0c5a7f3f3cc825892a2bf | c6fafe06fba1cfad73db68f2aa474b29fe892a2b | refs/heads/master | 1,601,111,444,528 | 1,475,256,701,000 | 1,475,256,701,000 | 67,711,151 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,120 | lean | -- Polytime version of lexicographic path order as described in:
-- Things to know when implementing LPO, Bernd Löchner, ESFOR 2004
import utils
open expr decidable monad
def lex {T} [decidable_eq T] (gt : T → T → bool) : list T → list T → bool
| (s::ss) (t::ts) := if s = t then lex ss ts else gt s t
| _ _ := ff
def ... |
eff8497d3e60e962ff7748218859c14c085bf6ad | 94e33a31faa76775069b071adea97e86e218a8ee | /src/topology/algebra/module/locally_convex.lean | 31b178cdec7db1f35fb626de6039440bc3aae004 | [
"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 | 6,543 | lean | /-
Copyright (c) 2022 Anatole Dedecker. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anatole Dedecker
-/
import analysis.convex.topology
/-!
# Locally convex topological modules
A `locally_convex_space` is a topological semimodule over an ordered semiring in which a... |
705e5d582b14836c7a5d22a61c4df345d926f2a2 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/tactic/interactive_expr.lean | cb7ec0fb7a923a03051daa611d32759afc8a071f | [
"Apache-2.0"
] | permissive | jjgarzella/mathlib | 96a345378c4e0bf26cf604aed84f90329e4896a2 | 395d8716c3ad03747059d482090e2bb97db612c8 | refs/heads/master | 1,686,480,124,379 | 1,625,163,323,000 | 1,625,163,323,000 | 281,190,421 | 2 | 0 | Apache-2.0 | 1,595,268,170,000 | 1,595,268,169,000 | null | UTF-8 | Lean | false | false | 17,483 | lean | /-
Copyright (c) 2020 E.W.Ayers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: E.W.Ayers
-/
/-!
# Widgets used for tactic state and term-mode goal display
The vscode extension supports the display of interactive widgets.
Default implementation of these widgets are ... |
f97c357f27595fa4bed0e64b19a17473c129f4f6 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/algebraic_geometry/prime_spectrum.lean | 92b66687059a1bee8209e62f12ac590cebe5f6db | [
"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 | 13,128 | 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 topology.opens
import ring_theory.ideal_operations
import linear_algebra.finsupp
/-!
# Prime spectrum of a commutative ring
The prime spectrum of a commutat... |
42b2e1c15216d02730f4994c68e28eb468d3ffdb | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/limits/shapes/normal_mono.lean | bb9c181c56da74f3a32af6c8387c3662b8217047 | [] | 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,555 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Bhavik Mehta
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.category_theory.limits.shapes.regular_mono
import Mathlib.category_theory.lim... |
bede0e4caa5a18736625757254e99c994b924a8e | d436468d80b739ba7e06843c4d0d2070e43448e5 | /src/topology/sequences.lean | d873d121957b6372773590e9ce527d90d0fbe5a9 | [
"Apache-2.0"
] | permissive | roro47/mathlib | 761fdc002aef92f77818f3fef06bf6ec6fc1a28e | 80aa7d52537571a2ca62a3fdf71c9533a09422cf | refs/heads/master | 1,599,656,410,625 | 1,573,649,488,000 | 1,573,649,488,000 | 221,452,951 | 0 | 0 | Apache-2.0 | 1,573,647,693,000 | 1,573,647,692,000 | null | UTF-8 | Lean | false | false | 9,961 | lean | /-
Copyright (c) 2018 Jan-David Salchow. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jan-David Salchow
Sequences in topological spaces.
In this file we define sequences in topological spaces and show how they are related to
filters and the topology. In particular,... |
951b58f9dd28da8f3192829382a8998cb1fa697f | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/ring_theory/polynomial/bernstein.lean | 5d6bdb6b7ab938ededefd0a55447cfb4406f9796 | [
"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 | 15,815 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import data.polynomial.derivative
import data.polynomial.algebra_map
import data.mv_polynomial.pderiv
import data.nat.choose.sum
import linear_algebra.basis
import ri... |
a7512c6f13b5c3762102d669a2834dbbe1375206 | 675b8263050a5d74b89ceab381ac81ce70535688 | /src/geometry/euclidean/monge_point.lean | db500f97b0142d0f25310ee83b6c77960dccc802 | [
"Apache-2.0"
] | permissive | vozor/mathlib | 5921f55235ff60c05f4a48a90d616ea167068adf | f7e728ad8a6ebf90291df2a4d2f9255a6576b529 | refs/heads/master | 1,675,607,702,231 | 1,609,023,279,000 | 1,609,023,279,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 38,713 | 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.circumcenter
noncomputable theory
open_locale big_operators
open_locale classical
open_locale real
open_locale real_inner_product_space
/-!
# ... |
2a8442ddcc9739295e04d6738bc862405547a2b8 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/group_theory/group_action/basic.lean | 5d1998374dde329ecc5cf62f81f7749292439429 | [
"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 | 24,717 | 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 group_theory.group_action.defs
import group_theory.group_action.group
import group_theory.quotient_group
import data.setoid.basic
import data.fintype.card
/-!
# B... |
fe0f0f16232f0640898df3c15a804b4cc8dd9811 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/probability/notation.lean | 5b6d45c1d4f42b76351ddc051f91f3d84f1137dd | [
"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 | 2,499 | lean | /-
Copyright (c) 2021 Rémy Degenne. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Rémy Degenne
-/
import probability.probability_mass_function.basic
import measure_theory.function.conditional_expectation.basic
/-! # Notations for probability theory
> THIS FILE IS SY... |
6b238216c4350eed0415dc12f96a538fa7e13e8c | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/ring_theory/multiplicity.lean | cc0082ea38672a234e2fbc57511510253288ffd1 | [
"Apache-2.0"
] | permissive | rmitta/mathlib | 8d90aee30b4db2b013e01f62c33f297d7e64a43d | 883d974b608845bad30ae19e27e33c285200bf84 | refs/heads/master | 1,585,776,832,544 | 1,576,874,096,000 | 1,576,874,096,000 | 153,663,165 | 0 | 2 | Apache-2.0 | 1,544,806,490,000 | 1,539,884,365,000 | Lean | UTF-8 | Lean | false | false | 17,300 | lean | /-
Copyright (c) 2018 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis, Chris Hughes
-/
import algebra.associated data.int.gcd algebra.big_operators
import tactic.converter.interactive
variables {α : Type*}
open nat roption
theorem nat... |
1ed0252fa17fb82729de317fe7b70a1fbe9ac320 | 274748215b6d042f0d9c9a505f9551fa8e0c5f38 | /problem_sheets/sheet_1/question_1.lean | c80e7a07cd19f1f12e1f6ec6e590c1db28b8d408 | [
"Apache-2.0"
] | permissive | ImperialCollegeLondon/M4P33 | 878ecb515c77d20cc799ff1ebd78f1bf4fd65c12 | 1a179372db71ad6802d11eacbc1f02f327d55f8f | refs/heads/master | 1,607,519,867,193 | 1,583,344,297,000 | 1,583,344,297,000 | 233,316,107 | 59 | 4 | Apache-2.0 | 1,579,285,778,000 | 1,578,788,367,000 | Lean | UTF-8 | Lean | false | false | 2,590 | lean | import affine_algebraic_set.Zariski -- Zariski topology
import affine_algebraic_set.V_and_I -- 𝕍 and 𝕀 basics
import for_mathlib.topological_space -- silly fact about closed sets I couldn't find
open affine_algebraic_set
open_locale classical -- classical logic
variables (σ : Type*) (k : Type*) [integral_domain k]... |
26c1e80c9dbc9dbac7205eafad8dc4a0ae24e372 | 9a208b2f36ebdb9b100b123c6aa00063414860a7 | /src/stactic.lean | f179e84e814bdd1f5665762ba3d9c54794d29d7c | [
"Apache-2.0"
] | permissive | SnobbyDragon/sudoku | 67b0dc46ff3484e29b0d99e1b82d66896ce13ff0 | 3aa976818a7c950c85d6e7f1a70d329125fcea9b | refs/heads/master | 1,675,441,677,467 | 1,609,123,194,000 | 1,609,123,194,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 13,185 | lean | /-
Copyright (c) 2020 Markus Himmel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel
-/
import basic
import tactic.norm_num
import init.meta.has_reflect
universes u v w
open tactic
def list.mfirst' {m : Type → Type v} [monad m] {α : Type} [inhabited α] ... |
12505a3a2b352dfc53fefdb2f4cf5d0284197e87 | a07fc1a5c10c8dc40360ecb554c3aed54740f945 | /src/ck_proc08_2x3.lean | 3d48f45b563b8f7bbd5457500e08163c7cffc308 | [] | no_license | mkummini/ideal-membership | 2a39b4b07d61f2177d7e584a53b5b2279097b150 | 59f823e657939e386d0e53a5d9be47392bab3e41 | refs/heads/master | 1,690,298,605,933 | 1,629,856,697,000 | 1,629,856,697,000 | 384,842,535 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,246 | lean | import data.mv_polynomial.basic
import data.mv_polynomial.comm_ring
import data.zmod.basic
import ring_theory.ideal.operations
open mv_polynomial
noncomputable theory
section
-- 2x3 case.
abbreviation R := mv_polynomial (fin 6) (zmod 101)
def f1 : R := (X 0)*(X 3)
def f2 : R := (X 1)*(X 4)
def f3 : R := (X 2)*(X ... |
0d6a6413d285d1e2f73650a7a0ed00a6db677e7e | fe84e287c662151bb313504482b218a503b972f3 | /src/data/prat.lean | a647fa62247cdb46dace23a0cf201ce8abfe7f68 | [] | no_license | NeilStrickland/lean_lib | 91e163f514b829c42fe75636407138b5c75cba83 | 6a9563de93748ace509d9db4302db6cd77d8f92c | refs/heads/master | 1,653,408,198,261 | 1,652,996,419,000 | 1,652,996,419,000 | 181,006,067 | 4 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 16,033 | lean | import data.rat data.pnat.basic data.pnat.factors
import data.rat_extra
def prat := {q : ℚ // q > 0}
notation ℚ+ := prat
namespace prat
instance to_rat : has_coe ℚ+ ℚ := ⟨subtype.val⟩
theorem pos (p : ℚ+) : (p : ℚ) > 0 := p.property
theorem eq {p q : ℚ+} : (p : ℚ) = (q : ℚ) → p = q := subtype.eq
instance : comm_... |
c68d4815b9084829a41d069c14ab89f7b3c674a2 | 80746c6dba6a866de5431094bf9f8f841b043d77 | /src/data/int/basic.lean | 9b6398c83daf4b24ad1e536dfebdce8db40b841d | [
"Apache-2.0"
] | permissive | leanprover-fork/mathlib-backup | 8b5c95c535b148fca858f7e8db75a76252e32987 | 0eb9db6a1a8a605f0cf9e33873d0450f9f0ae9b0 | refs/heads/master | 1,585,156,056,139 | 1,548,864,430,000 | 1,548,864,438,000 | 143,964,213 | 0 | 0 | Apache-2.0 | 1,550,795,966,000 | 1,533,705,322,000 | Lean | UTF-8 | Lean | false | false | 47,590 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
The integers, with addition, multiplication, and subtraction.
-/
import data.nat.basic data.list.basic algebra.char_zero algebra.order_functions
open nat
namespace int
... |
8e8d2d4b3c4df85ea370ac9e38d51a3766f40946 | 592ee40978ac7604005a4e0d35bbc4b467389241 | /Library/generated/mathscheme-lean/LeftAbsorption.lean | 535c9c6b8b7af611ddac72f0c58cdc7ec73822a3 | [] | 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 | 8,940 | 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 LeftAbsorption
structure LeftAbsorption (A : Type) : Type :=
(times : (A → (A → A)))
(plus : (A → (A → A)))
(leftAbsorp_times_plus : (∀ {x y : A} , (time... |
d84794a0b4eae11dd269d20da505b8e6c197f57e | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/set_theory/cardinal.lean | 2a19a5c5041333216a68e723b9be12707c2d0a83 | [
"Apache-2.0"
] | permissive | rmitta/mathlib | 8d90aee30b4db2b013e01f62c33f297d7e64a43d | 883d974b608845bad30ae19e27e33c285200bf84 | refs/heads/master | 1,585,776,832,544 | 1,576,874,096,000 | 1,576,874,096,000 | 153,663,165 | 0 | 2 | Apache-2.0 | 1,544,806,490,000 | 1,539,884,365,000 | Lean | UTF-8 | Lean | false | false | 45,209 | 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, Mario Carneiro
-/
import data.set.countable data.quot logic.function set_theory.schroeder_bernstein
/-!
# Cardinal Numbers
We define cardinal numbers as a quotient of... |
958aa26300a9929751453d97dbdb08a47cb674c9 | 3dc4623269159d02a444fe898d33e8c7e7e9461b | /.github/workflows/geo/point_double.lean | e2ede0c7a91b3b644430f34a58299d3bd353fae9 | [] | no_license | Or7ando/lean | cc003e6c41048eae7c34aa6bada51c9e9add9e66 | d41169cf4e416a0d42092fb6bdc14131cee9dd15 | refs/heads/master | 1,650,600,589,722 | 1,587,262,906,000 | 1,587,262,906,000 | 255,387,160 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,245 | lean | import tactic
import algebra.category.CommRing.basic
variables (R : Type)[comm_ring R]
structure R_exp :=
(a_0 : R)
(a_e : R)
namespace R_exp
mk_simp_attribute R_exp_ " trivial simplification "
meta def R_exp__ring : tactic unit :=
`[iterate 2 { simp only with R_exp_,ring}]
run_cmd add_interactive [`R_exp__ring]
@[e... |
3bd94a6a006975611c2013c87803413310233cb1 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/adamTC2.lean | 92690c78d4cf7b6fa53540ba9002e881bf901200 | [
"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,703 | lean | inductive Expr where
| nat : Nat → Expr
| plus : Expr → Expr → Expr
| bool : Bool → Expr
| and : Expr → Expr → Expr
inductive Ty where
| nat
| bool
deriving DecidableEq
inductive HasType : Expr → Ty → Prop
| nat : HasType (.nat v) .nat
| plus : HasType a .nat → HasType b .nat → HasType (.plus a b... |
4975e9c686b055e916a8f4bbd64cf86b798fcd45 | 1abd1ed12aa68b375cdef28959f39531c6e95b84 | /src/data/pequiv.lean | 5381f4c00ef5fb01b8a8dd962bcbe2b8bd6365ef | [
"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 | 13,638 | lean | /-
Copyright (c) 2019 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import data.set.lattice
/-!
# Partial Equivalences
In this file, we define partial equivalences `pequiv`, which are a bijection between a subset of `α`
and a subset of... |
bc351dccc3668516dbec3e95e362358ffbcfc124 | b815abf92ce063fe0d1fabf5b42da483552aa3e8 | /library/debugger/default.lean | 23cd7d0f01f6c9d22f3f0e690165546f220ddbf4 | [
"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 | 198 | 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
-/
import debugger.util debugger.cli
|
868c5da183114961ec31a4be968c289fc6c62884 | 947b78d97130d56365ae2ec264df196ce769371a | /tests/lean/run/def15.lean | 6fb1a2f273fdab1eedd777e4f0d31a813e091fb4 | [
"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 | 309 | lean | new_frontend
def head {α} : (as : List α) → as ≠ [] → α
| [], h => absurd rfl h
| a::as, _ => a
theorem head_cons {α} (a : α) (as : List α) : head (a::as) (fun h => List.noConfusion h) = a :=
rfl
theorem head_cons' {α} (a : α) (as : List α) (h : a::as ≠ []) : head (a::as) h = a :=
rfl
|
907a6cac6ded1bde0c6ac4e3ddfd490697c20775 | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/ring_theory/algebraic.lean | 0281444e18e9aa3b2429bc60eb61f3da7b1bbbe4 | [
"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 | 4,674 | lean | /-
Copyright (c) 2019 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import linear_algebra.finite_dimensional
import ring_theory.integral_closure
import data.polynomial.integral_normalization
/-!
# Algebraic elements and algebraic ex... |
4303761942764632f06817b44647e90f80b81a54 | a45212b1526d532e6e83c44ddca6a05795113ddc | /test/mk_iff_of_inductive.lean | 3d2e6d7b37ff798140509bb151ad8f5799872ca3 | [
"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 | 910 | lean | import tactic.mk_iff_of_inductive_prop
import data.list data.list.perm data.multiset
run_cmd tactic.mk_iff_of_inductive_prop `list.chain `test.chain_iff
run_cmd tactic.mk_iff_of_inductive_prop `false `test.false_iff
run_cmd tactic.mk_iff_of_inductive_prop `true `test.true_iff
run_cmd tactic.mk_iff_of_induct... |
771ebd656e28ef761c1cd6a8031a8a48d795ade4 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/polynomial/cancel_leads.lean | 4275643fba7da656d3ee6a78f491741ac0ffa023 | [
"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 | 2,908 | lean | /-
Copyright (c) 2020 Aaron Anderson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson
-/
import data.polynomial.degree.definitions
import tactic.compute_degree
import data.polynomial.degree.lemmas
/-!
# Cancel the leading terms of two polynomials
> THIS ... |
0164ef1dbbe77fa33ceb24d851f7b873d677e4de | e0f9ba56b7fedc16ef8697f6caeef5898b435143 | /src/tactic/slice.lean | 5649e001d1a3ad9a4e057b333c0ff23d4f606ea2 | [
"Apache-2.0"
] | permissive | anrddh/mathlib | 6a374da53c7e3a35cb0298b0cd67824efef362b4 | a4266a01d2dcb10de19369307c986d038c7bb6a6 | refs/heads/master | 1,656,710,827,909 | 1,589,560,456,000 | 1,589,560,456,000 | 264,271,800 | 0 | 0 | Apache-2.0 | 1,589,568,062,000 | 1,589,568,061,000 | null | UTF-8 | Lean | false | false | 3,502 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.category
open category_theory
-- TODO someone might like to generalise this tactic to work with other associative structures.
namespace tact... |
185a82a2214aec975a036e2750c28afd54c0987a | 815d5098500e90b3fad5de3111ec5a8666698316 | /lists2.lean | 0c6cf656893892e64233bf4e1078c3003eb3e028 | [] | no_license | EgbertRijke/lists-in-lean | 5c8f69e02bfa7f9cdfc9a2bdac33e31db82858cc | 848015bada1470a3b5c13be0680169d75f79cbcf | refs/heads/master | 1,659,407,427,247 | 1,590,053,359,000 | 1,590,053,359,000 | 264,247,486 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 22,019 | lean | /- This is a short tutorial on lean for the Logic in Computer Science course at the university
of Ljubljana. -/
namespace logika_v_racunalnistvu
/- We typically want to be universe polymorphic in lean, so we introduce a universe variable u. -/
universes u v w
/- Definitions of inductive types are made using the i... |
6d2d61f96f490802cf364ad0a8adff88fecfb7ac | 453dcd7c0d1ef170b0843a81d7d8caedc9741dce | /data/real/basic.lean | b96f3c808b5cc5d95f9402502d129ecb6268995a | [
"Apache-2.0"
] | permissive | amswerdlow/mathlib | 9af77a1f08486d8fa059448ae2d97795bd12ec0c | 27f96e30b9c9bf518341705c99d641c38638dfd0 | refs/heads/master | 1,585,200,953,598 | 1,534,275,532,000 | 1,534,275,532,000 | 144,564,700 | 0 | 0 | null | 1,534,156,197,000 | 1,534,156,197,000 | null | UTF-8 | Lean | false | false | 24,608 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
The (classical) real numbers ℝ. This is a direct construction
from Cauchy sequences.
-/
import order.conditionally_complete_lattice data.real.cau_seq
algebra.big_oper... |
34a86e4a3d7d3bcd9c854bc9f8a497465ac126c6 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/group_theory/perm/concrete_cycle.lean | 7fa849d181429fba16bcd86ddf35a7d28afcd45a | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 19,607 | lean | /-
Copyright (c) 2021 Yakov Pechersky. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yakov Pechersky
-/
import group_theory.perm.list
import data.list.cycle
import group_theory.perm.cycle_type
/-!
# Properties of cyclic permutations constructed from lists/cycles
In... |
f4dab2fb2edfef2b6c2719be4f34a4bf56501af6 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/algebra/group/semiconj.lean | 4579084c32947c3bbb3227ee2abb950a08bdb902 | [
"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 | 6,756 | lean | /-
Copyright (c) 2019 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
Some proofs and docs came from `algebra/commute` (c) Neil Strickland
-/
import algebra.group.units
/-!
# Semiconjugate elements of a semigroup
## Main definitions
... |
1b2c7f9b839d6d187637d9edbd635036d35b4462 | bb31430994044506fa42fd667e2d556327e18dfe | /src/order/jordan_holder.lean | fade2bc333fae7434392bcc1bba0f1a116c68298 | [
"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 | 30,661 | lean | /-
Copyright (c) 2021 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import order.lattice
import data.list.sort
import logic.equiv.fin
import logic.equiv.functor
import data.fintype.card
/-!
# Jordan-Hölder Theorem
This file proves the Jo... |
fdb25a2cd6244655dd33de53d80a5eb883f18228 | fecda8e6b848337561d6467a1e30cf23176d6ad0 | /src/algebra/ring/basic.lean | 819a4ad2c075dba1392ae1bad2112e6279da32d2 | [
"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 | 35,505 | 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, Floris van Doorn, Amelia Livingston, Yury Kudryashov,
Neil Strickland
-/
import algebra.divisibility
import data.set.basic
/-!
# Properties and homomo... |
b7cbfd5756211257cb854ba7b1e10de69e37efa7 | e61a235b8468b03aee0120bf26ec615c045005d2 | /src/Init/Lean/Meta/Tactic/Induction.lean | 5f7712b4940fb14fc4f1ef182bf6ef343efb9f2c | [
"Apache-2.0"
] | permissive | SCKelemen/lean4 | 140dc63a80539f7c61c8e43e1c174d8500ec3230 | e10507e6615ddbef73d67b0b6c7f1e4cecdd82bc | refs/heads/master | 1,660,973,595,917 | 1,590,278,033,000 | 1,590,278,033,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 11,218 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import Init.Lean.Meta.RecursorInfo
import Init.Lean.Meta.SynthInstance
import Init.Lean.Meta.Tactic.Util
import Init.Lean.Meta.Tactic.Revert
import ... |
ce5fcb9dc5deb99506487595191e5cd27f1baf94 | fe25de614feb5587799621c41487aaee0d083b08 | /stage0/src/Init/Meta.lean | 67c8d78966d0ae912c6bb49da88d893942fbd8e9 | [
"Apache-2.0"
] | permissive | pollend/lean4 | e8469c2f5fb8779b773618c3267883cf21fb9fac | c913886938c4b3b83238a3f99673c6c5a9cec270 | refs/heads/master | 1,687,973,251,481 | 1,628,039,739,000 | 1,628,039,739,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 32,478 | 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 and Sebastian Ullrich
Additional goodies for writing macros
-/
prelude
import Init.Data.Array.Basic
namespace Lean
@[extern c inline "lean_box(LEAN_VERSION_... |
a9865ff7d372ab7e47ddbabf76bb52016798945a | 1dd482be3f611941db7801003235dc84147ec60a | /src/measure_theory/probability_mass_function.lean | cad490534ead890a52f37861c4d51582de32ccff | [
"Apache-2.0"
] | permissive | sanderdahmen/mathlib | 479039302bd66434bb5672c2a4cecf8d69981458 | 8f0eae75cd2d8b7a083cf935666fcce4565df076 | refs/heads/master | 1,587,491,322,775 | 1,549,672,060,000 | 1,549,672,060,000 | 169,748,224 | 0 | 0 | Apache-2.0 | 1,549,636,694,000 | 1,549,636,694,000 | null | UTF-8 | Lean | false | false | 4,782 | 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
Probability mass function -- discrete probability measures
-/
import topology.instances.nnreal topology.instances.ennreal topology.algebra.infinite_sum
noncomputable the... |
33d1f1efba294dd4afa96b8909f44ba54b743481 | 02fbe05a45fda5abde7583464416db4366eedfbf | /library/data/rbtree/insert.lean | dcd4046eb6c091ef9e9942ba50d4ebaffa5f5f96 | [
"Apache-2.0"
] | permissive | jasonrute/lean | cc12807e11f9ac6b01b8951a8bfb9c2eb35a0154 | 4be962c167ca442a0ec5e84472d7ff9f5302788f | refs/heads/master | 1,672,036,664,637 | 1,601,642,826,000 | 1,601,642,826,000 | 260,777,966 | 0 | 0 | Apache-2.0 | 1,588,454,819,000 | 1,588,454,818,000 | null | UTF-8 | Lean | false | false | 33,462 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import data.rbtree.find
universes u v
local attribute [simp] rbnode.lift
namespace rbnode
variables {α : Type u}
open color
@[simp] lemma balance1_eq₁ (... |
3c43368406ebee5ecc4cd0bb9ba635b25b7fc403 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/ring_theory/algebraic.lean | b6d36448d4f79f5d6e86e91d26b5fef6f2831f89 | [] | 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,378 | lean | /-
Copyright (c) 2019 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.linear_algebra.finite_dimensional
import Mathlib.ring_theory.integral_closure
import Mathli... |
b8d4042465cc73b25593ac33785c07a4ff384765 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/category_theory/monad/algebra.lean | 0c62df9578e4e56cc3a7776d57f3566b358e1287 | [
"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 | 12,972 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Bhavik Mehta
-/
import category_theory.monad.basic
import category_theory.adjunction.basic
import category_theory.functor.epi_mono
/-!
# Eilenberg-Moore (co)algebras f... |
f7960482d9a1ded8059bf4575e251ba31cd7f031 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/topology/metric_space/gromov_hausdorff.lean | c278183534b47ed677d85a39a67dc9882112d38a | [
"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 | 55,704 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Sébastien Gouëzel
-/
import topology.metric_space.closeds
import set_theory.cardinal
import topology.metric_space.gromov_hausdorff_realized
import topology.metric_space.completion
/... |
48e8b14b36b81706dfa7ee12d9800191dbd75399 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/dynamics/circle/rotation_number/translation_number.lean | 4c340988b21349ab5c29b9fa245a9a716fc58d81 | [
"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 | 39,705 | 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 algebra.hom.iterate
import analysis.specific_limits.basic
import order.iterate
import order.semiconj_Sup
import topology.algebra.order.monotone_continu... |
11c946d88ee7e5e84d0796166bdce39675467094 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /stage0/src/Lean/Compiler/LCNF.lean | d0cc1f4e3d7c797f930d456f44e61173f9ae5a27 | [
"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 | 15,463 | 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.ProjFns
import Lean.ToExpr
import Lean.Util.Recognizers
import Lean.Meta.Match.MatcherInfo
import Lean.Meta.Transform
import Lean.Compiler.Inlin... |
bf6daf41cb37f5eca566db3dac1ff3e2f3503da3 | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/geometry/manifold/derivation_bundle.lean | 42f6bf867d1026165694d75769368783caec4cb2 | [
"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,329 | lean | /-
Copyright © 2020 Nicolò Cavalleri. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nicolò Cavalleri
-/
import geometry.manifold.algebra.smooth_functions
import ring_theory.derivation
/-!
# Derivation bundle
In this file we define the derivations at a point of a m... |
e00111b5bb6855be88317c3985eb4d570036b5aa | 60bf3fa4185ec5075eaea4384181bfbc7e1dc319 | /src/game/limits/seq_lim_add.lean | ee241764c1e0d6624b6477ce0d9a20938506beca | [
"Apache-2.0"
] | permissive | anrddh/real-number-game | 660f1127d03a78fd35986c771d65c3132c5f4025 | c708c4e02ec306c657e1ea67862177490db041b0 | refs/heads/master | 1,668,214,277,092 | 1,593,105,075,000 | 1,593,105,075,000 | 264,269,218 | 0 | 0 | null | 1,589,567,264,000 | 1,589,567,264,000 | null | UTF-8 | Lean | false | false | 1,244 | lean | import game.limits.L01defs
namespace xena -- hide
notation `|` x `|` := abs x -- hide
/-
Another basic result for working with sequences.
-/
/- Lemma
If $\lim_{n \to \infty} a_n = \alpha$ and $\lim_{n \to \infty} b_n = \beta$, then
$\lim_{n \to \infty} (a_n + b_n) = \alpha + \beta$
-/
lemma lim_add (a : ℕ → ℝ) (b ... |
eed18f5f182261a6c7087e0f7286b7b6f70f51fc | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /src/Init/Data/Queue/Basic.lean | 0542e175684a9a193405b703f768e40de5667574 | [
"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 | 960 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Daniel Selsam
Simple queue implemented using two lists.
Note: this is only a temporary placeholder.
-/
prelude
import Init.Data.Array
import Init.Data.Int
universes u v w
stru... |
3cae4f689c7c4ac027f71602368a54c6a5d4dbdb | 75db7e3219bba2fbf41bf5b905f34fcb3c6ca3f2 | /library/data/int/basic.lean | 57fc5302f6c86185404f27d2ef7d933a04194815 | [
"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 | 23,499 | 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, Jeremy Avigad
The integers, with addition, multiplication, and subtraction. The representation of the integers is
chosen to compute efficiently.
To faciliate prov... |
7e4db0c41ca81e5c580dfe3be4872b7c13c298ca | 5719a16e23dfc08cdea7a5bf035b81690f307965 | /stage0/src/Init/LeanInit.lean | 49f55a1d2b97ddfd12994a6101b948acd2d5b7f7 | [
"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 | 28,509 | 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 and Sebastian Ullrich
-/
prelude
import Init.Data.String.Basic
import Init.Data.Array.Basic
import Init.Data.UInt
import Init.Data.Hashable
import Init.Control... |
49b5ec371cf913fe15f54ef12002e831461d99a9 | 26ac254ecb57ffcb886ff709cf018390161a9225 | /src/data/mv_polynomial.lean | 67ea43a174bedfdb4e15aea42915bf61273bc183 | [
"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 | 59,751 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Johan Commelin, Mario Carneiro, Shing Tak Lam
-/
import data.polynomial.eval
import data.equiv.ring
import data.equiv.fin
import tactic.omega
/-!
# Multivariate polyno... |
2bcd3b4263bb44a0a72856d378f538132b9a1147 | 78269ad0b3c342b20786f60690708b6e328132b0 | /src/library_dev/data/nat/find.lean | 2072c95f9fa435ad530144a266fa65fe39be9106 | [] | no_license | dselsam/library_dev | e74f46010fee9c7b66eaa704654cad0fcd2eefca | 1b4e34e7fb067ea5211714d6d3ecef5132fc8218 | refs/heads/master | 1,610,372,841,675 | 1,497,014,421,000 | 1,497,014,421,000 | 86,526,137 | 0 | 0 | null | 1,490,752,133,000 | 1,490,752,132,000 | null | UTF-8 | Lean | false | false | 1,644 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Mario Carneiro
Choice function for decidable predicates on natural numbers.
This module provides the following two declarations:
find {p : nat → Prop}... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.