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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
bdee55f5bd5bd9d9197b0a91e3113b14f98138c6 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/group_theory/submonoid/basic.lean | 99493198c8db4cc7ea3b7ed46f14b63500df779e | [
"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 | 20,839 | lean | /-
Copyright (c) 2018 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Kenny Lau, Johan Commelin, Mario Carneiro, Kevin Buzzard,
Amelia Livingston, Yury Kudryashov
-/
import group_theory.subsemigroup.basic
/-!
# Submonoids: definition and... |
bc0bb11e85b2231b25f6b2ee271e88bac489a4ba | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/group_theory/coset.lean | f86831c6852ca6e6abe0211aaaaeb4da2f167c34 | [
"Apache-2.0"
] | permissive | rmitta/mathlib | 8d90aee30b4db2b013e01f62c33f297d7e64a43d | 883d974b608845bad30ae19e27e33c285200bf84 | refs/heads/master | 1,585,776,832,544 | 1,576,874,096,000 | 1,576,874,096,000 | 153,663,165 | 0 | 2 | Apache-2.0 | 1,544,806,490,000 | 1,539,884,365,000 | Lean | UTF-8 | Lean | false | false | 9,164 | lean | /-
Copyright (c) 2018 Mitchell Rowett. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mitchell Rowett, Scott Morrison
-/
import group_theory.subgroup data.equiv.basic data.quot
open set function
variable {α : Type*}
@[to_additive left_add_coset]
def left_coset [has_m... |
c95b9db5de19142a643324ddf226f0fb255a08cc | 30b012bb72d640ec30c8fdd4c45fdfa67beb012c | /category/traversable/instances.lean | f24314bdda6d8891fca079b30410db361fe9f9c7 | [
"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,078 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Simon Hudon
Instances of `traversable` for types from the core library
-/
import category.traversable.basic category.basic category.functor category.applicative
import data.list.basic da... |
b8f6c45488515a668fe82947fe9198c7b7635836 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/finset/pi_induction.lean | 9cc1013b99ec7f1bdde18f1ad53873c50c1c1dfc | [
"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 | 5,092 | 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.lattice
import data.finset.sigma
/-!
# Induction principles for `Π i, finset (α i)`
In this file we prove a few induction principles for funct... |
370c8e28fbe3088d017ab39af9da00e99d0cd467 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/implicitLambdaLocalWithoutType.lean | 38a0acaea6622d544fd567e9074eb01e554963f1 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 1,435 | lean | def foo1mk (_ : ∀ (α : Type) (a : α), a = a) : Nat := 37
def foo2mk (_ : ∀ {α : Type} (a : α), a = a) : Nat := 37 -- implicit binder
example (x) : foo1mk x = foo1mk x := rfl -- works
example (x : ∀ {α : Type} (a : α), a = a) : 37 = foo2mk x := rfl -- works
example (x) : 37 = foo2mk @x := rfl -- works
example (x) : foo... |
4728e499f642dada0a4b32bc63d5e63f9c4e07cc | 26ac254ecb57ffcb886ff709cf018390161a9225 | /src/data/support.lean | 743c26362a51db8056aed41ea13331cd010617c9 | [
"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 | 5,287 | 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
import algebra.group.prod
/-!
# Support of a function
In this file we define `function.su... |
d286119d148275ef68fefc21e2fbec19480493cd | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/analysis/convex/extreme.lean | 810e6ceec62828e4dcf68b83892b9a59f689ba66 | [
"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,524 | lean | /-
Copyright (c) 2021 Yaël Dillies, Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies, Bhavik Mehta
-/
import analysis.convex.hull
/-!
# Extreme sets
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding... |
88cc7305e038119cc3e3c0bacf5de16585fd9f6f | c3de33d4701e6113627153fe1103b255e752ed7d | /topology/uniform_space.lean | d1795e7c6ffa49f148a1f9d1d7da47ebe8dee24a | [] | no_license | jroesch/library_dev | 77d2b246ff47ab05d55cb9706a37d3de97038388 | 4faa0a45c6aa7eee6e661113c2072b8840bff79b | refs/heads/master | 1,611,281,606,352 | 1,495,661,644,000 | 1,495,661,644,000 | 92,340,430 | 0 | 0 | null | 1,495,663,344,000 | 1,495,663,344,000 | null | UTF-8 | Lean | false | false | 52,372 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
Theory of uniform spaces.
-/
import algebra.lattice.filter .topological_space .continuity
open set lattice filter
set_option eqn_compiler.zeta true
attribute [trans] ... |
80e7c1aa6803b3a72144cee785360b7d5bc45916 | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch4/ex0305.lean | 8e349af646bf0d487932d9eb6e6072db2c2f15ba | [] | 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 | 318 | lean | variables (a b c d e : ℕ)
variable h1 : a = b
variable h2 : b = c + 1
variable h3 : c = d
variable h4 : e = 1 + d
include h1 h2 h3 h4
theorem T : a = e :=
by simp [h1, h2, h3, h4, add_comm]
-- lean 3.6 removes simp attributes from add_comm
-- i.e., now it is required to provide that lemma to solve this theorem.
|
a22203c7c9b25da6b20c3b70e79dc2e810ccd761 | ad0c7d243dc1bd563419e2767ed42fb323d7beea | /linear_algebra/quotient_module.lean | aba46fbdd1d5e47668d67fdf3604f9714bb7a250 | [
"Apache-2.0"
] | permissive | sebzim4500/mathlib | e0b5a63b1655f910dee30badf09bd7e191d3cf30 | 6997cafbd3a7325af5cb318561768c316ceb7757 | refs/heads/master | 1,585,549,958,618 | 1,538,221,723,000 | 1,538,221,723,000 | 150,869,076 | 0 | 0 | Apache-2.0 | 1,538,229,323,000 | 1,538,229,323,000 | null | UTF-8 | Lean | false | false | 6,949 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Johannes Hölzl
Quotient construction on modules
-/
import linear_algebra.basic
import linear_algebra.prod_module
import linear_algebra.subtype_module
universes u v w
variables {α : T... |
3ece99753aad97c7f6b5214dd5f73b461c4d5d34 | 205f0fc16279a69ea36e9fd158e3a97b06834ce2 | /src/12_Sets/01_sets_as_functions.lean | c05c4066305ccf823d718f67a5c1d5346fe29d25 | [] | no_license | kevinsullivan/cs-dm-lean | b21d3ca1a9b2a0751ba13fcb4e7b258010a5d124 | a06a94e98be77170ca1df486c8189338b16cf6c6 | refs/heads/master | 1,585,948,743,595 | 1,544,339,346,000 | 1,544,339,346,000 | 155,570,767 | 1 | 3 | null | 1,541,540,372,000 | 1,540,995,993,000 | Lean | UTF-8 | Lean | false | false | 4,749 | lean |
/-
What are sets?
In many programming languages, sets are unordered
containers of unique items
{3, 1, 2} and {1, 2, 3} are the same set
{1, 1, 2, 3} is not a set
In Lean, to create a set, you need to first specify
what type is contained in the set (in Lean, a set
cannot contain elements of different types)
A set o... |
4d13511858a93201efeab13e868d4bb3ba48dd85 | bb31430994044506fa42fd667e2d556327e18dfe | /src/group_theory/presented_group.lean | fcd3117a13e301089af44d57a7ec498e9a6db278 | [
"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,082 | lean | /-
Copyright (c) 2019 Michael Howes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Michael Howes
-/
import group_theory.free_group
import group_theory.quotient_group
/-!
# Defining a group given by generators and relations
Given a subset `rels` of relations of the f... |
30458b3b2031c9770ebc9d6dd0aea20d85b1cb02 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/lean/run/extmacro.lean | 373017c7ee7638cf9637915803b87906a5e80d93 | [
"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 | 498 | lean | new_frontend
macro ext_tactic t:tactic "=>" newT:tactic : command => `(macro_rules | `($t) => `($newT))
syntax "trivial" : tactic
ext_tactic trivial => apply Eq.refl
theorem tst1 (x : Nat) : x = x :=
begin trivial end
-- theorem tst2 (x y : Nat) (h : x = y) : x = y :=
-- begin trivial end -- fail as expected
ext_... |
b1248525df57dc01970b1609ca387e592a35383f | 9dd3f3912f7321eb58ee9aa8f21778ad6221f87c | /tests/lean/run/e15.lean | c28f036608166018be4156cb0b7df9a626d01b67 | [
"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 | 534 | lean | prelude
inductive nat : Type
| zero : nat
| succ : nat → nat
namespace nat end nat open nat
inductive list (A : Sort*)
| nil {} : list
| cons : A → list → list
namespace list end list open list
check nil
check nil.{1}
check @nil.{1} nat
check @nil nat
check cons zero nil
inductive vector (A : Sort*) : nat → Sort*
... |
6de2560bd3817e4207334369ab1e5d562270d86c | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/data/equiv/fin.lean | 791d8d6f2727716a0e8940b7aaac04ddb5bd5cd8 | [
"Apache-2.0"
] | permissive | ilitzroth/mathlib | ea647e67f1fdfd19a0f7bdc5504e8acec6180011 | 5254ef14e3465f6504306132fe3ba9cec9ffff16 | refs/heads/master | 1,680,086,661,182 | 1,617,715,647,000 | 1,617,715,647,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,242 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import data.fin
import data.equiv.basic
/-!
# Equivalences for `fin n`
-/
universe variables u
variables {m n : ℕ}
/-- Equivalence between `fin 0` and `empty`. -/
def fin_z... |
6bf3382b06f7b76311d11c6ea1549f23f78b8dfe | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/lean/run/concatElim.lean | 2d135a8a7da15f1f7ac68973d1cf3383f7d3e0fe | [
"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 | 2,502 | lean | universe u
def concat {α} : List α → α → List α
| [], a => [a]
| x::xs, a => x :: concat xs a
def last {α} : (xs : List α) → xs ≠ [] → α
| [], h => by contradiction
| [a], h => a
| _::a::as, h => last (a::as) (fun h => by injection h)
def dropLast {α} : List α → List α
| [] => []
| [a]... |
3774624c87e425dd9a0dbd4a72252826b93a11df | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/exit.lean | 553d6d2777efa6df20e34613035d2f44ae226cad | [
"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 | 20 | lean | exit
print "FAILED"
|
b50eb6f5a1939bd8f9c4723e703848cca129b31c | f1d0c3912d57abc8ea280458f07787fa00ecf62a | /src/tpow.lean | e30c13adcdf7e2f9e0b7759f2a365bb6266cf9d3 | [] | no_license | 101damnations/test | 2e426e10dde625657b531c978ba179b1a87b1fed | ade0896c09890e877e8fb0f17c636bc0491b8f2b | refs/heads/master | 1,672,484,804,338 | 1,603,359,314,000 | 1,603,359,314,000 | 276,198,127 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,440 | lean | import algebra.category.Module.monoidal
import linear_algebra.tensor_algebra
import algebra.category.CommRing.basic
open category_theory
variables {C : Type*} [category C] [monoidal_category C]
/-
def tensor_power_aux (X : C) : ℕ → C
| 0 := 𝟙_ C
| (n+1) := tensor_power_aux n ⊗ X
instance wtf {R : Type*} [comm_ring ... |
6aee7620e03e6c4810ae5088356f922ca429225b | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/group_theory/submonoid/operations.lean | b8175c61e89c266df9e062289c968891419fdac3 | [
"Apache-2.0"
] | permissive | troyjlee/mathlib | e18d4b8026e32062ab9e89bc3b003a5d1cfec3f5 | 45e7eb8447555247246e3fe91c87066506c14875 | refs/heads/master | 1,689,248,035,046 | 1,629,470,528,000 | 1,629,470,528,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 32,528 | lean | /-
Copyright (c) 2018 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Kenny Lau, Johan Commelin, Mario Carneiro, Kevin Buzzard,
Amelia Livingston, Yury Kudryashov
-/
import group_theory.submonoid.basic
import data.equiv.mul_add
import al... |
82edf0c6c07eda1c1c4bf7d35572985714111056 | 491068d2ad28831e7dade8d6dff871c3e49d9431 | /hott/algebra/category/constructions/comma.hlean | a10aad4a21d35cb18729069092e5293de5a2fbf2 | [
"Apache-2.0"
] | permissive | davidmueller13/lean | 65a3ed141b4088cd0a268e4de80eb6778b21a0e9 | c626e2e3c6f3771e07c32e82ee5b9e030de5b050 | refs/heads/master | 1,611,278,313,401 | 1,444,021,177,000 | 1,444,021,177,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,843 | 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
Comma category
-/
import ..functor ..strict ..category
open eq functor equiv sigma sigma.ops is_trunc iso is_equiv
namespace category
structure comma_object ... |
94184d697d00c5d4a4032dc26c3f917a7a2576aa | e94d3f31e48d06d252ee7307fe71efe1d500f274 | /library/theories/measure_theory/sigma_algebra.lean | 008effcd551ba5f964a001de15d18a512ac7965a | [
"Apache-2.0"
] | permissive | GallagherCommaJack/lean | e4471240a069d82f97cb361d2bf1a029de3f4256 | 226f8bafeb9baaa5a2ac58000c83d6beb29991e2 | refs/heads/master | 1,610,725,100,482 | 1,459,194,829,000 | 1,459,195,377,000 | 55,377,224 | 0 | 0 | null | 1,459,731,701,000 | 1,459,731,700,000 | null | UTF-8 | Lean | false | false | 9,323 | lean | /-
Copyright (c) 2016 Jacob Gross. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jacob Gross, Jeremy Avigad
Sigma algebras.
-/
import data.set data.nat theories.topology.basic
open eq.ops set nat
structure sigma_algebra [class] (X : Type) :=
(sets : set (set X))
... |
00d5997ab90280a104710fdaa530d47a7dadc0e4 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/logic/function/iterate.lean | 06fb6d200f5d8839feba052f0de32764bc87b38f | [
"Apache-2.0"
] | permissive | jjgarzella/mathlib | 96a345378c4e0bf26cf604aed84f90329e4896a2 | 395d8716c3ad03747059d482090e2bb97db612c8 | refs/heads/master | 1,686,480,124,379 | 1,625,163,323,000 | 1,625,163,323,000 | 281,190,421 | 2 | 0 | Apache-2.0 | 1,595,268,170,000 | 1,595,268,169,000 | null | UTF-8 | Lean | false | false | 5,574 | 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 logic.function.conjugate
/-!
# Iterations of a function
In this file we prove simple properties of `nat.iterate f n` a.k.a. `f^[n]`:
* `iterate_zero`, `it... |
4dfa3ba5195c4c5002454bb7e7eafcb29e88bce7 | ad0c7d243dc1bd563419e2767ed42fb323d7beea | /data/nat/choose.lean | 67cc53c63472dd398e6d2e80e3bd443749bc8772 | [
"Apache-2.0"
] | permissive | sebzim4500/mathlib | e0b5a63b1655f910dee30badf09bd7e191d3cf30 | 6997cafbd3a7325af5cb318561768c316ceb7757 | refs/heads/master | 1,585,549,958,618 | 1,538,221,723,000 | 1,538,221,723,000 | 150,869,076 | 0 | 0 | Apache-2.0 | 1,538,229,323,000 | 1,538,229,323,000 | null | UTF-8 | Lean | false | false | 3,708 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
Mostly based on Jeremy Avigad's choose file in lean 2
-/
import data.nat.basic
open nat
def choose : ℕ → ℕ → ℕ
| _ 0 := 1
| 0 (k + 1) := 0
| (n + 1) (k ... |
e18534eb99f078413d50f77e24d90924e7aae347 | c31182a012eec69da0a1f6c05f42b0f0717d212d | /src/normed_group/pseudo_normed_group.lean | 27292f631023e04040cb372810446d0cd10f8b5a | [] | no_license | Ja1941/lean-liquid | fbec3ffc7fc67df1b5ca95b7ee225685ab9ffbdc | 8e80ed0cbdf5145d6814e833a674eaf05a1495c1 | refs/heads/master | 1,689,437,983,362 | 1,628,362,719,000 | 1,628,362,719,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,140 | lean | import pseudo_normed_group.basic
import analysis.normed_space.basic
/-!
# A seminormed group is pseudo-normed
This file contains the construction of a pseudo-normed group from a seminormed group.
-/
open_locale nnreal
namespace semi_normed_group
instance (V : Type*) [semi_normed_group V] : pseudo_normed_group V :=... |
6c0aeaecdac12a35a72caf40100c4189690f1b8f | dd24e6c3b8dc14dc504f8a906fc04c51e4312e6b | /src/mywork/lectures/lecture_1a.lean | 7ca199629accd59e74e2f46be9ba043c316fe4ed | [] | no_license | njeyasingh/CS-2120 | dd781a90dd0645b74e61cee1813483fb7cb4a111 | b3356f665a246f295b3f1e6d61901bfca331810d | refs/heads/main | 1,693,294,711,274 | 1,635,188,659,000 | 1,635,188,659,000 | 399,945,420 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,068 | lean | -- import definitions of real and rational numbers from mathlib
import data.real.basic
namespace cs2120
/-
The first part of this lesson is in the file, lecture_1.md.
Please start there then return here when you're done with
that document.
-/
/-
NUMBER SYSTEMS
-/
/-
Mathematicians think about operations on many ki... |
3ad64350df33a0a7a2ba876411b5fa04f145c443 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/logic/equiv/functor.lean | 3ecd01ad4c5de44700ec7bccbc351065adca79bb | [
"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 | 2,302 | lean | /-
Copyright (c) 2019 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Simon Hudon, Scott Morrison
-/
import control.bifunctor
import logic.equiv.basic
/-!
# Functor and bifunctors can be applied to `equiv`s.
We define
```lean
def functo... |
52bb6f14ab63eedc95a79933f33bcd9cdeb8e3ea | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/lean/run/constProp.lean | 06181a8ccafdede7a9562d1acdff2118816f910d | [
"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 | 20,529 | lean | abbrev Var := String
inductive Val where
| int (i : Int)
| bool (b : Bool)
deriving DecidableEq, Repr
instance : Coe Bool Val where
coe b := .bool b
instance : Coe Int Val where
coe i := .int i
instance : OfNat Val n where
ofNat := .int n
#check (true : Val)
#check (0 : Val)
inductive BinOp where
... |
4ee68ecd282fb35dcd320fc7fd86d56238096467 | 02005f45e00c7ecf2c8ca5db60251bd1e9c860b5 | /src/measure_theory/content.lean | c8b10ba736532b5f7993319991fa96e9f759052f | [
"Apache-2.0"
] | permissive | anthony2698/mathlib | 03cd69fe5c280b0916f6df2d07c614c8e1efe890 | 407615e05814e98b24b2ff322b14e8e3eb5e5d67 | refs/heads/master | 1,678,792,774,873 | 1,614,371,563,000 | 1,614,371,563,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 12,630 | 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.measure_space
import measure_theory.borel_space
import topology.opens
import topology.compacts
/-!
# Contents
In this file we work with *c... |
1e6344e43d5d2a229280d2fc0ac4b5d80455490d | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/measure_theory/lp_space.lean | ae92e8f4da675499526caa5e6f2cd53f8d116b3d | [
"Apache-2.0"
] | permissive | ilitzroth/mathlib | ea647e67f1fdfd19a0f7bdc5504e8acec6180011 | 5254ef14e3465f6504306132fe3ba9cec9ffff16 | refs/heads/master | 1,680,086,661,182 | 1,617,715,647,000 | 1,617,715,647,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 79,174 | lean | /-
Copyright (c) 2020 Rémy Degenne. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Rémy Degenne, Sébastien Gouëzel
-/
import measure_theory.ess_sup
import measure_theory.ae_eq_fun
import analysis.mean_inequalities
import topology.continuous_function.compact
/-!
# ℒp s... |
81de743f0598508bc2b39e7f7612749a778f421c | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /tests/lean/run/have2.lean | 1f55029bf817eac1e53dd8edcaeea5007345fa93 | [
"Apache-2.0"
] | permissive | codyroux/lean | 7f8dff750722c5382bdd0a9a9275dc4bb2c58dd3 | 0cca265db19f7296531e339192e9b9bae4a31f8b | refs/heads/master | 1,610,909,964,159 | 1,407,084,399,000 | 1,416,857,075,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 176 | lean | definition Prop : Type.{1} := Type.{0}
constants a b c : Prop
axiom Ha : a
axiom Hb : b
axiom Hc : c
check have H1 [visible] : a, from Ha,
have H2 : a, from H1,
H2
|
671924a771eab9b76970105ee5c85b3ad9f3b414 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/category_theory/sites/sheaf_of_types.lean | eeabe1b286a2c1dbf456349f97947da8e4ea0787 | [
"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 | 35,553 | 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.sites.pretopology
import category_theory.limits.shapes.types
import category_theory.full_subcategory
/-!
# Sheaves of types on a Grothendieck top... |
595240349671e92b484d86158c89fb5fb96d8a3a | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/secnot.lean | e2af2e6f80daa5a560f9a658417dd3d87162e453 | [
"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 | 416 | lean | import data.num
section
variable {A : Type}
definition f (a b : A) := a
infixl `◀`:65 := f
variables a b : A
check a ◀ b
end
inductive list (T : Type) : Type :=
| nil {} : list T
| cons : T → list T → list T
namespace list
section
variable {T : Type}
notation `[` l:(foldr `,` (h t, cons h t) nil) `]` := l
check [(... |
19f05083da5c4c12da8c26cf826804e07bf4d571 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/model_theory/semantics.lean | 724ef54eebf9957b917f605d265359d60353b520 | [
"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 | 38,886 | lean | /-
Copyright (c) 2021 Aaron Anderson, Jesse Michael Han, Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson, Jesse Michael Han, Floris van Doorn
-/
import data.finset.basic
import model_theory.syntax
/-!
# Basics on First-Order Semantics
T... |
19ea9d7de903fe583eb45dfe6e417c3bf9ddc551 | 3dd1b66af77106badae6edb1c4dea91a146ead30 | /library/standard/nat.lean | c6fcd3df24149a1f3bfab9e9e75bc04fa2f08e8c | [
"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 | 50,117 | lean | ----------------------------------------------------------------------------------------------------
-- Copyright (c) 2014 Floris van Doorn. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Author: Floris van Doorn
-----------------------------------------------------------... |
ddf83e7e0089365b7ea15b769b019aeea5f121e2 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/sec_notation2.lean | 8a3610a9b043f236f26c8adf7d34f3e7629f3881 | [
"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 | 440 | lean | open nat
namespace foo
section
section
parameter (A : Type)
definition f (a b : A) : A := a
definition add2 (a : nat) : nat := a + 2
postfix `+.2`:100 := add2
local postfix `++2`:100 := add2
eval 3 +.2
example : 3 +.2 = 3 ++2 := rfl
end
eval 3 +.2
example : 3 +.2 = 3 ++2 := rfl... |
9a084a0f18c6b4e2591aaaee0b4a1c34316c2403 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/order/filter/filter_product.lean | 5dc172ea7d23b559ab922c8b8ab64125b71e749b | [
"Apache-2.0"
] | permissive | Lix0120/mathlib | 0020745240315ed0e517cbf32e738d8f9811dd80 | e14c37827456fc6707f31b4d1d16f1f3a3205e91 | refs/heads/master | 1,673,102,855,024 | 1,604,151,044,000 | 1,604,151,044,000 | 308,930,245 | 0 | 0 | Apache-2.0 | 1,604,164,710,000 | 1,604,163,547,000 | null | UTF-8 | Lean | false | false | 7,237 | 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
-/
import order.filter.ultrafilter
import order.filter.germ
/-!
# Ultraproducts
If `φ` is an ultrafilter, then the space of germs of functions `f :... |
71afe72482b60f05d4fc44d239d0cd833eecb0b4 | 87d5955e1100ba73f6b56149b659e85116fa215b | /group_theory/subgroup.lean | 9dcca7f73978d35fddcece213df1f180dbcf6ccc | [
"Apache-2.0"
] | permissive | avigad/leanproved | 4d15a05f8544a67b9f589c5e656358e1485aef3c | 3cf0f5dda3ace82f6b7cdc159528ce3ebaef159f | refs/heads/master | 1,611,368,103,158 | 1,433,589,072,000 | 1,433,589,072,000 | 36,843,899 | 0 | 0 | null | 1,433,385,918,000 | 1,433,385,918,000 | null | UTF-8 | Lean | false | false | 19,062 | lean | /-
Copyright (c) 2015 Haitao Zhang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author : Haitao Zhang
-/
import data algebra.group data .extra
open function
-- ⁻¹ in eq.ops conflicts with group ⁻¹
-- open eq.ops
local notation H1 ▸ H2 := eq.subst H1 H2
open set
... |
67d91a1d4d7f59a865e979210d40cb2c989cf67d | 4bcaca5dc83d49803f72b7b5920b75b6e7d9de2d | /src/Lean/Syntax.lean | 9ebe9ed32969e8d006a84b7ceaa87558aa889d8d | [
"Apache-2.0"
] | permissive | subfish-zhou/leanprover-zh_CN.github.io | 30b9fba9bd790720bd95764e61ae796697d2f603 | 8b2985d4a3d458ceda9361ac454c28168d920d3f | refs/heads/master | 1,689,709,967,820 | 1,632,503,056,000 | 1,632,503,056,000 | 409,962,097 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 18,098 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Sebastian Ullrich, Leonardo de Moura
-/
import Lean.Data.Name
import Lean.Data.Format
namespace Lean
def SourceInfo.updateTrailing (trailing : Substring) : SourceInfo → SourceI... |
c712648de1b55a3264c75e97d88de49d4117bd6e | 6065973b1fa7bbacba932011c9e2f32bf7bdd6c1 | /src/data/list/nodup_equiv_fin.lean | 347d954720de00e66b80fcec5a06b9af6ef85335 | [
"Apache-2.0"
] | permissive | khmacdonald/mathlib | 90a0fa2222369fa69ed2fbfb841b74d2bdfd66cb | 3669cb35c578441812ad30fd967d21a94b6f387e | refs/heads/master | 1,675,863,801,090 | 1,609,761,876,000 | 1,609,761,876,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,397 | 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 data.list.sort
import data.fin
/-!
# Isomorphism between `fin (length l)` and `{x // x ∈ l}`
Given a list `l,
* if `l` has no duplicates, then `list.... |
58a7e1ba01b9fa59ee603059f5c84471aad8d4e3 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/simp_proof_failure.lean | 11bf1b66d3b362ce619f3444e746d22e1191fd8e | [
"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 | 230 | lean | def α : Type := ℕ → ℕ
set_option trace.app_builder true
example (x y : α) (H : x = y) (n : ℕ) : x n = y n :=
by simp [H]
example (x y : α) (H₁ : x = y) (m n : ℕ) (H₂ : m = n) : x m = y n :=
by simp [H₁, H₂]
|
dc13bbc4c339edac5116a81fce0b7432a2be70c5 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/analysis/box_integral/partition/basic.lean | fd35ecf8078b6cb9139e5dad9ea0e050738e4d69 | [
"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 | 29,302 | 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 analysis.box_integral.box.basic
/-!
# Partitions of rectangular boxes in `ℝⁿ`
In this file we define (pre)partitions of rectangular boxes in `ℝⁿ`. A parti... |
48e4280fd669cfd7aea6134614ad03ea0d1ee98d | 47181b4ef986292573c77e09fcb116584d37ea8a | /src/for_mathlib/principal_ideal_domain.lean | feceafbb6b6f9173ca9eae914a77888aa85ec3a2 | [
"MIT"
] | permissive | RaitoBezarius/berkovich-spaces | 87662a2bdb0ac0beed26e3338b221e3f12107b78 | 0a49f75a599bcb20333ec86b301f84411f04f7cf | refs/heads/main | 1,690,520,666,912 | 1,629,328,012,000 | 1,629,328,012,000 | 332,238,095 | 4 | 0 | MIT | 1,629,312,085,000 | 1,611,414,506,000 | Lean | UTF-8 | Lean | false | false | 696 | lean |
import ring_theory.ideal.basic
import ring_theory.principal_ideal_domain
theorem submodule.is_principal.prime_generator_of_prime {α} [comm_ring α] (I: ideal α)
[submodule.is_principal I] [is_prime: ideal.is_prime I] (ne_bot: I ≠ ⊥):
prime (submodule.is_principal.generator I) :=
⟨
by {
intro h,
rw ← subm... |
fa3f0852c1b65c82d7bfc2481e2e27edfa23bf4d | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/ring_theory/free_ring.lean | 2b507ef0f06e022b4d5f7a5fe00e95e49dddf002 | [
"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 | 3,757 | lean | /-
Copyright (c) 2019 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Johan Commelin
-/
import group_theory.free_abelian_group
import ring_theory.subring
/-!
# Free rings
The theory of the free ring over a type.
## Main definitions
* `free_ring... |
fb70406fa233a0ab3a0dca4705c7a5da6eb45e9c | e94d3f31e48d06d252ee7307fe71efe1d500f274 | /library/data/list/basic.lean | bd96fa248b6eba341488904a6bc5a03678f170e1 | [
"Apache-2.0"
] | permissive | GallagherCommaJack/lean | e4471240a069d82f97cb361d2bf1a029de3f4256 | 226f8bafeb9baaa5a2ac58000c83d6beb29991e2 | refs/heads/master | 1,610,725,100,482 | 1,459,194,829,000 | 1,459,195,377,000 | 55,377,224 | 0 | 0 | null | 1,459,731,701,000 | 1,459,731,700,000 | null | UTF-8 | Lean | false | false | 26,371 | 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
Basic properties of lists.
-/
import logic tools.helper_tactics data.nat.order data.nat.sub
open eq.ops nat prod... |
d074619448acf985851471591abd35ae13a82246 | 3863d2564418bccb1859e057bf5a4ef240e75fd7 | /hott/types/prod.hlean | 81b88c52040ece0e4b61400d5896db0456ac2599 | [
"Apache-2.0"
] | permissive | JacobGross/lean | 118bbb067ff4d4af48a266face2c7eb9868fa91c | eb26087df940c54337cb807b4bc6d345d1fc1085 | refs/heads/master | 1,582,735,011,532 | 1,462,557,826,000 | 1,462,557,826,000 | 46,451,196 | 0 | 0 | null | 1,462,557,826,000 | 1,447,885,161,000 | C++ | UTF-8 | Lean | false | false | 9,080 | hlean | /-
Copyright (c) 2014 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Jakob von Raumer
Ported from Coq HoTT
Theorems about products
-/
open eq equiv is_equiv is_trunc prod prod.ops unit
variables {A A' B B' C D : Type} {P Q : A → T... |
1b6ea057ec18fe139fb4e85019dce01a92c65aed | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/order/basic_auto.lean | b7e3649bead358b8a501e5dcfc3e453271d327a6 | [] | 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 | 26,033 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Mario Carneiro
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.subtype
import Mathlib.data.prod
import Mathlib.PostPort
universes u_1 ... |
7008ba53bc9a0783364fc5c4610a2174e72c86c7 | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /counterexamples/linear_order_with_pos_mul_pos_eq_zero.lean | 96fe79c14b7b810fe16201939d0b06f1d26507a5 | [
"Apache-2.0"
] | permissive | hikari0108/mathlib | b7ea2b7350497ab1a0b87a09d093ecc025a50dfa | a9e7d333b0cfd45f13a20f7b96b7d52e19fa2901 | refs/heads/master | 1,690,483,608,260 | 1,631,541,580,000 | 1,631,541,580,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,139 | lean | /-
Copyright (c) 2021 Johan Commelin.
All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Damiano Testa, Kevin Buzzard
-/
import algebra.ordered_monoid
/-!
An example of a `linear_ordered_comm_monoid_with_zero` in which the product of two positive
elements ... |
8f3b763dfec80240e25b3cf4ba9628824beae209 | 4bcaca5dc83d49803f72b7b5920b75b6e7d9de2d | /src/Lean/Elab/Syntax.lean | 5b74d6f5af5e8837f3abfb5dbaa23cd2257677ec | [
"Apache-2.0"
] | permissive | subfish-zhou/leanprover-zh_CN.github.io | 30b9fba9bd790720bd95764e61ae796697d2f603 | 8b2985d4a3d458ceda9361ac454c28168d920d3f | refs/heads/master | 1,689,709,967,820 | 1,632,503,056,000 | 1,632,503,056,000 | 409,962,097 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 15,738 | 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» := ... |
e1a647cfd1b0363af094f7e5330cf22f9ec27cfb | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/parsing_only.lean | e542e4cc685a950631ef31ac6d73327cc1d4e4a0 | [
"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 | 199 | lean | import logic
constant f : num → num
constant g : num → num
notation a `+++` := f a
notation [parsing_only] a `***` := g a
check 10 +++
check 10 ***
check Type.{8} -- Type₊ should not be used
|
4e456522acc53a9841cc7c7d8563d9594ede2ec5 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/macroElabRulesIssue2.lean | 640f98cda8320c2646bb9ea2cdfab4308dc409da | [
"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 | 489 | lean | import Lean
open Lean Elab
declare_syntax_cat fixDecl
syntax ident : fixDecl
syntax ident "<" term : fixDecl
syntax "Fix₁ " fixDecl : tactic
elab_rules : tactic
| `(tactic| Fix₁ $x:ident) => logInfo "simple"
elab_rules : tactic
| `(tactic| Fix₁ $x:ident < $bound:term) =>
throwError "Failed at elab_rules"
m... |
477888f87ab88bd6473c79a432f56f84c1248a60 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/bug_proving_eqn_lemmas.lean | 0bd728ff1bd65bc31e0de4c7424e96b39766c99d | [
"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 | 355 | lean | universe variables u
inductive bintree (α : Type u)
| leaf : α → bintree
| node : bintree → bintree → bintree
open bintree
def to_list {α : Type u} : bintree α → list α → list α
| (leaf α) l := α :: l
| (node t₁ t₂) l := to_list t₁ (to_list t₂ l)
#eval to_list (node (node (leaf 1) (leaf 2)) (node (leaf 3) (leaf... |
d91027d991c857fb57751d181119df8452ea803f | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/eqn_sanitizer1.lean | e72a5561746789dd04528068aaa1b385f7090554 | [
"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 | 442 | lean | set_option eqn_compiler.dsimp true
attribute [eqn_sanitizer]
definition succ_eq (a : nat) : nat.succ a = a + 1 :=
rfl
attribute [eqn_sanitizer]
definition succ_add_eq (a : nat) : nat.succ (a + 1) = a + 2 :=
rfl
definition fib : nat → nat
| 0 := 1
| 1 := 1
| (n+2) := fib (n+1) + fib n
example : fib 0 = 1 := r... |
d5d3706f8b3f48b9d3f63c18fb1dae43a1984bcc | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/monoidal/category_auto.lean | 6cf7cf6e56b56a3c863d66a934cdf44b97b50468 | [] | 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 | 25,384 | lean | /-
Copyright (c) 2018 Michael Jendrusch. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Michael Jendrusch, Scott Morrison
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.category_theory.products.basic
import Mathlib.PostPort
universes v u... |
e02e2c40813f657a342fe756738c221897f09ce3 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/linear_algebra/finsupp_vector_space.lean | 30f725e3751984fd523401b82c3fab8041ef7f01 | [
"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,618 | 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
-/
import linear_algebra.std_basis
/-!
# Linear structures on function with finite support `ι →₀ M`
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this f... |
e99f89a09e6a2540d66b984d06c473b206316fa3 | c31182a012eec69da0a1f6c05f42b0f0717d212d | /src/pseudo_normed_group/category.lean | 1db8ec57a93b664403e22763c223a55a365ac42f | [] | no_license | Ja1941/lean-liquid | fbec3ffc7fc67df1b5ca95b7ee225685ab9ffbdc | 8e80ed0cbdf5145d6814e833a674eaf05a1495c1 | refs/heads/master | 1,689,437,983,362 | 1,628,362,719,000 | 1,628,362,719,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,459 | lean | import category_theory.concrete_category.bundled_hom
import topology.category.Profinite
import data.equiv.fin
import pseudo_normed_group.with_Tinv
/-!
# The category of profinitely filtered pseudo-normed groups.
The category of profinite pseudo-normed groups, and the category of
profinitely filtered pseudo-normed g... |
5ac311f7a075a3e81c631d7496452ddb1d5212ce | ec040be767d27b10d2f864ddcfdf756aeb7a9a0a | /src/assignments/assignment_3/assignment_3.lean | df3019beb2cff5eb3d8257575f052f656b084e1c | [] | no_license | RoboticPanda77/complogic-s21 | b26a9680dfb98ac650e40539296c0cafc86f5cb4 | 93c5bcc0139c0926cc261075f50a8b1ead6aa40c | refs/heads/master | 1,682,196,614,558 | 1,620,625,035,000 | 1,620,625,035,000 | 337,230,148 | 0 | 0 | null | 1,620,625,036,000 | 1,612,824,240,000 | Lean | UTF-8 | Lean | false | false | 6,777 | lean | /-
HIGHER-ORDER FUNCTION WARMUP
ncm5jv
-/
/-
1. Write a function, double, that takes
a natural number and returns its double.
Write it using the following recursive
definition:
- double 0 = 0
- double (n' + 1) = double n' + 2
-/
def double : ℕ → ℕ
| 0 := 0
| (n' + 1) := (double n') + 2
/-
2. Write a function, map_l... |
02f6d9152280f7e4b76c2ae0c78659e3d81801f0 | dfd42d30132c2867977fefe7edae98b6dc703aeb | /src/similarity.lean | 3b7ea822bb3d430256cb41b16a084f8bcb7413eb | [] | no_license | justadzr/lean-2021 | 1e42057ac75c794c94b8f148a27a24150c685f68 | dfc6b30de2f27bdba5fbc51183e2b84e73a920d1 | refs/heads/master | 1,689,652,366,522 | 1,630,313,809,000 | 1,630,313,809,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,481 | lean | import analysis.normed_space.conformal_linear_map
import analysis.calculus.times_cont_diff
noncomputable theory
open filter continuous_linear_map
open_locale real_inner_product_space classical filter topological_space
section conformality
lemma is_conformal_map.symm {R : Type*} {X Y : Type*} [nondiscrete_normed_fiel... |
f487278734d70a3330d6b4dc8bea3dd6c06099ac | 491068d2ad28831e7dade8d6dff871c3e49d9431 | /library/logic/quantifiers.lean | ca55b9cdd983e24a530cc382cd67fbdd92f80bda | [
"Apache-2.0"
] | permissive | davidmueller13/lean | 65a3ed141b4088cd0a268e4de80eb6778b21a0e9 | c626e2e3c6f3771e07c32e82ee5b9e030de5b050 | refs/heads/master | 1,611,278,313,401 | 1,444,021,177,000 | 1,444,021,177,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,021 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Jeremy Avigad
Universal and existential quantifiers. See also init.logic.
-/
import .connectives
open inhabited nonempty
theorem exists_imp_distrib {A : Typ... |
dd7e95f3991ceba5e6eb3d60d5b33ab0b616bc31 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/data/nat/cast.lean | 23af44230e9ab0b15f8bdf67c8bc7d667c443b9c | [
"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 | 11,935 | lean | /-
Copyright (c) 2014 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import algebra.ordered_field
import data.nat.basic
/-!
# Cast of naturals
This file defines the *canonical* homomorphism from the natural numbers into a type `α` wi... |
eb590ab034403f689f0bee280c8117712787a5d6 | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/measure_theory/measure_space.lean | ec15e9c46077a01be3c7c2d9ffbadefcce54b0ba | [
"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 | 35,583 | 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
-/
import data.set.lattice data.set.finite
import topology.instances.ennreal
measure_theory.outer_measure
/-!
# Measure spaces
Measures are rest... |
1760debd48fd55719c0409b90656a5a863a8772d | 432d948a4d3d242fdfb44b81c9e1b1baacd58617 | /src/algebra/char_zero.lean | 973a44515c44bb7891460db01789e902d2600925 | [
"Apache-2.0"
] | permissive | JLimperg/aesop3 | 306cc6570c556568897ed2e508c8869667252e8a | a4a116f650cc7403428e72bd2e2c4cda300fe03f | refs/heads/master | 1,682,884,916,368 | 1,620,320,033,000 | 1,620,320,033,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,533 | lean | /-
Copyright (c) 2014 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.nat.cast
import data.fintype.basic
import tactic.wlog
/-!
# Characteristic zero
A ring `R` is called of characteristic zero if every natural number `n`... |
122f3bd567d4c3fb67ac96ec127c356648648782 | ba4794a0deca1d2aaa68914cd285d77880907b5c | /src/game/world10/level13.lean | c8e9b32247bf27cc16ad9c2caaa0c65ac1f6a2d5 | [
"Apache-2.0"
] | permissive | ChrisHughes24/natural_number_game | c7c00aa1f6a95004286fd456ed13cf6e113159ce | 9d09925424da9f6275e6cfe427c8bcf12bb0944f | refs/heads/master | 1,600,715,773,528 | 1,573,910,462,000 | 1,573,910,462,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 849 | lean | import game.world10.level12 -- hide
namespace mynat -- hide
/-
# Inequality world.
## Level 12: `not_succ_le_self`
Turns out that `¬ P` is *by definition* `P → false`, so you can just
start this one with `intro h` if you like.
## Pro tip:
```
conv begin
to_lhs,
rw hc,
end,
```
is an incantation whi... |
038196c1ca1d4ca0d27863b94267b2452222e0c6 | 5a6ff5f8d173cbfe51967eb4c96837e3a791fe3d | /mm0-lean/mm0/mm0.lean | bb62932ee46ce69e047ae9c31b49f25e85af51b5 | [
"CC0-1.0"
] | permissive | digama0/mm0 | 491ac09146708aa1bb775007bf3dbe339ffc0096 | 98496badaf6464e56ed7b4204e7d54b85667cb01 | refs/heads/master | 1,692,321,030,902 | 1,686,254,458,000 | 1,686,254,458,000 | 172,456,790 | 273 | 38 | CC0-1.0 | 1,689,939,563,000 | 1,551,080,059,000 | Rust | UTF-8 | Lean | false | false | 8,612 | lean | import data.finset
namespace mm0
structure sort_data := (pure strict provable free : bool := ff)
def sort_id := ℕ
def term_id := ℕ
def thm_id := ℕ
def var_id := ℕ
inductive binder
| bound : sort_id → binder
| reg : sort_id → finset var_id → binder
def binder.sort : binder → sort_id
| (binder.bound s) := s
| (binde... |
b5dc98ab14008c805416d3379566a3f727ee94c5 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/1292.lean | ceef3968152c01864e42e63ff0129b6b0afd72e4 | [
"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 | 402 | lean | def test : Nat :=
let inp : Array (Option Nat × Nat) := #[(some 0, 0), (none, 0)]
let fvars : Array Nat := inp.filterMap fun
| (some _, _) => none
| (none, fv) => fv
fvars.size
#eval test
def test2 : Nat :=
let inp : Array (Option Nat × Nat) := #[(some 0, 0)]
let fvars : Array Nat := inp.filterMap ... |
4ef976650e9907c14db29a758a36a0bbe1921239 | 1abd1ed12aa68b375cdef28959f39531c6e95b84 | /src/analysis/calculus/specific_functions.lean | 2b22731aa29c5cacc395726431c40105fb0f00da | [
"Apache-2.0"
] | permissive | jumpy4/mathlib | d3829e75173012833e9f15ac16e481e17596de0f | af36f1a35f279f0e5b3c2a77647c6bf2cfd51a13 | refs/heads/master | 1,693,508,842,818 | 1,636,203,271,000 | 1,636,203,271,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 18,946 | lean | /-
Copyright (c) 2020 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import analysis.calculus.iterated_deriv
import analysis.inner_product_space.euclidean_dist
/-!
# Infinitely smooth bump function
In this file we construct sev... |
f2fdbe647f542ee1c4de5de1a79ac4c75af54a95 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/core.lean | 029427c258285abe3e39487de1386c29802aaf15 | [] | 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 | 2,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
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.category_theory.groupoid
import Mathlib.control.equiv_functor
import Mathlib.category_theory... |
54dc22ef1083c5b9641ec7408c4c4d06d25eece2 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/tactic/simp_result.lean | 7b79019f31d85a0852271a8ca28ffafa5bc28aab | [
"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,499 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner, Scott Morrison
-/
import tactic.core
/-!
# simp_result
`dsimp_result` and `simp_result` are a pair of tactics for
applying `dsimp` or `simp` to the result produced by ... |
2c942ce9bb602ba4525e2956d31f663b63b2c9e3 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/category_theory/sites/sheaf_of_types.lean | 1161cc8c4380c27b6a678862ad5bfef725db8fc4 | [
"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 | 40,804 | 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.sites.pretopology
import category_theory.limits.shapes.types
import category_theory.full_subcategory
/-!
# Sheaves of types on a Grothendieck top... |
d1fc3299b2a74c9ec70492d8e3f0066971cf7b78 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/measure_theory/prod_group.lean | 7ea99b00276fffcd281432522cbfc3ef1bd9ea3f | [] | 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 | 9,387 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.measure_theory.prod
import Mathlib.measure_theory.group
import Mathlib.PostPort
univer... |
46b0aad432e997b9f849951614ce418b14b32d57 | 32025d5c2d6e33ad3b6dd8a3c91e1e838066a7f7 | /src/Lean/CoreM.lean | 3736d4aeb6220ab2d4d54112ce43a68a543d03cf | [
"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 | 3,832 | 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.RecDepth
import Lean.Util.Trace
import Lean.Environment
import Lean.Exception
import Lean.InternalExceptionId
import Lean.Eval
import Lean.... |
a11086f24ff231b883e46e25264f9fd5b863202e | 22e97a5d648fc451e25a06c668dc03ac7ed7bc25 | /src/field_theory/subfield.lean | fd2c48262ba0fba70598fe435a578f2982921003 | [
"Apache-2.0"
] | permissive | keeferrowan/mathlib | f2818da875dbc7780830d09bd4c526b0764a4e50 | aad2dfc40e8e6a7e258287a7c1580318e865817e | refs/heads/master | 1,661,736,426,952 | 1,590,438,032,000 | 1,590,438,032,000 | 266,892,663 | 0 | 0 | Apache-2.0 | 1,590,445,835,000 | 1,590,445,835,000 | null | UTF-8 | Lean | false | false | 4,935 | lean | /-
Copyright (c) 2018 Andreas Swerdlow. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Andreas Swerdlow
-/
import ring_theory.subring
variables {F : Type*} [field F] (S : set F)
section prio
set_option default_priority 100 -- see Note [default priority]
class is_subf... |
4bc09678b397edbe14c6534ce269ac32f138b1d7 | 947b78d97130d56365ae2ec264df196ce769371a | /src/Lean/Data/Lsp/TextSync.lean | 6ec1e39df59edfce5e724fc66e9a1b1226df4cf4 | [
"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 | 3,961 | 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
/-! Section "Text Document Synchronization" of the LSP spec. -/
namespace Lean
namespace Lsp
ope... |
2a07c1f75837c1964352e87a1c89484be27ec01f | 675b8263050a5d74b89ceab381ac81ce70535688 | /src/data/list/basic.lean | 88df8f4f7d6220a8b1d90d1d06100bccfaab3bf3 | [
"Apache-2.0"
] | permissive | vozor/mathlib | 5921f55235ff60c05f4a48a90d616ea167068adf | f7e728ad8a6ebf90291df2a4d2f9255a6576b529 | refs/heads/master | 1,675,607,702,231 | 1,609,023,279,000 | 1,609,023,279,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 185,607 | 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
-/
import algebra.order_functions
import control.monad.basic
import data.nat.choose.basic
import ... |
e47bd37dd23d073c73cf3b75aff2fd3645212caf | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/tactic/monotonicity/interactive.lean | 28415e9d88002b880377417a8b81c7fa34f2fa7a | [
"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 | 23,567 | lean | /-
Copyright (c) 2019 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
-/
import tactic.monotonicity.basic
import control.traversable
import control.traversable.derive
import data.dlist
variables {a b c p : Prop}
namespace tactic.interactive
o... |
5ad363d1a78e365e54c27b32244694e7dbd99d62 | b392eb79fb36952401156496daa60628ccb07438 | /MathPort/ProcessActionItem.lean | 6978b00a1416503fee15a4f5d684b48047a06564 | [
"Apache-2.0"
] | permissive | AurelienSaue/mathportsource | d9eabe74e3ab7774baa6a10a6dc8d4855ff92266 | 1a164e4fff7204c522c1f4ecc5024fd909be3b0b | refs/heads/master | 1,685,214,377,305 | 1,623,621,223,000 | 1,623,621,223,000 | 364,191,042 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 24,112 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Daniel Selsam, Gabriel Ebner
-/
import MathPort.Util
import MathPort.Basic
import MathPort.ActionItem
import MathPort.Rules
import MathPort.Translate
import MathPort.OldRecursor... |
aca74348bf2836a7a29637aa6a7118ebfbef711b | 947b78d97130d56365ae2ec264df196ce769371a | /stage0/src/Init/Control/Monad.lean | 0252acd662df82e6cc59eea9e7c460d0fbe3b5c2 | [
"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 | 1,797 | lean | /-
Copyright (c) Luke Nelson and Jared Roesch. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Luke Nelson, Jared Roesch, Sebastian Ullrich
-/
prelude
import Init.Control.Applicative
import Init.Coe
universes u v w
open Function
class HasBind (m : T... |
ba288dd596ab6d24a6cf970206c368fb40a5a2d8 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/topology/metric_space/gromov_hausdorff.lean | 1a2f9a7ecd65abe1920a5edbbc7176ded32b0cd7 | [
"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 | 55,399 | 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 topology.metric_space.closeds
import set_theory.cardinal
import topology.metric_space.gromov_hausdorff_realized
import topology.metric_space.completion
i... |
667a1294c8db97cb98efb6299106f9f31e7d150a | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/order/filter/at_top_bot.lean | aba8aec7abd07b02576fada574f40405af5108fd | [
"Apache-2.0"
] | permissive | troyjlee/mathlib | e18d4b8026e32062ab9e89bc3b003a5d1cfec3f5 | 45e7eb8447555247246e3fe91c87066506c14875 | refs/heads/master | 1,689,248,035,046 | 1,629,470,528,000 | 1,629,470,528,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 61,836 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Jeremy Avigad, Yury Kudryashov, Patrick Massot
-/
import order.filter.bases
import data.finset.preimage
/-!
# `at_top` and `at_bot` filters on preorded sets, monoids a... |
0c16f0b5345ea842fb2e7565806a23f9ab43ad68 | 5d76f062116fa5bd22eda20d6fd74da58dba65bb | /src/pairing_based_snark_scheme.lean | 701b78a3e150744e633fd7d735979cc641d6d246 | [] | no_license | brando90/formal_baby_snark | 59e4732dfb43f97776a3643f2731262f58d2bb81 | 4732da237784bd461ff949729cc011db83917907 | refs/heads/master | 1,682,650,246,414 | 1,621,103,975,000 | 1,621,103,975,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 680 | lean |
import data.mv_polynomial.basic
section
/-!
This file should contain a general scheme for pairing based SNARKs in the sense of
What are the toxic waste elements?
What are the CRS elements?
What are the proof elements?
What equalities does the verification/the crs process enforce?
Does all this express in full ge... |
fa97045f7f7aa757d2b3fd1f804540826f84d86a | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/data/polynomial/erase_lead.lean | 6dc66ac43f2fdfcae398e113fd6f7e72e0ccb807 | [
"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 | 6,977 | lean | /-
Copyright (c) 2020 Damiano Testa. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Damiano Testa
-/
import data.polynomial.degree.trailing_degree
import data.polynomial.inductions
/-!
# Erase the leading term of a univariate polynomial
## Definition
* `erase_lead f... |
b5d93bbaf85878c26434764817e0e341a945584e | 367134ba5a65885e863bdc4507601606690974c1 | /src/category_theory/limits/constructions/over/products.lean | e4a1f3cb0764bed12309ab99d292abac1cae5dc0 | [
"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 | 6,143 | lean | /-
Copyright (c) 2018 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Reid Barton, Bhavik Mehta
-/
import category_theory.over
import category_theory.limits.shapes.pullbacks
import category_theory.limits.shapes.wide_pullbacks
import categ... |
9a9601c35eed61ab0223029c2207aced26bba7f3 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/analysis/normed_space/banach.lean | 1f486c79d2f9dd9e7176f9a45de4e7db28c1ad9e | [
"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 | 16,998 | 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 topology.metric_space.baire
import analysis.normed_space.operator_norm
/-!
# Banach open mapping theorem
This file contains the Banach open mapping the... |
1a92c6c53c60833c9aa6e2767bb51bce0de6e56b | d1a52c3f208fa42c41df8278c3d280f075eb020c | /stage0/src/Init/Control/Lawful.lean | 021e3926a4942830a5e78463c940b6acaec7406b | [
"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 | 14,267 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich, Leonardo de Moura
-/
prelude
import Init.SimpLemmas
import Init.Control.Except
import Init.Control.StateRef
open Function
@[simp] theorem monadLift_self [Mo... |
2aa7a2629dd95e7dbbc9004580f29cc760d4b7ca | 37da0369b6c03e380e057bf680d81e6c9fdf9219 | /hott/hit/two_quotient.hlean | 0aacd9e55bfd1619330735d8d1d1563ee09ab285 | [
"Apache-2.0"
] | permissive | kodyvajjha/lean2 | 72b120d95c3a1d77f54433fa90c9810e14a931a4 | 227fcad22ab2bc27bb7471be7911075d101ba3f9 | refs/heads/master | 1,627,157,512,295 | 1,501,855,676,000 | 1,504,809,427,000 | 109,317,326 | 0 | 0 | null | 1,509,839,253,000 | 1,509,655,713,000 | C++ | UTF-8 | Lean | false | false | 31,482 | 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
-/
import homotopy.circle eq2 algebra.e_closure cubical.squareover cubical.cube
open quotient eq circle sum sigma equiv function relation e_closure
/-
Thi... |
4cedf76e1a63d0fb757bed9f52475060591e115c | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch4/ex0404.lean | 52404c170f40a5a7fee16196c0b9a76f9088eee6 | [] | 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 | 226 | lean | variables (α : Type) (p q : α → Prop)
example (h : ∃ x, p x ∧ q x) : ∃ x, q x ∧ p x :=
exists.elim h
(assume w,
assume hw : p w ∧ q w,
show ∃ x, q x ∧ p x, from ⟨w, hw.right, hw.left⟩)
|
2eed65caee2a1b67dcbd1747d0b127891b1cb224 | 82b86ba2ae0d5aed0f01f49c46db5afec0eb2bd7 | /tests/lean/match1.lean | a3c63d0f8e08e86126945085f7e5581c64805a55 | [
"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 | 3,372 | lean | --
#print "---- h1"
def h1 (b : Bool) : Nat :=
match b with
| true => 0
| false => 10
#eval h1 false
#print "---- h2"
def h2 (x : List Nat) : Nat :=
match x with
| [x1, x2] => x1 + x2
| x::xs => x
| _ => 0
#eval h2 [1, 2]
#eval h2 [10, 4, 5]
#eval h2 []
#print "---- h3"
def h3 (x : Array Nat) : Nat :... |
f01b1ca977e635b083b54b7ab4f4b6d5efbcdce4 | 2eab05920d6eeb06665e1a6df77b3157354316ad | /src/geometry/euclidean/basic.lean | 3edd5bc4fbb77c6604be85b97abbce511890dfb4 | [
"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 | 56,024 | lean | /-
Copyright (c) 2020 Joseph Myers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Joseph Myers, Manuel Candales
-/
import analysis.inner_product_space.projection
import analysis.special_functions.trigonometric.inverse
import algebra.quadratic_discriminant
import linea... |
8329a2591a59c72567134a7ebd8da44f4d6ef36b | 618003631150032a5676f229d13a079ac875ff77 | /src/tactic/omega/int/main.lean | 2d93acb268c4f5f3ab3922ca5ca6f799fc60ba89 | [
"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 | 6,301 | lean | /- Copyright (c) 2019 Seul Baek. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Seul Baek
Main procedure for linear integer arithmetic. -/
import tactic.omega.prove_unsats
import tactic.omega.int.dnf
open tactic
namespace omega
namespace int
open_locale omega.int
r... |
c8bcdc51f7a122996b51cb4375569b6b34f4eeff | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/finset/default_auto.lean | 5eb26c77867326d1b230648378ad27f1d190b5d9 | [] | 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 | 430 | lean | import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.finset.basic
import Mathlib.data.finset.fold
import Mathlib.data.finset.intervals
import Mathlib.data.finset.lattice
import Mathlib.data.finset.nat_antidiagonal
import Mathlib.data.finset.pi
import Mathlib.data.finset.powerset
import Mathli... |
8b2d86061039b4a205a4a27ac036588a1fd96344 | e21db629d2e37a833531fdcb0b37ce4d71825408 | /src/use_cases/assign_mcl/defs.lean | 9d1b43e1d1739bebea92de854a98e99e1eb18c3d | [] | no_license | fischerman/GPU-transformation-verifier | 614a28cb4606a05a0eb27e8d4eab999f4f5ea60c | 75a5016f05382738ff93ce5859c4cfa47ccb63c1 | refs/heads/master | 1,586,985,789,300 | 1,579,290,514,000 | 1,579,290,514,000 | 165,031,073 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,314 | lean | import mcl.defs
import mcl.rhl
--import parlang
import syncablep
open mcl
open mcl.mclk
open mcl.rhl
open parlang
open parlang.state
open parlang.thread_state
namespace assign_mcl
def sigc : signature_core
| "tid" := { scope := scope.tlocal, type := ⟨1, type.int⟩ }
| _ := { scope := scope.shared, type := ⟨1, type.in... |
51aeab54968ed32842ee9c971095fcc8e8027808 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/number_theory/dioph.lean | dd5945c511e24ba62bf371487d0b0e88f3e24544 | [
"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 | 25,639 | 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.fin.fin2
import data.pfun
import data.vector3
import number_theory.pell
/-!
# Diophantine functions and Matiyasevic's theorem
Hilbert's tenth problem as... |
1a97b24b21afe972d1e92835d3b285368dfcd065 | 2a70b774d16dbdf5a533432ee0ebab6838df0948 | /_target/deps/mathlib/src/data/polynomial/reverse.lean | 9c5bed695fe3b3b649c42036ed694161c50d8b38 | [
"Apache-2.0"
] | permissive | hjvromen/lewis | 40b035973df7c77ebf927afab7878c76d05ff758 | 105b675f73630f028ad5d890897a51b3c1146fb0 | refs/heads/master | 1,677,944,636,343 | 1,676,555,301,000 | 1,676,555,301,000 | 327,553,599 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,048 | lean | /-
Copyright (c) 2020 Damiano Testa. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Damiano Testa
-/
import data.polynomial.erase_lead
import data.polynomial.degree
/-!
# Reverse of a univariate polynomial
The main definition is `reverse`. Applying `reverse` to a po... |
ad0e2340a547011d5cb66451396370aa440646f7 | 6b10c15e653d49d146378acda9f3692e9b5b1950 | /examples/basic_skills/unnamed_710.lean | 029722423034e5220da0b353b70acc08c80ecd0f | [] | no_license | gebner/mathematics_in_lean | 3cf7f18767208ea6c3307ec3a67c7ac266d8514d | 6d1462bba46d66a9b948fc1aef2714fd265cde0b | refs/heads/master | 1,655,301,945,565 | 1,588,697,505,000 | 1,588,697,505,000 | 261,523,603 | 0 | 0 | null | 1,588,695,611,000 | 1,588,695,610,000 | null | UTF-8 | Lean | false | false | 126 | lean | namespace my_ring
variables {R : Type*} [ring R]
-- BEGIN
theorem zero_mul (a : R) : 0 * a = 0 :=
sorry
-- END
end my_ring |
1bbfb00a2344fc2f922e6828c8cb3c6efd500390 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/data/seq/wseq.lean | 842bfc06f6f783357ebd8dde02c6a073904b3740 | [
"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 | 55,354 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.dlist
import data.list.basic
import data.seq.seq
open function
universes u v w
/-
coinductive wseq (α : Type u) : Type u
| nil : wseq α
| cons : ... |
c69521a11e96dae769f8535ec3f9b93f9f5accdd | e61a235b8468b03aee0120bf26ec615c045005d2 | /src/Init/Lean/MetavarContext.lean | 5137709b819a2e64a0b90936789930500e67a77c | [
"Apache-2.0"
] | permissive | SCKelemen/lean4 | 140dc63a80539f7c61c8e43e1c174d8500ec3230 | e10507e6615ddbef73d67b0b6c7f1e4cecdd82bc | refs/heads/master | 1,660,973,595,917 | 1,590,278,033,000 | 1,590,278,033,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 47,826 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import Init.Control.Reader
import Init.Data.Nat
import Init.Data.Option
import Init.Lean.Util.MonadCache
import Init.Lean.LocalContext
namespace Le... |
38534c30098475471c14fb0a55d8beae7e13c609 | c31182a012eec69da0a1f6c05f42b0f0717d212d | /src/pseudo_normed_group/basic.lean | b609fb526fe87c13d6f6d6eabf78e09b4bd00801 | [] | no_license | Ja1941/lean-liquid | fbec3ffc7fc67df1b5ca95b7ee225685ab9ffbdc | 8e80ed0cbdf5145d6814e833a674eaf05a1495c1 | refs/heads/master | 1,689,437,983,362 | 1,628,362,719,000 | 1,628,362,719,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 15,291 | lean | import data.real.nnreal
import algebra.group.hom
import algebra.big_operators
import algebra.module.pi
import topology.basic
import hacks_and_tricks.type_pow
/-!
# Pseudo-normed groups
This file contains definitions and basic properties of pseudo-normed (abelian additive) groups.
See for example the comments after ... |
4f80ab17c77e4bc4a2cc734a9196b388a764a078 | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/data/list/basic.lean | 735ee570ebdb93031eab63684018852c043e05dc | [
"Apache-2.0"
] | permissive | waynemunro/mathlib | e3fd4ff49f4cb43d4a8ded59d17be407bc5ee552 | 065a70810b5480d584033f7bbf8e0409480c2118 | refs/heads/master | 1,693,417,182,397 | 1,634,644,781,000 | 1,634,644,781,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 192,760 | 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
-/
import control.monad.basic
import data.nat.basic
/-!
# Basic properties of lists
-/
open fun... |
4f6d2d106fed095494c0be681463519222d615c9 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/data/mv_polynomial/basic.lean | ab08656db9308c4666c64a8fce378308043e0584 | [
"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 | 37,623 | 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
import data.finsupp.antidiagonal
/-!
# Multivariate polynomials
This file defines polynomial rings over... |
03ea9e7b89888da97ce1f810f6a13ce5048569be | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/qpf/multivariate/constructions/fix_auto.lean | 64ea601068d01640b15216d7ba5986576da52f8b | [] | 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 | 12,123 | lean | /-
Copyright (c) 2018 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad, Simon Hudon
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.pfunctor.multivariate.W
import Mathlib.data.qpf.multivariate.basic
import Ma... |
f4e595268a3606d84059c1452fffc815af460e81 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/playground/modtest1.lean | 519fd8baec698576d9bae6afd111a8f2cf4c3d4a | [
"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 | 894 | lean | import init.lean.parser.module
open Lean
open Lean.Parser
partial def parseCommands (env : Environment) (displayStx : Bool) : ModuleParser → IO ModuleParser
| p =>
match parseCommand env p with
| (stx, p) =>
if isEOI stx then pure p
else do
when displayStx (IO.println stx);
parseCommands p
def... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.