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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1461a257adfa6ea3067806932e00592446310378 | 75db7e3219bba2fbf41bf5b905f34fcb3c6ca3f2 | /hott/homotopy/cofiber.hlean | a005644ae99b7ae5947d435abc4bbec4ec30453d | [
"Apache-2.0"
] | permissive | jroesch/lean | 30ef0860fa905d35b9ad6f76de1a4f65c9af6871 | 3de4ec1a6ce9a960feb2a48eeea8b53246fa34f2 | refs/heads/master | 1,586,090,835,348 | 1,455,142,203,000 | 1,455,142,277,000 | 51,536,958 | 1 | 0 | null | 1,455,215,811,000 | 1,455,215,811,000 | null | UTF-8 | Lean | false | false | 3,650 | hlean | /-
Copyright (c) 2016 Jakob von Raumer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jakob von Raumer
The Cofiber Type
-/
import hit.pointed_pushout function .susp
open eq pushout unit pointed is_trunc is_equiv susp unit
definition cofiber {A B : Type} (f : A → B)... |
96c41981a9768eea490063245f140e6eb36497d8 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/data/stream_auto.lean | e4e6c3f8b5aeaf2b0be000af56756bb5fea4f924 | [] | 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 | 19,557 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
universes u v w
namespace Mathlib
def stream (α : Type u) := ℕ → α
namespace stream
def co... |
0a1a69e37fac0da8453d43846b4344ea884df241 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/ring_theory/power_series/basic.lean | 78e1c3e211180c70d1954846eb15526ab7fdf6b7 | [
"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 | 76,705 | lean | /-
Copyright (c) 2019 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Kenny Lau
-/
import data.finsupp.interval
import data.mv_polynomial.basic
import data.polynomial.algebra_map
import data.polynomial.coeff
import linear_algebra.std_basi... |
70967e5bca7ac2aa207dd0d9885be0ea23283e2e | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/topology/sheaves/forget.lean | 7d3db6f567bc592a922ae98210260be6ec531a58 | [
"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 | 7,889 | 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 topology.sheaves.sheaf
import category_theory.limits.preserves.shapes
import category_theory.limits.types
/-!
# Checking the sheaf condition on the underlying... |
af676253071a60ad227fff03efac0743fb8bfd1d | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/group_theory/perm/list.lean | 78de80f5411efb9b6169040c82b764b8b3e210f3 | [
"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 | 17,165 | lean | /-
Copyright (c) 2021 Yakov Pechersky. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yakov Pechersky
-/
import data.list.rotate
import group_theory.perm.support
/-!
# Permutations from a list
A list `l : list α` can be interpreted as a `equiv.perm α` where each ele... |
cfa580cc61df17885871b851e01c0c6f91019879 | df7bb3acd9623e489e95e85d0bc55590ab0bc393 | /lean/love08_operational_semantics_homework_solution.lean | 5db2f782fa66cbf287f1ef87ffcba30c88922b42 | [] | no_license | MaschavanderMarel/logical_verification_2020 | a41c210b9237c56cb35f6cd399e3ac2fe42e775d | 7d562ef174cc6578ca6013f74db336480470b708 | refs/heads/master | 1,692,144,223,196 | 1,634,661,675,000 | 1,634,661,675,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,356 | lean | import .lovelib
/- # LoVe Homework 8: Operational Semantics
Homework must be done individually. -/
set_option pp.beta true
set_option pp.generalized_field_notation false
namespace LoVe
/- ## Question 1 (6 points + 1 bonus point): Semantics of the REPEAT Language
We introduce REPEAT, a programming language that... |
e53219ba8890354db10effafea78030ea7ba9d88 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/algebra/module/pi.lean | 5ab8521fc21cf29140995e5038051f04e30559be | [
"Apache-2.0"
] | permissive | dupuisf/mathlib | 62de4ec6544bf3b79086afd27b6529acfaf2c1bb | 8582b06b0a5d06c33ee07d0bdf7c646cae22cf36 | refs/heads/master | 1,669,494,854,016 | 1,595,692,409,000 | 1,595,692,409,000 | 272,046,630 | 0 | 0 | Apache-2.0 | 1,592,066,143,000 | 1,592,066,142,000 | null | UTF-8 | Lean | false | false | 2,904 | 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.module.basic algebra.ring.pi
/-!
# Pi instances for module and multiplicative actions
This file defines instances for module, mul_action and... |
0cd47b1623bbbc003ab14610acc8cf996685a96a | ad0c7d243dc1bd563419e2767ed42fb323d7beea | /data/sum.lean | f0c83d8668e95f8d50d99ee9cabe1ccc3ce97ec9 | [
"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,346 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
More theorems about the sum type.
-/
universes u v
variables {α : Type u} {β : Type v}
open sum
attribute [derive decidable_eq] sum
@[simp] theorem sum.forall {p : α... |
7762896b5aaa2843fad360f2b72a2fe6c5e84d69 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/wf2.lean | 94bc3a290726f1cc046410495ee6e96ed0f7e736 | [
"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 | 127 | lean | def g (x : Nat) (y : Nat) : Nat :=
if x < y then
2 * g (x-1) y -- Error here
else
0
termination_by' measure (·.1)
|
1173bdcb6e382061bb8fbe1d6a7a3f1bd7432e40 | 64874bd1010548c7f5a6e3e8902efa63baaff785 | /hott/logic.hlean | a422a9e5be7c389a8072fe7ce1bc027ac92a7329 | [
"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 | 257 | hlean | --javra: Maybe this should go somewhere else
open eq
inductive tdecidable [class] (A : Type) : Type :=
inl : A → tdecidable A,
inr : ¬A → tdecidable A
structure decidable_paths [class] (A : Type) :=
(elim : ∀(x y : A), tdecidable (x = y))
|
c942da4141d27e2a7446a407ade2a68e1a15862a | 3f7026ea8bef0825ca0339a275c03b911baef64d | /src/algebra/group/units_hom.lean | e93fc416bd3230e7122251d508b890d4f73d5463 | [
"Apache-2.0"
] | permissive | rspencer01/mathlib | b1e3afa5c121362ef0881012cc116513ab09f18c | c7d36292c6b9234dc40143c16288932ae38fdc12 | refs/heads/master | 1,595,010,346,708 | 1,567,511,503,000 | 1,567,511,503,000 | 206,071,681 | 0 | 0 | Apache-2.0 | 1,567,513,643,000 | 1,567,513,643,000 | null | UTF-8 | Lean | false | false | 1,522 | lean | /-
Copyright (c) 2018 Johan Commelin All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Chris Hughes, Kevin Buzzard
Lift monoid homomorphisms to group homomorphisms of their units subgroups.
-/
import algebra.group.units algebra.group.hom
universes u v w
... |
f7dd7ec2f0780d2e91becc57f6ce5376124c2ed9 | 6b02ce66658141f3e0aa3dfa88cd30bbbb24d17b | /tests/lean/run/matchtac.lean | 1c3ef45d3621c9f50f368db16ec52661b03bb6c7 | [
"Apache-2.0"
] | permissive | pbrinkmeier/lean4 | d31991fd64095e64490cb7157bcc6803f9c48af4 | 32fd82efc2eaf1232299e930ec16624b370eac39 | refs/heads/master | 1,681,364,001,662 | 1,618,425,427,000 | 1,618,425,427,000 | 358,314,562 | 0 | 0 | Apache-2.0 | 1,618,504,558,000 | 1,618,501,999,000 | null | UTF-8 | Lean | false | false | 2,573 | lean | theorem tst1 {α : Type} {p : Prop} (xs : List α) (h₁ : (a : α) → (as : List α) → xs = a :: as → p) (h₂ : xs = [] → p) : p :=
by match h:xs with
| [] => exact h₂ h
| z::zs => apply h₁ z zs; assumption
theorem tst2 {α : Type} {p : Prop} (xs : List α) (h₁ : (a : α) → (as : List α) → xs = a :: as → p) (h₂ : xs = ... |
a411710498846a52c5ecafd59e22e49658eaf184 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/algebra/group_power/basic.lean | 8151f5c4f8c4e942e79c7173fbbf0e6bc480ead3 | [
"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 | 17,364 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Robert Y. Lewis
-/
import algebra.ordered_ring
import tactic.monotonicity.basic
import group_theory.group_action.defs
/-!
# Power operations on monoids and groups
The p... |
dbdd0750ce451e70b146f7a2a60961a49a18e9bc | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/e5.lean | 559ea6fd36025c80e19b83444a52ee2548ae1818 | [
"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 | 1,533 | lean | prelude
definition Prop := Type.{0}
definition false : Prop := ∀x : Prop, x
check false
theorem false.elim (C : Prop) (H : false) : C
:= H C
definition eq {A : Type} (a b : A)
:= ∀ P : A → Prop, P a → P b
check eq
infix `=`:50 := eq
theorem refl {A : Type} (a : A) : a = a
:= λ P H, H
definition true : Prop
:= fa... |
f41544ff989fb7574b1a14be2ea0c9b584fe4676 | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /src/algebra/category/CommRing/basic.lean | f4e8a28e7111528ec1375c405df2b31d8b35fffc | [
"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 | 7,229 | 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, Yury Kudryashov
-/
import algebra.category.Group
import data.equiv.ring
/-!
# Category instances for semiring, ring, comm_semiring, and comm_ring.
We ... |
cdc8f90a3dc1898647ef093fcc9a351d3503d756 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebra/parity.lean | 0e2077bf429fce716e9043f19df46f978a384db0 | [
"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 | 13,665 | lean | /-
Copyright (c) 2022 Damiano Testa. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Damiano Testa
-/
import algebra.ring.basic
import algebra.algebra.basic
import algebra.group_power.basic
import algebra.field_power
import algebra.opposites
/-! # Squares, even and o... |
3ef84051f136a0b8ce65a13c66cdf885bf06c4ef | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/semiquot.lean | 50d0885522584a0a165452765c330b48e9347e9a | [
"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 | 7,927 | 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.set.lattice
/-! # Semiquotients
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding PR to mathlib4.
A data ty... |
f80f67538ae7c3d86d2198232943b78eb1e23cc7 | 75db7e3219bba2fbf41bf5b905f34fcb3c6ca3f2 | /library/data/nat/examples/partial_sum.lean | 5e697b95d453a25f72a41c31a737b293fce6be16 | [
"Apache-2.0"
] | permissive | jroesch/lean | 30ef0860fa905d35b9ad6f76de1a4f65c9af6871 | 3de4ec1a6ce9a960feb2a48eeea8b53246fa34f2 | refs/heads/master | 1,586,090,835,348 | 1,455,142,203,000 | 1,455,142,277,000 | 51,536,958 | 1 | 0 | null | 1,455,215,811,000 | 1,455,215,811,000 | null | UTF-8 | Lean | false | false | 1,165 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
import data.nat
open nat
definition partial_sum : nat → nat
| 0 := 0
| (succ n) := succ n + partial_sum n
example : partial_sum 5 = 15 :=
rfl
examp... |
60ecb5c7f95247ad382bf4cc2d85c5d94cff42eb | 4b846d8dabdc64e7ea03552bad8f7fa74763fc67 | /library/tools/super/equality.lean | 554d282b6755d8fb2e75977a9bff584860682f9a | [
"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 | 1,259 | lean | /-
Copyright (c) 2016 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner
-/
import .clause .prover_state .utils
open tactic monad expr list
namespace super
meta def try_unify_eq_l (c : clause) (i : nat) : tactic clause := do
guard $ clause.li... |
43b31e42c9611fdeba97ca80190cf1af7e0c06bc | f1dc39e1c68f71465c8bf79910c4664d03824751 | /library/init/meta/environment.lean | cadb1de4466f9afa74d36af40065916760f32412 | [
"Apache-2.0"
] | permissive | kckennylau/lean-2 | 6504f45da07bc98b098d726b74130103be25885c | c9a9368bc0fd600d832bd56c5cb2124b8a523ef9 | refs/heads/master | 1,659,140,308,864 | 1,589,361,166,000 | 1,589,361,166,000 | 263,748,786 | 0 | 0 | null | 1,589,405,915,000 | 1,589,405,915,000 | null | UTF-8 | Lean | false | false | 10,103 | 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.meta.declaration init.meta.exceptional init.data.option.basic
import init.meta.rb_map
/-- An __environment__ contains all of the declar... |
6a3d5ca5c697d516118b01c9b210c41b03ca767c | 41ebf3cb010344adfa84907b3304db00e02db0a6 | /uexp/src/uexp/rules/pullConstantThroughUnion2.lean | ab98ec5d97bd859967040e0f052fdd3681ab8bba | [
"BSD-2-Clause"
] | permissive | ReinierKoops/Cosette | e061b2ba58b26f4eddf4cd052dcf7abd16dfe8fb | eb8dadd06ee05fe7b6b99de431dd7c4faef5cb29 | refs/heads/master | 1,686,483,953,198 | 1,624,293,498,000 | 1,624,293,498,000 | 378,997,885 | 0 | 0 | BSD-2-Clause | 1,624,293,485,000 | 1,624,293,484,000 | null | UTF-8 | Lean | false | false | 2,089 | lean | import ..sql
import ..tactics
import ..u_semiring
import ..extra_constants
import ..meta.ucongr
import ..meta.TDP
-- set_option profiler true
open Expr
open Proj
open Pred
open SQL
open tree
notation `int` := datatypes.int
variable integer_1: const datatypes.int
variable integer_2: const datatypes.int
theorem rul... |
c843c726ca3f11fcf1a8c0ac688323c15a48024f | 7afc29faca4febb6e5005c20aa4aa5c3df5cf35c | /src/finite.lean | 95a3e4e150888efc3d77fcc37fd2247f194ffc06 | [
"MIT"
] | permissive | Piwry/Proof-of-Surreal | ad2883027e275050b43a578c5513ae3fe350515b | 6b92baf2382ac23dd0d700f5c958aa910ad4b754 | refs/heads/master | 1,670,521,185,736 | 1,599,657,591,000 | 1,599,657,591,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,287 | lean | import data.list tactic.omega defs single height
def left_bintree : list bintree → list bintree
| [] := []
| (t :: l) := ⟦t ∣⟧ :: left_bintree l
def right_bintree : list bintree → list bintree
| [] := []
| (t :: l) := ⟦∣ t⟧ :: right_bintree l
def full_list_bintree (t : bintree) : list bintree → list bintree
| [] := ... |
8867826cd5dd5dacde62808383201396003b6749 | e0f9ba56b7fedc16ef8697f6caeef5898b435143 | /src/algebra/lie_algebra.lean | 6f66d14092d59d9f8de3625e1c2bd141b2ac6d7a | [
"Apache-2.0"
] | permissive | anrddh/mathlib | 6a374da53c7e3a35cb0298b0cd67824efef362b4 | a4266a01d2dcb10de19369307c986d038c7bb6a6 | refs/heads/master | 1,656,710,827,909 | 1,589,560,456,000 | 1,589,560,456,000 | 264,271,800 | 0 | 0 | Apache-2.0 | 1,589,568,062,000 | 1,589,568,061,000 | null | UTF-8 | Lean | false | false | 26,457 | lean | /-
Copyright (c) 2019 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import ring_theory.algebra
import linear_algebra.linear_action
/-!
# Lie algebras
This file defines Lie rings, and Lie algebras over a commutative ring. It shows how thes... |
b456825d1226c75efcdef843986a3bccf0d13a6d | 4950bf76e5ae40ba9f8491647d0b6f228ddce173 | /src/topology/instances/real.lean | c7cfc8862951f19976fb0c98069492e4a574ac35 | [
"Apache-2.0"
] | permissive | ntzwq/mathlib | ca50b21079b0a7c6781c34b62199a396dd00cee2 | 36eec1a98f22df82eaccd354a758ef8576af2a7f | refs/heads/master | 1,675,193,391,478 | 1,607,822,996,000 | 1,607,822,996,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 16,670 | 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 topology.metric_space.basic
import topology.algebra.uniform_group
import topology.algebra.ring
import topology.algebra.continuous_functions
imp... |
16c6e8b79747a8b2abd0efcd1e55d1aac1faa1cf | 17d3c61bf162bf88be633867ed4cb201378a8769 | /library/init/native/default.lean | e41a3a6577d312ac4f845046e7585e463ebda6bb | [
"Apache-2.0"
] | permissive | u20024804/lean | 11def01468fb4796fb0da76015855adceac7e311 | d315e424ff17faf6fe096a0a1407b70193009726 | refs/heads/master | 1,611,388,567,561 | 1,485,836,506,000 | 1,485,836,625,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 23,828 | 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.category.state
import init.data.string
import init.data.list.instances
import init.native.ir
import in... |
3e6ab68bc1560f39f7be17d4239ed17569df62d6 | 592ee40978ac7604005a4e0d35bbc4b467389241 | /Library/generated/mathscheme-lean/RingoidSig.lean | 73fba5aa723806f7b686d57993ad1bee6f1718f6 | [] | no_license | ysharoda/Deriving-Definitions | 3e149e6641fae440badd35ac110a0bd705a49ad2 | dfecb27572022de3d4aa702cae8db19957523a59 | refs/heads/master | 1,679,127,857,700 | 1,615,939,007,000 | 1,615,939,007,000 | 229,785,731 | 4 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,442 | lean | import init.data.nat.basic
import init.data.fin.basic
import data.vector
import .Prelude
open Staged
open nat
open fin
open vector
section RingoidSig
structure RingoidSig (A : Type) : Type :=
(times : (A → (A → A)))
(plus : (A → (A → A)))
open RingoidSig
structure Sig (AS : Type) : Type :=... |
04ab6e5878cf366c7775e8ed5192a95de6e7b46a | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/linear_algebra/affine_space/independent.lean | 8170a8ef8e90d07433d7df88469d7ad42ea290f3 | [
"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 | 24,457 | lean | /-
Copyright (c) 2020 Joseph Myers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Joseph Myers
-/
import data.finset.sort
import data.matrix.notation
import linear_algebra.affine_space.combination
import linear_algebra.basis
/-!
# Affine independence
This file defin... |
45d535e5eacf8af09c6c2f814fe73901ab1ad189 | 9fbfc7e84d479e54de3c77b32724433407ea166b | /08_Disjunction/00_intro.lean | cc22a3cf0e6d61027a85c2b313ae72c17898abb6 | [] | no_license | ryangreen1234/cs-dm | 86843939250350455a45e5b508e9d6906e6d4ac9 | 2fed37a845894188ce855b277b7fecda9b0e097d | refs/heads/master | 1,585,441,631,595 | 1,537,270,760,000 | 1,537,270,760,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,284 | lean | -- UNDER CONSTRUCTION
variables P Q R X Y Z: Prop
variable pfP : P
variable pfQ : Q
variable pfR : R
/-
If P and Q are propositions, then
P ∨ Q is also a proposition. It is
read as "P or Q" and is called a
disjunction. P and Q are called the
disjuncts.
In constructive logic, P ∨ Q, is
judged to be true if either a p... |
bf50ec884d8d1fa2ba338e272c81ef3872ca14ed | bd12a817ba941113eb7fdb7ddf0979d9ed9386a0 | /src/tactic/interactive.lean | 71271597ae5d07d2993c99ebe8d151b8d1f46103 | [
"Apache-2.0"
] | permissive | flypitch/mathlib | 563d9c3356c2885eb6cefaa704d8d86b89b74b15 | 70cd00bc20ad304f2ac0886b2291b44261787607 | refs/heads/master | 1,590,167,818,658 | 1,557,762,121,000 | 1,557,762,121,000 | 186,450,076 | 0 | 0 | Apache-2.0 | 1,557,762,289,000 | 1,557,762,288,000 | null | UTF-8 | Lean | false | false | 22,317 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Simon Hudon, Sebastien Gouezel, Scott Morrison
-/
import tactic.core data.list.defs
open lean
open lean.parser
local postfix `?`:9001 := optional
local postfix *:9001... |
292727c7c83552eff9285a433d9d6561c91d8f0a | 947b78d97130d56365ae2ec264df196ce769371a | /stage0/src/Lean/Elab/PreDefinition/Structural.lean | 8d6dd15403515298c316546c676a9f85050b7eb9 | [
"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 | 16,698 | 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.ForEachExpr
import Lean.Meta.ForEachExpr
import Lean.Meta.RecursorInfo
import Lean.Meta.Match.Match
import Lean.Elab.PreDefinition.Basic
n... |
2f3124f5a5c4fd153687993595e2717660724a3c | 5756a081670ba9c1d1d3fca7bd47cb4e31beae66 | /Mathport.lean | 8bda7104b275f9a393e95100cdf49aa0077ab7bf | [
"Apache-2.0"
] | permissive | leanprover-community/mathport | 2c9bdc8292168febf59799efdc5451dbf0450d4a | 13051f68064f7638970d39a8fecaede68ffbf9e1 | refs/heads/master | 1,693,841,364,079 | 1,693,813,111,000 | 1,693,813,111,000 | 379,357,010 | 27 | 10 | Apache-2.0 | 1,691,309,132,000 | 1,624,384,521,000 | Lean | UTF-8 | Lean | false | false | 1,986 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Daniel Selsam
-/
import Mathport.Binary
import Mathport.Syntax
namespace Mathport
open Lean Lean.Elab.Command
def mathport1 (config : Config) (path : Path) : ... |
c8a10e99e7c20c72ec88d49dac1bc3e3db388dad | 618003631150032a5676f229d13a079ac875ff77 | /test/apply_fun.lean | 5f37122d01d13e622f024091135ed863ec771304 | [
"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 | 827 | lean | import tactic.apply_fun
open function
example (X Y Z : Type) (f : X → Y) (g : Y → Z) (H : injective $ g ∘ f) :
injective f :=
begin
intros x x' h,
apply_fun g at h,
exact H h
end
example (f : ℕ → ℕ) (a b : ℕ) (monof : monotone f) (h : a ≤ b) : f a ≤ f b :=
begin
apply_fun f at h,
assumption,
assumption... |
c62bfdc6409bbccc434609750b85453b8b4d5692 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/geometry/manifold/algebra/left_invariant_derivation.lean | 69567e95ed6eb881cba88d7adfffbde746b69384 | [
"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 | 8,872 | lean | /-
Copyright © 2020 Nicolò Cavalleri. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nicolò Cavalleri
-/
import geometry.manifold.derivation_bundle
/-!
# Left invariant derivations
In this file we define the concept of left invariant derivation for a Lie group. The... |
7184dfd79a4ff0647316fb5bc2e719baba44f734 | ad3e8f15221a986da27c99f371922c0b3f5792b6 | /src/week-03/solutions/e01-languages.lean | dc478a2a3b0e99969bee180e0c21c8d9ca32a133 | [] | no_license | VArtem/lean-itmo | a0e1424c8cc4c2de2ac85ab6fd4a12d80e9b85f1 | dc44cd06f9f5b984d051831b3aaa7364e64c2dc4 | refs/heads/main | 1,683,761,214,467 | 1,622,821,295,000 | 1,622,821,295,000 | 357,236,048 | 12 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 15,417 | lean | import data.set.basic
import data.list.basic
import tactic
open set list
-- Будем рассматривать языкы над алфавитом α
-- Язык это просто set (list α)
namespace languages
variables {α : Type} {L M : set (list α)}
-- Несколько удобных сокращений: ε = пустой список, 0 = ∅, 1 = {ε}, A + B = A ∪ B
def ε {α} : list α :... |
12b8462872a76d062d69fa1f8e9b4a9233c9e37c | 0ddf2dd8409bcb923d11603846800bd9699616ea | /exercises.lean | 91f8d1f7f09b5c9fa57251981958eb417101fe19 | [] | no_license | tounaishouta/Lean | 0cbaaa9340e7f8f884504ea170243e07a54f0566 | 1d75311f5506ca2bfd8b7ccec0b7d70c3319d555 | refs/heads/master | 1,610,229,383,935 | 1,459,950,226,000 | 1,459,950,226,000 | 50,836,185 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 23,065 | lean | import standard
namespace sec_2_4
open nat
definition double (x : nat) : nat := x + x
definition do_twice (f : nat → nat) (x : nat) : nat := f (f x)
definition quadruple : nat → nat := do_twice double
-- eval quadruple 8
-- 32
definition Do_Twice : ((nat → nat) → (nat → nat)) → ((nat → nat) → (nat → nat))
| Do_T... |
909660a7347d79ba7e8c0933be7bab238e92a012 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/category/Kleisli.lean | 470d94c082d851285cdb36f90fb76eeb79691238 | [] | 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 | 1,337 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Simon Hudon
The Kleisli construction on the Type category
TODO: generalise this to work with category_theory.monad
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import M... |
01ce1a281a28d1754f9261c4b89ef6d0623d7d80 | e898bfefd5cb60a60220830c5eba68cab8d02c79 | /uexp/src/uexp/rules/transitiveInferenceAggregate.lean | 4a1b790afa47f399315a686d5da22bf03e8ee812 | [
"BSD-2-Clause"
] | permissive | kkpapa/Cosette | 9ed09e2dc4c1ecdef815c30b5501f64a7383a2ce | fda8fdbbf0de6c1be9b4104b87bbb06cede46329 | refs/heads/master | 1,584,573,128,049 | 1,526,370,422,000 | 1,526,370,422,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,891 | lean | import ..sql
import ..tactics
import ..u_semiring
import ..extra_constants
import ..cosette_tactics
open Expr
open Proj
open Pred
open SQL
open tree
notation `int` := datatypes.int
constant integer_1 : const int
constant integer_7 : const int
lemma rule:
forall ( Γ scm_t scm_account scm_bonus scm_dept scm_emp... |
adb9b591f956fdae3a5909f42e72cab95b78ac5d | 2c41ae31b2b771ad5646ad880201393f5269a7f0 | /Lean/Qualities/Safe.lean | a1e2a8a320dd07c41057622ec53e7715e77dcd31 | [] | no_license | kevinsullivan/Boehm | 926f25bc6f1a8b6bd47d333d936fdfc278228312 | 55208395bff20d48a598b7fa33a4d55a2447a9cf | refs/heads/master | 1,586,127,134,302 | 1,488,252,326,000 | 1,488,252,326,000 | 32,836,930 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 626 | lean | -- Safe
/-
[Safe] is parameterized by an instance of type [SystemType], and it's a sub-attribute to [Dependable].
An instance of type [SystemType] is deemed [Safe] if and only if all the requirements are satisfied.
-/
import SystemModel.System
inductive Safe (sys_type: SystemType): Prop
| intro : (exists sa... |
972d2758d4a0c9765d47047d6d5180ab0d957cbd | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/data/pfun.lean | 94cb1ea8ca99822a2f83da079ef037ea1bfc70a1 | [
"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 | 24,926 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Jeremy Avigad, Simon Hudon
-/
import data.rel
/-- `roption α` is the type of "partial values" of type `α`. It
is similar to `option α` except the domain condition ca... |
bd822474f3eed662d8e4e9bb8ac91426d1e72d4d | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /src/Init/Data/List/BasicAux.lean | 645b095ecd8c96e5c1d2c4ac62dc3dad07723c48 | [
"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 | 2,195 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
prelude
import Init.Data.List.Basic
import Init.Util
universe u
namespace List
/- The following functions can't be defined at `Init.Data.List.Basic`, becau... |
032c9b221f45f9a5c8dd7aaeedc77f420c978c5d | 9ad8d18fbe5f120c22b5e035bc240f711d2cbd7e | /src/algebra/power_series.lean | 383d09b4547ce5cc1b735076b713bf157763b457 | [] | no_license | agusakov/lean_lib | c0e9cc29fc7d2518004e224376adeb5e69b5cc1a | f88d162da2f990b87c4d34f5f46bbca2bbc5948e | refs/heads/master | 1,642,141,461,087 | 1,557,395,798,000 | 1,557,395,798,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 18,197 | lean | /-
Copyright (c) 2019 Neil Strickland. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Neil Strickland
Given a semiring `R`, this file defines the power series semiring `R[[x]]`
-/
import data.fintype data.finsupp algebra.big_operators algebra.pi_instances
import dat... |
08ae30347477e41224b46a1c716c08321d95f14f | f5f7e6fae601a5fe3cac7cc3ed353ed781d62419 | /src/algebra/big_operators.lean | 405e2c54bfd6001e8da23e90b938c45a7dbb08c3 | [
"Apache-2.0"
] | permissive | EdAyers/mathlib | 9ecfb2f14bd6caad748b64c9c131befbff0fb4e0 | ca5d4c1f16f9c451cf7170b10105d0051db79e1b | refs/heads/master | 1,626,189,395,845 | 1,555,284,396,000 | 1,555,284,396,000 | 144,004,030 | 0 | 0 | Apache-2.0 | 1,533,727,664,000 | 1,533,727,663,000 | null | UTF-8 | Lean | false | false | 30,770 | 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
Some big operators for lists and finite sets.
-/
import data.list.basic data.list.perm data.finset
import algebra.group algebra.ordered_group algebra.group_power
unive... |
6333819d7edc8da2e382598282e929a197a0b23a | 618003631150032a5676f229d13a079ac875ff77 | /src/algebraic_geometry/prime_spectrum.lean | 9d6e7eed90d50f4ae501b69278cd5304a2a68800 | [
"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 | 13,043 | 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 topology.opens
import ring_theory.ideal_operations
import linear_algebra.finsupp
/-!
# Prime spectrum of a commutative ring
The prime spectrum of a commutati... |
61667fbc67ce9e2ac4b803da613ceef76ab40ea1 | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /stage0/src/Lean/Meta.lean | b1cadcec89a4091fc59aa48b29d46a701e57d02d | [
"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,052 | 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.Meta.Basic
import Lean.Meta.LevelDefEq
import Lean.Meta.WHNF
import Lean.Meta.InferType
import Lean.Meta.FunInfo
import Lean.Meta.ExprDefEq
impo... |
6bc70f898040e45eda17bba5cc3ded38b5a02944 | 274748215b6d042f0d9c9a505f9551fa8e0c5f38 | /src/for_mathlib/ring_theory/algebra.lean | be2cd104a6814747ea54e94da5b4c2a33ac653a4 | [
"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 | 4,212 | lean | import ring_theory.algebra
namespace mv_polynomial
/-- evaluation of a polynomial over R in an R-algebra is an R-algebra morphism-/
noncomputable def alg_eval
{R : Type*} [comm_ring R] {A : Type*} [comm_ring A] [algebra R A] {σ : Type*}
(f : σ → A) : mv_polynomial σ R →ₐ[R] A :=
{ commutes' := λ _, eval₂_C _ _ _,... |
cf01d4a1ab686f5975dd335923ffadc96f340bbd | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/issue136.lean | 5ae51caf9bb9287fd5fb1bd4f94b6398c8a7a50a | [
"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 | 185 | lean |
meta def tactic.interactive.test (a : interactive.parse
(lean.parser.of_tactic (@tactic.fail ℕ _ _ "oh no"))) :=
tactic.skip
example : true := begin test end -- should be "oh no"
|
24406801ce8dcfbaf3c3d32ca66db5bb8c9ff9d5 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /library/init/functor.lean | cb845e9f9bcae60942fde26f003af825bae842bc | [
"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 | 492 | lean | /-
Copyright (c) Luke Nelson and Jared Roesch. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Luke Nelson and Jared Roesch
-/
prelude
universe variables u v
structure [class] functor (F : Type u → Type v) : Type (max u+1 v) :=
(map : Π {A B : Type u}, (A → B) → F A → ... |
872321ea9134f4c66e1dd15c985d53f634d7affd | 32317185abf7e7c963f4c67c190aec61af6b3628 | /tests/lean/run/inj_tac.lean | 6d6bdb19e198faa8fb9016a87dcdc4de43f685ac | [
"Apache-2.0"
] | permissive | Andrew-Zipperer-unorganized/lean | 198a2317f21198cd8d26e7085e484b86277f17f7 | dcb35008e1474a0abebe632b1dced120e5f8c009 | refs/heads/master | 1,622,526,520,945 | 1,453,576,559,000 | 1,454,612,842,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,252 | lean | import data.examples.vector
open nat vector
example (a b : nat) : succ a = succ b → a + 2 = b + 2 :=
begin
intro H,
injection H with aeqb,
rewrite aeqb
end
example (A : Type) (n : nat) (v w : vector A n) (a : A) (b : A) :
a :: v = a :: w → b :: v = b :: w :=
begin
intro H, injection H with veqw,
re... |
14be02c3e26d97e95c7cd10e812630ca4a832cf5 | 32025d5c2d6e33ad3b6dd8a3c91e1e838066a7f7 | /src/Lean/Parser/Level.lean | eb0cb484524750e56167a2a7db4e4120e288d10a | [
"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,116 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Sebastian Ullrich
-/
import Lean.Parser.Extension
-- necessary for auto-generation
import Lean.PrettyPrinter.Parenthesizer
import Lean.PrettyPrinter.Formatte... |
e05bf207369d0925ae137fc8d907a5d3dde4c4fb | f57570f33b51ef0271f8c366142363d5ae8fff45 | /src/native_logic.lean | e4396abcde976bdc40a9e10220c9570e2f9984be | [] | no_license | maxd13/lean-logic | 4083cb3fbb45b423befca7fda7268b8ba85ff3a6 | ddcab46b77adca91b120a5f37afbd48794da8b52 | refs/heads/master | 1,692,257,681,488 | 1,631,740,832,000 | 1,631,740,832,000 | 246,324,437 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 16,399 | lean | import tactic.find tactic.tidy data.set.basic
universes u v
namespace metalogic
open tactic set
inductive HProp : Type
| intro (p : Prop) : HProp
def is_true : HProp → Prop
| (HProp.intro p) := p
-- inductive andH : HProp → HProp
-- | intro (p : HProp) : andH p
inductive provable.prop.classical : set (Sort u) ... |
f925fe2bf32f3b32935d537e728100cefae2314e | 94e33a31faa76775069b071adea97e86e218a8ee | /src/logic/equiv/basic.lean | 6e3532985a63b8cf55c7edd7d21a8effe9a7bc9e | [
"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 | 95,193 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Mario Carneiro
-/
import data.fun_like.equiv
import data.option.basic
import data.prod.basic
import data.quot
import data.sigma.basic
import data.subtype
impo... |
24fd3f5ce811a913f9f3d7eae04a6487a8298cee | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tests/lean/termination_by.lean | 5a817b5eef2b7fd7d5fe813191a3bb9530e903b3 | [
"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 | 727 | lean | mutual
inductive Even : Nat → Prop
| base : Even 0
| step : Odd n → Even (n+1)
inductive Odd : Nat → Prop
| step : Even n → Odd (n+1)
end
termination_by measure
mutual
def f (n : Nat) :=
if n == 0 then 0 else f (n / 2) + 1
termination_by measure
end
def g' (n : Nat) :=
match n with
| 0 => 1
... |
578f4645df29bee017e77cc4f2d5e65872903151 | 853df553b1d6ca524e3f0a79aedd32dde5d27ec3 | /src/data/real/hyperreal.lean | ecf22c62f5f256585ef8fea107b4549288096ce7 | [
"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 | 37,204 | 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.filter_product
import analysis.specific_limits
/-!
# Construction of the hyperreal numbers as an ultraproduct of real sequenc... |
46812b74955e35f161379e1041b9ca09b764ce5a | ce40a712ea5395b5e4eb6388d6ec7cbe44a2cc0d | /zsh-zimfw/.p10k.zsh.lean | 31020be0101b2a6aa76e39ec64f8fe94f5a0c7ff | [] | no_license | dcabooter/tools | f24a6bf7e44a2506f941f763040ca80fbc8230c6 | 18cc9665ab79c51df375aa0c19baf3dbd0ac26ac | refs/heads/main | 1,651,240,778,324 | 1,649,322,811,000 | 1,649,322,811,000 | 247,667,259 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 82,921 | lean | # Generated by Powerlevel10k configuration wizard on 2021-03-04 at 11:24 CET.
# Based on romkatv/powerlevel10k/config/p10k-lean.zsh, checksum 9871.
# Wizard options: nerdfont-complete + powerline, small icons, unicode, lean, 24h time,
# 2 lines, disconnected, left frame, lightest-ornaments, sparse, many icons, fluent,
... |
82691686d16d3f5e93cc4d022f6c53f4584ddc1d | b70031c8e2c5337b91d7e70f1e0c5f528f7b0e77 | /src/linear_algebra/finsupp.lean | 06365669fbc22993926044d93a020f7cd7ee3446 | [
"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 | 24,917 | lean | /-
Copyright (c) 2019 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Johannes Hölzl
-/
import data.finsupp.basic
import linear_algebra.basic
/-!
# Properties of the semimodule `α →₀ M`
Given an `R`-semimodule `M`, the `R`-semimodule structure on `α →₀ ... |
f4d965c577ee75b5088a25c34ffcf8d27d0c9a08 | 9dd3f3912f7321eb58ee9aa8f21778ad6221f87c | /library/init/data/quot.lean | 55e0da8547ed20d243f8e29a2c486cecf7c58a6f | [
"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 | 9,374 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
Quotient types.
-/
prelude
/- We import propext here, otherwise we would need a quot.lift for propositions. -/
import init.data.sigma.basic init.logic init.pro... |
5cb0269719e27c5dea9a5badb3d16fe2cbf7b3ce | ac60dab17014edd769c9618cc1569ce8c960a6a5 | /src/gol.lean | c7c9ec410fa71feb9b47479597f70abae1a06001 | [
"MIT"
] | permissive | frankSil/CAExtensions | 20e1f856b3ad775d5e8dc8877614dbcd58c77901 | f5c74fd9a806696c73497d9abd45b7315f45379f | refs/heads/master | 1,608,706,941,607 | 1,586,193,337,000 | 1,586,193,337,000 | 237,077,434 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,429 | lean | import cautomaton utils data.nat.basic
open utils
namespace gol
section gol
open list function
inductive cellT | A | D
open cellT
def cellT_str : cellT → string
| A := "X"
| D := " "
instance cellT_to_str : has_to_string cellT := ⟨cellT_str⟩
instance cellT_repr : has_repr cellT := ⟨cellT_str⟩
instance c... |
6c53b1fbc19f4e023b5c633f3da1b616df31313e | e0f9ba56b7fedc16ef8697f6caeef5898b435143 | /src/analysis/convex/basic.lean | e8642c5c93898342dfe16fb856da87f42607562d | [
"Apache-2.0"
] | permissive | anrddh/mathlib | 6a374da53c7e3a35cb0298b0cd67824efef362b4 | a4266a01d2dcb10de19369307c986d038c7bb6a6 | refs/heads/master | 1,656,710,827,909 | 1,589,560,456,000 | 1,589,560,456,000 | 264,271,800 | 0 | 0 | Apache-2.0 | 1,589,568,062,000 | 1,589,568,061,000 | null | UTF-8 | Lean | false | false | 37,849 | lean | /-
Copyright (c) 2019 Alexander Bentkamp. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Alexander Bentkamp, Yury Kudriashov
-/
import data.set.intervals
import data.complex.module
import algebra.pointwise
/-!
# Convex sets and functions on real vector spaces
In a re... |
11640909d93f1f3df113cb5e6c129f7daeae18e2 | 78269ad0b3c342b20786f60690708b6e328132b0 | /src/library_dev/algebra/lattice/boolean_algebra.lean | e2a21b0e58f7b8d023585ffeecdc0ba14d09eeb1 | [] | no_license | dselsam/library_dev | e74f46010fee9c7b66eaa704654cad0fcd2eefca | 1b4e34e7fb067ea5211714d6d3ecef5132fc8218 | refs/heads/master | 1,610,372,841,675 | 1,497,014,421,000 | 1,497,014,421,000 | 86,526,137 | 0 | 0 | null | 1,490,752,133,000 | 1,490,752,132,000 | null | UTF-8 | Lean | false | false | 4,477 | 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
Type class hierarchy for Boolean algebras.
-/
import .bounded_lattice
set_option old_structure_cmd true
universes u
variables {α : Type u} {x y z : α}
namespace latt... |
d409fc673fb4eb5b40c018581ce0bfdb71fc1b9a | 432d948a4d3d242fdfb44b81c9e1b1baacd58617 | /src/data/polynomial/monic.lean | e88963526cb66e85a3cdb4753d58ef0ffcab1b09 | [
"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 | 9,429 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Johannes Hölzl, Scott Morrison, Jens Wagemaker
-/
import data.polynomial.reverse
import algebra.associated
/-!
# Theory of monic polynomials
We give several tools for pro... |
50d1adc31f1d53c8ffb51700b8182e9711554565 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/star/pi.lean | b7d59f4906bfee9ef3a8c3761adfae3376281115 | [
"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,268 | lean | /-
Copyright (c) 2021 Eric Wieser. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Eric Wieser
-/
import algebra.star.basic
import algebra.ring.pi
/-!
# `star` on pi types
We put a `has_star` structure on pi types that operates elementwise, such that it describes the
... |
97b7377e780f03ea13913433a070be4899875a93 | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/field_theory/finite.lean | f99762ad363fae02dc1062988621f309f2014aa9 | [
"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 | 3,567 | 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.order_of_element data.polynomial data.equiv.algebra
universes u v
variables {α : Type u} {β : Type v}
open function finset polynomial nat
section
... |
11746d2dbc331c60bf4ac0abcedde3aabd7b49dc | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/data/buffer/parser/basic.lean | 69ad6675304a84f13e9a5df0b3d463d0f6cd4a4c | [
"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 | 110,078 | lean | /-
Copyright (c) 2020 Yakov Pechersky. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yakov Pechersky
-/
import data.string.basic
import data.buffer.basic
import data.nat.digits
/-!
# Parsers
`parser α` is the type that describes a computation that can ingest a `char... |
5bd7ec5ce695f1b2bc2b0483dddb4c631bcb762d | 2eab05920d6eeb06665e1a6df77b3157354316ad | /src/measure_theory/integral/interval_integral.lean | 650d202b4d009e50ddbb35e7a6040f93fa99f880 | [
"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 | 125,108 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov, Patrick Massot, Sébastien Gouëzel
-/
import analysis.calculus.extend_deriv
import analysis.calculus.fderiv_measurable
import analysis.normed_space.dual
import m... |
77fc5345fc8a45c10e3919c2ef9020da1b2371fc | 137c667471a40116a7afd7261f030b30180468c2 | /src/linear_algebra/basic.lean | 294ca6bbc5ea5e4d9c567dbdf4439393b7b4bb0c | [
"Apache-2.0"
] | permissive | bragadeesh153/mathlib | 46bf814cfb1eecb34b5d1549b9117dc60f657792 | b577bb2cd1f96eb47031878256856020b76f73cd | refs/heads/master | 1,687,435,188,334 | 1,626,384,207,000 | 1,626,384,207,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 113,451 | 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, Kevin Buzzard, Yury Kudryashov
-/
import algebra.big_operators.pi
import algebra.module.hom
import algebra.module.pi
import algebra.module.prod
import a... |
2e9e47e5e7bafdc42ea4b7368741b5db01d8c3a7 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/hidingInaccessibleNames.lean | c4028786fe89256f0b9d7c2e7700e18918add1b2 | [
"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 | 689 | lean | def f : (xs : List Nat) → Nat → xs ≠ [] → Nat
| [], _, _ => _
| [a,b], _, _ => _
| _, _, _ => _
set_option pp.inaccessibleNames true in
def f' : (xs : List Nat) → Nat → xs ≠ [] → Nat
| [], _, _ => _ -- TODO: figure out why hyp `Ne (α := List Nat) x✝² []` needs α
| [a,b], _, _ => _
| _, _, _ => _
theorem ... |
0e301c91824ec9efa2b94fb0cbadba0a100bf4ed | 4ec0e92c725fad3fd2871a0ab050a7da1c719444 | /src/mywork/lecture_4.lean | f3ab0c88dd75d028a405bdf795e50e5acffd3c82 | [] | no_license | mitchelltaylor06/cs2120f21 | cc2c2b61a7e45c07faa849fcb8a66eb948753a25 | efb71a748d7c76e24834d03b8f01c3ae084c1756 | refs/heads/main | 1,693,841,444,092 | 1,633,713,850,000 | 1,633,713,850,000 | 399,946,415 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,189 | lean | /-
In this file, we give formal statements (our version)
of the two axioms of equality. We also present Lean's
versions of these rules, and show how you can use them
without giving all of the arguments explicitly.
-/
/-
AXIOMS
Everything is equal to itself. A bit more formally,
if one is given a type, T, and a value,... |
ea8f5ace6975fb5e6cb6655d83dde80c82cf6064 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/algebra/group_power/lemmas.lean | dccd0bf686b6e2581458352858bd8a87f5dc6969 | [
"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 | 35,778 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Robert Y. Lewis
-/
import data.int.cast
/-!
# Lemmas about power operations on monoids and groups
This file contains lemmas about `monoid.pow`, `group.pow`, `nsmul`, `z... |
564e57fe96ccc9b573121d3e35f96350c866fb48 | 8e6cad62ec62c6c348e5faaa3c3f2079012bdd69 | /src/geometry/manifold/basic_smooth_bundle.lean | 29e80ade9963019bbbc0bc56cef7a5cd2b48402d | [
"Apache-2.0"
] | permissive | benjamindavidson/mathlib | 8cc81c865aa8e7cf4462245f58d35ae9a56b150d | fad44b9f670670d87c8e25ff9cdf63af87ad731e | refs/heads/master | 1,679,545,578,362 | 1,615,343,014,000 | 1,615,343,014,000 | 312,926,983 | 0 | 0 | Apache-2.0 | 1,615,360,301,000 | 1,605,399,418,000 | Lean | UTF-8 | Lean | false | false | 31,947 | 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.topological_fiber_bundle
import geometry.manifold.smooth_manifold_with_corners
/-!
# Basic smooth bundles
In general, a smooth bundle is a bun... |
6440cb35edc20b7e0478110d300251157f53d8e3 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/1235.lean | b9e0f4b994b643f01a78c4e006a58d205794c944 | [
"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 | 160 | lean | opaque f (a b : Nat) : Nat
example : f 1 2 = f 2 1 := by
generalize h : f 1 = g
/- g : ℕ → ℕ
h : f 1 = g
⊢ g 2 = f 2 1 -/
trace_state
sorry
|
96b372174b40c12c2580af62c3c18064d247de7c | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/lean/run/foldConsts.lean | ba00314037152930efc7f80cc2cee53fbc8ad013 | [
"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 | 279 | lean | import Init.Lean
open Lean
def mkTerm : Nat → Expr
| 0 => mkApp (mkConst `a) (mkConst `b)
| n+1 => mkApp (mkTerm n) (mkTerm n)
def collectConsts (e : Expr) : List Name :=
e.foldConsts [] List.cons
def tst1 : IO Unit :=
IO.println $ collectConsts (mkTerm 1000)
#eval tst1
|
027c4a7c7a2b59e2d9a24e925319e872a6e75fb4 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/bench/binarytrees.st.lean | f28a73e3affe05f2f9e3ef315607a8a8c708721d | [
"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,405 | lean | inductive Tree
| nil
| node (l r : Tree)
instance : Inhabited Tree := ⟨.nil⟩
-- This function has an extra argument to suppress the
-- common sub-expression elimination optimization
partial def make' (n d : UInt32) : Tree :=
if d = 0 then .node .nil .nil
else .node (make' n (d - 1)) (make' (n + 1) (d - 1))
--... |
1908ce06c9c6966ebee45c22ae2d0b125a954654 | 0003047346476c031128723dfd16fe273c6bc605 | /src/algebra/group.lean | 802b56e4471525535097fd7da74f0384b52d10ce | [
"Apache-2.0"
] | permissive | ChandanKSingh/mathlib | d2bf4724ccc670bf24915c12c475748281d3fb73 | d60d1616958787ccb9842dc943534f90ea0bab64 | refs/heads/master | 1,588,238,823,679 | 1,552,867,469,000 | 1,552,867,469,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 35,949 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura
Various multiplicative and additive structures.
-/
import tactic.interactive data.option.defs
section pending_1857
/- Transport multiplicative to add... |
c53f98885887b4081e4837fca38c91ff9dbc6e43 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/meta/rewrite_tactic.lean | 173556caeed59ebab051b5981e8d82ddd9e9a317 | [] | 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 | 477 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.meta.relation_tactics
import Mathlib.Lean3Lib.init.meta.occurrences
universes l
namespace Mathlib
... |
57c237c727311e029d7c22c1658c48a16d1eb977 | da2388aff16df48b4a928b575bcec678b8e7f2cf | /src/mwe.lean | 7f65cdef9794f26ea407a1f937ffdfd278a23524 | [] | no_license | ADedecker/series | 1d0d282d4333c7599f07cc705a35cf5edfb87a3b | 12fbcdd16b3cdeda4476165a4645fcccc0fb3234 | refs/heads/master | 1,674,828,739,868 | 1,607,618,619,000 | 1,607,618,619,000 | 304,379,894 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,192 | lean | import analysis.calculus.deriv
open filter asymptotics
open_locale topological_space
lemma is_o_pow_pow {α : Type*} [normed_field α] [discrete_linear_ordered_field α]
{p q : ℕ} (hpq : p < q) : is_o (λ (x : α), x^p) (λ x, x^q) at_top :=
begin
rw is_o_iff_tendsto sorry,
suffices h : tendsto (λ (x : α), x ^ ((p :... |
e4615bd715e96ae3f4ec28c91a7f0a7d55e925b2 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Elab/Calc.lean | 0e5a5cde41c71ca71ba4e8faf547ed7c794b8131 | [
"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 | 4,982 | lean | /-
Copyright (c) 2022 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Elab.App
namespace Lean.Elab.Term
open Meta
/--
Decompose `e` into `(r, a, b)`.
Remark: it assumes the last two arguments are explicit. -... |
ee04468785133c8cf86d3392e7d7a7e23fda0b92 | 618003631150032a5676f229d13a079ac875ff77 | /test/lint_coe_t.lean | 6cd2995373a04f40ceccae37fadac3e54b4e82f6 | [
"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 | 1,084 | lean | import tactic.lint
open tactic
-- bad, because every iteration of tc search will loop, generating nested quotients
section
local attribute [instance]
def a_to_quot {α} (R : setoid α) : has_coe α (quotient R) := ⟨quotient.mk⟩
run_cmd do
d ← get_decl ``a_to_quot,
some _ ← linter.has_coe_variable.test d,
d ← get_d... |
022fc847b708a60ab48937728d8556841a74750a | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/polynomial/expand.lean | 8df70d7d9590a6a4ef7743de5272dcfc79798780 | [
"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 | 9,731 | lean | /-
Copyright (c) 2020 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import ring_theory.polynomial.basic
import ring_theory.ideal.local_ring
import tactic.ring_exp
/-!
# Expand a polynomial by a factor of p, so `∑ aₙ xⁿ` becomes `∑ aₙ xⁿᵖ`.
> ... |
e412c468d2d192cf45b8175c18d9b43734281e82 | 367134ba5a65885e863bdc4507601606690974c1 | /src/data/list/nat_antidiagonal.lean | a1e0281ba661222b303030113a144bb67777604a | [
"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 | 1,839 | lean | /-
Copyright (c) 2019 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import data.list.range
open list function nat
namespace list
namespace nat
/-- The antidiagonal of a natural number `n` is the list of pairs `(i,j)` such that `i+j... |
5d6842eb1cf693f425379981a7aed5d7a9a20ddc | 4727251e0cd73359b15b664c3170e5d754078599 | /src/analysis/special_functions/trigonometric/chebyshev.lean | 69dd2162d0021cf838dfd9d85bcb5f3934f0ea0a | [
"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,276 | 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 analysis.complex.basic
import ring_theory.polynomial.chebyshev
import data.complex.exponential
/-!
# Multiple angle formulas in terms of Chebyshev polynomials... |
4a75943ade42cedcd6b106494176e2425d834954 | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/arith2.lean | 740659f251c0816f8a3201fd96669573bbd182b4 | [
"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 | 262 | lean | import Int.
import Real.
print 1/2
eval 4/6
print 3 div 2
variable x : Real
variable i : Int
variable n : Nat
print x + i + 1 + n
set_option lean::pp::coercion true
print x + i + 1 + n
print x * i + x
print x - i + x - x >= 0
print x < x
print x <= x
print x > x |
bb09ed688aeb76a17bbcd323a7405d8df8f61be6 | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch6/ex0501.lean | e83bb1b01288ebcae8d0775b4505a6155fcef377 | [] | 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 | 942 | lean | namespace hidden
variables {α : Type} (r : α → α → Prop)
definition reflexive : Prop := ∀ (a : α), r a a
definition symmetric : Prop := ∀ {a b : α}, r a b → r b a
definition transitive : Prop := ∀ {a b c : α}, r a b → r b c → r a c
definition euclidean : Prop := ∀ {a b c : α}, r a b → r a c → r b c
variab... |
8b5168d9dc64506d32099f68680597fa1a2b733f | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/tactic/norm_cast.lean | a054c66ae5d9e8cb080ad56c02395c84f238e56d | [] | 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,106 | lean | /-
Copyright (c) 2019 Paul-Nicolas Madelaine. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Paul-Nicolas Madelaine, Robert Y. Lewis
Normalizing casts inside expressions.
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.tactic.converter.in... |
dd0d1020b930e54d3c1583cb8f1c1b2ae1bf6faa | 7c92a46ce39266c13607ecdef7f228688f237182 | /src/for_mathlib/data/set/basic.lean | d44f5e2d3e0fd594c36816e1a426aba7ce59d7a6 | [
"Apache-2.0"
] | permissive | asym57/lean-perfectoid-spaces | 3217d01f6ddc0d13e9fb68651749469750420767 | 359187b429f254a946218af4411d45f08705c83e | refs/heads/master | 1,609,457,937,251 | 1,577,542,616,000 | 1,577,542,675,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,446 | lean | import data.finset
open set
universes u v
lemma set.mem_compl_singleton_iff {α : Type*} {a x : α} : x ∈ -({a} : set α) ↔ x ≠ a :=
by simp only [set.mem_singleton_iff, set.mem_compl_eq]
lemma set.subset_compl_singleton_iff {α : Type*} {a : α} {s : set α} : s ⊆ -({a} : set α) ↔ a ∉ s :=
by { rw subset_compl_comm, simp ... |
dbb1cc19e7cad4e5a0d352e089b8dcc7ae224123 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/algebra/direct_sum/internal.lean | 87dbb2e9fb0160c6b087b49250dddccb1e92a4c6 | [
"Apache-2.0"
] | permissive | jcommelin/mathlib | d8456447c36c176e14d96d9e76f39841f69d2d9b | ee8279351a2e434c2852345c51b728d22af5a156 | refs/heads/master | 1,664,782,136,488 | 1,663,638,983,000 | 1,663,638,983,000 | 132,563,656 | 0 | 0 | Apache-2.0 | 1,663,599,929,000 | 1,525,760,539,000 | Lean | UTF-8 | Lean | false | false | 9,798 | lean | /-
Copyright (c) 2021 Eric Wieser. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Eric Wieser, Kevin Buzzard, Jujian Zhang
-/
import algebra.algebra.operations
import algebra.algebra.subalgebra.basic
import algebra.direct_sum.algebra
/-!
# Internally graded rings and... |
31e598e20a79c2dc20d1b3318db4a5fe43029bd2 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/primProjEtaIssue.lean | 582981a337455f753aa49de401afbae4b5157324 | [
"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 | 272 | lean | example (f : Fin n → Prop) (h : ∀ i h, i = 0 → f ⟨i, h⟩) : f i := by
apply h
rw [show i.1 = 0 from sorry]
def foo (x : Fin n) : Nat :=
match x with
| ⟨i, _⟩ => 5 + i
example (x : Fin n) : foo x = 5 := by
simp [foo]
rw [show x.1 = 0 from sorry]
|
f9825b85988b0951297f7e4247a32d511e3f9e86 | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /src/Lean/ToExpr.lean | 0f56dc29d486779786f325eacaf9cfdc3f51acc9 | [
"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 | 2,708 | 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.Expr
universe u
namespace Lean
class ToExpr (α : Type u) where
toExpr : α → Expr
toTypeExpr : Expr
export ToExpr (toExpr toTypeExpr)
... |
0408474a87c7a69ac3b2157666b1acac64c27ac9 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/tactic/ring.lean | 8aff0fdd568ab42f7135c0705c8cbec989092b37 | [
"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 | 32,374 | 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 tactic.norm_num
/-!
# `ring`
Evaluate expressions in the language of commutative (semi)rings.
Based on <http://www.cs.ru.nl/~freek/courses/tt-2014/read/10.1.... |
23dd74162e79326c9ddff2c5794a12f34ca9eae7 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Compiler/LCNF/Simp/InlineCandidate.lean | d0c3fa33cf72cdc27b608fc9494d71be83d0bb9c | [
"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 | 4,396 | lean | /-
Copyright (c) 2022 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Compiler.LCNF.Simp.SimpM
namespace Lean.Compiler.LCNF
namespace Simp
/--
Result of `inlineCandidate?`.
It contains information for inlining lo... |
56de2dd4dfa12583c4a73c485b183a03acd6ac0f | 26ac254ecb57ffcb886ff709cf018390161a9225 | /src/algebraic_geometry/stalks.lean | 4977ee080479ce49ec91904cf77118bcd6ab4471 | [
"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 | 2,054 | 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 algebraic_geometry.presheafed_space
import topology.sheaves.stalks
/-!
# Stalks for presheaved spaces
This file lifts constructions of stalks and pushforward... |
28f8e2cf67f4d308ac2270eec1ad311f5d1f251e | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Compiler/LCNF/Basic.lean | 009ffc7ae78eeafd012181981bd7c23f6d73329c | [
"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 | 25,497 | lean | /-
Copyright (c) 2022 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Expr
import Lean.Meta.Instances
import Lean.Compiler.InlineAttrs
import Lean.Compiler.Specialize
import Lean.Compiler.LCNF.Types
namespace Lean... |
cb0a1a820127e07f0846ce8802691abc2ae2327f | 4a092885406df4e441e9bb9065d9405dacb94cd8 | /src/for_mathlib/nonarchimedean/basic.lean | 5606049736be0dcfa7bcddc1401035e96a155f20 | [
"Apache-2.0"
] | permissive | semorrison/lean-perfectoid-spaces | 78c1572cedbfae9c3e460d8aaf91de38616904d8 | bb4311dff45791170bcb1b6a983e2591bee88a19 | refs/heads/master | 1,588,841,765,494 | 1,554,805,620,000 | 1,554,805,620,000 | 180,353,546 | 0 | 1 | null | 1,554,809,880,000 | 1,554,809,880,000 | null | UTF-8 | Lean | false | false | 28,660 | lean | import order.filter.lift
import topology.algebra.ring
import ring_theory.algebra
import ring_theory.ideal_operations
import tactic.abel tactic.chain
import for_mathlib.subgroup
import for_mathlib.submodule
import for_mathlib.topological_groups
import for_mathlib.rings
import for_mathlib.pointwise
local attribute [in... |
ef6f2113b8c3c302e8ac422e3f885467cde6888e | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/category_theory/monad/algebra.lean | 203c8b0804808a41da9edddc70802258a2bc056f | [
"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,881 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Bhavik Mehta
-/
import category_theory.monad.basic
import category_theory.adjunction.basic
import category_theory.reflect_isomorphisms
/-!
# Eilenberg-Moore (co)algebr... |
5c2e84a4d28af5c7b0bf369540907067f9bc2f8b | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/category_theory/graded_object.lean | 5152ed2b6fd4256d49c24f1d011e913e74f5c7df | [
"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 | 6,136 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.shift
import category_theory.concrete_category
import category_theory.pi.basic
/-!
# The category of graded objects
For any type `β`, a `β`-g... |
8bd10a672e9cda81d1aa8c7ca4dabb0cbda2aa39 | 7b4371534ac437ca8cfb325dd5c6638ff111d31a | /boolean_rings.lean | 10d1f0cd0a4ea395978b6112f15f39e39ea24285 | [] | no_license | Shamrock-Frost/boolean_rings | 6d78294568b6b9ad7b9c67b5de5e9545227826da | 5da11beeaa37ec186c1deff946f2dbf7594fceb4 | refs/heads/master | 1,588,394,857,485 | 1,553,973,949,000 | 1,553,973,949,000 | 177,757,941 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 30,074 | lean | import .logic_util .algebra_util .heq
import .finite .partial_order_induction
import .sum_over
@[reducible]
def is_boolean (R) [ring R] : Prop := ∀ a : R, a * a = a
section
parameters {R : Type _} [ring R]
lemma boolean_ring.has_char_2 (is_bool : is_boolean R) : ring.one R + ring.one R = 0 :=
begin
suffices : (rin... |
f9f5bfe63dd17a8b67e87f718556b6a22f944225 | 7bc35d4fbdda0c01e9b22a949940ee5cbb9800d0 | /manifold/basis.lean | af3dcb21ba7661085093a5cf0b9ccac7aae950db | [] | no_license | truonghoangle/manifolds | e6c2534dd46579f56ba99a48e2eb7ce51640e7c0 | dcf4815b29ad363ec9712fd00b7756c36cfa7c1c | refs/heads/main | 1,638,501,090,139 | 1,636,918,550,000 | 1,636,918,550,000 | 185,779,631 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,952 | lean | import manifold.field basis
import linear_algebra.dual
open topological_space set vector Euclidean
noncomputable theory
universe u
variables {α : Type } {n : ℕ}
variable [normed_field α]
instance discrete: discrete_field α:= normed_field.to_discrete_field α
structure euclidean (α : Type*) :=
(carrier : Ty... |
c4235f55fabdec8f8feb8bc2ecb9a037786f397a | 9dd3f3912f7321eb58ee9aa8f21778ad6221f87c | /library/system/io.lean | 89415c83dc22ae7551d0dca54b973046058d6a94 | [
"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 | 917 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Luke Nelson, Jared Roesch and Leonardo de Moura
-/
constant {u} io : Type u → Type u
constant io.functor : functor io
constant io.monad : monad io
attribute [instance] io.fun... |
7f8d0631123e7364baa49534d7146972b01ed996 | a7602958ab456501ff85db8cf5553f7bcab201d7 | /Notes/Theorem_Proving_in_Lean/Chapter2/2.9.lean | f385d173b47bd6b482b6edeaa64c5aada747ff06 | [] | no_license | enlauren/math-logic | 081e2e737c8afb28dbb337968df95ead47321ba0 | 086b6935543d1841f1db92d0e49add1124054c37 | refs/heads/master | 1,594,506,621,950 | 1,558,634,976,000 | 1,558,634,976,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,482 | lean | -- 2.8 Implicit Arguments
-- Note: I do not indent everything inside the "namespace" one level in
-- this file, just out of preference, since the entire file basically
-- exists in the namespace.
-- Assume we have an implementation of our list below:
namespace hidden
universe u
constant list: Type u → Type u
const... |
d5ac29db1d232eacb276012d6c4eeabe4e4928aa | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/logic/nontrivial.lean | 3a8c0541e54884cf6291039d28400223ca07ec4c | [
"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 | 10,914 | lean | /-
Copyright (c) 2020 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import data.prod.basic
import data.subtype
import logic.function.basic
import logic.unique
/-!
# Nontrivial types
A type is *nontrivial* if it contains at lea... |
007ac43b9ecc8407f8305e2af08681be1ca6c924 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/control/traversable/instances.lean | ac851d89fb3fc32c066fa1adc3c59bc235b3f67f | [
"Apache-2.0"
] | permissive | lacker/mathlib | f2439c743c4f8eb413ec589430c82d0f73b2d539 | ddf7563ac69d42cfa4a1bfe41db1fed521bd795f | refs/heads/master | 1,671,948,326,773 | 1,601,479,268,000 | 1,601,479,268,000 | 298,686,743 | 0 | 0 | Apache-2.0 | 1,601,070,794,000 | 1,601,070,794,000 | null | UTF-8 | Lean | false | false | 5,605 | 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 data.list.forall2
import data.set.lattice
import control.traversable.lemmas
universes u v
section option... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.