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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1193c9d46b939697fdbe8c9278652a3c121c42c0 | cf39355caa609c0f33405126beee2739aa3cb77e | /library/init/control/applicative.lean | f8d0e44e09af44b65fc7a7bb4b0e6ab96cc1a07d | [
"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 | 1,113 | 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, Sebastian Ullrich
-/
prelude
import init.control.functor
open function
universes u v
class has_pure (f : Type u → Type v) :=
(pure {α : Type u} : α → f α)
e... |
93d94c6164996399686799b9d33ad6c29a5eb062 | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /tests/lean/run/choiceMacroRules.lean | 197c2061680cdf035e4c29c07fbf23c75a6aa1db | [
"Apache-2.0"
] | permissive | collares/lean4 | 861a9269c4592bce49b71059e232ff0bfe4594cc | 52a4f535d853a2c7c7eea5fee8a4fa04c682c1ee | refs/heads/master | 1,691,419,031,324 | 1,618,678,138,000 | 1,618,678,138,000 | 358,989,750 | 0 | 0 | Apache-2.0 | 1,618,696,333,000 | 1,618,696,333,000 | null | UTF-8 | Lean | false | false | 441 | lean | syntax:65 (name := myAdd1) term "+++" term:65 : term
syntax:65 (name := myAdd2) term "+++" term:65 : term
macro_rules [myAdd1]
| `($a +++ $b) => `(Nat.add $a $b)
macro_rules [myAdd2]
| `($a +++ $b) => `(Append.append $a $b)
#check (1:Nat) +++ 3
theorem tst1 : ((1:Nat) +++ 3) = 1 + 3 :=
rfl
#check fun (x : Nat) => ... |
ea8c3f1d80e50163b13d79aa93fa5f54695887cb | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/topology/algebra/with_zero_topology.lean | 7714790c9053be019c14464ceffe8896307f530a | [
"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,423 | lean | /-
Copyright (c) 2021 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot
-/
import algebra.order.with_zero
import topology.algebra.order.field
/-!
# The topology on linearly ordered commutative groups with zero
Let `Γ₀` be a linearly ordere... |
dc90ec8f62e261b290cbcc3e58adb79979298b5e | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/tactic/push_neg.lean | 788392f23350d0d19100ed867b1f3b1ff6c37213 | [
"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 | 6,884 | lean | /-
Copyright (c) 2019 Patrick Massot All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Patrick Massot, Simon Hudon
A tactic pushing negations into an expression
-/
import tactic.interactive
import algebra.order
open tactic expr
namespace push_neg
section
universe u
... |
13f7baa012a9170b5bfe057679a7f3bf629f3d2a | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/category_theory/over.lean | 084656472ba77cc7f8116365af34873d7e0f074a | [
"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 | 9,800 | lean | /-
Copyright (c) 2019 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Bhavik Mehta
-/
import category_theory.comma
import category_theory.punit
import category_theory.reflects_isomorphisms
/-!
# Over and under categories
Over (and under... |
f7bded56f9af37897f53018ec18c2fa6424484be | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/monoidal/functorial_auto.lean | dbfdb06140bb44642647000c6a2c16b45bd67ef7 | [] | 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,705 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.category_theory.monoidal.functor
import Mathlib.category_theory.functorial
import Mathlib.P... |
3728ad78068db78bdaef0246530d2ec7a8d3be8e | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/order/filter/pointwise.lean | a77cd4e374f60de8f2f61d8be5afa74d35a3038a | [
"Apache-2.0"
] | permissive | robertylewis/mathlib | 3d16e3e6daf5ddde182473e03a1b601d2810952c | 1d13f5b932f5e40a8308e3840f96fc882fae01f0 | refs/heads/master | 1,651,379,945,369 | 1,644,276,960,000 | 1,644,276,960,000 | 98,875,504 | 0 | 0 | Apache-2.0 | 1,644,253,514,000 | 1,501,495,700,000 | Lean | UTF-8 | Lean | false | false | 6,682 | lean | /-
Copyright (c) 2019 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou
-/
import algebra.pointwise
import order.filter.basic
/-!
# Pointwise operations on filters.
The pointwise operations on filters have nice properties, such as
• `map m ... |
48738fc1562d2d259bdae9dd5d5b70fe13ce8d51 | 1717bcbca047a0d25d687e7e9cd482fba00d058f | /src/measure_theory/interval_integral.lean | b958aaebfb59043bd52cbcbd185546f12a452bc9 | [
"Apache-2.0"
] | permissive | swapnilkapoor22/mathlib | 51ad5804e6a0635ed5c7611cee73e089ab271060 | 3e7efd4ecd5d379932a89212eebd362beb01309e | refs/heads/master | 1,676,467,741,465 | 1,610,301,556,000 | 1,610,301,556,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 73,047 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Yury G. Kudryashov
-/
import measure_theory.set_integral
import measure_theory.lebesgue_measure
import analysis.calculus.fderiv_measurable
import analysis.calculus.mean_value
/-!
#... |
49a88e150b14a56ff311450906ddee667c4c0488 | 8eeb99d0fdf8125f5d39a0ce8631653f588ee817 | /src/order/pilex.lean | 57310b701b9413a019ff9a953b29dec3e708ec27 | [
"Apache-2.0"
] | permissive | jesse-michael-han/mathlib | a15c58378846011b003669354cbab7062b893cfe | fa6312e4dc971985e6b7708d99a5bc3062485c89 | refs/heads/master | 1,625,200,760,912 | 1,602,081,753,000 | 1,602,081,753,000 | 181,787,230 | 0 | 0 | null | 1,555,460,682,000 | 1,555,460,682,000 | null | UTF-8 | Lean | false | false | 4,317 | 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 algebra.group.pi
import order.rel_classes
import algebra.order_functions
variables {ι : Type*} {β : ι → Type*} (r : ι → ι → Prop)
(s : Π {i}, β i → β i → Prop)
... |
c5d3d76ab026a310e1428b731c3e6183198b3345 | 5c7fe6c4a9d4079b5457ffa5f061797d42a1cd65 | /src/exercises/src_21_natural_numbers.lean | 6650a1477f33c917c391c9002107b28b83704a6e | [] | no_license | gihanmarasingha/mth1001_tutorial | 8e0817feeb96e7c1bb3bac49b63e3c9a3a329061 | bb277eebd5013766e1418365b91416b406275130 | refs/heads/master | 1,675,008,746,310 | 1,607,993,443,000 | 1,607,993,443,000 | 321,511,270 | 3 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,302 | lean | import data.num.basic
set_option pp.structure_projections false
namespace mth1001
section setup
@[derive has_reflect, derive decidable_eq]
inductive mynat : Type
| zero : mynat
| S : mynat → mynat
open mynat
def add : mynat → mynat → mynat
| a zero := a -- a + zero = a
| a (S b) ... |
afe43a4efbee75bf5bc6827f87c35b34cfe4aaff | 2ee768fce4d0783536570385ee340d97e2411436 | /src/continuity.lean | 04d9058444cd225a09850fc3f021ae7db97c6e7b | [] | no_license | agjftucker/exists-unique | 835cf0c0ec622d49dbceb84be37db62e6ab8a6d0 | 1fba6035a08347f424c765d8a1c56b1a15c8abbe | refs/heads/master | 1,683,445,592,336 | 1,622,649,822,000 | 1,622,649,822,000 | 309,485,697 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,348 | lean | import u_prop
local prefix `𝒫`:100 := fun {α : Type} (s : finset α), {t // t ≤ s}
variables {𝒩 : Type} {T : with_top ℝ}
lemma join_continuous {t : Tt T} (f g : debt_fn 𝒩 T) :
continuous (f t) → continuous (g t) → continuous ((f ⊔ g) t) :=
begin
intros hf hg,
rw continuous_pi_iff,
intro i,
rw continuous_... |
5cf5e00bcc60e2e88ea22df2485ae2f95047948d | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/list/default.lean | 3aedec00af09c45a5f53e91f2a2c95d164062715 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,005 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.list.alist
import Mathlib.data.list.bag_inter
import Mathlib.data.list.basic
impo... |
9bb62e7c0308649aabb00cb9485ae48e9cb648ee | f5f7e6fae601a5fe3cac7cc3ed353ed781d62419 | /src/order/lexicographic.lean | 898a59572e2963ff756ce0d54da974f781d75b2c | [
"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 | 8,504 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Scott Morrison, Minchao Wu
Lexicographic preorder / partial_order / linear_order / decidable_linear_order,
for pairs and dependent pairs.
-/
import order.basic
import tactic.interactiv... |
b96876de9d84fedfb4b6ced2c8bac989064b7f5c | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/number_theory/liouville/basic.lean | 0d1d2eb417854f72b393818436aa355100eac58a | [
"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 | 12,278 | lean | /-
Copyright (c) 2020 Jujian Zhang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Damiano Testa, Jujian Zhang
-/
import analysis.calculus.mean_value
import data.polynomial.denoms_clearable
import data.real.irrational
/-!
# Liouville's theorem
This file contains a pr... |
d1b3e60973c0c7b35dfa562a7a4afaf594a3244b | 07c76fbd96ea1786cc6392fa834be62643cea420 | /hott/init/pathover.hlean | fe10d96a7428dc22474a7260cde4f6c62f68e7fe | [
"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 | 20,718 | hlean | /-
Copyright (c) 2015 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Floris van Doorn
Basic theorems about pathovers
-/
prelude
import .path .equiv
open equiv is_equiv function
variables {A A' : Type} {B B' : A → Type} {B'' : A' → Type} {C : Π⦃a⦄, ... |
b93b26e3fa947ff56bb0bf24acf8518a99c51193 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/simpMatch.lean | 68637ee6ee1618ac5fb660aa5319eb41ac8dd959 | [
"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 | 195 | lean | def f (x y : Nat) : Nat :=
match x, y with
| 0, 0 => 1
| _, _ => 2
example (h : f x y = 1) : f x y ≠ 2 := by
simp [f] at *
split
next => decide
next x' y' hnp => simp [hnp] at h
|
524f7bcad1a4c13f4d0cc342fe130a729a091985 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/noncomp_theory.lean | efdac7d96c36e2a1b6f4f182207ae02d1683c44a | [
"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 | 417 | lean | import data.real
open real
definition f (a b : real) := (a + a) / b -- ERROR f is noncomputable
noncomputable definition f (a b : real) := (a + a) / b -- ERROR f is noncomputable
noncomputable theory
definition g (a b : real) := (a + a) / b
definition h (a b : real) := (a - a) / b
definition f₂ (a b : real) := (a... |
741885d4356b3151c108f90582e597d3d5557bdd | aa5a655c05e5359a70646b7154e7cac59f0b4132 | /stage0/src/Lean/ScopedEnvExtension.lean | 3ad55cc6d83ab861e1c095ffc626d2bd4752d107 | [
"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 | 8,060 | 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.Environment
import Lean.Data.NameTrie
import Lean.Attributes
namespace Lean
namespace ScopedEnvExtension
inductive Entry (α : Type) where
|... |
c49c03db170810daf8a059a790a08ce63694a6a6 | 4d7079ae603c07560e99d1ce35876f769cbb3e24 | /src/condorcet.lean | 33adbd921394ce816941d688e39ad81aad1dbc66 | [] | no_license | chasenorman/Formalized-Voting | 72493a08aa09d98d0fb589731b842e2d08c991d0 | de04e630b83525b042db166670ba97f9952b5691 | refs/heads/main | 1,687,282,160,284 | 1,627,155,031,000 | 1,627,155,031,000 | 370,472,025 | 13 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,397 | lean | import main
import split_cycle
open_locale classical
variables {V X : Type}
def condorcet_winner [fintype V] (P : Prof V X) (x : X) : Prop := ∀ y, x ≠ y → margin_pos P x y
--def condorcet_winner [fintype V] (P : Prof V X) (x : X) : Prop := ∀ y ≠ x, margin_pos P x y
def condorcet_loser [fintype V] (P : Prof V X) (... |
d3b460dbbd22f08ce4115414b032578491f68303 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/ematch1.lean | 8a5a823ea9c563de9b367213ebcfed3249a94a0d | [
"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 | 766 | lean | constant f : nat → nat
constant g : nat → nat
axiom Ax : ∀ x, (: f (g x) :) = x
open tactic
meta def add_insts : list (expr × expr) → tactic unit
| [] := skip
| ((inst, pr)::r) := do
assertv `_einst inst pr,
add_insts r
meta def ematch_test (h : name) (e : expr) : tactic unit :=
do cc ← cc_state.mk... |
931cc8799442df7f60b040d74b27cf51d25efeeb | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/measure_theory/integration.lean | f17509438ee479b2c878b0596274992bf514e6e2 | [
"Apache-2.0"
] | permissive | ilitzroth/mathlib | ea647e67f1fdfd19a0f7bdc5504e8acec6180011 | 5254ef14e3465f6504306132fe3ba9cec9ffff16 | refs/heads/master | 1,680,086,661,182 | 1,617,715,647,000 | 1,617,715,647,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 82,967 | 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 data.indicator_function
import data.support
/-!
# Lebesgue integral for ... |
01b9b2b5e73594dbc80a9e7762a100dd17422b64 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tests/lean/run/structuralEqns2.lean | a2d3d73e87f6fd6651fb438078d9e17685e33c55 | [
"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 | 441 | lean | import Lean
open Lean
open Lean.Meta
def tst (declName : Name) : MetaM Unit := do
IO.println (← getEqnsFor? declName)
def g (i j : Nat) : Nat :=
if i < 5 then 0 else
match j with
| Nat.zero => 1
| Nat.succ j => g i j
#eval tst ``g
#check g.eq_1
#check g.eq_2
#check g.eq_3
def h (i j : Nat) : Nat :=
let ... |
bae0fb319ca88c37e229afc2bbcdeabe2ec7fc33 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/simp_emeta_order.lean | 7e5048f44486f74b18428fa93e02061d9386f873 | [
"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 | 293 | lean | class A (α : Type)
class B (α : Type) [A α]
def P (α : Type) : Prop := true
@[simp] lemma foo (α : Type) [A α] [B α] : P α ↔ true := iff.rfl
-- should work
example (α : Type) [A α] [B α] : P α ↔ id true :=
begin
simp only [foo],
guard_target true ↔ id true,
refl
end |
670933756a1dff53a7d1ff9677abaa843beb4d2a | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/nat/multiplicity.lean | 07017e41ef9ce19c1bedbdc91ad1a3c7a0ec3566 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,806 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.nat.bitwise
import Mathlib.data.nat.parity
import Mathlib.ring_theory.int.basic
import Mat... |
8f47f2b1b16d40b12938a9a66fe5bb00cc802e59 | 59e5eb5b0b465111c363c967363a954891f7de2e | /Leancode/fptp/src/list_lemma.lean | 04dbb9f4c24f71a216e11f98d9d8720511a1d2f3 | [
"Apache-2.0"
] | permissive | mukeshtiwari/formal-fptp | 1987fb35e5594ea047b1b2f7e36a804dece6272f | 883a6a245cfdce7af0fc3cc2c3769281fe60afa0 | refs/heads/master | 1,650,002,177,929 | 1,585,742,596,000 | 1,585,742,596,000 | 249,091,342 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 663 | lean | import
tactic.find tactic.omega
lemma zip_with_len_l {α β γ : Type*} {l₁ : list α} {l₂ : list β} {f : α → β → γ}
(h : list.length l₁ = list.length l₂) :
list.length (list.zip_with f l₁ l₂) = list.length l₁ :=
begin
induction l₁ with x xs ih generalizing l₂,
{simp [list.zip_with]},
{
cases l₂ wi... |
4d1974fa343b3c0178f36a88cb894acb9615b4d8 | 29cc89d6158dd3b90acbdbcab4d2c7eb9a7dbf0f | /4.1/41_exercise_solution.lean | c4030442648c303ddc23b125ff75c1704e6d6c6d | [] | no_license | KjellZijlemaker/Logical_Verification_VU | ced0ba95316a30e3c94ba8eebd58ea004fa6f53b | 4578b93bf1615466996157bb333c84122b201d99 | refs/heads/master | 1,585,966,086,108 | 1,549,187,704,000 | 1,549,187,704,000 | 155,690,284 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,710 | lean | /- Exercise 4.1: Mathematics — Foundation -/
/- Question 1: Hilbert choice -/
/- The following command enables noncomputable decidability on every `Prop`. The `priority 0`
attribute ensures this is used only when necessary; otherwise, it would make some computable
definitions noncomputable for Lean. -/
local attribu... |
7bdc768df5c7cbe65c3e1a87afc65fb3ae0334a1 | 618003631150032a5676f229d13a079ac875ff77 | /src/tactic/converter/binders.lean | 4b2f1524e3c2082b72bf04a1bac2e13903f7750a | [
"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 | 7,438 | 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
Binder elimination
-/
import order
namespace old_conv
open tactic monad
meta instance : monad_fail old_conv :=
{ fail := λ α s, (λr e, tactic.fail (to_fmt s) : old_co... |
8dfb25d4fc9cf3faf57c8ff24709b53a150ba9d9 | ec62863c729b7eedee77b86d974f2c529fa79d25 | /24/b.lean | 02033ca3861260d6870726f5a782667339503d44 | [] | 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 | 1,453 | lean | import Std.Data.HashSet
import Std.Data.HashMap
open Std
instance : Hashable Int where
hash n := hash n.toNat
@[reducible] def Hex := Int × Int
def Hex.x : Hex → Int := Prod.fst
def Hex.y : Hex → Int := Prod.snd
instance : Add Hex where
add h₁ h₂ := ⟨h₁.x + h₂.x, h₁.y + h₂.y⟩
def parseLine : List Char → Hex
| ... |
3b969d3d7bdcd7bf97d5be4dbc41dd3c6ae08cf7 | 56762daf61566a2baf390b5d77988c29c75187e3 | /src/addition.lean | 4d4b47c87b90d189d63f2d6c01de90663e8ffbb3 | [] | no_license | Nicknamen/lie_group | de173ce5f1ffccb945ba05dca23ff27daef0e3b4 | e0d5c4f859654e3dea092702f1320c3c72a49983 | refs/heads/master | 1,674,937,428,196 | 1,607,213,423,000 | 1,607,213,423,000 | 275,196,635 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 178 | lean | import tactic.default
theorem addition_of_natural_numbers_is_commutative (m n : ℕ) :
m + n = n + m :=
begin
induction n with d hd,
{
ring,
},
{
ring,
}
end |
5eba72c32d9b3674ded6f07e93aa69cffd5a6558 | 26bff4ed296b8373c92b6b025f5d60cdf02104b9 | /tests/lean/run/beginend3.lean | 184857aae284493604f7d829d35604fc15f381bc | [
"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 | 272 | lean | import logic
open tactic
theorem foo (A : Type) (a b c : A) : a = b → b = c → a = c ∧ c = a :=
begin
intros (Hab, Hbc),
apply and.intro,
apply eq.trans,
rotate 2,
apply eq.trans,
apply (eq.symm Hbc),
apply (eq.symm Hab),
apply Hab,
apply Hbc,
end
|
e9ca24db8082b08677257bbbaca577adbc8b8be9 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/run/eq_cases_on.lean | de9b535a30bef19d184de3c33609c1fe313f6d32 | [
"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 | 240 | lean | def g {n m : nat} (v : array nat (n + m)) : array nat (m + n) :=
eq.rec_on (add_comm n m) v -- Worked before
def f {n m : nat} (v : array nat (n + m)) : array nat (m + n) :=
eq.cases_on (add_comm n m) v -- eq.cases_on was not being erased
|
ed54316de753e0f57cb7be2f6536d1175d96e75b | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/isabelle.lean | ebdb0d5987e2fcee38e20a22a5461c79c90230d1 | [
"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 | 2,996 | lean | /-
Isabelle style tactics.
This test is based on a file created by Gabriel Ebner.
-/
universe variables u
inductive lazy_list (α : Type u) : Type u
| nil {} : lazy_list
| cons : α → thunk (lazy_list) → lazy_list
namespace lazy_list
variables {α β : Type u}
def singleton : α → lazy_list α
| a := cons a nil
def appe... |
48bfbf9ad0134aff1511295162b47fcb3a944924 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/lake/examples/targets/src/Foo.lean | 7bf9513b39691a4f52f0384c533695667844977f | [
"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 | 32 | lean | import Foo.Bar
def foo := "foo"
|
8f38c7d094a208f56e240f126a113492d662ad9a | 74924b1fe80b8f61262cefcfc0cd4d96135c8731 | /src/data/real/basic.lean | b729bd98eb0bc24d3fd1539f1b1144a09c864761 | [
"Apache-2.0"
] | permissive | 101damnations/mathlib | 0938b3806a09032d8716d3642cbab65db7688c23 | 900c53ae6d5e3f8cc47953363479593e8debc4d8 | refs/heads/master | 1,593,832,305,164 | 1,565,631,735,000 | 1,565,631,735,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 27,584 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Floris van Doorn
The (classical) real numbers ℝ. This is a direct construction
from Cauchy sequences.
-/
import order.conditionally_complete_lattice data.real.cau_seq_... |
0cb9d5cbdf0c547358dddbdf4e9c07c13dcecc90 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/ring_theory/integrally_closed.lean | a2483b48c5dc0b6210fc3e7332c37c59319c5d39 | [
"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 | 8,113 | lean | /-
Copyright (c) 2021 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen
-/
import field_theory.splitting_field
import ring_theory.integral_closure
import ring_theory.localization.integral
/-!
# Integrally closed rings
An integrally closed domain... |
9bf8f34121a1a9665d9046dd1eb7c3aba3a25999 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /hott/homotopy/red_susp.hlean | a71996e89d2743fc3a5982218f883aced09ab5b9 | [
"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 | 2,772 | hlean | /-
Copyright (c) 2015 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
Declaration of the reduced suspension
-/
import hit.two_quotient types.pointed algebra.e_closure
open simple_two_quotient eq unit pointed e_closure
namespace red... |
a08fd551da21e9f37c9b24d03afc7a963a527a32 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/algebra/ordered_monoid.lean | 94d1567cd0a1fd565014e6a9da2937873d92344a | [
"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 | 37,267 | 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, Johannes Hölzl
-/
import algebra.group.with_one
import algebra.group.type_tags
import algebra.group.prod
import algebra.order_functions... |
1e7463cb19b871a35c61dcacc79eedca0597f0d0 | fe25de614feb5587799621c41487aaee0d083b08 | /src/Lean/Elab/Tactic/ElabTerm.lean | 8799f08b450ffff770c82fafc696a2275a034805 | [
"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 | 10,803 | 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.CollectMVars
import Lean.Meta.Tactic.Apply
import Lean.Meta.Tactic.Constructor
import Lean.Meta.Tactic.Assert
import Lean.Elab.Tactic.Basic... |
84fd914a99117381c92cc026bf9c465a33f17170 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/polynomial/algebra_map_auto.lean | 5958fc7783c9a9ff53cfba8bb7a2b0edc529f2dd | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,647 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.polynomial.eval
import Mathlib.algebra.alg... |
6981605bc529d16f78664856f7fb51b1d2b1eff3 | 367134ba5a65885e863bdc4507601606690974c1 | /test/free_algebra.lean | 1ef6dcc94f390761db800ae528c54e5c579365e7 | [
"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 | 1,183 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Eric Wieser
-/
import linear_algebra.exterior_algebra
import linear_algebra.clifford_algebra
/-!
Tests that the ring instances for `free_algebra` and derived quotient types actually ... |
e28d1d0a83e2bbafab9fbd3294624af5bbec351a | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/meta/widget/tactic_component_auto.lean | 873952a2a79472d3122e0425eaa01a430a6e2792 | [] | 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 | 416 | 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
namespace Mathlib
namespace widget
/-- A component that implicitly depends on tactic_state. For efficiency ... |
cd0be5e7ff326cd9198eae11ae33a345223c1158 | 22e97a5d648fc451e25a06c668dc03ac7ed7bc25 | /src/data/real/basic.lean | 65a147bb8b0d9ffc5b2b2329f9dae858e40a275b | [
"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 | 26,280 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Floris van Doorn
The (classical) real numbers ℝ. This is a direct construction
from Cauchy sequences.
-/
import order.conditionally_complete_lattice
import data.real.c... |
710494dc7bbfdda1c1e2eea42fe6cdae99a633b8 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/set_theory/surreal_auto.lean | 16e4e8bf67d83e75acd94717f457a42e4a40b8de | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,736 | lean | /-
Copyright (c) 2019 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Scott Morrison
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.set_theory.pgame
import Mathlib.PostPort
universes u_1 u_2 u l u_3
names... |
ec68443e97fdf914d0663a0181aa70000f8d10b1 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/topology/sheaves/presheaf.lean | a46874dd0f145e722ce7a51ebb6f9dd174d37e43 | [
"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 | 11,960 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Mario Carneiro, Reid Barton, Andrew Yang
-/
import category_theory.limits.kan_extension
import category_theory.adjunction
import topology.category.Top.opens
/-!
# Pres... |
ed34c8df0af084051a367d088174bfcaa42c8264 | 22e97a5d648fc451e25a06c668dc03ac7ed7bc25 | /src/topology/category/UniformSpace.lean | 5d074fe31cffde303124583c569723094d3f2898 | [
"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 | 6,392 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Reid Barton, Patrick Massot, Scott Morrison
-/
import category_theory.monad.limits
import topology.uniform_space.completion
import topology.category.Top.basic
/-!
# The category of un... |
e0885dfa2352944dce503d34ca4f5ff95b7469fd | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /stage0/src/Lean/Server/Rpc/Basic.lean | e8e1bd95adeab97280fb2ea5f0a2e7c7cd3c7612 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | EdAyers/lean4 | 57ac632d6b0789cb91fab2170e8c9e40441221bd | 37ba0df5841bde51dbc2329da81ac23d4f6a4de4 | refs/heads/master | 1,676,463,245,298 | 1,660,619,433,000 | 1,660,619,433,000 | 183,433,437 | 1 | 0 | Apache-2.0 | 1,657,612,672,000 | 1,556,196,574,000 | Lean | UTF-8 | Lean | false | false | 4,782 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Wojciech Nawrocki
-/
import Lean.Data.Json
import Std.Dynamic
/-! Allows LSP clients to make Remote Procedure Calls to the server.
The single use case for these is to allow t... |
390315f690fcf129d2f2e6ddfb1dfbc5afb6f640 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/category_theory/types.lean | 1f16fcbe2ad274fb7761c9ee9a51618a32b453a9 | [
"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 | 11,148 | 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
-/
import category_theory.epi_mono
import category_theory.functor.fully_faithful
import logic.equiv.basic
/-!
# The category `Type`.
In... |
b493812416d3c7240c9e04a65fc62697c144630c | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /06_Inductive_Types.org.3.lean | 06cb4ef7ca5e806504a3faf58d033b1eee752fd9 | [] | no_license | cjmazey/lean-tutorial | ba559a49f82aa6c5848b9bf17b7389bf7f4ba645 | 381f61c9fcac56d01d959ae0fa6e376f2c4e3b34 | refs/heads/master | 1,610,286,098,832 | 1,447,124,923,000 | 1,447,124,923,000 | 43,082,433 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 426 | lean | /- page 78 -/
import standard
import data.nat
open nat
inductive weekday : Type :=
| sunday : weekday
| monday : weekday
| tuesday : weekday
| wednesday : weekday
| thursday : weekday
| friday : weekday
| saturday : weekday
-- BEGIN
definition number_of_day (d : weekday) : nat :=
weekday.rec_on d 1 2 3 4 5 6 7
eval... |
b5b3163b4df936e907c87450e7a5909fbeaba8e6 | 3f7026ea8bef0825ca0339a275c03b911baef64d | /src/topology/uniform_space/cauchy.lean | da594192962978769458392cf3b8a31aa681c848 | [
"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 | 16,394 | 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
Theory of Cauchy filters in uniform spaces. Complete uniform spaces. Totally bounded subsets.
-/
import topology.uniform_space.basic
open filter topolo... |
8c6d034e01e87b4bb91649093492ff93fadd3b26 | 80746c6dba6a866de5431094bf9f8f841b043d77 | /src/data/list/basic.lean | 52dceb3b4a1b25ea79860f442eed557bc991b9f8 | [
"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 | 188,172 | lean | /-
Copyright (c) 2014 Parikshit Khanna. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Parikshit Khanna, Jeremy Avigad, Leonardo de Moura, Floris van Doorn, Mario Carneiro
Basic properties of lists.
-/
import
tactic.interactive tactic.mk_iff_of_inductive_prop tactic... |
e6993405dcf1129dfe21046a72f9aa3bf929f81c | 86f6f4f8d827a196a32bfc646234b73328aeb306 | /examples/logic/unnamed_612.lean | 4ec4f743c28c51e5961a00e111b8051a18e97643 | [] | no_license | jamescheuk91/mathematics_in_lean | 09f1f87d2b0dce53464ff0cbe592c568ff59cf5e | 4452499264e2975bca2f42565c0925506ba5dda3 | refs/heads/master | 1,679,716,410,967 | 1,613,957,947,000 | 1,613,957,947,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 183 | lean | import data.real.basic
-- BEGIN
example : ∃ x : ℝ, 2 < x ∧ x < 3 :=
begin
have h : 2 < (5 : ℝ) / 2 ∧ (5 : ℝ) / 2 < 3,
by norm_num,
exact ⟨5 / 2, h⟩
end
-- END |
a8a7db06b75c52351c080b186cbfa4485c2a135f | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/linear_algebra/free_algebra.lean | 846d10b1f393c4e7f1bed44c4be50b8f51ef84a1 | [
"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 | 1,275 | lean | /-
Copyright (c) 2021 Eric Wieser. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Eric Wieser
-/
import linear_algebra.basis
import algebra.free_algebra
import linear_algebra.dimension
import linear_algebra.finsupp_vector_space
/-!
# Linear algebra properties of `free_... |
f3893d4de81723f3988b34fa53d561a16cde95cf | 618003631150032a5676f229d13a079ac875ff77 | /src/algebra/group/basic.lean | 4927cc79a4a0be405acfe8836a869632ff7657e9 | [
"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 | 12,844 | 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 algebra.group.defs
import tactic.simpa
import logic.function.basic
import tactic... |
888ccae7afa899a3658ac327e499cd7f67d2ac2f | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/control/bifunctor.lean | fae259c06f95a64fef01e7cab2a1a4749e5624d8 | [
"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,168 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
-/
import control.functor
import data.sum.basic
/-!
# Functors with two arguments
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a correspondi... |
65ba3f540c5f3fca3e6c963dd259973677d5aea6 | 32025d5c2d6e33ad3b6dd8a3c91e1e838066a7f7 | /stage0/src/Lean/Elab/PreDefinition/Structural.lean | 7bdc2cdb2c3edb3688b68e0a66d43f0840350df2 | [
"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 | 6,569 | 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.ForEachExpr
import Lean.Meta.RecursorInfo
import Lean.Elab.PreDefinition.Basic
namespace Lean
namespace Elab
open Meta
private def getFix... |
6ed63fb3ef3a514073d66da67258b2cae8aaa504 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/unboxStruct.lean | df57b1d66d26746bb57db5241980e44ff6c82ec5 | [
"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 | 239 | lean | structure AddrSpace where
index : UInt32
@[extern "foo"]
opaque foo (addrSpace : AddrSpace) : IO PUnit
set_option trace.compiler.ir.result true in
-- should accept and pass an unboxed `uint32`
def test2 : AddrSpace → IO PUnit := foo
|
2083db0a0a3f975cc5f10911e3ed4bc0098a8092 | fbf512ee44de430e3d3c5869751ad95325c938d7 | /logic.lean | 9914f4a0a3f4227fc7df36a1cd836c2cd6cf4ead | [] | no_license | skbaek/clausify | 4858c9005fb86a5e410bfcaa77524f82d955f655 | d09b071bdcce7577c3fffacd0893b776285b1590 | refs/heads/master | 1,588,360,590,818 | 1,553,553,880,000 | 1,553,553,880,000 | 177,644,542 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,953 | lean | import logic.basic
variable {α : Type}
lemma forall_iff_forall {P Q : α → Prop} :
(∀ a, P a ↔ Q a) → ((∀ a, P a) ↔ (∀ a, Q a)) :=
λ h, iff.intro
(λ hP a, (h a).elim_left (hP _))
(λ hQ a, (h a).elim_right (hQ _))
lemma exists_iff_exists {P Q : α → Prop} :
(∀ a, P a ↔ Q a) → ((∃ a, P a) ↔ (∃ a, Q a)) :=
... |
e60cca55277f2679935c6ab63413750c51b5d01c | 5c7fe6c4a9d4079b5457ffa5f061797d42a1cd65 | /src/exercises/src_37_completeness_axiom.lean | e59dd778c5d6f3a849d2041a0801e11d1caa9b25 | [] | no_license | gihanmarasingha/mth1001_tutorial | 8e0817feeb96e7c1bb3bac49b63e3c9a3a329061 | bb277eebd5013766e1418365b91416b406275130 | refs/heads/master | 1,675,008,746,310 | 1,607,993,443,000 | 1,607,993,443,000 | 321,511,270 | 3 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,980 | lean | import ..library.src_real_field
import ..library.src_ordered_field_lemmas
import data.set.basic
import tactic
namespace mth1001
namespace myreal
open myreal_field classical myordered_field
open_locale classical
variables {R : Type} [myreal_field R]
def has_upper_bound (S : set R) := ∃ u : R, upper_bound u S
lemm... |
78c9e655f51219d3c44c711c48e04a46f4b5bca7 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /test/coinductive.lean | 36bf92a01b7c8d152da579ec089bd47bec412807 | [
"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 | 5,278 | lean | /- test cases for coinductive predicates -/
import data.stream meta.coinductive_predicates
universe u
coinductive all_stream {α : Type u} (s : set α) : stream α → Prop
| step : ∀{a : α} {ω : stream α}, a ∈ s → all_stream ω → all_stream (a :: ω)
example : Π {α : Type u}, set α → stream α → Prop :=
@all_stream
example ... |
bf7fd77cc7b771c43ecf93e3ef1d196bc7364254 | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /stage0/src/Lean/Compiler/LCNF/ReduceJpArity.lean | 1d1f06a4fad6c9bdb9042443c516daaadf2e7810 | [
"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 | 2,408 | 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.Compiler.LCNF.CompilerM
import Lean.Compiler.LCNF.InferType
import Lean.Compiler.LCNF.PassManager
namespace Lean.Compiler.LCNF
/-!
Join point a... |
5a3da63bdd72f94f8fc1747a1de8dcc2d5f4b99e | 4fa161becb8ce7378a709f5992a594764699e268 | /src/linear_algebra/direct_sum_module.lean | 1da16eda156ba15b1129f9b00b1eac5628b0cc52 | [
"Apache-2.0"
] | permissive | laughinggas/mathlib | e4aa4565ae34e46e834434284cb26bd9d67bc373 | 86dcd5cda7a5017c8b3c8876c89a510a19d49aad | refs/heads/master | 1,669,496,232,688 | 1,592,831,995,000 | 1,592,831,995,000 | 274,155,979 | 0 | 0 | Apache-2.0 | 1,592,835,190,000 | 1,592,835,189,000 | null | UTF-8 | Lean | false | false | 3,544 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
Direct sum of modules over commutative rings, indexed by a discrete type.
-/
import algebra.direct_sum
import linear_algebra.basic
universes u v w u₁
variables (R : Type u) [se... |
d75b6304e33aa68d7165dfcf88f88adcc75a02b7 | 30b012bb72d640ec30c8fdd4c45fdfa67beb012c | /category_theory/embedding.lean | be8073956776888c48da3374b9c683c8c346f9df | [
"Apache-2.0"
] | permissive | kckennylau/mathlib | 21fb810b701b10d6606d9002a4004f7672262e83 | 47b3477e20ffb5a06588dd3abb01fe0fe3205646 | refs/heads/master | 1,634,976,409,281 | 1,542,042,832,000 | 1,542,319,733,000 | 109,560,458 | 0 | 0 | Apache-2.0 | 1,542,369,208,000 | 1,509,867,494,000 | Lean | UTF-8 | Lean | false | false | 2,636 | 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.isomorphism
universes u₁ v₁ u₂ v₂ u₃ v₃
namespace category_theory
variables {C : Type u₁} [𝒞 : category.{u₁ v₁} C] {D : Type u₂} [𝒟 : ... |
89f8dc07105fe5c197747f768eb42ec89baf57e5 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/data/int/modeq.lean | c50554a490059b16c4d1fca0ac38c89de186c90f | [
"Apache-2.0"
] | permissive | jcommelin/mathlib | d8456447c36c176e14d96d9e76f39841f69d2d9b | ee8279351a2e434c2852345c51b728d22af5a156 | refs/heads/master | 1,664,782,136,488 | 1,663,638,983,000 | 1,663,638,983,000 | 132,563,656 | 0 | 0 | Apache-2.0 | 1,663,599,929,000 | 1,525,760,539,000 | Lean | UTF-8 | Lean | false | false | 7,774 | 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 data.nat.modeq
import tactic.ring
/-!
# Congruences modulo an integer
This file defines the equivalence relation `a ≡ b [ZMOD n]` on the integers, similarly to ... |
f69fd84861e34897d823cc32d2f09dd7f11a321d | 2d34dfb0a1cc250584282618dc10ea03d3fa858e | /src/locally_constant/basic.lean | d241916847935a8db44c5bbee984a6c7b40dd64d | [] | no_license | zeta1999/lean-liquid | 61e294ec5adae959d8ee1b65d015775484ff58c2 | 96bb0fa3afc3b451bcd1fb7d974348de2f290541 | refs/heads/master | 1,676,579,150,248 | 1,610,771,445,000 | 1,610,771,445,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,906 | lean | import topology.subset_properties
import topology.algebra.monoid
variables {X Y Z α : Type*} [topological_space X]
-- move this
section for_mathlib
def finite_of_is_compact_of_discrete [discrete_topology X] (s : set X) (hs : is_compact s) :
s.finite :=
begin
have := hs.elim_finite_subcover (λ x : X, ({x} : set X... |
9b15ce7e126abfe51fa6da0c4a4959b6164c16a2 | 5ee26964f602030578ef0159d46145dd2e357ba5 | /src/for_mathlib/sheaves/covering.lean | 1daa4368332e94af52f6c7d579e09782e687e6e2 | [
"Apache-2.0"
] | permissive | fpvandoorn/lean-perfectoid-spaces | 569b4006fdfe491ca8b58dd817bb56138ada761f | 06cec51438b168837fc6e9268945735037fd1db6 | refs/heads/master | 1,590,154,571,918 | 1,557,685,392,000 | 1,557,685,392,000 | 186,363,547 | 0 | 0 | Apache-2.0 | 1,557,730,933,000 | 1,557,730,933,000 | null | UTF-8 | Lean | false | false | 2,328 | lean | /-
Package the definition of an open cover of an open set.
Author: Ramon Fernandez Mir
-/
import topology.basic
import topology.opens
import for_mathlib.sheaves.opens
universes u
open topological_space lattice
section covering
variables {α : Type u} [topological_space α]
-- Open cover.
structure covering (U... |
d401d140862bd591e30d3d4aaba2542d3167e5ce | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/extra/slow1.lean | 6f84d090a9e32b9e77b4579725e25f8846146e13 | [
"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 | 395 | lean | open nat
definition f (a : nat) : nat := a
definition g (a : nat) : nat := 0
example (a b : nat) :
@eq nat
(g (f (f (f (f (f (f (f (f (f (f (f (f (f (f (f (f (f (f (f (f (f a))))))))))))))))))))))
(g (f (f (f (f (f (f (f (f (f (f (f (f (f (f (f (f (f (f (f (f (f b))))))))))))))))))))))
:=
@eq.refl nat (g (f (f (f (f ... |
c48dae831c4d357aa6596b776abae531a6d5e895 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/list/sections.lean | 6ee2bb5893c573e346a084ec2a37d627127b1127 | [
"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 | 1,559 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.list.forall2
/-!
# List sections
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding PR to mathlib4.
This fil... |
7aadf7099ba13a79a42b6f32ef6909fe5e5f249c | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/limits/shapes/pullbacks.lean | d667c0fcfd7c4341b3ab99f22acbf3cb12b0bd23 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 36,322 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Markus Himmel, Bhavik Mehta
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.category_theory.limits.shapes.wide_pullbacks
import Mathlib.ca... |
45fea05dc28b12026b5045b01cd03c765ae4fb2c | c777c32c8e484e195053731103c5e52af26a25d1 | /src/number_theory/modular_forms/slash_actions.lean | 9c980afa75e783b83ff3cefce2ce7bff9408845a | [
"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 | 9,593 | lean | /-
Copyright (c) 2022 Chris Birkbeck. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Birkbeck
-/
import analysis.complex.upper_half_plane.basic
import linear_algebra.matrix.general_linear_group
import linear_algebra.matrix.special_linear_group
/-!
# Slash actions... |
1d8d901fdb848a0ebc23877c5be779223a0330eb | 74d9d5f45c6ce5c4f2faf215c04a68eab55fe525 | /src/continuous_linear_map.lean | 083bbb8587e694c0ef9bab644fbbbda44a1f6613 | [] | no_license | joshpoll/differential_geometry | 290bb8a934ca3b3b6b707d810e6d4b941710b710 | 57e00a7e37b7c4c73c847429171ff63d3a48def5 | refs/heads/master | 1,584,551,626,391 | 1,527,747,643,000 | 1,527,747,643,000 | 135,014,993 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,588 | lean | /-
Continuous Linear Maps
These are a well-behaved subset of all linear maps. In finite dimensional normed vector spaces, all linear maps are continuous. For a certain type of normed space (which?), continuous linear maps and bounded linear maps are the same.
The derivative of f : E → F is f' : E → continuous_... |
e919c9cba657b7516088bbe9df551ad5d6c19698 | 8153b09016144aaad2ec06668e8d34a353e80572 | /src/quiz05.lean | a5ab7ddce44d8c7396f7285212cc89f6e74a87fc | [] | no_license | UVM-M52/quiz-5-danijumps | 13e50b433e05b66bb92426ad3c1f7d6933a4bf0d | 387989e688a9d321713d64735d27a0d9fbac3a30 | refs/heads/master | 1,614,294,343,679 | 1,583,514,357,000 | 1,583,514,357,000 | 245,475,409 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 663 | lean | -- Math 52: Quiz 5
-- Open this file in a folder that contains 'utils'.
import utils
open classical
definition divides (a b : ℤ) : Prop := ∃ (k : ℤ), b = a * k
local infix ∣ := divides
axiom not_3_divides : ∀ (m : ℤ), ¬ (3 ∣ m) ↔ 3 ∣ m - 1 ∨ 3 ∣ m + 1
lemma not_3_divides_of_3_divides_minus_1 :
∀ (m : ℤ), 3 ∣ m - 1... |
5fd073fa7356bdca4db84c36fe691ae9c1cf150a | 6e44fda625e48340c6ffc7b1109a9e3b208e5384 | /src/topology/exercies.lean | bbf862eb16cb49b99c50eccd56e80d8ab4edec48 | [] | no_license | JasonKYi/learn_mspaces | 9f998a265b907af6be6a54061637fcf1f6d1ee9d | 54083e81da420d2d362a7024a8c86bea8529fe66 | refs/heads/master | 1,619,008,842,896 | 1,609,897,382,000 | 1,609,897,382,000 | 249,780,600 | 5 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,899 | lean | import topology.theorems
/-
A topological space (X, 𝒯) consists of a non-empty set X
together with a collection 𝒯 of subsets of X that satisfy
- ∅ ∈ 𝒯, X ∈ 𝒯
- U, V ∈ 𝒯 → U ∩ V ∈ 𝒯
- Uᵢ ∈ 𝒯 → ⋃ᵢ U ∈ 𝒯
Elements of 𝒯 are called open sets in (X, 𝒯) and 𝒯 is
called a topology on X.
In Lean this is represen... |
b8e7e06b7b971dadf6d36516da76bfcd672a5950 | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/algebra/category/Group/basic.lean | 4c57f89d318826911c5c23c7fbb4c2d448fb5f6f | [
"Apache-2.0"
] | permissive | vaibhavkarve/mathlib | a574aaf68c0a431a47fa82ce0637f0f769826bfe | 17f8340912468f49bdc30acdb9a9fa02eeb0473a | refs/heads/master | 1,621,263,802,637 | 1,585,399,588,000 | 1,585,399,588,000 | 250,833,447 | 0 | 0 | Apache-2.0 | 1,585,410,341,000 | 1,585,410,341,000 | null | UTF-8 | Lean | false | false | 8,467 | lean | /-
Copyright (c) 2018 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import algebra.punit_instances
import algebra.category.Mon.basic
import category_theory.endomorphism
import category_theory.epi_mono
/-!
# Category instances for gr... |
94113e677b4bdb3e35f3fc88d2faa553879e2d19 | 367134ba5a65885e863bdc4507601606690974c1 | /test/nontriviality.lean | 63edda3fa3db05cda643b681eae92481e75c619f | [
"Apache-2.0"
] | permissive | kodyvajjha/mathlib | 9bead00e90f68269a313f45f5561766cfd8d5cad | b98af5dd79e13a38d84438b850a2e8858ec21284 | refs/heads/master | 1,624,350,366,310 | 1,615,563,062,000 | 1,615,563,062,000 | 162,666,963 | 0 | 0 | Apache-2.0 | 1,545,367,651,000 | 1,545,367,651,000 | null | UTF-8 | Lean | false | false | 2,516 | lean | import logic.nontrivial
import algebra.ordered_ring
import data.nat.basic
/-! ### Test `nontriviality` with inequality hypotheses -/
example {R : Type} [ordered_ring R] {a : R} (h : 0 < a) : 0 < a :=
begin
nontriviality,
guard_hyp _inst : nontrivial R,
assumption,
end
/-! ### Test `nontriviality` with equality... |
cd7f796f64bb0ebb1b66f07a185d9c57dc408fc5 | ccb7cdf8ebc2d015a000e8e7904952a36b910425 | /src/heap/lemmas.lean | 4891d1f63eef3365b7144bc7e81c85a4a894abce | [] | no_license | cipher1024/lean-pl | f7258bda55606b75e3e39deaf7ce8928ed177d66 | 829680605ac17e91038d793c0188e9614353ca25 | refs/heads/master | 1,592,558,951,987 | 1,565,043,356,000 | 1,565,043,531,000 | 196,661,367 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,905 | lean | import category.basic
import heap.basic
import data.finmap
import tactic.omega
import tactic.linarith
namespace memory
variables value : Type
variables {value}
def maplet (x : ptr) (v : value) : heap value :=
finmap.singleton x v
def heap.mk (l : list (ptr × value)) : heap value :=
(l.map $ λ x : ptr × value, (⟨x.... |
c71935c35b7b93875bf3a4781120b5a4d594dec5 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/group_theory/submonoid/membership.lean | 61336ecb40075156edfbcd4d169a3e482c2f7513 | [
"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 | 23,136 | lean | /-
Copyright (c) 2018 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Kenny Lau, Johan Commelin, Mario Carneiro, Kevin Buzzard,
Amelia Livingston, Yury Kudryashov
-/
import group_theory.submonoid.operations
import algebra.big_operators.ba... |
25d6d3a30cc72f287687d60063b8b75ec1ab3479 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/data/matrix/block.lean | 8a178f776a6f7a390791e98d84678709d9d7b776 | [
"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 | 15,854 | lean | /-
Copyright (c) 2018 Ellen Arlt. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Ellen Arlt, Blair Shi, Sean Leather, Mario Carneiro, Johan Commelin
-/
import data.matrix.basic
/-!
# Block Matrices
## Main definitions
* `matrix.from_blocks`: build a block matrix out... |
7f1336062320f1f57c799f5a8f3b68bb7f793c8a | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/analysis/normed_space/continuous_affine_map.lean | c55cae476084dda377491f560821cd7697dc1af4 | [
"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 | 2,441 | 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
/-!
# Continuous affine maps between nor... |
cd618e4069789059eb38a1ac977f5c3fecd93c4d | 6c56e3fbe5d7711b66a3b46f1810b44cfa109768 | /src/even.lean | 5c7e845e485e456495a1843adb40958c577b9199 | [] | no_license | kodyvajjha/lean-mmc2021 | 015e7ba9d2f43397582d42ad282e88c8ce876dc3 | cc774208f9dc041cad4def289357301b4a0a8173 | refs/heads/master | 1,689,416,888,246 | 1,630,161,054,000 | 1,630,161,054,000 | 384,140,257 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 311 | lean | import tactic
namespace myeven
def is_even (n : ℕ) := ∃ p : ℕ, n = 2*p
theorem inf_many_evens : ∀ n:ℕ, ∃ k : ℕ, (k > n) ∧ (is_even k) :=
begin
assume n, -- assume an arbitrary n
use (2*(n+1)),
split,
{
linarith,
},
{
unfold is_even,
use (n+1),
}
end
end myeven |
80bdcbadf726553ceb5502263cb207768cec2231 | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/group_theory/dihedral_group.lean | d86d32996ef7fc1194babcc5788a5cc3baa0a8b5 | [
"Apache-2.0"
] | permissive | ilitzroth/mathlib | ea647e67f1fdfd19a0f7bdc5504e8acec6180011 | 5254ef14e3465f6504306132fe3ba9cec9ffff16 | refs/heads/master | 1,680,086,661,182 | 1,617,715,647,000 | 1,617,715,647,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,476 | lean | /-
Copyright (c) 2020 Shing Tak Lam. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Shing Tak Lam
-/
import data.zmod.basic
import group_theory.order_of_element
/-!
# Dihedral Groups
We define the dihedral groups `dihedral_group n`, with elements `r i` and `sr i` for... |
37024149b999b37a2aa2f3cdf59a1714e4d37d62 | 626e312b5c1cb2d88fca108f5933076012633192 | /src/ring_theory/noetherian.lean | 445ef2e7c7814144be1a36063a3124600b8681f6 | [
"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 | 35,871 | lean | /-
Copyright (c) 2018 Mario Carneiro, Kevin Buzzard. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Kevin Buzzard
-/
import algebraic_geometry.prime_spectrum
import data.multiset.finset_ops
import linear_algebra.linear_independent
import order.order_iso... |
4286a68bfbd108fc8d9928da2e27fffff319c9f9 | 626e312b5c1cb2d88fca108f5933076012633192 | /src/analysis/convex/cone.lean | f4f3e0a8d8d26476d4f87290206f8bff9e6fa5f1 | [
"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 | 23,976 | lean | /-
Copyright (c) 2020 Yury Kudryashov All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov, Frédéric Dupuis
-/
import analysis.convex.basic
import analysis.normed_space.inner_product
/-!
# Convex cones
In a vector space `E` over `ℝ`, we define a convex cone... |
a77c60b5c5b2eddfc0125626cde1bbac2d2fe34e | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/tactic/zify.lean | 3751a0def70399620a575ee1454cb4f3b05230f4 | [
"Apache-2.0"
] | permissive | jjgarzella/mathlib | 96a345378c4e0bf26cf604aed84f90329e4896a2 | 395d8716c3ad03747059d482090e2bb97db612c8 | refs/heads/master | 1,686,480,124,379 | 1,625,163,323,000 | 1,625,163,323,000 | 281,190,421 | 2 | 0 | Apache-2.0 | 1,595,268,170,000 | 1,595,268,169,000 | null | UTF-8 | Lean | false | false | 5,376 | lean | /-
Copyright (c) 2020 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
-/
import tactic.norm_cast
import data.int.cast
/-!
# A tactic to shift `ℕ` goals to `ℤ`
It is often easier to work in `ℤ`, where subtraction is well behaved, than ... |
f5cfa05252b7af59a9dab221874eaad4a8c6cab5 | 3fc1c63665292f73d04b29573f40247b9c66497c | /src/export_json.lean | e7fb98682fac4000c6426d45f4afd64403bfd5d2 | [] | no_license | glangmead/doc-gen | 9f925d16643c0b28133c489ce184b1a0e0ad97d9 | 77a63f85ccdeaa1bebc7d5ee814f1c2fce93753b | refs/heads/master | 1,609,058,960,060 | 1,580,327,132,000 | 1,580,327,132,000 | 237,839,678 | 0 | 0 | null | 1,580,678,968,000 | 1,580,678,968,000 | null | UTF-8 | Lean | false | false | 11,183 | lean | /-
Copyright (c) 2019 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Robert Y. Lewis
-/
import tactic.core system.io data.string.defs tactic.interactive data.list.sort
import all
/-!
Used to generate a json file for html docs.
The json file is a list... |
df34b9a77c82403f33544f60880228a7fccb4a97 | 54deab7025df5d2df4573383df7e1e5497b7a2c2 | /topology/topological_space.lean | 786b07e651e99fc9124efb520a2db675c9b9a436 | [
"Apache-2.0"
] | permissive | HGldJ1966/mathlib | f8daac93a5b4ae805cfb0ecebac21a9ce9469009 | c5c5b504b918a6c5e91e372ee29ed754b0513e85 | refs/heads/master | 1,611,340,395,683 | 1,503,040,489,000 | 1,503,040,489,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 38,064 | 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
Theory of topological spaces.
Parts of the formalization is based on the books:
N. Bourbaki: General Topology
I. M. James: Topologies and Uniformities
A major diff... |
a4934a2a85750ee1f7b02f91ea586c72d0471db6 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/exfalsoBug.lean | f8da44ecf73dace12b9efbaefe3a79627365b908 | [
"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,316 | lean | namespace Ex1
def f (n : Nat) : Option { r : Nat // r ≤ n } :=
match n with
| 0 => some ⟨0, Nat.le_refl _⟩
| n+1 => match f n with
| some ⟨m, h₁⟩ =>
have : m < n+1 := Nat.lt_of_le_of_lt h₁ (Nat.lt_succ_self _)
match f m with
| some ⟨r, h₂⟩ => some ⟨r, Nat.le_trans h₂ (Nat.le_trans h₁ (Nat... |
e43542b6d4a8474386ad3d6027f3d47e09c52274 | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /06_Inductive_Types.org.18.lean | 532dbe1aa7a02db3b17cf113854d6f34180cc0df | [] | no_license | cjmazey/lean-tutorial | ba559a49f82aa6c5848b9bf17b7389bf7f4ba645 | 381f61c9fcac56d01d959ae0fa6e376f2c4e3b34 | refs/heads/master | 1,610,286,098,832 | 1,447,124,923,000 | 1,447,124,923,000 | 43,082,433 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 177 | lean | /- page 83 -/
import standard
structure Semigroup : Type :=
(carrier : Type)
(mul : carrier → carrier → carrier)
(mul_assoc : ∀ a b c, mul (mul a b) c = mul a (mul b c))
|
eb6390d578a97c77298983f290f9f48dd3896fe8 | f618aea02cb4104ad34ecf3b9713065cc0d06103 | /src/algebra/group_power.lean | dfcbf140ea5583a8d465ed543385b8b6f1b3a6c1 | [
"Apache-2.0"
] | permissive | joehendrix/mathlib | 84b6603f6be88a7e4d62f5b1b0cbb523bb82b9a5 | c15eab34ad754f9ecd738525cb8b5a870e834ddc | refs/heads/master | 1,589,606,591,630 | 1,555,946,393,000 | 1,555,946,393,000 | 182,813,854 | 0 | 0 | null | 1,555,946,309,000 | 1,555,946,308,000 | null | UTF-8 | Lean | false | false | 27,323 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Robert Y. Lewis
The power operation on monoids and groups. We separate this from group, because it depends on
nat, which in turn depends on other parts of algebra.
We h... |
5f5985ac698f5579a3e694c3364982ef6ef2ae15 | b561a44b48979a98df50ade0789a21c79ee31288 | /tests/lean/run/sarray.lean | ebfafc00ee70f488aca173c329a435a0b7499124 | [
"Apache-2.0"
] | permissive | 3401ijk/lean4 | 97659c475ebd33a034fed515cb83a85f75ccfb06 | a5b1b8de4f4b038ff752b9e607b721f15a9a4351 | refs/heads/master | 1,693,933,007,651 | 1,636,424,845,000 | 1,636,424,845,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 910 | lean | def mkByteArray (n : Nat) : ByteArray := do
let mut r := {}
for i in [:n] do
r := r.push (UInt8.ofNat i)
return r
def tst1 (n : Nat) (expected : UInt32) : IO Unit := do
let bs := mkByteArray n
let sum := bs.foldl (init := 0) fun s b => s + b.toUInt32
assert! sum == expected
IO.println sum
#eval tst1... |
25e2d5b2a836632ea0ee07c2fa7c0fb528c4dc31 | f20db13587f4dd28a4b1fbd31953afd491691fa0 | /library/init/data/option_t.lean | 84be9d3b56a59b091a3b76206b4ff01d7f2e0d21 | [
"Apache-2.0"
] | permissive | AHartNtkn/lean | 9a971edfc6857c63edcbf96bea6841b9a84cf916 | 0d83a74b26541421fc1aa33044c35b03759710ed | refs/heads/master | 1,620,592,591,236 | 1,516,749,881,000 | 1,516,749,881,000 | 118,697,288 | 1 | 0 | null | 1,516,759,470,000 | 1,516,759,470,000 | null | UTF-8 | Lean | false | false | 2,201 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.meta.interactive init.category.transformers
universes u v
def option_t (m : Type u → Type v) [monad m] (α : Type u) : Type v :=
m (opt... |
67db16e8a02cf8159da45caa47ec4e962f6f4c81 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/logic/equiv/set.lean | f99ab279507a721be2427a43c04d690c7af74970 | [
"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 | 25,332 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Mario Carneiro
-/
import data.set.function
import logic.equiv.defs
/-!
# Equivalences and sets
In this file we provide lemmas linking equivalences to sets.
... |
09be9e5c5132601081b2e4a70e7c991b98a031c9 | df561f413cfe0a88b1056655515399c546ff32a5 | /3-multiplication-world/l3.lean | 35ea0e6b7c2a5ecaa32e28ab01807d39e33daeea | [] | no_license | nicholaspun/natural-number-game-solutions | 31d5158415c6f582694680044c5c6469032c2a06 | 1e2aed86d2e76a3f4a275c6d99e795ad30cf6df0 | refs/heads/main | 1,675,123,625,012 | 1,607,633,548,000 | 1,607,633,548,000 | 318,933,860 | 3 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 147 | lean | lemma one_mul (m : mynat) : 1 * m = m :=
begin
induction m with k Pk,
rw mul_zero, refl,
rw mul_succ,
rw Pk,
symmetry,
exact succ_eq_add_one _,
end |
e8adab1abf6866c360ae62eaf37d7df2eb478cac | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/analysis/special_functions/trigonometric/arctan.lean | ab95d5755caab27f55327bf0da5101dd4c5e7a02 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 7,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, Abhimanyu Pallavi Sudhir, Jean Lo, Calle Sönne, Benjamin Davidson
-/
import analysis.special_functions.trigonometric.complex
/-!
# The `arctan` function.
Inequalities, de... |
4db84998c1d6a24c00f0896381af25fa044086d0 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/nat/log.lean | d9c490022e26f00041d139eedfda889dcede22dd | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,200 | lean | /-
Copyright (c) 2020 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.nat.basic
import Mathlib.PostPort
namespace Mathlib
/-!
# Natural number logarithm
This f... |
2a2f82fac7e69a97eb9254686c264a5afaf7793f | cf39355caa609c0f33405126beee2739aa3cb77e | /library/init/control/combinators.lean | ce5e04079afe36b8f1db7d538c90985ac42aae61 | [
"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 | 2,686 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura
Monad combinators, as in Haskell's Control.Monad.
-/
prelude
import init.control.monad init.control.alternative init.data.list.basic
universes ... |
53c35669e8448f799996fe3d051c8e4886d54932 | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /10_Structures_and_Records.org.17.lean | 7496d99db40b9ef77b10b0cf916424ce8ab63dce | [] | no_license | cjmazey/lean-tutorial | ba559a49f82aa6c5848b9bf17b7389bf7f4ba645 | 381f61c9fcac56d01d959ae0fa6e376f2c4e3b34 | refs/heads/master | 1,610,286,098,832 | 1,447,124,923,000 | 1,447,124,923,000 | 43,082,433 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 546 | lean | import standard
import data.nat
open nat
structure point (A : Type) :=
(x : A) (y : A) (z : A)
structure rgb_val :=
(red : nat) (green : nat) (blue : nat)
structure red_green_point (A : Type) extends point A, rgb_val :=
(no_blue : blue = 0)
definition p : point nat := {| point, x := 10, y := 10, z := 20 |}
definiti... |
ed298d97de29043934623453e482ee4741131569 | 2d787ac9a5ab28a7d164cd13cee8a3cdc1e4680a | /src/my_exercises/01_equality_rewriting.lean | bb15990d7e33ce21102a6f7b90f3b9abb91ce4dd | [
"Apache-2.0"
] | permissive | paulzfm/lean3-tutorials | 8c113ec2c9494d401c8a877f094db93e5a631fd6 | f41baf1c62c251976ec8dd9ccae9e85ec4c4d336 | refs/heads/master | 1,679,267,488,532 | 1,614,782,461,000 | 1,614,782,461,000 | 344,157,026 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,803 | lean | import data.real.basic
/-
One of the earliest kind of proofs one encounters while learning mathematics is proving by
a calculation. It may not sound like a proof, but this is actually using lemmas expressing
properties of operations on numbers. It also uses the fundamental property of equality: if two
mathematical ob... |
1b64d3a8fe0b4923c5800b697f657920b851867a | b7f22e51856f4989b970961f794f1c435f9b8f78 | /library/algebra/ordered_field.lean | 43c17a06272bc9bde8ae703fad99ef15a97741bc | [
"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 | 23,559 | lean | /-
Copyright (c) 2014 Robert Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Lewis
-/
import algebra.ordered_ring algebra.field
open eq eq.ops
structure linear_ordered_field [class] (A : Type) extends linear_ordered_ring A, field A
section linear_ordered... |
cafeec0fd19ba97deb4321d5e50109dd2c012370 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/interactive/codeaction.lean | 1ae5a6aa4e29c8362c04ecef879554d9bdba7f20 | [
"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 | 835 | lean | import Lean
open Lean Server Lsp
@[code_action_provider]
def helloProvider : CodeActionProvider := fun params _snap => do
let td := params.textDocument
let edit : TextEdit := {
range := params.range,
newText := "hello!!!"
}
let ca : CodeAction := {
title := "hello world",
kind? := "quick... |
7aefff41d06660dfc360597eb228ef52520143df | 853df553b1d6ca524e3f0a79aedd32dde5d27ec3 | /src/tactic/ext.lean | a8a4a6c3f6d60f59f8d941433bb69f38cfd64f78 | [
"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 | 14,677 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
-/
import tactic.rcases
import data.sum logic.function.basic
universes u₁ u₂
open interactive interactive.types
open lean.parser nat tactic
/--
`derive_struct_ext_lemma n` g... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.