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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
b1c878107da7b8691346a4793ef0143455d364e5 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/blast_cc_heq5.lean | 4708833caa0267c5cdfd5e6eb27bac21c2044b92 | [
"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 | 215 | lean | set_option blast.strategy "cc"
set_option blast.cc.heq true
definition ex1 (a b c a' b' c' : nat) : a = a' → b = b' → c = c' → a + b + c + a = a' + b' + c' + a' :=
by blast
set_option pp.beta true
print ex1
|
0883b555286b5be8c0b9647f2bb631c832d6a597 | 4f643cce24b2d005aeeb5004c2316a8d6cc7f3b1 | /src/o_minimal/Def.lean | a614988ba41a94e3606a83d30fe9a13701b45a03 | [] | no_license | rwbarton/lean-omin | da209ed061d64db65a8f7f71f198064986f30eb9 | fd733c6d95ef6f4743aae97de5e15df79877c00e | refs/heads/master | 1,674,408,673,325 | 1,607,343,535,000 | 1,607,343,535,000 | 285,150,399 | 9 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,980 | lean | import category_theory.concrete_category
import o_minimal.definable
/-
The category of (literal) definable subsets of Rⁿ
and definable functions between them (not just continuous ones).
Used as the index category for "definable sheaves".
-/
namespace o_minimal
universe u
variables {R : Type u} (S : struc R)
struct... |
23872b5fd315c9c8141b40d3990233b49d1dd2de | 12dabd587ce2621d9a4eff9f16e354d02e206c8e | /world10/level17.lean | db01db2f7422f2cb0b5701bc6a28f8dab09b629a | [] | no_license | abdelq/natural-number-game | a1b5b8f1d52625a7addcefc97c966d3f06a48263 | bbddadc6d2e78ece2e9acd40fa7702ecc2db75c2 | refs/heads/master | 1,668,606,478,691 | 1,594,175,058,000 | 1,594,175,058,000 | 278,673,209 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 217 | lean | definition lt (a b : mynat) := a ≤ b ∧ ¬ (b ≤ a)
instance : has_lt mynat := ⟨lt⟩
lemma lt_iff_succ_le (a b : mynat) : a < b ↔ succ a ≤ b :=
begin
split,
exact lt_aux_one a b,
exact lt_aux_two a b,
end
|
6e955e3869b1fa33b08153a24d92a5d08e2f295c | 680fb1fcc7ff570fed489d49ab9e92006811c904 | /src/category/lens.lean | 94303089781feb95b8992ecd7afea611592705f6 | [] | no_license | unitb/lean-lens | 0432d9561d8459124e46f7fc590f12249eca570f | 42a50e1538ebed352a440b4c40ce81caab59a97f | refs/heads/master | 1,584,264,632,380 | 1,525,401,777,000 | 1,525,401,777,000 | 132,076,578 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,339 | lean |
import .classes
import util.data.functor
inductive lens_type
| lens | traversal | prism
universes u v
/-
Features
- Lens types: lens, traversal, prism, indexed (...),
- conversion
- lens laws
- parametric lens laws
-/
def const {α : Sort u} {β : Sort v} (x : α) (_ : β) := x
instance {α} : functor (cons... |
d6067b4b78befb3f73aec934bacaa9119a43ca32 | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/set_theory/ordinal.lean | 6298aa2071b4aeadcac910df512cce0d526dd8ca | [
"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 | 124,764 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
Ordinal arithmetic.
Ordinals are defined as equivalences of well-ordered sets by order isomorphism.
-/
import order.order_iso set_theory.cardinal data.sum
noncomputable... |
35563e76ce76c7a50d18d6628c75c31d2a0ebb4d | 4fa161becb8ce7378a709f5992a594764699e268 | /src/category_theory/closed/cartesian.lean | bdf2942a40fed7617d0211b407bf4b067d825e36 | [
"Apache-2.0"
] | permissive | laughinggas/mathlib | e4aa4565ae34e46e834434284cb26bd9d67bc373 | 86dcd5cda7a5017c8b3c8876c89a510a19d49aad | refs/heads/master | 1,669,496,232,688 | 1,592,831,995,000 | 1,592,831,995,000 | 274,155,979 | 0 | 0 | Apache-2.0 | 1,592,835,190,000 | 1,592,835,189,000 | null | UTF-8 | Lean | false | false | 16,188 | lean | /-
Copyright (c) 2020 Bhavik Mehta, Edward Ayers, Thomas Read. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta, Edward Ayers, Thomas Read
-/
import category_theory.limits.shapes.binary_products
import category_theory.limits.shapes.constructions.preserve_bi... |
480cfe3b782f98541af9783fee924705d3f3e71b | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /test/fin_cases.lean | d2d3251bd39f347d9c373349197f312da84cd408 | [
"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 | 2,326 | 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 tactic.fin_cases
import data.nat.prime
import group_theory.perm.sign
import data.finset.intervals
example (f : ℕ → Prop) (p : fin 3) (h0 : f 0) (h1 : f 1) (h2... |
167d750aa6c4b135b1bc2248a764c56d44a73566 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /leanpkg/leanpkg/proc.lean | 82c61ff833b726a123534d33651ec68d004705b1 | [
"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 | 621 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Gabriel Ebner
-/
import system.io leanpkg.toml
open io io.proc
variable [io.interface]
namespace leanpkg
def exec_cmd (args : io.process.spawn_args) : io unit := do
let cmdstr ... |
692f5bc241e67cf4ab85504d43a60cae5996eb07 | 07c6143268cfb72beccd1cc35735d424ebcb187b | /src/order/filter/bases.lean | c2ffc57291c90de5068db1a309ce3ff65aaf80ca | [
"Apache-2.0"
] | permissive | khoek/mathlib | bc49a842910af13a3c372748310e86467d1dc766 | aa55f8b50354b3e11ba64792dcb06cccb2d8ee28 | refs/heads/master | 1,588,232,063,837 | 1,587,304,803,000 | 1,587,304,803,000 | 176,688,517 | 0 | 0 | Apache-2.0 | 1,553,070,585,000 | 1,553,070,585,000 | null | UTF-8 | Lean | false | false | 27,957 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Yury Kudryashov, Johannes Hölzl, Mario Carneiro, Patrick Massot
-/
import order.filter.basic data.set.countable
/-! # Filter bases
A filter basis `B : filter_basis α` on a type `α` ... |
63f74aa9c9cb3c9d1f539afdff22f2c196bc394c | 2c41ae31b2b771ad5646ad880201393f5269a7f0 | /Lean/Qualities/Duration.lean | 3a28b8d91947fc9ecd3fbc3d8fed57e07fb84060 | [] | no_license | kevinsullivan/Boehm | 926f25bc6f1a8b6bd47d333d936fdfc278228312 | 55208395bff20d48a598b7fa33a4d55a2447a9cf | refs/heads/master | 1,586,127,134,302 | 1,488,252,326,000 | 1,488,252,326,000 | 32,836,930 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 547 | lean | -- Duration
/-
[Duration] is parameterized by an instance of type [SystemType], and it's a sub-attribute to [Efficient].
-/
import SystemModel.System
inductive Duration (sys_type: SystemType): Prop
| intro : (exists duration: sys_type ^.Contexts -> sys_type ^.Phases -> sys_type ^.Stakeholders -> @SystemInsta... |
5fff0b5b9b9a5a25173233ee39f302b7f2c49fa2 | 271e26e338b0c14544a889c31c30b39c989f2e0f | /src/Init/Lean/Elab/Quotation.lean | 0a175824ea69ef6ce83dc1460cc21cd62dfb2f3c | [
"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 | 21,703 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
Elaboration of syntax quotations as terms and patterns (in `match_syntax`). See also `./Hygiene.lean` for the basic
hygiene workings and data types.
-/
prelud... |
cf926699f2989133df8b322e4d49ed0be95cc550 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/1408.lean | f13676d107f3589ecbac55a8ff18bae95b528eab | [
"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 | 537 | lean | inductive Foo (n : Nat)
class Bar (n: Nat) (α : Type u) (β: outParam (Type u)) where
bar: Foo n → Fin (n+1) → α → β
instance: Bar n (Foo (n+1)) (Foo n) := sorry
example (t: Foo (n+2)) (s₁: Foo (n+1)) (s₂: Foo n) (t': Foo n) (hk: k < n + 1) (hm: m < n + 2):
Bar.bar s₂ ⟨k, hk⟩ (Bar.bar s₁ ⟨m, ‹_›⟩ t) = t' := sorr... |
bff33c1d11bbd63f0c3fdc7c89a6c528cc72b19f | cf39355caa609c0f33405126beee2739aa3cb77e | /library/init/meta/occurrences.lean | deff216c025b66072a2e6cea1e9e8b806f36ec55 | [
"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,478 | 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.logic init.data.repr init.meta.format
import init.meta.contradiction_tactic init.meta.constructor_tactic
import init.meta.relation_tacti... |
5bbb4419a284c4c530bfd06d6bc1ff57144109fa | a5a27b98e1e67df65efead05aead0f1d95a9a9e9 | /test/super_examples.lean | de15d275e58937a52dea9003649ac61b6c7f3178 | [] | no_license | Kha/super | 21548ce9b6e37a2de0f717791d4805c1c4daa97f | 49a900485426f6fee16b135d5863098508d1ffc4 | refs/heads/master | 1,611,377,107,637 | 1,496,230,564,000 | 1,496,230,564,000 | 92,940,317 | 0 | 0 | null | 1,496,230,895,000 | 1,496,230,895,000 | null | UTF-8 | Lean | false | false | 2,927 | lean | import super
open tactic
constant nat_has_dvd : has_dvd nat
attribute [instance] nat_has_dvd
noncomputable def prime (n : ℕ) := ∀d, d ∣ n → d = 1 ∨ d = n
axiom dvd_refl (m : ℕ) : m ∣ m
axiom dvd_mul (m n k : ℕ) : m ∣ n → m ∣ (n*k)
axiom nat_mul_cancel_one (m n : ℕ) : m = m * n → n = 1
example {m n : ℕ} : prime (m *... |
7d1fe635f3749d6f73517c03ac3f38d154e40667 | f5f7e6fae601a5fe3cac7cc3ed353ed781d62419 | /src/category_theory/limits/cones.lean | cb207993310d92e97f05fd8ccff3afd3b3f62c86 | [
"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 | 11,111 | 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
import category_theory.natural_isomorphism
import category_theory.whiskering
import category_theory.const
import category_theory.opposites
import ... |
58ec01d275aa0e9cec44a414d0e396dfd3a3f0d9 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/topology/semicontinuous.lean | bec1d2dd141c2a905d17d556ed2162fcdc6179e6 | [
"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 | 43,257 | lean | /-
Copyright (c) 2021 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 algebra.indicator_function
import topology.algebra.group
import topology.continuous_on
import topology.instances.ennreal
/-!
# Semicontinuous maps
A fu... |
06a62c6aa97c8c69d6a51cb41af4879061e821d3 | 3af272061d36e7f3f0521cceaa3a847ed4e03af9 | /src/characteristic_polynomial.lean | 11f95238d808ec80e2dd1a04b437b229d3469466 | [] | no_license | semorrison/kbb | fdab0929d21dca880d835081814225a95f946187 | 229bd06e840bc7a7438b8fee6802a4f8024419e3 | refs/heads/master | 1,585,351,834,355 | 1,539,848,241,000 | 1,539,848,241,000 | 147,323,315 | 2 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 414 | lean | import data.polynomial
import .determinants
universes u v w
namespace matrix
variables {m n : Type u} [fintype m] [fintype n] [decidable_eq n]
variables {R : Type v} [comm_ring R] [decidable_eq R]
open polynomial
def map {X Y : Type w} (f : X → Y) : matrix m n X → matrix m n Y :=
λ M i j, f (M i j)
def characteris... |
57b586f8c8ff903b938a98df9af68aa8c4d3ce59 | bb31430994044506fa42fd667e2d556327e18dfe | /src/analysis/normed/group/seminorm.lean | c84c02e26aee6191818cf0879693d999550c1de0 | [
"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 | 16,585 | lean | /-
Copyright (c) 2022 María Inés de Frutos-Fernández, Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: María Inés de Frutos-Fernández, Yaël Dillies
-/
import tactic.positivity
import data.real.nnreal
/-!
# Group seminorms
This file defines norms and semin... |
fd873e6e9ed7ecda6a5f8a6810b1f2998928964f | 5a8eb1c11f93715e070b588e85f2961065c3714d | /books/theorem-proving-in-lean/ch02-02.lean | 39a4277fe4a57a2115dbddc3ef75b0d53ff8e9ee | [
"MIT"
] | permissive | luksamuk/study | 0e19bf99d33e0793127c3d3f8ad3936fbeb36505 | 6a9417e071a8624c4cd9db696c16a3abcc430219 | refs/heads/master | 1,677,960,533,266 | 1,676,234,529,000 | 1,676,234,529,000 | 151,009,060 | 4 | 1 | MIT | 1,676,234,531,000 | 1,538,343,224,000 | C++ | UTF-8 | Lean | false | false | 1,196 | lean | #check ℕ
#check bool
#check ℕ → bool
#check ℕ × bool
#check ℕ → ℕ
#check ℕ × ℕ → ℕ
#check ℕ → ℕ → ℕ
#check ℕ → (ℕ → ℕ)
#check ℕ → ℕ → bool
#check (ℕ → ℕ) → ℕ
-- Declaring new constants and
-- constructors for types
constants α β : Type
constant F : Type → Type
constant G : Type → Type → Type
#check α
#check F α
#ch... |
00474de76ae71c054d60791aa439356cc8daac1b | a4673261e60b025e2c8c825dfa4ab9108246c32e | /src/Lean/Data/LBool.lean | 2676b0f1c24914fcdf578edec68ccab18ec2ba4e | [
"Apache-2.0"
] | permissive | jcommelin/lean4 | c02dec0cc32c4bccab009285475f265f17d73228 | 2909313475588cc20ac0436e55548a4502050d0a | refs/heads/master | 1,674,129,550,893 | 1,606,415,348,000 | 1,606,415,348,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,018 | 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
-/
namespace Lean
inductive LBool :=
| false
| true
| undef
namespace LBool
instance : Inhabited LBool := ⟨false⟩
def neg : LBool → LBool
| true ... |
958791b4fda61fa16593a6b1290f79214e9b6eba | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/data/opposite.lean | a2077cf8f37c3c834be872fc7ff9f9d15c89b63b | [
"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 | 4,443 | 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, Simon Hudon, Kenny Lau
-/
import data.equiv.basic
/-!
# Opposites
In this file we define a type synonym `opposite α := α`, denoted by `αᵒᵖ` and two synon... |
e88cab0bae369601e014dc1e389ce2aaead67f83 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/control/traversable/instances.lean | 39c29cfb5847d5dba7347c23448fe9ab87f311bb | [
"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,686 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
Instances of `traversable` for types from the core library
-/
import data.list.forall2
import data.set.lattice
import control.traversable.lemmas
universes u v
section optio... |
4921ae29a7231cf817db40d90ac02210c70a889d | 9028d228ac200bbefe3a711342514dd4e4458bff | /src/group_theory/presented_group.lean | 78b164330fd83306767a0ff463aed4ea005b3b1b | [
"Apache-2.0"
] | permissive | mcncm/mathlib | 8d25099344d9d2bee62822cb9ed43aa3e09fa05e | fde3d78cadeec5ef827b16ae55664ef115e66f57 | refs/heads/master | 1,672,743,316,277 | 1,602,618,514,000 | 1,602,618,514,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,440 | lean | /-
Copyright (c) 2019 Michael Howes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Michael Howes
Defining a group given by generators and relations
-/
import group_theory.free_group
import group_theory.quotient_group
variables {α : Type}
/-- Given a set of relation... |
c026110380c80c9e219d0e7889b41896728d8929 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/category_theory/action.lean | ecfa58399310432d81f84aa15a22216cefd79077 | [
"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 | 3,122 | lean | /-
Copyright (c) 2020 David Wärn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Wärn
-/
import category_theory.elements
import category_theory.single_obj
/-!
# Actions as functors and as categories
From a multiplicative action M ↻ X, we can construct a functor... |
5506c6c09767b601de1c894fda7d8f58287510a5 | 367134ba5a65885e863bdc4507601606690974c1 | /src/data/seq/parallel.lean | af9a39b4ea2da918854ad8d043c273c35f949ba7 | [
"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 | 12,114 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
Parallel computation of a computable sequence of computations by
a diagonal enumeration.
The important theorems of this operation are proven as
terminates_paralle... |
f05cf656b0c354e2b080f3cd338f3e6f30b62ccf | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/hott/443_b.hlean | f8b7c77e8cf165ccaecf39ecb5f52f632920e80f | [
"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 | 573 | hlean | import algebra.group algebra.category
open eq sigma unit category algebra equiv
set_option pp.implicit true
set_option pp.universes true
set_option pp.notation false
section
parameters {D₀ : Type} [C : precategory D₀]
{D₂ : Π ⦃a b c d : D₀⦄ (f : hom a b) (g : hom c d)
(h : hom a c) (i : hom b d), Type}
... |
cf2a1d1d0dba9e2b64cb865d40de7cd1e5aadca7 | d1bbf1801b3dcb214451d48214589f511061da63 | /src/data/buffer/parser/basic.lean | c80ebf7e4540a9af126537de515ca7ee965e3355 | [
"Apache-2.0"
] | permissive | cheraghchi/mathlib | 5c366f8c4f8e66973b60c37881889da8390cab86 | f29d1c3038422168fbbdb2526abf7c0ff13e86db | refs/heads/master | 1,676,577,831,283 | 1,610,894,638,000 | 1,610,894,638,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 29,220 | lean | /-
Copyright (c) 2020 Yakov Pechersky. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yakov Pechersky
-/
import data.string.basic
/-!
# Parsers
`parser α` is the type that describes a computation that can ingest a `char_buffer`
and output, if successful, a term of ty... |
5b4786227e30e69a21b8709484ff160e342e01d9 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/algebra/big_operators/order.lean | b613f5a1ba6f7a093f75044cdf545b9db4ab5f1d | [
"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 | 14,425 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
-/
import algebra.big_operators.basic
/-!
# Results about big operators with values in an ordered algebraic structure.
Mostly monotonicity results for the `∑` operati... |
1f5b4c39b91b323bdde8883d5c8986f9af1ac432 | 36c7a18fd72e5b57229bd8ba36493daf536a19ce | /tests/lean/run/blast13.lean | 26cd8bca3c2d8a5799c647786005f727e506ba99 | [
"Apache-2.0"
] | permissive | YHVHvx/lean | 732bf0fb7a298cd7fe0f15d82f8e248c11db49e9 | 038369533e0136dd395dc252084d3c1853accbf2 | refs/heads/master | 1,610,701,080,210 | 1,449,128,595,000 | 1,449,128,595,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 306 | lean | import data.list
open perm
example (p : Prop) (l : list nat) : ¬ l ~ l → p :=
by blast
example (a : nat) : ¬ a = a → false :=
by blast
example (A : Type) (p : Prop) (a b c : A) : a = b → ¬ b = a → p :=
by blast
example (A : Type) (p : Prop) (a b c : A) : a = b → b ≠ a → p :=
by blast
|
8d82e65d68dc26d86b6d2eb8ab191fa527c756a5 | a4673261e60b025e2c8c825dfa4ab9108246c32e | /stage0/src/Init/Control/Reader.lean | f71edfecbaf4d77b7955490d6afbc07552bb9dc2 | [
"Apache-2.0"
] | permissive | jcommelin/lean4 | c02dec0cc32c4bccab009285475f265f17d73228 | 2909313475588cc20ac0436e55548a4502050d0a | refs/heads/master | 1,674,129,550,893 | 1,606,415,348,000 | 1,606,415,348,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 990 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
The Reader monad transformer for passing immutable State.
-/
prelude
import Init.Control.Basic
import Init.Control.Id
import Init.Control.Except
namespace Re... |
25c905c8248358a61dd1d76cd9a6ff0b32771396 | 88fb7558b0636ec6b181f2a548ac11ad3919f8a5 | /tests/lean/macro_args.lean | 6122111b043b84c63159c147ab18ef26bbee738c | [
"Apache-2.0"
] | permissive | moritayasuaki/lean | 9f666c323cb6fa1f31ac597d777914aed41e3b7a | ae96ebf6ee953088c235ff7ae0e8c95066ba8001 | refs/heads/master | 1,611,135,440,814 | 1,493,852,869,000 | 1,493,852,869,000 | 90,269,903 | 0 | 0 | null | 1,493,906,291,000 | 1,493,906,291,000 | null | UTF-8 | Lean | false | false | 73 | lean | #eval ``({pos . line := has_zero.zero, col := 1}).to_raw_expr.to_raw_fmt
|
d92508affbf9205758fcbd71f1c6ed8acbbe19d0 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/blast_meta.lean | be6ccb0b026e551a9249875f57bb1e2be9aac8b1 | [
"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 | 235 | lean | constant p : nat → nat → Prop
constant p_trans : ∀ a b c, p a b → p b c → p a c
definition lemma1 (a b c d : nat) : a = d → p b c → p a b → p a c :=
begin
intros,
apply p_trans,
blast,
blast
end
print lemma1
|
1b3d8cb1d09172e2d5303d94f03f5e7312f367c8 | c8b4b578b2fe61d500fbca7480e506f6603ea698 | /src/number_theory/cyclotomic/factoring.lean | c4874f517727bbbc24d14883e716ecbb68831ed4 | [] | no_license | leanprover-community/flt-regular | aa7e564f2679dfd2e86015a5a9674a6e1197f7cc | 67fb3e176584bbc03616c221a7be6fa28c5ccd32 | refs/heads/master | 1,692,188,905,751 | 1,691,766,312,000 | 1,691,766,312,000 | 421,021,216 | 19 | 4 | null | 1,694,532,115,000 | 1,635,166,136,000 | Lean | UTF-8 | Lean | false | false | 2,392 | lean | /-
Copyright (c) 2021 Alex J. Best. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Alex J. Best
-/
import number_theory.cyclotomic.basic
import ready_for_mathlib.homogenization
open_locale big_operators
open polynomial finset mv_polynomial
-- TODO might be nice to h... |
0f40ceb25b4805965814a2010fcb80de2fedd4b4 | 1abd1ed12aa68b375cdef28959f39531c6e95b84 | /src/measure_theory/group/arithmetic.lean | 16ad5f677f1d2fda1dc3f3061d3a817f2f81ea3c | [
"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 | 28,046 | lean | /-
Copyright (c) 2021 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import measure_theory.measure.measure_space
/-!
# Typeclasses for measurability of operations
In this file we define classes `has_measurable_mul` etc and prove do... |
7fb37424b4276893e78c920aaa8ca9ccc1b9808f | 367134ba5a65885e863bdc4507601606690974c1 | /src/algebra/triv_sq_zero_ext.lean | f4756853d9b78ffca9c743af024a8e0404959fbb | [
"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 | 10,981 | lean | /-
Copyright (c) 2020 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import algebra.algebra.basic
/-!
# Trivial Square-Zero Extension
Given a module `M` over a ring `R`, the trivial square-zero extension of `M` over `R` is defined
to be the `... |
feaa6c7580031dc43e6fbf98f8519ad11fa9a181 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/linear_algebra/charpoly/basic.lean | e8af898a29eafc3f1f88379d21e3a93536b13789 | [
"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 | 2,915 | lean | /-
Copyright (c) 2021 Riccardo Brasca. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Riccardo Brasca
-/
import linear_algebra.free_module.finite.basic
import linear_algebra.matrix.charpoly.coeff
/-!
# Characteristic polynomial
We define the characteristic polynomi... |
376202b2dae0b31240c9607c87106db9f5dab899 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/char_p/local_ring.lean | 1d284e6a341d96d3b2b54021a8d62740d134429b | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 3,048 | lean | /-
Copyright (c) 2022 Jon Eugster. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jon Eugster
-/
import algebra.char_p.basic
import ring_theory.ideal.local_ring
import algebra.is_prime_pow
import data.nat.factorization.basic
/-!
# Characteristics of local rings
> THI... |
d2ae317864d1a1f4d18f563d8a354b299248edb6 | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/order/filter/basic.lean | 0fb53737686c66871847fd608f1f14fe294fcb6d | [
"Apache-2.0"
] | permissive | abentkamp/mathlib | d9a75d291ec09f4637b0f30cc3880ffb07549ee5 | 5360e476391508e092b5a1e5210bd0ed22dc0755 | refs/heads/master | 1,682,382,954,948 | 1,622,106,077,000 | 1,622,106,077,000 | 149,285,665 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 111,453 | 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, Jeremy Avigad
-/
import order.zorn
import order.copy
import data.set.finite
import tactic.monotonicity
/-!
# Theory of filters on sets
## Main definitions
* `filter`... |
ef23254a44a37a36585e034235d72272e2091f0e | 3c9dc4ea6cc92e02634ef557110bde9eae393338 | /stage0/src/Init/Data/Float.lean | d8762c87a80826424495adf1d54dd028a9e81256 | [
"Apache-2.0"
] | permissive | shingtaklam1324/lean4 | 3d7efe0c8743a4e33d3c6f4adbe1300df2e71492 | 351285a2e8ad0cef37af05851cfabf31edfb5970 | refs/heads/master | 1,676,827,679,740 | 1,610,462,623,000 | 1,610,552,340,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,917 | 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.Core
import Init.Data.ToString.Basic
structure FloatSpec where
float : Type
val : float
lt : float → float → Prop
le : ... |
bb35ea7c197e8c673419540c2f4117a88d5d4efa | 4727251e0cd73359b15b664c3170e5d754078599 | /src/measure_theory/integral/integrable_on.lean | a5248839a5e5c4b86b34086207696c68791545bf | [
"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 | 20,748 | lean | /-
Copyright (c) 2021 Rémy Degenne. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou, Yury Kudryashov
-/
import measure_theory.function.l1_space
import analysis.normed_space.indicator_function
/-! # Functions integrable on a set and at a filter
We define... |
9cc57a2563dbfb94a1b5d5bb7b401c581d1fbb98 | 82b86ba2ae0d5aed0f01f49c46db5afec0eb2bd7 | /stage0/src/Init/Classical.lean | e658a639d0424a6a671a56fe2773644be4a747e0 | [
"Apache-2.0"
] | permissive | banksonian/lean4 | 3a2e6b0f1eb63aa56ff95b8d07b2f851072d54dc | 78da6b3aa2840693eea354a41e89fc5b212a5011 | refs/heads/master | 1,673,703,624,165 | 1,605,123,551,000 | 1,605,123,551,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,393 | 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.Core
universes u v
/- Classical reasoning support -/
namespace Classical
axiom choice {α : Sort u} : Nonempty α → α
noncomputable d... |
d3af198cca29e4f2099dca2b53804115fad39f94 | 649957717d58c43b5d8d200da34bf374293fe739 | /src/category_theory/opposites.lean | dff85aece5aef704b7945b1877f7308fdee67872 | [
"Apache-2.0"
] | permissive | Vtec234/mathlib | b50c7b21edea438df7497e5ed6a45f61527f0370 | fb1848bbbfce46152f58e219dc0712f3289d2b20 | refs/heads/master | 1,592,463,095,113 | 1,562,737,749,000 | 1,562,737,749,000 | 196,202,858 | 0 | 0 | Apache-2.0 | 1,562,762,338,000 | 1,562,762,337,000 | null | UTF-8 | Lean | false | false | 8,348 | 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
import category_theory.products
import category_theory.types
import category_theory.natural_isomorphism
import data.opposite
universes v₁ v₂ u₁ u... |
56cca3c8e9702f0123e7ea3c1f364dfbc6120171 | 2d787ac9a5ab28a7d164cd13cee8a3cdc1e4680a | /src/my_exercises/03_forall_or.lean | 9aa86635026ce46d32680fbfcbffa351abaf45cf | [
"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 | 9,022 | lean | import data.real.basic
import algebra.group.pi
set_option pp.beta true
/-
In this file, we'll learn about the ∀ quantifier, and the disjunction
operator ∨ (logical OR).
Let P be a predicate on a type X. This means for every mathematical
object x with type X, we get a mathematical statement P x.
In Lean, P x has ty... |
b6bc8f3c0d1f2fe59b35c6e64257172b6bbefa87 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/limits/preserves/shapes/equalizers.lean | 45248fedff2e23338a7e7df1737f14472be8c1aa | [] | 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,767 | lean | /-
Copyright (c) 2020 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.category_theory.limits.shapes.split_coequalizer
import Mathlib.category_theory.limits.preserves... |
d61dfa8006386656361dea23895ff625b02142a6 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/geometry/manifold/instances/real.lean | 6b68fbfc673c454c3f3d7493d39cd63b0788b39b | [
"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 | 15,879 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import geometry.manifold.algebra.smooth_functions
import linear_algebra.finite_dimensional
import analysis.normed_space.inner_product
/-!
# Constructing exampl... |
df9eda6bb4c6ba7a9c3839da5819a38ef772aed0 | 592ee40978ac7604005a4e0d35bbc4b467389241 | /Library/generated/mathscheme-lean/IdempotentAdditiveMagma.lean | 844498869985cdd83342b37d21d7fd4e042ea2eb | [] | 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 | 6,726 | 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 IdempotentAdditiveMagma
structure IdempotentAdditiveMagma (A : Type) : Type :=
(plus : (A → (A → A)))
(idempotent_plus : (∀ {x : A} , (plus x x) = x))
ope... |
2b8f5d5f648bfca3047e28a4c462cc7a5e72bc56 | 75db7e3219bba2fbf41bf5b905f34fcb3c6ca3f2 | /hott/algebra/category/limits/colimits.hlean | 38e96450b77dc1f22905fe8bbef67c826650fdef | [
"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 | 13,416 | 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
Colimits in a category
-/
import .limits ..constructions.opposite
open is_trunc functor nat_trans eq
-- we define colimits to be the dual of a limit
namespace c... |
eaad62ad6aa54f0a9c96975a4332b9da2539e394 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/topology/constructions.lean | c417015bb6d4059b475d8252e4a7949f3e8ef179 | [
"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 | 59,534 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro, Patrick Massot
-/
import topology.maps
import order.filter.pi
/-!
# Constructions of new topological spaces from old ones
> THIS FILE IS SYNCHRONIZED ... |
58cd2c19679e5adee50f8f5c0267be796defebec | bb31430994044506fa42fd667e2d556327e18dfe | /src/algebra/continued_fractions/computation/approximations.lean | 99a04f2f26d9421196d8982a01458463f4e3194a | [
"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 | 28,862 | lean | /-
Copyright (c) 2020 Kevin Kappelmann. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Kappelmann
-/
import algebra.continued_fractions.computation.correctness_terminating
import data.nat.fib
import tactic.solve_by_elim
/-!
# Approximations for Continued Fraction... |
62af9d7995637d140518ad8b224832314f1159f1 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/data/list/chain.lean | 6ed17d1410a396decca88850b4a8e97c95f7710e | [
"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 | 13,348 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Kenny Lau, Yury Kudryashov
-/
import data.list.pairwise
import logic.relation
/-!
# Relation chain
This file provides basic results about `list.chain` (definition in ... |
50a5127a511cb056b5acf7c2b2906a7a00624686 | 08bd4ba4ca87dba1f09d2c96a26f5d65da81f4b4 | /src/Lean/Widget/Diff.lean | 15ff3d74c31ada3bcad1f55f37c35ef59700135f | [
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"Apache-2.0",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | gebner/lean4 | d51c4922640a52a6f7426536ea669ef18a1d9af5 | 8cd9ce06843c9d42d6d6dc43d3e81e3b49dfc20f | refs/heads/master | 1,685,732,780,391 | 1,672,962,627,000 | 1,673,459,398,000 | 373,307,283 | 0 | 0 | Apache-2.0 | 1,691,316,730,000 | 1,622,669,271,000 | Lean | UTF-8 | Lean | false | false | 13,332 | lean | /-
Copyright (c) 2022 E.W.Ayers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: E.W.Ayers
-/
import Lean.Meta.PPGoal
import Lean.Widget.InteractiveCode
import Lean.Widget.InteractiveGoal
import Lean.Data.Lsp.Extra
import Lean.Elab.InfoTree
namespace Lean.Widget
regi... |
e4fc34d9847f0d54fa23728c8066ff4b7c938a78 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/lean/run/rc_tests.lean | 27390e959613788d1113ec5e7eabe9670c048d85 | [
"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 | 1,116 | lean | universes u v
-- setOption pp.binderTypes False
set_option pp.implicit true
set_option trace.compiler.llnf true
-- set_option trace.compiler.boxed true
namespace x1
def f (x : Bool) (y z : Nat) : Nat :=
match x with
| true => y
| false => z + y + y
end x1
namespace x2
def f (x : Nat) : Nat := x
end x2
namespa... |
31effbc4974287d4facfcb4bd1794db7da16b402 | f57749ca63d6416f807b770f67559503fdb21001 | /library/data/finset/card.lean | f670ea076c236437ee68ef5854985f0e2e40c898 | [
"Apache-2.0"
] | permissive | aliassaf/lean | bd54e85bed07b1ff6f01396551867b2677cbc6ac | f9b069b6a50756588b309b3d716c447004203152 | refs/heads/master | 1,610,982,152,948 | 1,438,916,029,000 | 1,438,916,029,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,439 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad
Cardinality calculations for finite sets.
-/
import .to_set .bigops data.set.function data.nat.power data.nat.bigops
open nat eq.ops
namespace finset
variables {... |
ad913bff72d48f39f0f3f14ad18110e1c2b3beda | da23b545e1653cafd4ab88b3a42b9115a0b1355f | /src/tidy/fsplit.lean | 015492dd004faab8f1dded523a4f9821864d068b | [] | no_license | minchaowu/lean-tidy | 137f5058896e0e81dae84bf8d02b74101d21677a | 2d4c52d66cf07c59f8746e405ba861b4fa0e3835 | refs/heads/master | 1,585,283,406,120 | 1,535,094,033,000 | 1,535,094,033,000 | 145,945,792 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 466 | lean | -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Scott Morrison
open tactic
meta def fsplit : tactic unit :=
do [c] ← target >>= instantiate_mvars >>= whnf >>= get_constructors_for | tactic.fail "fsplit tactic failed, target ... |
7009f0c10f3b2c02e8beb77abca486b59e1489c0 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /library/theories/analysis/ivt.lean | 24d8890ee5139d6292eae99f75039be27229d021 | [
"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 | 9,678 | lean | /-
Copyright (c) 2015 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
The intermediate value theorem.
-/
import .real_limit
open real analysis set classical
noncomputable theory
private definition inter_sup (a b : ℝ) (f : ℝ → ℝ) := sup... |
cc8edd17e5744fcde05ed76f2ba19771a844d42c | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/analysis/normed_space/weak_dual.lean | 2ead0b9970dee7fe57ac94ae903be0c7c05b115b | [
"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 | 10,123 | lean | /-
Copyright (c) 2021 Kalle Kytölä. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kalle Kytölä, Yury Kudryashov
-/
import topology.algebra.module.weak_dual
import analysis.normed_space.dual
import analysis.normed_space.operator_norm
/-!
# Weak dual of normed space
>... |
0f5d13d63333101e685ef6c44011e290da0625dc | 6f1049e897f569e5c47237de40321e62f0181948 | /src/solutions/02_iff_if_and.lean | 8cfa7016097a1179170b0c460e43153deed1d8ce | [
"Apache-2.0"
] | permissive | anrddh/tutorials | f654a0807b9523608544836d9a81939f8e1dceb8 | 3ba43804e7b632201c494cdaa8da5406f1a255f9 | refs/heads/master | 1,655,542,921,827 | 1,588,846,595,000 | 1,588,846,595,000 | 262,330,134 | 0 | 0 | null | 1,588,944,346,000 | 1,588,944,345,000 | null | UTF-8 | Lean | false | false | 15,247 | lean | import data.real.basic
/-
In the previous file, we saw how to rewrite using equalities.
The analogue operation with mathematical statements is rewriting using
equivalences. This is also done using the rw tactic.
Lean uses ↔ to denote equivalence instead of ⇔.
In the following exercises we will use the lemma:
sub_... |
beca44ecd4b69b18f3d651e3345ddfa2d1ee8e89 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /test/squeeze.lean | 2b0c7439bca529c9e0b08295de43b7f3a75ad0f4 | [
"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 | 1,356 | lean | import data.nat.basic
import tactic.squeeze
import data.list.perm
namespace tactic
namespace interactive
setup_tactic_parser
/-- version of squeeze_simp that tests whether the output matches the expected output -/
meta def squeeze_simp_test
(key : parse cur_pos)
(slow_and_accurate : parse (tk "?")?)
(use_iota_e... |
c5b1cf6eae48f33636539b0365f0a7f76763e17c | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/topology/algebra/matrix.lean | 6e77aaf3c2f7feaca4da88299644900ccbbf1925 | [
"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 | 1,395 | 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 linear_algebra.determinant
import topology.algebra.ring
/-!
# Topological properties of matrices
This file is a place to collect topological results about matrices... |
97360953cc6f29fd6aa85affe0ed995906feb0b8 | 0003047346476c031128723dfd16fe273c6bc605 | /src/ring_theory/noetherian.lean | 896d0b61a5977b3dac7563f3091b195e8f8f3a93 | [
"Apache-2.0"
] | permissive | ChandanKSingh/mathlib | d2bf4724ccc670bf24915c12c475748281d3fb73 | d60d1616958787ccb9842dc943534f90ea0bab64 | refs/heads/master | 1,588,238,823,679 | 1,552,867,469,000 | 1,552,867,469,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 19,042 | lean | /-
Copyright (c) 2018 Mario Carneiro and Kevin Buzzard. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Kevin Buzzard
-/
import data.equiv.algebra
import linear_algebra.linear_combination
import ring_theory.ideal_operations
import ring_theory.subring
o... |
f5213ee3154e9e92789165919e8b8c5f175e656d | 022547453607c6244552158ff25ab3bf17361760 | /src/measure_theory/conditional_expectation.lean | 9f97703e07d6898d9b9390507a54e59c31631a7b | [
"Apache-2.0"
] | permissive | 1293045656/mathlib | 5f81741a7c1ff1873440ec680b3680bfb6b7b048 | 4709e61525a60189733e72a50e564c58d534bed8 | refs/heads/master | 1,687,010,200,553 | 1,626,245,646,000 | 1,626,245,646,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 11,679 | lean | /-
Copyright (c) 2021 Rémy Degenne. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Rémy Degenne
-/
import measure_theory.lp_space
/-! # Conditional expectation
The conditional expectation will be defined for functions in `L²` by an orthogonal projection into
a compl... |
b1c87b75d9031ada16552ce2213a5310dc0b54d1 | be853a09b5de8ba4d9114bd8a816647b584d4573 | /src/submissions/practice_1.lean | efdfae30be04ea58ef5656b237cc961a6e9ee552 | [] | no_license | sgoldberg02/cs2120f21mycopy | 4a665a92c5dcbb5b35be5461c42268c74366e3fa | 216fa0a813508d82594ac95aec0a048249f81291 | refs/heads/main | 1,692,136,103,389 | 1,632,328,880,000 | 1,632,328,880,000 | 405,192,256 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,149 | lean | /-
clarksters
seg8st; https://github.com/sgoldberg02/cs2120f21mycopy.git (should end with .git).
-/
/-
EQUALITY
-/
/- #1
Suppose that x, y, z, and w are arbitrary objects of some type,
T; and suppose further that we know (have proofs of the facts)
that x = y, y = z, and w = z. Give a very, very short English
pro... |
c73d1c52f096e2d3fa7e3d8d1e043eb25f9f3b83 | 3dd1b66af77106badae6edb1c4dea91a146ead30 | /tests/lean/run/ptst.lean | d5a427de3e471e2bb6b7fc7cc5f1514826a8bba1 | [
"Apache-2.0"
] | permissive | silky/lean | 79c20c15c93feef47bb659a2cc139b26f3614642 | df8b88dca2f8da1a422cb618cd476ef5be730546 | refs/heads/master | 1,610,737,587,697 | 1,406,574,534,000 | 1,406,574,534,000 | 22,362,176 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 77 | lean | import standard
using pair
-- Test tuple notation
check (3, false, 1, true)
|
b4a53229a336a9d0dc4501186351269fd0ca5336 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/algebra/group_with_zero/basic.lean | ef24342117679cf7efe18ec30265e1ab0671fed2 | [
"Apache-2.0"
] | permissive | ramonfmir/mathlib | c5dc8b33155473fab97c38bd3aa6723dc289beaa | 14c52e990c17f5a00c0cc9e09847af16fabbed25 | refs/heads/master | 1,661,979,343,526 | 1,660,830,384,000 | 1,660,830,384,000 | 182,072,989 | 0 | 0 | null | 1,555,585,876,000 | 1,555,585,876,000 | null | UTF-8 | Lean | false | false | 42,801 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import algebra.group.inj_surj
import algebra.group_with_zero.defs
import algebra.hom.units
import logic.nontrivial
import group_theory.group_action.units
/-!
# Group... |
2f8405596fdac15ca06be12536baacb6b97d3421 | 8f67b34bba98f894155dedf263bc8d61c31e89cd | /2ltt/types/prod.lean | 278d3f50e99881910d783b666804cfc373e256d2 | [] | no_license | 5HT/two-level | 3b1523db242cba819681b862fbc8f490d9571a66 | 370f5a91311db3b463b10a31891370721e2476e2 | refs/heads/master | 1,648,254,367,420 | 1,576,269,550,000 | 1,576,269,550,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,702 | lean | import ..fibrant
open prod prod.ops
open fib_eq
/- Ported from the Lean HoTT library, trying to keep as close as possible
to the original implementation.
Changes while porting: change equality notation (from "=" to "~"),
replace usages of "reflexivity" with "simp" tactic.
The "simp" tactic allows to apply... |
f2de8957da2de91cc387a182c2d6d966c9994704 | 5ee26964f602030578ef0159d46145dd2e357ba5 | /src/for_mathlib/topological_rings.lean | 8236af606374a7672c77afb4366e1166a114ea0c | [
"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 | 4,472 | lean | import topology.algebra.ring
import ring_theory.subring
import ring_theory.ideal_operations
import for_mathlib.nonarchimedean.open_subgroup
universes u v
variables {A : Type u} {B : Type v}
variables [comm_ring A] [topological_space A] [topological_ring A]
variables [comm_ring B] [topological_space B] [topological_r... |
3f8b26c816e5f1ae2f5a51f59c149ec786730c77 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/t10.lean | 568ebc8ea9c1ba56cdbe11f7089c47817c36097d | [
"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 | 598 | lean | prelude constant N : Type.{1}
definition B : Type.{1} := Type.{0}
constant ite : B → N → N → N
constant and : B → B → B
constant f : N → N
constant p : B
constant q : B
constant x : N
constant y : N
constant z : N
infixr ` ∧ `:25 := and
notation `if` c `then` t:45 `else` e:45 := ite c t e
#check if p ∧ q then f x else ... |
d7853a2bea2216d4b62c2c4c6757dc1f20b6a7b7 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/ring_theory/adjoin/power_basis.lean | ad351319b24b0d56f30adc7c790cb5761ef077dd | [
"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 | 7,877 | 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 ring_theory.adjoin.basic
import ring_theory.power_basis
import linear_algebra.matrix.basis
/-!
# Power basis for `algebra.adjoin R {x}`
This file defines the cano... |
6c71eb1bed3a089af35fd8af6c76c77c77f85466 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/task_test2.lean | 7a20f5640185d6261061b5fa1da3ac2dd85146c4 | [
"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 | 397 | lean | --
def run1 (i : Nat) (n : Nat) (xs : List Nat) : Nat :=
n.repeat (fun r =>
dbg_trace ">> [{i}] {r}";
xs.foldl (fun a b => a + b) r)
0
def tst (n : Nat) : IO UInt32 :=
let ys := (List.replicate n 1);
let ts : List (Task Nat) := (List.iota 10).map (fun i => Task.spawn fun _ => run1 (i+1) n ys);
let ns : List Nat :... |
05695420a1b17bf7ed88d87b4cf3c9b97d63b506 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/topology/subset_properties.lean | 6459a516b6ab0fd6730f05a966232849df556865 | [
"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 | 89,129 | 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, Yury Kudryashov
-/
import order.filter.pi
import topology.bases
import data.finset.order
import data.set.accumulate
import topology.bornology.basic
impo... |
1ecdf3beeaadca12768d196cb738c0befcec15c8 | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /08_Building_Theories_and_Proofs.org.5.lean | 3abd3a2182b9fe4396a16f1dcd605b000b3bc52e | [] | 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 | 455 | lean | import standard
structure Semigroup : Type :=
(carrier : Type)
(mul : carrier → carrier → carrier)
(mul_assoc : ∀ a b c : carrier, mul (mul a b) c = mul a (mul b c))
notation a `*` b := Semigroup.mul _ a b
attribute Semigroup.carrier [coercion]
structure morphism (S1 S2 : Semigroup) : Type :=
(mor : S1 → S2)
(resp_m... |
9a569f5f1e5b966acf1703248b074a6ae7c92c95 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/derivingHashable.lean | 9ba021b2da752af5cc543417d159dcb4a66c24c7 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 1,030 | lean | structure Foo where
name : String
val : List Nat
lower : Nat := List.length val
inv : val.length >= lower
flag : Bool
deriving Hashable
#eval hash <| { name := "Joe", val := List.iota 40, flag := true, inv := by decide : Foo }
inductive Tree (α : Type) where
| node : List (Tree α) → Bool → Tree α
... |
76b0a3ca50556d25f13c1b6d1ddf21495f35358d | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /tests/lean/run/class3.lean | 0df83aadcb4ccfdcb251047d94ef8b960bbb092d | [
"Apache-2.0"
] | permissive | chubbymaggie/lean | 0d06ae25f9dd396306fb02190e89422ea94afd7b | d2c7b5c31928c98f545b16420d37842c43b4ae9a | refs/heads/master | 1,611,313,622,901 | 1,430,266,839,000 | 1,430,267,083,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 260 | lean | import logic data.prod
open prod inhabited
section
variable {A : Type}
variable {B : Type}
variable Ha : inhabited A
variable Hb : inhabited B
include Ha Hb
theorem tst : inhabited (Prop × A × B)
end
(*
print(get_env():find("tst"):value())
*)
|
8fc9980eb52d24f3f8ab10c7ca1442a0ce0e30f8 | 4376c25f060c13471bb89cdb12aeac1d53e53876 | /src/espaces-metriques/custom/bolzano_weierstrass.lean | 7e234b7b5405eb696f0951b20b1d85da095462a1 | [
"MIT"
] | permissive | RaitoBezarius/projet-maths-lean | 8fa7df563d64c256561ab71893c523fc1424b85c | 42356e980e021a20c3468f5ca1639fec01bb934f | refs/heads/master | 1,613,002,128,339 | 1,589,289,282,000 | 1,589,289,282,000 | 244,431,534 | 0 | 1 | MIT | 1,584,312,574,000 | 1,583,169,883,000 | TeX | UTF-8 | Lean | false | false | 4,880 | lean | import tactic
import data.set
import order.conditionally_complete_lattice
import .sequences
import .si_sequence
import .topology
import .sups
noncomputable theory
open_locale classical
section bw
variables {X: Type} [espace_metrique X] [conditionally_complete_linear_order X]
open espace_metrique
open set
/-- FIXME... |
5eb329c5201e631ebecc8c293509c9ebeb67ebe7 | 14d3c04048fcbea3818a26103a6e4f1c99fc6c62 | /src/lemmas.lean | cd009cca539d5d3ebe20dd212be952ad991de7cc | [] | no_license | gihanmarasingha/myint | 866a880ae7ade3de7d1e8550e6d2c4be94f1b85f | eba85880a500a7977cc4e23c9fa51877dfc82b58 | refs/heads/master | 1,682,793,960,074 | 1,619,541,459,000 | 1,619,541,459,000 | 360,702,700 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,776 | lean | import basic
import group_theory.order_of_element
namespace myint
lemma add_pair_eq {a b : ℕ × ℕ} : ⟦a⟧ + ⟦b⟧ = add_pair a b := rfl
/-
`quotient.ind` gives the correspondence between elements of a quotient type and equivalence classes
of the underlying type. It states that to prove `β q` for every `q` in a quotient ... |
ff8df9c8c57358e646cccaf60f543c3ff918e37f | 798dd332c1ad790518589a09bc82459fb12e5156 | /tactic/linarith.lean | 4ea3814a5aa99b2b0c3d4f80ee4970879ef513b4 | [
"Apache-2.0"
] | permissive | tobiasgrosser/mathlib | b040b7eb42d5942206149371cf92c61404de3c31 | 120635628368ec261e031cefc6d30e0304088b03 | refs/heads/master | 1,644,803,442,937 | 1,536,663,752,000 | 1,536,663,907,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 24,020 | lean | /-
Copyright (c) 2018 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Robert Y. Lewis
A tactic for discharging linear arithmetic goals using Fourier-Motzkin elimination.
`linarith` is (in principle) complete for ℚ and ℝ. It is not complete for n... |
9a1c900397c59e979dc95a75ca737b16d3489d8f | 98e19516c8c6ccdcd3b092955d47773a0aaabf7b | /test/bench/lean/deriv.lean | 93b281c55296251b6b4a8cefa6f3cf02e4a636df | [
"Apache-2.0"
] | permissive | koka-lang/koka | d31daf7d06b28ea7b1fc8084cc76cdf5459610b6 | b3122869ac74bfb6f432f7e76eeb723b1f69a491 | refs/heads/master | 1,693,461,288,476 | 1,688,408,308,000 | 1,688,408,308,000 | 75,982,258 | 2,806 | 154 | NOASSERTION | 1,689,870,454,000 | 1,481,238,037,000 | Haskell | UTF-8 | Lean | false | false | 2,838 | lean | /- Benchmark for new code generator -/
inductive Expr
| Val : Int → Expr
| Var : String → Expr
| Add : Expr → Expr → Expr
| Mul : Expr → Expr → Expr
| Pow : Expr → Expr → Expr
| Ln : Expr → Expr
open Expr
partial def pown : Int → Int → Int
| a, 0 => 1
| a, 1 => a
| a, n =>
let b := pown a (n / 2);
b * b * (if n ... |
77d3807cd5498d8a838b5a8b8cbfd0d26206c0b9 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /library/init/algebra/group.lean | 9c79b5357406ae1947b15120aacc55c153f7e6af | [
"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 | 16,217 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura
-/
prelude
import init.logic init.algebra.classes init.meta init.meta.decl_cmds init.meta.smt.rsimp
/- Make sure instances defined in this file... |
e497aa32e8da603221dda414bfed994f6464e14d | 2db1ce6c94a38d8841bb6750a4f6bdc89543179b | /lean/love01_definitions_and_lemma_statements_demo.lean | 54a3c50d23499b4e739e8cbf9c8d52eee40a1b80 | [] | no_license | robertylewis/logical_verification_2019 | 4ab72673234c7d74c21cf2e185714d96e09f633d | 7c5f1c90f6e5a0b221a02c8fa4e36c0c66393036 | refs/heads/master | 1,647,940,325,589 | 1,576,503,096,000 | 1,576,503,096,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,486 | lean | /- LoVe Demo 1: Definitions and Lemma Statements -/
import .lovelib
namespace LoVe
/- Types and Terms -/
#check ℕ
#check ℤ
#check empty
#check unit
#check bool
#check ℕ → ℤ
#check ℤ → ℕ
#check bool → ℕ → ℤ
#check (bool → ℕ) → ℤ
#check ℕ → (bool → ℕ) → ℤ
#check λx : ℕ, x
#check λf : ℕ → ℕ, λg : ℕ → ℕ, λh : ℕ → ℕ... |
8eb5b2e98a0c0be8399ef21f6e601a8fc99c5580 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebraic_geometry/structure_sheaf.lean | efbf261969500ad94b503500b2e4c90bfdaedfa7 | [
"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 | 48,819 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Scott Morrison
-/
import algebraic_geometry.prime_spectrum.basic
import algebra.category.Ring.colimits
import algebra.category.Ring.limits
import topology.sheaves.local... |
f31176b5761140c32d3f9563c563ff71fdde695c | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/csimpAttrFn.lean | 382d4145ce5926e1af4081c7426ec8f95f57a229 | [
"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 | 293 | lean | import Lean
open Lean
open Lean.Compiler
#eval (do assert! hasCSimpAttribute (← getEnv) ``List.map_eq_mapTR : MetaM Unit)
#eval (do assert! hasCSimpAttribute (← getEnv) ``List.append_eq_appendTR : MetaM Unit)
#eval (do assert! !hasCSimpAttribute (← getEnv) ``List.append : MetaM Unit)
|
d8cbce7ed514abc985b8dae59abe25b15edb591d | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/analysis/normed_space/spectrum.lean | 94bd2176e3f54e37cfa59b2266c810998e57df6c | [
"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,642 | lean | /-
Copyright (c) 2021 Jireh Loreaux. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jireh Loreaux
-/
import algebra.algebra.spectrum
import analysis.calculus.deriv
import analysis.special_functions.pow
/-!
# The spectrum of elements in a complete normed algebra
This f... |
a92aad126b7f16e8b937a4df8e4b3f16b403f499 | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /tests/lean/run/termParserAttr.lean | 5fb6780a2d51889ca193820d864cea0237fbcd85 | [
"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 | 2,120 | lean | import Lean
open Lean
open Lean.Elab
def runCore (input : String) (failIff : Bool := true) : CoreM Unit := do
let env ← getEnv;
let opts ← getOptions;
let (env, messages) ← process input env opts;
messages.toList.forM fun msg => do IO.println (← msg.toString)
when (failIff && messages.hasErrors) $ throwError "errors... |
f5decb0db3f7e2b719d55a21a2305980477e5b47 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Linter.lean | 7939686c32b642c08a0e4af64cf543133f0ab8b1 | [
"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 | 147 | lean | import Lean.Linter.Util
import Lean.Linter.Builtin
import Lean.Linter.Deprecated
import Lean.Linter.UnusedVariables
import Lean.Linter.MissingDocs
|
a13439a9c6874c89109f4348eda4b4adbe106244 | b074a51e20fdb737b2d4c635dd292fc54685e010 | /src/algebra/group_power.lean | 7afa5e5c8710ad143fc35808673fe30ff46ad8ab | [
"Apache-2.0"
] | permissive | minchaowu/mathlib | 2daf6ffdb5a56eeca403e894af88bcaaf65aec5e | 879da1cf04c2baa9eaa7bd2472100bc0335e5c73 | refs/heads/master | 1,609,628,676,768 | 1,564,310,105,000 | 1,564,310,105,000 | 99,461,307 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 27,380 | 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... |
bda5e0850253d3724846fc4bbcab2caf632fdbc5 | 9b9a16fa2cb737daee6b2785474678b6fa91d6d4 | /src/data/set/lattice.lean | 5aa6f7af7c38d2f578dec9cf23fc11da7d23a6a8 | [
"Apache-2.0"
] | permissive | johoelzl/mathlib | 253f46daa30b644d011e8e119025b01ad69735c4 | 592e3c7a2dfbd5826919b4605559d35d4d75938f | refs/heads/master | 1,625,657,216,488 | 1,551,374,946,000 | 1,551,374,946,000 | 98,915,829 | 0 | 0 | Apache-2.0 | 1,522,917,267,000 | 1,501,524,499,000 | Lean | UTF-8 | Lean | false | false | 29,237 | 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, Johannes Hölzl, Mario Carneiro
-- QUESTION: can make the first argument in ∀ x ∈ a, ... implicit?
-/
import logic.basic data.set.basic data.equiv.basic... |
5e0c3e395cb38922e899ffa5df1b20e70ece28c6 | 0f5090f82d527e0df5bf3adac9f9e2e1d81d71e2 | /src/apurva/complex_transpose.lean | 9d01b4c9a47fe6d09c77be1c901440c08243cfbf | [] | no_license | apurvanakade/mc2020-lean-projects | 36eb42c4baccc37183635c36f8e1b3afa4ec1230 | 02466225aa629ab1232043bcc0a053a099fdb939 | refs/heads/master | 1,688,791,717,534 | 1,597,874,092,000 | 1,597,874,092,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,572 | lean | import data.complex.basic
import data.fintype.basic
import data.matrix.basic
import linear_algebra.determinant
import linear_algebra.nonsingular_inverse
import tactic
noncomputable theory
open_locale classical
open_locale matrix
open_locale big_operators
universes u u'
variables {m n l : Type u} [fintype m] [fint... |
3489bf462fe411166ef4e96c3a6bbc073180cb49 | f3849be5d845a1cb97680f0bbbe03b85518312f0 | /library/data/hash_map.lean | 0af977de46b9d89ae53828d48638e068b65bc109 | [
"Apache-2.0"
] | permissive | bjoeris/lean | 0ed95125d762b17bfcb54dad1f9721f953f92eeb | 4e496b78d5e73545fa4f9a807155113d8e6b0561 | refs/heads/master | 1,611,251,218,281 | 1,495,337,658,000 | 1,495,337,658,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 35,332 | 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, Mario Carneiro
-/
import data.list.set data.list.comb init.data.array
universes u v w
def pnat := {n : ℕ // n > 0}
notation `ℕ+` := pnat
def bucket_array (... |
d3c507b8b15d362b3ee584a2a7e3d4e40aa949ff | 0845ae2ca02071debcfd4ac24be871236c01784f | /tests/compiler/partial.lean | 9ccaa060176a4fabb06a80d8f8f85dccf1ee8832 | [
"Apache-2.0"
] | permissive | GaloisInc/lean4 | 74c267eb0e900bfaa23df8de86039483ecbd60b7 | 228ddd5fdcd98dd4e9c009f425284e86917938aa | refs/heads/master | 1,643,131,356,301 | 1,562,715,572,000 | 1,562,715,572,000 | 192,390,898 | 0 | 0 | null | 1,560,792,750,000 | 1,560,792,749,000 | null | UTF-8 | Lean | false | false | 373 | lean | set_option pp.implicit true
set_option pp.binder_types false
-- set_option trace.compiler.boxed true
partial def contains : String → Char → Nat → Bool
| s c i :=
if s.atEnd i then false
else if s.get i == c then true
else contains s c (s.next i)
def main : IO Unit :=
let s1 := "hello" in
IO.println (contai... |
b869e71954cf2359a4c81d757d13365bb82a9e36 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/meta/set_get_option_tactics.lean | 9751b4cc9f83b95368e3e964941d2bc442a786d2 | [] | 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 | 269 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.meta.tactic
namespace Mathlib
namespace tactic
|
1e284179fba7f2e9cc965298a180c7d5c14745f6 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/analysis/normed_space/enorm.lean | 95659864bf009d780ad30277db7a75259553f56e | [
"Apache-2.0"
] | permissive | Lix0120/mathlib | 0020745240315ed0e517cbf32e738d8f9811dd80 | e14c37827456fc6707f31b4d1d16f1f3a3205e91 | refs/heads/master | 1,673,102,855,024 | 1,604,151,044,000 | 1,604,151,044,000 | 308,930,245 | 0 | 0 | Apache-2.0 | 1,604,164,710,000 | 1,604,163,547,000 | null | UTF-8 | Lean | false | false | 7,639 | 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 analysis.normed_space.basic
/-!
# Extended norm
In this file we define a structure `enorm 𝕜 V` representing an extended norm (i.e., a norm that can
t... |
4dff0c9f299eaaa96f6502566f3e9333e991dda0 | c3f2fcd060adfa2ca29f924839d2d925e8f2c685 | /tests/lean/run/group.lean | 3c4dc3b9f8f9fb6c6d0dc39bbf7dd8c9ce289205 | [
"Apache-2.0"
] | permissive | respu/lean | 6582d19a2f2838a28ecd2b3c6f81c32d07b5341d | 8c76419c60b63d0d9f7bc04ebb0b99812d0ec654 | refs/heads/master | 1,610,882,451,231 | 1,427,747,084,000 | 1,427,747,429,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,080 | lean | import logic
context
variable {A : Type}
variable f : A → A → A
variable one : A
variable inv : A → A
infixl `*` := f
postfix `^-1`:100 := inv
definition is_assoc := ∀ a b c, (a*b)*c = a*b*c
definition is_id := ∀ a, a*one = a
definition is_inv := ∀ a, a*a^-1 = one
end
inductive group_struc... |
c367ffc6be4c434cd5baff6e604bf077d075b064 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/analysis/normed/group/SemiNormedGroup/completion.lean | 8ffe9b3cff21ed597866e4630be35765eb912f35 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 4,622 | lean | /-
Copyright (c) 2021 Riccardo Brasca. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Riccardo Brasca, Johan Commelin
-/
import analysis.normed.group.SemiNormedGroup
import category_theory.preadditive.additive_functor
import analysis.normed.group.hom_completion
/-!
# ... |
77347a81ba53801ba052b1b2feed749c68dd2119 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/bench/liasolver.lean | f77f8e2f3a08af483dd42882c0b5ddcaa892f1ec | [
"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 | 13,493 | lean | /-
Linear Diophantine equation solver
Author: Marc Huisinga
-/
import Lean.Data.HashMap
open Lean
namespace Int
def roundedDiv (a b : Int) : Int := Id.run <| do
let mut div := a / b
let sgn := if a ≥ 0 ∧ b ≥ 0 ∨ a < 0 ∧ b < 0 then 1 else -1
let rest := (a % b).natAbs
if 2*rest ≥ b.natAbs then
... |
2120b8fa6653a3f896a6448637b87f400e166534 | 2eab05920d6eeb06665e1a6df77b3157354316ad | /src/number_theory/padics/padic_integers.lean | c6e081014b7ab534fe8d701cfd88ad4f908de23d | [
"Apache-2.0"
] | permissive | ayush1801/mathlib | 78949b9f789f488148142221606bf15c02b960d2 | ce164e28f262acbb3de6281b3b03660a9f744e3c | refs/heads/master | 1,692,886,907,941 | 1,635,270,866,000 | 1,635,270,866,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 20,846 | 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, Mario Carneiro, Johan Commelin
-/
import data.int.modeq
import data.zmod.basic
import number_theory.padics.padic_numbers
import ring_theory.discrete_valuation_ring
im... |
a789a3cc54f270bcd7ab0aa62708ec6c60824a4f | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/tactic/lean_core_docs.lean | 3003ff3d0fc684f040ca7aad62b4447c6ef8ae63 | [
"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 | 25,119 | lean | /-
Copyright (c) 2020 Kevin Buzzard. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Buzzard, Bryan Gin-ge Chen, Robert Y. Lewis, Scott Morrison
-/
import tactic.doc_commands
/-!
# Core tactic documentation
This file adds the majority of the interactive tactics... |
ef2ca000e733b25f31f2086ba0b9e6df895787c8 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/limits/shapes/kernel_pair_auto.lean | dc09aeff0427b53e846a993fe149984efbe13ca4 | [] | 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,123 | lean | /-
Copyright (c) 2020 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.category_theory.limits.shapes.equalizers
import Mathlib.category_theory.limits.shapes.pullbacks... |
f43d382f4537a896778cffe8519dd2440d9f6d7a | 3863d2564418bccb1859e057bf5a4ef240e75fd7 | /hott/homotopy/homotopy_group.hlean | 785ad87c1535918d7ba63eb6b1ad56af22cb7609 | [
"Apache-2.0"
] | permissive | JacobGross/lean | 118bbb067ff4d4af48a266face2c7eb9868fa91c | eb26087df940c54337cb807b4bc6d345d1fc1085 | refs/heads/master | 1,582,735,011,532 | 1,462,557,826,000 | 1,462,557,826,000 | 46,451,196 | 0 | 0 | null | 1,462,557,826,000 | 1,447,885,161,000 | C++ | UTF-8 | Lean | false | false | 1,653 | hlean | /-
Copyright (c) 2016 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Clive Newstead
-/
import algebra.homotopy_group .sphere
open eq is_trunc trunc_index pointed algebra trunc nat is_conn fiber pointed
namespace is_trunc
-- Lem... |
523fdb859174663f74fe373ca73b11a08d050398 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/nat/fib.lean | 84c70569b74560fe0fddf03545093cfa9082443d | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 13,004 | lean | /-
Copyright (c) 2019 Kevin Kappelmann. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Kappelmann, Kyle Miller, Mario Carneiro
-/
import data.nat.gcd.basic
import logic.function.iterate
import data.finset.nat_antidiagonal
import algebra.big_operators.basic
import... |
1f69e5f07b88fc331380c790ffeb2c1bb66bcb56 | a46270e2f76a375564f3b3e9c1bf7b635edc1f2c | /7.7.lean | a81b495d80a10b2821ae0e5cca3150d998ba9aa6 | [
"CC0-1.0"
] | permissive | wudcscheme/lean-exercise | 88ea2506714eac343de2a294d1132ee8ee6d3a20 | 5b23b9be3d361fff5e981d5be3a0a1175504b9f6 | refs/heads/master | 1,678,958,930,293 | 1,583,197,205,000 | 1,583,197,205,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 589 | lean | namespace hidden
universe u
inductive eq {α : Type u} (a : α) : α → Prop
| refl : eq a
@[elab_as_eliminator]
theorem subst {α : Type u} {a b : α} {P : α → Prop}
(h₁ : eq a b) (h₂ : P a) : P b :=
eq.rec h₂ h₁
-- BEGIN
theorem symm {α : Type u} {a b : α} (h : eq a b) : eq b a :=
subst h (eq.refl a)
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.