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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1a166b74b4e967d49157840aa32df7f335c9f01d | 94e33a31faa76775069b071adea97e86e218a8ee | /src/linear_algebra/span.lean | ab875fafaa65e5429138f6bebca84b723260ce40 | [
"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 | 34,764 | 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, Frédéric Dupuis,
Heather Macbeth
-/
import linear_algebra.basic
import order.omega_complete_partial_order
/-!
# The s... |
2853c753614c58ca2dc853df55ed55e4ce73713e | ac89c256db07448984849346288e0eeffe8b20d0 | /stage0/src/Lean/Elab/StructInst.lean | f89e42130235e663a4208df09410e6f9786bb602 | [
"Apache-2.0"
] | permissive | chepinzhang/lean4 | 002cc667f35417a418f0ebc9cb4a44559bb0ccac | 24fe2875c68549b5481f07c57eab4ad4a0ae5305 | refs/heads/master | 1,688,942,838,326 | 1,628,801,942,000 | 1,628,801,995,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 37,265 | 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.FindExpr
import Lean.Parser.Term
import Lean.Meta.Structure
import Lean.Elab.App
import Lean.Elab.Binders
namespace Lean.Elab.Term.StructI... |
a9f36a6d88417cccacc22e802a482adfe12c4158 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Meta/Tactic/LinearArith/Basic.lean | 4e35c0449c3226f182be158e2075300c22f3c49c | [
"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 | 865 | 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
namespace Lean.Meta.Linear
/-- Quick filter for linear terms. -/
def isLinearTerm (e : Expr) : Bool :=
let f := e.getAppFn
if !f.isCo... |
73cbad8629fa300fdd38cc7a0ed9dbedb4505514 | c8af905dcd8475f414868d303b2eb0e9d3eb32f9 | /src/data/cpi/affinity.lean | 4237c4f606fb00b021ff3f62bd85ce6fbb36cfdb | [
"BSD-3-Clause"
] | permissive | continuouspi/lean-cpi | 81480a13842d67ff5f3698643210d8ed5dd08de4 | 443bf2cb236feadc45a01387099c236ab2b78237 | refs/heads/master | 1,650,307,316,582 | 1,587,033,364,000 | 1,587,033,364,000 | 207,499,661 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,906 | lean | import data.fin data.fintype data.upair
namespace cpi
/-- An affinity network.
This is composed of $arity$ names, and a partial function `f' which defines
the affinities between elements of this matrix.
-/
@[derive decidable_eq, nolint has_inhabited_instance]
structure affinity (ℍ : Type) := intro ::
(arit... |
8ac943ef1957096d50187c35deae243b7dc5264a | e38e95b38a38a99ecfa1255822e78e4b26f65bb0 | /src/certigrad/mvn.lean | 180de285e53124165981c33fd9fc35c5083db2b5 | [
"Apache-2.0"
] | permissive | ColaDrill/certigrad | fefb1be3670adccd3bed2f3faf57507f156fd501 | fe288251f623ac7152e5ce555f1cd9d3a20203c2 | refs/heads/master | 1,593,297,324,250 | 1,499,903,753,000 | 1,499,903,753,000 | 97,075,797 | 1 | 0 | null | 1,499,916,210,000 | 1,499,916,210,000 | null | UTF-8 | Lean | false | false | 17,170 | lean | /-
Copyright (c) 2017 Daniel Selsam. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Daniel Selsam
Properties of the multivariate isotropic Gaussian distribution.
-/
import .tfacts .tgrads
namespace certigrad
namespace T
axiom is_integrable_mvn_of_sub_exp {shape₁ shap... |
ea16e5a5abfb79c990e992082dcc8709987f8f1c | 0b3933727d99a2f351f5dbe6e24716bb786a6649 | /src/sesh/config.lean | 837625bccf17ba9b767a6c84dd5b5d5a9b58c6af | [] | no_license | Vtec234/lean-sesh | 1e770858215279f65aba92b4782b483ab4f09353 | d11d7bb0599406e27d3a4d26242aec13d639ecf7 | refs/heads/master | 1,587,497,515,696 | 1,558,362,223,000 | 1,558,362,223,000 | 169,809,439 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,937 | lean | import sesh.term
import sesh.eval
open matrix
open term
open debrujin_idx
inductive thread_flag: Type
| Main: thread_flag
| Child: thread_flag
namespace thread_flag
inductive add: thread_flag → thread_flag → thread_flag → Prop
| CC: add Child Child Child
| CM: add Child Main Main
| MC: add Main Child Main
lemma c... |
8b389dee4f6d764b9f81ff63d3ee27d66423abbe | 5c7fe6c4a9d4079b5457ffa5f061797d42a1cd65 | /src/exercises/src_03_implication.lean | 676a21843e1104409205ce90437e5ffa61a4a785 | [] | no_license | gihanmarasingha/mth1001_tutorial | 8e0817feeb96e7c1bb3bac49b63e3c9a3a329061 | bb277eebd5013766e1418365b91416b406275130 | refs/heads/master | 1,675,008,746,310 | 1,607,993,443,000 | 1,607,993,443,000 | 321,511,270 | 3 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,339 | lean | variables p q r : Prop
namespace mth1001
section implication_elimination
/-
The implication symbol `→` is entered as `\r` or `\to`. The statement `p → q`
has roughly the same meaning as the English phrase, 'if `p`, then `q`'.
-/
/-
Given `h : p → q` and `k : p`, we may deduce `q`. The proof of this is written
in ... |
61ca2182706167a5ce4f148a90fadcba811c9bd5 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebraic_topology/dold_kan/equivalence_additive.lean | 742196ac2a72b5a8fc771f7505fadb8eb3221601 | [
"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 | 2,072 | lean | /-
Copyright (c) 2022 Joël Riou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Joël Riou
-/
import algebraic_topology.dold_kan.n_comp_gamma
/-!
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding PR to mathlib4.
The Dold-Ka... |
76e5a4b7f9c5901940466ae0c443ed3c1abd58f5 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/topology/sheaves/sheaf_condition/pairwise_intersections.lean | bb801f1cee16079bb53b0e1d479c952dd3bac227 | [
"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 | 19,169 | 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_condition.sites
import category_theory.limits.preserves.basic
import category_theory.category.pairwise
import category_theory.limits.co... |
dd0f12934d70a572ca9d7c36721fe71496e2b3e3 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/data/set/intervals/ord_connected.lean | 2d903044d3a711811abf16d5ff697316b89fad2f | [
"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,395 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Yury G. Kudryashov
-/
import data.set.intervals.unordered_interval
import data.set.lattice
/-!
# Order-connected sets
We say that a set `s : set α` is `ord_connected` if for all `... |
1e8a33c6985bd0ffe56f0e36a5722720a4dd1449 | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/group_theory/sylow.lean | 436da5e078545645d952c30ceef9a2cb28718573 | [
"Apache-2.0"
] | permissive | vaibhavkarve/mathlib | a574aaf68c0a431a47fa82ce0637f0f769826bfe | 17f8340912468f49bdc30acdb9a9fa02eeb0473a | refs/heads/master | 1,621,263,802,637 | 1,585,399,588,000 | 1,585,399,588,000 | 250,833,447 | 0 | 0 | Apache-2.0 | 1,585,410,341,000 | 1,585,410,341,000 | null | UTF-8 | Lean | false | false | 11,434 | 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.group_action group_theory.quotient_group
import group_theory.order_of_element data.zmod.basic
import data.fintype.card
open equiv fintype finset mul_... |
c820d1d4c8ca49ab250c737eb86d06dcb5cf6eb6 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/197c.lean | 0797f5e28492fb90c72b028f11c4bc7ebaf0d4ba | [
"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 | 718 | lean | structure S1 :=
(carrier : set ℕ)
(a1 : ∀ x ∈ carrier, true)
structure S2 extends S1 :=
(a2 : ∀ x ∈ carrier, true)
def example_1 : S2 :=
{ carrier := ∅,
a1 := by { intros x hx, trivial },
-- The goal for `a2` becomes:
-- ⊢ ∀ (x : G), set.mem x ∅ → true
-- Note in particular that `∈` has been unfolded inapprop... |
b24b2fb24b8d02ddd0e5c8ff542f965b69990292 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/category_theory/limits/over.lean | 795765fd4c68a5b1a0436bba5b8c921bc18ae8c3 | [
"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 | 4,872 | lean | /-
Copyright (c) 2018 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Reid Barton, Bhavik Mehta
-/
import category_theory.over
import category_theory.adjunction.opposites
import category_theory.limits.preserves.basic
import category_theor... |
f25407720bac47a44a11ea45dbf9110b38c97519 | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/data/equiv/ring.lean | 8363b3864b45927e115969fddb3c040620b5179d | [
"Apache-2.0"
] | permissive | troyjlee/mathlib | e18d4b8026e32062ab9e89bc3b003a5d1cfec3f5 | 45e7eb8447555247246e3fe91c87066506c14875 | refs/heads/master | 1,689,248,035,046 | 1,629,470,528,000 | 1,629,470,528,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 14,976 | 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, Callum Sutton, Yury Kudryashov
-/
import data.equiv.mul_add
import algebra.field
import algebra.opposites
/-!
# (Semi)ring equivs
In this file we define extension of ... |
adcc38f61e8811cc8c9dd008910cd1daff23feda | 1ce2e14f78a7f514bae439fbbb1f7fa2932dd7dd | /src/vol1/sec1.lean | a7e185d198ff8bbf0077ffaf26423362d7ed261e | [
"MIT"
] | permissive | wudcscheme/lean-mathgirls | b88faf76d12e5ca07b83d6e5580663380b0bb45c | 95b64a33ffb34f3c45e212c4adff3cc988dcbc60 | refs/heads/master | 1,678,994,115,961 | 1,585,127,877,000 | 1,585,127,877,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,773 | lean | -- Chapter 1. Sequences and Patterns
import data.nat.prime data.nat.sqrt tactic.norm_num
import ..common
example: 15 = 3*5 := rfl
example: 16 = 2^4 := rfl
example: nat.prime 17 := by norm_num
example: 18 = 2*3^2 := rfl
-- Shorthand: seq [1..n] f = [f 1, .., f n]
def seq {α β :Type} (l: list α) (f: α -> β)... |
0f0a306a2471d58ba87231afb1ad98ab09d0d2b3 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/data/int/basic.lean | 55316e061b4fd568432f53b7a550c2779e914cc5 | [
"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 | 54,684 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
The integers, with addition, multiplication, and subtraction.
-/
import data.nat.pow
import algebra.order_functions
open nat
namespace int
instance : inhabited ℤ := ⟨i... |
8d0539c06c57b874bf63008de3e451d4dc80658c | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/functor/reflects_isomorphisms.lean | ce74ef7f9e5277a126359e29282f9a130b5d1ec4 | [
"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 | 2,466 | lean | /-
Copyright (c) 2020 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta
-/
import category_theory.balanced
import category_theory.functor.epi_mono
import category_theory.functor.fully_faithful
/-!
# Functors which reflect isomorphisms
> THIS F... |
9aca2b9b530cfedba7df04a44314fcf6ba8b9135 | c5e5ea6e7fc63b895c31403f68dd2f7255916f14 | /test/instances.lean | 668b75ecf60db05289feb119c10cb113301b832e | [
"Apache-2.0",
"OFL-1.1"
] | permissive | leanprover-community/doc-gen | c974f9d91ef6c1c51bbcf8e4b9cc9aa7cfb72307 | 097cc0926bb86982318cabde7e7cc7d5a4c3a9e4 | refs/heads/master | 1,679,268,657,882 | 1,677,623,140,000 | 1,677,623,140,000 | 223,945,837 | 20 | 20 | Apache-2.0 | 1,693,407,722,000 | 1,574,685,636,000 | Python | UTF-8 | Lean | false | false | 839 | lean | /- A short example to test the behavior of `get_instances`. -/
import export_json
class tc_explicit (x : Type*) (v : x).
class tc_implicit {x : Type*} (v : x).
structure foo := (n : ℕ)
instance foo.tc_explicit : tc_explicit foo ⟨1⟩ := ⟨⟩
instance foo.tc_implicit : tc_implicit (⟨1⟩ : foo) := ⟨⟩
def foo.some_prop (b... |
72f9de4dd126cd0997f91260aa3ab9ee04ee72ea | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/data/int/cast.lean | 28aac5124c6ee9fcbd5ca45fb6b07b44c4368c2a | [
"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 | 11,664 | 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.basic
import data.nat.cast
/-!
# Cast of integers
This file defines the *canonical* homomorphism from the integers into a type `α` with `0`,
`1`, `+... |
66df1152e97063d9c0d7bd1409a7c510eedcdf78 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /stage0/src/Lean/Meta/AppBuilder.lean | fee4999d5925ed0374c4f988e73ec9cfbbb30312 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | EdAyers/lean4 | 57ac632d6b0789cb91fab2170e8c9e40441221bd | 37ba0df5841bde51dbc2329da81ac23d4f6a4de4 | refs/heads/master | 1,676,463,245,298 | 1,660,619,433,000 | 1,660,619,433,000 | 183,433,437 | 1 | 0 | Apache-2.0 | 1,657,612,672,000 | 1,556,196,574,000 | Lean | UTF-8 | Lean | false | false | 23,082 | 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.Structure
import Lean.Util.Recognizers
import Lean.Meta.SynthInstance
import Lean.Meta.Check
import Lean.Meta.DecLevel
namespace Lean.Meta
/--... |
78ac210e9b08378ca9925fba3fc3f7350c8f36c2 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/category_theory/is_connected.lean | 559b53dd79c7727bd4bf79fc937b6938ceac770f | [
"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 | 10,684 | lean | /-
Copyright (c) 2020 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta
-/
import data.list.chain
import category_theory.punit
/-!
# Connected category
Define a connected category as a _nonempty_ category for which every functor
to a discrete ... |
8bde5842169b02fd38600e1d11dd2cc3c3ddac83 | c062f1c97fdef9ac746f08754e7d766fd6789aa9 | /algebra/lattice/tactic.lean | 29f3ec7b1832a8fc9cdd6fa8738bd5966f8d15da | [] | no_license | emberian/library_dev | 00c7a985b21bdebe912f4127a363f2874e1e7555 | f3abd7db0238edc18a397540e361a1da2f51503c | refs/heads/master | 1,624,153,474,804 | 1,490,147,180,000 | 1,490,147,180,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,290 | lean | import .basic
open lattice
run_cmd tactic.mk_simp_attr `lattice_simp
section
variable {α : Type}
variable [lattice α]
variables (p q s : α)
@[lattice_simp]
private lemma la1 : p ≤ p := weak_order.le_refl p
@[lattice_simp]
private lemma la2 : p ≤ s → q ≤ s → p ⊔ q ≤ s := semilattice_sup.sup_le p q s
@[lattice_simp]... |
981db0498d3f6d1db40359b3565c22e67855ab58 | b3fced0f3ff82d577384fe81653e47df68bb2fa1 | /src/order/liminf_limsup.lean | 1b723ce2051244e7406510b5a7c8037fb7c9c90f | [
"Apache-2.0"
] | permissive | ratmice/mathlib | 93b251ef5df08b6fd55074650ff47fdcc41a4c75 | 3a948a6a4cd5968d60e15ed914b1ad2f4423af8d | refs/heads/master | 1,599,240,104,318 | 1,572,981,183,000 | 1,572,981,183,000 | 219,830,178 | 0 | 0 | Apache-2.0 | 1,572,980,897,000 | 1,572,980,896,000 | null | UTF-8 | Lean | false | false | 16,590 | lean | /-
Copyright (c) 2018 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel, Johannes Hölzl
Defines the Liminf/Limsup of a function taking values in a conditionally complete lattice, with
respect to an arbitrary filter.
We define `f.Lims... |
e6bba2023a30771b01587accf34f06573037fa47 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/let1.lean | b762e811095237ccb7c1e339529e7be53cad9480 | [
"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 | 1,153 | lean | prelude -- Correct version
check let bool := Type.{0},
and (p q : bool) := ∀ c : bool, (p → q → c) → c,
infixl `∧`:25 := and,
and_intro (p q : bool) (H1 : p) (H2 : q) : p ∧ q
:= λ (c : bool) (H : p → q → c), H H1 H2,
and_eli... |
e01290345cd45658c92d7b1b7870d9ad1ad3faa4 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/free_algebra.lean | d3e5a6ebcd813829496b843754ae533bfdc231e0 | [
"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 | 16,446 | lean | /-
Copyright (c) 2020 Adam Topaz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Adam Topaz
-/
import algebra.algebra.subalgebra.basic
import algebra.monoid_algebra.basic
/-!
# Free Algebras
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to ... |
d85895ee8ddce7ca273fc011c4fc1966d2b98207 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/equiv/list.lean | 5a15cc09bac29dfaa272cef0997175f13cd091d8 | [] | 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 | 8,868 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
Additional equiv and encodable instances for lists, finsets, and fintypes.
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.equiv.denum... |
5c9f525c11a50cd53c909647e4a2dba524c75493 | ebf7140a9ea507409ff4c994124fa36e79b4ae35 | /src/for_mathlib/manifolds.lean | 29dc635f75a35b4b7c741485f33e60a0e744ea75 | [] | 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 | 4,003 | lean | /- Missing bits that should be added to mathlib after the workshop and after cleaning them up -/
import geometry.manifold.times_cont_mdiff
import geometry.manifold.instances.real
open set
open_locale big_operators
section pi_Lp_smooth
variables
{𝕜 : Type*} [nondiscrete_normed_field 𝕜]
{ι : Type*} [fintype ι]... |
cf80796da7b7d4823004bb76bea910b560c517e7 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/geometry/manifold/partition_of_unity.lean | 1c76468785d87798b947d1113c0cb15496b0cd03 | [
"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 | 19,000 | lean | /-
Copyright (c) 2021 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov
-/
import geometry.manifold.algebra.structures
import geometry.manifold.bump_function
import topology.paracompact
import topology.partition_of_unity
import topol... |
45012ab5ab19bbed34d5e00c97b18e7c97133822 | b2fe74b11b57d362c13326bc5651244f111fa6f4 | /src/data/real/basic.lean | 38b6d2cc79e25d78ac9635adbe60c44b01687289 | [
"Apache-2.0"
] | permissive | midfield/mathlib | c4db5fa898b5ac8f2f80ae0d00c95eb6f745f4c7 | 775edc615ecec631d65b6180dbcc7bc26c3abc26 | refs/heads/master | 1,675,330,551,921 | 1,608,304,514,000 | 1,608,304,514,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 18,109 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Floris van Doorn
The (classical) real numbers ℝ. This is a direct construction
from Cauchy sequences.
-/
import order.conditionally_complete_lattice
import data.real.c... |
28fdd7794d29abbcba3632f0e5f18d4e99fe8fc4 | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /hott/init/datatypes.hlean | 124b89ec39eb3f91a6f59302b5e924880d238466 | [
"Apache-2.0"
] | permissive | chubbymaggie/lean | 0d06ae25f9dd396306fb02190e89422ea94afd7b | d2c7b5c31928c98f545b16420d37842c43b4ae9a | refs/heads/master | 1,611,313,622,901 | 1,430,266,839,000 | 1,430,267,083,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,185 | hlean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: init.datatypes
Authors: Leonardo de Moura, Jakob von Raumer
Basic datatypes
-/
prelude
notation [parsing-only] `Type'` := Type.{_+1}
notation [parsing-only] `Type₊` := Type.{_... |
5489f0fb9db039fc0df8b4020aa068e917fa0579 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/algebraic_geometry/presheafed_space.lean | 7222fe9766fa94cacab48cd096067d2fc32f84f0 | [
"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 | 8,178 | 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 topology.sheaves.presheaf
/-!
# Presheafed spaces
Introduces the category of topological spaces equipped with a presheaf (taking values in an
arbitrary targe... |
2269e70871422412e6fb3939b51184a349614e60 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/category/Mon/colimits.lean | 9f12277c95cb3d0f71d59797c06d09572485a2eb | [
"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 | 7,543 | 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 algebra.category.Mon.basic
import category_theory.limits.has_limits
import category_theory.concrete_category.elementwise
/-!
# The category of monoids has all... |
9c3ca8fc71e1bc7ce17368adca29c792ce2d7505 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/DefEqAssignBug.lean | 6bb056e2fab1e14c31079d82b7842f85595aa592 | [
"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 | 611 | lean | import Lean.Meta
open Lean
open Lean.Meta
def checkM (x : MetaM Bool) : MetaM Unit :=
unless (← x) do throwError "check failed"
def tst1 : MetaM Unit := do
let nat := mkConst `Nat
let m1 ← mkFreshExprMVar nat
let m2 ← mkFreshExprMVar (← mkArrow nat nat)
withLocalDeclD `x nat fun x => do
let t := mkApp m2 x
che... |
1e8bed86c0fd12c34bc2e82aa66c4c8eb3981527 | ff5230333a701471f46c57e8c115a073ebaaa448 | /library/init/meta/lean/parser.lean | 9139568fbc21db2c3bcbedc2d18b1fb8cb6bd1e7 | [
"Apache-2.0"
] | permissive | stanford-cs242/lean | f81721d2b5d00bc175f2e58c57b710d465e6c858 | 7bd861261f4a37326dcf8d7a17f1f1f330e4548c | refs/heads/master | 1,600,957,431,849 | 1,576,465,093,000 | 1,576,465,093,000 | 225,779,423 | 0 | 3 | Apache-2.0 | 1,575,433,936,000 | 1,575,433,935,000 | null | UTF-8 | Lean | false | false | 4,218 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
-/
prelude
import init.meta.tactic init.meta.has_reflect init.category.alternative
namespace lean
-- TODO: make inspectable (and pure)
meta constant parser_s... |
e291893cc4433f25ab838b2ca42c7a26aab5dca6 | cf39355caa609c0f33405126beee2739aa3cb77e | /library/init/data/option/instances.lean | fd5234b896992a543e0da3705d204dc42e808226 | [
"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 | 1,034 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.data.option.basic
import init.meta.tactic
import init.control.lawful
universes u v
instance : is_lawful_monad option :=
{ id_map := λ ... |
e549354fa8b2ebf5e69c851cd3a1ed0b33dcbc9b | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /hott/init/reserved_notation.hlean | 14f79ca3978cfe80f62f455933fd4a264ddedb68 | [
"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 | 7,706 | 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, Jeremy Avigad, Floris van Doorn
-/
prelude
import init.datatypes
notation `assume` binders `,` r:(scoped f, f) := r
notation `take` binders `,` r:(scoped f... |
47b7f56b5dd8f5bd670b548c4017b4a8631888b8 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/analysis/mean_inequalities.lean | 430fa9d1e1e2045aaf2848bb4034e97979fa9fea | [
"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 | 33,238 | lean | /-
Copyright (c) 2019 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov, Sébastien Gouëzel, Rémy Degenne
-/
import analysis.convex.specific_functions
import analysis.special_functions.pow
import data.real.conjugate_exponents
import tactic.... |
459b74e13a8b12f6d3091236f89fde1e2de8ced7 | af6139dd14451ab8f69cf181cf3a20f22bd699be | /library/init/meta/mk_dec_eq_instance.lean | 6ce566d17cff849adffd8b3ad4fbdfceaaf3c3b6 | [
"Apache-2.0"
] | permissive | gitter-badger/lean-1 | 1cca01252d3113faa45681b6a00e1b5e3a0f6203 | 5c7ade4ee4f1cdf5028eabc5db949479d6737c85 | refs/heads/master | 1,611,425,383,521 | 1,487,871,140,000 | 1,487,871,140,000 | 82,995,612 | 0 | 0 | null | 1,487,905,618,000 | 1,487,905,618,000 | null | UTF-8 | Lean | false | false | 5,338 | 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
Helper tactic for showing that a type has decidable equality.
-/
prelude
import init.meta.contradiction_tactic init.meta.constructor_tactic
import init.meta.i... |
4715ccf923f73517f29e837fd8d79fffd4a4abec | 5ae26df177f810c5006841e9c73dc56e01b978d7 | /src/order/filter/basic.lean | 59f43547a7b99c121b45a59bd69e72cb644feae1 | [
"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 | 82,017 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Jeremy Avigad
Theory of filters on sets.
-/
import order.galois_connection order.zorn
import data.set.finite
open lattice set
universes u v w x y
local attribute [in... |
d67770c17116f75b411c0083b172e38711056289 | 9ad8d18fbe5f120c22b5e035bc240f711d2cbd7e | /src/algebra/prod_equiv.lean | 5aeeb70078235cb3e794e2a5ba7f9ba41b4efb51 | [] | 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 | 4,356 | lean | /-
Copyright (c) 2019 Neil Strickland. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Neil Strickland
This file contains various addenda to algebra/big_operators.
One issue is that I often prefer to work with fintypes and
sums/products over all of univ, and it is hel... |
3cc67d2c702d11e69c6a3a636bcfe7d2baa3d25d | 853df553b1d6ca524e3f0a79aedd32dde5d27ec3 | /src/data/analysis/filter.lean | 38e3905919895c5f51e78613283fe415e896b2cb | [
"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 | 11,805 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
Computational realization of filters (experimental).
-/
import order.filter.cofinite
open set filter
/-- A `cfilter α σ` is a realization of a filter (base) on `α`,
... |
747416ad60fa9fb51fa6c3513fbf94b381d43059 | 947b78d97130d56365ae2ec264df196ce769371a | /src/Lean/Data/Name.lean | eb6ea552d812a01b21ea3ddcad69fb484c5c2425 | [
"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 | 5,832 | lean | /-
Copyright (c) 2018 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
import Std.Data.HashSet
import Std.Data.RBMap
import Std.Data.RBTree
namespace Lean
instance stringToName : HasCoe String Name :=
⟨mkNameSimple⟩
namespace ... |
fa154049349a9c701b314a38e5979c16febc7d22 | f7315930643edc12e76c229a742d5446dad77097 | /library/init/reserved_notation.lean | 010ab1c9b66e0e0482ce46a2a3b6e7fe42990e91 | [
"Apache-2.0"
] | permissive | bmalehorn/lean | 8f77b762a76c59afff7b7403f9eb5fc2c3ce70c1 | 53653c352643751c4b62ff63ec5e555f11dae8eb | refs/heads/master | 1,610,945,684,489 | 1,429,681,220,000 | 1,429,681,449,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,411 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: init.reserved_notation
Authors: Leonardo de Moura, Jeremy Avigad
-/
prelude
import init.datatypes
notation `assume` binders `,` r:(scoped f, f) := r
notation `take` binders `... |
6bc4e43eb65e1ffc60b6e6d23fc2952dc2eb17a5 | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/data/set/basic.lean | 6e7d9f322050cc56b76f2ce1dd8cc86d42f724ba | [
"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 | 104,279 | 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
-/
import logic.unique
import order.boolean_algebra
/-!
# Basic properties of sets
Sets in Lean are homogeneous; all their elements have the same type... |
ba748c6e214446c2289dd41762fab193108d0ba7 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/evalCmd.lean | 84d87aed297ac8281858e349e51423f1b6730317 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 251 | lean | import Lean
open Lean Elab Command
#eval do
let id := mkIdent `foo
elabCommand (← `(def $id := 10))
example : foo = 10 := rfl
#eval do
let id := mkIdent `boo
elabCommand (← `(def $id := false))
return 5
example : boo = false := rfl
|
c7e81c932cba4d0d3f5073eaa134a430184522c0 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/ring_theory/maps.lean | 98a44be3c824a728697e054bd65ccf75c10f7617 | [
"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,219 | lean | /-
Copyright (c) 2018 Andreas Swerdlow. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Andreas Swerdlow, Kenny Lau
-/
import data.equiv.ring
/-!
# Ring antihomomorphisms, isomorphisms, antiisomorphisms and involutions
This file defines ring antihomomorphisms, antiis... |
e33c9247fd04ba97324bb241b42dc629e64dd522 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/back_chaining3.lean | 91e2ae0e1031a5e6824b6e22d50995dc35f5d5d5 | [
"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 | 904 | lean | namespace ex
open tactic
constant typ : Type
constant subtype : typ → typ → Prop
constant subtype_refl : ∀ T, subtype T T
constant subtype_trans : ∀ S T U, subtype S T → subtype T U → subtype S U
attribute [intro] subtype_refl subtype_trans
lemma L1 : ∀ T1 T2 T3 T4, subtype T1 T2 → subtype T2 T3 → subtype T3 T4 →... |
4c6821ee4b797dc9741189827767a09ee32198f2 | 367134ba5a65885e863bdc4507601606690974c1 | /src/data/list/bag_inter.lean | c3ab4ed2c8739aeeeffead291c3bbc74fb833493 | [
"Apache-2.0"
] | permissive | kodyvajjha/mathlib | 9bead00e90f68269a313f45f5561766cfd8d5cad | b98af5dd79e13a38d84438b850a2e8858ec21284 | refs/heads/master | 1,624,350,366,310 | 1,615,563,062,000 | 1,615,563,062,000 | 162,666,963 | 0 | 0 | Apache-2.0 | 1,545,367,651,000 | 1,545,367,651,000 | null | UTF-8 | Lean | false | false | 3,481 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Scott Morrison
-/
import data.list.basic
namespace list
open nat
/- bag_inter -/
universe u
variables {α : Type u} [decidable_eq α]
@[simp] theorem nil_bag_inter (... |
05473af3eb1c010bee1a8b1bab628d0d03f3db48 | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/group_theory/subgroup/basic.lean | daa98e1685e2635492f5fb8dc30af759353f2184 | [
"Apache-2.0"
] | permissive | waynemunro/mathlib | e3fd4ff49f4cb43d4a8ded59d17be407bc5ee552 | 065a70810b5480d584033f7bbf8e0409480c2118 | refs/heads/master | 1,693,417,182,397 | 1,634,644,781,000 | 1,634,644,781,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 94,984 | lean | /-
Copyright (c) 2020 Kexing Ying. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kexing Ying
-/
import group_theory.submonoid
import group_theory.submonoid.center
import algebra.group.conj
import order.atoms
/-!
# Subgroups
This file defines multiplicative and addit... |
d2d32269f3d26955e1aa523781bce36432ce3853 | 2a70b774d16dbdf5a533432ee0ebab6838df0948 | /_target/deps/mathlib/src/algebra/field.lean | 9a63b33c38adb7355b1b263606cd41518f9d93c3 | [
"Apache-2.0"
] | permissive | hjvromen/lewis | 40b035973df7c77ebf927afab7878c76d05ff758 | 105b675f73630f028ad5d890897a51b3c1146fb0 | refs/heads/master | 1,677,944,636,343 | 1,676,555,301,000 | 1,676,555,301,000 | 327,553,599 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,920 | lean | /-
Copyright (c) 2014 Robert Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Lewis, Leonardo de Moura, Johannes Hölzl, Mario Carneiro
-/
import algebra.ring.basic
import algebra.group_with_zero
open set
set_option old_structure_cmd true
universe u
variab... |
7f3c150021a55124b4219b684af4e573b65a08e4 | 1e3a43e8ba59c6fe1c66775b6e833e721eaf1675 | /src/analysis/normed_space/basic.lean | 6616d7b2d2439a0200b93a54c538a0482c864951 | [
"Apache-2.0"
] | permissive | Sterrs/mathlib | ea6910847b8dfd18500486de9ab0ee35704a3f52 | d9327e433804004aa1dc65091bbe0de1e5a08c5e | refs/heads/master | 1,650,769,884,257 | 1,587,808,694,000 | 1,587,808,694,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 40,369 | 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
-/
import topology.instances.nnreal
import topology.instances.complex
import topology.algebra.module
import topology.metric_space.antilipschitz
/-!
# No... |
3d503af7e9cb05d079b3a2bf41ba75d83b40db25 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/algebra/category/Group/zero.lean | 9c1807fcc0e7f76b8efd59a3fae5ae1a0ea83459 | [] | 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,198 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.algebra.category.Group.basic
import Mathlib.category_theory.limits.shapes.zero
import Mathl... |
674feff43680f3a3e9b77ebe4ab30c403239ccc0 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/algebra/category/Module/colimits.lean | b5159acceef7008f23b94e16d7731dc0b2ff8399 | [
"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 | 10,573 | 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 algebra.category.Module.basic
import group_theory.quotient_group
import category_theory.limits.concrete_category
import category_theory.limits.shapes.kernels
i... |
1740d6f44db567957bd6fcfca541ce2ff433c0e4 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/topology/metric_space/shrinking_lemma.lean | 7f82c3092a821cd6d90d124d69c6054c6304d380 | [
"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 | 6,365 | lean | /-
Copyright (c) 2021 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov
-/
import topology.metric_space.basic
import topology.metric_space.emetric_paracompact
import topology.shrinking_lemma
/-!
# Shrinking lemma in a proper metric ... |
54663b8f5af42581b2a44187dca74aa8aceab57e | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/eq12.lean | 1c134fec69b586d87282226f312d5419d34c8123 | [
"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 | 478 | lean | open nat bool inhabited
definition diag : bool → bool → bool → nat
| b tt ff := 1
| ff b tt := 2
| tt ff b := 3
| b1 b2 b3 := arbitrary nat
theorem diag1 (a : bool) : diag a tt ff = 1 :=
bool.cases_on a rfl rfl
theorem diag2 (a : bool) : diag ff a tt = 2 :=
bool.cases_on a rfl rfl
theorem diag3 (a : bool) : diag... |
25e8177f36a8b300c0be303c686c62d845f605ba | ff5230333a701471f46c57e8c115a073ebaaa448 | /library/init/data/int/basic.lean | 4c10c0217f18c009de633bb2ae59276ef69064fe | [
"Apache-2.0"
] | permissive | stanford-cs242/lean | f81721d2b5d00bc175f2e58c57b710d465e6c858 | 7bd861261f4a37326dcf8d7a17f1f1f330e4548c | refs/heads/master | 1,600,957,431,849 | 1,576,465,093,000 | 1,576,465,093,000 | 225,779,423 | 0 | 3 | Apache-2.0 | 1,575,433,936,000 | 1,575,433,935,000 | null | UTF-8 | Lean | false | false | 23,022 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
The integers, with addition, multiplication, and subtraction.
-/
prelude
import init.data.nat.lemmas init.data.nat.gcd
open nat
/- the type, coercions, and notation -/
... |
bbb2e0ff8859fe8e37d15286d7c985070af059bd | 32da3d0f92cab08875472ef6cacc1931c2b3eafa | /src/measure_theory/haar_measure.lean | b9d230053078df627527f7551caccd383143c808 | [
"Apache-2.0"
] | permissive | karthiknadig/mathlib | b6073c3748860bfc9a3e55da86afcddba62dc913 | 33a86cfff12d7f200d0010cd03b95e9b69a6c1a5 | refs/heads/master | 1,676,389,371,851 | 1,610,061,127,000 | 1,610,061,127,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 29,850 | 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.content
import measure_theory.group
/-!
# Haar measure
In this file we prove the existence of Haar measure for a locally compact Hausdorff ... |
decc59fde7fdbd856ff04e5f876466162466f870 | b32d3853770e6eaf06817a1b8c52064baaed0ef1 | /test/complicated.lean | 2f10ba6686231e577f8797390265f37c6ea927ff | [] | no_license | gebner/super2 | 4d58b7477b6f7d945d5d866502982466db33ab0b | 9bc5256c31750021ab97d6b59b7387773e54b384 | refs/heads/master | 1,635,021,682,021 | 1,634,886,326,000 | 1,634,886,326,000 | 225,600,688 | 4 | 2 | null | 1,598,209,306,000 | 1,575,371,550,000 | Lean | UTF-8 | Lean | false | false | 329 | lean | import super
set_option trace.super true
set_option profiler true
example (i) (p q : i → i → Prop) (a b c d : i) :
(∀x y z, p x y ∧ p y z → p x z) →
(∀x y z, q x y ∧ q y z → q x z) →
(∀x y, q x y → q y x) →
(∀x y, p x y ∨ q x y) →
p a b ∨ q c d :=
by tactic.try_for 10000 `[super *]
|
82f6cbee94d9d453575825b1514ef92d32edffd8 | 4fa161becb8ce7378a709f5992a594764699e268 | /src/algebra/continued_fractions/continuants_recurrence.lean | c7e6c457d0ad93e7732cd853b015b37a37d46307 | [
"Apache-2.0"
] | permissive | laughinggas/mathlib | e4aa4565ae34e46e834434284cb26bd9d67bc373 | 86dcd5cda7a5017c8b3c8876c89a510a19d49aad | refs/heads/master | 1,669,496,232,688 | 1,592,831,995,000 | 1,592,831,995,000 | 274,155,979 | 0 | 0 | Apache-2.0 | 1,592,835,190,000 | 1,592,835,189,000 | null | UTF-8 | Lean | false | false | 3,679 | lean | /-
Copyright (c) 2019 Kevin Kappelmann. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Kappelmann
-/
import algebra.continued_fractions.translations
/-!
# Recurrence Lemmas for the `continuants` Function of Continued Fractions.
## Summary
Given a generalized co... |
161d7f9d21c57a11db16f03bc51ab6e050ad1890 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/algebra/lie_algebra.lean | 823c8da4e5be55b3c28984028b1785fe97a6fdbb | [
"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 | 41,959 | 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
import linear_algebra.bilinear_form
import linear_algebra.direct_sum.finsupp
import tactic.noncomm_ring
/-!
... |
851b1e0d983005ad094e5a23c499729e74834203 | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /06_Inductive_Types.org.30.lean | 31d425dcc7685357ba6633dc10e28d3510bf725f | [] | no_license | cjmazey/lean-tutorial | ba559a49f82aa6c5848b9bf17b7389bf7f4ba645 | 381f61c9fcac56d01d959ae0fa6e376f2c4e3b34 | refs/heads/master | 1,610,286,098,832 | 1,447,124,923,000 | 1,447,124,923,000 | 43,082,433 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 985 | lean | /- page 87 -/
import standard
namespace hide
inductive nat : Type :=
| zero : nat
| succ : nat → nat
namespace nat
definition add (m n : nat) : nat :=
nat.rec_on n m (fun n add_m_n, succ add_m_n)
notation 0 := zero
infix `+` := add
theorem add_zero (m : nat) : m + 0 = m := rfl
theorem add_succ (m n : nat) : m + s... |
53c23fb73927d590a19a39ddde062052d816199a | d1a52c3f208fa42c41df8278c3d280f075eb020c | /stage0/src/Lean/DocString.lean | 33493caa3265edfd0c18a403dd6af51466a6105b | [
"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 | 1,762 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.MonadEnv
namespace Lean
private builtin_initialize builtinDocStrings : IO.Ref (NameMap String) ← IO.mkRef {}
private builtin_initialize docStr... |
8f6c71e0dafa7a2e5f2df82d2a1fb4ed61434cff | 42610cc2e5db9c90269470365e6056df0122eaa0 | /hott/cubical/square.hlean | 20856492b9c5e4f9e6a84ca51e796db4b114ed8e | [
"Apache-2.0"
] | permissive | tomsib2001/lean | 2ab59bfaebd24a62109f800dcf4a7139ebd73858 | eb639a7d53fb40175bea5c8da86b51d14bb91f76 | refs/heads/master | 1,586,128,387,740 | 1,468,968,950,000 | 1,468,968,950,000 | 61,027,234 | 0 | 0 | null | 1,465,813,585,000 | 1,465,813,585,000 | null | UTF-8 | Lean | false | false | 29,127 | hlean | /-
Copyright (c) 2015 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Jakob von Raumer
Squares in a type
-/
import types.eq
open eq equiv is_equiv sigma
namespace eq
variables {A B : Type} {a a' a'' a₀₀ a₂₀ a₄₀ a₀₂ a₂₂ a₂₄ a₀₄ a₄... |
7c9d0284b240b51db3ac08d1fbde10caad758485 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/tactic/obviously.lean | 3715326edd140b8c191af8b0769c65e5012c1b99 | [] | 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,425 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.tactic.tidy
import Mathlib.tactic.replacer
import Mathlib.PostPort
namespace Mathlib
/-!
... |
4bec8372f3459a6fb87bece78b64fc7251302ae2 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/logic/nonempty.lean | 8a4cdc0eafc04efcb34e4135a8fef88abf33732e | [
"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 | 5,612 | 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 logic.basic
/-!
# Nonempty types
This file proves a few extra facts about `nonempty`, which is defined in core Lean.
## Main declarations
* `nonempty.some`... |
ca3a9b674054b6abdf39f61cfb75eb3368d58b11 | f083c4ed5d443659f3ed9b43b1ca5bb037ddeb58 | /tactic/wlog.lean | 3847b569516dc540dc4d81822634a2fa76488bf3 | [
"Apache-2.0"
] | permissive | semorrison/mathlib | 1be6f11086e0d24180fec4b9696d3ec58b439d10 | 20b4143976dad48e664c4847b75a85237dca0a89 | refs/heads/master | 1,583,799,212,170 | 1,535,634,130,000 | 1,535,730,505,000 | 129,076,205 | 0 | 0 | Apache-2.0 | 1,551,697,998,000 | 1,523,442,265,000 | Lean | UTF-8 | Lean | false | false | 9,365 | 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
Without loss of generality tactic.
-/
import tactic.basic tactic.interactive data.list.perm
open expr tactic lean lean.parser
local postfix `?`:9001 := optional
local... |
b0f64b43cec3f07f32abcca7d53fd47df8c15aeb | 2eab05920d6eeb06665e1a6df77b3157354316ad | /src/measure_theory/integral/integral_eq_improper.lean | 38490936c88ab0d27a1b0039d7142dbf968744d5 | [
"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 | 22,042 | lean | /-
Copyright (c) 2021 Anatole Dedecker. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anatole Dedecker
-/
import measure_theory.integral.interval_integral
import order.filter.at_top_bot
/-!
# Links between an integral and its "improper" version
In its current state,... |
07bb4840bc4d4201863fdd37679850c702603f13 | 3d2a7f1582fe5bae4d0bdc2fe86e997521239a65 | /misc/family4.lean | c771d4a82bc25b0784cf9ba161564cc3fcb4c4ad | [] | no_license | own-pt/common-sense-lean | e4fa643ae010459de3d1bf673be7cbc7062563c9 | f672210aecb4172f5bae265e43e6867397e13b1c | refs/heads/master | 1,622,065,660,261 | 1,589,487,533,000 | 1,589,487,533,000 | 254,167,782 | 3 | 2 | null | 1,589,487,535,000 | 1,586,370,214,000 | Lean | UTF-8 | Lean | false | false | 774 | lean |
constant Class : Type
-- SUMO immediateSubclass
constant subClass : Class → Class → Type
-- SUMO subclass
constant Inherits : Class → Class → Type
constant inhz (c : Class) : Inherits c c
constant inhs (c1 c2 c3 : Class) : subClass c1 c2 → Inherits c2 c3 → Inherits c1 c3
constants Human Hominid Entity : Class
con... |
9ca32b6168bcd42386e3c7abe88f7ce054ac1ca3 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/category_theory/isomorphism_classes.lean | e1a1e117e0efb408d797beaae71b2e5b0b55f8d5 | [
"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 | 1,622 | lean | /-
Copyright (c) 2019 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import category_theory.category.Cat
import category_theory.groupoid
/-!
# Objects of a category up to an isomorphism
`is_isomorphic X Y := nonempty (X ≅ Y)` is an... |
2e6ee4a2cb57b3e9f8b27f99746ea51b832e401f | c777c32c8e484e195053731103c5e52af26a25d1 | /src/number_theory/arithmetic_function.lean | 6c7ead190311454ae5762f6d08281b5a56d5f023 | [
"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 | 35,810 | lean | /-
Copyright (c) 2020 Aaron Anderson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson
-/
import algebra.big_operators.ring
import algebra.module.big_operators
import number_theory.divisors
import data.nat.squarefree
import data.nat.gcd.big_operators
impor... |
a2ba57aed3a6f69b236fd2d82b02fbeaa583805e | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/topology/sheaves/forget.lean | 3fb52ea35b2998f2624a59610aa22a879f930d67 | [
"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 | 8,409 | 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.limits.preserves.shapes.products
import topology.sheaves.sheaf_condition.equalizer_products
/-!
# Checking the sheaf condition on the underlyi... |
a73e992d8afad982271d2289e6c595f3b8f5e3ab | 958488bc7f3c2044206e0358e56d7690b6ae696c | /lean/tutorials/tutorial6.lean | 2b28b1c8906332f97da7338ccdf63e89dfeecff0 | [] | 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 | 3,401 | lean | import tuto_lib
variable {ϕ : ℕ → ℕ}
lemma id_le_extraction' : extraction ϕ → ∀ n, n ≤ ϕ n :=
begin
intros H₁ n, induction n with n IH,
{ apply zero_le },
{ apply nat.succ_le_of_lt, calc
n ≤ ϕ n : IH
... < ϕ (nat.succ n) : by { apply H₁, apply lt_add_one } }
end
lemma extraction_ge... |
d82a05c43037cc4ad683ec363d4b9b0f810dc2bd | 43390109ab88557e6090f3245c47479c123ee500 | /src/markov/markov_intro.lean | 4d3b854b9bce20848b9aece901e74e262182430c | [
"Apache-2.0"
] | permissive | Ja1941/xena-UROP-2018 | 41f0956519f94d56b8bf6834a8d39473f4923200 | b111fb87f343cf79eca3b886f99ee15c1dd9884b | refs/heads/master | 1,662,355,955,139 | 1,590,577,325,000 | 1,590,577,325,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 13,377 | lean | /-
Copyright (c) 2018 Luca Gerolla. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Luca Gerolla, Kenny Lau
Basic definitions of probability theory and
(one-sided/discrete) stochastic processes
-/
import analysis.topology.continuity
import analysis.topology.topological... |
77f4b65f812fdcf4fab586d945b43901f008a6b5 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/unfold_default_values.lean | a6150096217bc3b3f6f56be7b561fd5bab7cfe64 | [
"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 | 166 | lean | structure S :=
(x : nat)
(y : nat := 10)
example (a : nat) (h : 10 = a) : {S . x := 10}^.y = a :=
begin
simp [S.y._default],
guard_target 10 = a,
exact h
end
|
316f42b916b9b05efdb9efea838e7f7f47b78a63 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/lean/ref1.lean | 4ea83e08b23c71d5f37e43b4b044d5f7b8ce0de0 | [
"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 | 598 | lean | def inc (r : IO.Ref Nat) : IO Unit :=
do v ← r.get;
r.set (v+1);
IO.println (">> " ++ toString v)
def initArray (r : IO.Ref (Array Nat)) (n : Nat) : IO Unit :=
n.forM $ fun i => do
r.modify $ fun a => a.push (2*i)
def showArrayRef (r : IO.Ref (Array Nat)) : IO Unit :=
do a ← r.swap ∅;
a.size.forM (fun i =>... |
2da711d0c35580b8f2dff7879470a3e55184a49a | 947b78d97130d56365ae2ec264df196ce769371a | /src/Lean/Util/FoldConsts.lean | 67ee2ac777edbac4a375dfeceaf041aa667d2e4a | [
"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 | 2,559 | 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.Expr
import Lean.Environment
namespace Lean
namespace Expr
namespace FoldConstsImpl
abbrev cacheSize : USize := 8192
structure State :=
(visi... |
fcc3a4df463fd77e2c26d3566121c800766c3ce8 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/data/matrix/block.lean | 2cf32751d5ad04b33a4306ca9fd9cc8b3df91067 | [
"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 | 25,823 | lean | /-
Copyright (c) 2018 Ellen Arlt. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Ellen Arlt, Blair Shi, Sean Leather, Mario Carneiro, Johan Commelin
-/
import data.matrix.basic
/-!
# Block Matrices
## Main definitions
* `matrix.from_blocks`: build a block matrix out... |
0c86c8bdfa7cdbb4979bcf175610a679387c62a5 | a76f677b87d42a9470ba3a0a78cfddd3063118e6 | /src/order/segment.lean | 521926e4868673652af8b4659016f1a4c977b140 | [] | no_license | Ja1941/hilberts-axioms | 50219c732ad5fa167408432e8c8baae259777a40 | 5b653a92e448b77da41c9893066b641bc4e6b316 | refs/heads/master | 1,693,238,884,856 | 1,635,702,120,000 | 1,635,702,120,000 | 385,546,384 | 9 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 8,589 | lean | /-
Copyright (c) 2021 Tianchen Zhao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Tianchen Zhao
-/
import incidence.basic
/-!
# Order on incidence geometry and segments
This file formalises betweenness based on `incidence_geometry`, defines line segments
and proves... |
4c4056a03a053f1bc8c210aab959b2cfdb4eedce | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/category_theory/monad/limits.lean | 11057c70197c88e5a875738f144701c92499847d | [
"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 | 10,277 | 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
namespace category_theory
open category
open category_theory.limits
u... |
e80d20145897646804353dd3ede377cfefdf72ca | 210f9102c083df8f914bec3dba4a94a8dfb7ea1a | /lean/test.lean | eb36ed37465078269a4b803aacd971bdcba025bd | [] | no_license | krzysz00/hpac-research | 7f41a30826e250d29a5c6692165bfd067aed8169 | 6675ef753a2432bfcfea1856e545b234d52ad8d0 | refs/heads/master | 1,630,685,824,280 | 1,515,580,671,000 | 1,515,580,671,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,725 | lean | structure predicates :=
mk :: (lower_triangular : string → bool)
inductive base_term : Type
| matrix : string → base_term
| plus : base_term → base_term → base_term
| times : base_term → base_term → base_term
| transpose : base_term → base_term
| one : base_term
| zero : base_term
instance : has_zero base_term := ⟨ba... |
9f300a2e589e36c6215fa4d0481bca2de966a433 | 32025d5c2d6e33ad3b6dd8a3c91e1e838066a7f7 | /tests/lean/run/monadControl.lean | ad23f81901866d5e68489db90593c715855c5e9b | [
"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,182 | lean | @[inline] def f {α} (s : String) (x : IO α) : IO α := do
IO.println "started";
IO.println s;
a ← x;
IO.println ("ended");
pure a
@[inline] def f'' {α m} [MonadControlT IO m] [Monad m] (msg : String) (x : m α) : m α := do
controlAt IO fun runInBase => f msg (runInBase x)
abbrev M := StateT Bool $ ExceptT String $ Stat... |
a442629852f976af3474402b3725af4031defddc | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/data/polynomial/algebra_map.lean | 3ebdc268e20d83717c50ec99baac6d1b5c530ef7 | [
"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 | 11,471 | 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.eval
import algebra.algebra.tower
/-!
# Theory of univariate polynomials
We show that `polynomia... |
35d57c4b1d1a930b1448f1ff0483104b18a3d47e | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/data/equiv/encodable/basic.lean | e964af15bb06e96e169b2ac7f7487933c7402424 | [
"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 | 17,824 | 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.nat
import order.rel_iso
import order.directed
/-!
# Encodable types
This file defines encodable (constructively countab... |
bedcd64e47cb35b4adaa161fb588895403218f98 | e39f04f6ff425fe3b3f5e26a8998b817d1dba80f | /group_theory/order_of_element.lean | 97be4b6ce574e00e0f0fb5fb61cb528b29517314 | [
"Apache-2.0"
] | permissive | kristychoi/mathlib | c504b5e8f84e272ea1d8966693c42de7523bf0ec | 257fd84fe98927ff4a5ffe044f68c4e9d235cc75 | refs/heads/master | 1,586,520,722,896 | 1,544,030,145,000 | 1,544,031,933,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 20,553 | 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 data.set.finite group_theory.coset data.nat.totient
open function
variables {α : Type*} {s : set α} {a a₁ a₂ b c: α}
-- TODO this lemma isn't used anywhere i... |
5dc7d03f70b6374eceb7074116116e0955950b58 | 9028d228ac200bbefe3a711342514dd4e4458bff | /src/field_theory/adjoin.lean | 5b98b8a1edb0a1160dd02ecaa3933bd16cc03280 | [
"Apache-2.0"
] | permissive | mcncm/mathlib | 8d25099344d9d2bee62822cb9ed43aa3e09fa05e | fde3d78cadeec5ef827b16ae55664ef115e66f57 | refs/heads/master | 1,672,743,316,277 | 1,602,618,514,000 | 1,602,618,514,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 14,688 | lean | /-
Copyright (c) 2020 Thomas Browning and Patrick Lutz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Thomas Browning and Patrick Lutz
-/
import field_theory.tower
import field_theory.intermediate_field
/-!
# Adjoining Elements to Fields
In this file we introduce t... |
7d1b8fa91de587e83386a3ffe1f45f1a40793be4 | 618003631150032a5676f229d13a079ac875ff77 | /src/category_theory/monoidal/functor.lean | 49c82d9baa97acb8f0508175859b51bddeca19c4 | [
"Apache-2.0"
] | permissive | awainverse/mathlib | 939b68c8486df66cfda64d327ad3d9165248c777 | ea76bd8f3ca0a8bf0a166a06a475b10663dec44a | refs/heads/master | 1,659,592,962,036 | 1,590,987,592,000 | 1,590,987,592,000 | 268,436,019 | 1 | 0 | Apache-2.0 | 1,590,990,500,000 | 1,590,990,500,000 | null | UTF-8 | Lean | false | false | 6,336 | lean | /-
Copyright (c) 2018 Michael Jendrusch. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Michael Jendrusch, Scott Morrison
-/
import category_theory.monoidal.category
open category_theory
universes v₁ v₂ v₃ u₁ u₂ u₃
open category_theory.category
open category_theory.... |
81d31a60af3674b0a8c6e8cec6b0f751ae72d546 | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /stage0/src/Lean/Meta/IndPredBelow.lean | 96cac7a8cced382bf0acdcdecf721cd3c7aa5ead | [
"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 | 25,821 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Dany Fabian
-/
import Lean.Util.Constructions
import Lean.Meta.Transform
import Lean.Meta.Tactic
import Lean.Meta.Match
import Lean.Meta.Reduce
namespace Lean.Meta.IndPredBelo... |
d9119e8606f5caa0d3f14fa840d69fd905530a55 | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /03_Propositions_and_Proofs.org.10.lean | 3c9f91e50c684cbfa0f4d5450ff5b434932e6cd6 | [] | no_license | cjmazey/lean-tutorial | ba559a49f82aa6c5848b9bf17b7389bf7f4ba645 | 381f61c9fcac56d01d959ae0fa6e376f2c4e3b34 | refs/heads/master | 1,610,286,098,832 | 1,447,124,923,000 | 1,447,124,923,000 | 43,082,433 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 135 | lean | /- page 36 -/
import standard
constants p q : Prop
-- BEGIN
theorem t1 (Hp : p) (Hq : q) : p := Hp
check t1 -- p → q → p
-- END
|
262fcd48763661f43cb0d13b71775a712e6f717a | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/linear_algebra/std_basis.lean | c5ba442c5e529d375ca0c2b98c875411b7ce23d9 | [
"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 | 9,223 | 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 linear_algebra.basic
import linear_algebra.basis
import linear_algebra.pi
/-!
# The standard basis
This file defines the standard basis `std_basis R φ i b j`... |
2fcf59085d42a9ab949aef0f39b239d94a0aeece | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /hott/types/sigma.hlean | a516a9d472c0fd1be85a30a123e362d0dfc41539 | [
"Apache-2.0"
] | permissive | chubbymaggie/lean | 0d06ae25f9dd396306fb02190e89422ea94afd7b | d2c7b5c31928c98f545b16420d37842c43b4ae9a | refs/heads/master | 1,611,313,622,901 | 1,430,266,839,000 | 1,430,267,083,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 16,520 | hlean | /-
Copyright (c) 2014 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: types.sigma
Author: Floris van Doorn
Ported from Coq HoTT
Theorems about sigma-types (dependent sums)
-/
import types.prod
open eq sigma sigma.ops equiv is_equiv
namespace sigma
... |
f08f7ef5ed2b401499eddda4488151fea46fd1dd | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/hom/commute.lean | 5f4ef0a44fc8d7715b51037b4e21571dee49d327 | [
"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 | 813 | lean | /-
Copyright (c) 2018 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Kevin Buzzard, Scott Morrison, Johan Commelin, Chris Hughes,
Johannes Hölzl, Yury Kudryashov
-/
import algebra.hom.group
import algebra.group.commute
/-!
# Multiplic... |
727b1fc44d5a2b5dd0a10f8b5f34872c766fbf20 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/ring_theory/non_zero_divisors.lean | eb3efd03c51e49573a3f6dc49746eef68a0ead1b | [
"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 | 6,644 | lean | /-
Copyright (c) 2020 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Devon Tuma
-/
import group_theory.submonoid.operations
import group_theory.submonoid.membership
/-!
# Non-zero divisors
In this file we define the submonoid `non_zero_divisors... |
f3bd5d0542a69b95eb2bc002e997fb26301af9db | 4727251e0cd73359b15b664c3170e5d754078599 | /src/data/nat/lattice.lean | 2e0578ba30d2147c271a88460119e3ca1e5110b4 | [
"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 | 6,944 | 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, Floris van Doorn, Gabriel Ebner, Yury Kudryashov
-/
import data.nat.enat
import order.conditionally_complete_lattice
/-!
# Conditionally complete linear order structur... |
3a72017a33e1af64d0acc73a5f704998862540ed | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/analysis/special_functions/polynomials.lean | 779b88c4163d8874ab36f3a689dc68d3858b2fbb | [
"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,923 | lean | /-
Copyright (c) 2020 Anatole Dedecker. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anatole Dedecker, Devon Tuma
-/
import analysis.asymptotics.asymptotic_equivalent
import analysis.asymptotics.specific_asymptotics
import data.polynomial.ring_division
/-!
# Limits ... |
5c26b1d5d75ad319d7b6492d2bbc5a27ea2bd22b | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /stage0/src/Init/Data/Char/Basic.lean | 1d4f10c7800fb98b185db9c9eb1b6202898dcaec | [
"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,959 | lean | /-
Copyright (c) 2016 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.UInt
@[inline, reducible] def isValidChar (n : UInt32) : Prop :=
n < 0xd800 ∨ (0xdfff < n ∧ n < 0x110000)
namespace Char
protec... |
c7fdc003333636cd43b28490f51348ebe34dd2bb | 367134ba5a65885e863bdc4507601606690974c1 | /src/ring_theory/unique_factorization_domain.lean | 42749a3cfa8e76df877dce091debf5f499baa670 | [
"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 | 50,269 | 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, Jens Wagemaker, Aaron Anderson
-/
import algebra.gcd_monoid
import ring_theory.integral_domain
import ring_theory.noetherian
/-!
# Unique factorization
## Main Defi... |
f648ea829edf6c728cdad295db3137f1e88ba83a | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/order/compactly_generated.lean | f08caf837ce5a6efd9fe9a4a33bbb4dc81d9f98f | [
"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 | 25,185 | lean | /-
Copyright (c) 2021 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import order.atoms
import order.order_iso_nat
import order.rel_iso.set
import order.sup_indep
import order.zorn
import data.finset.order
import data.set.intervals.order_iso... |
2e67c72f38de7b210021d82ce54e10534a49e402 | 367134ba5a65885e863bdc4507601606690974c1 | /src/data/polynomial/degree/lemmas.lean | 8b6fd89257c3bce0d9b6af23279d2a71cf7f7759 | [
"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,558 | 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.eval
import tactic.interval_cases
/-!
# Theory of degrees of polynomials
Some of the main results... |
20c2729949ca38e242c4f3a3d19b63304e501a0b | 6e36ebd5594a0d512dea8bc6ffe78c71b5b5032d | /src/mywork/Homework/hw4.lean | f05ab13e5538946689318657901ae60b76cfef97 | [] | no_license | wrw2ztk/cs2120f21 | cdc4b1b4043c8ae8f3c8c3c0e91cdacb2cfddb16 | f55df4c723d3ce989908679f5653e4be669334ae | refs/heads/main | 1,691,764,473,342 | 1,633,707,809,000 | 1,633,707,809,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,679 | lean | -- 1
example : 0 ≠ 1 :=
begin
-- ¬ (0 = 1)
-- (0 = 1) → false
assume h,
cases h,
end
-- 2
example : 0 ≠ 0 → 2 = 3 :=
begin
assume h,
have f : false := h (eq.refl 0),
exact false.elim (f),
end
-- 3
example : ∀ (P : Prop), P → ¬¬P :=
begin
assume P,
assume (p : P),
-- ¬¬P
-- ¬P → false
-- (P → ... |
4d7942d7ba4f733c6251e9ab17db6fcf5b60a788 | 1abd1ed12aa68b375cdef28959f39531c6e95b84 | /src/order/locally_finite.lean | 2826a2aeee00e82362b9bac06ab36d1ce6d10ab2 | [
"Apache-2.0"
] | permissive | jumpy4/mathlib | d3829e75173012833e9f15ac16e481e17596de0f | af36f1a35f279f0e5b3c2a77647c6bf2cfd51a13 | refs/heads/master | 1,693,508,842,818 | 1,636,203,271,000 | 1,636,203,271,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 22,107 | 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.preimage
/-!
# Locally finite orders
This file defines locally finite orders.
A locally finite order is an order for which all bounded intervals are... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.