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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
ed0186bf058bc3c8f43dedffa59e2f899f06eae3 | 7e0b0db472eb1736cfdcb1b51631a2746604458e | /src/solutions/thursday/afternoon/category_theory/exercise11.lean | 3b18bc01a8eb9e8696287bc5a10c9ebead3c8278 | [] | permissive | fewcount/lftcm2020 | a6cd0b32637ac358477dd356ec18dc6a646926fd | 261084035d59ad6b465cbefb75b69c7a65a22a37 | refs/heads/master | 1,668,866,317,542 | 1,594,705,721,000 | 1,594,705,721,000 | 279,494,907 | 0 | 0 | MIT | 1,594,705,859,000 | 1,594,705,858,000 | null | UTF-8 | Lean | false | false | 4,308 | lean | import algebra.category.CommRing
import category_theory.yoneda
open category_theory
open opposite
open polynomial
noncomputable theory
/-!
# Exercise 1
We show that the forgetful functor `CommRing ⥤ Type` is (co?)representable.
There are a sequence of hints available in
`hints/thursday/afternoon/category_theory/hi... |
50f32503c82a994866b8d319f7e461c4fd4ba400 | 26ac254ecb57ffcb886ff709cf018390161a9225 | /test/pi_simp.lean | ca5b9688ddfbeb97991313c3c3f731acd4c9471b | [
"Apache-2.0"
] | permissive | eric-wieser/mathlib | 42842584f584359bbe1fc8b88b3ff937c8acd72d | d0df6b81cd0920ad569158c06a3fd5abb9e63301 | refs/heads/master | 1,669,546,404,255 | 1,595,254,668,000 | 1,595,254,668,000 | 281,173,504 | 0 | 0 | Apache-2.0 | 1,595,263,582,000 | 1,595,263,581,000 | null | UTF-8 | Lean | false | false | 652 | 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 algebra.pi_instances
/-!
Test if `simp` can use a lemma about `pi.has_one` to simplify `1` coming from `pi.group`
-/
variables {I : Type*} {f : Π i : ... |
7031109bba706ad0adf52933fd898ea40f07a015 | 87fd6b43d22688237c02b87c30d2a524f53bab24 | /src/kb_defs.lean | bec99901e0ccb44ee9c8419dd5e75f648665c0a9 | [
"Apache-2.0"
] | permissive | grthomson/real-number-game | 66142fedf0987db90f66daed52f9c8b42b70f909 | 8ddc15fdddc241c246653f7bb341df36e4e880a8 | refs/heads/master | 1,668,059,330,605 | 1,592,873,454,000 | 1,592,873,454,000 | 262,025,764 | 0 | 0 | null | 1,588,849,107,000 | 1,588,849,106,000 | null | UTF-8 | Lean | false | false | 1,176 | lean | import tactic
open_locale classical
open set
namespace xena
variables {X : Type} (a : X) {x : X} {A B : set X}
/-- Humans want these in levels 1-6 -/
lemma mem_union_iff : x ∈ A ∪ B ↔ x ∈ A ∨ x ∈ B := iff.rfl
lemma mem_inter_iff : x ∈ A ∩ B ↔ x ∈ A ∧ x ∈ B := iff.rfl
lemma mem_sdiff_iff : x ∈ A \ B ↔ x ∈ A ∧ x ∉ ... |
2fbd75428b78453c0043e3baa87d6c86faba16f7 | 947b78d97130d56365ae2ec264df196ce769371a | /src/Lean/Meta/GeneralizeTelescope.lean | 79eecf72fee512e1777700435122ff68d8dabdf9 | [
"Apache-2.0"
] | permissive | shyamalschandra/lean4 | 27044812be8698f0c79147615b1d5090b9f4b037 | 6e7a883b21eaf62831e8111b251dc9b18f40e604 | refs/heads/master | 1,671,417,126,371 | 1,601,859,995,000 | 1,601,860,020,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,099 | 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.KAbstract
namespace Lean
namespace Meta
namespace GeneralizeTelescope
structure Entry :=
(expr : Expr)
(type : Expr)
(modified : ... |
410baa6aed38fc3255c3b948d095d03448b1869e | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/2137.lean | b039eb5ea55ab1c329a04c3f2417ee0770044614 | [
"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 | 348 | lean | def makeProc : IO Unit := do
let child ← IO.Process.spawn {
cmd := "cat"
args := #[]
stdin := .piped
stdout := .piped
}
IO.print (← child.stdout.getLine)
def main (_ : List String) : IO UInt32 := do
IO.println "test"
makeProc
IO.println "done test"
for _ in [0:6] do
let _ ← IO.asTask... |
289b74cf800bc5610e40814cc8eefb719f860e3e | 2eab05920d6eeb06665e1a6df77b3157354316ad | /src/measure_theory/measure/lebesgue.lean | faacb74b3531d036764504e5025403d86bb73fba | [
"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 | 25,585 | 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, Yury Kudryashov
-/
import measure_theory.constructions.pi
import measure_theory.measure.stieltjes
import linear_algebra.matrix.transvection
import dynamics.ergodic.meas... |
b132c43878c269c9d35a95b2d9366cff805355bd | 9dd3f3912f7321eb58ee9aa8f21778ad6221f87c | /tests/lean/run/eval_expr_bug.lean | f58f437bf1b6315963a22c088b95d2d063e146b3 | [
"Apache-2.0"
] | permissive | bre7k30/lean | de893411bcfa7b3c5572e61b9e1c52951b310aa4 | 5a924699d076dab1bd5af23a8f910b433e598d7a | refs/heads/master | 1,610,900,145,817 | 1,488,006,845,000 | 1,488,006,845,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 137 | lean | open tactic
meta def a : nat := 10
run_command eval_expr nat (expr.const `a [])
run_command eval_expr nat (expr.const `a []) >>= trace
|
c3d0336f48f8880255ce136e039c5991c1840e67 | b70447c014d9e71cf619ebc9f539b262c19c2e0b | /hott/homotopy/susp.hlean | 43c873417819bbd6482e92cec3f9563a08961127 | [
"Apache-2.0"
] | permissive | ia0/lean2 | c20d8da69657f94b1d161f9590a4c635f8dc87f3 | d86284da630acb78fa5dc3b0b106153c50ffccd0 | refs/heads/master | 1,611,399,322,751 | 1,495,751,007,000 | 1,495,751,007,000 | 93,104,167 | 0 | 0 | null | 1,496,355,488,000 | 1,496,355,487,000 | null | UTF-8 | Lean | false | false | 14,443 | 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, Ulrik Buchholtz
Declaration of suspension
-/
import hit.pushout types.pointed cubical.square .connectedness
open pushout unit eq equiv
definition susp (A : Type... |
6f2fb02400b9679b0e596c4d2353a5bd509ae5e0 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebra/support.lean | 50df76d4b2a44c8d05efa03e150d0bcd91c85380 | [
"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 | 12,810 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import order.conditionally_complete_lattice
import algebra.big_operators.basic
import algebra.group.prod
import algebra.group.pi
import algebra.module.pi
/-!
# Sup... |
d113770e580fffbb50976a69acb6f9bd9ff047ea | a4673261e60b025e2c8c825dfa4ab9108246c32e | /src/Lean/Compiler/InlineAttrs.lean | 2aa7404b2d6fd39244d8b01dbf461f8fd195c17c | [
"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 | 2,646 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Attributes
import Lean.Compiler.Util
namespace Lean.Compiler
inductive InlineAttributeKind :=
| inline | noinline | macroInline | inlineIfRe... |
5d46bd74e4b5d21cd63fa735fc48ac85d624c1cd | f3a5af2927397cf346ec0e24312bfff077f00425 | /src/game/world8/level12.lean | a9f0c5ebf5f77ec732d44ec1c7f0a081d0e4bcf6 | [
"Apache-2.0"
] | permissive | ImperialCollegeLondon/natural_number_game | 05c39e1586408cfb563d1a12e1085a90726ab655 | f29b6c2884299fc63fdfc81ae5d7daaa3219f9fd | refs/heads/master | 1,688,570,964,990 | 1,636,908,242,000 | 1,636,908,242,000 | 195,403,790 | 277 | 84 | Apache-2.0 | 1,694,547,955,000 | 1,562,328,792,000 | Lean | UTF-8 | Lean | false | false | 455 | lean | import game.world8.level11 -- hide
namespace mynat -- hide
/-
# Advanced Addition World
## Level 12: `add_one_eq_succ`
We have
* `succ_eq_add_one (n : mynat) : succ n = n + 1`
but sometimes the other way is also convenient.
-/
/- Theorem
For any natural number $d$, we have
$$ d+1 = \operatorname{succ}(d). $$
-... |
70e401299758fa67bdcef058da0d266a29b1d511 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/ring_theory/subsemiring/pointwise.lean | e6a15671de6e89b77e820218784807706cc77b7c | [
"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 | 4,428 | 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 algebra.group_ring_action
import ring_theory.subsemiring.basic
/-! # Pointwise instances on `subsemiring`s
This file provides the action `subsemiring.pointwise_mul... |
74eb6e9a5a093bc91ac1c7e9baec57844c5499e1 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /library/data/int/power.lean | e48782f98927d8ded0fe20425161b825e1cb100d | [
"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 | 763 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad
The power function on the integers.
-/
import data.int.basic data.int.order data.int.div algebra.group_power data.nat.power
namespace int
definition int_has_pow_nat [ins... |
3bd1b1de2c4c5a116ca2f926c23be31b1e62cb0f | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/function.lean | 071007d71184ffdaaa613bead25da7d425a112cd | [] | 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 | 8,293 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura, Jeremy Avigad, Haitao Zhang
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.data.prod
import Mathlib.Lean3Lib.init.funext
import Mathlib.Lean3Lib.init.l... |
36dc0b0064a8be3f1641550843be1da5a15bd18d | 01ae0d022f2e2fefdaaa898938c1ac1fbce3b3ab | /categories/monic.lean | b8ed3e9a4b70583420030e431c086285d1e119cf | [] | no_license | PatrickMassot/lean-category-theory | 0f56a83464396a253c28a42dece16c93baf8ad74 | ef239978e91f2e1c3b8e88b6e9c64c155dc56c99 | refs/heads/master | 1,629,739,187,316 | 1,512,422,659,000 | 1,512,422,659,000 | 113,098,786 | 0 | 0 | null | 1,512,424,022,000 | 1,512,424,022,000 | null | UTF-8 | Lean | false | false | 1,317 | lean | -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Tim Baumann, Stephen Morgan, Scott Morrison
import .category
open categories
namespace categories
structure Monic { C : Category } { Y Z : C.Obj } ( f : C.Hom Y Z ) :=
( wi... |
f10b64770783ed6342baa84361c73aa611ddef35 | 30b012bb72d640ec30c8fdd4c45fdfa67beb012c | /analysis/topology/uniform_space.lean | d7c2682a8514ed652f2da30c0182c9849f6fc706 | [
"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 | 73,327 | 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
Theory of uniform spaces.
Uniform spaces are a generalization of metric spaces and topological groups. Many concepts directly
generaliz... |
56fd4ac61d8cd76cd47d88f19481e6c4ec916a22 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/bench/deriv.lean | a2a3e7e43bba6c63e4df503ea03b159446ce7981 | [
"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,957 | 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
namespace Expr
partial def pown : Int → Int → Int
| a, 0 => 1
| a, 1 => a
| a, n =>
let b := pown a (n / 2);
b * b * (... |
d573d5ea6ec4e23621b26ce1a6d60c5ac7f5895c | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/vm_inline_aux.lean | b92e017ff7416d23e83381c79190d9275d96877c | [
"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 | 245 | lean | namespace hide
set_option trace.compiler.optimize_bytecode true
@[inline] def {u} cond {a : Type u} : bool → a → a → a
| tt x y := x
| ff x y := y
-- cond should be inlined here
def foo (x : bool) :=
100 + cond x (10*10) (20*20)
end hide |
18675f0087eea635902ed30e5032e299f9cd28aa | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/rat1.lean | 64d2ffd3806892540715258aa12b3cef1fe1c779 | [
"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 | 516 | lean | import Lean.Data.Rat
open Lean
#eval (15 : Rat) / 10
#eval (15 : Rat) / 10 + 2
#eval (15 : Rat) / 10 - 2
#eval (-2 : Rat).inv
#eval (2 : Rat).inv == (1 : Rat) / 2
#eval (-2 : Rat).inv == (-1 : Rat) / 2
#eval (4 : Rat)/9 * (3 : Rat)/10
#eval (4 : Rat)/9 * (-3 : Rat)/10
#eval (1 : Rat) < (-1 : Rat)
#eval (-1 : Rat) < ... |
d327bf7593196a5df7122cad2012d02e1f7f0368 | efa51dd2edbbbbd6c34bd0ce436415eb405832e7 | /20170116_POPL/backchain/back_inplace.lean | 2ae42003b41fd1a96b4eb49e0445066724944918 | [
"Apache-2.0"
] | permissive | leanprover/presentations | dd031a05bcb12c8855676c77e52ed84246bd889a | 3ce2d132d299409f1de269fa8e95afa1333d644e | refs/heads/master | 1,688,703,388,796 | 1,686,838,383,000 | 1,687,465,742,000 | 29,750,158 | 12 | 9 | Apache-2.0 | 1,540,211,670,000 | 1,422,042,683,000 | Lean | UTF-8 | Lean | false | false | 2,822 | lean | /- The tactic search_mem_list defined at back.lean does
not update the tactic_state. More importantly, it does not change
the set of goals that need to be solved.
It is also possible to write a very compact search_mem_list on top of the
apply tactic. This version will create subgoals while searching for
... |
e92ccfdf31c08ec75515ca560f177149a874d960 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/combinatorics/composition.lean | 1741afc367f9973b456d1b4e5d8a5dbdb89c3c37 | [
"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 | 36,453 | lean | /-
Copyright (c) 2020 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import data.finset.sort
import algebra.big_operators.order
import algebra.big_operators.fin
/-!
# Compositions
A composition of a natural number `n` is a deco... |
a0ccddc606388be8d771f330878e8e031cc93a18 | a4673261e60b025e2c8c825dfa4ab9108246c32e | /src/Lean/Data/Lsp/Diagnostics.lean | 59ab0f34a4268fdc70f356d2756317e019a446cc | [
"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 | 4,770 | lean | /-
Copyright (c) 2020 Marc Huisinga. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Marc Huisinga, Wojciech Nawrocki
-/
import Lean.Data.Json
import Lean.Data.Lsp.Basic
import Lean.Data.Lsp.Utf16
import Lean.Message
/-! Definitions and functionality for emitting dia... |
a2a08866332daf3ac9f136e4bdb764d0061aa93b | efce24474b28579aba3272fdb77177dc2b11d7aa | /src/homotopy_theory/topological_spaces/quotient_space.lean | 1304f1e7c26f7cefc67fa708f0d3e5fd9ecb0231 | [
"Apache-2.0"
] | permissive | rwbarton/lean-homotopy-theory | cff499f24268d60e1c546e7c86c33f58c62888ed | 39e1b4ea1ed1b0eca2f68bc64162dde6a6396dee | refs/heads/lean-3.4.2 | 1,622,711,883,224 | 1,598,550,958,000 | 1,598,550,958,000 | 136,023,667 | 12 | 6 | Apache-2.0 | 1,573,187,573,000 | 1,528,116,262,000 | Lean | UTF-8 | Lean | false | false | 12,405 | lean | import data.pfun
import category_theory.colimits
import .category
import .homeomorphism
import for_mathlib
/-
The quotient of a space by a subspace. Abstractly, this is given as
the pushout in the diagram
A → *
i ↓ ↓ j
X → X/A
q
We write X/A here, though the quotient space also depends on i and w... |
3ccecb9f5a9d44092a7d348f3e9c269f4ad6a011 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/tactic/norm_fin.lean | a224738290e5c31318e22d3e37c9090834bb2fad | [
"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 | 25,244 | lean | /-
Copyright (c) 2021 Yakov Pechersky All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yakov Pechersky, Mario Carneiro
-/
import tactic.norm_num
/-!
# `norm_fin`
This file defines functions for dealing with `fin n` numbers as expressions.
## Main definitions
* `tact... |
f4b83d0a93deff3bbc00759a7f5c35a3fbe1bab4 | 1e561612e7479c100cd9302e3fe08cbd2914aa25 | /mathlib4_experiments/CoreExt.lean | 71b4d46cbe011519165fa61add089696bfca7b85 | [
"Apache-2.0"
] | permissive | kbuzzard/mathlib4_experiments | 8de8ed7193f70748a7529e05d831203a7c64eedb | 87cb879b4d602c8ecfd9283b7c0b06015abdbab1 | refs/heads/master | 1,687,971,389,316 | 1,620,336,942,000 | 1,620,336,942,000 | 353,994,588 | 7 | 4 | Apache-2.0 | 1,622,410,748,000 | 1,617,361,732,000 | Lean | UTF-8 | Lean | false | false | 1,365 | lean | /-
Just some random additions to `Core.lean` that look like they would actually belong there.
-/
theorem Iff.isEquivalence : Equivalence Iff := ⟨Iff.refl, Iff.symm, Iff.trans⟩
theorem Eq.isEquivalence {α : Sort u} : Equivalence (@Eq α) := ⟨Eq.refl, Eq.symm, Eq.trans⟩
theorem Setoid.of_Eq {α : ... |
1442aa542efc8dc6ca31ccf77e23dcba24029644 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/lean/run/expectedTypePropagation.lean | c20730654d4431adb0b70df2ca85aba0c34c9645 | [
"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 | 317 | lean | instance : Coe Nat Int :=
⟨fun n => Int.ofNat n⟩
def f (x : Nat) : List Int :=
[x]
new_frontend
def g1 (x : Nat) : List Int :=
[x, x]
def g2 (n : Nat) (i : Int) : Int :=
0 + n + i
def g3 (n : Nat) (i : Int) : Int :=
let x : Int := n+i;
x + x
def g4 (n : Nat) (i : Int) : Int :=
let f := fun x => x + i;
f n
|
116d1fcdba71f3c7655a0bdb16d3ec02766ead6e | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /tests/lean/run/task_test2.lean | 61ea3c21222a33f2afc66cb53ea8b17e139641d1 | [
"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 | 395 | lean |
def run1 (i : Nat) (n : Nat) (xs : List Nat) : Nat :=
n.repeat (fun r =>
dbgTrace! ">> [{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 := ... |
c4de87cfc7e388999b2b30ae71319e6469ca90b7 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/ring_theory/perfection.lean | 0fb01b89d89cd6053033fb967e9c76dc1c63a190 | [
"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,436 | 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.char_p.pi
import algebra.char_p.quotient
import algebra.char_p.subring
import algebra.ring.pi
import analysis.special_functions.pow
import field_theory.perfect_... |
5d2671f7328a7e73a59f2e0a0a7352bc2fa12fb3 | 6b02ce66658141f3e0aa3dfa88cd30bbbb24d17b | /tests/lean/StxQuot.lean | 4ea2c1a06d06c88177ff550e5f3ee81d9192dc47 | [
"Apache-2.0"
] | permissive | pbrinkmeier/lean4 | d31991fd64095e64490cb7157bcc6803f9c48af4 | 32fd82efc2eaf1232299e930ec16624b370eac39 | refs/heads/master | 1,681,364,001,662 | 1,618,425,427,000 | 1,618,425,427,000 | 358,314,562 | 0 | 0 | Apache-2.0 | 1,618,504,558,000 | 1,618,501,999,000 | null | UTF-8 | Lean | false | false | 4,120 | lean | import Lean
open Lean
open Lean.Elab
def run {α} [ToString α] : Unhygienic α → String := toString ∘ Unhygienic.run
#eval run `()
#eval run `(Nat.one)
#eval run `($Syntax.missing)
namespace Lean.Syntax
#eval run `($missing)
#eval run `($(missing))
#eval run `($(id Syntax.missing) + 1)
#eval run $ let id := Syntax.mis... |
dd431aedbe8efd1e247326777c2f629d65ccc9dd | 842b7df4a999c5c50bbd215b8617dd705e43c2e1 | /nat_num_game/src/Advanced_Addition_World/adv_add_wrld12.lean | efdb814c35678b54d86dce90b6e1bfeee8a93788 | [] | no_license | Samyak-Surti/LeanCode | 1c245631f74b00057d20483c8ac75916e8643b14 | 944eac3e5f43e2614ed246083b97fbdf24181d83 | refs/heads/master | 1,669,023,730,828 | 1,595,534,784,000 | 1,595,534,784,000 | 282,037,186 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 112 | lean | theorem add_one_eq_succ (d : ℕ) : d + 1 = nat.succ d :=
begin
symmetry,
apply nat.succ_eq_add_one,
end |
597990a64287996e1010598d3d84d38243fb9c13 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/data/finset/pi_induction.lean | 23fd8ef8cb3bb386bee50de08d459f8ad1938047 | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 5,037 | 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 data.fintype.basic
/-!
# Induction principles for `Π i, finset (α i)`
In this file we prove a few induction principles for functions `Π i : ι, finset (α i)... |
eacef3ec53007ea44b3d79b3924b24e033db327f | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/order/nonneg/ring.lean | 3cd3e4242239c1f44acb81d02e738be25a44a1e4 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 13,334 | lean | /-
Copyright (c) 2021 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
-/
import data.nat.cast.basic
import algebra.order.ring.defs
import algebra.order.ring.inj_surj
import algebra.group_power.order
import order.complete_lattice_interv... |
415057f3d0c81780c4bf23cb9e15b1cc54466e4d | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/untrusted_examples.lean | b27cedb7b7c1de46e74791743cb471d830c44173 | [
"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 | 225 | lean | open tactic
set_option pp.all true
meta example (m1 : tactic nat) (m2 : nat → tactic bool) : true :=
by do
m1 ← get_local `m1,
m2 ← get_local `m2,
b ← mk_app `has_bind.bind [m1, m2],
trace b,
constructor
|
e8e9bbfb506f78081512dc4c3e35fb9d58d74183 | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/data/buffer/basic.lean | 1cbe9b140acb0579d97ab35287a1cef394345368 | [
"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 | 1,865 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
Traversable instance for buffers.
-/
import data.buffer data.array.lemmas
import category.traversable.instances data.equiv.basic
tactic.ext
namespace buffer
open fu... |
73e3bf4df7c7613ad61db8c2131b20fb6220f483 | 41ebf3cb010344adfa84907b3304db00e02db0a6 | /uexp/src/uexp/rules/aggregateProjectPullUpConstants.lean | 832969828c409e46c55fd4da03b1e69ca4c90a0a | [
"BSD-2-Clause"
] | permissive | ReinierKoops/Cosette | e061b2ba58b26f4eddf4cd052dcf7abd16dfe8fb | eb8dadd06ee05fe7b6b99de431dd7c4faef5cb29 | refs/heads/master | 1,686,483,953,198 | 1,624,293,498,000 | 1,624,293,498,000 | 378,997,885 | 0 | 0 | BSD-2-Clause | 1,624,293,485,000 | 1,624,293,484,000 | null | UTF-8 | Lean | false | false | 2,743 | lean | /-
⟦ Γ ⊢ (SELECT (combineGroupByProj PLAIN(uvariable (right⋅emp_job)) (combineGroupByProj PLAIN(uvariable (right⋅emp_empno)) (combineGroupByProj PLAIN(uvariable (right⋅emp_sal)) (SUM(uvariable (right⋅emp_sal)))))) FROM1 (table rel_emp) WHERE (equal (uvariable (right⋅emp_empno)) (constantExpr integer_10)) GROUP BY (c... |
d54e4ac2428c8b534f4d32cfbff377e95ed5f0ab | 947b78d97130d56365ae2ec264df196ce769371a | /stage0/src/Lean/PrettyPrinter/Backtrack.lean | 44096131b5ebea0fc73f4751c09202a772b17fa1 | [
"Apache-2.0"
] | permissive | shyamalschandra/lean4 | 27044812be8698f0c79147615b1d5090b9f4b037 | 6e7a883b21eaf62831e8111b251dc9b18f40e604 | refs/heads/master | 1,671,417,126,371 | 1,601,859,995,000 | 1,601,860,020,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 570 | lean | /-
Copyright (c) 2020 Sebastian Ullrich. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
-/
import Lean.InternalExceptionId
namespace Lean
namespace PrettyPrinter
/- Auxiliary internal exception for backtracking the pretty printer.
See `orelse.par... |
15938266e13698459e34bc3e11ee5e8472042cf7 | 656e8243a2472b4e542d0bc68780a4e4cbc9e702 | /02.lean | 5a88227441af7699f929b67c693c91408ea253e6 | [] | no_license | eyelash/aoc-2019 | a82fa3a05344a65e66cfe94a13d03fc9ce371617 | dfff6c31ab94617d31d8a0e2ed53d4a849994734 | refs/heads/master | 1,663,476,455,647 | 1,661,594,730,000 | 1,661,594,730,000 | 226,511,604 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 983 | lean | def restore (p : Array Nat) (noun verb : Nat) : Array Nat :=
let p := p.set! 1 noun
let p := p.set! 2 verb
p
def getOp : Nat -> Nat -> Nat -> Nat
| 1 => (. + .)
| 2 => (. * .)
| _ => panic! "invalid opcode"
partial def runProgram (p : Array Nat) (i : Nat) : Nat :=
if p[i]! == 99 then
p[0]!
else
... |
f9d3d46fb992b465829c0c1a1a22170eac434eae | 30b012bb72d640ec30c8fdd4c45fdfa67beb012c | /category_theory/category.lean | ae99cb050fc254894091f7dc7ad9ed8af6238e46 | [
"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 | 6,217 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Stephen Morgan, Scott Morrison, Johannes Hölzl, Reid Barton
Defines a category, as a typeclass parametrised by the type of objects.
Introduces notations
`X ⟶ Y` for the morphism spa... |
8345d76f94d4d0389504ff9c79026f18229a9cfc | ae1e94c332e17c7dc7051ce976d5a9eebe7ab8a5 | /tests/lean/run/isDefEqMVarSelfIssue.lean | 28d641aa3437a45017a079c481004a26328d86e1 | [
"Apache-2.0"
] | permissive | dupuisf/lean4 | d082d13b01243e1de29ae680eefb476961221eef | 6a39c65bd28eb0e28c3870188f348c8914502718 | refs/heads/master | 1,676,948,755,391 | 1,610,665,114,000 | 1,610,665,114,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 171 | lean | #lang lean4
partial def f : Bool :=
let rec loop (i : Nat) :=
let v := true
if v = v then loop (i+1) else v
loop 1
set_option pp.all true
#print f.loop._unsafe_rec
|
b1cd197116541eea525d872ede877ea2bac3360d | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/group_theory/dihedral.lean | 87055f372d772e950cfc893b3241cca1fd3bc8af | [] | 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 | 3,349 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.zmod.basic
import Mathlib.group_theory.order_of_element
import Mathlib.PostPort
univers... |
a9830df65ae912185f9156fc3e8a398af0a6e0d0 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/bad_pattern.lean | c90c0769e511f5b037feac1a79da3af92f10cbca | [
"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 | 396 | lean | constant P : nat → Prop
lemma tst₀ [forward] : ∀ x, P x := -- Fine
sorry
lemma tst₁ [forward] : ∀ x, (: P x :) := -- Fine
sorry
lemma tst₂ [forward] : ∀ x, P (: x :) := -- Error
sorry
lemma tst₃ [forward] : ∀ x, P (: id x :) :=
sorry
reveal tst₀ tst₁ tst₃
print tst₀
print tst₁
print tst₃
definition tst₄ [forward]... |
43e43f9e9bca3bad649210417318e1c70c82ede9 | 0c1546a496eccfb56620165cad015f88d56190c5 | /tests/lean/run/pack_unpack2.lean | b2a548c4936c48038a97943b7025ba068cfd1457 | [
"Apache-2.0"
] | permissive | Solertis/lean | 491e0939957486f664498fbfb02546e042699958 | 84188c5aa1673fdf37a082b2de8562dddf53df3f | refs/heads/master | 1,610,174,257,606 | 1,486,263,620,000 | 1,486,263,620,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 985 | lean | --set_option trace.inductive_compiler.nested.define true
inductive {u} tree (A : Type u) : Type u
| leaf : A -> tree
| node : list tree -> tree
set_option trace.eqn_compiler true
definition sz {A : Type*} : tree A → nat
| (tree.leaf a) := 1
| (tree.node l) := list.length l + 1
constant P {A : Type*} : tree A → Type 1... |
e2d351ed12405d9b944777b812036ea33336db51 | de91c42b87530c3bdcc2b138ef1a3c3d9bee0d41 | /old/imperative_DSL/physlang.lean | 5aeb87d04e4ddee99278de14b0076cf845946237 | [] | no_license | kevinsullivan/lang | d3e526ba363dc1ddf5ff1c2f36607d7f891806a7 | e9d869bff94fb13ad9262222a6f3c4aafba82d5e | refs/heads/master | 1,687,840,064,795 | 1,628,047,969,000 | 1,628,047,969,000 | 282,210,749 | 0 | 1 | null | 1,608,153,830,000 | 1,595,592,637,000 | Lean | UTF-8 | Lean | false | false | 10,940 | lean | import .environment
--import ..eval.accelerationEval
--import ..eval.geometryEval
--import ..eval.timeEval
--import ..eval.velocityEval
import ..expressions.measurementSystem
import ..expressions.classical_geometry
import ..expressions.classical_time
import ..expressions.classical_hertz
import ..expressions.classical_l... |
31ec7336306d0bc5aa5dc1ad6d26abf838910024 | c09f5945267fd905e23a77be83d9a78580e04a4a | /src/topology/metric_space/cau_seq_filter.lean | 59775ee1c4626eab453c9a7c67b93c91a1213bc7 | [
"Apache-2.0"
] | permissive | OHIHIYA20/mathlib | 023a6df35355b5b6eb931c404f7dd7535dccfa89 | 1ec0a1f49db97d45e8666a3bf33217ff79ca1d87 | refs/heads/master | 1,587,964,529,965 | 1,551,819,319,000 | 1,551,819,319,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 19,692 | 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, Sébastien Gouëzel
Characterize completeness of metric spaces in terms of Cauchy sequences.
In particular, reconcile the filter notion of Cauchy-ness with the cau_seq ... |
5604e8389c277e24a5ca974de9a07e1bba831987 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/number_theory/legendre_symbol/zmod_char.lean | dde190d57fb85af7621edf4383d9e60f12be04f6 | [
"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,018 | lean | /-
Copyright (c) 2022 Michael Stoll. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Michael Stoll
-/
import data.int.range
import data.zmod.basic
import number_theory.legendre_symbol.mul_character
/-!
# Quadratic characters on ℤ/nℤ
This file defines some quadratic ch... |
64738984b55ef7a7b1299dee0279cfdc4f582c65 | a338c3e75cecad4fb8d091bfe505f7399febfd2b | /src/measure_theory/set_integral.lean | da4966fa46ab14d9c3c5818e1561f217d3856dd0 | [
"Apache-2.0"
] | permissive | bacaimano/mathlib | 88eb7911a9054874fba2a2b74ccd0627c90188af | f2edc5a3529d95699b43514d6feb7eb11608723f | refs/heads/master | 1,686,410,075,833 | 1,625,497,070,000 | 1,625,497,070,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 35,246 | lean | /-
Copyright (c) 2020 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou, Yury Kudryashov
-/
import measure_theory.integrable_on
import measure_theory.bochner_integration
/-!
# Set integral
In this file we prove some properties of `∫ x in s, ... |
9aab29db81d38df635b6d63ddc9307fa2182d9be | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/tactic/interval_cases.lean | 95fe89df540bf911bff370c4920e5b637fa2483e | [
"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 | 9,802 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Scott Morrison
Case bashing on variables in finite intervals.
In particular, `interval_cases n`
1) inspects hypotheses looking for lower and upper bounds of the form `a ≤ n` and `n < ... |
583c02618477632595644f80cba8748a441f5cd9 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/category_theory/idempotents/homological_complex.lean | 5db952eacb7aa948611e102bdf87f8cad40121cb | [
"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 | 6,715 | lean | /-
Copyright (c) 2022 Joël Riou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Joël Riou
-/
import algebra.homology.homological_complex
import category_theory.idempotents.karoubi
/-!
# Idempotent completeness and homological complexes
This file contains simplificat... |
6e08d287c5dc08e647010522e90bfbc29c1fd887 | b70031c8e2c5337b91d7e70f1e0c5f528f7b0e77 | /src/algebra/group_power/basic.lean | 6a1d293472485105ce95f56d7288beae1354dfab | [
"Apache-2.0"
] | permissive | molodiuc/mathlib | cae2ba3ef1601c1f42ca0b625c79b061b63fef5b | 98ebe5a6739fbe254f9ee9d401882d4388f91035 | refs/heads/master | 1,674,237,127,059 | 1,606,353,533,000 | 1,606,353,533,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 23,104 | 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
-/
import algebra.ordered_ring
import deprecated.group
/-!
# Power operations on monoids and groups
The power operation on monoids and groups.
We separa... |
86144aaf68dc068555710b52b6e776ad9dd3df4b | 271e26e338b0c14544a889c31c30b39c989f2e0f | /tests/lean/StxQuot.lean | a924d6c26a37d45e5cacdffcac3da65792c9a13f | [
"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 | 1,929 | lean | import Init.Lean
namespace Lean
open Lean.Elab
def run {α} [HasToString α] : Unhygienic α → String := toString ∘ Unhygienic.run
#eval run `(Nat.one)
#eval run `($Syntax.missing)
namespace Syntax
#eval run `($missing)
#eval run `($(missing.getArg 0))
#eval run `($(id Syntax.missing) + 1)
#eval run $ let id := Syntax.... |
b2fdbb662b9b46723f7b7c2c8943e00a10c5d69f | 1e3a43e8ba59c6fe1c66775b6e833e721eaf1675 | /src/data/padics/padic_integers.lean | 96eae39f25e815e1208b115866266c3361ca0da4 | [
"Apache-2.0"
] | permissive | Sterrs/mathlib | ea6910847b8dfd18500486de9ab0ee35704a3f52 | d9327e433804004aa1dc65091bbe0de1e5a08c5e | refs/heads/master | 1,650,769,884,257 | 1,587,808,694,000 | 1,587,808,694,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,654 | 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
-/
import data.int.modeq
import data.padics.padic_numbers
/-!
# p-adic integers
This file defines the p-adic integers ℤ_p as the subtype of ℚ_p with ... |
3156a8845a3a5e212586ae6961b2598b6babccc4 | acc85b4be2c618b11fc7cb3005521ae6858a8d07 | /data/seq/parallel.lean | e650e9ffb13075b541f9ce3c777c8c59864f7cb2 | [
"Apache-2.0"
] | permissive | linpingchuan/mathlib | d49990b236574df2a45d9919ba43c923f693d341 | 5ad8020f67eb13896a41cc7691d072c9331b1f76 | refs/heads/master | 1,626,019,377,808 | 1,508,048,784,000 | 1,508,048,784,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 12,271 | 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... |
d2135a42e797b0562c0fe917be76cdcc4d522941 | bb31430994044506fa42fd667e2d556327e18dfe | /src/linear_algebra/affine_space/restrict.lean | 5a82ba53e41363aa8f33c3c4c375768e2627da9a | [
"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 | 3,943 | lean | /-
Copyright (c) 2022 Paul Reichert. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Paul Reichert
-/
import linear_algebra.affine_space.affine_subspace
/-!
# Affine map restrictions
This file defines restrictions of affine maps.
## Main definitions
* The domain and... |
33a75ed054973bed16812165bf7510e0c207703b | ebbdcbd7ddc89a9ef7c3b397b301d5f5272a918f | /qp/p1_categories/c3_wtypes.lean | 96fe08e1bf61382446373d05340c68cca991b59e | [] | no_license | intoverflow/qvr | 34b9ef23604738381ca20b7d622fd0399d88f2dd | 0cfcd33fe4bf8d93851a00cec5bfd21e77105d74 | refs/heads/master | 1,616,591,570,371 | 1,492,575,772,000 | 1,492,575,772,000 | 80,061,627 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 182 | lean | import .c3_wtypes.s1_base_change
import .c3_wtypes.s2_exp
import .c3_wtypes.s3_algebras
import .c3_wtypes.s4_poly_endofuns
import .c3_wtypes.s5_wtypes
import .c3_wtypes.s6_inductive
|
98e4641b6df9a80a82c01499a9620300af613b91 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebraic_geometry/limits.lean | 22c9fbc92cf7fc41ced4094de179505c65b3706e | [
"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,614 | lean | /-
Copyright (c) 2022 Andrew Yang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Andrew Yang
-/
import algebraic_geometry.pullbacks
import algebraic_geometry.AffineScheme
/-!
# (Co)Limits of Schemes
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this fi... |
d727c811f628d286cdb643b688ef7e55b9419bf9 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/tactic/clear.lean | 1fac0d29806e3cbaa8703a3adad8f54a0d924617 | [
"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,506 | lean | /-
Copyright (c) 2020 Jannis Limperg. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jannis Limperg
-/
import data.bool.basic
import tactic.core
/-!
# Better `clear` tactics
We define two variants of the standard `clear` tactic:
* `clear'` works like `clear` but the... |
f162b2b168ad170f1864d676e6e270ba85ac5189 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/monad/basic_auto.lean | ba3559c90b365371020bb6ecb2158175a0f15496 | [] | 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 | 13,401 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Bhavik Mehta, Adam Topaz
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.category_theory.functor_category
import Mathlib.PostPort
univers... |
9d55baef9e2403cd9d1e9fa3e856668b01fb0edb | d436468d80b739ba7e06843c4d0d2070e43448e5 | /src/category_theory/limits/preserves.lean | d79c1d027511a84041ad3f04a48a998f626e571b | [
"Apache-2.0"
] | permissive | roro47/mathlib | 761fdc002aef92f77818f3fef06bf6ec6fc1a28e | 80aa7d52537571a2ca62a3fdf71c9533a09422cf | refs/heads/master | 1,599,656,410,625 | 1,573,649,488,000 | 1,573,649,488,000 | 221,452,951 | 0 | 0 | Apache-2.0 | 1,573,647,693,000 | 1,573,647,692,000 | null | UTF-8 | Lean | false | false | 10,583 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Reid Barton
-/
import category_theory.limits.limits
/-!
# Preservation and reflection of (co)limits.
-/
open category_theory
namespace category_theory.limits
univer... |
8a3ff682fe3d1e48358a64fb570e6b161c2cf4e4 | 4b846d8dabdc64e7ea03552bad8f7fa74763fc67 | /tests/lean/run/simp_partial_app.lean | a0d4e233f1a6ce11a2b34a660cec7d673d7859a0 | [
"Apache-2.0"
] | permissive | pacchiano/lean | 9324b33f3ac3b5c5647285160f9f6ea8d0d767dc | fdadada3a970377a6df8afcd629a6f2eab6e84e8 | refs/heads/master | 1,611,357,380,399 | 1,489,870,101,000 | 1,489,870,101,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 616 | lean | open tactic
meta def check_expr (p : pexpr) (t : expr) : tactic unit :=
do e ← to_expr p, guard (expr.alpha_eqv t e)
meta def check_target (p : pexpr) : tactic unit :=
do t ← target, check_expr p t
example (a : list nat) : a = [1, 2] → a^.for nat.succ = [2, 3] :=
begin
intros,
simp [list.for, flip],
check_targ... |
61859f94492d744bf1653a90a60624bdbda27783 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/data/finmap.lean | 4e4c242f50af945364c05e96f46b9608bf125c2d | [
"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 | 19,067 | lean | /-
Copyright (c) 2018 Sean Leather. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sean Leather, Mario Carneiro
-/
import data.list.alist
import data.finset.basic
import data.part
/-!
# Finite maps over `multiset`
-/
universes u v w
open list
variables {α : Type u} {β... |
342951345ebd2d3d737c2d084b82dcc3eacedca3 | d7189ea2ef694124821b033e533f18905b5e87ef | /galois/map/fmap.lean | b45c4c7ad4bb6099368b3ae5fc594c047b9c9469 | [
"Apache-2.0"
] | permissive | digama0/lean-protocol-support | eaa7e6f8b8e0d5bbfff1f7f52bfb79a3b11b0f59 | cabfa3abedbdd6fdca6e2da6fbbf91a13ed48dda | refs/heads/master | 1,625,421,450,627 | 1,506,035,462,000 | 1,506,035,462,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,070 | lean | import data.hash_map
import galois.list.fpow
universes u v w
lemma neq_symm {A : Type u} {x y : A}
(H : x ≠ y) : y ≠ x
:= begin
intros contra,
apply H, symmetry, assumption
end
namespace map
/- Key-value maps. Not necessarily with finite domain.
For instance, we could implement this with just
`K → option V`... |
1aae8d5d8b1cc8f8fce34da147cdf676ca555f1b | 37a833c924892ee3ecb911484775a6d6ebb8984d | /src/category_theory/iso_induction.lean | e63a64af83ef7bec23ef4fafb7c9b1affb427f4a | [] | no_license | silky/lean-category-theory | 28126e80564a1f99e9c322d86b3f7d750da0afa1 | 0f029a2364975f56ac727d31d867a18c95c22fd8 | refs/heads/master | 1,589,555,811,646 | 1,554,673,665,000 | 1,554,673,665,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,546 | lean | import category_theory.isomorphism
import category_theory.types
universes u v
def isos (C : Type u) := C
open category_theory
instance category_isos {C : Type u} [category.{u v} C] : category (isos C) :=
{ hom := λ X Y, @iso C _ X Y,
id := iso.refl,
comp := λ X Y Z, iso.trans }
instance category_isos_type : la... |
d126f2750faca1a149c7e2175a78a51be1326daa | a047a4718edfa935d17231e9e6ecec8c7b701e05 | /src/order/filter/filter_product.lean | 1ec2f3807e25d2d75079ae08ccefe3b09aeb06b2 | [
"Apache-2.0"
] | permissive | utensil-contrib/mathlib | bae0c9fafe5e2bdb516efc89d6f8c1502ecc9767 | b91909e77e219098a2f8cc031f89d595fe274bd2 | refs/heads/master | 1,668,048,976,965 | 1,592,442,701,000 | 1,592,442,701,000 | 273,197,855 | 0 | 0 | null | 1,592,472,812,000 | 1,592,472,811,000 | null | UTF-8 | Lean | false | false | 22,407 | lean | /-
Copyright (c) 2019 Abhimanyu Pallavi Sudhir. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Abhimanyu Pallavi Sudhir
"Filterproducts" (ultraproducts on general filters), ultraproducts.
-/
import order.filter.ultrafilter
import algebra.pi_instances
universes u v
var... |
d5d61484dab8a217da037194213cda33b36e187f | 7b02c598aa57070b4cf4fbfe2416d0479220187f | /algebra/exactness.hlean | 3b0fd26a7cc3b88e7dd0d764b49bc9b316ce41c2 | [
"Apache-2.0"
] | permissive | jdchristensen/Spectral | 50d4f0ddaea1484d215ef74be951da6549de221d | 6ded2b94d7ae07c4098d96a68f80a9cd3d433eb8 | refs/heads/master | 1,611,555,010,649 | 1,496,724,191,000 | 1,496,724,191,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,025 | hlean | /-
Copyright (c) 2017 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
Short exact sequences
-/
import homotopy.chain_complex eq2
open pointed is_trunc equiv is_equiv eq algebra group trunc function
structure is_exact_t {A B : Type} {C : Ty... |
bfeb29b48b82c0306acd9b3c27816886074202a1 | 367134ba5a65885e863bdc4507601606690974c1 | /src/group_theory/archimedean.lean | 047e0e961aaaccf954da6c29005c883557856bef | [
"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 | 3,284 | lean | /-
Copyright (c) 2020 Heather Macbeth, Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Heather Macbeth, Patrick Massot
-/
import group_theory.subgroup
import algebra.archimedean
/-!
# Archimedean groups
This file proves a few facts about ordered groups... |
b159e6cf543e781f106cf811754562e16e09ebaa | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/682.lean | 5ebd62f4b365ecbb3c17ab0986d6371fb6c170d6 | [
"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 | 482 | lean | import data.examples.vector
open nat prod.ops
example (n : nat) (v₁ : vector nat n) (v₂ : vector nat 0) (h₁ : (v₂, n).2 = 0) (h₂ : n = 0) (h₃ : eq.rec_on h₁ v₁ = v₂) : v₂ = eq.rec_on h₂ v₁ :=
begin
esimp at h₁,
esimp at h₃,
subst h₃
end
example (n : nat) (v₁ : vector nat n) (v₂ : vector nat 0) (h₁ : (v₂, n).2 =... |
bae3fbc6f726820534db357cf0b81452a994c4f6 | 037dba89703a79cd4a4aec5e959818147f97635d | /src/2020/relations/partition_challenge_solution.lean | 0a731481d95c374043eb29e77418b0a204b25492 | [] | no_license | ImperialCollegeLondon/M40001_lean | 3a6a09298da395ab51bc220a535035d45bbe919b | 62a76fa92654c855af2b2fc2bef8e60acd16ccec | refs/heads/master | 1,666,750,403,259 | 1,665,771,117,000 | 1,665,771,117,000 | 209,141,835 | 115 | 12 | null | 1,640,270,596,000 | 1,568,749,174,000 | Lean | UTF-8 | Lean | false | false | 4,390 | lean | import logic.equiv.basic
import data.set.basic
structure partition (X : Type) :=
(C : set (set X))
(Hnonempty : ∀ c ∈ C, c ≠ ∅)
(Hcover : ∀ x, ∃ c ∈ C, x ∈ c)
(Hunique : ∀ c d ∈ C, c ∩ d ≠ ∅ → c = d)
def partition.ext {X : Type} (P Q : partition X) (H : P.C = Q.C) : P = Q :=
begin
cases P, cases Q,
simpa using H,... |
4ce6c6567e121a8ca9628dc2a0dd4b643249c040 | c7e0fa0422da099d4b66b195c60455d87facee0d | /subspace.lean | 69f46f12ddc26211612581428bc2cf455ca4088d | [] | no_license | viljamivirolainen/linear | 12d725a90a44ae2760f59e9a9d9dd12aae36300a | dcf28df05e06da1b4fc76bce61b8fa0741300dc8 | refs/heads/master | 1,678,895,327,362 | 1,516,045,398,000 | 1,516,045,398,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,740 | lean | import .vector_space
open vector_space
universes u v
variables {V : Type u} {F : Type v} [field F] [vector_space V F]
class subspace (U : set V) : Prop :=
(contains_zero : (0 : V) ∈ U)
(add_closed : ∀ {u v : V}, u ∈ U → v ∈ U → u + v ∈ U)
(mul_closed : ∀ (a : F) {u : V}, u ∈ U → a ⋅ u ∈ U)
open subspace
instance... |
b843e85f461777119fcf27a9fe275d6fc01af5dd | 4727251e0cd73359b15b664c3170e5d754078599 | /src/analysis/normed/group/add_torsor.lean | ddbfb457da4fa9c5fae0856b95b83a85a04fa6af | [
"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 | 9,717 | lean | /-
Copyright (c) 2020 Joseph Myers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Joseph Myers, Yury Kudryashov
-/
import analysis.normed.group.basic
import linear_algebra.affine_space.midpoint
/-!
# Torsors of additive normed group actions.
This file defines torsor... |
b45ae4871abeeef5422ccfc2b8604c7bb08c827d | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/algebra/iterate_hom.lean | 1c56297248b1cde79394376d8122986579d92bcd | [
"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 | 5,956 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import algebra.group_power.basic
import logic.function.iterate
import group_theory.perm.basic
/-!
# Iterates of monoid and ring homomorphisms
Iterate of a monoid... |
9e8a4b069fe1b960dab4ac61af7053282d965195 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/ring_theory/subsemiring.lean | bed47c6a634dd71f63642dcf44b02b4e70bef5d8 | [
"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 | 24,759 | lean | /-
Copyright (c) 2020 Yury Kudryashov All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import algebra.ring.prod
import group_theory.submonoid
import data.equiv.ring
/-!
# Bundled subsemirings
We define bundled subsemirings and some standard construc... |
90bef5feb246cfdc1ae64ceca0a863f53e338e69 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/lie/engel.lean | 9e22f226cc1fa792059ac7c052a17babd1ac49dd | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 13,614 | lean | /-
Copyright (c) 2022 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import algebra.lie.nilpotent
import algebra.lie.normalizer
/-!
# Engel's theorem
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a correspon... |
4b26b9a8ea9608937fb81a97cdacc3bb59b26298 | bb31430994044506fa42fd667e2d556327e18dfe | /src/analysis/convolution.lean | 44f2aab93c6ffe1c6ff46a0b9a91427a16ef3517 | [
"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 | 79,088 | lean | /-
Copyright (c) 2022 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
-/
import measure_theory.group.integration
import measure_theory.group.prod
import measure_theory.function.locally_integrable
import analysis.calculus.specific_funct... |
0aceacdefa52e202f98f3728a50dd990fe467541 | 1437b3495ef9020d5413178aa33c0a625f15f15f | /ring_theory/ideal_operations.lean | 63e19216fa7f41a64bf8c3f87f52a881bec9a79a | [
"Apache-2.0"
] | permissive | jean002/mathlib | c66bbb2d9fdc9c03ae07f869acac7ddbfce67a30 | dc6c38a765799c99c4d9c8d5207d9e6c9e0e2cfd | refs/heads/master | 1,587,027,806,375 | 1,547,306,358,000 | 1,547,306,358,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 20,571 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
More operations on modules and ideals.
-/
import ring_theory.ideals data.nat.choose order.zorn
import linear_algebra.tensor_product
universes u v w x
open lattice
namespace s... |
6c60c887e653a5df57bf2c5debf38813df9de32b | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/measure_theory/function/ae_eq_of_integral.lean | 3b634734019f781b4534a5fdb1741ef70ff4081d | [
"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 | 29,195 | 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 analysis.normed_space.dual
import measure_theory.function.strongly_measurable_lp
import measure_theory.integral.set_integral
/-! # From equality of integrals to ... |
20583ec9a959d1a323cf5714bcdf1bcc47140d83 | 05d69962fb9deab19838de9bbcf33ebdbf8faa57 | /finsupp.lean | 21a23f15babdbc9ba3cf5fa4859aa4e334e4adb4 | [] | no_license | pj0y1/polynom | 6eb7c96dbf34960be5721a232a67f7a592aedf7a | 9e198cc9104017fae7774574f141197bb295ee66 | refs/heads/master | 1,611,193,417,139 | 1,501,472,138,000 | 1,501,472,138,000 | 64,856,946 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,532 | lean | import supp sum aux
open set function eq.ops prod.ops classical
-- classical for equiv_def
variables {A B:Type}
section -- add zero neg have finite support
theorem add_finite_supp [add_monoid B]{f g: A -> B}
[finite (supp f)][finite (supp g)]: finite (supp (f + g)) :=
@finite_subset _ _ _ !finite_union add_... |
b55fb3b07e0eacdf113a3f5bf12e1c9222241de9 | efce24474b28579aba3272fdb77177dc2b11d7aa | /src/homotopy_theory/topological_spaces/i_category.lean | e816a6dc3c7f108a363f0d29bbedfd2576d11584 | [
"Apache-2.0"
] | permissive | rwbarton/lean-homotopy-theory | cff499f24268d60e1c546e7c86c33f58c62888ed | 39e1b4ea1ed1b0eca2f68bc64162dde6a6396dee | refs/heads/lean-3.4.2 | 1,622,711,883,224 | 1,598,550,958,000 | 1,598,550,958,000 | 136,023,667 | 12 | 6 | Apache-2.0 | 1,573,187,573,000 | 1,528,116,262,000 | Lean | UTF-8 | Lean | false | false | 1,118 | lean | import homotopy_theory.formal.i_category.definitions
import .precofibration_category
noncomputable theory
open category_theory
open category_theory.category
local notation f ` ∘ `:80 g:80 := g ≫ f
namespace homotopy_theory.topological_spaces
open homotopy_theory.cofibrations
open homotopy_theory.cofibrations.precof... |
0f3beb75624aa665bad4682c68f48b7730ffe845 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/topology/tietze_extension.lean | 89bd87a13f8d9e71f014371d7ebd655110b2a263 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 22,830 | lean | /-
Copyright (c) 2021 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov
-/
import data.set.intervals.monotone
import topology.algebra.order.monotone_continuity
import topology.urysohns_bounded
/-!
# Tietze extension theorem
In this... |
217f8924cd8c4b0dc1e69d538a2312c1b434bf26 | bb31430994044506fa42fd667e2d556327e18dfe | /src/analysis/locally_convex/with_seminorms.lean | c53496a47375a1aa7a827c244580baccb78f0b08 | [
"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 | 29,582 | lean | /-
Copyright (c) 2022 Moritz Doll. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Moritz Doll, Anatole Dedecker
-/
import analysis.seminorm
import analysis.locally_convex.bounded
import topology.algebra.filter_basis
import topology.algebra.module.locally_convex
/-!
#... |
68c67fca2ecf7c0adba358d3240144ba1e91f843 | e0f9ba56b7fedc16ef8697f6caeef5898b435143 | /src/data/fin_enum.lean | f5533fd77867dde77bbe7e8d0f668d8a9661ae21 | [
"Apache-2.0"
] | permissive | anrddh/mathlib | 6a374da53c7e3a35cb0298b0cd67824efef362b4 | a4266a01d2dcb10de19369307c986d038c7bb6a6 | refs/heads/master | 1,656,710,827,909 | 1,589,560,456,000 | 1,589,560,456,000 | 264,271,800 | 0 | 0 | Apache-2.0 | 1,589,568,062,000 | 1,589,568,061,000 | null | UTF-8 | Lean | false | false | 8,949 | lean | /-
Copyright (c) 2019 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Simon Hudon
-/
import control.monad.basic
import data.fintype.basic
/-!
Type class for finitely enumerable types. The property is stronger
than `fintype` in that it assigns each elemen... |
a5a4c82821cc830e839e64edce663e1bcd893463 | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/data/seq/computation.lean | 293a59f9ed1d35207bd273daf0aa52b6275ec57e | [
"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 | 37,503 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
Coinductive formalization of unbounded computations.
-/
import data.stream logic.relator tactic.cache tactic.interactive
universes u v w
/-
coinductive computati... |
3b6fc96bd32f4a889b816225f0b81dc1ab0e20f9 | e953c38599905267210b87fb5d82dcc3e52a4214 | /hott/cubical/squareover.hlean | 6b5652abd6ea98e0277b151d4e38e0de2d3de23d | [
"Apache-2.0"
] | permissive | c-cube/lean | 563c1020bff98441c4f8ba60111fef6f6b46e31b | 0fb52a9a139f720be418dafac35104468e293b66 | refs/heads/master | 1,610,753,294,113 | 1,440,451,356,000 | 1,440,499,588,000 | 41,748,334 | 0 | 0 | null | 1,441,122,656,000 | 1,441,122,656,000 | null | UTF-8 | Lean | false | false | 9,490 | 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
Squareovers
-/
import .square
open eq equiv is_equiv equiv.ops
namespace eq
-- we give the argument B explicitly, because Lean would find (λa, B a) by itself, ... |
fa597626e926ff610e24332328b97d965c78122c | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/geometry/euclidean/monge_point.lean | a0e4cd8dafb3d9b96c22289c25a70f83fc859feb | [
"Apache-2.0"
] | permissive | lacker/mathlib | f2439c743c4f8eb413ec589430c82d0f73b2d539 | ddf7563ac69d42cfa4a1bfe41db1fed521bd795f | refs/heads/master | 1,671,948,326,773 | 1,601,479,268,000 | 1,601,479,268,000 | 298,686,743 | 0 | 0 | Apache-2.0 | 1,601,070,794,000 | 1,601,070,794,000 | null | UTF-8 | Lean | false | false | 21,177 | lean | /-
Copyright (c) 2020 Joseph Myers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Joseph Myers.
-/
import geometry.euclidean.circumcenter
noncomputable theory
open_locale big_operators
open_locale classical
open_locale real
/-!
# Monge point and orthocenter
This fil... |
fb63f44f55c627c1624baff12517d3e38b33d3cf | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /tests/lean/run/tactic21.lean | 2119b8334cec9e61bb4ba676f0c50eaf406ed888 | [
"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 | 456 | lean | import logic
open tactic
theorem tst1 {A : Type} {a b c : A} {p : A → A → Prop} (H1 : p a b) (H2 : p b c) : ∃ x, p a x ∧ p x c
:= by apply exists.intro; apply and.intro; eassumption; eassumption
theorem tst2 {A : Type} {a b c d : A} {p : A → A → Prop} (Ha : p a c) (H1 : p a b) (Hb : p b d) (H2 : p b c) : ∃ x, p a x ∧... |
27b190dcc43d4a9b9b5cfab6463a21a68c9676df | 82b86ba2ae0d5aed0f01f49c46db5afec0eb2bd7 | /stage0/src/Lean/Elab/Tactic/Binders.lean | a8c2829c935390b99f5d486bc927ecce141614be | [
"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 | 1,242 | 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.Elab.Tactic.Basic
namespace Lean.Elab.Tactic
private def liftTermBinderSyntax : Macro := fun stx => do
let hole ← `(?_)
match stx.getKind w... |
137fdc4e1819a3cc5f44b80958c18291db16ee92 | 6b45072eb2b3db3ecaace2a7a0241ce81f815787 | /data/list/sort.lean | 29fc3a4608a2e98c131c817780bdeee03d2764f8 | [] | no_license | avigad/library_dev | 27b47257382667b5eb7e6476c4f5b0d685dd3ddc | 9d8ac7c7798ca550874e90fed585caad030bbfac | refs/heads/master | 1,610,452,468,791 | 1,500,712,839,000 | 1,500,713,478,000 | 69,311,142 | 1 | 0 | null | 1,474,942,903,000 | 1,474,942,902,000 | null | UTF-8 | Lean | false | false | 9,657 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad
Insertion sort and merge sort.
-/
import .perm
-- TODO(Jeremy): move this
namespace nat
theorem add_pos_left {m : ℕ} (h : m > 0) (n : ℕ) : m + n > 0 :=
calc
m + n > 0... |
3556f1100296a67695c37df6c635cad265bc6217 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/module/injective.lean | e41135936b0af37630fadaea3fa9aa6a668d2418 | [
"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 | 16,490 | lean | /-
Copyright (c) 2022 Jujian Zhang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jujian Zhang
-/
import category_theory.preadditive.injective
import ring_theory.ideal.basic
/-!
# Injective modules
## Main definitions
* `module.injective`: an `R`-module `Q` is inj... |
3b132ca764aa10b8336febc5afd2d4e078b4e769 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/closed/cartesian.lean | c561505054da76a8f13d0bd8e0c904bbec6985aa | [
"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 | 14,233 | 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.epi_mono
import category_theory.limits.shapes.finite_products
import category_theory.monoida... |
197370e42b60ffb2f583f89a5686041753cae66a | a6f55abce20abcd06e718cb3e5fba7bf8a230fa1 | /topic/number.lean | 2e4685be1217a000ce5b1223bf5a8f6d4c2e1fe5 | [] | no_license | sonna0909/abc | b8a53e906d4d000d1f2347173a1cd4221757fabf | ff7b4c621cdf6d53937f2d1b6def28de2085a2aa | refs/heads/master | 1,599,114,664,248 | 1,573,634,309,000 | 1,573,634,309,000 | 219,406,484 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,056 | lean | [
{
"key": "One",
"title": "One",
"spelling": "/wʌn/",
"subs": [
{
"key": "One_years old",
"title": "My son is one years old",
"spelling": ""
}
]
},
{
"key": "Two",
"title": "Two",
"spelling": "/tuː/",
"subs": [
{
"key": "Two_pe... |
8615f7ad69b4b1f37f783704a80010ec32b4c169 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/interactive/completionOption.lean | 415f332c95a15b15f2a8d0404e426ac1bdf0496b | [
"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 | 540 | lean |
set_option format
--^ textDocument/completion
set_option format.in
--^ textDocument/completion
set_option trace.pp.ana
--^ textDocument/completion
set_option trace.pp.analyze
--^ textDocument/completion
set_option format true
... |
bf31f363a1305b7a3a33fdf6443fbbdb2f897253 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/ring_theory/derivation.lean | a4d219d14c1f4a1bb8590c617e151910301cde4c | [
"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 | 11,868 | lean | /-
Copyright © 2020 Nicolò Cavalleri. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nicolò Cavalleri
-/
import algebra.lie.of_associative
import ring_theory.adjoin.basic
import ring_theory.algebra_tower
/-!
# Derivations
This file defines derivation. A derivation `... |
7bc4f08e073e226d406aec5238a0e8f98d1b3ec6 | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /stage0/src/Lean/Expr.lean | 8dc107aac04d15511396130955e35c06da46d5ae | [
"Apache-2.0"
] | permissive | WojciechKarpiel/lean4 | 7f89706b8e3c1f942b83a2c91a3a00b05da0e65b | f6e1314fa08293dea66a329e05b6c196a0189163 | refs/heads/master | 1,686,633,402,214 | 1,625,821,189,000 | 1,625,821,258,000 | 384,640,886 | 0 | 0 | Apache-2.0 | 1,625,903,617,000 | 1,625,903,026,000 | null | UTF-8 | Lean | false | false | 37,013 | lean | /-
Copyright (c) 2018 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Data.KVMap
import Lean.Level
namespace Lean
inductive Literal where
| natVal (val : Nat)
| strVal (val : String)
deriving Inhabited, BEq... |
cb69b4bbc28d859cc6bd5258e74bea98c547f625 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/analysis/normed/group/SemiNormedGroup.lean | c06355e1fe803f1e922bd38f3ce4cb887f25d60a | [
"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 | 6,891 | lean | /-
Copyright (c) 2021 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Riccardo Brasca
-/
import analysis.normed.group.hom
import category_theory.limits.shapes.zero_morphisms
import category_theory.concrete_category.bundled_hom
import cate... |
19e070a0834b67a5dfe17e4c1a1c965b9287edeb | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/category_theory/discrete_category.lean | 0a65babd149c6291fe721e5a20eebfbe96565074 | [
"Apache-2.0"
] | permissive | agjftucker/mathlib | d634cd0d5256b6325e3c55bb7fb2403548371707 | 87fe50de17b00af533f72a102d0adefe4a2285e8 | refs/heads/master | 1,625,378,131,941 | 1,599,166,526,000 | 1,599,166,526,000 | 160,748,509 | 0 | 0 | Apache-2.0 | 1,544,141,789,000 | 1,544,141,789,000 | null | UTF-8 | Lean | false | false | 4,614 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Stephen Morgan, Scott Morrison, Floris van Doorn
-/
import category_theory.eq_to_hom
namespace category_theory
universes v₁ v₂ u₁ u₂ -- declare the `v`'s first; see `category_theory.... |
28c5ea5f7e0ede240e2c15814a8d3a8530281965 | 5fbbd711f9bfc21ee168f46a4be146603ece8835 | /lean/natural_number_game/function/2.lean | eb4503c3d0470339f16ac8e6d64c68b9887a87f4 | [
"LicenseRef-scancode-warranty-disclaimer"
] | no_license | goedel-gang/maths | 22596f71e3fde9c088e59931f128a3b5efb73a2c | a20a6f6a8ce800427afd595c598a5ad43da1408d | refs/heads/master | 1,623,055,941,960 | 1,621,599,441,000 | 1,621,599,441,000 | 169,335,840 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 92 | lean | example : mynat → mynat :=
-- can this be done without intro?
intro n,
exact 0,
end
|
50f0904c3763d39f3add1e7a2d53430b048e8505 | 2c096fdfecf64e46ea7bc6ce5521f142b5926864 | /src/Lean/Elab/Syntax.lean | 641f739e4afdd5ac55fa091e419cd01ae02627ca | [
"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 | Kha/lean4 | 1005785d2c8797ae266a303968848e5f6ce2fe87 | b99e11346948023cd6c29d248cd8f3e3fb3474cf | refs/heads/master | 1,693,355,498,027 | 1,669,080,461,000 | 1,669,113,138,000 | 184,748,176 | 0 | 0 | Apache-2.0 | 1,665,995,520,000 | 1,556,884,930,000 | Lean | UTF-8 | Lean | false | false | 18,184 | 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.Elab.Command
import Lean.Parser.Syntax
import Lean.Elab.Util
namespace Lean.Elab.Term
/--
Expand `optional «precedence»` where
«precedence» :=... |
de2953e975473759696dbc3e2b3c6ca22dd30a19 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/1688.lean | 5c229c578182d422e101c98de2bf4ed9fe302557 | [
"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 | 95 | lean | example : (1 + 1 : ℤ) = 2 :=
begin
change (1 + 1 : ℤ) with 2, -- goal : 2 = 2
refl
end
|
90f9719f36a1b1c886aefc73ebcda3ed44c0b997 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/subobject/basic.lean | c32132d2d2711abf98be46abc4a21e8c4d7929ee | [
"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 | 24,300 | lean | /-
Copyright (c) 2020 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta, Scott Morrison
-/
import category_theory.subobject.mono_over
import category_theory.skeletal
import category_theory.concrete_category.basic
import tactic.apply_fun
import t... |
b97bfce496271ef1e94b54df364e92abb3e93748 | 4f643cce24b2d005aeeb5004c2316a8d6cc7f3b1 | /src/for_mathlib/order.lean | 7528f90a9dfa2cd8725db52d654933093f00866f | [] | 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 | 29 | lean | import order.bounded_lattice
|
cc4e055bdac18a2500788604cf7922ca4933caf9 | 1dd482be3f611941db7801003235dc84147ec60a | /src/data/list/basic.lean | e509d84f0f5a6e012a316a9104d24d397b5966a2 | [
"Apache-2.0"
] | permissive | sanderdahmen/mathlib | 479039302bd66434bb5672c2a4cecf8d69981458 | 8f0eae75cd2d8b7a083cf935666fcce4565df076 | refs/heads/master | 1,587,491,322,775 | 1,549,672,060,000 | 1,549,672,060,000 | 169,748,224 | 0 | 0 | Apache-2.0 | 1,549,636,694,000 | 1,549,636,694,000 | null | UTF-8 | Lean | false | false | 188,164 | 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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.