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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0ce89c2804ae3c765df5e7b69d070108146f3d1a | d1a52c3f208fa42c41df8278c3d280f075eb020c | /stage0/src/Lean/Util.lean | efa27dd82672f6adc26c151025391e0b21b387e6 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | cipher1024/lean4 | 6e1f98bb58e7a92b28f5364eb38a14c8d0aae393 | 69114d3b50806264ef35b57394391c3e738a9822 | refs/heads/master | 1,642,227,983,603 | 1,642,011,696,000 | 1,642,011,696,000 | 228,607,691 | 0 | 0 | Apache-2.0 | 1,576,584,269,000 | 1,576,584,268,000 | null | UTF-8 | Lean | false | false | 702 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Util.CollectFVars
import Lean.Util.CollectLevelParams
import Lean.Util.CollectMVars
import Lean.Util.FindMVar
import Lean.Util.FindLevelMVar
imp... |
bd93ef8faba6947e5db70cdbbed8346e9f3415af | 32025d5c2d6e33ad3b6dd8a3c91e1e838066a7f7 | /stage0/src/Lean/Elab/BuiltinNotation.lean | dc86d257356ac8abc6fff0ded61462a5a8503f83 | [
"Apache-2.0"
] | permissive | walterhu1015/lean4 | b2c71b688975177402758924eaa513475ed6ce72 | 2214d81e84646a905d0b20b032c89caf89c737ad | refs/heads/master | 1,671,342,096,906 | 1,599,695,985,000 | 1,599,695,985,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 12,026 | 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.Elab.Term
import Lean.Elab.Quotation
import Lean.Elab.SyntheticMVars
namespace Lean
namespace Elab
namespace Term
open Meta
@[builtinMacro Le... |
3296f8924d4901628ac7c925a7eb78ea552696f2 | ef4d3feecef33d1c1b4bd3a023b85e6a58f9e708 | /theorem-proving-in-lean/ch2/Exercises.lean | aa9e66198e396dcdaf9e93c850483a8c96ee723a | [] | no_license | MikeMKH/kata | 1b7da1b8d2cc115c912f2b06b583a8e675a449e1 | 305b054a37517dbe4d09545d41f024937f536c20 | refs/heads/master | 1,585,594,368,426 | 1,542,835,119,000 | 1,542,835,119,000 | 16,891,298 | 0 | 0 | null | 1,542,835,120,000 | 1,392,575,890,000 | Racket | UTF-8 | Lean | false | false | 1,742 | lean | -- https://leanprover.github.io/theorem_proving_in_lean/dependent_type_theory.html
-- 1
def double : ℕ → ℕ := λ x, x + x
def square : ℕ → ℕ := λ x, x * x
def do_twice : (ℕ → ℕ) → ℕ → ℕ := λ f x, f (f x)
#eval do_twice double 2
def mul_by_8 : ℕ → ℕ := λ x, x * (do_twice double 2)
#eval mul_by_8 2
def Do_Twice : ((ℕ... |
9b7c8b557fdfc6abcdc98134dd06c07ed2affe6b | 4727251e0cd73359b15b664c3170e5d754078599 | /src/data/matrix/notation.lean | d6d5bf6659a7def76bb3b9109d82671598ebc23e | [
"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 | 11,275 | lean | /-
Copyright (c) 2020 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen
-/
import data.matrix.basic
import data.fin.vec_notation
import tactic.fin_cases
import algebra.big_operators.fin
/-!
# Matrix and vector notation
This file includes `simp` ... |
4ccb9e1fae1d4523695090d4ed9967c6e2eef6c4 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/group_theory/submonoid/default.lean | d87fa65c1a5242084338eed86a1bbe5b35ea0101 | [] | 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 | 153 | lean | import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.group_theory.submonoid.membership
import Mathlib.PostPort
namespace Mathlib
|
1ef38b8bb2b67daae54dd594265cd9cc250e9b6e | 367134ba5a65885e863bdc4507601606690974c1 | /src/topology/tactic.lean | c0d8fc7fc4a9bdc09544373ab4fc307653aec67c | [
"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 | 4,154 | lean | /-
Copyright (c) 2020 Reid Barton. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Reid Barton
-/
import tactic.auto_cases
import tactic.tidy
import tactic.with_local_reducibility
import tactic.show_term
import topology.basic
/-!
# Tactics for topology
Currently we hav... |
c1a89d8cd3e3a1e603c3ca7f0f33b6216ff29daa | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/order/filter/archimedean.lean | 11cb64425b1f3fc15e68db2061ce298828e91c6d | [
"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 | 9,799 | lean | /-
Copyright (c) 2019 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 algebra.order.archimedean
import order.filter.at_top_bot
/-!
# `at_top` filter and archimedean (semi)rings/fields
In this file we prove that... |
6a13edbbc812d2879c9ab12548637a3d7592e8fc | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/data/set/intervals/image_preimage.lean | 093143dcb71fb89e51e6cadb4d0735b4ea754392 | [
"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 | 11,710 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov, Patrick Massot
-/
import data.set.intervals.basic
import data.equiv.mul_add
import algebra.pointwise
/-!
# (Pre)images of intervals
In this file we prove a bu... |
7829f0b03f7a4644c915ba12137fbaa6ae871b51 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/mathport18.lean | 23991118f8fef6264e217336640643f185631dff | [
"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 | 189 | lean | def foo := @id
def bar := @id
theorem foo_eq {α} (x : α) : foo x = bar x := rfl
example {p : Nat → Prop} {x} (h : x = bar 1) : p x := by
simp [*, ← foo_eq]
show p (foo 1)
admit
|
a1fdc0578a014486b09947c9903c9a4a098c7844 | 0845ae2ca02071debcfd4ac24be871236c01784f | /library/init/data/hashmap/default.lean | 868f9566162aba8f4771bad561d683ccaef1acdb | [
"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 | 202 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
prelude
import init.data.hashmap.basic
|
35cdc88ce97d9529ce343c19915d37eea59bcd06 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/hott/class_loop.hlean | e0a11ce250d5cc11d3d3a77fadc34500ab0396dd | [
"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 | 605 | hlean | constant (A : Type₁)
constant (hom : A → A → Type₁)
constant (id' : Πa, hom a a)
structure is_iso [class] {a b : A} (f : hom a b) :=
(inverse : hom b a)
open is_iso
set_option pp.metavar_args true
set_option pp.purify_metavars false
definition inverse_id [instance] {a : A} : is_iso (id' a) :=
is_iso.mk (id' a) (id' ... |
72f0378637c52e8cf4a0ffbb334c82542224f1de | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/playground/cmdparsertest1.lean | 31e661630caf6a1d64a6b7ab2413f1a361180e60 | [
"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,197 | lean | import Init.Lean.Parser.Command
open Lean
open Lean.Parser
def testParser (input : String) : IO Unit :=
do
env ← mkEmptyEnvironment;
cmdPTables ← builtinCommandParsingTable.get;
stx ← IO.ofExcept $ runParser env cmdPTables input "<input>" "command";
IO.println stx
def test (is : List String) : IO Unit :=
is.mfor $ fu... |
d624f4b3f1056727ab522062da30550f02bdd9df | ebf7140a9ea507409ff4c994124fa36e79b4ae35 | /src/exercises_sources/thursday/category_theory/exercise1.lean | 7fb46cc0f38f225e27c3f2dd362ad5cc5f57d953 | [] | no_license | fundou/lftcm2020 | 3e88d58a92755ea5dd49f19c36239c35286ecf5e | 99d11bf3bcd71ffeaef0250caa08ecc46e69b55b | refs/heads/master | 1,685,610,799,304 | 1,624,070,416,000 | 1,624,070,416,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 718 | lean | import category_theory.isomorphism
import category_theory.yoneda
open category_theory
open opposite
variables {C : Type*} [category C]
/-! Hint 1:
`yoneda` is set up so that `(yoneda.obj X).obj (op Y) = (Y ⟶ X)`
(we need to write `op Y` to explicitly move `Y` to the opposite category).
-/
/-! Hint 2:
If you have a ... |
4ed16c763823e3de30b696e7a61836cb87cae68d | 19cc34575500ee2e3d4586c15544632aa07a8e66 | /src/linear_algebra/multilinear.lean | dc56bebe045f1b35dd3761acfd5e1b13c3115613 | [
"Apache-2.0"
] | permissive | LibertasSpZ/mathlib | b9fcd46625eb940611adb5e719a4b554138dade6 | 33f7870a49d7cc06d2f3036e22543e6ec5046e68 | refs/heads/master | 1,672,066,539,347 | 1,602,429,158,000 | 1,602,429,158,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 34,208 | 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 linear_algebra.basic
import tactic.omega
import data.fintype.sort
/-!
# Multilinear maps
We define multilinear maps as maps from `Π(i : ι), M₁ i` to `M... |
c568298420c81fddde9809c4537918e88b91c82b | fffbc47930dc6615e66ece42324ce57a21d5b64b | /src/category_theory/instances/CommRing/basic.lean | 1ff3904d92664a3d54b77441d2cb6b070352e689 | [
"Apache-2.0"
] | permissive | skbaek/mathlib | 3caae8ae413c66862293a95fd2fbada3647b1228 | f25340175631cdc85ad768a262433f968d0d6450 | refs/heads/master | 1,588,130,123,636 | 1,558,287,609,000 | 1,558,287,609,000 | 160,935,713 | 0 | 0 | Apache-2.0 | 1,544,271,146,000 | 1,544,271,146,000 | null | UTF-8 | Lean | false | false | 3,376 | lean | /- Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Johannes Hölzl
Introduce CommRing -- the category of commutative rings.
-/
import category_theory.instances.Mon.basic
import category_theory.fully_faithful
import alg... |
c47bb47e32ada968cae78c87dad49e1df9ac5e32 | ba306bac106b8f27befb2a800f4357237f86c760 | /lean/love06_monads_demo.lean | 52a07e010c445b3bcc769727662d624b464ae6e1 | [] | no_license | qyqnl/logical_verification_2020 | 406aa4cc47797501275ea07de5d6f59f01e977d0 | 17dff35b56336acb671ddfb36871f98475bc0b96 | refs/heads/master | 1,672,501,336,112 | 1,603,724,260,000 | 1,603,724,260,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 11,480 | lean | import .lovelib
/- # LoVe Demo 6: Monads
We take a look at an important functional programming abstraction: monads.
Monads generalize computation with side effects. Haskell has shown that monads
can be used very successful to write imperative programs. For us, they are
interesting in their own right and for two more... |
a452ee874c34d24a642d89c76262ed36860d51af | bb31430994044506fa42fd667e2d556327e18dfe | /src/algebra/ring/defs.lean | 08afb5f438d3d0842a0421115c1cba296b03245d | [
"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,847 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Floris van Doorn, Yury Kudryashov, Neil Strickland
-/
import algebra.group.basic
import algebra.group_with_zero.defs
import data.int.cast.defs
/-!
# S... |
75da9ed70a6425feb27eb3c2957b0dd7454e79b7 | 26b8b0964ca8e1c2e203585ba5940f83fe05e48a | /src/tidy/force.lean | 7d79533ca3102bc8d8094544ed98772b2f1692ca | [] | no_license | jcommelin/lean-tidy | ef3cd32a3804221d93f0dff9e180bb2c52f4b143 | 9cecf497e90db64b5ea140ad6ae1603976dcd402 | refs/heads/master | 1,585,129,919,276 | 1,533,512,680,000 | 1,533,512,680,000 | 143,677,361 | 0 | 0 | null | 1,616,803,481,000 | 1,533,530,576,000 | Lean | UTF-8 | Lean | false | false | 407 | 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 force { α : Type } (t : tactic α) : tactic α :=
do
goals ← get_goals,
result ← t,
goals' ← get_goals,
guard (goals ≠ goals') <|> fa... |
e0c496caedbebb7021f3b8bcaef434f0182594d7 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /hott/algebra/ring.hlean | ce8105cebe1587d0546146a80faf19f96a8b5df9 | [
"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 | 18,390 | hlean | /-
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
Structures with multiplicative and additive components, including semirings, rings, and fields.
The development is modeled after Isabelle's library.
-/... |
e8ee19df84b2d886a3c86fc645a0bf1dae83414a | 4fa161becb8ce7378a709f5992a594764699e268 | /src/algebra/module.lean | d7cbe86d151d65f1a843031c7eb2aa3e9ca464e1 | [
"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 | 29,053 | lean | /-
Copyright (c) 2015 Nathaniel Thomas. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nathaniel Thomas, Jeremy Avigad, Johannes Hölzl, Mario Carneiro
-/
import group_theory.group_action
/-!
# Modules over a ring
In this file we define
* `semimodule R M` : an additi... |
8ccc1542264e6e28cb701084a76bc1f0b5a74c11 | fe84e287c662151bb313504482b218a503b972f3 | /src/homotopy/itloc.lean | 2d357f228bc870db1aa52120a536a79046641fef | [] | no_license | NeilStrickland/lean_lib | 91e163f514b829c42fe75636407138b5c75cba83 | 6a9563de93748ace509d9db4302db6cd77d8f92c | refs/heads/master | 1,653,408,198,261 | 1,652,996,419,000 | 1,652,996,419,000 | 181,006,067 | 4 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 71,258 | lean | /-
Copyright (c) 2019 Neil Strickland. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Neil Strickland
This file formalises part of the paper "Iterated chromatic
localization" by Nicola Bellumat and Neil Strickland. We have
formalised all of the combinatorial conten... |
280fc2626a128311524989cb60e78a911db26ae7 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/prod/lex.lean | a0bfe98ca03ffd3464ada98ee38a418bc52057e0 | [
"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,263 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Minchao Wu
-/
import order.bounded_order
/-!
# Lexicographic order
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> https://github.com/leanprover-community/mathlib4/pull/... |
fe9007ee35915a7f7b9812191ad19cbbe37de267 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebra/euclidean_domain.lean | f0c264783931ac77a3be9204296f62daa2bcbfe6 | [
"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 | 18,232 | lean | /-
Copyright (c) 2018 Louis Carlin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Louis Carlin, Mario Carneiro
-/
import data.int.basic
import algebra.field.basic
/-!
# Euclidean domains
This file introduces Euclidean domains and provides the extended Euclidean alg... |
168b082fe0eae81c111dc9d412fb472afb623080 | d1bbf1801b3dcb214451d48214589f511061da63 | /src/analysis/asymptotics.lean | 11ab57b5eaf1cd73b675b8b41fe3ad1f44d2e81c | [
"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 | 53,792 | lean | /-
Copyright (c) 2019 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Yury Kudryashov
-/
import analysis.normed_space.basic
import topology.local_homeomorph
/-!
# Asymptotics
We introduce these relations:
* `is_O_with c f g l` : "f is bi... |
b7eff06c6f138fd975c78ac38200b8ac1b16ab14 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/representation_theory/character.lean | 07ddd2fbf264d627759935446d38e10ad31b1574 | [
"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,441 | lean | /-
Copyright (c) 2022 Antoine Labelle. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Antoine Labelle
-/
import representation_theory.fdRep
import linear_algebra.trace
import representation_theory.invariants
/-!
# Characters of representations
> THIS FILE IS SYNCHRON... |
0bf548c9048ec2b3c4e3b1c7105d4cd6c524cd7c | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/order/bounds.lean | b1a2e3681b28ffa9d83dd2d599ba6db7ce0d610e | [
"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 | 52,804 | 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 data.set.intervals.basic
/-!
# Upper / lower bounds
In this file we define:
* `upper_bounds`, `lower_bounds` : the set of upper bounds (re... |
0de9104342f9cd69716c0fc50b41726276a40b9c | 1fbca480c1574e809ae95a3eda58188ff42a5e41 | /test/tactic/basic.lean | 1ef5e6be137f9916cad59f33b8606d099bbb7c6a | [] | no_license | unitb/lean-lib | 560eea0acf02b1fd4bcaac9986d3d7f1a4290e7e | 439b80e606b4ebe4909a08b1d77f4f5c0ee3dee9 | refs/heads/master | 1,610,706,025,400 | 1,570,144,245,000 | 1,570,144,245,000 | 99,579,229 | 5 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,006 | lean |
import util.meta.tactic
open tactic
section
variables x y z : ℕ
include x y z
example : ℕ :=
begin
clear_except x,
(do xs ← tactic.local_context, x ← get_local `x, assert (xs = [x]), return ()),
exact x
end
end
example {a b : Prop} (h₀ : a → b) (h₁ : a) : b :=
begin
apply_assumption,
apply_assumption,
en... |
029e48adf12115a7477a999e1909534896e0d80f | 59a4b050600ed7b3d5826a8478db0a9bdc190252 | /src/category_theory/universal/types.lean | 642fa1b8454358222c1c07f33b96897b5c89af89 | [] | no_license | rwbarton/lean-category-theory | f720268d800b62a25d69842ca7b5d27822f00652 | 00df814d463406b7a13a56f5dcda67758ba1b419 | refs/heads/master | 1,585,366,296,767 | 1,536,151,349,000 | 1,536,151,349,000 | 147,652,096 | 0 | 0 | null | 1,536,226,960,000 | 1,536,226,960,000 | null | UTF-8 | Lean | false | false | 4,270 | lean | import category_theory.limits
universe u
open category_theory
open category_theory.limits
namespace category_theory.universal.types
local attribute [forward] fork.w square.w
instance : has_terminal_object.{u+1 u} (Type u) :=
{ terminal := punit }
instance : has_binary_products.{u+1 u} (Type u) :=
{ prod := λ Y ... |
de13e667d5a89b26cdf0e3dca11b20190c502feb | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/field_theory/polynomial_galois_group.lean | cb29cbc08bc77b5dd067d12071a5431d292f9e0b | [
"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 | 21,720 | lean | /-
Copyright (c) 2020 Thomas Browning, Patrick Lutz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Thomas Browning, Patrick Lutz
-/
import analysis.complex.polynomial
import field_theory.galois
import group_theory.perm.cycle.type
/-!
# Galois Groups of Polynomials
I... |
9adff4cf81adccf2685c2ff4f2101ce8e48040bf | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/data/mv_polynomial/basic.lean | aa5dd0f7aae240c3a21525840397d75bcbf4ee58 | [
"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 | 36,207 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Johan Commelin, Mario Carneiro
-/
import data.polynomial.eval
/-!
# Multivariate polynomials
This file defines polynomial rings over a base ring (or even semiring),
... |
2d7a978074efd5509165f473096e4d384dc8ea2e | 69bc7d0780be17e452d542a93f9599488f1c0c8e | /11-05-2019.lean | 3f42510b6591d7b0e11b874a2a4fbb9d887e83df | [] | no_license | joek13/cs2102-notes | b7352285b1d1184fae25594f89f5926d74e6d7b4 | 25bb18788641b20af9cf3c429afe1da9b2f5eafb | refs/heads/master | 1,673,461,162,867 | 1,575,561,090,000 | 1,575,561,090,000 | 207,573,549 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,501 | lean | -- propositions
-- proofs
-- predicates
-- sets
-- relations
-- equality
-- connectives
-- not
-- and
-- or
-- proposition
inductive nifty_was_a_cat : Prop
-- proof
| there_are_pictures_of_nifty
| we_remember_nifty_fondly
inductive pet : Type
| nifty
| tom
| cheese
| kevin
open pet
inductiv... |
7816e302143cc6b458891cafa185974d708c9bfb | 41ebf3cb010344adfa84907b3304db00e02db0a6 | /uexp/src/uexp/rules/transitiveInferenceAggregate.lean | 85ef59a4fded47f040da7c356b296ae18861f6e5 | [
"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,896 | lean | import ..sql
import ..tactics
import ..u_semiring
import ..extra_constants
import ..meta.cosette_tactics
open Expr
open Proj
open Pred
open SQL
open tree
notation `int` := datatypes.int
constant integer_1 : const int
constant integer_7 : const int
lemma rule:
forall ( Γ scm_t scm_account scm_bonus scm_dept sc... |
8ca2caddc5701d7104326f548f54ca3e14b5cf30 | 80746c6dba6a866de5431094bf9f8f841b043d77 | /src/category_theory/functor_category.lean | 4233f1f745f7416cd08b36c8c59a28fb43b2c619 | [
"Apache-2.0"
] | permissive | leanprover-fork/mathlib-backup | 8b5c95c535b148fca858f7e8db75a76252e32987 | 0eb9db6a1a8a605f0cf9e33873d0450f9f0ae9b0 | refs/heads/master | 1,585,156,056,139 | 1,548,864,430,000 | 1,548,864,438,000 | 143,964,213 | 0 | 0 | Apache-2.0 | 1,550,795,966,000 | 1,533,705,322,000 | Lean | UTF-8 | Lean | false | false | 2,719 | 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_theory.natural_transformation
namespace category_theory
universes v₁ v₂ v₃ u₁ u₂ u₃ -- declare the `v`'s first; see... |
1a36bb339f68c36dcf31f80bd6a8524ff062e474 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/analysis/inner_product_space/lax_milgram.lean | 85a09de31cf8508c5dca61aea87c50c8b84c4c1d | [
"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,484 | lean | /-
Copyright (c) 2022 Daniel Roca González. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Daniel Roca González
-/
import analysis.inner_product_space.projection
import analysis.inner_product_space.dual
import analysis.normed_space.banach
import analysis.normed_space.o... |
2f1ebbcbbb793a6edc7aff42839858c056b06647 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/number_theory/sum_four_squares.lean | c9f5476093a622a813a78edd78b37015ea520011 | [
"Apache-2.0"
] | permissive | urkud/mathlib | eab80095e1b9f1513bfb7f25b4fa82fa4fd02989 | 6379d39e6b5b279df9715f8011369a301b634e41 | refs/heads/master | 1,658,425,342,662 | 1,658,078,703,000 | 1,658,078,703,000 | 186,910,338 | 0 | 0 | Apache-2.0 | 1,568,512,083,000 | 1,557,958,709,000 | Lean | UTF-8 | Lean | false | false | 11,862 | lean | /-
Copyright (c) 2019 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import algebra.group_power.identities
import data.zmod.basic
import field_theory.finite.basic
import data.int.parity
import data.fintype.card
/-!
# Lagrange's four squa... |
79ab165364080270eda480d468466933dd74921e | 94e33a31faa76775069b071adea97e86e218a8ee | /src/topology/instances/matrix.lean | 2ecca9e4fa0664e7cca561e777bc9757f250a6ab | [
"Apache-2.0"
] | permissive | urkud/mathlib | eab80095e1b9f1513bfb7f25b4fa82fa4fd02989 | 6379d39e6b5b279df9715f8011369a301b634e41 | refs/heads/master | 1,658,425,342,662 | 1,658,078,703,000 | 1,658,078,703,000 | 186,910,338 | 0 | 0 | Apache-2.0 | 1,568,512,083,000 | 1,557,958,709,000 | Lean | UTF-8 | Lean | false | false | 18,456 | lean | /-
Copyright (c) 2021 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash, Eric Wieser
-/
import linear_algebra.determinant
import topology.algebra.infinite_sum
import topology.algebra.ring
import topology.algebra.star
/-!
# Topological properties ... |
83af2e3baa3abc3e390d6a09396384249ba87117 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/data/polynomial/integral_normalization.lean | 5199de1781956d85be0853b667daa23d026a0d7d | [
"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 | 5,305 | lean |
/-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Johannes Hölzl, Scott Morrison, Jens Wagemaker
-/
import data.polynomial.algebra_map
import data.polynomial.monic
/-!
# Theory of monic polynomials
We define `integral_n... |
4be4ab71272ebcd8cc081a604f328b85b093c9e2 | cc5bb0a18c45fa529fc8bf0365b1fbf48464c5a8 | /library/init/data/nat/lemmas.lean | 5d66a047928359a04883c7a3be72198b8c3610c0 | [
"Apache-2.0"
] | permissive | mk12/lean | 6bb58b9f3cfe312236b41779478d345399f00918 | 092fc89333160661c4c5a6295f3054cafff4341e | refs/heads/master | 1,609,531,450,083 | 1,501,275,267,000 | 1,501,278,025,000 | 98,760,144 | 0 | 0 | null | 1,501,364,485,000 | 1,501,364,485,000 | null | UTF-8 | Lean | false | false | 50,768 | 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, Jeremy Avigad
-/
prelude
import init.data.nat.basic init.data.nat.div init.data.nat.pow init.meta init.algebra.functions
universes u
namespace nat
attribute ... |
6d50415e4e17a868e675356491e7ecf22c588868 | 737dc4b96c97368cb66b925eeea3ab633ec3d702 | /stage0/src/Lean/Parser/Syntax.lean | 1d8750f9e29aa7627bb6d89bfa3823dedd77cf46 | [
"Apache-2.0"
] | permissive | Bioye97/lean4 | 1ace34638efd9913dc5991443777b01a08983289 | bc3900cbb9adda83eed7e6affeaade7cfd07716d | refs/heads/master | 1,690,589,820,211 | 1,631,051,000,000 | 1,631,067,598,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,035 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Sebastian Ullrich
-/
import Lean.Parser.Command
import Lean.Parser.Tactic
namespace Lean
namespace Parser
builtin_initialize
registerBuiltinParserAttribut... |
4ed1c0f1d045a0c8c80782578fd363aaa1f063ce | ae1e94c332e17c7dc7051ce976d5a9eebe7ab8a5 | /stage0/src/Init/Meta.lean | 88290d500b606369b8a82cb6965c618a12b3aa49 | [
"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 | 28,467 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura and Sebastian Ullrich
Additional goodies for writing macros
-/
prelude
import Init.Data.Array.Basic
namespace Lean
@[extern c inline "lean_box(LEAN_VERSION_... |
4c5fa0087198aa69417715c840a4ce2185fc8560 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/category_theory/category/Kleisli.lean | 204325a09cff360a3757b2e192d4c8d78b3457ae | [
"Apache-2.0"
] | permissive | stjordanis/mathlib | 51e286d19140e3788ef2c470bc7b953e4991f0c9 | 2568d41bca08f5d6bf39d915434c8447e21f42ee | refs/heads/master | 1,631,748,053,501 | 1,627,938,886,000 | 1,627,938,886,000 | 228,728,358 | 0 | 0 | Apache-2.0 | 1,576,630,588,000 | 1,576,630,587,000 | null | UTF-8 | Lean | false | false | 1,659 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
The Kleisli construction on the Type category
TODO: generalise this to work with category_theory.monad
-/
import category_theory.category
/-!
# The Kleisli construction on ... |
ca4a96ac21e111690e50c2a8af45321725e6fe4e | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch2/ex0201.lean | 6778f1dda98fb80f104d89f755977b40253c0365 | [] | no_license | Ailrun/Theorem_Proving_in_Lean | ae6a23f3c54d62d401314d6a771e8ff8b4132db2 | 2eb1b5caf93c6a5a555c79e9097cf2ba5a66cf68 | refs/heads/master | 1,609,838,270,467 | 1,586,846,743,000 | 1,586,846,743,000 | 240,967,761 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 221 | lean | #check nat
#check bool
#check nat → bool
#check nat × bool
#check nat → nat
#check nat × nat → nat
#check nat → nat → nat
#check nat → (nat → nat)
#check nat → nat → bool
#check (nat → nat) → nat
|
5fb81a864f328ed53d814ce7772e87ba886d3884 | 969dbdfed67fda40a6f5a2b4f8c4a3c7dc01e0fb | /src/field_theory/polynomial_galois_group.lean | 26955e7676afbabd6021f5911d416d378f730e2b | [
"Apache-2.0"
] | permissive | SAAluthwela/mathlib | 62044349d72dd63983a8500214736aa7779634d3 | 83a4b8b990907291421de54a78988c024dc8a552 | refs/heads/master | 1,679,433,873,417 | 1,615,998,031,000 | 1,615,998,031,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 14,625 | lean | /-
Copyright (c) 2020 Thomas Browning and Patrick Lutz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Thomas Browning and Patrick Lutz
-/
import field_theory.galois
/-!
# Galois Groups of Polynomials
In this file we introduce the Galois group of a polynomial, defin... |
0af6fb346846738bebba3d691489708b9fc26729 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebraic_geometry/Gamma_Spec_adjunction.lean | ebf8d621b59e427c01f6b1e340af7d9d33cf65fe | [
"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,141 | lean | /-
Copyright (c) 2021 Junyan Xu. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Junyan Xu
-/
import algebraic_geometry.Scheme
import category_theory.adjunction.limits
import category_theory.adjunction.reflective
/-!
# Adjunction between `Γ` and `Spec`
We define the a... |
32f1cddedb9a0b383fdc7b00f08ec4181a2c6f9f | ebb7367fa8ab324601b5abf705720fd4cc0e8598 | /homotopy/spherical_fibrations.hlean | a53c6ea4ab80b586862c62fe6afb61b53d871ccf | [
"Apache-2.0"
] | permissive | radams78/Spectral | 3e34916d9bbd0939ee6a629e36744827ff27bfc2 | c8145341046cfa2b4960ef3cc5a1117d12c43f63 | refs/heads/master | 1,610,421,583,830 | 1,481,232,014,000 | 1,481,232,014,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,795 | hlean | import homotopy.join homotopy.smash
open eq equiv trunc function bool join sphere sphere_index sphere.ops prod
open pointed sigma smash is_trunc
namespace spherical_fibrations
/- classifying type of spherical fibrations -/
definition BG (n : ℕ) : Type₁ :=
Σ(X : Type₀), ∥ X ≃ S n..-1 ∥
definition pointed_BG ... |
b3c883eed080b4cfb4ee08596ccc7e14707129ef | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/polynomial/monic.lean | ef120b0243466dc13f8f4e7d19609fa3f8b799c0 | [
"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 | 17,098 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Johannes Hölzl, Scott Morrison, Jens Wagemaker
-/
import data.polynomial.reverse
import algebra.regular.smul
/-!
# Theory of monic polynomials
We give several tools for p... |
167c8c31cd3f6bf3554193815a52f9912111b362 | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/group_theory/free_abelian_group.lean | dab1946d3180e42e483f4444d64960c22c47adfc | [
"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 | 8,414 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
Free abelian groups as abelianization of free groups.
-/
import algebra.pi_instances
import group_theory.free_group
import group_theory.abelianization
universes u v
variables (... |
3b91d339f5e158d530bc277182a9f6e87320941d | cc060cf567f81c404a13ee79bf21f2e720fa6db0 | /lean/20170621-finite.lean | fc60436afe3c55a18ac496a9d4e3aa4ab16a7f5b | [
"Apache-2.0"
] | permissive | semorrison/proof | cf0a8c6957153bdb206fd5d5a762a75958a82bca | 5ee398aa239a379a431190edbb6022b1a0aa2c70 | refs/heads/master | 1,610,414,502,842 | 1,518,696,851,000 | 1,518,696,851,000 | 78,375,937 | 2 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 731 | lean | structure {u v} Bijection ( P : Type u ) ( Q : Type v ) :=
( function : P → Q )
( inverse : Q → P )
( witness_1 : function ∘ inverse = id )
( witness_2 : inverse ∘ function = id )
class Finite ( α : Type ) :=
( n : nat )
( bijection : Bijection α (fin n) )
inductive Two : Type
| _0 : Two
| _1 : Two
inst... |
2af1d702dbfd574abeca5facc2976ebd9f6d8124 | f7315930643edc12e76c229a742d5446dad77097 | /hott/init/reserved_notation.hlean | 2207e12f8e53b701fc08efee853265b69a3ec67a | [
"Apache-2.0"
] | permissive | bmalehorn/lean | 8f77b762a76c59afff7b7403f9eb5fc2c3ce70c1 | 53653c352643751c4b62ff63ec5e555f11dae8eb | refs/heads/master | 1,610,945,684,489 | 1,429,681,220,000 | 1,429,681,449,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,414 | hlean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: init.reserved_notation
Authors: Leonardo de Moura
-/
prelude
import init.datatypes
notation `assume` binders `,` r:(scoped f, f) := r
notation `take` binders `,` r:(scoped f... |
c79cc301a43f933f2ef1ab311789687431d71017 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/data/set/function.lean | 3751674f66ac4e08b6fb156692c999f9ae13c0f3 | [
"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 | 49,070 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Andrew Zipperer, Haitao Zhang, Minchao Wu, Yury Kudryashov
-/
import data.set.prod
import logic.function.conjugate
/-!
# Functions over sets
## Main definitions
### Pr... |
b95454f5c1d17c0d964178b37c19aa06add241b4 | 3dd1b66af77106badae6edb1c4dea91a146ead30 | /library/standard/pair.lean | 186f6636ec1d44043365d797124782991e034da4 | [
"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 | 1,377 | lean | -- Copyright (c) 2014 Microsoft Corporation. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Author: Leonardo de Moura
import logic
namespace pair
inductive pair (A : Type) (B : Type) : Type :=
| mk_pair : A → B → pair A B
section
parameter {A : Type}
parameter {B : ... |
ede7eed4f684ff488355a435b80baa39d84f0294 | c055f4b7c29cf1aac2223bd8c1ac8d181a7c6447 | /src/categories/types/default.lean | 11d9ca9c3bfa1dfc778009a2c7a86a793368e8bf | [
"Apache-2.0"
] | permissive | rwbarton/lean-category-theory-pr | 77207b6674eeec1e258ec85dea58f3bff8d27065 | 591847d70c6a11c4d5561cd0eaf69b1fe85a70ab | refs/heads/master | 1,584,595,111,303 | 1,528,029,041,000 | 1,528,029,041,000 | 135,919,126 | 0 | 0 | null | 1,528,041,805,000 | 1,528,041,805,000 | null | UTF-8 | Lean | false | false | 3,040 | 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
import ..isomorphism
import ..functor
import ..natural_transformation
namespace categories.types
open categories
open categori... |
d21723fef5eaa137c6baa52fad76b42f2ce7a7f0 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/order/concept.lean | feea7695528d41c7f806a5db21c889ec975dc9bb | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 11,012 | lean | /-
Copyright (c) 2022 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies
-/
import data.set.lattice
/-!
# Formal concept analysis
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding PR to mathlib4.
Thi... |
274712bae5175e8202a9bd1473b30517edcac71d | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/tactic/derive_inhabited.lean | 2f407a5976a1b03d6fe22413f392034e3c40257e | [
"Apache-2.0"
] | permissive | AntoineChambert-Loir/mathlib | 64aabb896129885f12296a799818061bc90da1ff | 07be904260ab6e36a5769680b6012f03a4727134 | refs/heads/master | 1,693,187,631,771 | 1,636,719,886,000 | 1,636,719,886,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,376 | lean | /-
Copyright (c) 2020 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner
-/
import logic.basic
import data.rbmap.basic
/-!
# Derive handler for `inhabited` instances
This file introduces a derive handler to automatically generate `inhabited`
... |
59ccddadec764b81d93b9aeac5f804f5d1f370ea | 4fa161becb8ce7378a709f5992a594764699e268 | /src/analysis/calculus/times_cont_diff.lean | 2e49117e88695fb10176ef8a07a2cbc431486ffe | [
"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 | 83,337 | 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 analysis.calculus.mean_value
/-!
# Higher differentiability
A function is `C^1` on a domain if it is differentiable there, and its derivative is contin... |
b6f8d0637b1e5a157ffc20424b33cd64880cedf2 | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /src/data/set/intervals/ord_connected.lean | 8e80999326b93e0231568b4711f5afa01bd16f92 | [
"Apache-2.0"
] | permissive | dexmagic/mathlib | ff48eefc56e2412429b31d4fddd41a976eb287ce | 7a5d15a955a92a90e1d398b2281916b9c41270b2 | refs/heads/master | 1,693,481,322,046 | 1,633,360,193,000 | 1,633,360,193,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,737 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov
-/
import data.set.intervals.unordered_interval
import data.set.lattice
/-!
# Order-connected sets
We say that a set `s : set α` is `ord_connected` if for all ... |
c6d811f3595340d16364a24186586ac236115087 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/tactic/field_simp.lean | 7255410dc0798184eb0b5da8895f54bb53ae44fd | [
"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 | 4,194 | 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 tactic.interactive
import tactic.norm_num
/-!
# `field_simp` tactic
Tactic to clear denominators in algebraic expressions, based on `simp` with a spec... |
383b5ab10bbd7a31c3285d604cb3239141bd8ff9 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/eassumption.lean | eb53c180a3bc9423a77ae7c613eb543ddd66616b | [
"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 | 148 | lean | variable p : nat → Prop
variable q : nat → Prop
variables a b c : nat
example : p c → p b → q b → p a → ∃ x, p x ∧ q x :=
by blast
|
e7a9562fcc43295e6e68f07884d2d879d6ad4c83 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/measure_theory/measure/doubling.lean | 1ca5de2930d7d1f5a000203f2a0a6f4ab597c13f | [
"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 | 7,164 | 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 analysis.special_functions.log.base
import measure_theory.measure.measure_space_def
/-!
# Uniformly locally doubling measures
A uniformly locally doubling measure ... |
1276588def39626b4200d62b6d2371b5f2dbff87 | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/category_theory/limits/shapes/equalizers.lean | c0a43eab5099d95d17331063f7011d9d033397bc | [
"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 | 23,989 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Markus Himmel
-/
import data.fintype
import category_theory.epi_mono
import category_theory.limits.limits
import category_theory.limits.shapes.finite_limits
/-!
# Equa... |
94a1da3eed022de5f36e46b44af1dd77be1ec8d8 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/category_theory/limits/shapes/regular_mono.lean | dad824a283b53f2df1eb946bcb0f225f9c664d8f | [
"Apache-2.0"
] | permissive | gebner/mathlib | eab0150cc4f79ec45d2016a8c21750244a2e7ff0 | cc6a6edc397c55118df62831e23bfbd6e6c6b4ab | refs/heads/master | 1,625,574,853,976 | 1,586,712,827,000 | 1,586,712,827,000 | 99,101,412 | 1 | 0 | Apache-2.0 | 1,586,716,389,000 | 1,501,667,958,000 | Lean | UTF-8 | Lean | false | false | 3,182 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.epi_mono
import category_theory.limits.shapes.kernels
/-!
# Definitions and basic properties of regular and normal monomorphisms and epimorphi... |
b94f44a388e82aeed1f398764828cf544da15fa4 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/int/bitwise.lean | 73fb86f91588fd78cb26a671f87a79542f515f0c | [
"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 | 10,059 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
-/
import data.int.basic
import data.nat.pow
import data.nat.size
/-!
# Bitwise operations on integers
## Recursors
* `int.bit_cases_on`: Parity disjunction. Something ... |
65cc514acc582f0472f09932e98426a6ba0da090 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/noncomputable_lemma.lean | 2ffcb72ed6c6913b5e2ebfc8984992be8bf660a8 | [
"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 | 187 | lean | noncomputable lemma a : ℕ := 37
lemma b : ℕ := 37
-- do not report missing noncomputable:
lemma sorry_type : sorry := sorry
-- do not report missing noncomputable:
lemma incomplete :
|
ab167c3cc06413a11ee9f17385f453383cd4c672 | f3a5af2927397cf346ec0e24312bfff077f00425 | /src/game/world6/level4.lean | 73e6aeda5998228dee2d72a379a794cba5612441 | [
"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 | 1,280 | lean | /-
# Proposition world.
## Level 4: `apply`.
Let's do the same level again:
We are given a proof $p$ of $P$ and our goal is to find a proof of $U$, or
in other words to find a path through the maze that links $P$ to ... |
63cf1fdf12e50fa1c6343a0cf271a725961c4c35 | c8af905dcd8475f414868d303b2eb0e9d3eb32f9 | /src/data/cpi/semantics/space.lean | 9b915ac2b11700ae4617a13252f5c03d728a6187 | [
"BSD-3-Clause"
] | permissive | continuouspi/lean-cpi | 81480a13842d67ff5f3698643210d8ed5dd08de4 | 443bf2cb236feadc45a01387099c236ab2b78237 | refs/heads/master | 1,650,307,316,582 | 1,587,033,364,000 | 1,587,033,364,000 | 207,499,661 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,333 | lean | import data.cpi.semantics.relation
import data.fin_fn
namespace cpi
/-- Determine if two concretions are equal. Effectively a decision procedure for
structural congruence. -/
instance concretion_wrap.decidable_eq {ℍ ω Γ} [cpi_equiv ℍ ω] :
decidable_eq ( prime_species' ℍ ω Γ
× (Σ (b y : ℕ), concre... |
90ca990aaf6acdaa835bbc8f65f442ebb6c56738 | 54ce0561cebde424526f41d45f490ed56be2bd0c | /src/game/ch3_Set_Theory/1_Fundamentals.lean | ae5a1415d60c55a4b8a75701b8c7d5011b4d0272 | [] | no_license | melembroucarlitos/Tao_Analysis-LEAN | cf7b3298d317891a09e4bf21cfe7c7ffcb57b9a9 | 3f4fc7e090d96b6cef64896492fba4bef124794b | refs/heads/master | 1,692,952,385,694 | 1,636,287,522,000 | 1,636,287,522,000 | 400,630,166 | 3 | 0 | null | 1,635,910,807,000 | 1,630,096,823,000 | Lean | UTF-8 | Lean | false | false | 163 | lean | -- Level name : Fundamentals
/-
# Hey yall
## This is just to a placeholder to make sure all is working
these are some words
and these are some other words
-/
|
5b75bafa4d2fce91bd50571ab921c871ba2d9424 | d642a6b1261b2cbe691e53561ac777b924751b63 | /test/tactics.lean | d86d9deecb565c3a07de5ccc21733b9b255583fb | [
"Apache-2.0"
] | permissive | cipher1024/mathlib | fee56b9954e969721715e45fea8bcb95f9dc03fe | d077887141000fefa5a264e30fa57520e9f03522 | refs/heads/master | 1,651,806,490,504 | 1,573,508,694,000 | 1,573,508,694,000 | 107,216,176 | 0 | 0 | Apache-2.0 | 1,647,363,136,000 | 1,508,213,014,000 | Lean | UTF-8 | Lean | false | false | 11,976 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon, Scott Morrison
-/
import tactic.interactive tactic.finish tactic.ext tactic.lift tactic.apply
tactic.reassoc_axiom tactic.tfae tactic.elide
example (m n p q : nat) (... |
c22f80fed77662a6488a8cf0cf2fbcb0f6a41279 | f3849be5d845a1cb97680f0bbbe03b85518312f0 | /old_library/system/IO.lean | 27d33c3c7dc59ff5a6dcaf2ab3d866510e988798 | [
"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 | 1,026 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Luke Nelson, Jared Roesch and Leonardo de Moura
-/
constant {u} IO : Type u → Type u
constant functorIO : functor IO
constant monadIO : monad IO
attribute [instance] functorIO... |
33810d609cf8648fdf3a9f65f1601e263e350707 | 6214e13b31733dc9aeb4833db6a6466005763162 | /src/etc.lean | 5c9e2b507bb36ed4449b487bccd11d751cb31d93 | [] | no_license | joshua0pang/esverify-theory | 272a250445f3aeea49a7e72d1ab58c2da6618bbe | 8565b123c87b0113f83553d7732cd6696c9b5807 | refs/heads/master | 1,585,873,849,081 | 1,527,304,393,000 | 1,527,304,393,000 | 154,901,199 | 1 | 0 | null | 1,540,593,067,000 | 1,540,593,067,000 | null | UTF-8 | Lean | false | false | 10,844 | lean | -- auxiliary lemmas unrelated to verifier
import data.set
-- auxiliary lemmas for nat
lemma nonneg_of_nat {n: ℕ}: 0 ≤ n := nat.rec_on n
(show 0 ≤ 0, by refl)
(λn zero_lt_n, show 0 ≤ n + 1, from le_add_of_le_of_nonneg zero_lt_n zero_le_one)
lemma lt_of_add_one {n: ℕ}: n < n + 1 :=
have n ≤ n, by refl,
show n... |
2fba624187e4ea62ea260d5b6d980b72f0a0c893 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/geometry/manifold/cont_mdiff_mfderiv.lean | b002d3ee823d9a96a3b2ce2eb0bc6fc3d94aa93a | [
"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 | 24,787 | 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, Floris van Doorn
-/
import geometry.manifold.mfderiv
/-!
### Interactions between differentiability, smoothness and manifold derivatives
We give the relation be... |
050e934547b729c047b3be0f295c811c8a22138a | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/category_theory/subterminal.lean | cdc36f10017316182849248bfe8dd74e55ffa193 | [
"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 | 6,032 | 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 category_theory.limits.shapes.terminal
import category_theory.limits.shapes.binary_products
import category_theory.subobject.basic
/-!
# Subterminal objects
Subt... |
7c68b90e416ae733edbb11ad888833c44b103450 | e16d4df4c2baa34ab203178cea2c27905a3b63d3 | /src/utils.lean | 8db03bc8ac2749c037d2d19dbb06ec734a8a0c50 | [] | no_license | jembishop/advent-of-code-2020 | ea29eecb7f1d676dc1fd34b1a66efdbd23248aec | 32fd5bc28e7c178277e85dc034b55fce6dd4afce | refs/heads/main | 1,675,354,147,711 | 1,608,705,139,000 | 1,608,705,139,000 | 317,705,877 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 901 | lean | import data.vector
import data.list
-- can't prove decidablity to use normal filter
def filter {α : Type } (p : α → bool) : list α → list α
| [] := []
| (a::l) := if p a then a :: filter l else filter l
def from_list {α} {n : ℕ} : list α → option (vector α n)
| l := if h: l.length = n then some ⟨l, h⟩ else ... |
49d2344deb60e040cb9a7dfbe1857e2828d411de | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/deprecated/submonoid.lean | e35af6947926828790ec5e2f2045232f7961543e | [
"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 | 20,290 | lean | /-
Copyright (c) 2018 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Kenny Lau, Johan Commelin, Mario Carneiro, Kevin Buzzard
-/
import group_theory.submonoid.basic
import algebra.big_operators.basic
/-!
# Submonoids
This file defines ... |
dca3acbfef5a93f658b4557d3753caab5b785ed8 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/measure_theory/function/simple_func_dense.lean | b9d7038805441e8e7ca38b589bfe7661a705a6ab | [
"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 | 7,367 | lean | /-
Copyright (c) 2019 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou, Yury Kudryashov, Heather Macbeth
-/
import measure_theory.function.simple_func
/-!
# Density of simple functions
Show that each Borel measurable function can be approxi... |
71be800423e42f71ee7502051efb688b2b4619b1 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/qed_perf_bug.lean | e9c51e71ad306b0bc176fee119721f08044d157f | [
"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 | 514 | lean | definition f (n : nat) : nat :=
if n = 100000 then 1 else 0
example (n : nat) : f 100000 = (if (100000 : nat) = 100000 then 1 else 0) :=
rfl
example (n : nat) : f 100000 = (if (100000 : nat) = 100000 then 1 else 0) :=
by unfold f
example (n : nat) : f 100000 = (if (100000 : nat) = 100000 then 1 else 0) :=
by simp [f... |
aff9d32d45cc2124e6552dd4b332f2819d22ab71 | 7b02c598aa57070b4cf4fbfe2416d0479220187f | /homotopy/cofiber_sequence.hlean | 9dfe53dbd21bf9d4b8d24ce0865692a826a66392 | [
"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,828 | hlean | /-
Copyright (c) 2017 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
Cofiber sequence of a pointed map
-/
import .cohomology .pushout
open pointed eq cohomology sigma sigma.ops fiber cofiber chain_complex nat succ_str algebra prod ... |
32a8d114e557c274bb1d15a86ed3e06d45530448 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/logic/hydra.lean | 97260914248ebb1ace10f8e7dddd0018b78c1ce2 | [
"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 | 6,721 | lean | /-
Copyright (c) 2022 Junyan Xu. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Junyan Xu
-/
import data.finsupp.lex
import data.finsupp.multiset
import order.game_add
/-!
# Termination of a hydra game
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this ... |
823b7084318c5ef853fd623c5a7112c32c90ac42 | 9b9a16fa2cb737daee6b2785474678b6fa91d6d4 | /src/analysis/specific_limits.lean | 7f87c02cf5c027c22916fec60997aad7ed87dc48 | [
"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 | 6,174 | 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
A collection of specific limit computations.
-/
import analysis.normed_space.basic
import topology.instances.ennreal
noncomputable theory
local attribute [instance] cl... |
d8537dbc40aad256310ab618ddd29831bcccf00a | a44280b79dc85615010e3fbda46abf82c6730fa3 | /tests/playground/parser/parser.lean | 0ffc373b6042ab2cb7ab582e7454f336fe057998 | [
"Apache-2.0"
] | permissive | kodyvajjha/lean4 | 8e1c613248b531d47367ca6e8d97ee1046645aa1 | c8a045d69fac152fd5e3a577f718615cecb9c53d | refs/heads/master | 1,589,684,450,102 | 1,555,200,447,000 | 1,556,139,945,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 32,700 | lean | import init.lean.name init.lean.parser.trie init.lean.parser.identifier
import syntax filemap
open Lean
export Lean.Parser (Trie)
-- namespace Lean
namespace Parser
/-- A multimap indexed by tokens. Used for indexing parsers by their leading token. -/
def TokenMap (α : Type) := RBMap Name (List α) Name.quickLt
names... |
f6dee165177ee0045a24137e6a16c23a6caf016f | bb31430994044506fa42fd667e2d556327e18dfe | /src/data/nat/modeq.lean | e3340f3d69167814c7ad2352946e08a242be8c13 | [
"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 | 18,379 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.int.gcd
import tactic.abel
/-!
# Congruences modulo a natural number
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a cor... |
c728ec994d91d255c59c9bbb86e0de396e7f11b5 | d751a70f46ed26dc0111a87f5bbe83e5c6648904 | /Code/src/inst/network/prec.lean | 3e5bb32592adf8866b2949e5a0b225ed6fc160e1 | [] | no_license | marcusrossel/bachelors-thesis | 92cb12ae8436c10fbfab9bfe4929a0081e615b37 | d1ec2c2b5c3c6700a506f2e3cc93f1160e44b422 | refs/heads/main | 1,682,873,547,703 | 1,619,795,735,000 | 1,619,795,735,000 | 306,041,494 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,997 | lean | import lgraph
import inst.network.graph
open reactor.ports
namespace inst
namespace network
-- An edge in a precedence graph connects reactions.
structure prec.graph.edge :=
(src : reaction.id)
(dst : reaction.id)
-- Precedence graph edges are directed.
instance prec.graph.lgraph_edge : lgraph.edge ... |
6fd535efa47b8d9240d384e8b20dbdca6cd9fc4f | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/category_theory/simple.lean | a332ce138e03fa78d371e8caf0d703a30c0992d6 | [
"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 | 4,321 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel, Scott Morrison
-/
import category_theory.limits.shapes.zero
import category_theory.limits.shapes.kernels
import category_theory.abelian.basic
/-!
# Simple objects
We d... |
4fb326ab8ca935b2d2133245d31d50d6caeb7b93 | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /tests/lean/run/forBodyResultTypeIssue.lean | f04dfdabdae1635b8d6b490fe79c2488722880c1 | [
"Apache-2.0"
] | permissive | collares/lean4 | 861a9269c4592bce49b71059e232ff0bfe4594cc | 52a4f535d853a2c7c7eea5fee8a4fa04c682c1ee | refs/heads/master | 1,691,419,031,324 | 1,618,678,138,000 | 1,618,678,138,000 | 358,989,750 | 0 | 0 | Apache-2.0 | 1,618,696,333,000 | 1,618,696,333,000 | null | UTF-8 | Lean | false | false | 746 | lean | abbrev M := ExceptT String <| StateT Nat Id
def f (xs : List Nat) : M Unit := do
for x in xs do
if x == 0 then
throw "contains zero"
#eval f [1, 2, 3] |>.run' 0
#eval f [1, 0, 3] |>.run' 0
theorem ex1 : (f [1, 2, 3] |>.run' 0) = Except.ok () :=
rfl
theorem ex2 : (f [1, 0, 3] |>.run' 0) = Except.error "contain... |
6b539d695c66895e6b2a43936ca9d51c39361941 | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /stage0/src/Lean/Util/Trace.lean | 96e97f9d624ed4511729f15e3a723c92d5d47556 | [
"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 | 5,478 | lean | /-
Copyright (c) 2018 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich, Leonardo de Moura
-/
import Lean.Message
import Lean.MonadEnv
universe u
namespace Lean
open Std (PersistentArray)
structure TraceElem where
ref : Syntax... |
6e243d1504b7e721265aac7b9206fb8c07a51166 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/tactic/assert_exists.lean | 3d120fe89243aad352bd9609b54334632cb522cd | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 5,438 | lean | /-
Copyright (c) 2022 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Scott Morrison
-/
import tactic.core
import tactic.lint.basic
/-!
# User commands for assert the (non-)existence of declaration or instances.
These commands are used ... |
919dceaaf6fa7a60e0a417b77be92b6d394b7298 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/number_theory/liouville/liouville_constant.lean | f641942477311bbcc71af443a4bb040527f204e4 | [
"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 | 8,813 | lean | /-
Copyright (c) 2020 Jujian Zhang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Damiano Testa, Jujian Zhang
-/
import number_theory.liouville.basic
/-!
# Liouville constants
This file contains a construction of a family of Liouville numbers, indexed by a natural n... |
76418a3a14724a10429010512d674a1da21e87ee | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/dep_parents.lean | 185edbaef361356a36209afe8332bc6abc646ebd | [
"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 | 59 | lean | class A := mk
class B [A] := mk
class C extends A, B := mk
|
d4deca59c5c8cf6c3c454a398453f97c234b4638 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/algebra/free_algebra.lean | ece73a7b421ac7baa37459b754460dd97076f84a | [
"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 | 17,219 | lean | /-
Copyright (c) 2020 Adam Topaz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Adam Topaz
-/
import algebra.algebra.subalgebra
import algebra.monoid_algebra.basic
/-!
# Free Algebras
Given a commutative semiring `R`, and a type `X`, we construct the... |
eda78dbf56b621fa68ef6820dfcb45ad8b40af1b | d1a52c3f208fa42c41df8278c3d280f075eb020c | /src/Lean/Meta/Tactic/Simp/SimpAll.lean | cb33b50673dfa100a9574c9248a7606a40fd885b | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | cipher1024/lean4 | 6e1f98bb58e7a92b28f5364eb38a14c8d0aae393 | 69114d3b50806264ef35b57394391c3e738a9822 | refs/heads/master | 1,642,227,983,603 | 1,642,011,696,000 | 1,642,011,696,000 | 228,607,691 | 0 | 0 | Apache-2.0 | 1,576,584,269,000 | 1,576,584,268,000 | null | UTF-8 | Lean | false | false | 3,268 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Meta.Tactic.Clear
import Lean.Meta.Tactic.Util
import Lean.Meta.Tactic.Simp.Main
namespace Lean.Meta
namespace SimpAll
structure Entry where
... |
dbdc2737bb94dae5eed2949638ae4d1de8f16deb | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/number_theory/pell.lean | a9f498d0bd0fd0d564aa1202ecef058ac3c15d7e | [
"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 | 29,481 | lean | /-
Copyright (c) 2023 Michael Stoll. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Michael Geißer, Michael Stoll
-/
import tactic.qify
import data.zmod.basic
import number_theory.diophantine_approximation
import number_theory.zsqrtd.basic
/-!
# Pell's Equation
> TH... |
bcaaa2d17f1f911ba25be2c712c8b090d7cfae12 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/matchDiscrType.lean | 2a8accadaa303b4f8652c40ba173dd63fa888d36 | [
"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 | 258 | lean | def g (x : Nat) : List (Nat × List Nat) :=
[(x, [x, x]), (x, [])]
def h (x : Nat) : List Nat :=
let xs := g x |>.filter (fun ⟨_, xs⟩ => xs.isEmpty)
xs.map (·.1)
theorem ex1 : g 10 = [(10, [10, 10]), (10, [])] :=
rfl
theorem ex2 : h 10 = [10] :=
rfl
|
b8b2d0591045dac276657e1c95470101bad300c0 | 618003631150032a5676f229d13a079ac875ff77 | /src/topology/basic.lean | ef1a031c1e44b46d251a4b85fce84fabaf96194c | [
"Apache-2.0"
] | permissive | awainverse/mathlib | 939b68c8486df66cfda64d327ad3d9165248c777 | ea76bd8f3ca0a8bf0a166a06a475b10663dec44a | refs/heads/master | 1,659,592,962,036 | 1,590,987,592,000 | 1,590,987,592,000 | 268,436,019 | 1 | 0 | Apache-2.0 | 1,590,990,500,000 | 1,590,990,500,000 | null | UTF-8 | Lean | false | false | 36,340 | 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, Jeremy Avigad
-/
import order.filter
import order.filter.bases
/-!
# Basic theory of topological spaces.
The main definition is the type class `topolo... |
1a9bc549b948ac3d71f187f5c838a558a18f2302 | 97c8e5d8aca4afeebb5b335f26a492c53680efc8 | /ground_zero/cubical/square.lean | a452e545feec22523aff0caae46c41ac7c17ec23 | [] | no_license | jfrancese/lean | cf32f0d8d5520b6f0e9d3987deb95841c553c53c | 06e7efaecce4093d97fb5ecc75479df2ef1dbbdb | refs/heads/master | 1,587,915,151,351 | 1,551,012,140,000 | 1,551,012,140,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,202 | lean | import ground_zero.cubical.path
open ground_zero.HITs (I) ground_zero.cubical ground_zero.types
/-
* Constant square.
* Connections (∧, ∨) in squares.
-/
namespace ground_zero.cubical.Square
universe u
def lam {α : Sort u} (f : I → I → α) :
Square (f 0) (f 1) (<i> f i 0) (<i> f i 1) :=
Cube.lambda 1 (product.e... |
0140ee59fdf48bcc616e44ae34cc79112a9ec136 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tests/lean/interactive/hover.lean | ddca593abebac1c29c70695d39f5b1555dbb952b | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | cipher1024/lean4 | 6e1f98bb58e7a92b28f5364eb38a14c8d0aae393 | 69114d3b50806264ef35b57394391c3e738a9822 | refs/heads/master | 1,642,227,983,603 | 1,642,011,696,000 | 1,642,011,696,000 | 228,607,691 | 0 | 0 | Apache-2.0 | 1,576,584,269,000 | 1,576,584,268,000 | null | UTF-8 | Lean | false | false | 2,637 | lean | import Lean
example : True := by
apply True.intro
--^ textDocument/hover
example : True := by
simp [True.intro]
--^ textDocument/hover
example (n : Nat) : True := by
match n with
| Nat.zero => _
--^ textDocument/hover
| n + 1 => _
/-- My tactic -/
macro "mytac" o:"only"? e:term : tactic => ... |
28c13571ec333580df047bc7f5b53652b638fce0 | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/scope_bug1.lean | c99245fc96e8a305c7e20e84c5ca7ced0d87d088 | [
"Apache-2.0"
] | permissive | codyroux/lean0.1 | 1ce92751d664aacff0529e139083304a7bbc8a71 | 0dc6fb974aa85ed6f305a2f4b10a53a44ee5f0ef | refs/heads/master | 1,610,830,535,062 | 1,402,150,480,000 | 1,402,150,480,000 | 19,588,851 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 430 | lean | variables a b c d : Nat
axiom H : a + (b + c) = a + (b + d)
set_option pp::implicit true
using Nat
check add_succr a
scope
theorem mul_zerol2 (a : Nat) : 0 * a = 0
:= induction_on a
(show 0 * 0 = 0, from mul_zeror 0)
(λ (n : Nat) (iH : 0 * n = 0),
calc 0 * (n + 1) = (0 * n) + 0 : mul_succr 0 n
... |
340b6377e42d8f75218de58167eb8fb835a0962b | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/linear_algebra/quadratic_form/complex.lean | 9a42c8445a840b065bb0d422c32d0e9a0515808c | [
"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,291 | lean | /-
Copyright (c) 2020 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen, Kexing Ying, Eric Wieser
-/
import linear_algebra.quadratic_form.isometry
import analysis.special_functions.pow.complex
/-!
# Quadratic forms over the complex numbers
> THI... |
36edb9375a8bc0cc1915455ceca4195fb17ab425 | 4ec0e92c725fad3fd2871a0ab050a7da1c719444 | /src/mywork/practice_1.lean | 465a429cf2a61bd6dca8c8f70a72f5d3c0622619 | [] | no_license | mitchelltaylor06/cs2120f21 | cc2c2b61a7e45c07faa849fcb8a66eb948753a25 | efb71a748d7c76e24834d03b8f01c3ae084c1756 | refs/heads/main | 1,693,841,444,092 | 1,633,713,850,000 | 1,633,713,850,000 | 399,946,415 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,049 | lean | /-
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
proof of the conjecture that z = w. You can use not only the
axioms of equality, but either of the theo... |
2b3ceef78c689ff9c73f33d6c62553861e64c4f6 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/lean/439.lean | dc17bd06879d8f94edecd1477dd34fcfa90bdbae | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | EdAyers/lean4 | 57ac632d6b0789cb91fab2170e8c9e40441221bd | 37ba0df5841bde51dbc2329da81ac23d4f6a4de4 | refs/heads/master | 1,676,463,245,298 | 1,660,619,433,000 | 1,660,619,433,000 | 183,433,437 | 1 | 0 | Apache-2.0 | 1,657,612,672,000 | 1,556,196,574,000 | Lean | UTF-8 | Lean | false | false | 807 | lean | set_option pp.analyze.trustCoe true
universe u
structure Fn (E I : Sort u) := (exp : E) (imp : I)
instance (E I : Sort u) : CoeFun (Fn E I) (fun _ => I) := {coe := fun K => K.imp}
class Bar.{w} (P : Sort u) :=
fn : P -> Sort w
variable {P : Sort u} (B : Bar P)
variable (fn : Fn ((p : P) -> B.fn p) ({p : P} -> B.... |
65a5399376961e241dec9abaef5b827fd171f87c | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/measure_theory/prod.lean | 99a6211cce9d52de802ea99047af98ae7408ced2 | [
"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 | 46,972 | lean | /-
Copyright (c) 2020 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.giry_monad
import measure_theory.set_integral
/-!
# The product measure
In this file we define and prove properties about the binary produ... |
8e8095227da3482868a729b1eec3645fac778f06 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/topology/metric_space/antilipschitz.lean | 3713842069136538ceba1d2ea76ac764a29760f6 | [
"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,253 | 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 topology.metric_space.lipschitz
import topology.uniform_space.complete_separated
/-!
# Antilipschitz functions
We say that a map `f : α → β` between two (e... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.