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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
840580d45cb771fa7eb50ba1f055a5428ef6e5ad | 83c8119e3298c0bfc53fc195c41a6afb63d01513 | /library/data/stream.lean | 68d29dbf1761694591926fba78af38d174b09d91 | [
"Apache-2.0"
] | permissive | anfelor/lean | 584b91c4e87a6d95f7630c2a93fb082a87319ed0 | 31cfc2b6bf7d674f3d0f73848b842c9c9869c9f1 | refs/heads/master | 1,610,067,141,310 | 1,585,992,232,000 | 1,585,992,232,000 | 251,683,543 | 0 | 0 | Apache-2.0 | 1,585,676,570,000 | 1,585,676,569,000 | null | UTF-8 | Lean | false | false | 21,693 | 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
-/
open nat function option
universes u v w
def stream (α : Type u) := nat → α
namespace stream
variables {α : Type u} {β : Type v} {δ : Type w}
def cons (a ... |
2fb92b1357022e25ed762fc29de3496afc1da2dd | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /library/init/ordering.lean | e9ed1634808056c33865f190dc2a82f0fe4d8d72 | [
"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 | 2,041 | 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.to_string init.prod init.sum
inductive ordering
| lt | eq | gt
open ordering
attribute [instance]
definition ordering.has_to_string :... |
9ed0a480865bafdf2a8b9d3c3a38319d48d2eca5 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/order/ring/abs.lean | 05e6c1a7efc1125b062e08ef0c1be9313bdbca13 | [
"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 | 3,577 | 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, Mario Carneiro
-/
import algebra.order.ring.defs
import algebra.ring.divisibility
import algebra.order.group.abs
/-!
# Absolute values in linear orde... |
556490eda02dc03b4b3a3fff869d7daeca42799d | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/prod.lean | 5e90c5d6079131ee86fa7560a7ea20ab2dd37b07 | [] | 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 | 7,789 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.tactic.basic
import Mathlib.PostPort
universes u_1 u_2 u_3 u_4 u_5 u_6
namespace Mathlib... |
8ff83f1217e6a705d07862a4cbe3595d5150353e | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/finset/pairwise.lean | 4cdbc55112e2a68a744f6ad3290b902f3605048b | [
"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,772 | 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 data.finset.lattice
/-!
# Relations holding pairwise on finite sets
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding... |
073714b934c8cf69add754c4d963e7891495bdd5 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/topology/uniform_space/abstract_completion_auto.lean | c9818ec226e018af86cb137b632417ed6777bf56 | [] | 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 | 14,425 | lean | /-
Copyright (c) 2019 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.topology.uniform_space.uniform_embedding
import Mathlib.PostPort
universes u l u_1 u_2 u_3... |
38f0cbe29ad394e00fbd49ed77117c17e0e2b610 | 5ae26df177f810c5006841e9c73dc56e01b978d7 | /src/category_theory/limits/limits.lean | 7fcbbde57583fb586e76aefa0d4300c19b181de3 | [
"Apache-2.0"
] | permissive | ChrisHughes24/mathlib | 98322577c460bc6b1fe5c21f42ce33ad1c3e5558 | a2a867e827c2a6702beb9efc2b9282bd801d5f9a | refs/heads/master | 1,583,848,251,477 | 1,565,164,247,000 | 1,565,164,247,000 | 129,409,993 | 0 | 1 | Apache-2.0 | 1,565,164,817,000 | 1,523,628,059,000 | Lean | UTF-8 | Lean | false | false | 31,725 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Reid Barton, Mario Carneiro, Scott Morrison, Floris van Doorn
-/
import category_theory.whiskering
import category_theory.yoneda
import category_theory.limits.cones
import category_the... |
46552a8dfccdc005cd9494cd16df9bb32623434a | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/algebra/category/Group/adjunctions.lean | 5919d9b72a963b9804684f07e49893863835a73d | [
"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 | 1,801 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Johannes Hölzl
-/
import algebra.category.Group
import group_theory.free_abelian_group
/-!
The free abelian group on a type is the left adjoint of the
forgetful functo... |
c62f07921896b573d840ea064544c132f33dbda9 | fecda8e6b848337561d6467a1e30cf23176d6ad0 | /src/computability/primrec.lean | d64520ccf17c706952b890eb7f3d9a3a3107f642 | [
"Apache-2.0"
] | permissive | spolu/mathlib | bacf18c3d2a561d00ecdc9413187729dd1f705ed | 480c92cdfe1cf3c2d083abded87e82162e8814f4 | refs/heads/master | 1,671,684,094,325 | 1,600,736,045,000 | 1,600,736,045,000 | 297,564,749 | 1 | 0 | null | 1,600,758,368,000 | 1,600,758,367,000 | null | UTF-8 | Lean | false | false | 51,983 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
-/
import data.equiv.list
import logic.function.iterate
/-!
# The primitive recursive functions
The primitive recursive functions are the least collection of functions
... |
d1fa8569eb85cdd194e4ac844525455d017457f5 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/data/real/nnreal.lean | 3bdef02f30cce5c47aec902f9e6084bc94b3b3b4 | [
"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 | 25,752 | lean | /-
Copyright (c) 2018 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
Nonnegative real numbers.
-/
import algebra.linear_ordered_comm_group_with_zero
import algebra.big_operators.ring
import data.real.basic
import data.indicator_function
... |
04d23fb7acd42d370f2165b671ec73fcc9b2e849 | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/topology/algebra/group_completion.lean | eb78726e595e192f0d46e464ac02155a9450dcd9 | [
"Apache-2.0"
] | permissive | abentkamp/mathlib | d9a75d291ec09f4637b0f30cc3880ffb07549ee5 | 5360e476391508e092b5a1e5210bd0ed22dc0755 | refs/heads/master | 1,682,382,954,948 | 1,622,106,077,000 | 1,622,106,077,000 | 149,285,665 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,854 | lean | /-
Copyright (c) 2018 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Johannes Hölzl
Completion of topological groups:
-/
import topology.uniform_space.completion
import topology.algebra.uniform_group
noncomputable theory
universes u v
... |
e1d2b28af7dc4a9d789256e6ee5d669c5c88b9ac | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/data/pfun.lean | 131feabd7622eba37617afcd25b44123714791f9 | [
"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 | 24,922 | 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... |
3f6a46115da551d89192dbfaf9ecb7baa0083155 | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/dynamics/circle/rotation_number/translation_number.lean | 40bcf7c4e4205952900bfeefcbd8c615041701e3 | [
"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 | 39,615 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov
-/
import analysis.specific_limits
import order.iterate
import order.semiconj_Sup
import algebra.iterate_hom
/-!
# Translation number of a monotone real map tha... |
21be3f5fc4e7dad0824da2dee16ac0a3b6c5f7d4 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/order/jordan_holder.lean | 69d1ef44e76ac37d7da935055dd41705b01b4144 | [
"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 | 30,871 | lean | /-
Copyright (c) 2021 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import order.lattice
import data.list.sort
import logic.equiv.fin
import logic.equiv.functor
/-!
# Jordan-Hölder Theorem
This file proves the Jordan Hölder theorem for a... |
c2f9f56ad847840e69d43ef24c005aca1a6c491f | 4727251e0cd73359b15b664c3170e5d754078599 | /src/topology/metric_space/emetric_paracompact.lean | 801c60c72932cd0cda501a8c0842309658d0db0d | [
"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 | 8,366 | lean | /-
Copyright (c) 202 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov
-/
import set_theory.ordinal.basic
import topology.metric_space.emetric_space
import topology.paracompact
/-!
# (Extended) metric spaces are paracompact
In this... |
6b2bd43b7cdfab212411cefc7652f0417eb32d4f | 958488bc7f3c2044206e0358e56d7690b6ae696c | /lean/Vec.lean | e628e71e55c4342245fe19c4d5e2ca792d424ae3 | [] | no_license | possientis/Prog | a08eec1c1b121c2fd6c70a8ae89e2fbef952adb4 | d4b3debc37610a88e0dac3ac5914903604fd1d1f | refs/heads/master | 1,692,263,717,723 | 1,691,757,179,000 | 1,691,757,179,000 | 40,361,602 | 3 | 0 | null | 1,679,896,438,000 | 1,438,953,859,000 | Coq | UTF-8 | Lean | false | false | 2,477 | lean | universe u
open nat
inductive Vec (α : Type u) : ℕ → Type u
| nil {} : Vec 0
| cons {n : ℕ} (x : α) (xs : Vec n) : Vec (succ n)
inductive eq' (α : Sort u) (a : α) : α → Prop
| refl : eq' a
--#check @eq.rec_on
--#check @eq.rec
lemma L1 : ∀ (α : Type u) (a b : α) (p : α → Prop), a = b → p a → p b :=
λ α a b p E H... |
e2f6a661883158e8a9b84f45bec15bbc9b8f84c4 | 74a02dffce22907d2b61b8e226f1d9aa8384c7c0 | /Cli/Tests.lean | b253a4c879efe42875ec0a55cb142d3471384cc3 | [
"MIT"
] | permissive | mhuisi/lean4-cli-docker-test | 7e0566c7397746701162e2e22fbad38afcf1e9c4 | 6b3881eaa22596f6f430654f61fc03719ee18c62 | refs/heads/main | 1,680,104,973,886 | 1,616,975,353,000 | 1,616,975,353,000 | 352,411,347 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 15,721 | lean | import AssertCmd
import Cli.Basic
import Cli.Extensions
namespace Cli
section Utils
instance [BEq α] [BEq β] : BEq (Except α β) where
beq
| Except.ok a, Except.ok a' => a == a'
| Except.error b, Except.error b' => b == b'
| _, _ => false
instance [Repr α] [Repr β]... |
669219af571f46c6d821892c5ca04ecb9265881e | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/data/option/defs.lean | a05ca5b7ef699f64f145b1376ff165c6f8fd8a79 | [
"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,400 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
Extra definitions on option.
-/
namespace option
variables {α : Type*} {β : Type*}
instance has_mem : has_mem α (option α) := ⟨λ a b, b = some a⟩
@[simp] theorem mem... |
407f0d77975c28e9b9d854ea7761b528dabb96d6 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/data/real/ennreal.lean | 3d0809ea6634b2c41b71d134ae6f060ddc805529 | [
"Apache-2.0"
] | permissive | ramonfmir/mathlib | c5dc8b33155473fab97c38bd3aa6723dc289beaa | 14c52e990c17f5a00c0cc9e09847af16fabbed25 | refs/heads/master | 1,661,979,343,526 | 1,660,830,384,000 | 1,660,830,384,000 | 182,072,989 | 0 | 0 | null | 1,555,585,876,000 | 1,555,585,876,000 | null | UTF-8 | Lean | false | false | 80,512 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Yury Kudryashov
-/
import data.real.nnreal
/-!
# Extended non-negative reals
We define `ennreal = ℝ≥0∞ := with_top ℝ≥0` to be the type of extended nonnegative real nu... |
66de5757b74e01dae6fd8886a355f7442450510a | 618003631150032a5676f229d13a079ac875ff77 | /src/linear_algebra/finite_dimensional.lean | 702b4c53dc5c66433b038860f4c0f691aaa1e0e1 | [
"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 | 16,908 | lean | /-
Copyright (c) 2019 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import linear_algebra.dimension
import ring_theory.principal_ideal_domain
/-!
# Finite dimensional vector spaces
Definition and basic properties of finite dimensional v... |
c5133c6054993b281cf5b6cb4d1a0bdaaadedd9a | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/gcd.lean | 365b97b8b659743af3caf42fb93a7ab952be8fb3 | [
"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 | 212 | lean | open Nat
#eval gcd 8 12
#reduce gcd 8 12
#eval gcd 0 9
#reduce gcd 0 9
#eval gcd 4 0
#reduce gcd 4 0
#eval gcd 1 10
#reduce gcd 1 10
#eval gcd (2*3*7*11*17) (2*7*23)
#eval gcd (2*7*23) (2*3*7*11*17)
|
9c5926656f4194632294f2737f21bc23ce1fa70f | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/app_builder_issue1.lean | c220cae27cc768fa22091b147d53a4074aa0c016 | [
"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 | 127 | lean | constant f {A : Type} (a : A) {B : Type} (b : B) : nat
example (a b c d : nat) : a = c → b = d → f a b = f c d :=
by simp
|
17bdfe9c053aea94b4041054b8fcc97720430daf | 618003631150032a5676f229d13a079ac875ff77 | /src/category_theory/limits/shapes/default.lean | 1b0f473ba9398903b00777439148d72124416b73 | [
"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 | 148 | lean | import category_theory.limits.shapes.binary_products
import category_theory.limits.shapes.equalizers
import category_theory.limits.shapes.pullbacks
|
8df06b71cac329b54849e356a063eb0d5f983e61 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/measure_theory/integral/bochner.lean | 6c728afa447d55722d36f67c9caf31e7b5d8342c | [
"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 | 70,942 | lean | /-
Copyright (c) 2019 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou, Yury Kudryashov, Sébastien Gouëzel, Rémy Degenne
-/
import measure_theory.integral.set_to_l1
import analysis.normed_space.bounded_linear_maps
import topology.sequences
/... |
068894213524dacc59fc487ac96de14926b0fe78 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/dfinsupp/basic.lean | f5327b314b0bb0cd01fde7eec081a0affa5aaaff | [
"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 | 84,020 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Kenny Lau
-/
import algebra.module.linear_map
import algebra.big_operators.basic
import data.set.finite
import group_theory.submonoid.membership
import group_theory.group_ac... |
b76fe8b593785f754cd5bdb4e8d91b43e0a587b1 | 36c7a18fd72e5b57229bd8ba36493daf536a19ce | /hott/init/num.hlean | ed635b009dee322bad6e2a225b837953bfb5f0f4 | [
"Apache-2.0"
] | permissive | YHVHvx/lean | 732bf0fb7a298cd7fe0f15d82f8e248c11db49e9 | 038369533e0136dd395dc252084d3c1853accbf2 | refs/heads/master | 1,610,701,080,210 | 1,449,128,595,000 | 1,449,128,595,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,620 | hlean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.logic init.bool
open bool
definition pos_num.is_inhabited [instance] : inhabited pos_num :=
inhabited.mk pos_num.one
namespace pos_nu... |
71f244b3d0ac772623446b143f420e3b5f7d13af | 947b78d97130d56365ae2ec264df196ce769371a | /src/Lean/Util/Trace.lean | 57d85ef5c914394c2a9b74978bf42abfbdc6d1a0 | [
"Apache-2.0"
] | permissive | shyamalschandra/lean4 | 27044812be8698f0c79147615b1d5090b9f4b037 | 6e7a883b21eaf62831e8111b251dc9b18f40e604 | refs/heads/master | 1,671,417,126,371 | 1,601,859,995,000 | 1,601,860,020,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,421 | lean | /-
Copyright (c) 2018 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich, Leonardo de Moura
-/
import Lean.Message
import Lean.MonadEnv
universe u
namespace Lean
open Std (PersistentArray)
structure TraceElem :=
(ref : Syntax)
(m... |
81ba4f6ec7a5aaa3a0f477607fae798debeff0c4 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebraic_geometry/prime_spectrum/is_open_comap_C.lean | b578d12dbb96603c5c6011d08364d8357e814a56 | [
"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 | 3,060 | lean | /-
Copyright (c) 2021 Damiano Testa. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Damiano Testa
-/
import algebraic_geometry.prime_spectrum.basic
import ring_theory.polynomial.basic
/-!
The morphism `Spec R[x] --> Spec R` induced by the natural inclusion `R --> R[x]`... |
43aaa31ed8e2c86060f1d52be00b6e8b443c00a8 | 08bd4ba4ca87dba1f09d2c96a26f5d65da81f4b4 | /src/Lean/Elab/BuiltinCommand.lean | 9a39fe8feef8cf03a6077ad3e5d7d6e8a784591f | [
"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 | 19,722 | 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.Util.CollectLevelParams
import Lean.Meta.Reduce
import Lean.Elab.DeclarationRange
import Lean.Elab.Eval
import Lean.Elab.Command
import Lean.Ela... |
7bb8f8549fc53549ce3b9587ea3599c0e421a4a4 | 88fb7558b0636ec6b181f2a548ac11ad3919f8a5 | /tests/lean/local_ref_bugs.lean | 73e2241650ce3dd7ba8986c87300d8d228a171c1 | [
"Apache-2.0"
] | permissive | moritayasuaki/lean | 9f666c323cb6fa1f31ac597d777914aed41e3b7a | ae96ebf6ee953088c235ff7ae0e8c95066ba8001 | refs/heads/master | 1,611,135,440,814 | 1,493,852,869,000 | 1,493,852,869,000 | 90,269,903 | 0 | 0 | null | 1,493,906,291,000 | 1,493,906,291,000 | null | UTF-8 | Lean | false | false | 708 | lean | set_option pp.all true
section
parameter α : Type
inductive foo : Type | a : α → foo | b
#check (foo.b : foo)
open foo
#check (foo.b : foo)
#check (b : foo)
open tactic
include α
example : true :=
by do
e ← to_expr `(b),
t ← infer_type e,
trace "-------",
trace e,
trace t,
trace "-------",
triv
def ex ... |
8b7dfbe76c3c0ae2ec2aa04eda862ecf3bfa77a5 | b561a44b48979a98df50ade0789a21c79ee31288 | /stage0/src/Lean/Elab/SyntheticMVars.lean | 6c37c15bd5ce63ba3eb98e88b0e5096964dc0416 | [
"Apache-2.0"
] | permissive | 3401ijk/lean4 | 97659c475ebd33a034fed515cb83a85f75ccfb06 | a5b1b8de4f4b038ff752b9e607b721f15a9a4351 | refs/heads/master | 1,693,933,007,651 | 1,636,424,845,000 | 1,636,424,845,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 17,988 | 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, Sebastian Ullrich
-/
import Lean.Util.ForEachExpr
import Lean.Elab.Term
import Lean.Elab.Tactic.Basic
namespace Lean.Elab.Term
open Tactic (TacticM evalTacti... |
d97012ae81d3e4763740fb83039c8b6348e3d866 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/order/category/LinearOrder.lean | 9e77eaac4f59ac088182c79f2f93244d2c419722 | [
"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 | 867 | 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 order.category.PartialOrder
/-! # Category of linearly ordered types -/
open category_theory
/-- The category of linearly ordered types. -/
def LinearOrder... |
5b3d6c21357a094802ea9f0c43f27e1ef5fd61c4 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/topology/category/CompHaus/projective.lean | 6ff261e92f42c095bc93072d461e7721cedb7799 | [
"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,085 | 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 topology.category.CompHaus
import topology.stone_cech
import category_theory.preadditive.projective
/-!
# CompHaus has enough projectives
In this file we sh... |
9bdd156e819ef414c152640d189b3fd8295f9067 | 969dbdfed67fda40a6f5a2b4f8c4a3c7dc01e0fb | /src/category_theory/monad/limits.lean | 0a3cc1396f151344332c005c6348d04922ec1f7f | [
"Apache-2.0"
] | permissive | SAAluthwela/mathlib | 62044349d72dd63983a8500214736aa7779634d3 | 83a4b8b990907291421de54a78988c024dc8a552 | refs/heads/master | 1,679,433,873,417 | 1,615,998,031,000 | 1,615,998,031,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 13,973 | 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.adjunction
import category_theory.adjunction.limits
import category_theory.limits.preserves.shapes.terminal
namespace cate... |
f898cf9187ed040426f386214e00f2662c71f0ed | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/topology/continuous_function/basic.lean | 7aac9108a69421e39c515e0e87ac6a163ca696b6 | [
"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 | 8,218 | lean | /-
Copyright © 2020 Nicolò Cavalleri. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nicolò Cavalleri
-/
import topology.subset_properties
import topology.tactic
import topology.algebra.ordered.proj_Icc
/-!
# Continuous bundled map
In this file we define the type `c... |
f116070e8e61afada53abdbdd36574835619ac41 | b147e1312077cdcfea8e6756207b3fa538982e12 | /data/equiv/encodable.lean | abd1f7ae4c2d39002af178f2bb6759981779de95 | [
"Apache-2.0"
] | permissive | SzJS/mathlib | 07836ee708ca27cd18347e1e11ce7dd5afb3e926 | 23a5591fca0d43ee5d49d89f6f0ee07a24a6ca29 | refs/heads/master | 1,584,980,332,064 | 1,532,063,841,000 | 1,532,063,841,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,174 | 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, Mario Carneiro
Type class for encodable Types.
Note that every encodable Type is countable.
-/
import data.equiv.nat
open option list nat function
/-- An enc... |
9893b57816c422a3ac5b8338fb0b609cce359ae8 | 6214e13b31733dc9aeb4833db6a6466005763162 | /src/definitions1.lean | e1079d0874157b773c4199eaedc1f5aaa6e4e3fd | [] | no_license | joshua0pang/esverify-theory | 272a250445f3aeea49a7e72d1ab58c2da6618bbe | 8565b123c87b0113f83553d7732cd6696c9b5807 | refs/heads/master | 1,585,873,849,081 | 1,527,304,393,000 | 1,527,304,393,000 | 154,901,199 | 1 | 0 | null | 1,540,593,067,000 | 1,540,593,067,000 | null | UTF-8 | Lean | false | false | 21,505 | lean | -- first part of definitions
import .syntax .sizeof .eqdec
-- #######################################
-- ### MINOR DEFINITIONS AND NOTATIONS ###
-- #######################################
-- P → Q
@[reducible]
def spec.implies(P Q: spec): spec := spec.or (spec.not P) Q
@[reducible]
def prop.implies(P Q: prop): ... |
ae63652c0b705b10630375a180ef0ebeaf3194ca | c777c32c8e484e195053731103c5e52af26a25d1 | /src/number_theory/multiplicity.lean | 5823e572d478f27228c32e4c615da47d6b8f3315 | [
"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 | 17,519 | lean | /-
Copyright (c) 2022 Tian Chen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Tian Chen, Mantas Bakšys
-/
import algebra.geom_sum
import data.int.parity
import data.zmod.basic
import number_theory.padics.padic_val
import ring_theory.ideal.quotient_operations
/-!
# M... |
903a531afce625a8e895abbe9b455df35ee60f6b | 076f5040b63237c6dd928c6401329ed5adcb0e44 | /instructor-notes/2019.09.26.lean | d6e5e59b66e78c30f649695c86afd9048086fc59 | [] | no_license | kevinsullivan/uva-cs-dm-f19 | 0f123689cf6cb078f263950b18382a7086bf30be | 09a950752884bd7ade4be33e9e89a2c4b1927167 | refs/heads/master | 1,594,771,841,541 | 1,575,853,850,000 | 1,575,853,850,000 | 205,433,890 | 4 | 9 | null | 1,571,592,121,000 | 1,567,188,539,000 | Lean | UTF-8 | Lean | false | false | 4,496 | lean | namespace my_list
/-
inductive mlist (T : Type) : Type
| nil : mlist
| cons (hd : T) (tl : mlist) : mlist
open mlist
#check mlist
#check nil -- for any type T, mlist T
#check nil bool
#check nil nat
#check nil string
#check cons
-/
inductive mlist (T : Type) : Type
| nil {} : mlist
| cons (hd : T) (tl : mlist)... |
d6d838d8af58baa8d0fb7474176360bb1dd1dcb8 | 8e31b9e0d8cec76b5aa1e60a240bbd557d01047c | /scratch/transfer_test.lean | 773f414062e80c7738d28d9bdfb39a6ddd5331bb | [] | 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 | 1,891 | lean | import .transfer_mathlib
inductive xnat : Type
| zero : xnat
| succ : xnat → xnat
instance : has_zero xnat := ⟨xnat.zero⟩
instance : has_one xnat := ⟨xnat.succ 0⟩
def to_xnat : ℕ → xnat
| 0 := 0
| (nat.succ n) := (to_xnat n).succ
def of_xnat : xnat → ℕ
| 0 := 0
| (xnat.succ n) := (of_xnat n).succ
theorem to_of_xna... |
883b8931beb736f97eb6aca6a01214beb71b8d49 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/number_theory/cyclotomic/basic.lean | 272d708e4da324cf770d066f1981bf341e18f000 | [
"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 | 27,260 | lean | /-
Copyright (c) 2021 Riccardo Brasca. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Riccardo Brasca
-/
import ring_theory.polynomial.cyclotomic.basic
import number_theory.number_field
import algebra.char_p.algebra
import field_theory.galois
/-!
# Cyclotomic extensi... |
91fe4fa1143ceab7808b59f479613c9d188c84c3 | 00c000939652bc85fffcfe8ba5dd194580a13c4b | /src/mvpfunctor/W.lean | 2ae4cf587242ba9087720a7fabe22472e97dfa4f | [
"Apache-2.0"
] | permissive | johoelzl/qpf | a795220c4e872014a62126800313b74ba3b06680 | d93ab1fb41d085e49ae476fa364535f40388f44d | refs/heads/master | 1,587,372,400,745 | 1,548,633,467,000 | 1,548,633,467,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,342 | lean | /-
Copyright (c) 2018 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad
The W construction as a multivariate polynomial functor.
-/
import .basic
universe u
namespace mvpfunctor
open typevec
variables {n : ℕ} (P : mvpfunctor.{u} (n+1))
def... |
bd19ff38dfa0cc8e9b8fcdd117535bb5862b5ac8 | 9dd3f3912f7321eb58ee9aa8f21778ad6221f87c | /library/init/meta/smt/smt_tactic.lean | 4e693bf44d1af496f4f8fc01d561fa8bcb05c99a | [
"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 | 15,199 | 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.simp_tactic
import init.meta.smt.congruence_closure
import init.meta.smt.ematch
universe u
run_command mk_simp_attr `pre_smt
run_... |
4c06732214dda4ee114b9e83a3a10805e512a0ff | 9dd3f3912f7321eb58ee9aa8f21778ad6221f87c | /tests/lean/run/converter.lean | 75cb8651cce5679e30f4ac6245290c943cb6bd8a | [
"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 | 1,684 | lean | open tactic conv
open tactic
run_command mk_simp_attr `foo
run_command mk_simp_attr `bla
constant f : nat → nat → nat
@[foo] lemma f_lemma : ∀ x, f x x = 0 :=
sorry
constant g : nat → nat
@[bla] lemma g_lemma : ∀ x, g x = x :=
sorry
example (a b c : nat) : (λ x, g (f (a + 0) (sizeof x))) a = 0 :=
by conversion $
... |
10c18a85853a2cf1cf220058a323b6681974f580 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/tactic/lint/type_classes.lean | db71eccca7d85162d91c7a4c0a28a3d7a635a6ec | [
"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 | 24,729 | lean | /-
Copyright (c) 2020 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Robert Y. Lewis, Gabriel Ebner
-/
import data.bool.basic
import meta.rb_map
import tactic.lint.basic
/-!
# Linters about type classes
This file defines several li... |
be4a82deba3e2da0ec43f46cf63c95321fb6b061 | e4a7c8ab8b68ca0e53d2c21397320ea590fa01c6 | /src/data/default.lean | 1b32e0b72e11138c6eecefad5c1079db6160c70d | [] | no_license | lean-forward/field | 3ff5dc5f43de40f35481b375f8c871cd0a07c766 | 7e2127ad485aec25e58a1b9c82a6bb74a599467a | refs/heads/master | 1,590,947,010,909 | 1,563,811,881,000 | 1,563,811,881,000 | 190,415,651 | 1 | 0 | null | 1,563,643,371,000 | 1,559,746,688,000 | Lean | UTF-8 | Lean | false | false | 13 | lean | import .polya |
120e27ecf9996f6a496aebab72db0913906cd9e5 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/linear_algebra/tensor_algebra.lean | f3cd4283895af7b27ab844f0e4daabec77de07bc | [
"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 | 4,459 | lean | /-
Copyright (c) 2020 Adam Topaz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Adam Topaz.
-/
import algebra.free_algebra
import algebra.ring_quot
/-!
# Tensor Algebras
Given a commutative semiring `R`, and an `R`-module `M`, we construct the tensor algebra of `M`.
... |
301098e7fbac1089240fadfeb5178429b7b47f1e | 5d166a16ae129621cb54ca9dde86c275d7d2b483 | /tests/lean/run/have6.lean | 277f5f43bdd48a1a93bfbe251563516e6758007c | [
"Apache-2.0"
] | permissive | jcarlson23/lean | b00098763291397e0ac76b37a2dd96bc013bd247 | 8de88701247f54d325edd46c0eed57aeacb64baf | refs/heads/master | 1,611,571,813,719 | 1,497,020,963,000 | 1,497,021,515,000 | 93,882,536 | 1 | 0 | null | 1,497,029,896,000 | 1,497,029,896,000 | null | UTF-8 | Lean | false | false | 620 | lean | prelude
definition Prop : Type.{1} := Type.{0}
constant and : Prop → Prop → Prop
infixl `∧`:25 := and
constant and_intro : forall (a b : Prop), a → b → a ∧ b
constants a b c d : Prop
axiom Ha : a
axiom Hb : b
axiom Hc : c
#check
have a ∧ b, from and_intro a b Ha Hb,
have b ∧ a, from and_intro b a Hb Ha,
have H : ... |
3ed6ef4d8b200715049ed4ba1f5c38a023d1752c | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/pi/basic.lean | 60d19eec88d40c59d3e0a7a195accbf657683fee | [] | 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 | 5,178 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon, Scott Morrison
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.category_theory.natural_isomorphism
import Mathlib.category_theory.eq_to_hom
i... |
bdc33c3d296c397b70938c6f991dcd91fbbb2c86 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/tactic/tfae.lean | 799881160bb48b8ef19425dadb0601c4f62b4949 | [
"Apache-2.0"
] | permissive | gebner/mathlib | eab0150cc4f79ec45d2016a8c21750244a2e7ff0 | cc6a6edc397c55118df62831e23bfbd6e6c6b4ab | refs/heads/master | 1,625,574,853,976 | 1,586,712,827,000 | 1,586,712,827,000 | 99,101,412 | 1 | 0 | Apache-2.0 | 1,586,716,389,000 | 1,501,667,958,000 | Lean | UTF-8 | Lean | false | false | 5,001 | lean | /-
Copyright (c) 2018 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Reid Barton, Simon Hudon
"The Following Are Equivalent" (tfae) :
Tactic for proving the equivalence of a set of proposition
using various implications between them.
-/... |
b8062c55a39248fa298318d9c1d3ec079c3bd0f6 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tests/lean/defInst.lean | 2292134a261905e403e7c895a8e4aab3bd8ef923 | [
"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 | 632 | lean | def Foo := List Nat
def test (x : Nat) : Foo :=
[x, x+1, x+2]
#eval test 4 -- Error
#check fun (x y : Foo) => x == y -- Error
deriving instance BEq, Repr for Foo
#eval test 4
#check fun (x y : Foo) => x == y
def Boo := List (String × String)
deriving BEq, Repr, DecidableEq
def mkBoo (s : String) : Boo :=
... |
71066c6f20459ae093258759c8d1d5f546be6c29 | 9c1ad797ec8a5eddb37d34806c543602d9a6bf70 | /isomorphism.lean | 0cd80a1715559da1b9473ead7bc5941c9495e0b0 | [] | no_license | timjb/lean-category-theory | 816eefc3a0582c22c05f4ee1c57ed04e57c0982f | 12916cce261d08bb8740bc85e0175b75fb2a60f4 | refs/heads/master | 1,611,078,926,765 | 1,492,080,000,000 | 1,492,080,000,000 | 88,348,246 | 0 | 0 | null | 1,492,262,499,000 | 1,492,262,498,000 | null | UTF-8 | Lean | false | false | 2,281 | lean | -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Stephen Morgan, Scott Morrison
import .category
open tqft.categories
namespace tqft.categories.isomorphism
structure Isomorphism ( C: Category ) ( X Y : C.Obj ) :=
(morphis... |
543bcb3f17ca0c2a8e5cefb5ae2936e635f90472 | 491068d2ad28831e7dade8d6dff871c3e49d9431 | /tests/lean/run/eq17.lean | c704120dcc5b6eb1888aa7cb0f1aa3f86d87ddbc | [
"Apache-2.0"
] | permissive | davidmueller13/lean | 65a3ed141b4088cd0a268e4de80eb6778b21a0e9 | c626e2e3c6f3771e07c32e82ee5b9e030de5b050 | refs/heads/master | 1,611,278,313,401 | 1,444,021,177,000 | 1,444,021,177,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 206 | lean | open nat
definition lt_of_succ : ∀ {a b : nat}, succ a < b → a < b
| lt_of_succ (lt.base (succ a)) := lt.trans (lt.base a) (lt.base (succ a))
| lt_of_succ (lt.step h) := lt.step (lt_of_succ h)
|
190f400bc87ec94e5ddca49f77394a80cf1e8c00 | 206422fb9edabf63def0ed2aa3f489150fb09ccb | /src/ring_theory/nullstellensatz.lean | b6fc1cf5b2a15a25e97ebbe74f90ddd49b260cd2 | [
"Apache-2.0"
] | permissive | hamdysalah1/mathlib | b915f86b2503feeae268de369f1b16932321f097 | 95454452f6b3569bf967d35aab8d852b1ddf8017 | refs/heads/master | 1,677,154,116,545 | 1,611,797,994,000 | 1,611,797,994,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,151 | lean | /-
Copyright (c) 2021 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import ring_theory.jacobson
import field_theory.algebraic_closure
import field_theory.mv_polynomial
import algebraic_geometry.prime_spectrum
/-!
# Nullstellensatz
This file ... |
a03b48504b04dd26dbdfdcb3d7c05b5566b485ec | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/ring_theory/noetherian.lean | 9066a23fb6f530d2e113a067e6e7db22ece83c6a | [
"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 | 39,179 | lean | /-
Copyright (c) 2018 Mario Carneiro, Kevin Buzzard. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Kevin Buzzard
-/
import group_theory.finiteness
import data.multiset.finset_ops
import algebra.algebra.tower
import order.order_iso_nat
import ring_theor... |
b2735d2c1b0c774e097564cc8dd79839993b1102 | 8cb37a089cdb4af3af9d8bf1002b417e407a8e9e | /library/init/meta/interactive.lean | c28ddd6bc246ec291fb7cfb395ba5fdd79958cd6 | [
"Apache-2.0"
] | permissive | kbuzzard/lean | ae3c3db4bb462d750dbf7419b28bafb3ec983ef7 | ed1788fd674bb8991acffc8fca585ec746711928 | refs/heads/master | 1,620,983,366,617 | 1,618,937,600,000 | 1,618,937,600,000 | 359,886,396 | 1 | 0 | Apache-2.0 | 1,618,936,987,000 | 1,618,936,987,000 | null | UTF-8 | Lean | false | false | 73,567 | 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, Jannis Limperg
-/
prelude
import init.meta.tactic init.meta.type_context init.meta.rewrite_tactic init.meta.simp_tactic
import init.meta.smt.congruence_closur... |
26c94e67ca4a71bd92e6805e6b625e8f1ae75b19 | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/tactic/split_ifs.lean | c2a7a6bd140fe1acf533303b0768c3e452412540 | [
"Apache-2.0"
] | permissive | rmitta/mathlib | 8d90aee30b4db2b013e01f62c33f297d7e64a43d | 883d974b608845bad30ae19e27e33c285200bf84 | refs/heads/master | 1,585,776,832,544 | 1,576,874,096,000 | 1,576,874,096,000 | 153,663,165 | 0 | 2 | Apache-2.0 | 1,544,806,490,000 | 1,539,884,365,000 | Lean | UTF-8 | Lean | false | false | 3,114 | lean | /-
Copyright (c) 2018 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner.
Tactic to split if-then-else-expressions.
-/
open expr tactic
namespace tactic
open interactive
meta def find_if_cond : expr → option expr | e :=
e.fold none $ λ e _ a... |
747509028b968a4881f75513b4b3d165319e6268 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/run/dep_coe_to_fn2.lean | 8de9de391b4f9945f61e433b8aadf8845d1ad8b3 | [
"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 | 266 | lean | universe variables u v
structure Func :=
(A : Type u) (B : A → Type v) (fn : Π a, B a → B a)
instance F_to_fn : has_coe_to_fun Func :=
{ F := λ f, Π a, f^.B a → f^.B a,
coe := λ f, f^.fn }
variables (f : Func) (a : f^.A) (b : f^.B a)
#check (f a b)
|
1adea0ff02e8c643898adf93e7b253940d40e76b | 367134ba5a65885e863bdc4507601606690974c1 | /src/data/real/cardinality.lean | 3a47fb7f7c9a9f60ef777ba6f3f273672b273ae9 | [
"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 | 9,433 | lean | /-
Copyright (c) 2019 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
-/
import set_theory.cardinal_ordinal
import analysis.specific_limits
import data.rat.denumerable
import data.set.intervals.image_preimage
/-!
# The cardinality of ... |
af5c3eaf30faf84e63905a83f665905c1d18c9fb | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/blast_cc_subsingleton2.lean | fb4f9bb02356a1db8f5363cd119ee22a690237af | [
"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 | 312 | lean | import data.unit
open nat unit
set_option blast.strategy "cc"
constant r {A B : Type} : A → B → A
definition ex1 (a b c d : unit) : r a b = r c d :=
by blast
-- The congruence closure module does not automatically merge subsingleton equivalence classes.
--
-- example (a b : unit) : a = b :=
-- by blast
|
114f9c3524b74d43c90bde470f2d0e7e7a093c9f | 37da0369b6c03e380e057bf680d81e6c9fdf9219 | /hott/homotopy/hopf.hlean | f3ef47af8fc963a0cb57355fdce9da983d8d78fb | [
"Apache-2.0"
] | permissive | kodyvajjha/lean2 | 72b120d95c3a1d77f54433fa90c9810e14a931a4 | 227fcad22ab2bc27bb7471be7911075d101ba3f9 | refs/heads/master | 1,627,157,512,295 | 1,501,855,676,000 | 1,504,809,427,000 | 109,317,326 | 0 | 0 | null | 1,509,839,253,000 | 1,509,655,713,000 | C++ | UTF-8 | Lean | false | false | 8,074 | hlean | /-
Copyright (c) 2016 Ulrik Buchholtz and Egbert Rijke. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Ulrik Buchholtz, Egbert Rijke
H-spaces and the Hopf construction
-/
import types.equiv .wedge .join
open eq eq.ops equiv is_equiv is_conn is_trunc trunc susp join ... |
499d614455c1a82c861cf0453111c1c61c797a67 | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /src/Lean/Elab.lean | 7b518d0b23e81ea9031164b2f9a8839ae8978d40 | [
"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,163 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Elab.Import
import Lean.Elab.Exception
import Lean.Elab.Command
import Lean.Elab.Term
import Lean.Elab.App
import Lean.Elab.Binders
import Lean.... |
7d40e79c87ee1cc5a0fc138437c8a28e3b7ad9fb | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/order/algebra.lean | c78a8c6f615bd3950a17fbaef261bf16d79b8dcd | [
"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 | 1,394 | 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.algebra.basic
import algebra.order.smul
/-!
# Ordered algebras
An ordered algebra is an ordered semiring, which is an algebra over an ordered commut... |
9eebdf7d792adfcd3132ab57dbbe5f10592400b7 | f1dc39e1c68f71465c8bf79910c4664d03824751 | /library/system/io.lean | 6a907d654dd314164b74f3b038c41dfddfe46e1c | [
"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 | 9,110 | 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 and Leonardo de Moura
-/
import system.io_interface
/- The following constants have a builtin implementation -/
constant io_core : Type → Type → Type
... |
794706d605e856874cee7ca4ee24723b7f51e5e6 | 690889011852559ee5ac4dfea77092de8c832e7e | /src/data/finsupp.lean | 55d253f6ed0c3f16ae7aa2429c3827521c531849 | [
"Apache-2.0"
] | permissive | williamdemeo/mathlib | f6df180148f8acc91de9ba5e558976ab40a872c7 | 1fa03c29f9f273203bbffb79d10d31f696b3d317 | refs/heads/master | 1,584,785,260,929 | 1,572,195,914,000 | 1,572,195,913,000 | 138,435,193 | 0 | 0 | Apache-2.0 | 1,529,789,739,000 | 1,529,789,739,000 | null | UTF-8 | Lean | false | false | 61,672 | 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 of functions with finite support.
Functions with finite support provide the basis for the following concrete instances:
* ℕ →₀ α: Polynomials (where α is a ring... |
c5f5cabe1677b5924423d0536da846cf68fcfe1b | e898bfefd5cb60a60220830c5eba68cab8d02c79 | /uexp/src/uexp/TDP_test.lean | 651127f12fd3d22fb760a39be15a1349a380854d | [
"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 | 1,703 | lean | import .TDP
import .cosette_tactics
open list io
example {p q r s} {f : Tuple p → Tuple q → Tuple r → Tuple s → usr}
: (∑ (a : Tuple p) (b : Tuple q) (c : Tuple r) (d : Tuple s), f a b c d)
= (∑ (c : Tuple r) (a : Tuple p) (d : Tuple s) (b : Tuple q), f a b c d) :=
begin
TDP' tactic.ac_refl,
end
example {p} {R... |
ff7d2e8173ff453b5135364a266c16a6d0b74f87 | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /src/analysis/normed_space/real_inner_product.lean | 1f280f36dbde4f330341709aa9270fde90d6b3ac | [
"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 | 40,929 | lean | /-
Copyright (c) 2019 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou, Sébastien Gouëzel
-/
import algebra.quadratic_discriminant
import linear_algebra.bilinear_form
import tactic.apply_fun
import tactic.monotonicity
import topology.metric_s... |
ae615fee78f20dd3989f90ef4b02b8f8e2d80bbb | 94637389e03c919023691dcd05bd4411b1034aa5 | /src/zzz_junk/04_type_library/06_sum.lean | 3baeabd18497f08c06d12b6b1f02f3552fcbfa65 | [] | 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 | 590 | lean | namespace hidden
/-
The "sum" type is used to hold either
a value of a type, α, or a value of
another type, β. A value of the sum
type is often used to represent either
a correct value or an error value (e.g.,
an error string or error code. Note: in
Haskell this type is called Either.
-/
inductive sum (α β : Type) ... |
e534a4c5584a6b5a5a8c10c0821598df504454a1 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/measure_theory/constructions/prod/integral.lean | e92c1173627f986c379ce17559f80ce211a19e8a | [
"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 | 23,509 | lean | /-
Copyright (c) 2020 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
-/
import measure_theory.constructions.prod.basic
import measure_theory.integral.set_integral
/-!
# Integration with respect to the product measure
> THIS FILE IS ... |
6ad17e9fe2871c8928454d86d8f1d53c801944d1 | 86ee6b815fda4c9a5aa42e17b61336a913552e60 | /src/groupoids/paths.lean | bf6dec9c92486b906a446ee006e2826ae98fba71 | [
"Apache-2.0"
] | permissive | fgdorais/lean-groupoids | 6487f6d84427a757708fd4e795038ab159cc4f2c | 54d1582f8d6ae642fc818e7672ac1c49fe7733e5 | refs/heads/master | 1,587,778,056,386 | 1,551,055,383,000 | 1,551,055,383,000 | 172,408,995 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,020 | lean | /-
Copyright © 2019 François G. Dorais. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
-/
import .basic
structure {u v} path {α : Type u} {γ : α → α → Type v} (Γ : groupoid γ) : Type (max u v) := (cod dom : α) (map : γ cod dom)
attribute [pp_using_anonymous_constructor] path
... |
f12248a234e9134e90d58b6b2d85ec5dfb63695e | df561f413cfe0a88b1056655515399c546ff32a5 | /5-advanced-proposition-world/l10.lean | ff2bd14d351895699a9946b318c2aeeb3f6d2820 | [] | no_license | nicholaspun/natural-number-game-solutions | 31d5158415c6f582694680044c5c6469032c2a06 | 1e2aed86d2e76a3f4a275c6d99e795ad30cf6df0 | refs/heads/main | 1,675,123,625,012 | 1,607,633,548,000 | 1,607,633,548,000 | 318,933,860 | 3 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 152 | lean | lemma contrapositive2 (P Q : Prop) : (¬ Q → ¬ P) → (P → Q) :=
begin
by_cases p : P; by_cases q : Q,
intros h p2,
exact q,
repeat { tauto! },
end |
f807527f1fe7251e9c6abc7fc5a1022c106b812e | 618003631150032a5676f229d13a079ac875ff77 | /src/data/rat/basic.lean | d74d3a154bd9edaf94f329f934d244d6790d5538 | [
"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 | 24,729 | lean | /-
Copyright (c) 2019 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro
-/
import data.int.sqrt
import data.equiv.encodable
import algebra.group
import algebra.euclidean_domain
import algebra.ordered_field
/-!
# Basics for t... |
cb638a02100bd5b8780e79d1b8ede52f536ffb40 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/qualifiedNamesRec.lean | 066a5c6706bdf57cde7e70842cbf8eeab67daeec | [
"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,111 | lean | mutual
inductive Foo
| somefoo : Foo
| bar : Bar → Foo
inductive Bar
| somebar : Bar
| foobar : Foo → Bar → Bar
end
mutual
private def Foo.toString : Foo → String
| Foo.somefoo => "foo"
| Foo.bar b => Bar.toString b
def _root_.Bar.toString : Bar → String
| Bar.somebar => "bar"
| Bar.foobar f ... |
3cd77d41111946948025239eeb58c6b459311ca0 | ad0c7d243dc1bd563419e2767ed42fb323d7beea | /algebra/group.lean | 9ab01b43089c731b23f42dc7ed66b1a3bcf21138 | [
"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 | 25,839 | 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
section pending_1857
/- Transport multiplicative to additive... |
5e2126e5c506c355ebc6edfce703def4edec449b | 437dc96105f48409c3981d46fb48e57c9ac3a3e4 | /src/data/nat/modeq.lean | 724e3390c0f321776eab9a151dce9cef80687032 | [
"Apache-2.0"
] | permissive | dan-c-k/mathlib | 08efec79bd7481ee6da9cc44c24a653bff4fbe0d | 96efc220f6225bc7a5ed8349900391a33a38cc56 | refs/heads/master | 1,658,082,847,093 | 1,589,013,201,000 | 1,589,013,201,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 12,785 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.int.gcd
import tactic.abel
import data.list.rotate
/-
# Congruences modulo a natural number
This file defines the equivalence relation `a ≡ b [MOD n]` on... |
617251f974e3e0dde9211a082624f1b053029b82 | 86f6f4f8d827a196a32bfc646234b73328aeb306 | /examples/logic/unnamed_939.lean | 816fb905b2e90466e5b366c8150cfa934588d503 | [] | no_license | jamescheuk91/mathematics_in_lean | 09f1f87d2b0dce53464ff0cbe592c568ff59cf5e | 4452499264e2975bca2f42565c0925506ba5dda3 | refs/heads/master | 1,679,716,410,967 | 1,613,957,947,000 | 1,613,957,947,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 124 | lean | import tactic
variables {a b c : ℕ}
-- BEGIN
example (divab : a ∣ b) (divac : a ∣ c) : a ∣ (b + c) :=
sorry
-- END |
8a9d8afdbf5691043e1b70a9b716fae1525c4963 | 22e97a5d648fc451e25a06c668dc03ac7ed7bc25 | /src/algebra/category/Mon/basic.lean | a92f6f1a79da56b3077a4fa55c2de1976a238941 | [
"Apache-2.0"
] | permissive | keeferrowan/mathlib | f2818da875dbc7780830d09bd4c526b0764a4e50 | aad2dfc40e8e6a7e258287a7c1580318e865817e | refs/heads/master | 1,661,736,426,952 | 1,590,438,032,000 | 1,590,438,032,000 | 266,892,663 | 0 | 0 | Apache-2.0 | 1,590,445,835,000 | 1,590,445,835,000 | null | UTF-8 | Lean | false | false | 7,789 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.concrete_category
import algebra.punit_instances
/-!
# Category instances for monoid, add_monoid, comm_monoid, and add_comm_monoid.
We introd... |
0a053196e3e5b31916566170e5b9925a1373ad03 | ad0c7d243dc1bd563419e2767ed42fb323d7beea | /data/nat/modeq.lean | 24242e0f8f2668bfcc0610838e3db634051238b7 | [
"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 | 4,181 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
Modular equality relation.
-/
import data.int.gcd
namespace nat
/-- Modular equality. `modeq n a b`, or `a ≡ b [MOD n]`, means
that `a - b` is a multiple of `n`. -/... |
20a5afc077da0b43f5dc287094d2026e78f8feb5 | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /src/Lean/Elab/DefView.lean | 3c6ae9e45009b904dce3dc83a564c805ca7ff8e2 | [
"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 | 7,170 | 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, Sebastian Ullrich
-/
import Std.ShareCommon
import Lean.Parser.Command
import Lean.Util.CollectLevelParams
import Lean.Util.FoldConsts
import Lean.Meta.Collec... |
85765eaa7bb919098d00fb99d3d2b84cadfa3d11 | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /src/data/set/lattice.lean | a9c398610554457a668241f85690a7c0b1ae2682 | [
"Apache-2.0"
] | permissive | dexmagic/mathlib | ff48eefc56e2412429b31d4fddd41a976eb287ce | 7a5d15a955a92a90e1d398b2281916b9c41270b2 | refs/heads/master | 1,693,481,322,046 | 1,633,360,193,000 | 1,633,360,193,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 61,489 | 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, Johannes Hölzl, Mario Carneiro
-/
import data.nat.basic
import order.complete_boolean_algebra
import order.directed
import order.galois_connection
/-!... |
cedb86fb859d67fb70fae69d7f69159f71140326 | 4e237972f72cffa663d6754857652da50d4b59f4 | /modal.lean | be41eaeffb89493f3b0c210fddb9452126757b39 | [] | no_license | technosentience/lean-modal-logic-2021 | 1956886e3611c46ea91464ff895474d947633393 | c128091509f18d8e48ed9e9d828f40529f52f412 | refs/heads/master | 1,684,006,713,301 | 1,622,986,759,000 | 1,622,986,759,000 | 374,369,910 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 27,693 | lean | import tactic
open classical
local attribute [instance] prop_decidable
universe u
inductive Formula : Type u
| absurd : Formula
| var : nat → Formula
| impl : Formula → Formula → Formula
| conj : Formula → Formula → Formula
| disj : Formula → Formula → Formula
| nec : Formula → Formula
axiom formu... |
ab51f23b0d1ed9b633866af2e3faca05cfb01ac8 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/macro2.lean | 0b2c8705abb078eb214e1cbcfb8712c48d2778ec | [
"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 | 354 | lean | notation:50 a "**" b:50 => b * a * b
notation "~" a => a+a
namespace Foo
notation "~~" a => a+a
end Foo
syntax:60 term "+++" term:59 : term
syntax "<||" term "||>" : term
macro_rules
| `($a +++ $b) => `($a + $b + $b)
macro_rules
| `(<|| $x ||>) => `($x +++ 1 ** 2)
#check <|| 2 ||>
#check <|| ~2 ||>
#check <|| ... |
02d61e60b603507a963b7725e9f97e414720f78f | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/logic/relation.lean | cd7c93e0cb3c1b84a5df7e8e87803beb597d27e8 | [
"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 | 18,627 | 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
-/
import tactic.basic
/-!
# Relation closures
This file defines the reflexive, transitive, and reflexive transitive closures of relations.
It also proves some basic r... |
71a84baaebb0faf4340cf137cd1cde83655b72d0 | ebf7140a9ea507409ff4c994124fa36e79b4ae35 | /src/hints/category_theory/exercise4/hint4.lean | 91f2e32d9f5b7e4253b3fb11bc404672b41df52c | [] | no_license | fundou/lftcm2020 | 3e88d58a92755ea5dd49f19c36239c35286ecf5e | 99d11bf3bcd71ffeaef0250caa08ecc46e69b55b | refs/heads/master | 1,685,610,799,304 | 1,624,070,416,000 | 1,624,070,416,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,703 | lean | import algebra.category.CommRing
import category_theory.yoneda
import data.polynomial.algebra_map
noncomputable theory
open category_theory
open opposite
open polynomial
/-!
It would be nice to use `polynomial.aeval`, which produces an algebra homomorphism,
and then convert that use `.to_ring_hom`.
However we get a... |
ece08ac53fdd35f54d4f5be8860e14c9d02a44d6 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/number_theory/sum_two_squares.lean | 863876134230f4b298767ea519793f468be1162f | [
"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,847 | lean | /-
Copyright (c) 2019 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Michael Stoll
-/
import number_theory.zsqrtd.quadratic_reciprocity
import tactic.linear_combination
/-!
# Sums of two squares
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
... |
ccbf61411eaea8a5055ac34e02a5fb3e8c7c3df9 | 5ae26df177f810c5006841e9c73dc56e01b978d7 | /src/topology/algebra/monoid.lean | 7439dce31e13bbca9e8b3d237418e7e3cac8a126 | [
"Apache-2.0"
] | permissive | ChrisHughes24/mathlib | 98322577c460bc6b1fe5c21f42ce33ad1c3e5558 | a2a867e827c2a6702beb9efc2b9282bd801d5f9a | refs/heads/master | 1,583,848,251,477 | 1,565,164,247,000 | 1,565,164,247,000 | 129,409,993 | 0 | 1 | Apache-2.0 | 1,565,164,817,000 | 1,523,628,059,000 | Lean | UTF-8 | Lean | false | false | 5,753 | 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
Theory of topological monoids.
TODO: generalize `topological_monoid` and `topological_add_monoid` to semigroups, or add a type class
`topological_opera... |
bbd15f353071f8fd9b12b00572e0f37f21cce8bf | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/set_theory/cardinal/schroeder_bernstein.lean | a1dc7eee68bc7943f1e508e22abb99a86d3d9227 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 5,353 | 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 order.fixed_points
import order.zorn
/-!
# Schröder-Bernstein theorem, well-ordering of cardinals
This file proves the Schröder-Bernstein the... |
dde9818091d609d7fee1f06214ce294d39abfa96 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/consumePPHint.lean | 0ea876dd48c5c967d138b8d39084da4db41270da | [
"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 | 252 | lean | opaque p : Nat → Prop
opaque q : Nat → Prop
theorem p_of_q : q x → p x := sorry
theorem pletfun : p (let_fun x := 0; x + 1) := by
-- ⊢ p (let_fun x := 0; x + 1)
apply p_of_q
trace_state -- `let_fun` hint should not be consumed.
sorry
|
c38f26cb718fc10267696ca636578b52305f64c5 | 590f94277ab689acdc713c44e3bbca2e012fc074 | /Sequent Calculus (Lean)/src/leftRules.lean | fa1ef3a2d3f21027948fa0eb846d59409d218b69 | [] | no_license | Bpalkmim/iALC | bd3f882ad942c876d65c2d33cb50a36b2f8e5d16 | 9c2982ae916d01d9ebab9d58e0842292ed974876 | refs/heads/master | 1,689,527,062,560 | 1,631,502,537,000 | 1,631,502,537,000 | 108,029,498 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,123 | lean | -- Regras do lado esquerdo do sequente de SCiALC.
-- Autor: Bernardo Alkmim
-- bpalkmim@gmail.com
import .basics
namespace leftRulesSCiALC
open iALCbasics
-- Subjunção
constant subj_l {Δ1 Δ2 : list Formula} {α β δ : Formula} :
Proof (Sequent Δ1 α) → Proof (Sequent (β :: Δ2) δ) → Proof (Sequent ((Formula.subj α β :... |
6d87b3cf93b3442d08fdc25920cdd4d7102a65c9 | 54f4ad05b219d444b709f56c2f619dd87d14ec29 | /my_project/src/love06_monads_demo.lean | 996c47f7a29ad0aabe4bba0b3ffbb08ceed709c1 | [] | no_license | yizhou7/learning-lean | 8efcf838c7276e235a81bd291f467fa43ce56e0a | 91fb366c624df6e56e19555b2e482ce767cd8224 | refs/heads/master | 1,675,649,087,737 | 1,609,022,281,000 | 1,609,022,281,000 | 272,072,779 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 11,555 | lean | import .lovelib
/-! # LoVe Demo 6: Monads
We take a look at an important functional programming abstraction: monads.
Monads generalize computation with side effects. Haskell has shown that monads
can be used very successful to write imperative programs. For us, they are
interesting in three ways:
* They are a usefu... |
423808a9890d7609578329d91813d995aa753eaa | 05b503addd423dd68145d68b8cde5cd595d74365 | /src/analysis/analytic/basic.lean | 82f5cce24e57e0f72a0be4ee3af38810baccf133 | [
"Apache-2.0"
] | permissive | aestriplex/mathlib | 77513ff2b176d74a3bec114f33b519069788811d | e2fa8b2b1b732d7c25119229e3cdfba8370cb00f | refs/heads/master | 1,621,969,960,692 | 1,586,279,279,000 | 1,586,279,279,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 21,529 | lean | /-
Copyright (c) 2020 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import analysis.calculus.times_cont_diff tactic.omega analysis.complex.exponential
analysis.specific_limits
/-!
# Analytic functions
A function is analytic i... |
fb3aa1a6e451e1c1eb470e1ffad7f324b67e6254 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/analysis/locally_convex/basic.lean | 49ce8cc61ba98fd4b538ff475b0c6ab108e2dac7 | [
"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 | 15,171 | lean | /-
Copyright (c) 2019 Jean Lo. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean Lo, Bhavik Mehta, Yaël Dillies
-/
import analysis.convex.basic
import analysis.convex.hull
import analysis.normed_space.basic
/-!
# Local convexity
> THIS FILE IS SYNCHRONIZED WITH MAT... |
9f45750ea8fb4a533ec3e6bae43d0c38a2d3a97a | 1a61aba1b67cddccce19532a9596efe44be4285f | /library/init/nat.lean | 8ac028be33523b72d204eab81e67beb88b7cd52e | [
"Apache-2.0"
] | permissive | eigengrau/lean | 07986a0f2548688c13ba36231f6cdbee82abf4c6 | f8a773be1112015e2d232661ce616d23f12874d0 | refs/heads/master | 1,610,939,198,566 | 1,441,352,386,000 | 1,441,352,494,000 | 41,903,576 | 0 | 0 | null | 1,441,352,210,000 | 1,441,352,210,000 | null | UTF-8 | Lean | false | false | 8,772 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Leonardo de Moura
-/
prelude
import init.wf init.tactic init.num
open eq.ops decidable or
notation `ℕ` := nat
namespace nat
/- basic definitions on natura... |
857c8b609de3d24aaaa6cd75df153c133543b6a2 | 0845ae2ca02071debcfd4ac24be871236c01784f | /library/init/lean/runtime.lean | cbdbe7890533544d8290e6ad12ba5826656c5b67 | [
"Apache-2.0"
] | permissive | GaloisInc/lean4 | 74c267eb0e900bfaa23df8de86039483ecbd60b7 | 228ddd5fdcd98dd4e9c009f425284e86917938aa | refs/heads/master | 1,643,131,356,301 | 1,562,715,572,000 | 1,562,715,572,000 | 192,390,898 | 0 | 0 | null | 1,560,792,750,000 | 1,560,792,749,000 | null | UTF-8 | Lean | false | false | 479 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.core
namespace Lean
@[extern "lean_closure_max_args"]
constant closureMaxArgsFn : Unit → Nat := default _
@[extern "lean_max_small_na... |
0f1411d495fa71ce63ec048cbb1893cd2feac920 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tests/lean/interactive/definition.lean | f302e1fe661de365e65f47071ee6b57430242440 | [
"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 | 100 | lean | inductive Foo where
| foo
example : Foo :=
let c := Foo.foo
c
--^ textDocument/typeDefinition
|
1af7fd2d44a30da937d717532724b703e343e5a7 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/data/equiv/set.lean | 3eb4ab14710ccb5137c7f3ae2fb22cbef9a4cfc5 | [
"Apache-2.0"
] | permissive | AntoineChambert-Loir/mathlib | 64aabb896129885f12296a799818061bc90da1ff | 07be904260ab6e36a5769680b6012f03a4727134 | refs/heads/master | 1,693,187,631,771 | 1,636,719,886,000 | 1,636,719,886,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 23,230 | 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.equiv.basic
import data.set.function
/-!
# Equivalences and sets
In this file we provide lemmas linking equivalences to sets.
... |
1b25b4b93925786162327a70d942bce985012b20 | 7bf54883c04ff2856c37f76a79599ceb380c1996 | /non-mathlib/early_version.lean | e22d6759997089dc7a161cc042925d6aa5f4cbd9 | [] | no_license | anonymousLeanDocsHosting/lean-polynomials | 4094466bf19acc0d1a47b4cabb60d8c21ddb2b00 | 361ef4cb7b68ef47d43b85cfa2d13f2ea0a47613 | refs/heads/main | 1,691,112,899,935 | 1,631,819,522,000 | 1,631,819,522,000 | 405,448,439 | 0 | 2 | null | null | null | null | UTF-8 | Lean | false | false | 305,647 | lean | /- A natural number is either zero or the successor of a natural number.-/
inductive mynat : Type
| zero : mynat
| mysucc : mynat → mynat
open mynat
lemma succ_eq (a b : mynat) : (a = b) -> (mysucc a = mysucc b) :=
begin
intros h, rw h,
end
def nat_one : mynat := (mysucc zero)
def myadd : mynat → mynat → my... |
0f5bdb4182fec828be1ef113a9c89a6ee53353b4 | 5ae26df177f810c5006841e9c73dc56e01b978d7 | /src/measure_theory/borel_space.lean | 1a5b75b799cb3afa055817289b649005c6be16b0 | [
"Apache-2.0"
] | permissive | ChrisHughes24/mathlib | 98322577c460bc6b1fe5c21f42ce33ad1c3e5558 | a2a867e827c2a6702beb9efc2b9282bd801d5f9a | refs/heads/master | 1,583,848,251,477 | 1,565,164,247,000 | 1,565,164,247,000 | 129,409,993 | 0 | 1 | Apache-2.0 | 1,565,164,817,000 | 1,523,628,059,000 | Lean | UTF-8 | Lean | false | false | 24,998 | 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
Borel (measurable) space -- the smallest σ-algebra generated by open sets
It would be nice to encode this in the topological space type class, i.e. each topological sp... |
374ec9f7a65652fe91e00c2f1805430bff252e91 | a4673261e60b025e2c8c825dfa4ab9108246c32e | /src/Lean/Meta/CollectMVars.lean | 28761a798cc421178e8e337fe8e99f0edcbb70f6 | [
"Apache-2.0"
] | permissive | jcommelin/lean4 | c02dec0cc32c4bccab009285475f265f17d73228 | 2909313475588cc20ac0436e55548a4502050d0a | refs/heads/master | 1,674,129,550,893 | 1,606,415,348,000 | 1,606,415,348,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,980 | 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.CollectMVars
import Lean.Meta.Basic
namespace Lean.Meta
/--
Collect unassigned metavariables occuring in the given expression.
Remar... |
ee334c3ca96fa82c244a0d4ba094b528cabd0d5d | f4bff2062c030df03d65e8b69c88f79b63a359d8 | /src/game/max/level01.lean | 1b6976daf2ad9bd7fee0b967f68f7b09d6d152ee | [
"Apache-2.0"
] | permissive | adastra7470/real-number-game | 776606961f52db0eb824555ed2f8e16f92216ea3 | f9dcb7d9255a79b57e62038228a23346c2dc301b | refs/heads/master | 1,669,221,575,893 | 1,594,669,800,000 | 1,594,669,800,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,609 | lean | import tactic -- hide
import data.real.basic -- imports the real numbers
/-
-/
open_locale classical -- allow proofs by contradiction
/-
-/
noncomputable theory -- don't fuss about the reals being noncomputable
namespace xena -- hide
-- Let a, b, c be real numbers
variables {a b c : ℝ}
/-
# Chapter ? : Max and ab... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.