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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
c2d7c8377bf96d1789cd6f24ec525a845330001f | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/linear_algebra/matrix/charpoly/finite_field.lean | 010277b4b321cd159354e81413ea6c3287150075 | [
"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 | 2,236 | lean | /-
Copyright (c) 2020 Aaron Anderson, Jalex Stark. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson, Jalex Stark
-/
import linear_algebra.matrix.charpoly.coeff
import field_theory.finite.basic
import data.matrix.char_p
/-!
# Results on characteristic pol... |
2fa1684f177182329d121412deb97e346b7454e9 | 1d265c7dd8cb3d0e1d645a19fd6157a2084c3921 | /src/lessons/lesson8.lean | e14ab962fd551da5b35e3a2e2cf53216b6c5d1a5 | [
"MIT"
] | permissive | hanzhi713/lean-proofs | de432372f220d302be09b5ca4227f8986567e4fd | 4d8356a878645b9ba7cb036f87737f3f1e68ede5 | refs/heads/master | 1,585,580,245,658 | 1,553,646,623,000 | 1,553,646,623,000 | 151,342,188 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 1,889 | lean | variables P Q : Prop
variable forward: P → Q
variable backward: Q → P
def pqEquiv : P ↔ Q := (iff.intro forward backward)
#check pqEquiv
#check iff.elim_left (pqEquiv P Q forward backward)
theorem ifftrans' {P Q R : Prop} (pq: P ↔ Q) (qr: Q ↔ R): P ↔ R :=
begin
apply iff.intro,
assume p,
hav... |
7d15ebb25ac5fb02af4ee4e653139ddff1afec90 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/interactive/unterminatedDocComment.lean | d8c5cc5bc545a56a3cce0ed6a3c65fde2a1f1dd2 | [
"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 | 108 | lean | /--
def a1 := sorry
def a2 := sorry
def a3 := sorry
...
-
--^ insert: /
--^ collectDiagnostics
def a4 := 0
|
18c4d18d7cfab950f0fd3fe268b14d35bbeddd62 | af6139dd14451ab8f69cf181cf3a20f22bd699be | /library/init/native/cf.lean | 0ff728e97dc24e6b858767a2b038831c84c85042 | [
"Apache-2.0"
] | permissive | gitter-badger/lean-1 | 1cca01252d3113faa45681b6a00e1b5e3a0f6203 | 5c7ade4ee4f1cdf5028eabc5db949479d6737c85 | refs/heads/master | 1,611,425,383,521 | 1,487,871,140,000 | 1,487,871,140,000 | 82,995,612 | 0 | 0 | null | 1,487,905,618,000 | 1,487,905,618,000 | null | UTF-8 | Lean | false | false | 2,486 | lean | /-
Copyright (c) 2016 Jared Roesch. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jared Roesch
-/
prelude
import init.meta.format
import init.meta.expr
import init.data.string
import init.category.state
import init.native.ir
import init.native.format
import init.nati... |
dfe7a187ee14d2669ac5c622edeaf5a91f7f0ac5 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/opposites.lean | 07c4fe4dd02cbc2c53e544cd284a6912de0fb269 | [] | 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 | 15,877 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.category_theory.types
import Mathlib.category_theory.equivalence
import Mat... |
2f6393aaec147129268d9a6c8b87b7da8ae10816 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/algebraic_geometry/elliptic_curve/weierstrass.lean | 70aeba4ce34d45dcea644ada64c61335d3704af6 | [
"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 | 32,495 | lean | /-
Copyright (c) 2021 Kevin Buzzard. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Buzzard, David Kurniadi Angdinata
-/
import algebra.cubic_discriminant
import ring_theory.norm
import tactic.linear_combination
/-!
# Weierstrass equations of elliptic curves
W... |
17f95b8cee61dcc086a43577aa015b1a718f8fe9 | 32025d5c2d6e33ad3b6dd8a3c91e1e838066a7f7 | /stage0/src/Lean/Hygiene.lean | af38990f832e6c37d8d1c7e6513fcce680b2ea8f | [
"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 | 1,715 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
-/
import Lean.Syntax
namespace Lean
/- Remark: `MonadQuotation` class is part of the `Init` package and loaded by default since it is used in the builtin com... |
db167c4518ca688ef6e56a31dc1b9e2d38f4814b | 4bcaca5dc83d49803f72b7b5920b75b6e7d9de2d | /stage0/src/Init/System/IO.lean | f7a5a273737a89d3638f49f947f4a18761f937f3 | [
"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 | 21,349 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Luke Nelson, Jared Roesch, Leonardo de Moura, Sebastian Ullrich
-/
prelude
import Init.Control.EState
import Init.Control.Reader
import Init.Data.String
import Init.Data.ByteArr... |
f5ed128fd65c482b715109dceecc592215d4dc5f | 3dd1b66af77106badae6edb1c4dea91a146ead30 | /tests/lean/run/tactic3.lean | b3797c6e590831faacbf814d22e2a1a5231e77a2 | [
"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 | 196 | lean | import standard
using tactic
theorem tst {A B : Prop} (H1 : A) (H2 : B) : A
:= by [trace "first"; state; now |
trace "second"; state; fail |
trace "third"; assumption]
check tst |
ce1a635b0d7286e65685e977497cf62d2ea55571 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/ring_theory/localization.lean | 9f3d5de5eed28aa283e7f9c848605bce196868ba | [
"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 | 73,037 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Mario Carneiro, Johan Commelin, Amelia Livingston
-/
import data.equiv.ring
import group_theory.monoid_localization
import ring_theory.ideal.operations
import ring_theory.algebr... |
06079fe7e41e91d45664b7aeee95357182aa7d1d | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/coeSort2.lean | 7948504179de6de54b30c896afceafd34460d6b8 | [
"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 | 251 | lean |
universe u
structure Group :=
(carrier : Type u) (mul : carrier → carrier → carrier) (one : carrier)
instance GroupToType : CoeSort Group (Type u) :=
CoeSort.mk (fun g => g.carrier)
variable (g : Group.{1})
#check fun (a b : g) => g.mul a b
|
41f26ee7bee2502ff63b84e06e8c664f6b0db8ed | 359199d7253811b032ab92108191da7336eba86e | /src/instructor/lectures/lecture_12.lean | 8ecaab9a65822f837f896bd5ff72775848829a25 | [] | no_license | arte-et-marte/my_cs2120f21 | 0bc6215cb5018a3b7c90d9d399a173233f587064 | 91609c3609ad81fda895bee8b97cc76813241e17 | refs/heads/main | 1,693,298,928,348 | 1,634,931,202,000 | 1,634,931,202,000 | 399,946,705 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,222 | lean |
/-
Remember: A predicate is a proposition with
one or more parameters. A simple example of
a predicate with one parameter (or argument)
is *evenness* of a natural number. Let's call
it ev. Then ev takes a single natural number
as an argument and returns the proposition
that *that* number is even (e.g., that the
number... |
040648990df2c09ee1e9fd3504def0ea96e0e3bd | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/topology/maps.lean | 1461b4864ec9bff1d5b077b6b973c66bb5f01dd5 | [
"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 | 15,395 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro, Patrick Massot
Specific classes of maps between topological spaces: embeddings, open maps, quotient maps.
-/
import topology.order topology.separation
... |
d22b92fe620a17f5f14b53c5182135c71f014070 | 08bd4ba4ca87dba1f09d2c96a26f5d65da81f4b4 | /src/Lean/Elab/Structure.lean | adac1544d51712f9a60eba472b874ac2ad66f85a | [
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"Apache-2.0",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | gebner/lean4 | d51c4922640a52a6f7426536ea669ef18a1d9af5 | 8cd9ce06843c9d42d6d6dc43d3e81e3b49dfc20f | refs/heads/master | 1,685,732,780,391 | 1,672,962,627,000 | 1,673,459,398,000 | 373,307,283 | 0 | 0 | Apache-2.0 | 1,691,316,730,000 | 1,622,669,271,000 | Lean | UTF-8 | Lean | false | false | 46,109 | 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.Class
import Lean.Parser.Command
import Lean.Meta.Closure
import Lean.Meta.SizeOf
import Lean.Meta.Injective
import Lean.Meta.Structure
import L... |
b9ba92b423a73ee1adea0865a65481ccd1f5c56a | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/interactive/t2.lean | f14dba4bf45763b667c6f66c242f0c4a5dcd4268 | [
"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 | 102 | lean | theorem T2 (a b : Bool) : a → b → a /\ b.
foo.
abort.
variables a b : Bool.
print environment 2.
|
983802e507558ccec076543744793c79e10292c8 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/control/traversable/derive.lean | 47bc547fb6ce09691782b5c17d45b040fc3644b5 | [
"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 | 17,058 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
Automation to construct `traversable` instances
-/
import control.traversable.lemmas
import data.list.basic
namespace tactic.interactive
open tactic list monad functor
met... |
a996d475f7c4fb55f21eb241174d6030d70350fc | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/algebra/category/Group/limits.lean | ca10357a3a4b9a9821a374f89b00385174369439 | [
"Apache-2.0"
] | permissive | agjftucker/mathlib | d634cd0d5256b6325e3c55bb7fb2403548371707 | 87fe50de17b00af533f72a102d0adefe4a2285e8 | refs/heads/master | 1,625,378,131,941 | 1,599,166,526,000 | 1,599,166,526,000 | 160,748,509 | 0 | 0 | Apache-2.0 | 1,544,141,789,000 | 1,544,141,789,000 | null | UTF-8 | Lean | false | false | 9,747 | 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 algebra.category.Mon.limits
import algebra.category.Group.preadditive
import category_theory.over
import category_theory.limits.concrete_category
import catego... |
2ca70603b57266ec10e4019e38cb1a6f9808c0e3 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/group_theory/perm/sign.lean | 03ccd2082eb5b766e92311add38128e8d48ac4f8 | [
"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 | 31,477 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import group_theory.perm.support
import group_theory.order_of_element
import data.finset.fin
import data.int.order.units
/-!
# Sign of a permutation
> THIS FILE IS SYNC... |
51ebafb37b4efebb33ba6c03c8fd34ad92a03c7c | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/theoremType.lean | a52a8418f6c976b5e557580c49213209408e36ba | [
"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 | 117 | lean | theorem ex1 : 1 + 1 = _ := -- Error
show 1 + 1 = 2 by rfl
def ex2 : 1 + 1 = _ := -- Error
show 1 + 1 = 2 by rfl
|
be6d0e6f9021aefd992c5674b0afaae71c241b8a | d436468d80b739ba7e06843c4d0d2070e43448e5 | /src/data/set/intervals.lean | 9e949b5727ae4aedee5347551de337fd64d342cc | [
"Apache-2.0"
] | permissive | roro47/mathlib | 761fdc002aef92f77818f3fef06bf6ec6fc1a28e | 80aa7d52537571a2ca62a3fdf71c9533a09422cf | refs/heads/master | 1,599,656,410,625 | 1,573,649,488,000 | 1,573,649,488,000 | 221,452,951 | 0 | 0 | Apache-2.0 | 1,573,647,693,000 | 1,573,647,692,000 | null | UTF-8 | Lean | false | false | 12,983 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro, Patrick Massot
Intervals
Naming conventions:
`i`: infinite
`o`: open
`c`: closed
Each interval has the name `I` + letter for left side + letter... |
f4a2cdbc8d7ba8f500c71ff3c431a33b58c59b85 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/data/pfunctor/multivariate/basic.lean | ccfceb338e91440be4cc10d7d9796fe1070ffdab | [
"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 | 6,411 | lean | /-
Copyright (c) 2018 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad
-/
import control.functor.multivariate
import data.pfunctor.univariate
import data.sigma
/-!
# Multivariate polynomial functors.
Multivariate polynomial functors are used... |
e5872f67b1b53884b7591f3d6c540d30676691ef | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /02_Dependent_Type_Theory.org.32.lean | 9ea2a5e07694238dc05165c39fec26e3cffa9526 | [] | no_license | cjmazey/lean-tutorial | ba559a49f82aa6c5848b9bf17b7389bf7f4ba645 | 381f61c9fcac56d01d959ae0fa6e376f2c4e3b34 | refs/heads/master | 1,610,286,098,832 | 1,447,124,923,000 | 1,447,124,923,000 | 43,082,433 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 311 | lean | /- page 27 -/
import standard
import data.nat
open nat
constant vec : Type → nat → Type
namespace vec
constant empty : Π A : Type, vec A 0
constant cons : Π (A : Type) (n : nat), A → vec A n → vec A (n + 1)
constant append : Π (A : Type) (n m : nat), vec A m → vec A n → vec A (n + m)
end vec
|
545a7ac38df773a9d9c18f23b36fdc23cc6beb21 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/category_theory/preadditive/functor_category.lean | e6c88afc299972a9a58c5e2aded412136852c63a | [
"Apache-2.0"
] | permissive | robertylewis/mathlib | 3d16e3e6daf5ddde182473e03a1b601d2810952c | 1d13f5b932f5e40a8308e3840f96fc882fae01f0 | refs/heads/master | 1,651,379,945,369 | 1,644,276,960,000 | 1,644,276,960,000 | 98,875,504 | 0 | 0 | Apache-2.0 | 1,644,253,514,000 | 1,501,495,700,000 | Lean | UTF-8 | Lean | false | false | 2,637 | lean | /-
Copyright (c) 2021 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import category_theory.preadditive.default
/-!
# Preadditive structure on functor categories
If `C` and `D` are categories and `D` is preadditive,
then `C ⥤ D` is ... |
66a2438fe248708c63b9fd59556515ed3d68d82c | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /stage0/src/Lean/Modifiers.lean | 5d0ccd0d2b2ac4fa333f06cc2d52db6aaf2fa212 | [
"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 | 1,897 | 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.Environment
namespace Lean
builtin_initialize protectedExt : TagDeclarationExtension ← mkTagDeclarationExtension `protected
@[export lean_add... |
1fc61346ef33d94225cc375e3c4cde26981730d6 | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/order/conditionally_complete_lattice.lean | 302fcf70c3c84cd5c27173f92729610eecee90e9 | [
"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 | 45,789 | lean | /-
Copyright (c) 2018 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import data.set.intervals.ord_connected
/-!
# Theory of conditionally complete lattices.
A conditionally complete lattice is a lattice in which every non-empt... |
a25b980762ee5b4e997d0afc422bc6a8eac47dcd | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /src/Lean/Server/FileWorker.lean | e2e7ebb93d09b7a617d4692c1eaa0e3c80d2dd47 | [
"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 | 36,549 | 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 Init.System.IO
import Std.Data.RBMap
import Lean.Environment
import Lean.PrettyPrinter
import Lean.DeclarationRange
import Lean.Data.Lsp
im... |
d360a52981a5cdaa52238e81f5352b3b342e2cb1 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/number_theory/liouville/liouville_with.lean | 087dce9d8126efe7f213988a59acea8af009debf | [
"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 | 14,816 | lean | /-
Copyright (c) 2021 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov
-/
import analysis.special_functions.pow
import number_theory.liouville.basic
import topology.instances.irrational
/-!
# Liouville numbers with a given exponent... |
e66c585b1b3002759aef2dd0e3efcaf3958c05c9 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/quaternion.lean | 449dbc5ee7f43cfbe585918d659695caf49114d4 | [
"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 | 35,559 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import algebra.algebra.equiv
import linear_algebra.finrank
import linear_algebra.free_module.basic
import linear_algebra.free_module.finite.basic
import set_theory.... |
3af3d92833370271fa968729a02d4538a27c204e | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/matchVarIssue.lean | 5d5a2b6656b64c93f4b3211ec3249e99f4250b75 | [
"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 | 65 | lean | theorem ex {c d : Char} : c = d → c.val = d.val
| rfl => rfl
|
6577fddf0f9164fc0ec9b92246e9aab19b999412 | b70031c8e2c5337b91d7e70f1e0c5f528f7b0e77 | /src/topology/continuous_on.lean | 65f6f80894daad0bcc820f11ef77b308ace20582 | [
"Apache-2.0"
] | permissive | molodiuc/mathlib | cae2ba3ef1601c1f42ca0b625c79b061b63fef5b | 98ebe5a6739fbe254f9ee9d401882d4388f91035 | refs/heads/master | 1,674,237,127,059 | 1,606,353,533,000 | 1,606,353,533,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 35,982 | lean | /-
Copyright (c) 2019 Reid Barton. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import topology.constructions
/-!
# Neighborhoods and continuity relative to a subset
This file defines relative versions
* `nhds_within` of `nhds`
* `co... |
45ddf56e66b71c1b33488fdaa46ea02dc476489a | 6e9cd8d58e550c481a3b45806bd34a3514c6b3e0 | /test/ring_exp.lean | 73d311d139b8f5dc922a4c191b67edf3835be69b | [
"Apache-2.0"
] | permissive | sflicht/mathlib | 220fd16e463928110e7b0a50bbed7b731979407f | 1b2048d7195314a7e34e06770948ee00f0ac3545 | refs/heads/master | 1,665,934,056,043 | 1,591,373,803,000 | 1,591,373,803,000 | 269,815,267 | 0 | 0 | Apache-2.0 | 1,591,402,068,000 | 1,591,402,067,000 | null | UTF-8 | Lean | false | false | 6,306 | lean | import tactic.ring_exp
import algebra.group_with_zero_power
universes u
section addition
/-!
### `addition` section
Test associativity and commutativity of `(+)`.
-/
example (a b : ℚ) : a = a := by ring_exp
example (a b : ℚ) : a + b = a + b := by ring_exp
example (a b : ℚ) : b + a = a + b := by ring_exp
example ... |
91896e46707343ea899a0d07612242c7c7e938d8 | 26ac254ecb57ffcb886ff709cf018390161a9225 | /src/order/filter/basic.lean | 499e61d67e80b863fdd8afbb16b41a1b18d5a3ae | [
"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 | 96,818 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Jeremy Avigad
-/
import order.zorn
import order.copy
import data.set.finite
import tactic.monotonicity
/-!
# Theory of filters on sets
## Main definitions
* `filter`... |
66901ccb66595d835002859638d65bbd65a97ee9 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/1163.lean | 3017c4777534d7b4e7f4d7d855a29ac3c0f213b0 | [
"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 | 456 | lean | import Lean
open Lean Elab Tactic
macro "obviously1" : tactic => `(tactic| exact sorryAx _)
theorem result1 : False := by obviously1
elab "obviously2" : tactic =>
liftMetaTactic1 fun mvarId => mvarId.admit *> pure none
theorem result2 : False := by obviously2
def x : Bool := 0
theorem result3 : False := by obvi... |
86fc4ae38459a6234bd3ff60ddccdba754fef50e | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/order/lattice.lean | 79244113ed26a6ee1877d141881ea479b599eedf | [
"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 | 18,123 | 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
Defines the inf/sup (semi)-lattice with optionally top/bot type class hierarchy.
-/
import order.basic
set_option old_structure_cmd true
universes u v w
variables {α... |
fb4d68fb64f57c4296844f2f68097b02ba78cbda | cf39355caa609c0f33405126beee2739aa3cb77e | /library/init/meta/ref.lean | 01f33c4d630a8ac3e50bb8d830a2d83fc69bb831 | [
"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 | 788 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.meta.tactic
universes u v
namespace tactic
/-- A `ref` performs the role of a mutable variable within a tactic. -/
meta constant ref (α... |
4bdb12766446caab5b01096d66684e03304ea46b | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/number_theory/wilson.lean | c077fc3d2fbec637430667dbf1a22e184bd3fc27 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 3,484 | lean | /-
Copyright (c) 2022 John Nicol. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: John Nicol
-/
import field_theory.finite.basic
/-!
# Wilson's theorem.
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding PR to mathlib4.
This... |
877ef471c218ecdd2760fff35dc1ac81b8e4f9e6 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/measure_theory/covering/density_theorem.lean | 4e5cc91bedc990e64e26f34d5150c53e49fac9ca | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 8,628 | 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 measure_theory.measure.doubling
import measure_theory.covering.vitali
import measure_theory.covering.differentiation
/-!
# Doubling measures and Lebesgue's density ... |
56f0fb5ff6f28a8d7c20dc1a9443279fbfe22b8c | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/algebra/big_operators/pi.lean | 7da2f03bd77b45d6cf171f476829bf89a6dd98ad | [
"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 | 3,895 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon, Patrick Massot
-/
import algebra.big_operators.basic
import algebra.ring.pi
/-!
# Big operators for Pi Types
This file contains theorems relevant to big operators in binary... |
630d0982ca2390e70db0a9fde45fa22dfbae49ae | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/io_fs_error.lean | 21de27e2adccdb773f7adeba2f4a2706cbf5da0b | [
"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 | 441 | lean | import system.io
open io
def tst1 : io unit :=
do o ← stdout,
-- fs.put_str_ln out "hello",
fs.close o
#eval tst1
#eval tst1
def tst2 : io unit :=
do o ← stderr,
-- fs.put_str_ln out "world",
fs.close o
#eval tst2
def tst3 : io unit :=
do h ← mk_file_handle "io_fs_error.lean" io.mode.read,
fs.close... |
ce9db736944dd8099e5f0451ca3e5e6b3dc32511 | 19a24126e4b7677703434d80717041622a5f1d61 | /theorem_proving_in_lean/4.Quantifiers_and_Equality.lean | 22b7acea151f1598013788169b531d09c7c65567 | [] | no_license | JoseBalado/lean-notes | f5ff8d4c99ba8c1f79d7894ba0f130fa4eb09695 | 0b579f83988cc844ac1ff0592d885061959a852e | refs/heads/master | 1,587,743,561,316 | 1,567,181,955,000 | 1,567,181,955,000 | 172,086,145 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 11,659 | lean | -- 4.1. The Universal Quantifier
-- Prove (∀ x : α, p x ∧ q x) → ∀ y : α, p y
namespace one
variables (α : Type) (p q : α → Prop) -- This defines α and 'p' and 'q' for the whole file
example : (∀ x : α, p x ∧ q x) → ∀ y : α, p y :=
assume h : ∀ x : α, p x ∧ q x,
assume y : α,
show p y, from (h y).left
example : (∀ x... |
df35191976c84467c7b3913a434ec6c829ddda1c | ec040be767d27b10d2f864ddcfdf756aeb7a9a0a | /src/exam1/lin2k_test.lean | a31630d58b85f671d7eea4500d8e26eba960bea8 | [] | 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 | 9,005 | lean | import data.real.basic
import .lin2k
-- Let's work with rational number field
abbreviation K := ℚ
-- Here are nice abbreviations for types
abbreviation scalr := K
abbreviation vectr := K × K
/-
1A. [10 points]
Declare v1, v2, and v3 to be of type
vectr with values (4,6), (-6,2), and
(3, -7), respectively.
-/
de... |
e28cd64a412a53efa7c28c440eca145ba60f3a75 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/representation_theory/Action.lean | 96a4e0500f76ff26c484badfa094bd7630a4815f | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 22,682 | 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 algebra.category.Group.basic
import category_theory.single_obj
import category_theory.limits.functor_category
import category_theory.limits.preserves.basic
imp... |
b25713a03fb3742c18257e68fb2a603070074fa5 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/logic/denumerable.lean | 30c05405be863e1f177898ea0cb0f8d9c135d669 | [
"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,421 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.fintype.lattice
import data.list.min_max
import data.nat.order.lemmas
import logic.encodable.basic
/-!
# Denumerable types
> THIS FILE IS SYNCHRONIZED W... |
3e0c5a7b2bb971aa31e55834c5a0184c94719920 | d436468d80b739ba7e06843c4d0d2070e43448e5 | /src/category_theory/concrete_category/basic.lean | f29fe30a5b19d2212c2c6e3829b5a1b81197ef09 | [
"Apache-2.0"
] | permissive | roro47/mathlib | 761fdc002aef92f77818f3fef06bf6ec6fc1a28e | 80aa7d52537571a2ca62a3fdf71c9533a09422cf | refs/heads/master | 1,599,656,410,625 | 1,573,649,488,000 | 1,573,649,488,000 | 221,452,951 | 0 | 0 | Apache-2.0 | 1,573,647,693,000 | 1,573,647,692,000 | null | UTF-8 | Lean | false | false | 5,593 | 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, Reid Barton, Sean Leather, Yury Kudryashov
-/
import category_theory.types category_theory.full_subcategory
/-!
# Concrete categories
A concrete categ... |
28c932ae678f7fd142ffb912ceaa2e91df1c75c6 | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /src/algebra/big_operators.lean | 21b58417324c1823dddeefdaf0a02acbb617ece5 | [
"Apache-2.0"
] | permissive | kmill/mathlib | ea5a007b67ae4e9e18dd50d31d8aa60f650425ee | 1a419a9fea7b959317eddd556e1bb9639f4dcc05 | refs/heads/master | 1,668,578,197,719 | 1,593,629,163,000 | 1,593,629,163,000 | 276,482,939 | 0 | 0 | null | 1,593,637,960,000 | 1,593,637,959,000 | null | UTF-8 | Lean | false | false | 64,560 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
-/
import data.finset.intervals
import data.finset.fold
import data.finset.powerset
import data.finset.pi
import data.nat.enat
import data.equiv.mul_add
import tactic.a... |
6adb131b81aaf83d02a403bc8815af34763a150c | 94637389e03c919023691dcd05bd4411b1034aa5 | /src/zzz_junk/has_mul/has_mul_test.lean | d7933bb91e2b7a5e9a7aa2c0045b0b70274591a9 | [] | no_license | kevinsullivan/complogic-s21 | 7c4eef2105abad899e46502270d9829d913e8afc | 99039501b770248c8ceb39890be5dfe129dc1082 | refs/heads/master | 1,682,985,669,944 | 1,621,126,241,000 | 1,621,126,241,000 | 335,706,272 | 0 | 38 | null | 1,618,325,669,000 | 1,612,374,118,000 | Lean | UTF-8 | Lean | false | false | 503 | lean | import ..has_mul.has_mul
import ..has_one.has_one
--- NOT TOO MUCH TO LOOK AT HERE RIGHT NOW SORRY
#check [has_mul nat]
#check [has_mul bool]
#check has_mul
#check has_mul nat
#check has_mul bool
instance has_mul_bool : has_mul bool := ⟨ band ⟩
instance ident_nat : has_mul nat := ⟨ nat.mul ⟩
def getMeANat [n : ha... |
24229c89c9b87d92076d893664936b8209763466 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/deprecated/subgroup.lean | 161b407ac9cc5e74c77a81d6615fffeacf1d1be2 | [
"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 | 25,205 | 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, Mitchell Rowett, Scott Morrison, Johan Commelin, Mario Carneiro,
Michael Howes
-/
import group_theory.subgroup.basic
import deprecated.submonoid
/-!
# Unbundled subg... |
ad8dd5bc32d5d46c4b243738ee546a952a25c274 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/choice_anon_ctor.lean | 1a4ac5fd10f30cb164aa1b335d81c73a3e3778f7 | [
"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 | 354 | lean | import data.vector
-- constant vector.nil {α} : vector α 0
-- constant vector.cons {α n} : α → vector α n → vector α (nat.succ n)
-- notation a :: b := vector.cons a b
notation (name := veclist) `[` l:(foldr `, ` (h t, vector.cons h t) vector.nil `]`) := l
structure author :=
(name : string)
def f : list author := [... |
a437494f1a427ab1ee8d85c48c3562b345b30023 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/ring_theory/polynomial/chebyshev.lean | a62e98c5e4e9af1affaab566a5bf6b6191b94836 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 10,962 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Julian Kuelshammer, Heather Macbeth
-/
import data.polynomial.derivative
import tactic.linear_combination
/-!
# Chebyshev polynomials
> THIS FILE IS SYNCHRONIZED WITH... |
05f4ddba1959ad4b42d81dd253df661bc0723a2d | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/data/multiset/basic.lean | c57ac76c5938c0c10112bed36e46a8176e5d7fc5 | [
"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 | 105,369 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.list.perm
import data.list.prod_monoid
/-!
# Multisets
These are implemented as the quotient of a list by permutations.
## Notation
We define the ... |
52acb78b8088008d75cd796b02443ab68c9fe44f | 64874bd1010548c7f5a6e3e8902efa63baaff785 | /tests/lean/run/eq2.lean | 2ecc6a4a497cf2867d2a3bada4ad91a427e2d134 | [
"Apache-2.0"
] | permissive | tjiaqi/lean | 4634d729795c164664d10d093f3545287c76628f | d0ce4cf62f4246b0600c07e074d86e51f2195e30 | refs/heads/master | 1,622,323,796,480 | 1,422,643,069,000 | 1,422,643,069,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 171 | lean | definition symm {A : Type} : Π {a b : A}, a = b → b = a,
symm rfl := rfl
definition trans {A : Type} : Π {a b c : A}, a = b → b = c → a = c,
trans rfl rfl := rfl
|
9701aa6170a8010f06f66893d34fd3a4a2df47eb | ff5230333a701471f46c57e8c115a073ebaaa448 | /library/init/meta/converter/interactive.lean | deef1cd1d7ee7be6086e1e76d406e8496c6318db | [
"Apache-2.0"
] | permissive | stanford-cs242/lean | f81721d2b5d00bc175f2e58c57b710d465e6c858 | 7bd861261f4a37326dcf8d7a17f1f1f330e4548c | refs/heads/master | 1,600,957,431,849 | 1,576,465,093,000 | 1,576,465,093,000 | 225,779,423 | 0 | 3 | Apache-2.0 | 1,575,433,936,000 | 1,575,433,935,000 | null | UTF-8 | Lean | false | false | 5,823 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
Converter monad for building simplifiers.
-/
prelude
import init.meta.interactive init.meta.converter.conv
namespace conv
meta def save_info (p : pos) : conv... |
738c5d40cf07b6d93469ff03904a492102a528f2 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/interactive/complete_scanner_error.lean | 62938aadbf4dcbf8549a48f3402785e184da2866 | [
"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 | 79 | lean | import
--^ "command": "complete", "skip_completions": true
def f := ₜ
|
6a792856e1a85a54d7e6782e8744b916b7b4e54b | 7617a8700fc3eebd9200f1e620ee65b3565d2eff | /src/vc0/progress.lean | fea3769396c7f2e6138ea98d895ec4216044eb18 | [] | no_license | digama0/vc0 | 9747eee791c5c2f58eb53264ca6263ee53de0f87 | b8b192c8c139e0b5a25a7284b93ed53cdf7fd7a5 | refs/heads/master | 1,626,186,940,436 | 1,592,385,972,000 | 1,592,385,972,000 | 158,556,766 | 5 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 15,573 | lean | import vc0.basic
namespace c0
open ast
namespace value
def ts_sized (Γ : ast) : type ⊕ sdef → Prop
| (sum.inl τ) := Γ.sized τ
| (sum.inr sd) := ∀ τ ∈ sd.values, Γ.sized τ
theorem default_exists {Γ : ast} (ok : Γ.okind) :
∀ ts, ts_sized Γ ts → ∃ (v : value), default Γ ts v :=
ast.okind.induction' ok $ λ Γ ok IH, b... |
4c15be312e282de6fe2c8225d78e2a2b6f9b02f8 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /stage0/src/Lean/Meta/CongrTheorems.lean | 543796938114bdc3bca2f35ecd21bb2c4ccace3b | [
"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 | 13,543 | 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.AppBuilder
namespace Lean.Meta
inductive CongrArgKind where
| /-- It is a parameter for the congruence theorem, the parameter occurs in... |
3c49e2eec24d3264bbed5cd5060e681b5a4b9383 | 30b012bb72d640ec30c8fdd4c45fdfa67beb012c | /logic/basic.lean | c72aad70bf6396e245e656b98e22606e371e0106 | [
"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 | 25,048 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura
Theorems that require decidability hypotheses are in the namespace "decidable".
Classical versions are in the namespace "classical".
Note: in the pres... |
035b7e2493e50780374adc2dfe0ee4d8acfa4bd6 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /library/init/data/basic.lean | 1cfd8fb9180d1c41a12cfcbcf94215de6c00198f | [
"Apache-2.0"
] | permissive | GaloisInc/lean | aa1e64d604051e602fcf4610061314b9a37ab8cd | f1ec117a24459b59c6ff9e56a1d09d9e9e60a6c0 | refs/heads/master | 1,592,202,909,807 | 1,504,624,387,000 | 1,504,624,387,000 | 75,319,626 | 2 | 1 | Apache-2.0 | 1,539,290,164,000 | 1,480,616,104,000 | C++ | UTF-8 | Lean | false | false | 591 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.data.setoid init.data.quot init.data.bool.basic init.data.unit
import init.data.nat.basic init.data.prod init.data.sum.basic
import init... |
e2b1e643f86b4e7d68a0270811d21653d6ae8121 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/geometry/manifold/mfderiv.lean | 223bfe0fa10c94e8f8a321a06da6a29aef58787a | [
"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 | 71,171 | 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 geometry.manifold.basic_smooth_bundle
/-!
# The derivative of functions between smooth manifolds
Let `M` and `M'` be two smooth manifolds with corners ... |
34e27c85b6c29c398d61c2ca734bb0c1d22aaaaf | d5ecf6c46a2f605470a4a7724909dc4b9e7350e0 | /data/nat/basic.lean | 60ba6a15d2e342b5d37d37603e6d40626ff7b5b8 | [
"Apache-2.0"
] | permissive | MonoidMusician/mathlib | 41f79df478987a636b735c338396813d2e8e44c4 | 72234ef1a050eea3a2197c23aeb345fc13c08ff3 | refs/heads/master | 1,583,672,205,771 | 1,522,892,143,000 | 1,522,892,143,000 | 128,144,032 | 0 | 0 | Apache-2.0 | 1,522,892,144,000 | 1,522,890,892,000 | Lean | UTF-8 | Lean | false | false | 19,096 | lean | /-
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, Leonardo de Moura, Jeremy Avigad, Mario Carneiro
Basic operations on the natural numbers.
-/
import logic.basic algebra.order data.option
universe u
namespace na... |
e1dea9d45795861549b0325ba0d092fef6bd7f45 | 968e2f50b755d3048175f176376eff7139e9df70 | /examples/prop_logic_theory/unnamed_726.lean | 887f0e9874f8392fb9c45da2d5dd28b91dac165e | [] | no_license | gihanmarasingha/mth1001_sphinx | 190a003269ba5e54717b448302a27ca26e31d491 | 05126586cbf5786e521be1ea2ef5b4ba3c44e74a | refs/heads/master | 1,672,913,933,677 | 1,604,516,583,000 | 1,604,516,583,000 | 309,245,750 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 283 | lean | variables p q r : Prop
-- BEGIN
example : q → (p → q) :=
begin
assume h₁ : q, -- Assume `h₁ : q`. It suffices to prove `p → q`.
assume h₂ : p, -- Assume `h₂ : p`. It suffices to prove `q`.
show q, from h₁, -- We show `q` by reiteration on `h₁`.
end
-- END |
9959cacf1551a14497af6acac370e978fcfa8f25 | d436468d80b739ba7e06843c4d0d2070e43448e5 | /src/algebra/group_power.lean | f3aad8be38081fe11609adf5f50f449a8897e9c4 | [
"Apache-2.0"
] | permissive | roro47/mathlib | 761fdc002aef92f77818f3fef06bf6ec6fc1a28e | 80aa7d52537571a2ca62a3fdf71c9533a09422cf | refs/heads/master | 1,599,656,410,625 | 1,573,649,488,000 | 1,573,649,488,000 | 221,452,951 | 0 | 0 | Apache-2.0 | 1,573,647,693,000 | 1,573,647,692,000 | null | UTF-8 | Lean | false | false | 27,031 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Robert Y. Lewis
The power operation on monoids and groups. We separate this from group, because it depends on
nat, which in turn depends on other parts of algebra.
We h... |
bc112416a86ce32010b0eb98057a582e323558af | 853df553b1d6ca524e3f0a79aedd32dde5d27ec3 | /src/topology/uniform_space/compact_separated.lean | b8887bee620e6e01c02299887fbc35e6557c0e62 | [
"Apache-2.0"
] | permissive | DanielFabian/mathlib | efc3a50b5dde303c59eeb6353ef4c35a345d7112 | f520d07eba0c852e96fe26da71d85bf6d40fcc2a | refs/heads/master | 1,668,739,922,971 | 1,595,201,756,000 | 1,595,201,756,000 | 279,469,476 | 0 | 0 | null | 1,594,696,604,000 | 1,594,696,604,000 | null | UTF-8 | Lean | false | false | 10,700 | lean | /-
Copyright (c) 2020 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot
-/
import topology.uniform_space.separation
/-!
# Compact separated uniform spaces
## Main statements
* `compact_space_uniformity`: On a separated compact uniform spac... |
85edc4aadf6d2e127851927e8c9434e59134937f | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /src/Lean/Elab/App.lean | 7db42af393138cb80452b419a42131c00220b480 | [
"Apache-2.0"
] | permissive | williamdemeo/lean4 | 72161c58fe65c3ad955d6a3050bb7d37c04c0d54 | 6d00fcf1d6d873e195f9220c668ef9c58e9c4a35 | refs/heads/master | 1,678,305,356,877 | 1,614,708,995,000 | 1,614,708,995,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 42,910 | 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.Util.FindMVar
import Lean.Elab.Term
import Lean.Elab.Binders
import Lean.Elab.SyntheticMVars
namespace Lean.Elab.Term
open Meta
builtin_initia... |
ce88116076725e6072a4b6ee4c105258ebbf63ba | 761fea1362b10b4c588c2dfc0ae90c70b119e35d | /src/provers/tableaux.lean | 129c95c6a167f2f590b82f26326b35a93f54fa77 | [] | no_license | holtzermann17/mm-lean | 382a29fca5245f97cf488c525ed0c9594917f73b | a9130d71ed448f62df28d4128043b707bad85ccd | refs/heads/master | 1,588,477,413,982 | 1,553,885,046,000 | 1,553,885,046,000 | 178,404,617 | 0 | 0 | null | 1,553,863,829,000 | 1,553,863,828,000 | null | UTF-8 | Lean | false | false | 1,341 | lean | import .utils
open tactic expr
meta def is_conj (e : expr) : tactic bool :=
do t ← infer_type e, return $ is_app_of t `and
meta def add_facts (prf : expr) : tactic unit :=
do n ← get_unused_name `h none,
t ← infer_type prf,
assertv n t prf >> return ()
meta def split_conjs_at : expr → tactic unit | e :=
do b ← is_c... |
dabd46c09279ff59406185bf80d92eb2dce0ad48 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebra/continued_fractions/computation/terminates_iff_rat.lean | 92de5b24686e4df04c2809c0328c5480f3ecdcc2 | [
"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 | 14,263 | lean | /-
Copyright (c) 2020 Kevin Kappelmann. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Kappelmann
-/
import algebra.continued_fractions.computation.approximations
import algebra.continued_fractions.computation.correctness_terminating
import algebra.order.archimed... |
928dfcb62fa4eca0ec3ac4a1d84c5bd52fe3aeb1 | b66669ef1ec06ddbd9526fe3afe0a68566dfbad3 | /src/gol.lean | a53f4c8deb4253069b43e54d94094543da1cc0d1 | [
"MIT"
] | permissive | FerdoSil/LatticesAndCellularAutomata | 40185a9099bb3cf1371c85f1ca33a17c2e26fecb | 2a69d2e74a231addf0e446dca86ef90d50d60218 | refs/heads/master | 1,587,683,992,072 | 1,586,018,471,000 | 1,586,018,471,000 | 171,533,028 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,599 | lean | -- Implementation of Game of Life.
-- Cell states 'cellT' are represented as constructors 'A' and 'D' for alive / dead state respecitlvely.
-- The definition 'mk_gol' builds an instance of Life CA
-- from an initial configuration of cell states.
import cell_automaton utils data.nat.basic
open utils
namespace gol
... |
8a87a48dd20598719db906e084cd60ae9f321a1e | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/data/qpf/multivariate/basic.lean | 605b8984d09049e6ae6c2756c18455bd237ccc55 | [
"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 | 8,745 | 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 data.pfunctor.multivariate.basic
universe u
/-!
# Multivariate quotients of polynomial functors.
Basic definition of multivariate QPF. QPFs form a ... |
76be51804aaaef4937141aadb4ce01557eda2a71 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/analysis/asymptotics/asymptotic_equivalent.lean | 2d76f14dc45e99082c1d4bcb3a4923e689bdab74 | [
"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 | 10,996 | lean | /-
Copyright (c) 2020 Anatole Dedecker. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anatole Dedecker
-/
import analysis.asymptotics.asymptotics
import analysis.normed_space.ordered
/-!
# Asymptotic equivalence
In this file, we define the relation `is_equivalent u ... |
c19cea9b883878b6ca18038eaa3203ae18c9e3e8 | 6094e25ea0b7699e642463b48e51b2ead6ddc23f | /library/data/nat/basic.lean | 055c4ab7632c6636225f243089da3daf41f1d967 | [
"Apache-2.0"
] | permissive | gbaz/lean | a7835c4e3006fbbb079e8f8ffe18aacc45adebfb | a501c308be3acaa50a2c0610ce2e0d71becf8032 | refs/heads/master | 1,611,198,791,433 | 1,451,339,111,000 | 1,451,339,111,000 | 48,713,797 | 0 | 0 | null | 1,451,338,939,000 | 1,451,338,939,000 | null | UTF-8 | Lean | false | false | 10,535 | lean | /-
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, Leonardo de Moura, Jeremy Avigad
Basic operations on the natural numbers.
-/
import ..num algebra.ring
open binary eq.ops
namespace nat
/- a variant of add, defi... |
c5a0afe34011d6c4522f57bffe2338aa5b2b51cd | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/explicit.lean | 6f79e8f94c5538550a61cd2fb0deace4d8cd4f29 | [
"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 | 242 | lean | import Int.
variable f {A : Type} : A -> A -> A
variable module::g {A : Type} : A -> A -> A
check @f
check module::@g
variable h::1 {A B : Type} : A -> B -> A
check h::1::explicit
variable @h : Int -> Int
variable h {A B : Type} : A -> B -> A |
6d7243ae2cea369d37389cc1dc2751771d51feff | 274748215b6d042f0d9c9a505f9551fa8e0c5f38 | /src/for_mathlib/finset.lean | 3f6f58825641c6a3da58ef6e006054627abb9e5a | [
"Apache-2.0"
] | permissive | ImperialCollegeLondon/M4P33 | 878ecb515c77d20cc799ff1ebd78f1bf4fd65c12 | 1a179372db71ad6802d11eacbc1f02f327d55f8f | refs/heads/master | 1,607,519,867,193 | 1,583,344,297,000 | 1,583,344,297,000 | 233,316,107 | 59 | 4 | Apache-2.0 | 1,579,285,778,000 | 1,578,788,367,000 | Lean | UTF-8 | Lean | false | false | 427 | lean | import data.finset
namespace finset
lemma diff_singleton_ssub {X : Type*} [decidable_eq X] {s : finset X} {x : X} (h : x ∈ s) : s \ {x} ⊂ s :=
finset.ssubset_iff.2 ⟨x, by simp,
λ y hy, (mem_insert.1 hy).elim (λ hxy, hxy.symm ▸ h) (by simp {contextual := tt})⟩
-- open_locale classical
-- lemma ssub_of_diff {X : Ty... |
330bd8ee136663c222d32686b82835b06874ca0d | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch5/ex0103.lean | 5cd818e7aaaa92c5057584e848aa50dc5397d304 | [] | 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 | 160 | lean | theorem test (p q : Prop) (hp : p) (hq : q) : p ∧ q ∧ p :=
begin
apply and.intro,
exact hp,
apply and.intro,
exact hq,
exact hp
end
#print test
|
20a283225a22c298c77217adbc41ea71df3ac016 | 5ec8f5218a7c8e87dd0d70dc6b715b36d61a8d61 | /clight.lean | 05639b2d87e37b2ddae179c553ce061260ddb868 | [] | no_license | mbrodersen/kremlin | f9f2f9dd77b9744fe0ffd5f70d9fa0f1f8bd8cec | d4665929ce9012e93a0b05fc7063b96256bab86f | refs/heads/master | 1,624,057,268,130 | 1,496,957,084,000 | 1,496,957,084,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 26,556 | lean | import .ctypes .cop .globalenvs
/- The Clight language: a simplified version of Compcert C where all
expressions are pure and assignments and function calls are
statements, not expressions. -/
namespace clight
open ctypes integers ast maps floats values memory word cop globalenvs
errors ctypes.fundef ctypes.... |
978843f199dd2f81da6fc56b13ca64a3e244934a | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/ring_theory/localization/as_subring.lean | 516c28af1768c917106b03497a6ef832b863a6ce | [
"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,365 | lean | /-
Copyright (c) 2022 Adam Topaz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Adam Topaz, Junyan Xu
-/
import ring_theory.localization.localization_localization
/-!
# Localizations of domains as subalgebras of the fraction field.
> THIS FILE IS SYNCHRONIZED WITH ... |
2c1d0b9604cecaa30b127b3045e2f41636162823 | 5e3548e65f2c037cb94cd5524c90c623fbd6d46a | /AMC_2021_A_7.lean | e3cc6d7e6f23c4f1bb17d78fd3b5bdc6080c4269 | [] | no_license | ahayat16/lean_exos | d4f08c30adb601a06511a71b5ffb4d22d12ef77f | 682f2552d5b04a8c8eb9e4ab15f875a91b03845c | refs/heads/main | 1,693,101,073,585 | 1,636,479,336,000 | 1,636,479,336,000 | 415,000,441 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 98 | lean | import data.real.basic
theorem AMC_2021_A_7 (x y:ℝ): (x*y-1)^2+(x+y)^2≥1:=
begin
sorry
end |
f9f059468b74ff1a14803bad87adc14b49cc26f1 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/group_theory/perm/sign.lean | ea20c323eb768a887899e6875ff038a0881cf724 | [
"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 | 32,270 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import data.fintype.basic
import data.finset.sort
import algebra.group.conj
import algebra.big_operators.basic
universes u v
open equiv function fintype finset
open_loca... |
b665862d65a795a38002697c7a9b83471f2bad6c | 367134ba5a65885e863bdc4507601606690974c1 | /src/set_theory/game/winner.lean | 8f0dd4e2fbec1a950a46309facb687ab66b215ed | [
"Apache-2.0"
] | permissive | kodyvajjha/mathlib | 9bead00e90f68269a313f45f5561766cfd8d5cad | b98af5dd79e13a38d84438b850a2e8858ec21284 | refs/heads/master | 1,624,350,366,310 | 1,615,563,062,000 | 1,615,563,062,000 | 162,666,963 | 0 | 0 | Apache-2.0 | 1,545,367,651,000 | 1,545,367,651,000 | null | UTF-8 | Lean | false | false | 3,376 | lean | /-
Copyright (c) 2020 Fox Thomson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Fox Thomson
-/
import set_theory.pgame
/-!
# Basic definitions about who has a winning stratergy
We define `G.first_loses`, `G.first_wins`, `G.left_wins` and `G.right_wins` for a pgame ... |
424d14d902e59e7dd29ba6bb6efc867401057a31 | 8e31b9e0d8cec76b5aa1e60a240bbd557d01047c | /scratch/transfer.lean | baf6a89ad873be76efb145770107b897803c377d | [] | no_license | ChrisHughes24/LP | 7bdd62cb648461c67246457f3ddcb9518226dd49 | e3ed64c2d1f642696104584e74ae7226d8e916de | refs/heads/master | 1,685,642,642,858 | 1,578,070,602,000 | 1,578,070,602,000 | 195,268,102 | 4 | 3 | null | 1,569,229,518,000 | 1,562,255,287,000 | Lean | UTF-8 | Lean | false | false | 6,499 | lean | import .refactor_iterate logic.relator .transfer_mathlib
def fmatrix (m n : ℕ) := array m (array n ℚ)
variables {m n : ℕ}
namespace matrix
def read (A : matrix (fin m) (fin n) ℚ) (i : fin m) (j : fin n) : ℚ := A i j
def write (A : matrix (fin m) (fin n) ℚ) (i : fin m) (j : fin n) (a : ℚ) :=
λ i' j', if i' = i ∧ j'... |
805fe570328d8e8727b5d639c2509918a397a06e | 4b846d8dabdc64e7ea03552bad8f7fa74763fc67 | /tests/lean/proj_notation.lean | fd58096f505d478fed46aca31ecfd38aa6ff23e0 | [
"Apache-2.0"
] | permissive | pacchiano/lean | 9324b33f3ac3b5c5647285160f9f6ea8d0d767dc | fdadada3a970377a6df8afcd629a6f2eab6e84e8 | refs/heads/master | 1,611,357,380,399 | 1,489,870,101,000 | 1,489,870,101,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 696 | lean | structure myprod (A B : Type) :=
(fst : A) (snd : B)
variable p : myprod nat nat
variable f : nat → nat
#check p↣fst
#check p↣1
#check p↣2
#check p↣snd
#check p~>fst
#check p~>1
#check p~>2
#check p~>snd
#check f p↣1
#check p↣1 + p↣2
example (A B : Type) : A × B → B × A :=
λ h, ⟨h↣2, h↣1⟩
example (A B : Type) : ... |
7a223d43b28600d75e3e41b758b1ed734f302619 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/pp_all2.lean | e9922e721375896358ca517162e98753cbb7d916 | [
"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 | 135 | lean | import data.nat
set_option pp.all true
set_option pp.numerals true
set_option pp.universes false
check (10 : nat) + (3 : nat)
|
cf3f0db1601916d0c75a04b1931ca2f82cae1500 | aa5a655c05e5359a70646b7154e7cac59f0b4132 | /src/Lean/Syntax.lean | 9767458089eb41ef871d2effc6c7b6516eb35d8f | [
"Apache-2.0"
] | permissive | lambdaxymox/lean4 | ae943c960a42247e06eff25c35338268d07454cb | 278d47c77270664ef29715faab467feac8a0f446 | refs/heads/master | 1,677,891,867,340 | 1,612,500,005,000 | 1,612,500,005,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 16,260 | 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... |
0de21fd4d443d84353a858b4c20f3aaa47c747ec | abd85493667895c57a7507870867b28124b3998f | /src/algebra/opposites.lean | 6b18c728d7e3dac3456fd1eea2208f6efd8bc1f6 | [
"Apache-2.0"
] | permissive | pechersky/mathlib | d56eef16bddb0bfc8bc552b05b7270aff5944393 | f1df14c2214ee114c9738e733efd5de174deb95d | refs/heads/master | 1,666,714,392,571 | 1,591,747,567,000 | 1,591,747,567,000 | 270,557,274 | 0 | 0 | Apache-2.0 | 1,591,597,975,000 | 1,591,597,974,000 | null | UTF-8 | Lean | false | false | 6,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
Opposites.
-/
import data.opposite
import algebra.field
namespace opposite
universes u
variables (α : Type u)
instance [has_add α] : has_add (opposite α) :=
{ add := λ x y, op... |
0a5fb62b7e40cb2affe10822449056f42ea4d231 | 947b78d97130d56365ae2ec264df196ce769371a | /tests/lean/run/CommandExtOverlap.lean | 2e89f465b37d3c193a5acb95a7e83a1bf5ac4828 | [
"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 | 332 | lean | new_frontend
syntax [mycheck] "#check" (sepBy term ",") : command
open Lean
macro_rules [mycheck]
| `(#check $es*) =>
let cmds := es.getSepElems.map $ fun e => Syntax.node `Lean.Parser.Command.check #[Syntax.atom {} "#check", e]
pure $ mkNullNode cmds
#check true
#check true, true
#check true, 1, 3, fun (x : Na... |
d63fe49a0f42aaf810cef9542b3b9772daed2444 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/algebra/group_with_zero/power_auto.lean | 95e85571c3cba6feedd559e58d9ed4db2e9de0d1 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,084 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.algebra.group_power.default
import Mathlib.PostPort
universes u_1 u_2
namespace Mathlib
... |
ec04be63acac3070f0ba28a9a9f2dc98854691d8 | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /tests/lean/run/elim.lean | ab8e2e29fc333ecf1382208460a183e4782bec23 | [
"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 | 215 | lean | import logic
constant p : num → num → num → Prop
axiom H1 : ∃ x y z, p x y z
axiom H2 : ∀ {x y z : num}, p x y z → p x x x
theorem tst : ∃ x, p x x x
:= obtain a b c H, from H1, exists_intro a (H2 H)
|
22965e5362d86fe50f2926a307b07bdd019645b8 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/topology/uniform_space/compact_separated.lean | a1532d4c0d9649784e172b9739f9b251adc5f121 | [
"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 | 12,063 | lean | /-
Copyright (c) 2020 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot
-/
import topology.uniform_space.separation
import topology.uniform_space.uniform_convergence
/-!
# Compact separated uniform spaces
## Main statements
* `compact_spac... |
4d0f5a9109fb752125cb98023b518d5572ae05d2 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/run/ind1.lean | ec18a1596797f056b61d7e4775cc5830a377da7b | [
"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 | 163 | lean | inductive List (A : Type*) : Type*
| nil : List
| cons : A → List → List
namespace List end List open List
check List.{1}
check cons.{1}
check List.rec.{1 1}
|
c15f0a4636f31de88d0a373c4a479a1ba4a7c1d3 | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /tests/lean/run/1385.lean | 323a0fa7fe66d4bad2e1d180a99388c3410d1986 | [
"Apache-2.0"
] | permissive | williamdemeo/lean4 | 72161c58fe65c3ad955d6a3050bb7d37c04c0d54 | 6d00fcf1d6d873e195f9220c668ef9c58e9c4a35 | refs/heads/master | 1,678,305,356,877 | 1,614,708,995,000 | 1,614,708,995,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 686 | lean | def S := List Nat
constant TSpec : PointedType
def T (s : S) : Type := TSpec.type
instance (s : S) : Inhabited (T s) := {
default := TSpec.val
}
inductive Op : (ishapes : List S) → (oshape : S) → Type
| binary : (shape : S) → Op [shape, shape] shape
| gemm : {m n p : Nat} → Op [[m, n], [n, p]] [m, p]
def Op.... |
ba4fa5273618fbf279d674258e9e44b0ce638f1f | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/topology/algebra/with_zero_topology.lean | 3ecdea6df7d77c9d34a88479c49de0fe475e9a75 | [
"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 | 11,951 | lean | /-
Copyright (c) 2021 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot
-/
import topology.algebra.ordered.basic
import algebra.order.with_zero
/-!
# The topology on linearly ordered commutative groups with zero
Let `Γ₀` be a linearly ord... |
ec16ed9d002c2b7125341c085cafc431010591a9 | 92b50235facfbc08dfe7f334827d47281471333b | /hott/init/equiv.hlean | 4cb2162f62939c7fb12b259e223eb81dfd54b6f9 | [
"Apache-2.0"
] | permissive | htzh/lean | 24f6ed7510ab637379ec31af406d12584d31792c | d70c79f4e30aafecdfc4a60b5d3512199200ab6e | refs/heads/master | 1,607,677,731,270 | 1,437,089,952,000 | 1,437,089,952,000 | 37,078,816 | 0 | 0 | null | 1,433,780,956,000 | 1,433,780,955,000 | null | UTF-8 | Lean | false | false | 12,379 | hlean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad, Jakob von Raumer
Ported from Coq HoTT
-/
prelude
import .path .function
open eq function lift
/- Equivalences -/
-- This is our definition of equivalence. In t... |
73588a0c242584d547a48b02ad3c32696b98a2dd | a721fe7446524f18ba361625fc01033d9c8b7a78 | /src/principia/logic.lean | 7fbf06c821098919593b1db5f9f7604612590f66 | [] | no_license | Sterrs/leaning | 8fd80d1f0a6117a220bb2e57ece639b9a63deadc | 3901cc953694b33adda86cb88ca30ba99594db31 | refs/heads/master | 1,627,023,822,744 | 1,616,515,221,000 | 1,616,515,221,000 | 245,512,190 | 2 | 0 | null | 1,616,429,050,000 | 1,583,527,118,000 | Lean | UTF-8 | Lean | false | false | 2,742 | lean | -- vim: ts=2 sw=0 sts=-1 et ai tw=70
-- boring propositional theorems
namespace hidden
variables {p q: Prop}
-- kind of cute little fact.
-- Basically comes from equivalence of p → q → r and p ∧ q → r
theorem implication_of_neg_commutative: (p → ¬q) ↔ (q → ¬p) :=
begin
split, {
assume hpnq hq hp,
from hpn... |
a5db7c36c9f76a8f8a9ff09906c55331d5551c12 | 8f209eb34c0c4b9b6be5e518ebfc767a38bed79c | /code/src/internal/A.lean | d9294916f17ce311fa74c6ef50fba35b05e203e2 | [] | no_license | hediet/masters-thesis | 13e3bcacb6227f25f7ec4691fb78cb0363f2dfb5 | dc40c14cc4ed073673615412f36b4e386ee7aac9 | refs/heads/master | 1,680,591,056,302 | 1,617,710,887,000 | 1,617,710,887,000 | 311,762,038 | 4 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,522 | lean | import tactic
import data.finset
import ..definitions
import .internal_definitions
import .tactics
import .utils
import .phi.utils
import .Ant.main
import .U
variable [GuardModule]
open GuardModule
private lemma A_sem_eq_𝒜' (gdt: Gdt) { acc: Φ → Φ } (acc_stable: stable acc) (acc_hom: hom acc):
((A gdt).map acc).... |
af0a5eee02dbddba7ab00fe548792555a84914a8 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/sum/order.lean | a42e691d4c08bd645520601232babd5d934f8fd7 | [
"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 | 24,093 | lean | /-
Copyright (c) 2021 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies
-/
import order.hom.basic
/-!
# Orders on a sum type
This file defines the disjoint sum and the linear (aka lexicographic) sum of two orders and provides
relation instance... |
6fb6e873b6673e8084f0388a59b1ad8d919c2e05 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/lie/normalizer.lean | b8b889787bf490877233a50463720b36b5e5fdfd | [
"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,605 | lean | /-
Copyright (c) 2022 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import algebra.lie.abelian
import algebra.lie.ideal_operations
import algebra.lie.quotient
/-!
# The normalizer of a Lie submodules and subalgebras.
> THIS FILE IS SYNCHR... |
d7dbddff46f820a17b2881d78af234b458cd2dec | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/pkg/deriving/UserDeriving.lean | 92d1187af17264d7c1c97b973c0532a6729f4bd7 | [
"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 | 24 | lean | import UserDeriving.Tst
|
232447933aae980e33415c290a08fa3790b23407 | d6124c8dbe5661dcc5b8c9da0a56fbf1f0480ad6 | /Papyrus/Script/Function.lean | 693776f49bface823d897005692adfbe7e1454f4 | [
"Apache-2.0"
] | permissive | xubaiw/lean4-papyrus | c3fbbf8ba162eb5f210155ae4e20feb2d32c8182 | 02e82973a5badda26fc0f9fd15b3d37e2eb309e0 | refs/heads/master | 1,691,425,756,824 | 1,632,122,825,000 | 1,632,123,075,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,879 | lean | import Lean.Parser
import Papyrus.Builders
import Papyrus.Script.Do
import Papyrus.Script.Type
import Papyrus.Script.ParserUtil
import Papyrus.Script.GlobalModifiers
namespace Papyrus.Script
open Builder Lean Parser Term
def mkFunctionType (ret : Syntax) (params : Array Syntax) (varArg : Syntax) : MacroM Syntax :=
... |
87bc79cfb45c00c4af1291ba66c2d358007160d5 | 853df553b1d6ca524e3f0a79aedd32dde5d27ec3 | /src/analysis/normed_space/multilinear.lean | 014b28685f5e7ee899096a8c3fc5b226351642d4 | [
"Apache-2.0"
] | permissive | DanielFabian/mathlib | efc3a50b5dde303c59eeb6353ef4c35a345d7112 | f520d07eba0c852e96fe26da71d85bf6d40fcc2a | refs/heads/master | 1,668,739,922,971 | 1,595,201,756,000 | 1,595,201,756,000 | 279,469,476 | 0 | 0 | null | 1,594,696,604,000 | 1,594,696,604,000 | null | UTF-8 | Lean | false | false | 54,555 | 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.normed_space.operator_norm
import topology.algebra.multilinear
/-!
# Operator norm on the space of continuous multilinear maps
When `f` is a c... |
80fe71347f7037952e0c373726f4cf63725885f7 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /stage0/src/Lean/DeclarationRange.lean | 19ec43adefbd0545f41c70f2bf70193b4073e7c1 | [
"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,423 | 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.MonadEnv
import Lean.AuxRecursor
import Lean.ToExpr
namespace Lean
structure DeclarationRange where
pos : Position
/-- A precompu... |
502c3f00eac1b941657ee57b29166558eafc8a20 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/order/hom/complete_lattice.lean | 596d043ba064f2852ceb167d5fc7baab60fac410 | [
"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 | 23,758 | 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 order.complete_lattice
import order.hom.lattice
/-!
# Complete lattice homomorphisms
This file defines frame homorphisms and complete lattice homomorphisms.
We ... |
58da65890170f982b29deb54092cf185b93b15f0 | 367134ba5a65885e863bdc4507601606690974c1 | /src/tactic/has_variable_names.lean | 5a3e3e05d7ab9dda8fda4e554a879e573b1a1551 | [
"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,943 | lean | /-
Copyright (c) 2020 Jannis Limperg. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jannis Limperg
-/
import tactic.core
/-!
# A tactic for type-based naming of variables
When we name hypotheses or variables, we often do so in a type-directed fashion:
a hypothesis o... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.