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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
f7b76a185443acffe2c2285adc09c037423f358e | 30b012bb72d640ec30c8fdd4c45fdfa67beb012c | /data/equiv/basic.lean | f88dd9e5bef5c82947ebc7262927fea3e3b14f9d | [
"Apache-2.0"
] | permissive | kckennylau/mathlib | 21fb810b701b10d6606d9002a4004f7672262e83 | 47b3477e20ffb5a06588dd3abb01fe0fe3205646 | refs/heads/master | 1,634,976,409,281 | 1,542,042,832,000 | 1,542,319,733,000 | 109,560,458 | 0 | 0 | Apache-2.0 | 1,542,369,208,000 | 1,509,867,494,000 | Lean | UTF-8 | Lean | false | false | 29,913 | 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
In the standard library we cannot assume the univalence axiom.
We say two types are equivalent if they are isomorphic.
Two equivalent types h... |
c4d86271d498a3a3b609541c8170c57778bb1036 | 0845ae2ca02071debcfd4ac24be871236c01784f | /library/init/lean/declaration.lean | e3e71b91ac998b1c5d7fadcf5f64d6506b2decef | [
"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 | 6,561 | lean | /-
Copyright (c) 2018 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.lean.expr
namespace Lean
/--
Reducibility hints are used in the convertibility checker.
When trying to solve a constraint such a
... |
ebc6119aef58bedfd6a281d4ee17fa61b67d0d3e | bb31430994044506fa42fd667e2d556327e18dfe | /src/topology/algebra/field.lean | 657ca380445ede91710be76a37c4f4269c00e1f6 | [
"Apache-2.0"
] | permissive | sgouezel/mathlib | 0cb4e5335a2ba189fa7af96d83a377f83270e503 | 00638177efd1b2534fc5269363ebf42a7871df9a | refs/heads/master | 1,674,527,483,042 | 1,673,665,568,000 | 1,673,665,568,000 | 119,598,202 | 0 | 0 | null | 1,517,348,647,000 | 1,517,348,646,000 | null | UTF-8 | Lean | false | false | 10,073 | lean | /-
Copyright (c) 2021 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Scott Morrison
-/
import topology.algebra.ring
import topology.algebra.group_with_zero
import topology.local_extr
import field_theory.subfield
/-!
# Topological fields... |
218cf92f98624fd1f5d76d0f51f0495dd861b01c | 82b86ba2ae0d5aed0f01f49c46db5afec0eb2bd7 | /stage0/src/Lean/Message.lean | c35a39f704b9cfa86a9ab40c55dfa8cb7292592a | [
"Apache-2.0"
] | permissive | banksonian/lean4 | 3a2e6b0f1eb63aa56ff95b8d07b2f851072d54dc | 78da6b3aa2840693eea354a41e89fc5b212a5011 | refs/heads/master | 1,673,703,624,165 | 1,605,123,551,000 | 1,605,123,551,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 13,848 | lean | /-
Copyright (c) 2018 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Sebastian Ullrich, Leonardo de Moura
Message Type used by the Lean frontend
-/
import Lean.Data.Position
import Lean.Data.OpenDecl
import Lean.Syntax
import Lean.MetavarContext
... |
b9305c9fa90b1e070b45736d3cd28cf7abf86c41 | 82b86ba2ae0d5aed0f01f49c46db5afec0eb2bd7 | /src/Lean/PrettyPrinter.lean | 56811184a38789fcd2967fcc178c8df5554970a2 | [
"Apache-2.0"
] | permissive | banksonian/lean4 | 3a2e6b0f1eb63aa56ff95b8d07b2f851072d54dc | 78da6b3aa2840693eea354a41e89fc5b212a5011 | refs/heads/master | 1,673,703,624,165 | 1,605,123,551,000 | 1,605,123,551,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,201 | lean | /-
Copyright (c) 2020 Sebastian Ullrich. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
-/
import Lean.Delaborator
import Lean.PrettyPrinter.Parenthesizer
import Lean.PrettyPrinter.Formatter
import Lean.Parser.Module
import Lean.ParserCompiler
namesp... |
849ecf8677cbd92a5e976b9076e6267810b3898c | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /stage0/src/Init/Data/Ord.lean | e5e5f4ea30ad29beb964932bf96f92d5c36d8e0a | [
"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 | 1,894 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Dany Fabian, Sebastian Ullrich
-/
prelude
import Init.Data.Int
import Init.Data.String
inductive Ordering where
| lt | eq | gt
deriving Inhabited, BEq
class Ord (α : Type ... |
027193dab60ef9e4a5849e770094656eaad06ff6 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/analysis/normed_space/extend.lean | 66bfa28a352c46e49f32fd8067ee1021b76d6643 | [
"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 | 6,722 | lean | /-
Copyright (c) 2020 Ruben Van de Velde. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Ruben Van de Velde
-/
import algebra.algebra.restrict_scalars
import data.complex.is_R_or_C
/-!
# Extending a continuous `ℝ`-linear map to a continuous `𝕜`-linear map
In this f... |
34e8b76e446cc71191ce96c066ff6cbf061feaf0 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/topology/bases.lean | 7e03cc8e1e2c5a12c0329657a7ab585502f44221 | [
"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 | 15,158 | 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
Bases of topologies. Countability axioms.
-/
import topology.continuous_on
open set filter classical
open_locale topological_space filter
noncomputable... |
c04b318b9c79b157f40bb7576538adba3a1e045e | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/data/polynomial/div.lean | 0ee1356baca2ed37efb0d5cd55490ebfcd5a1a48 | [
"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 | 21,146 | 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.inductions
import data.polynomial.monic
import ring_theory.multiplicity
/-!
# Division of univaria... |
075a2bc5f8ff9f8bda3da945df2bba57dc30fc6b | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/category_theory/limits/concrete_category.lean | be26475736bd300b20d29d38859d1c30a64a6073 | [
"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 | 12,264 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Adam Topaz
-/
import category_theory.limits.preserves.basic
import category_theory.limits.types
import category_theory.limits.shapes.wide_pullbacks
import category_theo... |
c8ec35c271bcbc43af3318ceb7d2bd44bc80289e | a7602958ab456501ff85db8cf5553f7bcab201d7 | /Exam2/exam2.lean | b7857c49efd38c77ed8cd9facb2d9774e423dc06 | [] | no_license | enlauren/math-logic | 081e2e737c8afb28dbb337968df95ead47321ba0 | 086b6935543d1841f1db92d0e49add1124054c37 | refs/heads/master | 1,594,506,621,950 | 1,558,634,976,000 | 1,558,634,976,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 947 | lean | universe u
-- 1.
#check implies
-- 2.
#check prod
-- 3.
#check fun {a: Type} (x y : a), y
-- 4.
#check Type
-- 5.
def double (x: ℕ): ℕ := x + x
def twice {a: Type u} (f: a → a) (g: a) := f (f g)
#check twice
#reduce twice twice double 2
-- 6.
def fourTimes {a: Type u}: (a → a) → a → a := twice twice
#reduce fourTi... |
ea42757136949b401bdf17b4b00c9257361e31af | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/set_theory/cardinal_ordinal.lean | fae73f40052f13c0a451ca0601d94bb9fbdbfc67 | [
"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 | 36,455 | 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, Floris van Doorn
-/
import set_theory.ordinal_arithmetic
import tactic.linarith
/-!
# Cardinals and ordinals
Relationships between cardinals and ordi... |
5a6adce5adde0132b83eec73526e13f5d9752a1d | 4bcaca5dc83d49803f72b7b5920b75b6e7d9de2d | /src/Lean/PrettyPrinter/Delaborator/Basic.lean | d9612f3f706713a80c0f6732aa8f4eca62c37e55 | [
"Apache-2.0"
] | permissive | subfish-zhou/leanprover-zh_CN.github.io | 30b9fba9bd790720bd95764e61ae796697d2f603 | 8b2985d4a3d458ceda9361ac454c28168d920d3f | refs/heads/master | 1,689,709,967,820 | 1,632,503,056,000 | 1,632,503,056,000 | 409,962,097 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 12,270 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
-/
import Lean.KeyedDeclsAttribute
import Lean.ProjFns
import Lean.Syntax
import Lean.Meta.Match.Match
import Lean.Elab.Term
import Lean.PrettyPrinter.Delabora... |
f33e0a7bee2d553aa32a70b34ace7a83d1ceba47 | e61a235b8468b03aee0120bf26ec615c045005d2 | /stage0/src/Init/Lean/Util/CollectFVars.lean | 040bf9a2c9b3bbf0caa4d95cc41c920af366f652 | [
"Apache-2.0"
] | permissive | SCKelemen/lean4 | 140dc63a80539f7c61c8e43e1c174d8500ec3230 | e10507e6615ddbef73d67b0b6c7f1e4cecdd82bc | refs/heads/master | 1,660,973,595,917 | 1,590,278,033,000 | 1,590,278,033,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,191 | 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
-/
prelude
import Init.Lean.Expr
namespace Lean
namespace CollectFVars
structure State :=
(visitedExpr : ExprSet := {})
(fvarSet : NameSet := {})
i... |
8a4b09eec18e70e31cb83a9190395048e81eee4a | 6e36ebd5594a0d512dea8bc6ffe78c71b5b5032d | /src/mywork/Lectures/lecture_10.lean | 1884974f064e712905fe148c5c7f3390c42fa688 | [] | 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 | 9,215 | lean | /-
In today's class, we'll continue with our
exploration of the proposition, "false",
its elimination rule, and their vital uses
in logical reasoning: especially in
- proof of ¬P by negation
- proof of P by false elimination
Here are the inference rules in display
notation:
NEGATION INTRODUCTION
The first, proof... |
798dbffe95566c5641b24ab3fea01422596c4338 | 618003631150032a5676f229d13a079ac875ff77 | /src/category_theory/limits/functor_category.lean | e4f743eaaec4bb6eec97fdebecdbc45b99971bfa | [
"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 | 4,819 | 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.limits.preserves
open category_theory category_theory.category
namespace category_theory.limits
universes v u -- declare the `v`'s first; se... |
17f3b5452207ecd1c27ff2759bad567d44bc5336 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/analysis/quaternion.lean | c4688009f216bd1a4a032f9408799126a5a67b32 | [
"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 | 3,361 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import algebra.quaternion
import analysis.normed_space.inner_product
/-!
# Quaternions as a normed algebra
In this file we define the following structures on the ... |
f580389b2b4613b3f6b9a7c6256bb21cfd28d531 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/analysis/normed_space/indicator_function_auto.lean | b6655dc0cb70342a538e6103a63a27e9b5a43708 | [] | 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,973 | lean | /-
Copyright (c) 2020 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou, Yury Kudryashov
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.indicator_function
import Mathlib.analysis.normed_space.basic
import Ma... |
f86cae6864b8c0b1f1dd8c46cf0ed6c6b6af104d | 271e26e338b0c14544a889c31c30b39c989f2e0f | /stage0/src/Init/Default.lean | 2b16aeac7ad6e6e85f48fef6fa4ebfe62f33dfce | [
"Apache-2.0"
] | permissive | dgorokho/lean4 | 805f99b0b60c545b64ac34ab8237a8504f89d7d4 | e949a052bad59b1c7b54a82d24d516a656487d8a | refs/heads/master | 1,607,061,363,851 | 1,578,006,086,000 | 1,578,006,086,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 332 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import Init.Core
import Init.Control
import Init.Data.Basic
import Init.Coe
import Init.WF
import Init.Data
import Init.System
import Init.Util
impo... |
18d5ff3d68344e3af535478117d1a7915903b4d1 | e0f9ba56b7fedc16ef8697f6caeef5898b435143 | /test/lint.lean | a12b920ab1f69106a7c01a9c8fdca1c207f43bc2 | [
"Apache-2.0"
] | permissive | anrddh/mathlib | 6a374da53c7e3a35cb0298b0cd67824efef362b4 | a4266a01d2dcb10de19369307c986d038c7bb6a6 | refs/heads/master | 1,656,710,827,909 | 1,589,560,456,000 | 1,589,560,456,000 | 264,271,800 | 0 | 0 | Apache-2.0 | 1,589,568,062,000 | 1,589,568,061,000 | null | UTF-8 | Lean | false | false | 4,300 | lean | import tactic.lint
def foo1 (n m : ℕ) : ℕ := n + 1
def foo2 (n m : ℕ) : m = m := by refl
lemma foo3 (n m : ℕ) : ℕ := n - m
lemma foo.foo (n m : ℕ) : n ≥ n := le_refl n
instance bar.bar : has_add ℕ := by apply_instance -- we don't check the name of instances
lemma foo.bar (ε > 0) : ε = ε := rfl -- >/≥ is allowed in bi... |
a674ca20e0e318ae1eaa7ff5eb67d7c3a860e149 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/algebra/group_power/basic.lean | 3fa7894c8f747921d27c7c5436cdff09c3e0b7da | [
"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 | 14,189 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Robert Y. Lewis
-/
import data.nat.basic
import tactic.monotonicity.basic
import group_theory.group_action.defs
/-!
# Power operations on monoids and groups
The power o... |
19a71a633be16d688346be323a1ab4214b793dcc | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/run/ind7.lean | 39d9d143663a7dbb94f711370b97b5273b459ebf | [
"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 | 192 | lean | namespace list
inductive list (A : Type*) : Type*
| nil : list
| cons : A → list → list
check list.{1}
check list.cons.{1}
check list.rec.{1 1}
end list
check list.list.{1}
|
c0726a196d17ab57f2752d7faf0f243c5a310883 | 5d76f062116fa5bd22eda20d6fd74da58dba65bb | /src/general_lemmas/polynomial_smul_eq_C_mul.lean | 406af09f026d20f0e8d4d7e22e00dfda6e795af2 | [] | no_license | brando90/formal_baby_snark | 59e4732dfb43f97776a3643f2731262f58d2bb81 | 4732da237784bd461ff949729cc011db83917907 | refs/heads/master | 1,682,650,246,414 | 1,621,103,975,000 | 1,621,103,975,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 650 | lean |
import data.polynomial.basic
import data.polynomial.monomial
import data.polynomial.coeff
namespace polynomial
universes u
variables {R : Type u} {a : R} {m n : ℕ}
section semiring
variables [semiring R] {p q : polynomial R}
/-- A scalar multiplication is equivalent to constant polynomial multiplication for polynom... |
4f21e1cf4c60db0be53306a446b4a649c36db384 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /test/interval_cases.lean | 5c9f6074378f2b3534dcb678210fc7e347493242 | [
"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 | 4,518 | 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 tactic.interval_cases
example (n : ℕ) : true :=
begin
success_if_fail { interval_cases n },
trivial
end
example (n : ℕ) (h : 2 ≤ n) : true :=
begin
su... |
06ec7680dba3e6717fcfa8564e562206e707d3d7 | 4a092885406df4e441e9bb9065d9405dacb94cd8 | /src/for_mathlib/sheaves_of_types.lean | f82f0e2ec277327c31d5ba7336ae2f471726066c | [
"Apache-2.0"
] | permissive | semorrison/lean-perfectoid-spaces | 78c1572cedbfae9c3e460d8aaf91de38616904d8 | bb4311dff45791170bcb1b6a983e2591bee88a19 | refs/heads/master | 1,588,841,765,494 | 1,554,805,620,000 | 1,554,805,620,000 | 180,353,546 | 0 | 1 | null | 1,554,809,880,000 | 1,554,809,880,000 | null | UTF-8 | Lean | false | false | 6,137 | lean | -- presheaf of types basics and equivalence
-- written by KB, tidied up by Mario
import topology.opens topology.constructions
universes u v u₁ v₁ u₂ v₂
open topological_space
structure presheaf_of_typesU (X : Type u) [topological_space X] :=
(F : opens X → Type u)
(res : ∀ {U V : opens X} (h : V ≤ U), F U → F V)
(i... |
3ab68e0ce21b40c9bc085cdefd3f854cc290222e | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /test/mk_iff_of_inductive.lean | 0b8b1b6ffc908f7348c3977c784982bce4c3f9e4 | [
"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 | 1,021 | lean | import data.list
import data.list.perm
import data.multiset.basic
mk_iff_of_inductive_prop list.chain test.chain_iff
mk_iff_of_inductive_prop false test.false_iff
mk_iff_of_inductive_prop true test.true_iff
mk_iff_of_inductive_prop nonempty test.non_empty_iff
mk_iff_of_inductive_prop and test.and_iff
... |
a7d920caa08c5e09fa6a1913a8fc528310364ac8 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/category_theory/equivalence.lean | f62e8a6e3ba345c70bff1dd03ed107f948ecfcf3 | [
"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,771 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Tim Baumann, Stephen Morgan, Scott Morrison, Floris van Doorn
-/
import category_theory.fully_faithful
import category_theory.full_subcategory
import category_theory.whiskering
import ... |
4b2234db25c430bc9459686c7f7d21c3e5e1ef55 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/algebraic_topology/cech_nerve.lean | 49f1e00f84407b634a2d2dcb8b1a904aa2fa79c9 | [
"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 | 12,735 | lean | /-
Copyright (c) 2021 Adam Topaz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Adam Topaz
-/
import algebraic_topology.simplicial_object
import category_theory.limits.shapes.wide_pullbacks
import category_theory.arrow
/-!
# The Čech Nerve
This file provides a def... |
4a476cb6663f12ca32cc4f68732f05533bdcafe3 | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/analysis/convex.lean | 4c714bd1316ed774ad7d41cd5c8aeae387ef4c85 | [
"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 | 26,149 | lean | /-
Copyright (c) 2019 Alexander Bentkamp. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Alexander Bentkamp, Yury Kudriashov
-/
import analysis.normed_space.basic
import data.complex.basic
import data.set.intervals
import tactic.interactive
import tactic.linarith
impo... |
a4fb61288f35fe8d790603d5964e36224a31bb32 | 1abd1ed12aa68b375cdef28959f39531c6e95b84 | /src/algebra/lie/matrix.lean | 6dbeec85119c4fb86889e181c6032bdf30246371 | [
"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 | 3,361 | 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 algebra.lie.of_associative
import linear_algebra.matrix.reindex
import linear_algebra.matrix.to_linear_equiv
/-!
# Lie algebras of matrices
An important class of L... |
b66bc504794dbc56f2848e0ad44299c6b89a1228 | 3dc4623269159d02a444fe898d33e8c7e7e9461b | /.github/workflows/project_1_a_decrire/lean-scheme-submission/src/sheaves/presheaf_of_rings_maps.lean | 2a3160653a3cee3339d8be5052d96124eb524f24 | [] | no_license | Or7ando/lean | cc003e6c41048eae7c34aa6bada51c9e9add9e66 | d41169cf4e416a0d42092fb6bdc14131cee9dd15 | refs/heads/master | 1,650,600,589,722 | 1,587,262,906,000 | 1,587,262,906,000 | 255,387,160 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,030 | lean | /-
Continuous maps and presheaves of rings.
https://stacks.math.columbia.edu/tag/008C
-/
import to_mathlib.opens
import sheaves.presheaf_of_rings
import sheaves.stalk_of_rings
import sheaves.presheaf_maps
universes u v w
open topological_space
variables {α : Type u} [topological_space α]
variables {β : Type v}... |
dfcc96967fdf8af6f143b80ab7094ad11ef56d9c | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /tests/lean/run/newfrontend2.lean | 984749b2adc943ec9c285ec1c94afbda12383ce0 | [
"Apache-2.0"
] | permissive | williamdemeo/lean4 | 72161c58fe65c3ad955d6a3050bb7d37c04c0d54 | 6d00fcf1d6d873e195f9220c668ef9c58e9c4a35 | refs/heads/master | 1,678,305,356,877 | 1,614,708,995,000 | 1,614,708,995,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 459 | lean |
def foo {α} (a : Option α) (b : α) : α :=
match a with
| some a => a
| none => b
structure S :=
(x : Nat)
#check if 0 == 1 then true else false
def f (x : Nat) : Nat :=
if x < 5 then x+1 else x-1
def x := 1
#check foo x x
#check match 1 with | x => x + 1
#check match 1 : Int with | x => x + 1
#check match 1 ... |
cb096e2ae1d6ca7070bfb081476dcbdd79cf9b0f | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/pfunctor/univariate/basic.lean | f969ae2c868ff249150ead0f3c36e0dee333422c | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 6,404 | lean | /-
Copyright (c) 2018 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
-/
import data.W.basic
/-!
# Polynomial functors
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding PR to mathlib4.
This file... |
207960d1bde250de66e6c90fc50b85e58194669d | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/number_theory/bernoulli.lean | a88c49a72d98b1a0a6f8f99a05d0caaa4cf65b0f | [
"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 | 16,860 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Kevin Buzzard
-/
import algebra.big_operators.nat_antidiagonal
import algebra.geom_sum
import data.fintype.big_operators
import ring_theory.power_series.well_known
impo... |
17566a4dec80fa5a8e834cf5002163a163fbb93a | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /tests/lean/run/tactic_notation.lean | df3caa5667ab6f18bd4d6ad4c34572cbb88e1c68 | [
"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 | 212 | lean | import logic
theorem tst1 (a b c : Prop) : a → b → a ∧ b :=
begin
intros,
apply and.intro,
assumption
end
theorem tst2 (a b c : Prop) : a → b → a ∧ b :=
by intros; apply and.intro; assumption
|
fb4db660dc1d3e8ad2a8d2ee0aaf7276907fc8b9 | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/tactic/tfae.lean | be57076e49257d36d6291c96b7672cd5e52b28c0 | [
"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 | 4,908 | 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.
-/... |
4c82e8e7016d084f158dfee5e1f4919b53cbd771 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/vector.lean | 5085b635df073e661bffaf50070ec7f2a6adf287 | [
"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 | 4,892 | lean | import logic data.nat.basic data.prod data.unit
open nat prod
inductive vector (A : Type) : nat → Type :=
| vnil {} : vector A zero
| vcons : Π {n : nat}, A → vector A n → vector A (succ n)
namespace vector
-- print definition no_confusion
infixr `::` := vcons
local abbreviation no_confusion := @vector.no_co... |
26fa857ae9fecd758aced543b540328274a56716 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/set/enumerate.lean | 9a47f76a99bdaae8df28e647685a174a97efe6d2 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 2,837 | 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 tactic.wlog
import data.nat.order.basic
/-!
# Set enumeration
This file allows enumeration of sets given a choice function.
The definition does not assume `... |
2952902d9d3488b2f513a54c5822c7f3d5bd85b6 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/number_theory/number_field/embeddings.lean | 21eb1f6a2ca08dc4c1cfa7302a65177700b78c94 | [
"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,054 | lean | /-
Copyright (c) 2022 Xavier Roblot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Alex J. Best, Xavier Roblot
-/
import analysis.normed_space.basic
import number_theory.number_field.basic
import topology.algebra.polynomial
/-!
# Embeddings of number fields
This fil... |
8c9d73ea516335c7d67da12b10f877ebdf24aabd | 618003631150032a5676f229d13a079ac875ff77 | /src/data/fintype/basic.lean | f3217dc45ccba986d49764e57efe396aae172d6b | [
"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 | 41,929 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
Finite types.
-/
import data.finset
import data.array.lemmas
universes u v
variables {α : Type*} {β : Type*} {γ : Type*}
/-- `fintype α` means that `α` is finite, i.e.... |
8b23057a5ff57ef4dac05a297716d02400fad2ea | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tmp/new-frontend/parser/basic.lean | f6c7f0d7cb0779bba597ffdd2e3b400afa5c9ae1 | [
"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 | 9,501 | lean | /-
Copyright (c) 2018 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Sebastian Ullrich
Parser for the Lean language
-/
prelude
import init.lean.parser.parsec init.lean.parser.syntax init.lean.parser.rec
import init.lean.parser.trie
import init.le... |
e7dcea2e453da4a117c17b9c5b942c01a66dfeb9 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/starsAndBars.lean | 97707205c29be1eb8f49ec7743581a80d1307c25 | [
"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,805 | lean | @[simp] def List.count [DecidableEq α] : List α → α → Nat
| [], _ => 0
| a::as, b => if a = b then as.count b + 1 else as.count b
inductive StarsAndBars : Nat → Nat → Type where
| nil : StarsAndBars 0 0
| star : StarsAndBars s b → StarsAndBars (s+1) b
| bar : StarsAndBars s b → StarsAndBars s (b+1)
nam... |
4c202574f09640d76ed81853281f40f0515699f3 | fb3b29254af2d298d934a2ec1bddbb387e5ee67d | /src/cayleys.lean | 22bddbda5c7bb68e67371c3e944acdd340808b30 | [] | no_license | th-char/cayleys_theorem | cdbc48c543184320ae474b27e6d99e4b1c931e69 | c4862adbe1e6a8892fd607217c803f260ee74be2 | refs/heads/master | 1,668,812,911,278 | 1,595,171,637,000 | 1,595,175,437,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,570 | lean | import algebra.group.basic
import data.zmod.basic
import data.equiv.basic
import tactic
import data.set.basic
universes u v
open equiv function set
variables (G : Type u) [group G]
lemma perms_eq_fun_eq {X : Type u} (p : perm X) (q : perm X) (h : p.to_fun = q.to_fun) : p = q :=
begin
apply perm.ext,
intro x,... |
6c00d2991dbe078622b6efd6d4ae43c002b7fbfd | 432d948a4d3d242fdfb44b81c9e1b1baacd58617 | /src/data/nat/fib.lean | 035983a2e08dc387e20947a15ef4e24db82589ca | [
"Apache-2.0"
] | permissive | JLimperg/aesop3 | 306cc6570c556568897ed2e508c8869667252e8a | a4a116f650cc7403428e72bd2e2c4cda300fe03f | refs/heads/master | 1,682,884,916,368 | 1,620,320,033,000 | 1,620,320,033,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,734 | 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 data.stream.basic
import tactic
import data.nat.gcd
/-!
# The Fibonacci Sequence
## Summary
Definition of the Fibonacci sequence `F₀ = 0, F₁ = 1, Fₙ₊₂ = ... |
95eda6cf3dd3e63c87a6d2f7a33b9b92250cec5c | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/data/option/basic.lean | 466066268bde3df3fa64f0353089a74bf237165d | [
"Apache-2.0"
] | permissive | AntoineChambert-Loir/mathlib | 64aabb896129885f12296a799818061bc90da1ff | 07be904260ab6e36a5769680b6012f03a4727134 | refs/heads/master | 1,693,187,631,771 | 1,636,719,886,000 | 1,636,719,886,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 17,317 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import tactic.basic
import logic.is_empty
/-!
# Option of a type
This file develops the basic theory of option types.
If `α` is a type, then `option α` can be unde... |
ad32d78acc8245da19cefcf169439315dbb96d85 | 3863d2564418bccb1859e057bf5a4ef240e75fd7 | /hott/cubical/square.hlean | 901db85dca7aaca330bab2bbbb3658a0784ee949 | [
"Apache-2.0"
] | permissive | JacobGross/lean | 118bbb067ff4d4af48a266face2c7eb9868fa91c | eb26087df940c54337cb807b4bc6d345d1fc1085 | refs/heads/master | 1,582,735,011,532 | 1,462,557,826,000 | 1,462,557,826,000 | 46,451,196 | 0 | 0 | null | 1,462,557,826,000 | 1,447,885,161,000 | C++ | UTF-8 | Lean | false | false | 29,139 | 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₄... |
64751eb2416240d87f90ddd51c5ab3bfe4a769c4 | 367134ba5a65885e863bdc4507601606690974c1 | /src/group_theory/perm/cycles.lean | b0934c36cbc37a044de195fa8e99408c3a6532be | [
"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 | 16,005 | 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 group_theory.perm.sign
/-!
# Cyclic permutations
## Main definitions
In the following, `f : equiv.perm β`.
* `equiv.perm.is_cycle`: `f.is_cycle` when two nonfix... |
b8a6c49d4d4b241f23542917814bdecf40ccc445 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/algebra/regular/pow.lean | 408c719f6ab94c17baba0343b25cbfc43d966a5f | [
"Apache-2.0"
] | permissive | robertylewis/mathlib | 3d16e3e6daf5ddde182473e03a1b601d2810952c | 1d13f5b932f5e40a8308e3840f96fc882fae01f0 | refs/heads/master | 1,651,379,945,369 | 1,644,276,960,000 | 1,644,276,960,000 | 98,875,504 | 0 | 0 | Apache-2.0 | 1,644,253,514,000 | 1,501,495,700,000 | Lean | UTF-8 | Lean | false | false | 2,232 | 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 algebra.group_power.basic
import algebra.regular.basic
import algebra.iterate_hom
/-!
# Regular elements
## Implementation details
Group powers and other defi... |
9615371d1799af96b348164d9cfd89894b408f89 | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /stage0/src/Init/Data/Nat/Gcd.lean | d9f33861250f758837b817634ca8344888fafce4 | [
"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 | 931 | 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
-/
prelude
import Init.Data.Nat.Div
namespace Nat
private def gcdF (x : Nat) : (∀ x₁, x₁ < x → Nat → Nat) → Nat → Nat :=
match x with
| 0 => fun _ y... |
d7581d3703f0d931329d9af01df0825326215073 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Util/FindExpr.lean | 56217625b8898c58c5282f1eaa4392a7cace1403 | [
"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 | 3,085 | 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.Util.PtrSet
namespace Lean
namespace Expr
namespace FindImpl
unsafe abbrev FindM := StateT (PtrSet Expr) Id
@[inline] unsafe... |
5049d3ec29e7a6f119636ff593f7458c2135054e | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/yoneda.lean | 4d6761f2974e89c355a0f9688509760811b12ed2 | [
"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 | 14,393 | 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 category_theory.functor.hom
import category_theory.functor.currying
import category_theory.products.basic
/-!
# The Yoneda embedding
> THIS FILE IS SYNCHRONI... |
0b67585b8a533bb386b2b5fbc0d011aa0f6b3c7b | 947b78d97130d56365ae2ec264df196ce769371a | /tests/lean/run/meta4.lean | dd5322d1ee8c7d89763f445638f6c684f698afd4 | [
"Apache-2.0"
] | permissive | shyamalschandra/lean4 | 27044812be8698f0c79147615b1d5090b9f4b037 | 6e7a883b21eaf62831e8111b251dc9b18f40e604 | refs/heads/master | 1,671,417,126,371 | 1,601,859,995,000 | 1,601,860,020,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,362 | lean | import Lean.Meta
new_frontend
open Lean
open Lean.Meta
def print (msg : MessageData) : MetaM Unit :=
trace! `Meta.debug msg
def checkM (x : MetaM Bool) : MetaM Unit :=
unlessM x $ throwError "check failed"
axiom Ax : forall (α β : Type), α → β → DecidableEq β
set_option trace.Meta.debug true
def tst1 : MetaM Unit ... |
6764d98e67ddebaaf98bd088430c92a9f812b7f7 | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /library/data/list/comb.lean | 0c30467a68c8d0e8eac062ebc72f1c2f4fc9e17d | [
"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 | 13,143 | lean | /-
Copyright (c) 2015 Leonardo de Moura. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: data.list.comb
Authors: Leonardo de Moura
List combinators
-/
import data.list.basic
open nat prod decidable function helper_tactics
namespace list
variables {A B C : Type}
/- map... |
580b67e3176dacd8caa8915bc27c5b96712f7687 | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /library/data/rat/default.lean | b88e6b49af43aa95327c15287a819dd6035e4fa9 | [
"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 | 199 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: data.rat.default
Author: Jeremy Avigad
-/
import .basic
|
a862a7d9f951880754f88b6d704f0ddc8e993fb8 | 54f4ad05b219d444b709f56c2f619dd87d14ec29 | /my_project/src/love13_rational_and_real_numbers_demo.lean | 9a453b73470bdb5fd599c1dcd7b67323d5cf16a4 | [] | 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 | 14,036 | lean | import .lovelib
/- # LoVe Demo 13: Rational and Real Numbers
We review the construction of `ℚ` and `ℝ` as quotient types.
A procedure to construct types with specific properties:
1. Create a new type that can represent all elements, but not necessarily in a
unique manner.
2. Quotient this representation, equat... |
b8fb0fbec7f971a4f4bad659fb75c35e078d08d6 | a7602958ab456501ff85db8cf5553f7bcab201d7 | /Notes/Logic_and_Proof/Chapter9/9.11.lean | 093a9af8f7367bbba34941e0cac1a7cffa276cc8 | [] | no_license | enlauren/math-logic | 081e2e737c8afb28dbb337968df95ead47321ba0 | 086b6935543d1841f1db92d0e49add1124054c37 | refs/heads/master | 1,594,506,621,950 | 1,558,634,976,000 | 1,558,634,976,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,242 | lean | -- 9.1 ...continued
#check nat -- This represents the natural numbers.
#check ℕ -- Same as above.
-- Can use this to prevent name collisions.
namespace hidden
-- Define our terms.
constant mul: ℕ -> ℕ -> ℕ
constant add: ℕ -> ℕ -> ℕ
constant square: ℕ -> ℕ
-- Define some formulas.
constant even: ℕ -> Prop
constant... |
a02d0bcc02a3eb352f61054a182d660a653764fb | 947b78d97130d56365ae2ec264df196ce769371a | /tests/lean/run/structuralRec1.lean | 743536237d6aa68c43b570c0954f1759eeb39ab5 | [
"Apache-2.0"
] | permissive | shyamalschandra/lean4 | 27044812be8698f0c79147615b1d5090b9f4b037 | 6e7a883b21eaf62831e8111b251dc9b18f40e604 | refs/heads/master | 1,671,417,126,371 | 1,601,859,995,000 | 1,601,860,020,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,254 | lean | new_frontend
def map {α β} (f : α → β) : List α → List β
| [] => []
| a::as => f a :: map f as
theorem ex1 : map Nat.succ [1] = [2] :=
rfl
theorem ex2 : map Nat.succ [] = [] :=
rfl
theorem ex3 (a : Nat) : map Nat.succ [a] = [Nat.succ a] :=
rfl
theorem ex4 {α β} (f : α → β) (a : α) (as : List α) : map f (a::as) ... |
bc1339f657bbc005e18e711ecee50d6f9ee89643 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/combinatorics/simple_graph/subgraph.lean | 26f9e133b1290d8518cc8d05baeeb1fb1acb90a2 | [
"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 | 13,623 | lean | /-
Copyright (c) 2021 Hunter Monroe. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hunter Monroe, Kyle Miller, Alena Gusakov
-/
import combinatorics.simple_graph.basic
/-!
# Subgraphs of a simple graph
A subgraph of a simple graph consists of subsets of the graph's ... |
c68cf52b63149bb2392f021f9f51d760f1049fd7 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/order/lexicographic.lean | b2da732226a5dec372a9e107fd99930aeb7dc8bd | [
"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 | 8,539 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Minchao Wu
-/
import tactic.basic
/-!
# Lexicographic order
This file defines the lexicographic relation for pairs and dependent pairs of orders, partial orders
and l... |
89b633fb7af5696d0507450214583a382aaea0c2 | 94637389e03c919023691dcd05bd4411b1034aa5 | /src/inClassNotes/type_library/sum.lean | a208579b7cda8e7aec24783c4f682ef186045299 | [] | 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 | 145 | lean | namespace hidden
universe u
inductive sum (α β : Type u) : Type u
| inl (a : α) : sum
| inr (b : β) : sum
end hidden
#check sum nat Type |
13192da36ac80d01b0d48d988241e356d9b5db73 | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/combinatorics/simple_graph/degree_sum.lean | be8db2653e04b90165698eec453bd8ba7f580ca5 | [
"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 | 8,327 | lean | /-
Copyright (c) 2020 Kyle Miller. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kyle Miller
-/
import combinatorics.simple_graph.basic
import algebra.big_operators.basic
import data.nat.parity
import data.zmod.parity
/-!
# Degree-sum formula and handshaking lemma
T... |
960579292c1fa639b0a6cdd1c965f87c940166ec | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/adjunction/lifting.lean | 09d5006af78151422d8466e89427e045e7231a09 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,937 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.category_theory.limits.shapes.equalizers
import Mathlib.category_theory.limits.shapes.reflexive... |
cedda641a487e6df55a7594e3f396ec70460fe0b | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /tests/lean/acc_rec_bug.lean | 57dcdb9806fd37ee15578e3d5b1bfba80f0edd89 | [
"Apache-2.0"
] | permissive | codyroux/lean | 7f8dff750722c5382bdd0a9a9275dc4bb2c58dd3 | 0cca265db19f7296531e339192e9b9bae4a31f8b | refs/heads/master | 1,610,909,964,159 | 1,407,084,399,000 | 1,416,857,075,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 845 | lean | import logic.prop
inductive acc {A : Type} (R : A → A → Prop) : A → Prop :=
intro : ∀x, (∀ y, R y x → acc R y) → acc R x
variables {A : Type} (R : A → A → Prop) (C : A → Type) (x₁ : A) (ac : ∀y, R y x₁ → acc R y)
variable F : Πx, (Πy, R y x → C y) → C x
eval @acc.rec A R C (λ (x₂ : A)
(ac : ∀y, R y x... |
02248267680a2735f63514f701df1bc14a62c254 | ec62863c729b7eedee77b86d974f2c529fa79d25 | /20/a.lean | 8532e0de1933ecf3908d646f5846b0500a85c1b0 | [] | no_license | rwbarton/advent-of-lean-4 | 2ac9b17ba708f66051e3d8cd694b0249bc433b65 | 417c7e2718253ba7148c0279fcb251b6fc291477 | refs/heads/main | 1,675,917,092,057 | 1,609,864,581,000 | 1,609,864,581,000 | 317,700,289 | 24 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,759 | lean | import Std.Data.HashMap
open Std
@[reducible] def Bits := UInt32
structure OrientedPiece where
-- bits read from left to right or top to bottom in big-endian order
left : Bits
right : Bits
top : Bits
bottom : Bits
instance : ToString OrientedPiece where
toString p := s!"{p.left} - {p.right} {p.top} | {... |
c22875c2f81edfd311f59c46d31e72a98e06881c | 1e3a43e8ba59c6fe1c66775b6e833e721eaf1675 | /src/ring_theory/adjoin_root.lean | 20876bba0cd13a3cf83bb4a5cd12c2259163664b | [
"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 | 4,194 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Chris Hughes
Adjoining roots of polynomials
-/
import data.polynomial
import ring_theory.principal_ideal_domain
/-!
# Adjoining roots of polynomials
This file define... |
1c80e4bb7b98c93a5866a23d60990b30946c27a8 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/algebra/pointwise.lean | b02edee980f1213f46202f0920fd439e24e70113 | [
"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 | 56,636 | lean | /-
Copyright (c) 2019 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Floris van Doorn
-/
import algebra.big_operators.basic
import algebra.module.basic
import data.finset.preimage
import data.set.finite
import group_theory.submonoid.basi... |
1ffc1a5a84fe032266fbc78591e62b00d2036c7e | 5fbbd711f9bfc21ee168f46a4be146603ece8835 | /lean/natural_number_game/proposition/1.lean | 912ba2589d49a95d399fe911f7b882677e296a6d | [
"LicenseRef-scancode-warranty-disclaimer"
] | no_license | goedel-gang/maths | 22596f71e3fde9c088e59931f128a3b5efb73a2c | a20a6f6a8ce800427afd595c598a5ad43da1408d | refs/heads/master | 1,623,055,941,960 | 1,621,599,441,000 | 1,621,599,441,000 | 169,335,840 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 73 | lean | example (P Q : Prop) (p : P) (h : P → Q) : Q :=
begin
exact h p,
end
|
b9a05554bac53d628419c7725914cc36f3152766 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/list/range.lean | 74b19b0880d7c984272690d06e6f6d59c7f03b2d | [] | 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,349 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Kenny Lau, Scott Morrison
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.list.chain
import Mathlib.data.list.nodup
import Mathlib.da... |
9f47a7f85e4dd18782bac0daa1eeb1902734a3c5 | 10c7c971a1902d76057c52ce0529ebb491a69c44 | /ProblemSheet1.lean | 372fcae6b1dfc878c27991c9f806bb8a3bcadc6a | [] | no_license | SzymonKubica/Lean | 5f6122e8dd9171239b36a9ce0515f6acbc49781a | 627bff2f001ba3f009c112c9332093e8de84863c | refs/heads/main | 1,675,563,490,768 | 1,608,538,609,000 | 1,608,538,609,000 | 307,184,347 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,568 | lean | /- Math40001 : Introduction to university mathematics.
Problem Sheet 1, October 2020.
-/
/- Question 1.
Let P and Q be Propositions (that is, true/false statements).
Prove that P ∨ Q → Q ∨ P.
-/
import tactic
lemma question_one (P Q : Prop) : P ∨ Q → Q ∨ P :=
begin
intro hPorQ,
cases hPorQ with hP hQ,
right... |
d25af14ddfa76816192da4b6e418da13368b5eff | bb31430994044506fa42fd667e2d556327e18dfe | /src/geometry/euclidean/angle/oriented/right_angle.lean | 52462e99f46d811a833e749686e4d0fc04d48d30 | [
"Apache-2.0"
] | permissive | sgouezel/mathlib | 0cb4e5335a2ba189fa7af96d83a377f83270e503 | 00638177efd1b2534fc5269363ebf42a7871df9a | refs/heads/master | 1,674,527,483,042 | 1,673,665,568,000 | 1,673,665,568,000 | 119,598,202 | 0 | 0 | null | 1,517,348,647,000 | 1,517,348,646,000 | null | UTF-8 | Lean | false | false | 45,544 | lean | /-
Copyright (c) 2022 Joseph Myers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Joseph Myers
-/
import geometry.euclidean.angle.oriented.affine
import geometry.euclidean.angle.unoriented.right_angle
/-!
# Oriented angles in right-angled triangles.
This file proves... |
cfa3e51a5eeb0a37c6a1e06058314125f5f0fd02 | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/algebra/group_power/lemmas.lean | b10adb48ee8c07fa59af9f80f06fcdf3ef7a1572 | [
"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 | 35,261 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Robert Y. Lewis
-/
import algebra.group_power.basic
import algebra.invertible
import algebra.opposites
import data.list.basic
import data.int.cast
import data.equiv.basic... |
1d5cd1dd323b012cff94d3d517c2897dd0626cce | b9a81ebb9de684db509231c4469a7d2c88915808 | /src/super/cdcl.lean | 1981d26da693a071df960cffa612a919fce214b5 | [] | no_license | leanprover/super | 3dd81ce8d9ac3cba20bce55e84833fadb2f5716e | 47b107b4cec8f3b41d72daba9cbda2f9d54025de | refs/heads/master | 1,678,482,996,979 | 1,676,526,367,000 | 1,676,526,367,000 | 92,215,900 | 12 | 6 | null | 1,513,327,539,000 | 1,495,570,640,000 | Lean | UTF-8 | Lean | false | false | 862 | lean | /-
Copyright (c) 2017 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner
-/
import .clause .clausifier .cdcl_solver
open tactic expr monad super
meta def cdcl_t (th_solver : tactic unit) : tactic unit := do
as_refutation, local_false ← target,... |
256499b3ffc2d0305327ef2ba6955da5e78949c3 | f3849be5d845a1cb97680f0bbbe03b85518312f0 | /library/tools/super/superposition.lean | 4c4280a31bc63166313b66ffb59a8d66cb28d418 | [
"Apache-2.0"
] | permissive | bjoeris/lean | 0ed95125d762b17bfcb54dad1f9721f953f92eeb | 4e496b78d5e73545fa4f9a807155113d8e6b0561 | refs/heads/master | 1,611,251,218,281 | 1,495,337,658,000 | 1,495,337,658,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,862 | lean | /-
Copyright (c) 2016 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner
-/
import .clause .prover_state .utils
open tactic monad expr
namespace super
def position := list ℕ
meta def get_rwr_positions : expr → list position
| (app a b) := [[... |
c03bf82985ddd7484b853eae25fd3a0480c43b45 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/linear_algebra/eigenspace.lean | fc117cb26b704d0087c99a587ea39b900bc6590e | [
"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 | 24,106 | lean | /-
Copyright (c) 2020 Alexander Bentkamp. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Alexander Bentkamp.
-/
import field_theory.algebraic_closure
import linear_algebra.finsupp
import linear_algebra.matrix
/-!
# Eigenvectors and eigenvalues
This file defines eigen... |
9f25bd2d436cd194b8bc1c1488c63612dc192b6e | 4fa161becb8ce7378a709f5992a594764699e268 | /src/algebra/linear_ordered_comm_group_with_zero.lean | 860b906e2cee3ef8156069f65a7d67be4f762ecf | [
"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 | 4,240 | lean | /-
Copyright (c) 2020 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Johan Commelin, Patrick Massot
-/
import algebra.ordered_group
import algebra.group_with_zero
/-!
# Linearly ordered commutative groups with a zero element adjoined
This file ... |
d9e9925d6317db2e9da334e73d60071acf57ce66 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/measure_theory/integral/interval_integral.lean | 70addaba8b80cfc2db1881549007f444c917df34 | [
"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 | 136,713 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov, Patrick Massot, Sébastien Gouëzel
-/
import analysis.normed_space.dual
import data.set.intervals.disjoint
import measure_theory.measure.haar_lebesgue
import ana... |
119aee038fe0376a945f6cefabd527ca51d5f623 | ddf69e0b8ad10bfd251aa1fb492bd92f064768ec | /src/field_theory/minimal_polynomial.lean | 3e615846e0ad4bf97e0cf729a99d4486593608bb | [
"Apache-2.0"
] | permissive | MaboroshiChan/mathlib | db1c1982df384a2604b19a5e1f5c6464c7c76de1 | 7f74e6b35f6bac86b9218250e83441ac3e17264c | refs/heads/master | 1,671,993,587,476 | 1,601,911,102,000 | 1,601,911,102,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,502 | lean | /-
Copyright (c) 2019 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Johan Commelin
-/
import ring_theory.integral_closure
import data.polynomial.field_division
/-!
# Minimal polynomials
This file defines the minimal polynomial of an eleme... |
4138b929fad6c5aaee19cdc26385df75c4912d84 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/linear_algebra/linear_pmap.lean | 0151edba7d05144eab1b032269a2aa5b447de413 | [
"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 | 29,603 | lean | /-
Copyright (c) 2020 Yury Kudryashov All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov, Moritz Doll
-/
import linear_algebra.basic
import linear_algebra.prod
/-!
# Partially defined linear maps
A `linear_pmap R E F` or `E →ₗ.[R] F` is a linear map from ... |
339da99f62a435d8099f271efa9a337d07cc0fcb | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/lie/nilpotent.lean | 6d4b290ac18164dfede5226c91f3088c8b0d2fcd | [
"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 | 27,844 | 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 algebra.lie.solvable
import algebra.lie.quotient
import algebra.lie.normalizer
import linear_algebra.eigenspace.basic
import ring_theory.nilpotent
/-!
# Nilpotent L... |
ac01680b53b3d8e10bab76734168ddc2d9f6e767 | 4bcaca5dc83d49803f72b7b5920b75b6e7d9de2d | /stage0/src/Lean/Elab/DefView.lean | 91d7de14d3afe902cef4a10c1edd3d02341e76b7 | [
"Apache-2.0"
] | permissive | subfish-zhou/leanprover-zh_CN.github.io | 30b9fba9bd790720bd95764e61ae796697d2f603 | 8b2985d4a3d458ceda9361ac454c28168d920d3f | refs/heads/master | 1,689,709,967,820 | 1,632,503,056,000 | 1,632,503,056,000 | 409,962,097 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,161 | 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... |
8d7c0dfac6016b62912428c4cadf8808274edcec | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/ring_theory/algebraic.lean | 1bf5d63677a2995206d494a8126edefce8728337 | [
"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 | 13,030 | lean | /-
Copyright (c) 2019 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import linear_algebra.finite_dimensional
import ring_theory.integral_closure
import data.polynomial.integral_normalization
/-!
# Algebraic elements and algebraic ex... |
e82d4bfdd1bad10082810272cad05585fe036ce7 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/category_theory/limits/shapes/equalizers.lean | f1a0c606ef6b2adc03390b9ff807307dfa2f4cfd | [
"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 | 29,869 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Markus Himmel
-/
import category_theory.epi_mono
import category_theory.limits.limits
/-!
# Equalizers and coequalizers
This file defines (co)equalizers as special ca... |
975d0ef5aabb1c56d5dd61de279942019b1d5cab | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/lean/1363.lean | 543a6db5e99efc9d7f8bfd2a88abe39a4a8cb86f | [
"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 | 512 | lean | import Lean.Data.Parsec
open Lean Parsec
@[macroInline] -- Error
def f : Nat → Nat
| 0 => 0
| n + 1 => f n
@[macroInline] -- Error
def g : Nat → Nat
| 0 => 0
| n + 1 => g n
termination_by g x => x
@[macroInline] -- Error
def h : Nat → Nat → Nat
| 0, _ => 0
| n + 1, m => h n m
termination_by h x y => x
@... |
851c5000bd4ffc959a0b584b0df28362942df104 | de91c42b87530c3bdcc2b138ef1a3c3d9bee0d41 | /expressions/time_series/geom3d_expr.lean | 01259d06ac12287e955eb8d16cd412961d59401d | [] | no_license | kevinsullivan/lang | d3e526ba363dc1ddf5ff1c2f36607d7f891806a7 | e9d869bff94fb13ad9262222a6f3c4aafba82d5e | refs/heads/master | 1,687,840,064,795 | 1,628,047,969,000 | 1,628,047,969,000 | 282,210,749 | 0 | 1 | null | 1,608,153,830,000 | 1,595,592,637,000 | Lean | UTF-8 | Lean | false | false | 25,854 | lean | --import ....phys.geom.geom3d
import ..geom3d_expr
--import .....phys.series.geom3d
import ..time_expr
import ......phys.geom.geom3d
import ......phys.time_series.geom3d
namespace lang.series.geom3d
universes u
open lang.geom3d
open lang.time
variables {fr : time_frame_expr} (ts : time_space_expr fr)
structure t... |
d48f792dc82e3a91179fbc42a592e7807d8b6d02 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/number_theory/cyclotomic/rat.lean | b7f1fdd8223741e99083d2c4409027254a20cbf9 | [
"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 | 13,651 | lean | /-
Copyright (c) 2022 Riccardo Brasca. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Riccardo Brasca
-/
import number_theory.cyclotomic.discriminant
import ring_theory.polynomial.eisenstein.is_integral
/-!
# Ring of integers of `p ^ n`-th cyclotomic fields
We gather... |
b2271045d6a8c5f6c4096b7dab65284895954ea6 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/955.lean | a4169f7bc976afecafc6b6411ad5c2b968120be2 | [
"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 | 34,597 | lean | -*- mode: compilation; default-directory: "~/projects/lean/tests/lean/run/" -*-
Compilation started at Thu Feb 4 14:53:07
/home/leo/projects/lean/bin/lean -Dpp.width=120 /home/leo/projects/lean/tests/lean/run/955.lean
/home/leo/projects/lean/tests/lean/run/955.lean:31:32: error: type mismatch at definition 'append_a... |
4a9bddd8bfeeaab4ca4852ee357dc46c25c55fd7 | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /stage0/src/Lean/Meta.lean | 5d453b3a1095cbe1a2eeaf8ed5d7f8ece8764c13 | [
"Apache-2.0"
] | permissive | collares/lean4 | 861a9269c4592bce49b71059e232ff0bfe4594cc | 52a4f535d853a2c7c7eea5fee8a4fa04c682c1ee | refs/heads/master | 1,691,419,031,324 | 1,618,678,138,000 | 1,618,678,138,000 | 358,989,750 | 0 | 0 | Apache-2.0 | 1,618,696,333,000 | 1,618,696,333,000 | null | UTF-8 | Lean | false | false | 995 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Meta.Basic
import Lean.Meta.LevelDefEq
import Lean.Meta.WHNF
import Lean.Meta.InferType
import Lean.Meta.FunInfo
import Lean.Meta.ExprDefEq
impo... |
5ec90a55ca2e1110d2c012722e0d8c78afbc9f80 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/439.lean | d50a96ba50732f6b02479b965459d3f6942a82ff | [
"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 | 770 | lean | universe u
structure Fn (E I : Sort u) := (exp : E) (imp : I)
instance (E I : Sort u) : CoeFun (Fn E I) (fun _ => I) := {coe := fun K => K.imp}
class Bar.{w} (P : Sort u) :=
fn : P -> Sort w
variable {P : Sort u} (B : Bar P)
variable (fn : Fn ((p : P) -> B.fn p) ({p : P} -> B.fn p))
#check (@fn : {p : P} → Bar.fn... |
6c17df5c87beaa7d6a4ac1ee5828c9ccbd316f25 | f5f7e6fae601a5fe3cac7cc3ed353ed781d62419 | /src/analysis/normed_space/operator_norm.lean | a847a757148a1ebf794bba609c4b2b45f1b2d0fe | [
"Apache-2.0"
] | permissive | EdAyers/mathlib | 9ecfb2f14bd6caad748b64c9c131befbff0fb4e0 | ca5d4c1f16f9c451cf7170b10105d0051db79e1b | refs/heads/master | 1,626,189,395,845 | 1,555,284,396,000 | 1,555,284,396,000 | 144,004,030 | 0 | 0 | Apache-2.0 | 1,533,727,664,000 | 1,533,727,663,000 | null | UTF-8 | Lean | false | false | 7,468 | lean | /-
Copyright (c) 2019 Jan-David Salchow. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jan-David Salchow, Sébastien Gouëzel
The space of bounded linear maps
Define the set of bounded linear maps between normed spaces and show basic facts about it. In
particular
(*)... |
ed904f0a83ca0a73bf4f99f3f3bf1fe4833c8026 | de91c42b87530c3bdcc2b138ef1a3c3d9bee0d41 | /old/eval/geometryEval.lean | 42b57a7fd52b85ac282ce9a58efb5470d3b09fe3 | [] | no_license | kevinsullivan/lang | d3e526ba363dc1ddf5ff1c2f36607d7f891806a7 | e9d869bff94fb13ad9262222a6f3c4aafba82d5e | refs/heads/master | 1,687,840,064,795 | 1,628,047,969,000 | 1,628,047,969,000 | 282,210,749 | 0 | 1 | null | 1,608,153,830,000 | 1,595,592,637,000 | Lean | UTF-8 | Lean | false | false | 2,471 | lean | import ..imperative_DSL.environment
open lang.euclideanGeometry3
attribute [reducible]
def euclideanGeometry3Eval : lang.euclideanGeometry3.spaceExpr → environment.env → euclideanGeometry3
| (lang.euclideanGeometry3.spaceExpr.lit V) i := V
| (lang.euclideanGeometry3.spaceExpr.var v) i := i.g.sp v
attribute [reducib... |
f77a229052a88c419c06959ce2de6e669ec36763 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/well_founded_tactics.lean | f4fbe7b94b21cd5e3d67c6c53ebc92d8f7dac209 | [
"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 | 397 | lean | variables {α : Type} {lt : α → α → Prop} [decidable_rel lt]
def merge : list α → list α → list α
| [] l' := l'
| l [] := l
| (a :: l) (b :: l') := if lt a b then a :: merge l (b :: l') else b :: merge (a :: l) l'
def foo : Π (s : ℕ), ℕ
| 0 := 1
| (nat.succ s) := foo s + 1
using_well_founded... |
5c4bb3b37a1778f50818cfc8881aba03eca6735c | 1dd0001f48991684032999e18f88be3ece4261d7 | /src/instructor/review_9_13_1.lean | f0690d70efd2bbaf2e33d735b7cd09175edc0c8d | [] | no_license | rayouness/cs2120f21 | e0a3fa89a6ac50c8a83e85bd7795a2710aceb7e2 | 5dfa57f111ec7f322474be1c87992fe1fedd6610 | refs/heads/main | 1,690,957,987,242 | 1,632,333,173,000 | 1,632,333,173,000 | 399,947,440 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 854 | lean |
axioms (P Q : Prop)
def if_P_is_true_then_so_is_Q : Prop := P → Q
axiom p: P
-- assume P is true
-- assume we have a proof of P (p)
axiom pq : P → Q
-- assume that we have a proof, pq, of P → Q
--intro for implies : assume premise , show conclusion
-- elimination rule for implies:
#check pq
#check p
#check (p... |
404b96823ed82b10767b33636735f44c4f995f73 | b328e8ebb2ba923140e5137c83f09fa59516b793 | /stage0/src/Lean/Elab/SyntheticMVars.lean | 009890033c0a751d5fd97353c4daffeb7c9544f4 | [
"Apache-2.0"
] | permissive | DrMaxis/lean4 | a781bcc095511687c56ab060e816fd948553e162 | 5a02c4facc0658aad627cfdcc3db203eac0cb544 | refs/heads/master | 1,677,051,517,055 | 1,611,876,226,000 | 1,611,876,226,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 15,494 | 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... |
ff251bd5c780f2fd057ccdf7be8cbc6a2569c698 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/probability/conditional_probability.lean | d790fe4a5720814ed6cd55767b70edad09c85f6d | [
"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 | 6,661 | lean | /-
Copyright (c) 2022 Rishikesh Vaishnav. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Rishikesh Vaishnav
-/
import measure_theory.measure.measure_space
/-!
# Conditional Probability
This file defines conditional probability and includes basic results relating to i... |
8b562a861c866d817ac8d6b5a2acf496291b3853 | 96338d06deb5f54f351493a71d6ecf6c546089a2 | /priv/Lean/Pi.lean | 6ead88eafd4712bec7267e33c9df5f299b7a57c9 | [] | no_license | silky/exe | 5f9e4eea772d74852a1a2fac57d8d20588282d2b | e81690d6e16f2a83c105cce446011af6ae905b81 | refs/heads/master | 1,609,385,766,412 | 1,472,164,223,000 | 1,472,164,223,000 | 66,610,224 | 1 | 0 | null | 1,472,178,919,000 | 1,472,178,919,000 | null | UTF-8 | Lean | false | false | 628 | lean | /- Pi.lean -/
namespace EXE
universe variable a
universe variable b
constant ImperdicativePi : Π {A : Type.{a}}, (A → Type.{b}) → Type.{b}
abbreviation ℿ {A : Type.{a}} := @ImperdicativePi A
definition Sigma := λ (A: Type),
λ (B: A -> Type),
∀ (DepProd: Type),
... |
d22288044bef1beb5de7629cbf83fc6826b16314 | 59a4b050600ed7b3d5826a8478db0a9bdc190252 | /src/category_theory/tactics/obviously.lean | 06a45a4a625058715fcf9b591f0b53d6d07b76a5 | [] | no_license | rwbarton/lean-category-theory | f720268d800b62a25d69842ca7b5d27822f00652 | 00df814d463406b7a13a56f5dcda67758ba1b419 | refs/heads/master | 1,585,366,296,767 | 1,536,151,349,000 | 1,536,151,349,000 | 147,652,096 | 0 | 0 | null | 1,536,226,960,000 | 1,536,226,960,000 | null | UTF-8 | Lean | false | false | 1,074 | lean | import category_theory.functor_category
import category_theory.natural_transformation
import category_theory.products
import category_theory.types
import category_theory.isomorphism
import category_theory.embedding
import tidy.tidy
open category_theory
attribute [search] category.id_comp category.comp_id category.ass... |
bd054079c9fdd11431e0fa44c496ab0da549320a | 3f7026ea8bef0825ca0339a275c03b911baef64d | /src/data/padics/padic_norm.lean | f41c688820c03161f110d297f374639f84ccc437 | [
"Apache-2.0"
] | permissive | rspencer01/mathlib | b1e3afa5c121362ef0881012cc116513ab09f18c | c7d36292c6b9234dc40143c16288932ae38fdc12 | refs/heads/master | 1,595,010,346,708 | 1,567,511,503,000 | 1,567,511,503,000 | 206,071,681 | 0 | 0 | Apache-2.0 | 1,567,513,643,000 | 1,567,513,643,000 | null | UTF-8 | Lean | false | false | 17,029 | lean | /-
Copyright (c) 2018 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
-/
import data.rat algebra.gcd_domain algebra.field_power
import ring_theory.multiplicity tactic.ring
import data.real.cau_seq
import tactic.norm_cast
/-!
# p-adic n... |
f22d3eab931e50b7d621f56db54d2208fe50e60a | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/ring_theory/subring.lean | 2c1e19537707260aed97f28b2876fe3da9f539af | [
"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 | 29,729 | lean | /-
Copyright (c) 2020 Ashvni Narayanan. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors : Ashvni Narayanan
-/
import group_theory.subgroup
import ring_theory.subsemiring
/-!
# Subrings
Let `R` be a ring. This file defines the "bundled" subring type `subring R`, a type... |
f8a6787669f979eedc7c43cff323ad1dc26082a9 | 32da3d0f92cab08875472ef6cacc1931c2b3eafa | /src/set_theory/ordinal_arithmetic.lean | 0ca44c40fa746ffb875d2a38fae1c347191c5ac4 | [
"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 | 69,921 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
-/
import set_theory.ordinal
/-!
# Ordinal arithmetic
Ordinals have an addition (corresponding to disjoint union) that turns them into an additive
monoid, and a multipl... |
405cdd53131f600f601b6fd7b1a814bf7492a4e9 | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/algebra/polynomial/group_ring_action.lean | 179304517553f5b20d85838a8e5b333d63dad735 | [
"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 | 5,359 | lean | /-
Copyright (c) 2020 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import data.polynomial.monic
import algebra.group_ring_action
import algebra.group_action_hom
/-!
# Group action on rings applied to polynomials
This file contains instances ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.