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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
3d6d6e27029244a8d1ab1656bfd16fe0cafb2b54 | c213e436cb87414954d055137f2a847a9674d7d2 | /src/topology/algebra/module.lean | e6edbba9c463928e0d4c4a786207bfd7c755a238 | [
"Apache-2.0"
] | permissive | dsanjen/mathlib | 642d270c3d209cfdfb097c2ddc9dd36c102fae9f | a3844c85c606acca5922408217d55891b760fad6 | refs/heads/master | 1,606,199,308,451 | 1,576,274,676,000 | 1,576,274,676,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 13,441 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jan-David Salchow, Sébastien Gouëzel, Jean Lo
Theory of topological modules and continuous linear maps.
-/
import topology.algebra.ring linear_algebra.basic ring_theory.algebra
o... |
638c5a10cc63b8bc7edf2b5f35ab2fa9d3479b34 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/number_theory/ADE_inequality.lean | 70c27658b9f50e5e6fd1d8dbbb9c8c3d0300c674 | [
"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 | 7,695 | lean | /-
Copyright (c) 2021 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import data.multiset.sort
import data.pnat.basic
import data.rat.order
import tactic.norm_num
import tactic.field_simp
import tactic.interval_cases
/-!
# The ineq... |
e68dbca6ed3806a751b973df20badbc82e2c236e | 4e3bf8e2b29061457a887ac8889e88fa5aa0e34c | /lean/love07_metaprogramming_exercise_sheet.lean | 70bf1f431cb116f938dd8bc2018378a04868335d | [] | no_license | mukeshtiwari/logical_verification_2019 | 9f964c067a71f65eb8884743273fbeef99e6503d | 16f62717f55ed5b7b87e03ae0134791a9bef9b9a | refs/heads/master | 1,619,158,844,208 | 1,585,139,500,000 | 1,585,139,500,000 | 249,906,380 | 0 | 0 | null | 1,585,118,728,000 | 1,585,118,727,000 | null | UTF-8 | Lean | false | false | 6,560 | lean | /- LoVe Exercise 7: Metaprogramming -/
import .lovelib
namespace LoVe
open expr
open tactic
/- Question 1: A Term Exploder -/
/- In this exercise, we develop a string format for the `expr` metatype. By
default, there is no `has_repr` instance to print a nice string. For
example: -/
#eval (expr.app (expr.var 0) (... |
3099349152bc407f626afe2ab21821ee90b000fc | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/tactic/simpa.lean | fd1f1b1efc4a41c51675dccd5b3f1c4a54243406 | [
"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 | 2,410 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import tactic.doc_commands
open interactive
open interactive.types
namespace tactic
namespace interactive
open expr lean.parser
local postfix `?`:9001 := optional
... |
8f96ca52e96b3dae8bb8409aba7aa0ff648192f8 | ac60dab17014edd769c9618cc1569ce8c960a6a5 | /src/wireworld.lean | 2d6f000f357d80ded5f5dc3c14e38776680e5909 | [
"MIT"
] | permissive | frankSil/CAExtensions | 20e1f856b3ad775d5e8dc8877614dbcd58c77901 | f5c74fd9a806696c73497d9abd45b7315f45379f | refs/heads/master | 1,608,706,941,607 | 1,586,193,337,000 | 1,586,193,337,000 | 237,077,434 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,759 | lean | import cautomaton utils data.vector
open utils
namespace ww
section ww
inductive cellT | empty | ehead | etail | condu
open cellT
def cellT_str : cellT → string
| empty := " "
| ehead := "H"
| etail := "T"
| condu := "X"
instance cellT_to_str : has_to_string cellT := ⟨cellT_str⟩
instance cellT_r... |
6d1357d5d3126acdc5f9182361dc8e5b936476d9 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/category_theory/monoidal/Mod.lean | 1ac72705788c97178419b4ab7a22b43b8f43445f | [
"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,625 | 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.monoidal.Mon_
/-!
# The category of module objects over a monoid object.
-/
universes v₁ v₂ u₁ u₂
open category_theory
open category_theory.... |
f41c569e9c585169041081a8744195157f70fd06 | 07c76fbd96ea1786cc6392fa834be62643cea420 | /hott/init/path.hlean | ba71d51d520e249534761aa405dfd5caf51b444d | [
"Apache-2.0"
] | permissive | fpvandoorn/lean2 | 5a430a153b570bf70dc8526d06f18fc000a60ad9 | 0889cf65b7b3cebfb8831b8731d89c2453dd1e9f | refs/heads/master | 1,592,036,508,364 | 1,545,093,958,000 | 1,545,093,958,000 | 75,436,854 | 0 | 0 | null | 1,480,718,780,000 | 1,480,718,780,000 | null | UTF-8 | Lean | false | false | 32,674 | hlean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Jakob von Raumer, Floris van Doorn
Ported from Coq HoTT
-/
prelude
import .function .tactic
open function eq
/- Path equality -/
namespace eq
variables {A ... |
6cbeb501ec5bae7e0d5da8369ffe0c8dfaa04f7a | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/data/equiv/basic.lean | 7e5d634856317b7625dac0d94adb3812b2abcfb7 | [
"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 | 100,370 | 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.set.function
import data.sigma.basic
/-!
# Equivalence between types
In this file we define two types:
* `equiv α β` a.k.a. `... |
7b3132a7f73a3e14c0f48df24a8fb65692e7ef6d | 5e3548e65f2c037cb94cd5524c90c623fbd6d46a | /src_icannos_totilas/applications_lineaires/cpge_applin_1_b.lean | 5424ff269158d295ffda245560fbdd8f224c490f | [] | no_license | ahayat16/lean_exos | d4f08c30adb601a06511a71b5ffb4d22d12ef77f | 682f2552d5b04a8c8eb9e4ab15f875a91b03845c | refs/heads/main | 1,693,101,073,585 | 1,636,479,336,000 | 1,636,479,336,000 | 415,000,441 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 292 | lean | import algebra.module.linear_map
import data.real.basic
def f (x y z : ℝ) : ℝ := x-z
theorem cpge_applin_1_b [module ℝ (prod ℝ (prod ℝ ℝ))] [E : set (prod ℝ ℝ)]:
∃ g : (linear_map ℝ (prod ℝ (prod ℝ ℝ)) ℝ),
∀ x y z : ℝ , (f x y z) = (g (x, y, z)) := sorry |
c9dd00a2468cde66be8f2b5fee1b36f3fe953b55 | 534c92d7322a8676cfd1583e26f5946134561b54 | /src/Exercises/01_Propositions/Q0104/S0004.lean | 815d208107ef34ed4b4ddbd3d67041a478488523 | [
"Apache-2.0"
] | permissive | kbuzzard/mathematics-in-lean | 53f387174f04d6077f434e27c407aee9425837f7 | 3fad7bb7e888dabef94921101af8671b78a4304a | refs/heads/master | 1,586,812,457,439 | 1,546,893,744,000 | 1,546,893,744,000 | 163,450,734 | 8 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 77 | lean | theorem P_implies_P (P : Prop) : P → P :=
begin
intro HP,
exact HP
end
|
6a9de4851d4156d6e0743b9d158f863ce1e38877 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/limits/preserves/opposites.lean | 915b9945217fcb91f96f04198bcbc21ef643bc4e | [
"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 | 12,112 | lean | /-
Copyright (c) 2022 Markus Himmel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel
-/
import category_theory.limits.opposites
import category_theory.limits.preserves.finite
/-!
# Limit preservation properties of `functor.op` and related constructions
>... |
fc093b9efef48d4fe3707ded6bf39ee264f0224d | 32025d5c2d6e33ad3b6dd8a3c91e1e838066a7f7 | /tests/lean/run/parseCore.lean | 6c0461937934dbd4afe53a59b6a0de15ef4f0a91 | [
"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 | 325 | lean | import Lean.Parser
def test : IO Unit :=
if System.Platform.isWindows then
pure () -- TODO investigate why the following doesn't work on Windows
else do
env ← Lean.mkEmptyEnvironment;
_ ← Lean.Parser.parseFile env (System.mkFilePath ["..", "..", "..", "src", "Init", "Core.lean"]);
IO.println "done"
#eval test... |
eb718a7a3e5c957ce92a029fbbfa37b849282ddc | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /src/Lean/Message.lean | 96ffd51627a21769ab741f3340a6e08bd1d7965d | [
"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 | 14,037 | 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
... |
935224d05454bf3f53bcb7073d528dc4dd5ce1ca | 4727251e0cd73359b15b664c3170e5d754078599 | /archive/sensitivity.lean | b0dfa141ff98a3652eb0643693e31a9745386661 | [
"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 | 15,649 | lean | /-
Copyright (c) 2019 Reid Barton, Johan Commelin, Jesse Han, Chris Hughes, Robert Y. Lewis,
Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Reid Barton, Johan Commelin, Jesse Han, Chris Hughes, Robert Y. Lewis, Patrick Massot
-/
import tactic.fin_cases... |
88a76034575a3ab4d51c2ea3532265383b91f108 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/tactic/lint/simp.lean | ff19f6d4d16dc75dc54c64e1742bed320640d6a0 | [
"Apache-2.0"
] | permissive | dupuisf/mathlib | 62de4ec6544bf3b79086afd27b6529acfaf2c1bb | 8582b06b0a5d06c33ee07d0bdf7c646cae22cf36 | refs/heads/master | 1,669,494,854,016 | 1,595,692,409,000 | 1,595,692,409,000 | 272,046,630 | 0 | 0 | Apache-2.0 | 1,592,066,143,000 | 1,592,066,142,000 | null | UTF-8 | Lean | false | false | 9,342 | lean | /-
Copyright (c) 2020 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner
-/
import tactic.lint.basic
/-!
# Linter for simplification lemmas
This files defines several linters that prevent common mistakes when declaring simp lemmas:
* `simp_... |
6be123a10fd0cf81cbaaca778260095494e5f173 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/lean/1102.lean | 260b8f35cab64016c082c4524cb9ff6aaa272549 | [
"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 | 860 | lean | class cls12 := (u12 : Unit)
class cls11 extends cls12 := (u11 : Unit)
class cls10 extends cls11 := (u10 : Unit)
class cls9 extends cls10 := (u9 : Unit)
class cls8 extends cls9 := (u8 : Unit)
class cls7 extends cls8 := (u7 : Unit)
class cls6 extends cls7 := (u6 : Unit)
class cls5 extends cls6 := (u5 : Unit)
class cls4 e... |
a3bd86a6bc460752194cd3c3308fb563a6fc16bd | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /src/linear_algebra/matrix/nonsingular_inverse.lean | ae99bc0223b634cbecef3b618a7e71623ed9fd07 | [
"Apache-2.0"
] | permissive | dexmagic/mathlib | ff48eefc56e2412429b31d4fddd41a976eb287ce | 7a5d15a955a92a90e1d398b2281916b9c41270b2 | refs/heads/master | 1,693,481,322,046 | 1,633,360,193,000 | 1,633,360,193,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 30,134 | lean | /-
Copyright (c) 2019 Tim Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Tim Baanen, Lu-Ming Zhang
-/
import algebra.associated
import algebra.regular.smul
import linear_algebra.matrix.polynomial
import tactic.linarith
import tactic.ring_exp
/-!
# Nonsingular ... |
d5614dc9511fe7ec98ed3e11163789d282a71caa | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/group_theory/subsemigroup/membership.lean | 8a67a43ff7ea38ce9b7d302b3958fd6dabe79ea4 | [
"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 | 4,885 | lean | /-
Copyright (c) 2022 Jireh Loreaux. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jireh Loreaux
-/
import group_theory.subsemigroup.operations
/-!
# Subsemigroups: membership criteria
In this file we prove various facts about membership in a subsemigroup.
The inten... |
0d521b65836ec4c74704749cf0d87cc48a99d492 | 2c096fdfecf64e46ea7bc6ce5521f142b5926864 | /tests/lean/run/1852.lean | 868f079fdb4ef5eb97889270f50f10c91d7aafe8 | [
"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 | Kha/lean4 | 1005785d2c8797ae266a303968848e5f6ce2fe87 | b99e11346948023cd6c29d248cd8f3e3fb3474cf | refs/heads/master | 1,693,355,498,027 | 1,669,080,461,000 | 1,669,113,138,000 | 184,748,176 | 0 | 0 | Apache-2.0 | 1,665,995,520,000 | 1,556,884,930,000 | Lean | UTF-8 | Lean | false | false | 95 | lean | class foo (F : Type) where
foo : F
class foobar (F : outParam Type) [foo F] where
bar : F
|
5592ac89983457757d6557d190edf777097d2cdd | d0f9af2b0ace5ce352570d61b09019c8ef4a3b96 | /exam_2/predicate_logic/rules_of_reasoning.lean | 2e79a009bb31de3691269bf4b0b584a5dcc9663f | [] | no_license | jngo13/Discrete-Mathematics | 8671540ef2da7c75915d32332dd20c02f001474e | bf674a866e61f60e6e6d128df85fa73819091787 | refs/heads/master | 1,675,615,657,924 | 1,609,142,011,000 | 1,609,142,011,000 | 267,190,341 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,473 | lean |
axiom P : Prop
axiom Q : Prop
axiom R : Prop
-->> def true_intro : pExp := pTrue
#check true -- a type
#check true.intro -- a constructor (value)
#print true
-- true is a proposition
-- in Lean represented as a type
-- intro is defined to be a proof of it (a value)
-- because there is proof, we judge the pr... |
2e86f3a427f94932eceb47415bc0f65e5515d8f2 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/run/app_builder_tac1.lean | 9e54fbc0d19e1915019deeb25a131ebb84d0e9a4 | [
"Apache-2.0"
] | permissive | GaloisInc/lean | aa1e64d604051e602fcf4610061314b9a37ab8cd | f1ec117a24459b59c6ff9e56a1d09d9e9e60a6c0 | refs/heads/master | 1,592,202,909,807 | 1,504,624,387,000 | 1,504,624,387,000 | 75,319,626 | 2 | 1 | Apache-2.0 | 1,539,290,164,000 | 1,480,616,104,000 | C++ | UTF-8 | Lean | false | false | 544 | lean | open tactic list nat name
set_option trace.app_builder true
set_option pp.all true
meta definition mk_ite (c a b : expr) : tactic expr :=
mk_mapp `ite [some c, none, none, some a, some b]
example (a b : nat) : nat :=
by do a ← get_local `a,
b ← get_local `b,
mk_app `has_add.add [a, b] >>= trace,
mk... |
70dee6904636f0e2ee3efc2ce1defba4bee15c44 | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /12_Axioms.org.2.lean | 7943d4d6a490ac382f8fcb5c90659e83fd4038d7 | [] | 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 | 346 | lean | import standard
namespace hide
axiom propext {a b : Prop} : (a ↔ b) → a = b
-- BEGIN
section
open eq.ops
variables a b c d e : Prop
variable P : Prop → Prop
example (H : a ↔ b) : (c ∧ a ∧ d → e) ↔ (c ∧ b ∧ d → e) :=
propext H ▸ !iff.refl
example (H : a ↔ b) (H1 : P a) : P b :=
propext H ▸ H1
end
-- END
end hide
|
be74106544376fa59923c44f466a91c84ad0389f | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/lean/run/dotNameIssue.lean | df334dcacf15a5cff2a759b94da3b7a1372fb4ad | [
"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 | 167 | lean | example : x ≠ y → x ∉ [y] :=
fun hne hin =>
match hin with
| .head _ _ => hne rfl
example : x ≠ y → x ∉ [y] :=
fun hne (.head _ _) => hne rfl
|
4674e6be612f4e4827386d492f630a7c02f10d7e | 947b78d97130d56365ae2ec264df196ce769371a | /tests/lean/run/meta6.lean | bf3ddd841a6dac8ced083e483a67476fa8c9f66e | [
"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,525 | 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"
def nat := mkConst `Nat
def boolE := mkConst `Bool
def succ := mkConst `Nat.succ
def zero := mkConst `Nat.z... |
588c610418d0b71e17c1668a57eeb695887593c3 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/subexpr.lean | 4b6848f3a9e14bccda17741defdc2fc0f76da8cc | [
"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 | 623 | lean | import Lean
open Lean.SubExpr
def ps := [#[], #[0], #[1], #[0,1], #[1,0] , #[0,0], #[1,2,3]]
theorem Pos.roundtrip :
true = ps.all fun x => x == (Pos.toArray <| Pos.ofArray <| x)
:= by native_decide
theorem Pos.append_roundtrip :
true = (List.all
(ps.bind fun p => ps.map fun q => (p,q))
(fun (x,y) => (x... |
0a05e6be9660864ad0d8d51da85626b077496c6c | fe84e287c662151bb313504482b218a503b972f3 | /src/algebra/linmap.lean | ddb363c4e7299709d2ad6d9ff8a37f10e816d142 | [] | no_license | NeilStrickland/lean_lib | 91e163f514b829c42fe75636407138b5c75cba83 | 6a9563de93748ace509d9db4302db6cd77d8f92c | refs/heads/master | 1,653,408,198,261 | 1,652,996,419,000 | 1,652,996,419,000 | 181,006,067 | 4 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 726 | lean | /- Experiments with coercion of linear maps to maps -/
import data.rat.basic linear_algebra.basic
section zog
parameters {V : Type} [add_comm_group V] [module ℚ V]
def f : V →ₗ[ℚ] V :=
{ to_fun := λ (v : V), v,
map_add' := λ (v w : V), rfl,
map_smul' := λ (c : ℚ) (v : V), rfl }
#check linear_map.map_add'
#... |
f88c9ce560e9f02ba3870795e84e53fe1998b2c0 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/lean/run/structInst.lean | be33fdd452bb170a6e412738b35650176214f006 | [
"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 | 1,025 | lean | namespace Ex1
structure A :=
(x : Nat)
structure B extends A :=
(y : Nat := x + 2) (x := y + 1)
structure C extends B :=
(z : Nat) (x := z + 10)
end Ex1
namespace Ex2
structure A :=
(x : Nat) (y : Nat)
structure B extends A :=
(z : Nat := x + 1) (y := z + x)
end Ex2
namespace Ex3
structure A :=
(x : Nat)
str... |
1eaf7178a4028aa89570100691c5a6a1e68b8ed1 | 9b9a16fa2cb737daee6b2785474678b6fa91d6d4 | /src/data/zmod/quadratic_reciprocity.lean | d95ada6ad26caa231db30723c88f294727868248 | [
"Apache-2.0"
] | permissive | johoelzl/mathlib | 253f46daa30b644d011e8e119025b01ad69735c4 | 592e3c7a2dfbd5826919b4605559d35d4d75938f | refs/heads/master | 1,625,657,216,488 | 1,551,374,946,000 | 1,551,374,946,000 | 98,915,829 | 0 | 0 | Apache-2.0 | 1,522,917,267,000 | 1,501,524,499,000 | Lean | UTF-8 | Lean | false | false | 32,128 | 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 field_theory.finite data.zmod.basic algebra.pi_instances
open function finset nat finite_field zmodp
namespace zmodp
variables {p q : ℕ} (hp : nat.prime p) (hq ... |
d6c79baa95ca938618cc7d2a1ee0aeb98e3ad555 | acc85b4be2c618b11fc7cb3005521ae6858a8d07 | /analysis/topology/infinite_sum.lean | f94f574ecf0b2d82f00baff6d51d72a2eccc81a0 | [
"Apache-2.0"
] | permissive | linpingchuan/mathlib | d49990b236574df2a45d9919ba43c923f693d341 | 5ad8020f67eb13896a41cc7691d072c9331b1f76 | refs/heads/master | 1,626,019,377,808 | 1,508,048,784,000 | 1,508,048,784,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 20,205 | 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
Infinite sum over a topological monoid
This sum is known as unconditionally convergent, as it sums to the same value under all possible
permutations. For Euclidean spa... |
1b36bd10713d19263e0e9262a9a5e6360ae489f7 | 947b78d97130d56365ae2ec264df196ce769371a | /tests/lean/run/match1.lean | e61b2b9a309ea78635344763b9b5360bf850d081 | [
"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 | 3,263 | lean | new_frontend
def f (xs : List Nat) : List Bool :=
xs.map fun
| 0 => true
| _ => false
#eval f [1, 2, 0, 2]
theorem ex1 : f [1, 0, 2] = [false, true, false] :=
rfl
#check f
def g (xs : List Nat) : List Bool :=
xs.map $ by {
intro
| 0 => exact true
| _ => exact false
}
theorem ex2 : g [1, 0, 2] = [fal... |
4a88afca2476180e72b0ddded9a3ce55ba08caa0 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/order/initial_seg.lean | 2d3ef20adcc9de56b7ea7ee09664821ab2c0a4f7 | [
"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 | 19,669 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Floris van Doorn
-/
import order.rel_iso.set
import order.well_founded
/-!
# Initial and principal segments
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes ... |
213dfc58259ee92658a26866abb1f9d9dbc7d359 | 2c819623a83d8c53b7282622429e344389ce4030 | /proofs/thm1.lean | c4807f00c8b1b63578ebb54921f8c2b87567400a | [] | no_license | uw-unsat/jitsynth | 6bc97dd1ede9da42c0b9313a4766095345493adc | 69529e18d4a8d4dace884bfde91aa26b549523fa | refs/heads/master | 1,653,802,737,129 | 1,588,361,732,000 | 1,588,361,732,000 | 260,513,113 | 14 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 21,563 | lean | import tactic
import tactic.find
import tactic.core
import .lib
import .util.nat
import .util.list
namespace jitsynth
-- If starting PC is too big,
-- Result of run is the starting state
lemma run_big_pc :
∀ m : arm,
∀ p : list cinstr,
∀ σ : state,
∀ T : cinstr → state → state,
∀ φ : ℕ,
p.length ≤ σ.pc →... |
aef1164064d7895da9cc521b48aeb5be03e62491 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/subobject/limits.lean | 08e559e0c2913697d0a964de43d3c7827612dfc2 | [
"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 | 17,697 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta, Scott Morrison
-/
import category_theory.subobject.lattice
/-!
# Specific subobjects
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a cor... |
d871226c654236c71bf546fa39e5f473902a6ce1 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/logic/relation_auto.lean | 680dcf3cc34325f0923edc88b3d5b2e93584d416 | [] | 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 | 13,812 | 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
Transitive reflexive as well as reflexive closure of relations.
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.tactic.basic
import Mathli... |
3936b583343c9ea42346782d36547b748d847480 | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /src/group_theory/subgroup.lean | 73ba1a31b2a54d3508a2b844b455c918f0f7814a | [
"Apache-2.0"
] | permissive | kmill/mathlib | ea5a007b67ae4e9e18dd50d31d8aa60f650425ee | 1a419a9fea7b959317eddd556e1bb9639f4dcc05 | refs/heads/master | 1,668,578,197,719 | 1,593,629,163,000 | 1,593,629,163,000 | 276,482,939 | 0 | 0 | null | 1,593,637,960,000 | 1,593,637,959,000 | null | UTF-8 | Lean | false | false | 38,774 | 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
/-!
# Subgroups
This file defines multiplicative and additive subgroups as an extension of submonoids, in a bundled
form (unbundled subgroup... |
9787a161773f3db382273e487258a2df5786f864 | 7a0854479980a89e813e3c93d127f09a8e2c3a7e | /src/group/level01_extended.lean | 51693b836e13cdf4de8fdd4a8298b447c341850c | [] | no_license | cfbolz/group-theory-game | 020e382df58bf9a510dce38304f27400e4ef0b80 | b5282ce72a2a22e9ba1b48cee432ff3d77496040 | refs/heads/master | 1,668,643,052,237 | 1,594,820,769,000 | 1,594,820,769,000 | 279,899,736 | 0 | 0 | null | 1,594,825,474,000 | 1,594,825,473,000 | null | UTF-8 | Lean | false | false | 4,982 | lean | import group.theorems -- definition of a group and a comm_group
/-
class group (G : Type) extends has_group_notation G :=
(mul_assoc : ∀ (a b c : G), a * b * c = a * (b * c))
(one_mul : ∀ (a : G), 1 * a = a)
(mul_left_inv : ∀ (a : G), a⁻¹ * a = 1)
and `comm_group G` has the extra axiom
`mul_comm : ∀ (x y : G), x * y... |
530b4dcf7380232e39a93b233e62d1f2a67cda3e | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/data/fin/basic.lean | 69ba83256b4af0e94dc8fede1a6f0de98a869b1a | [
"Apache-2.0"
] | permissive | ramonfmir/mathlib | c5dc8b33155473fab97c38bd3aa6723dc289beaa | 14c52e990c17f5a00c0cc9e09847af16fabbed25 | refs/heads/master | 1,661,979,343,526 | 1,660,830,384,000 | 1,660,830,384,000 | 182,072,989 | 0 | 0 | null | 1,555,585,876,000 | 1,555,585,876,000 | null | UTF-8 | Lean | false | false | 65,007 | lean | /-
Copyright (c) 2017 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis, Keeley Hoek
-/
import tactic.apply_fun
import data.nat.cast
import order.rel_iso
import tactic.localized
/-!
# The finite type with `n` elements
`fin n` is the type... |
d78450c230c5de31ed1862a3d2cd818624376aac | 3f7026ea8bef0825ca0339a275c03b911baef64d | /src/ring_theory/power_series.lean | 2f74c5bd1cb0911cb655164ce380eb0b2a363d1b | [
"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 | 38,628 | lean | /-
Copyright (c) 2019 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Kenny Lau
-/
import data.finsupp order.complete_lattice algebra.ordered_group data.mv_polynomial
import algebra.order_functions
import ring_theory.ideal_operations
/-... |
1d5a10b5da576d3cd727d3095c77eefc4c51521a | aa5a655c05e5359a70646b7154e7cac59f0b4132 | /stage0/src/Lean/Meta/Basic.lean | 23828299e46b9e3f487cbbbe60407c5df8a988c8 | [
"Apache-2.0"
] | permissive | lambdaxymox/lean4 | ae943c960a42247e06eff25c35338268d07454cb | 278d47c77270664ef29715faab467feac8a0f446 | refs/heads/master | 1,677,891,867,340 | 1,612,500,005,000 | 1,612,500,005,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 44,153 | 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.Data.LOption
import Lean.Environment
import Lean.Class
import Lean.ReducibilityAttrs
import Lean.Util.Trace
import Lean.Util.RecDepth
import Lea... |
25a0da9f52488cc7523052cf0a6322241cb52510 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/multiset/range.lean | b9959669106ca02037669fab16229ea906e4c800 | [
"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 | 1,835 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.multiset.basic
import data.list.range
/-! # `multiset.range n` gives `{0, 1, ..., n-1}` as a multiset.
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4... |
7769f8b52f529526ce89fab74c3fb8b857e5fe4f | 32317185abf7e7c963f4c67c190aec61af6b3628 | /hott/types/int/basic.hlean | c004028b672eafd3fc677e1fed62faf723f037c7 | [
"Apache-2.0"
] | permissive | Andrew-Zipperer-unorganized/lean | 198a2317f21198cd8d26e7085e484b86277f17f7 | dcb35008e1474a0abebe632b1dced120e5f8c009 | refs/heads/master | 1,622,526,520,945 | 1,453,576,559,000 | 1,454,612,842,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 25,905 | hlean | /-
Copyright (c) 2014 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Jeremy Avigad
The integers, with addition, multiplication, and subtraction. The representation of the integers is
chosen to compute efficiently.
To faciliate prov... |
9c919c33fe402cd1fa34ee8a968fddc50da09dff | f5f7e6fae601a5fe3cac7cc3ed353ed781d62419 | /src/tactic/ring.lean | 0bfe3e6667afc35410fc2456b65e26ebd70faa1a | [
"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 | 18,877 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
Evaluate expressions in the language of (semi-)rings.
Based on http://www.cs.ru.nl/~freek/courses/tt-2014/read/10.1.1.61.3041.pdf .
-/
import algebra.group_power tactic... |
b8aa7fd43cf38687e859efff40aeb0e3a12a268a | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/dlist/instances.lean | eb0587f9f079b114e7a6b62b37f6f137cc0c79aa | [] | 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 | 963 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
Traversable instance for dlists.
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.Lean3Lib.data.dlist
import Mathlib.control.traversable.equiv
im... |
daae701e8b58c958d71eb6eb2dfcfecbbd191bd5 | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/order/zorn.lean | 01c0fb0f68152daf9b24eb966967f34f2be52eed | [
"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 | 12,392 | 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
Zorn's lemmas.
Ported from Isabelle/HOL (written by Jacques D. Fleuriot, Tobias Nipkow, and Christian Sternagel).
-/
import data.set.lattice
noncomputable theory
univ... |
49c19b2e66006d8645912e348b9d69d9e1b8ab29 | ad0c7d243dc1bd563419e2767ed42fb323d7beea | /tactic/auto_cases.lean | b9dc07bf81f67935aa5f6f2dbb9ff0b7ce41df94 | [
"Apache-2.0"
] | permissive | sebzim4500/mathlib | e0b5a63b1655f910dee30badf09bd7e191d3cf30 | 6997cafbd3a7325af5cb318561768c316ceb7757 | refs/heads/master | 1,585,549,958,618 | 1,538,221,723,000 | 1,538,221,723,000 | 150,869,076 | 0 | 0 | Apache-2.0 | 1,538,229,323,000 | 1,538,229,323,000 | null | UTF-8 | Lean | false | false | 1,591 | 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 logic.basic
import tactic.basic
import data.option
open tactic
meta def auto_cases_at (h : expr) : tactic string :=
do t' ← infer_type h,
t' ← whnf t',... |
ed94ecc20821c9afc9510f0503b9b645e8de31ae | f1a12d4db0f46eee317d703e3336d33950a2fe7e | /dlo/dlo.lean | f5b22eeb6da348ef88619b0954e4a522b45ddbe4 | [
"Apache-2.0"
] | permissive | avigad/qelim | bce89b79c717b7649860d41a41a37e37c982624f | b7d22864f1f0a2d21adad0f4fb3fc7ba665f8e60 | refs/heads/master | 1,584,548,938,232 | 1,526,773,708,000 | 1,526,773,708,000 | 134,967,693 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 13,018 | lean | import ..common.ldeq
variables {α β : Type}
class dlo (α : Type) extends decidable_linear_order α :=
(inh : α)
(btw : ∀ {x z : α}, x < z → ∃ (y : α), x < y ∧ y < z)
(blw : ∀ (y : α), ∃ (x : α), x < y)
(abv : ∀ (x : α), ∃ (y : α), x < y)
open dlo
inductive adlo : Type
| lt : nat → nat → adlo
| eq : nat → nat → adlo... |
c342b1f15e2929cf180ec547e8cc15ef4517eaaf | 8eeb99d0fdf8125f5d39a0ce8631653f588ee817 | /src/linear_algebra/char_poly/coeff.lean | 354e825166be1f3979f6d110c9b4740810f12dfe | [
"Apache-2.0"
] | permissive | jesse-michael-han/mathlib | a15c58378846011b003669354cbab7062b893cfe | fa6312e4dc971985e6b7708d99a5bc3062485c89 | refs/heads/master | 1,625,200,760,912 | 1,602,081,753,000 | 1,602,081,753,000 | 181,787,230 | 0 | 0 | null | 1,555,460,682,000 | 1,555,460,682,000 | null | UTF-8 | Lean | false | false | 9,307 | lean | /-
Copyright (c) 2020 Aaron Anderson, Jalex Stark. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Aaron Anderson, Jalex Stark.
-/
import data.matrix.char_p
import linear_algebra.char_poly
import linear_algebra.matrix
import ring_theory.polynomial.basic
import algebra.p... |
5870d9b4a13759e0aa1756c1251f7dee4500523a | 737dc4b96c97368cb66b925eeea3ab633ec3d702 | /tests/lean/conv1.lean | b94e7193cf8a2fc4ddf5d640e79903a704f8fed1 | [
"Apache-2.0"
] | permissive | Bioye97/lean4 | 1ace34638efd9913dc5991443777b01a08983289 | bc3900cbb9adda83eed7e6affeaade7cfd07716d | refs/heads/master | 1,690,589,820,211 | 1,631,051,000,000 | 1,631,067,598,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,711 | lean | set_option pp.analyze false
def p (x y : Nat) := x = y
example (x y : Nat) : p (x + y) (y + x + 0) := by
conv =>
whnf
congr
. skip
. whnf; skip
traceState
rw [Nat.add_comm]
rfl
example (x y : Nat) : p (x + y) (y + x + 0) := by
conv =>
whnf
rhs
whnf
traceState
rw [Nat.add_com... |
b34f14843533d37a8d6d71bc07b9434c406c29d2 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/ring_theory/polynomial/symmetric.lean | 33310236e4642314ab91f58ad5fa08d280de9235 | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 8,189 | lean | /-
Copyright (c) 2020 Hanting Zhang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hanting Zhang, Johan Commelin
-/
import data.fintype.card
import data.mv_polynomial.rename
import data.mv_polynomial.comm_ring
import algebra.algebra.subalgebra.basic
/-!
# Symmetric P... |
27746bcd93c78a9424a7435983cd46acbfd5ffd8 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/parsing_only.lean | 8af35f38ad0b264bc1688a336f2223f35168976e | [
"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 | 192 | lean | --
constant f : nat → nat
constant g : nat → nat
notation a `+++` := f a
notation [parsing_only] a `***` := g a
#check 10 +++
#check 10 ***
#check Type.{8} -- Type₊ should not be used
|
afd1d79f2169d8505fc64161192c1713e788146c | 7bf54883c04ff2856c37f76a79599ceb380c1996 | /non-mathlib/quadratic_extension.lean | 48438ea64e9a85707cc0e164f8043e167a4badb5 | [] | no_license | anonymousLeanDocsHosting/lean-polynomials | 4094466bf19acc0d1a47b4cabb60d8c21ddb2b00 | 361ef4cb7b68ef47d43b85cfa2d13f2ea0a47613 | refs/heads/main | 1,691,112,899,935 | 1,631,819,522,000 | 1,631,819,522,000 | 405,448,439 | 0 | 2 | null | null | null | null | UTF-8 | Lean | false | false | 4,978 | lean | import field_definition
import field_results
import numbers
inductive item_plus_sqrt (f : Type) [myfld f] (rt : f) : Type
| ips : f -> f -> item_plus_sqrt
open item_plus_sqrt
def ips_zero (f : Type) [myfld f] (rt : f) : (item_plus_sqrt f rt) := ips myfld.zero myfld.zero
def ips_add (f : Type) [myfld f] (rt : f) : ... |
d08ee8222971c3f1c6a01af51410b1b6787b4b02 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/measure_theory/constructions/borel_space/complex.lean | de7034d99a04238322bbec1e6c2e087b3823be64 | [
"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 | 790 | 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 analysis.complex.basic
import measure_theory.constructions.borel_space.basic
/-! # Equip `ℂ` with the Borel sigma-algebra
> THIS FILE IS SYNCHRONIZED WITH... |
477cbf1766dde216c53a373b1047d93c35b59912 | 5ae26df177f810c5006841e9c73dc56e01b978d7 | /src/category_theory/limits/cones.lean | dc82ec1473f73e83eb3d68f201a352e893dc0723 | [
"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 | 16,153 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Stephen Morgan, Scott Morrison, Floris van Doorn
-/
import category_theory.const
import category_theory.yoneda
import category_theory.concrete_category
import category_theory.equivalen... |
19359d25ed00dd21b707e61e3df117c1a6fa6e62 | ba4794a0deca1d2aaa68914cd285d77880907b5c | /src/game/world7/level10.lean | e3829f6006b6ed6c11baecbc3d4270c7f1803696 | [
"Apache-2.0"
] | permissive | ChrisHughes24/natural_number_game | c7c00aa1f6a95004286fd456ed13cf6e113159ce | 9d09925424da9f6275e6cfe427c8bcf12bb0944f | refs/heads/master | 1,600,715,773,528 | 1,573,910,462,000 | 1,573,910,462,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,353 | lean | import game.world6.level8 -- hide
import tactic.tauto
local attribute [instance, priority 10] classical.prop_decidable -- hide
/-
# Advanced proposition world.
## Level 10: `exfalso` and proof by contradiction.
It's certainly true that $(P\land(\lnot P)\implies Q$ for any propositions $P$
and $Q$, because the left... |
8af1bbc69b06260da2d249144421132f45ee090b | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebra/category/Module/images.lean | 77d0c29fcb4409940b5b12a325254d97b7805372 | [
"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 | 3,734 | lean | /-
Copyright (c) 2022 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import algebra.category.Module.abelian
import category_theory.limits.shapes.images
import category_theory.limits.types
/-!
# The category of R-modules has images.
N... |
b6e4c300490fc6e61c02c9840f229c2a5523768b | 618003631150032a5676f229d13a079ac875ff77 | /docs/tutorial/Zmod37.lean | c8168af6ee4f4b2d3e7ba4e3bdef0262bd9afc1c | [
"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 | 8,109 | lean | /- Integers mod 37
A demonstration of how to use equivalence relations and equivalence classes in Lean.
We define the "congruent mod 37" relation on integers, prove it is an equivalence
relation, define Zmod37 to be the equivalence classes, and put a ring structure on
the quotient.
-/
-- this import is helpf... |
57b96836193393d1710766690d4c7fc8c551a145 | 9028d228ac200bbefe3a711342514dd4e4458bff | /src/data/zsqrtd/gaussian_int.lean | 8a0fbfd8a91dfc11b23ce403c9b9eef115e9cad8 | [
"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 | 12,707 | lean | /-
Copyright (c) 2019 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Chris Hughes
-/
import data.zsqrtd.basic
import data.complex.basic
import ring_theory.principal_ideal_domain
import number_theory.quadratic_reciprocity
/-!
# Gaussian integers
The Gaussi... |
272a199268d3fa9a13129bdf6a28400a4e53591e | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebraic_topology/alternating_face_map_complex.lean | 9c05ce8e2a5c8e1b6ab104aaef1ee766f4fddd2e | [
"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 | 12,317 | lean | /-
Copyright (c) 2021 Joël Riou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Joël Riou, Adam Topaz, Johan Commelin
-/
import algebra.homology.additive
import algebraic_topology.Moore_complex
import algebra.big_operators.fin
import category_theory.preadditive.opposi... |
96a07c8eaee3fa4dbb7caacb4539657f0361236a | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/monoidal/internal/Module.lean | a8dcbc32b37acfa10ab52144b96b85f0647b4c1a | [
"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,062 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import algebra.category.Module.monoidal.basic
import algebra.category.Algebra.basic
import category_theory.monoidal.Mon_
/-!
# `Mon_ (Module R) ≌ Algebra R`
> THIS... |
f25a8973eb90cc7a29750784c0c175e3182f6bf0 | 35b83be3126daae10419b573c55e1fed009d3ae8 | /_target/deps/mathlib/data/complex/exponential.lean | 2503f9e069a0192811eaafd3d36f7319b14a21b2 | [] | no_license | AHassan1024/Lean_Playground | ccb25b72029d199c0d23d002db2d32a9f2689ebc | a00b004c3a2eb9e3e863c361aa2b115260472414 | refs/heads/master | 1,586,221,905,125 | 1,544,951,310,000 | 1,544,951,310,000 | 157,934,290 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 46,502 | 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 algebra.archimedean
import data.nat.choose data.complex.basic
import tactic.linarith
local attribute [instance, priority 0] classical.prop_decidable
loc... |
a183e4ce2582f69d8fe5361bb117e03480321026 | 46125763b4dbf50619e8846a1371029346f4c3db | /src/tactic/norm_cast.lean | 46f95c7cdbe9f07a3e7b10554325357354019921 | [
"Apache-2.0"
] | permissive | thjread/mathlib | a9d97612cedc2c3101060737233df15abcdb9eb1 | 7cffe2520a5518bba19227a107078d83fa725ddc | refs/heads/master | 1,615,637,696,376 | 1,583,953,063,000 | 1,583,953,063,000 | 246,680,271 | 0 | 0 | Apache-2.0 | 1,583,960,875,000 | 1,583,960,875,000 | null | UTF-8 | Lean | false | false | 11,896 | lean | /-
Copyright (c) 2019 Paul-Nicolas Madelaine. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Paul-Nicolas Madelaine
Normalizing casts inside expressions.
-/
import tactic.basic tactic.interactive tactic.converter.interactive
import data.buffer.parser
namespace tacti... |
2a790a34a20eb8504d67175d030ffb00943b1ab4 | 193da933cf42f2f9188bb47e3c973205bc2abc5c | /14_Relations/00_intro.lean | dc5dce4fbfac40cc1ffdb5914a0ee4422f578f02 | [] | no_license | pandaman64/cs-dm | aa4e2621c7a19e2dae911bc237c33e02fcb0c7a3 | bfd2f5fd2612472e15bd970c7870b5d0dd73bd1c | refs/heads/master | 1,647,620,340,607 | 1,570,055,187,000 | 1,570,055,187,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 21 | lean | -- UNDER CONSTRUCTION |
738af75b70483f1154f54a0ed9df03b53281f025 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/analysis/special_functions/arsinh_auto.lean | 61f29c94269bdfa4dd695f1f554e596900814b77 | [] | 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,914 | lean | /-
Copyright (c) 2020 James Arthur. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: James Arthur, Chris Hughes, Shing Tak Lam
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.analysis.special_functions.trigonometric
import Mathlib.PostPort
... |
205de91f64fcc12916bc693c5a47008ce3ba071d | f68ef9a599ec5575db7b285d4960e63c5d464ccc | /Exercises/Lista 7/cap14-LucasMoschen.lean | 41d24b87a5371c0f9fcbc60331b76adb04dce539 | [] | no_license | lucasmoschen/discrete-mathematics | a38d5970cc571b0b9d202bf6a43efeb8ed6f66e3 | 0f1945cc5eb094814c926cd6ae4a8b4c5c579a1e | refs/heads/master | 1,677,111,757,003 | 1,611,500,097,000 | 1,611,500,097,000 | 205,903,359 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,108 | lean | -- Lista 7: Capítulo 14
-- Lucas Moschen
-- Exercício 1
section
parameters {A : Type} {R : A → A → Prop}
parameter (irreflR : irreflexive R)
parameter (transR : transitive R)
variables a b c : A
local infix < := R
def R' (a b : A) : Prop := R a b ∨ a = b
local infix ≤ := R'
theore... |
528247c1d14089f80c1fab579de1f0ff83877276 | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/order/filter/basic.lean | 9dc4d5bff7f2b0e9a70e3716abcdecc9f22d1400 | [
"Apache-2.0"
] | permissive | fpvandoorn/mathlib | b21ab4068db079cbb8590b58fda9cc4bc1f35df4 | b3433a51ea8bc07c4159c1073838fc0ee9b8f227 | refs/heads/master | 1,624,791,089,608 | 1,556,715,231,000 | 1,556,715,231,000 | 165,722,980 | 5 | 0 | Apache-2.0 | 1,552,657,455,000 | 1,547,494,646,000 | Lean | UTF-8 | Lean | false | false | 81,812 | 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 data.list data.pfun
import algebra.pi_instances
import cat... |
01c31fc967e2f7975b3a1820b020b46f41ad5eb1 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/category/Group/biproducts.lean | 7616b1378093f70fd2a8834c6284032ff7e533ae | [
"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 | 4,603 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import algebra.group.pi
import algebra.category.Group.preadditive
import category_theory.preadditive.biproducts
import algebra.category.Group.limits
/-!
# The catego... |
efe6be733d4818669bc382e00bc7d8c8a4dfdd4b | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/category_theory/limits/shapes/multiequalizer.lean | 094b360ab504ddf7b731022e24ade0ea60baedb7 | [
"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 | 26,542 | 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 category_theory.limits.shapes.products
import category_theory.limits.shapes.equalizers
import category_theory.limits.cone_category
/-!
# Multi-(co)equalizers
A *mul... |
7baf9f9655fcb705826e89f023d160303c158e68 | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/data/nat/interval.lean | c6cd7876e29a9d2cfa51ae2be623466389f18400 | [
"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 | 6,564 | 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.interval
/-!
# Finite intervals of naturals
This file proves that `ℕ` is a `locally_finite_order` and calculates the cardinality of its
intervals as ... |
bdc434a0c303c8576ff6c42c6fbba4c9f784de75 | b70031c8e2c5337b91d7e70f1e0c5f528f7b0e77 | /src/analysis/calculus/times_cont_diff.lean | 42cde032a3ff121adaff3197abbfb05a227b6ddb | [
"Apache-2.0"
] | permissive | molodiuc/mathlib | cae2ba3ef1601c1f42ca0b625c79b061b63fef5b | 98ebe5a6739fbe254f9ee9d401882d4388f91035 | refs/heads/master | 1,674,237,127,059 | 1,606,353,533,000 | 1,606,353,533,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 134,003 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import analysis.calculus.mean_value
/-!
# Higher differentiability
A function is `C^1` on a domain if it is differentiable there, and its derivative is contin... |
bd4e5058d5161093bf26ef333c911a7b45ee46bf | 0f5090f82d527e0df5bf3adac9f9e2e1d81d71e2 | /src/apurva/test.lean | a023135492af7ad8d103c9059fde418a1914fdfc | [] | no_license | apurvanakade/mc2020-lean-projects | 36eb42c4baccc37183635c36f8e1b3afa4ec1230 | 02466225aa629ab1232043bcc0a053a099fdb939 | refs/heads/master | 1,688,791,717,534 | 1,597,874,092,000 | 1,597,874,092,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 410 | lean | import data.fintype.basic
import data.matrix.basic
open_locale matrix
def matrix_extension {k : ℕ} (A : matrix (fin k) (fin k) ℕ) : matrix (fin (k+1)) (fin (k+1)) ℕ
:=
λ i j,
match i, j with
| ⟨0, _⟩, ⟨0, _⟩ := 1
| ⟨0, _⟩, _ := 0
| _, ⟨0, _⟩ := 0
| ⟨x+1, hx⟩, ⟨y+1, hy⟩ := A ⟨x, nat.lt_of_... |
9ec9c7ba51573587d045e08bf442ac78775458fb | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/tactic/rewrite_all/basic.lean | 46c91ffd96cdec50a69232410afe9609f8f76a6b | [
"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,951 | lean | /-
Copyright (c) 2018 Keeley Hoek. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Keeley Hoek, Scott Morrison
-/
import data.mllist
import tactic.core
open tactic
@[derive decidable_eq, derive inhabited]
inductive side
| L
| R
def side.other : side → side
| side.L :... |
8dd26a15ed4e7816dfd1590e7bee320c7704330f | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /src/category_theory/elements.lean | 493834f3250648b85d050fb600501eec48bc8f6b | [
"Apache-2.0"
] | permissive | kmill/mathlib | ea5a007b67ae4e9e18dd50d31d8aa60f650425ee | 1a419a9fea7b959317eddd556e1bb9639f4dcc05 | refs/heads/master | 1,668,578,197,719 | 1,593,629,163,000 | 1,593,629,163,000 | 276,482,939 | 0 | 0 | null | 1,593,637,960,000 | 1,593,637,959,000 | null | UTF-8 | Lean | false | false | 4,395 | 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 category_theory.comma
import category_theory.groupoid
/-!
# The category of elements
This file defines the category of elements, also known as (a special cas... |
43cd5c8c2791f0769581d93de2d1a66ba5f92356 | f0050a24971f1b7315211eec6e02a8eee618ce6b | /src/common/default.lean | a5b8520fd2a4dc8dee30fbc0557e3375c9a85e13 | [
"Apache-2.0"
] | permissive | ttowncompiled/excaLibur | 9574f2acb0bafcd59f59423b63a62c15442ea5f7 | 7d8371bf998012d4f8c49d3fe2bf540e2517c688 | refs/heads/master | 1,670,710,035,703 | 1,599,670,584,000 | 1,599,670,584,000 | 292,720,923 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 167 | lean | /-
Copyright (c) Ian Riley. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Ian Riley
-/
prelude
import .basic .stmt
|
5e96d6f076b9215509001faab3fe93536eab17a3 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/ring_theory/finite_presentation.lean | 39908602603d6c7de99083a776858506625793cb | [
"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 | 19,539 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import ring_theory.finite_type
import ring_theory.mv_polynomial.tower
/-!
# Finiteness conditions in commutative algebra
In this file we define several notions of ... |
cfa513039c5fa998da89f4f18cca1586f11e1b78 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Structure.lean | 19b5493dbe363324dd8204ad07dc388ae39d013e | [
"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 | 9,111 | 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
Helper functions for retrieving structure information.
-/
import Lean.Environment
import Lean.ProjFns
namespace Lean
structure StructureFieldInfo where
fi... |
12941fcd5bf8b4e0673fbc7b20203935c93cd16c | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/tactic/omega/main.lean | 08dd7073e68766d8341f864b0b6ddfc4cf7f4ef0 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 5,674 | lean | /-
Copyright (c) 2019 Seul Baek. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Seul Baek
-/
/-
A tactic for discharging linear integer & natural
number arithmetic goals using the Omega test.
-/
import tactic.omega.int.main
import tactic.omega.nat.main
namespace ome... |
6acc2daffafd15b9401c045387e3d01d8bf3dccc | 92e157ec9825b5e4597a6d715a8928703bc8e3b2 | /src/mywork/notes.lean | c586034fb96f34210ddf9eaad306d542b9ef8d17 | [] | no_license | exb3dg/cs2120f21 | 9e566bc508762573c023d3e70f83cb839c199ec8 | 319b8bf0d63bf96437bf17970ce0198d0b3525cd | refs/heads/main | 1,692,970,909,568 | 1,634,584,540,000 | 1,634,584,540,000 | 399,947,025 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,076 | lean | namespace implies
axioms (P Q : Prop) /- assuming P and Q are arbitrary propositions -/
def if_P_is_true_them_so_is_Q : Prop := P → Q /- if P is true then Q is true -/
-- need a proof (axiom) that P → Q and P itself
axiom p : P /- p is the name" P is the funcrion -/
-- assumme P is true
-- assue we have a proof of P... |
81029c2f66370dc265911fddd0231d0f8d6a2bc1 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /hott/types/int/basic.hlean | 5e06aac0e001f504a72246aad07132781f8dd129 | [
"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 | 25,832 | hlean | /-
Copyright (c) 2014 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Jeremy Avigad
The integers, with addition, multiplication, and subtraction. The representation of the integers is
chosen to compute efficiently.
To faciliate prov... |
90a29c576ef7a6257abc7f26eea5751df2659c23 | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /src/Init/Data/Repr.lean | ec662a76c46a4c608dd58cad17521561f62b8ec7 | [
"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 | 6,786 | 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.Format.Basic
import Init.Data.Int.Basic
import Init.Data.Nat.Div
import Init.Data.UInt
import Init.Control.Id
open Sum Subtype Nat
... |
9aa266156118e48f53af13bd62a5c0f6f0768ea1 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/interactive/userWidget.lean | 96a56240cfe762ef67831da8edab15a4dec6b8f2 | [
"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 | 298 | lean | import Lean
open Lean Widget
@[widget]
def widget1 : UserWidgetDefinition := {
name := "my fancy widget"
javascript:= "
import * as React from 'react';
export default function (props) {
return React.createElement('p', {}, 'hello')
}"
}
#widget widget1 (Json.mkObj [])
--^ widgets
|
884e09c80bb83f6ae1031738554eb5c7b711ef77 | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/simp_tac.lean | 5917ddf4262279de9bc24baa00fd89d120888ce4 | [
"Apache-2.0"
] | permissive | codyroux/lean0.1 | 1ce92751d664aacff0529e139083304a7bbc8a71 | 0dc6fb974aa85ed6f305a2f4b10a53a44ee5f0ef | refs/heads/master | 1,610,830,535,062 | 1,402,150,480,000 | 1,402,150,480,000 | 19,588,851 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 286 | lean | import tactic
-- Create a simple rewrite set
rewrite_set simple
add_rewrite Nat::add_zeror Nat::add_zerol Nat::add_comm eq_id : simple
-- Prove the following theorem using the simplifier with the rewrite set simple
theorem Test (a b : Nat) : 0 + a + 0 + b = b + a := (by simp simple)
|
e0df8cecd8fcec30b41fd36d0ead8ab8f42de878 | 3d2a7f1582fe5bae4d0bdc2fe86e997521239a65 | /cs-lib/src/spatial-reasoning-lib.lean | 3f1e9ecf632913b3eb0922a1efe9a1e0781d6f32 | [] | 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 | 2,230 | lean | import tiny
constants DirectionalAttribute North South East West Front Behind : U
-- (OppositeDirection North South)
-- (instance North DirectionalAttribute)
axiom north_is_direcional_attribute : ins North DirectionalAttribute
-- (<=>
-- (orientation ?OBJ1 ?OBJ2 North)
-- (orientation ?OBJ2 ?OBJ1 South))
axi... |
aa657c70a6124331a8174bc187cd413a730b2bc6 | 3dc4623269159d02a444fe898d33e8c7e7e9461b | /.github/workflows/group-representation/group_representation.lean | 4aadad3b13be5d6729b73325a1b427f5b873f476 | [] | 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 | 13,778 | lean | /- Copyright (c) 2020 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: ...
-/
import linear_algebra.basic
import algebra.group.hom
/- we will probably need to import other files soon too, like `linear_algebra.finite_dimensional`. -/
-- set_option trace.... |
530daa4a823030202dd964bb972c2f252cb4df05 | 271e26e338b0c14544a889c31c30b39c989f2e0f | /stage0/src/Init/Lean/Util/Message.lean | 6e7e5b95311f8c4fd65a558a7d9f6ea9c000bfdd | [
"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 | 6,324 | 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
-/
prelude
import Init.Data.ToString
import Init.Lean.Data.Position
import Init.Lean.Syntax
import In... |
7efabcf7719fb71c8e2d2be76690f8c1c7f205d0 | 5a5e1bb8063d7934afac91f30aa17c715821040b | /lean3SOS/src/test/test.lean | 608bd5201a2948178a4716a9f95ac23b0562f1fd | [] | no_license | ramonfmir/leanSOS | 1883392d73710db5c6e291a2abd03a6c5b44a42b | 14b50713dc887f6d408b7b2bce1f8af5bb619958 | refs/heads/main | 1,683,348,826,105 | 1,622,056,982,000 | 1,622,056,982,000 | 341,232,766 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,344 | lean | /-
Testing out the tactic.
-/
import tactic.ring2
import tactic.ring
import tactic.show_term
import data.real.basic
import data.mv_polynomial.basic
import lib.poly lib.psd .sos float.basic
open mv_polynomial poly
-- Test intermediate steps.
-- noncomputable def p : mv_polynomial ℕ ℝ := (X 1) * (X 1)
-- noncomputa... |
24b94d7bcbd6dc510a71855a76e4a5af9ca2747c | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/algebra/field.lean | 3143a720d93a0137d35858f147b0002075af4e38 | [
"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 | 14,110 | 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
/-!
# Fields and division rings
This file introduces fields ... |
b5490a1983ef8bc17a793cb615de576fb4360cea | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/rbtree/basic.lean | fe262dbc6d7a58f4dcf0c654d81c17b83df84f34 | [
"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,853 | 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
-/
import data.rbtree.init
import logic.is_empty
import tactic.interactive
universe u
meta def tactic.interactive.blast_disjs : tactic unit :=
`[cases_type* ... |
9100d979387fbb115e72d07e3a3fe84e9b8e30e8 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/meta/default.lean | ff81e5f50713203ba677d1cd6be074a289487497 | [] | 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,911 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.meta.name
import Mathlib.Lean3Lib.init.meta.options
import Mathlib.Lean3Lib.init.meta.format
import Math... |
9118ce2f366fd8bc070e9049664f2511548afc9c | 59a4b050600ed7b3d5826a8478db0a9bdc190252 | /src/category_theory/currying_2.lean | 418df230b85545ade0bf49becad52a858ee15fcc | [] | 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,652 | lean | -- import category_theory.currying
-- namespace category_theory
-- universes u₁ u₂ v₂
-- variables (C : Type u₁) [small_category C] (D : Type u₁) [small_category D] (E : Type u₂) [ℰ : category.{u₂ v₂} E]
-- include ℰ
-- local attribute [back] category.id -- this is usually a bad idea, but just what we needed here
... |
fd873e9508d6136b1e35e152f2b1790da9023a41 | e07b1aca72e83a272dd59d24c6e0fa246034d774 | /src/tutorials/06_sub_sequences.lean | a68433c25ee4641d0b4512a60ccba3fb150b044e | [
"Apache-2.0",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | pedrominicz/learn | 637a343bd4f8669d76819ac660a2d2d3e0958710 | b79b802a9846c86c21d4b6f3e17af36e7382f0ef | refs/heads/master | 1,671,746,990,402 | 1,670,778,113,000 | 1,670,778,113,000 | 265,735,177 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,287 | lean | import tuto_lib
/-
This file continues the elementary study of limits of sequences.
It can be skipped if the previous file was too easy, it won't introduce
any new tactic or trick.
Remember useful lemmas:
abs_le (x y : ℝ) : |x| ≤ y ↔ -y ≤ x ∧ x ≤ y
abs_add (x y : ℝ) : |x + y| ≤ |x| + |y|
abs_sub (x y : ℝ) : |x - ... |
43320e1e56caa6f8468a5a7c64442a6d6a593c6e | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebraic_topology/alternating_face_map_complex.lean | 2e2c7649b4e6e27ad19b34833a930803becfb1c0 | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 8,708 | lean | /-
Copyright (c) 2021 Joël Riou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Joël Riou, Adam Topaz, Johan Commelin
-/
import algebra.homology.additive
import algebraic_topology.Moore_complex
import algebra.big_operators.fin
/-!
# The alternating face map complex ... |
8b0c578bf6a14c57ae4c7c2ebf85202ad5ca7b33 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/subst_heq.lean | c32b5a3489aa1752c27bb5e9f45f597f63373017 | [
"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 | 148 | lean | example (a b : nat) (h : a == b) : a + 1 = b + 1 :=
begin
subst h
end
example (a b : nat) (h : a == b) : a + 1 = b + 1 :=
begin
subst_vars
end
|
74e84927ae42ce0f99cae41dbcfed209640ff292 | f4bff2062c030df03d65e8b69c88f79b63a359d8 | /src/game/max/level06.lean | 1d5f74e3b607785bbe028d24af5d28e3f0f5a7c3 | [
"Apache-2.0"
] | permissive | adastra7470/real-number-game | 776606961f52db0eb824555ed2f8e16f92216ea3 | f9dcb7d9255a79b57e62038228a23346c2dc301b | refs/heads/master | 1,669,221,575,893 | 1,594,669,800,000 | 1,594,669,800,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,319 | lean | import game.max.level05 -- hide
open_locale classical -- hide
noncomputable theory -- hide
namespace xena -- hide
/-
# Chapter ? : Max and abs
## Level 6
In fact `max_le` can be beefed up to an iff statement.
-/
/- Hint : Tip : using `le_trans`
If your goal is `x ≤ z` and you have a hypothesis `h : y ≤ z`
then ... |
a12c6f7406d4bb97e9db6b22dda0c9eb86df7848 | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/map.lean | db27d87871575a8db32803b24153aaec05ee36c6 | [
"Apache-2.0"
] | permissive | codyroux/lean0.1 | 1ce92751d664aacff0529e139083304a7bbc8a71 | 0dc6fb974aa85ed6f305a2f4b10a53a44ee5f0ef | refs/heads/master | 1,610,830,535,062 | 1,402,150,480,000 | 1,402,150,480,000 | 19,588,851 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 977 | lean | import tactic
variable list : Type → Type
variable nil {A : Type} : list A
variable cons {A : Type} : A → list A → list A
variable map {A B : Type} : (A → B) → list A → list B
axiom map_cons {A B : Type} (f : A → B) (a : A) (l : list A) : map f (cons a l) = cons (f a) (map f l)
axiom map_nil {A B : Type} (f : A → B) : ... |
b5e51471fa6c40f14b9d510cc453985fd805ea35 | 618003631150032a5676f229d13a079ac875ff77 | /src/order/iterate.lean | d558fcf95a40c9133bc622a634211d15c9dd005f | [
"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 | 2,551 | 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 order.basic
import logic.function.iterate
import data.nat.basic
/-!
# Inequalities on iterates
In this file we prove some inequalities comparing `f^[n... |
e4e4b378aab6857e58a8b0da4d65bff3f2933584 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/order/disjointed.lean | e38e805b67fa93bc677fb4a36931c62a4124dc1b | [
"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 | 3,420 | 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, Yaël Dillies
-/
import order.partial_sups
/-!
# Consecutive differences of sets
This file defines a way to make a sequence of sets into a sequence of disjoint sets.
... |
2e77fd14f1dacfc3a4e7dbeeab2acc949721cd3b | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/data/fintype/card.lean | d95bdd1329bf98005e05889f32b6afd1679136da | [
"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 | 16,008 | 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.fintype.basic
import algebra.big_operators.ring
import algebra.big_operators.option
/-!
Results about "big operations" over a `fintype`, and consequent
r... |
ed1e3583b823817098f629b5a1daf14da294213c | 30d8cd1892571165965a1f2200a47df0b8b44b7c | /_learning/lean/first_project/src/hello.lean | 76be0621e07f05e4f63779eda148d46c4e24699f | [] | no_license | cuckookernel/scratch | 744aed4cfdddbfb80ac8dc7118b5734f13e546f8 | 1e51a6aa9303fb7370072d970622875a657e9481 | refs/heads/master | 1,682,629,054,957 | 1,681,482,905,000 | 1,681,482,905,000 | 165,303,327 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 259 | lean | import init.data.bool
#check bool
#check true
#check true == false
#eval 0
#check 0
#check nat
theorem test( p q : Prop )(hp : p)(hq : q) : p ∧ q ∧ p :=
by apply And.intro
exact hp
apply And.intro
exact hq
exact hp
#check test
|
9cdce540e6411f16ce6ba2ca178552021b9f5548 | 32a2d1642d7519c99693bc1d3b24069e4853dd1f | /data/multiset.lean | fb25c2802b5fd5cdff2c5c0ddbb19a3f8bd49a2e | [
"Apache-2.0"
] | permissive | Cedric0099/mathlib | 7edb81d5d68e280b4d21f6c0377dad1f9b8c0d71 | a97101d2df5d186848075a2d0452f6a04d8a13eb | refs/heads/master | 1,584,201,847,599 | 1,524,979,632,000 | 1,524,979,632,000 | 131,690,350 | 0 | 0 | null | 1,525,162,341,000 | 1,525,162,341,000 | null | UTF-8 | Lean | false | false | 96,004 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
Multisets.
-/
import logic.function data.list.basic data.list.perm data.list.sort order.boolean_algebra
algebra.order_functions data.quot algebra.group_pow... |
b1cb1b434206c98ad1e0bf088b2238439aa5bc6e | c3f2fcd060adfa2ca29f924839d2d925e8f2c685 | /tests/lean/run/basic.lean | f54dfcb7da7ce06b566f6e2e64e48ac0668ab37a | [
"Apache-2.0"
] | permissive | respu/lean | 6582d19a2f2838a28ecd2b3c6f81c32d07b5341d | 8c76419c60b63d0d9f7bc04ebb0b99812d0ec654 | refs/heads/master | 1,610,882,451,231 | 1,427,747,084,000 | 1,427,747,429,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,655 | lean | prelude
constant A.{l1 l2} : Type.{l1} → Type.{l2}
check A
definition tst.{l} (A : Type) (B : Type) (C : Type.{l}) : Type := A → B → C
check tst
constant group.{l} : Type.{l+1}
constant carrier.{l} : group.{l} → Type.{l}
definition to_carrier (g : group) := carrier g
check to_carrier.{1}
section
variable A : Type
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.