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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
dd6281d8fbde62633b7f2ce509649a5758948d42 | f3849be5d845a1cb97680f0bbbe03b85518312f0 | /tests/lean/run/atomic_notation.lean | 61e25cd1571d4462686886a2b97088577ebbc09d | [
"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 | 93 | lean | open num
constant f : num → num
notation `o`:1 := (10:num)
#check o + 1
#check f o + o + o
|
1023d50e16ef4a17bc91d715f32f3167473c7820 | ebbdcbd7ddc89a9ef7c3b397b301d5f5272a918f | /qp/p1_categories/c1_basic/s2_functors.lean | fdb8b4e2cb4e5b277436f5ce4b2dc63987265cb3 | [] | no_license | intoverflow/qvr | 34b9ef23604738381ca20b7d622fd0399d88f2dd | 0cfcd33fe4bf8d93851a00cec5bfd21e77105d74 | refs/heads/master | 1,616,591,570,371 | 1,492,575,772,000 | 1,492,575,772,000 | 80,061,627 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 51,191 | lean | /- -----------------------------------------------------------------------
Categories.
----------------------------------------------------------------------- -/
import .s1_categories
namespace qp
open stdaux
universe variables ℓ₁ ℓ₂ ℓ₃ ℓ₄ ℓobj ℓhom ℓobj₁ ℓhom₁ ℓobj₂ ℓhom₂ ℓobj₃ ℓhom₃ ℓobj₄ ℓhom₄ ℓobj₅ ℓhom₅
/-! #... |
5b973c7526ee745632c277ccb2cfec49c5164d2a | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/logic/unique_auto.lean | 716660730f954ccedccd502ef27f630857fce5b2 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,300 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.tactic.basic
import Mathlib.PostPort
universes u l v
namespace Mathlib
/-!
# Types with... |
327eeec872f6777db3ec69a538e15fc7ee997bbe | d26814d9437130e14d6d016c92d8c436b6dc62f3 | /vector.hlean | b5126e6cba1fa82db616c9ccd25441d4d911dbcc | [] | no_license | jonas-frey/segal | 92fb5a556c164d4e9e864f2da1258be5a6482af8 | 64b4ec62ec5f293b781d5bbfea5a6b0997558c13 | refs/heads/master | 1,594,256,935,764 | 1,566,490,351,000 | 1,566,490,351,000 | 203,831,654 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 15,994 | hlean | /-
Copyright (c) 2014 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Floris van Doorn, Leonardo de Moura
This file demonstrates how to encode vectors using indexed inductive families.
In standard library we do not use this approach.
-- ported from le... |
f6035124085fba7f7c975cecc0a0d187e6ae27fa | b12fedd6f2d718a9a3bf95f8eeb27d592548c935 | /xenalib/m1f/complex.lean | 985a6b55b221a5010c47b2816eb2a82384f663f4 | [] | no_license | EllenArlt/xena | 014727beff556fdc8e844f1c9a06bf399fd752a0 | e372c75f1d59929aef750ce70448153c4b675760 | refs/heads/master | 1,630,567,635,968 | 1,514,648,885,000 | 1,514,648,885,000 | 115,862,301 | 0 | 0 | null | 1,515,693,953,000 | 1,514,723,974,000 | Lean | UTF-8 | Lean | false | false | 11,702 | lean | /-
Copyright (c) 2017 Kevin Buzzard. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Kevin Buzzard
The complex numbers, modelled as R^2 in the obvious way.
TODO: Add topology, and prove that the complexes are a topological ring.
-/
import analysis.real
noncomputable th... |
8eeeb94d55b906fb3544a74118df9d44d6fc3191 | bb31430994044506fa42fd667e2d556327e18dfe | /src/measure_theory/decomposition/jordan.lean | a332a7ca18a72fd52a2044ff2af14b099f85e4aa | [
"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 | 25,163 | lean | /-
Copyright (c) 2021 Kexing Ying. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kexing Ying
-/
import measure_theory.decomposition.signed_hahn
import measure_theory.measure.mutually_singular
/-!
# Jordan decomposition
This file proves the existence and uniqueness o... |
e672bcff958255d07bba98b39339917d6c33bc22 | 61c3861020ef87c6c325fc3c3dcbabf5d6b07985 | /types/sigma.lean | 052ff50b6e3a8bd1d69e81de56eca23da1cd3816 | [
"Apache-2.0"
] | permissive | jonas-frey/hott3 | a623be2959e8a713c03fa1b0f34bf76a561dfa87 | a944051b4eb5919bdc70978ee15fcbb48a824811 | refs/heads/master | 1,628,408,720,559 | 1,510,267,042,000 | 1,510,267,042,000 | 106,760,764 | 0 | 0 | null | 1,507,856,238,000 | 1,507,856,238,000 | null | UTF-8 | Lean | false | false | 24,088 | lean | /-
Copyright (c) 2014-15 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Floris van Doorn
Partially ported from Coq HoTT
Theorems about sigma-types (dependent sums)
-/
import .prod
universes u v w
hott_theory
namespace hott
open eq sigma equiv is_eq... |
fefd591d7f034a211d87b7448a309d3cd0e7b5cd | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/lean/run/ext_eff_linear.lean | f327e9309359b706fa8eb424e34568ad9178099f | [
"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 | 8,194 | lean | -- TODO: renable test after we restore tactic framework
#exit
/- An extensible effects library, inspired by "Freer Monads, More Extensible Effects" (O. Kiselyov, H. Ishii)
and https://github.com/lexi-lambda/freer-simple -/
def N := 100 -- Default number of interations for testing
def effect := Type → Type
class m... |
33bfd0bc7a3f3b5d897dd819d368716e32559927 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/analysis/special_functions/sqrt.lean | f9aabd7ad5ad824bdc51f91b1e2b84c3dde8951b | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 6,268 | lean | /-
Copyright (c) 2021 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov
-/
import analysis.calculus.cont_diff
/-!
# Smoothness of `real.sqrt`
In this file we prove that `real.sqrt` is infinitely smooth at all points `x ≠ 0` and pro... |
d10a9872c59611d3795464371c5f860be874e368 | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /tests/lean/run/depElim1.lean | ce13fc781d377a63092a507ed6396e24280cc374 | [
"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 | 13,778 | lean | import Lean.Meta.Match
open Lean
open Lean.Meta
open Lean.Meta.Match
/- Infrastructure for testing -/
universes u v
def check (x : Bool) : IO Unit := do
unless x do
throw $ IO.userError "check failed"
def inaccessible {α : Sort u} (a : α) : α := a
def val {α : Sort u} (a : α) : α := a
def As {α : Sort u} (v a : ... |
971ef9b7ae3b21651b05bd553a24421e2fc2fc34 | f7315930643edc12e76c229a742d5446dad77097 | /tests/lean/run/tactic25.lean | e6fc9d682f4fad80260fe6d90361c8441615c70b | [
"Apache-2.0"
] | permissive | bmalehorn/lean | 8f77b762a76c59afff7b7403f9eb5fc2c3ce70c1 | 53653c352643751c4b62ff63ec5e555f11dae8eb | refs/heads/master | 1,610,945,684,489 | 1,429,681,220,000 | 1,429,681,449,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 532 | lean | import logic
open tactic
definition my_tac1 := apply @eq.refl
definition my_tac2 := repeat (apply @and.intro; assumption)
tactic_hint my_tac1
tactic_hint my_tac2
theorem T1 {A : Type.{2}} (a : A) : a = a
theorem T2 {a b c : Prop} (Ha : a) (Hb : b) (Hc : c) : a ∧ b ∧ c
definition my_tac3 := fixpoint (λ f, (apply @o... |
182e618fc6834bb0d742fc494160605bef2f30f9 | a4673261e60b025e2c8c825dfa4ab9108246c32e | /src/Lean/Meta/Tactic/Apply.lean | d97035891383bf212fcccbddad6f1f66131b066c | [
"Apache-2.0"
] | permissive | jcommelin/lean4 | c02dec0cc32c4bccab009285475f265f17d73228 | 2909313475588cc20ac0436e55548a4502050d0a | refs/heads/master | 1,674,129,550,893 | 1,606,415,348,000 | 1,606,415,348,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,285 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Util.FindMVar
import Lean.Meta.ExprDefEq
import Lean.Meta.SynthInstance
import Lean.Meta.CollectMVars
import Lean.Meta.Tactic.Util
namespace Le... |
14937f51c72e0209d5ab1d6973accac9a3441c39 | f313d4982feee650661f61ed73f0cb6635326350 | /Mathlib/Logic/Basic.lean | cf475b8596b2112dad687560f41d2c570c3c8a11 | [
"Apache-2.0"
] | permissive | shingtaklam1324/mathlib4 | 38c6e172eec1385944db5a70a3b5545c924980ee | 50610c343b7065e8eec056d641f859ceed608e69 | refs/heads/master | 1,683,032,333,313 | 1,621,942,699,000 | 1,621,942,699,000 | 371,130,608 | 0 | 0 | Apache-2.0 | 1,622,053,166,000 | 1,622,053,166,000 | null | UTF-8 | Lean | false | false | 11,306 | lean | import Mathlib.Tactic.Basic
lemma optParam_eq (α : Sort u) (default : α) : optParam α default = α := rfl
def not_false := notFalse
def proof_irrel := @proofIrrel
def congr_fun := @congrFun
def congr_arg := @congrArg
def of_eq_true := @ofEqTrue
lemma not_of_eq_false {p : Prop} (h : p = False) : ¬p := fun hp => h ▸ hp... |
a982cde85d5a29194368e31f4bba41b80e59572d | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/analysis/normed_space/banach.lean | 9d551801527ca7934114f714f7c31515d98531ae | [
"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 | 21,421 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import topology.metric_space.baire
import analysis.normed_space.operator_norm
import analysis.normed_space.affine_isometry
/-!
# Banach open mapping theorem
T... |
80a5a9d699603df134e21ceb79a7a818bf44a921 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/tactic/omega/prove_unsats_auto.lean | e1707cf8e40167f5b63ef26f0ff338e869772d6e | [] | 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 | 659 | lean | /-
Copyright (c) 2019 Seul Baek. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Seul Baek
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.tactic.omega.find_ees
import Mathlib.tactic.omega.find_scalars
import Mathlib.tactic.omega.lin_comb
im... |
3c1e10404eaebd9cefa7bbc22804c50996e61c1a | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/algebra/category/Group/colimits.lean | 8648b5827103923a7a2098067e8982e32bd54171 | [] | 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,420 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.algebra.category.Group.preadditive
import Mathlib.group_theory.quotient_group
import Mathli... |
29aba7a0647e29115ebda1b16bb5bb9f4b425bf9 | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /src/Lean/Elab/BuiltinCommand.lean | 193c7090299efa2a0718359021444e3e85b554a2 | [
"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 | tobiasgrosser/lean4 | ce0fd9cca0feba1100656679bf41f0bffdbabb71 | ebdbdc10436a4d9d6b66acf78aae7a23f5bd073f | refs/heads/master | 1,673,103,412,948 | 1,664,930,501,000 | 1,664,930,501,000 | 186,870,185 | 0 | 0 | Apache-2.0 | 1,665,129,237,000 | 1,557,939,901,000 | Lean | UTF-8 | Lean | false | false | 18,526 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Util.CollectLevelParams
import Lean.Meta.Reduce
import Lean.Elab.DeclarationRange
import Lean.Elab.Eval
import Lean.Elab.Command
import Lean.Ela... |
398eed84ae1b3e3b7c8b27bde4a34e10ccf0b886 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/order/filter/at_top_bot.lean | 229c8dd8ed5e39868e681ad730c79e22acb74fbb | [
"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 | 61,660 | 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, Yury Kudryashov, Patrick Massot
-/
import order.filter.bases
import data.finset.preimage
/-!
# `at_top` and `at_bot` filters on preorded sets, monoids a... |
a638a627a60b4f54b9889892ae54c4b1105045ae | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/group_theory/submonoid/membership.lean | 7512b4eb547840c3ac9717852fe00c3e3b1eae1b | [
"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 | 13,755 | 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, Kenny Lau, Johan Commelin, Mario Carneiro, Kevin Buzzard,
Amelia Livingston, Yury Kudryashov
-/
import group_theory.submonoid.operations
import algebra.big_operators.ba... |
ffd73f939860f6b5f93bbafad5dea2820c9db2ac | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/order/order_iso_nat.lean | b524b4a81b76e25b04cfc500d30e739a19d03b29 | [
"Apache-2.0"
] | permissive | dupuisf/mathlib | 62de4ec6544bf3b79086afd27b6529acfaf2c1bb | 8582b06b0a5d06c33ee07d0bdf7c646cae22cf36 | refs/heads/master | 1,669,494,854,016 | 1,595,692,409,000 | 1,595,692,409,000 | 272,046,630 | 0 | 0 | Apache-2.0 | 1,592,066,143,000 | 1,592,066,142,000 | null | UTF-8 | Lean | false | false | 1,660 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
-/
import data.nat.basic
import order.order_iso
import logic.function.iterate
namespace order_embedding
variables {α : Type*} {r : α → α → Prop}
def nat_lt [is_strict_... |
65de28e91617da6d0d519e6a05ccb421f3903cec | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/coeOutParamIssue.lean | 004468fdf2e8ba1b0824992c07afe63679535a92 | [
"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 | 447 | lean | namespace Ex
class Get (Cont : Type u) (Idx : Type v) (Elem : outParam (Type w)) where
get (xs : Cont) (i : Idx) : Elem
export Get (get)
instance [Inhabited α] : Get (Array α) Nat α where
get xs i := xs.get! i
instance : Coe Bool Nat where
coe b := if b then 1 else 0
def g (as : Array (Array Bool)) : Nat :=
... |
8e8500e1bf6b7a8afc0861ba7f6b7df1e5d07a5b | 969dbdfed67fda40a6f5a2b4f8c4a3c7dc01e0fb | /src/algebra/group/defs.lean | 3c7c9a56f55a320151b906783cb9fdca6ea16ebb | [
"Apache-2.0"
] | permissive | SAAluthwela/mathlib | 62044349d72dd63983a8500214736aa7779634d3 | 83a4b8b990907291421de54a78988c024dc8a552 | refs/heads/master | 1,679,433,873,417 | 1,615,998,031,000 | 1,615,998,031,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 17,270 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Simon Hudon, Mario Carneiro
-/
import algebra.group.to_additive
import tactic.basic
/-!
# Typeclasses for (semi)groups and monoid
In this file we def... |
b18f526a161b3dafbb9f4def4e68ec54fea6787c | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /test/push_neg.lean | 0fbbdf2dbb3c547b3c92999d841dc9503e02fa8c | [
"Apache-2.0"
] | permissive | dupuisf/mathlib | 62de4ec6544bf3b79086afd27b6529acfaf2c1bb | 8582b06b0a5d06c33ee07d0bdf7c646cae22cf36 | refs/heads/master | 1,669,494,854,016 | 1,595,692,409,000 | 1,595,692,409,000 | 272,046,630 | 0 | 0 | Apache-2.0 | 1,592,066,143,000 | 1,592,066,142,000 | null | UTF-8 | Lean | false | false | 2,042 | lean | import tactic.push_neg
import data.int.basic
example (h : ∃ p: ℕ, ¬ ∀ n : ℕ, n > p) (h' : ∃ p: ℕ, ¬ ∃ n : ℕ, n < p) : ¬ ∀ n : ℕ, n = 0 :=
begin
push_neg at *,
guard_target_strict ∃ (n : ℕ), n ≠ 0,
guard_hyp_strict h := ∃ (p n : ℕ), n ≤ p,
guard_hyp_strict h' := ∃ (p : ℕ), ∀ (n : ℕ), p ≤ n,
use 1,
end
-- In ... |
50d754cb01f62e4a76f2d3802672988f5b136f3b | 1e3a43e8ba59c6fe1c66775b6e833e721eaf1675 | /src/data/real/irrational.lean | 72bcc488e572de5fc52a87b9cb60162cdfe49be4 | [
"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 | 8,232 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Abhimanyu Pallavi Sudhir, Jean Lo, Calle Sönne, Yury Kudryashov.
-/
import data.real.basic
import algebra.gcd_domain
import ring_theory.multiplicity
/-!
# Irrational re... |
20fc7e42aa28ac249600f1a8924d6ac97dc81348 | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /src/Lean/Server/References.lean | 6e0a2eb311036882118f66f53c8675138214afa2 | [
"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 | tobiasgrosser/lean4 | ce0fd9cca0feba1100656679bf41f0bffdbabb71 | ebdbdc10436a4d9d6b66acf78aae7a23f5bd073f | refs/heads/master | 1,673,103,412,948 | 1,664,930,501,000 | 1,664,930,501,000 | 186,870,185 | 0 | 0 | Apache-2.0 | 1,665,129,237,000 | 1,557,939,901,000 | Lean | UTF-8 | Lean | false | false | 12,244 | lean | /-
Copyright (c) 2021 Joscha Mennicken. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Joscha Mennicken
-/
import Lean.Data.Lsp.Internal
import Lean.Server.Utils
/-! # Representing collected and deduplicated definitions and usages -/
namespace Lean.Server
open Lsp L... |
5a2013a0cf42754565604bab797830fca2a07372 | 92b50235facfbc08dfe7f334827d47281471333b | /hott/hit/colimit.hlean | 220c405850f134ff5a6b72288e75d0749f8d1053 | [
"Apache-2.0"
] | permissive | htzh/lean | 24f6ed7510ab637379ec31af406d12584d31792c | d70c79f4e30aafecdfc4a60b5d3512199200ab6e | refs/heads/master | 1,607,677,731,270 | 1,437,089,952,000 | 1,437,089,952,000 | 37,078,816 | 0 | 0 | null | 1,433,780,956,000 | 1,433,780,955,000 | null | UTF-8 | Lean | false | false | 6,864 | 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
Definition of general colimits and sequential colimits.
-/
/- definition of a general colimit -/
open eq nat quotient sigma equiv equiv.ops
namespace colimit
sect... |
af87a3be0de382784abea7fc5652fec93e0261a2 | 947b78d97130d56365ae2ec264df196ce769371a | /tests/lean/letrec1.lean | 006b3c6acb50376d6cb5911d9003526e4284bbe9 | [
"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 | 678 | lean | new_frontend
def f1.g := 10
def f1 (x : Nat) : Nat :=
let rec g : Nat → Nat -- Error f1.g has already been declared
| 0 => x
| y+1 => 2 * g y;
g (g x)
axiom Ax {α} : α
def f2 (x : Nat) : Nat :=
let rec
g : Nat → Nat
| 0 => 1
| y+1 => (h y).val,
h : (x : Nat) → { y : Nat // y < g x } -- unknown ident... |
0550582ecfe55eada4fabd9106b49c2f0f46b249 | 1abd1ed12aa68b375cdef28959f39531c6e95b84 | /src/data/fin_enum.lean | 467609c9f350b640d0cd594ad8cd5bb6f42f93d7 | [
"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 | 8,844 | lean | /-
Copyright (c) 2019 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
-/
import control.monad.basic
import data.fintype.basic
/-!
Type class for finitely enumerable types. The property is stronger
than `fintype` in that it assigns each element ... |
4aa853f736178a8a9f6792ffd077346501b9d060 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/algebra/field.lean | e24c221bb98b367700a70c10121846e71ec27df8 | [
"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 | 9,758 | lean | /-
Copyright (c) 2014 Robert Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Lewis, Leonardo de Moura, Johannes Hölzl, Mario Carneiro
-/
import algebra.ring.basic
import algebra.group_with_zero
open set
set_option old_structure_cmd true
universe u
variab... |
60a3d1516c946e91a157f9c7173c2a902a2cacaa | 7b4371534ac437ca8cfb325dd5c6638ff111d31a | /algebra_util.lean | 1190290214e309eae42499c1effa6467dad36793 | [] | no_license | Shamrock-Frost/boolean_rings | 6d78294568b6b9ad7b9c67b5de5e9545227826da | 5da11beeaa37ec186c1deff946f2dbf7594fceb4 | refs/heads/master | 1,588,394,857,485 | 1,553,973,949,000 | 1,553,973,949,000 | 177,757,941 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 15,022 | lean | import .sum_over .nat_util
section add_group
lemma {u} add_group.ident_unique
{G : Type u} [add_group G]
(e : G) (h : ∀ x, x + e = x) : e = 0 :=
eq.trans (eq.symm (zero_add e)) (h 0)
lemma {u} add_group.inv_unique
{G : Type u} [add_group G]
(x x' : G) (h : x' + x = 0) : x' = -x :=
iff.mp (@sub_eq_zero_iff... |
40b947ca7b81d39e5c33305d8d2c357c25274040 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/simp_eqns.lean | 1ab0bd26cac172c4414b17e4a0b3f8e3e6222016 | [
"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 | 304 | lean | def f : nat → nat
| 0 := 1
| (n+1) := f n + 10
example (n : nat) : f (n+1) = f n + 10 :=
by simp [f]
example (n : nat) : f 0 = 1 :=
by simp [f]
def g : nat → nat
| 0 := 2
| (n+1) :=
match f n with
| 0 := 0
| 1 := 3
| _ := 4
end
example (n : nat) : g (0+1) = 3 :=
by simp [g, f]
|
9397ab60f6c9a668e46fc952b3cd35c4349dea78 | 592ee40978ac7604005a4e0d35bbc4b467389241 | /Library/generated/mathscheme-lean/IdempotentSemiring.lean | e34ef0306c3e7fd9f1634f4f2c5b429bf5bd0045 | [] | no_license | ysharoda/Deriving-Definitions | 3e149e6641fae440badd35ac110a0bd705a49ad2 | dfecb27572022de3d4aa702cae8db19957523a59 | refs/heads/master | 1,679,127,857,700 | 1,615,939,007,000 | 1,615,939,007,000 | 229,785,731 | 4 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 13,601 | lean | import init.data.nat.basic
import init.data.fin.basic
import data.vector
import .Prelude
open Staged
open nat
open fin
open vector
section IdempotentSemiring
structure IdempotentSemiring (A : Type) : Type :=
(plus : (A → (A → A)))
(zero : A)
(times : (A → (A → A)))
(associative_times ... |
50ca25f9e150256ac6409b7125db214bd393ac84 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/pkg/deriving/lakefile.lean | 521fb262f15883446c9a94cb0c43487470d79987 | [
"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 | 95 | lean | import Lake
open System Lake DSL
package user_deriving
@[defaultTarget] lean_lib UserDeriving
|
e658a1519b1063c4aa78e9c4fbf2f0328dcdb43d | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/abs.lean | 45f4f472e591c5e9530fa8814e57adb46c238945 | [
"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 | 144 | lean | import data.int
open int
namespace foo
constant abs : int → int
notation `|` A `|` := abs A
constants a b c : int
check |a + |b| + c|
end foo
|
d3fd7303193177903e06ce3f4307946d0a1d726f | 367134ba5a65885e863bdc4507601606690974c1 | /src/topology/algebra/ring.lean | d7dc880c85d5888ea106eaa7656a090c42df2cb1 | [
"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 | 4,408 | lean | /-
Copyright (c) 2018 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Johannes Hölzl
Theory of topological rings.
-/
import topology.algebra.group
import ring_theory.ideal.basic
open classical set filter topological_space
open_locale cl... |
8fc4ca148cc8bd5e4a75cc8c59f87f6b9306fb20 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/group_theory/submonoid/center.lean | 5e101f7bb870fbf5be1e4845cfd6e8e2fbc8e971 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 2,637 | lean | /-
Copyright (c) 2021 Eric Wieser. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Eric Wieser
-/
import group_theory.submonoid.operations
import group_theory.subsemigroup.center
/-!
# Centers of monoids
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this... |
2c57d14a42bd80f6d5d3adaf8713926c30ea6c5a | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/analysis/normed_space/mazur_ulam.lean | 4a0ac2d03bf05565781a1fe2da32cdf4f33e5390 | [
"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,974 | 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 topology.instances.real_vector_space
import analysis.normed_space.affine_isometry
/-!
# Mazur-Ulam Theorem
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any... |
84195e2fa8bfd2f0e2feeb354357601864dff013 | 9cba98daa30c0804090f963f9024147a50292fa0 | /old/src/classical_luminous_itensity.lean | a71a1a5aaeac46bce84df5f6b2d69da949621dd3 | [] | no_license | kevinsullivan/phys | dcb192f7b3033797541b980f0b4a7e75d84cea1a | ebc2df3779d3605ff7a9b47eeda25c2a551e011f | refs/heads/master | 1,637,490,575,500 | 1,629,899,064,000 | 1,629,899,064,000 | 168,012,884 | 0 | 3 | null | 1,629,644,436,000 | 1,548,699,832,000 | Lean | UTF-8 | Lean | false | false | 2,118 | lean | import .....math.affine.affine_coordinate_framed_space_lib
import .....math.affine.affine_coordinate_transform
import ..metrology.dimensions
import ..metrology.measurement
import data.real.basic
noncomputable theory
--open real_lib
open measurementSystem
open aff_fr
open aff_lib
open aff_trans
/-
add in a frame here... |
f32294d2b9c62f18c55ad23a110889004c7c861b | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/extra/tree_list_rec.lean | c6a5d6e7c2bca7d6b0a05984129a21a6ef556f18 | [
"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 | 928 | lean | open nat
inductive tree (A : Type) :=
leaf : A → tree A,
node : tree_list A → tree A
with tree_list :=
nil : tree_list A,
cons : tree A → tree_list A → tree_list A
namespace tree
open tree_list
definition size {A : Type} : tree A → nat
with size_l : tree_list A → nat,
size (leaf a) := 1,
size (no... |
13cdf5215c01a94a6de3f067d086fa95188abe64 | 367134ba5a65885e863bdc4507601606690974c1 | /src/analysis/normed_space/indicator_function.lean | 4b304e615d3aadbee3955231e221196fdbeebeb6 | [
"Apache-2.0"
] | permissive | kodyvajjha/mathlib | 9bead00e90f68269a313f45f5561766cfd8d5cad | b98af5dd79e13a38d84438b850a2e8858ec21284 | refs/heads/master | 1,624,350,366,310 | 1,615,563,062,000 | 1,615,563,062,000 | 162,666,963 | 0 | 0 | Apache-2.0 | 1,545,367,651,000 | 1,545,367,651,000 | null | UTF-8 | Lean | false | false | 1,337 | 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 data.indicator_function
import analysis.normed_space.basic
/-!
# Indicator function and norm
This file contains a few simple lemmas about `set... |
94f13780b1b5c8725220e132f8e0353e3e732510 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /src/Lean/Widget/InteractiveDiagnostic.lean | cf8f2cb682489509323abdf92b65aa4f3bd3f72d | [
"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 | 8,758 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Wojciech Nawrocki
-/
import Lean.Linter.UnusedVariables
import Lean.Server.Utils
import Lean.Widget.InteractiveGoal
namespace Lean.Widget
open Lsp Server
inductive StrictOrLa... |
d623475401d821a06883bd1a6729486de0571ff1 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/measure_theory/integral/integral_eq_improper.lean | 26970b5f6bb368f9035e07966dc8a8157afccfd9 | [
"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 | 25,193 | lean | /-
Copyright (c) 2021 Anatole Dedecker. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anatole Dedecker, Bhavik Mehta
-/
import measure_theory.integral.interval_integral
import order.filter.at_top_bot
/-!
# Links between an integral and its "improper" version
In its ... |
fc954af97d4a30604d86f059d985b7aac368e88d | 6f1049e897f569e5c47237de40321e62f0181948 | /src/exercises/05_sequence_limits.lean | f4eb4737ff7a8e2b3733c14ff639e769b2599a7c | [
"Apache-2.0"
] | permissive | anrddh/tutorials | f654a0807b9523608544836d9a81939f8e1dceb8 | 3ba43804e7b632201c494cdaa8da5406f1a255f9 | refs/heads/master | 1,655,542,921,827 | 1,588,846,595,000 | 1,588,846,595,000 | 262,330,134 | 0 | 0 | null | 1,588,944,346,000 | 1,588,944,345,000 | null | UTF-8 | Lean | false | false | 5,874 | lean | import data.real.basic
import algebra.pi_instances
import tuto_lib
notation `|`x`|` := abs x
/-
In this file we manipulate the elementary definition of limits of
sequences of real numbers.
mathlib has a much more general definition of limits, but here
we want to practice using the logical operators and relations
cov... |
7c87e779738043e998d50a5971973af2fedf536a | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/linear_algebra/matrix/charpoly/basic.lean | e3ce6df2225f751578f72dd93e9ed0aa2e86ffa2 | [
"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 | 4,279 | 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 linear_algebra.matrix.adjugate
import ring_theory.matrix_algebra
import ring_theory.polynomial_algebra
import tactic.apply_fun
import tactic.squeeze
/-!
# Cha... |
bd7329378bd427945d820ecc1426bbb436d998e4 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tests/lean/run/liftMethodInMacrosIssue.lean | fed37edf66702fe56965a545de0dae107778bad9 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | cipher1024/lean4 | 6e1f98bb58e7a92b28f5364eb38a14c8d0aae393 | 69114d3b50806264ef35b57394391c3e738a9822 | refs/heads/master | 1,642,227,983,603 | 1,642,011,696,000 | 1,642,011,696,000 | 228,607,691 | 0 | 0 | Apache-2.0 | 1,576,584,269,000 | 1,576,584,268,000 | null | UTF-8 | Lean | false | false | 524 | lean |
def foo (x : Nat) : IO Bool := do
if x == 0 then
throw $ IO.userError "foo: unexpected zero"
pure (x == 1)
def tst (x : Nat) : IO Unit := do
if x == 0 then
IO.println "x is 0"
else if (← foo x) then
IO.println "x is 1"
else
IO.println "other"
#eval tst 0
#eval tst 1
#eval tst 2
syntax term "<|||>" term : do... |
4d2f7364bd63174b9f35f2f7e4c98bbc99f1c22c | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/discrete_category.lean | 92345fb6e923e9ee0102bd5ec9f95c62c64688d9 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,726 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.category_theory.eq_to_hom
import Mathlib.PostPort
univer... |
d95fc8482ff25660dc96bf8c4a7cc1de867eb27c | ea916b7f42baf59c02ca82e274a87b3e45397968 | /src/super/cnf.lean | 52b7743fc7f43e8317ba363b78054c9f71b7b4f8 | [] | no_license | robertylewis/super2 | 2926383b166e43ebd815b81ae8fba976393a160c | 8ba522fd609d25752cd3d9b478bc48b6453e3c1e | refs/heads/master | 1,670,062,676,962 | 1,597,795,530,000 | 1,597,795,530,000 | 289,744,671 | 0 | 0 | null | 1,598,207,476,000 | 1,598,207,476,000 | null | UTF-8 | Lean | false | false | 6,849 | lean | import super.clause super.distinct
universes u v
namespace classical
noncomputable def not_not' {α : Sort u} (h : (α → false) → false) : α :=
match type_decidable α with
| (psum.inl a) := a
| (psum.inr not_a) := (h not_a).elim
end
variables {α : Sort u} [nonempty α] (p : α → Sort v)
noncomputable def iota : α :=
ep... |
64a3af927a890b204cca241d4670b1ec83f8c2af | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /tests/lean/show1.lean | 1a7d68515bc4b3718f0e56d3c5612e01192fe734 | [
"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 | 383 | lean | import standard
using bool eq_proofs tactic
constants a b c : bool
axiom H1 : a = b
axiom H2 : b = c
check show a = c, from H1 ⬝ H2
print "------------"
check have e1 [visible] : a = b, from H1,
have e2 : a = c, by apply eq.trans; apply e1; apply H2,
have e3 : c = a, from e2⁻¹,
have e4 [visible] : b... |
cfc3a85d4701af685c3e4ac82932882374effe27 | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /tests/lean/run/nat_bug3.lean | a02c45f72eeea04a5af04ab60ea5aeebc9646c2c | [
"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 | 716 | lean | import standard
using num eq_proofs
inductive nat : Type :=
zero : nat,
succ : nat → nat
namespace nat
definition plus (x y : nat) : nat
:= nat.rec x (λn r, succ r) y
definition to_nat [coercion] (n : num) : nat
:= num.rec zero (λn, pos_num.rec (succ zero) (λn r, plus r (plus r (succ zero))) (λn r, plus r r) n) n
def... |
c1d06a30dab214bdc095cae30956edf64b19772f | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/order/euclidean_absolute_value.lean | 913d36d4b278b5616e1a550385b24167223ee6b6 | [
"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,123 | lean | /-
Copyright (c) 2021 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen
-/
import algebra.order.absolute_value
import algebra.euclidean_domain.instances
/-!
# Euclidean absolute values
This file defines a predicate `absolute_value.is_euclidean a... |
a723a046de6fdd6efd7879232ffe8f8a3bda471d | 4727251e0cd73359b15b664c3170e5d754078599 | /src/data/list/tfae.lean | c6838bb452d290d464bea591d06634efac5a1b25 | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 2,124 | lean | /-
Copyright (c) 2018 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Simon Hudon
-/
import data.list.basic
/-!
# The Following Are Equivalent
This file allows to state that all propositions in a list are equivalent. It is used by
`tact... |
6dd02ccf13c11a9932784b66f75095300c78b3fd | 5e3548e65f2c037cb94cd5524c90c623fbd6d46a | /src_icannos_totilas/groupes/cpge_groupe_9_b.lean | f87cd73f8826e25ccb2b3efd5f4071858cf0d160 | [] | 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 | 164 | lean | import group_theory.subgroup
theorem cpge_groupe_9_b {G : Type*} [group G]
(H K : subgroup G) : (∀ (h : H), ∀ (g : G), (g * h * g⁻¹) ∈ H) → H := sorry |
b54be89e9c2871d3a93774b17b94aea3710e2fc0 | ad0c7d243dc1bd563419e2767ed42fb323d7beea | /category/basic.lean | f1398f0e84330df58dac5e82dffd4b70f272c0ef | [
"Apache-2.0"
] | permissive | sebzim4500/mathlib | e0b5a63b1655f910dee30badf09bd7e191d3cf30 | 6997cafbd3a7325af5cb318561768c316ceb7757 | refs/heads/master | 1,585,549,958,618 | 1,538,221,723,000 | 1,538,221,723,000 | 150,869,076 | 0 | 0 | Apache-2.0 | 1,538,229,323,000 | 1,538,229,323,000 | null | UTF-8 | Lean | false | false | 4,198 | 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
Extends the theory on functors, applicatives and monads.
-/
universes u v
variables {α β γ : Type u}
notation a ` $< `:1 f:1 := f a
section functor
variables {f : Ty... |
d8f49b6cfb8c3d95840ed31df84a47e24137b959 | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /tests/lean/run/def2.lean | ffad173b9dd4715b279cdae1c99569bc3091c1f5 | [
"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 | 496 | lean |
inductive Vec.{u} (α : Type u) : Nat → Type u
| nil : Vec α 0
| cons : α → {n : Nat} → Vec α n → Vec α (n+1)
open Vec
universes u
variable {α : Type u}
variable (f : α → α → α)
def mapHead1 : {n : Nat} → Vec α n → Vec α n → Vec α n
| _, nil, nil => nil
| _, cons a va, cons b bv => cons (f a b) va
theorem ex1 : m... |
abff8b2d5a840c778807fbef4ad38f30ed582f21 | 1abd1ed12aa68b375cdef28959f39531c6e95b84 | /src/field_theory/finite/polynomial.lean | f98353bb7df1dd58be0ef79f1cf3e04a4acb9f53 | [
"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 | 7,554 | 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 field_theory.finite.basic
import field_theory.mv_polynomial
import data.mv_polynomial.expand
import linear_algebra.basic
import linear_algebra.finite_dimensio... |
46520bc8aedda5788087d343cbbf1ab02847188d | d7189ea2ef694124821b033e533f18905b5e87ef | /galois/list/preds.lean | 2c32c060a5f3bc4b6dea4bd24e52c88692a96867 | [
"Apache-2.0"
] | permissive | digama0/lean-protocol-support | eaa7e6f8b8e0d5bbfff1f7f52bfb79a3b11b0f59 | cabfa3abedbdd6fdca6e2da6fbbf91a13ed48dda | refs/heads/master | 1,625,421,450,627 | 1,506,035,462,000 | 1,506,035,462,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,381 | lean | /- Useful predicates and lemmas for quantifying over lists -/
import galois.tactic
universes u v
namespace list
inductive Exists {a : Type u} (P : a -> Prop) : list a -> Prop
| here : ∀ {h t}, P h -> Exists (h :: t)
| there : ∀ {h t}, Exists t -> Exists (h::t)
-- Desugar list.Exists into existential.
theorem mem_i... |
5e84597d4c76fa734d1ed9aa6629050a72492540 | 2d34dfb0a1cc250584282618dc10ea03d3fa858e | /src/system_of_complexes.lean | ad13a5e773ec2f2e2ee8dadb0b55fd4f1542faf2 | [] | no_license | zeta1999/lean-liquid | 61e294ec5adae959d8ee1b65d015775484ff58c2 | 96bb0fa3afc3b451bcd1fb7d974348de2f290541 | refs/heads/master | 1,676,579,150,248 | 1,610,771,445,000 | 1,610,771,445,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,232 | lean | import algebra.homology.chain_complex
import NormedGroup
noncomputable theory
universe variables v u
@[derive category_theory.category]
def system_of_complexes := nnrealᵒᵖ ⥤ (cochain_complex NormedGroup)
instance nnreal.le_mul_of_one_le_left (k c : nnreal) [hk : fact (1 ≤ k)] :
fact (c ≤ k * c) :=
le_mul_of_one_... |
e18cc65a3172bc4b98d2e98ea581a6329bc6f26c | c86b74188c4b7a462728b1abd659ab4e5828dd61 | /stage0/src/Lean/Elab/Command.lean | 3a070a20bedc3b003ecdfb43f877cd1cc17c8efc | [
"Apache-2.0"
] | permissive | cwb96/lean4 | 75e1f92f1ba98bbaa6b34da644b3dfab2ce7bf89 | b48831cda76e64f13dd1c0edde7ba5fb172ed57a | refs/heads/master | 1,686,347,881,407 | 1,624,483,842,000 | 1,624,483,842,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 28,160 | 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.Parser.Command
import Lean.ResolveName
import Lean.Meta.Reduce
import Lean.Elab.Log
import Lean.Elab.Term
import Lean.Elab.Binders
import Lean.E... |
a9ecdd0913967643521e2d5f57f0750fc1d0356c | 5883d9218e6f144e20eee6ca1dab8529fa1a97c0 | /src/aeq/properties.lean | c252d998044452c9692872db08d6408049511245 | [] | no_license | spl/alpha-conversion-is-easy | 0d035bc570e52a6345d4890e4d0c9e3f9b8126c1 | ed937fe85d8495daffd9412a5524c77b9fcda094 | refs/heads/master | 1,607,649,280,020 | 1,517,380,240,000 | 1,517,380,240,000 | 52,174,747 | 4 | 0 | null | 1,456,052,226,000 | 1,456,001,163,000 | Lean | UTF-8 | Lean | false | false | 6,412 | lean | /-
This file contains properties of `aeq`.
-/
import .subst
namespace acie ------------------------------------------------------------------
namespace aeq ------------------------------------------------------------------
variables {V : Type} [decidable_eq V] -- Type of variable names
variables {a : V} -- Variabl... |
8b70cd4913ddcf0f71ec0b9401cca07b0aa7d691 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/topology/uniform_space/abstract_completion.lean | b46ba732f4698281bfa7877209084428d65bfab7 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 14,065 | lean | /-
Copyright (c) 2019 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.topology.uniform_space.uniform_embedding
import Mathlib.PostPort
universes u l u_1 u_2 u_3... |
dfc427b0117b7013b9e952dce17239326ae56599 | d29d82a0af640c937e499f6be79fc552eae0aa13 | /src/data/set/basic.lean | 0bf7c3c00786b2af12f630dd02bd80968d9f99eb | [
"Apache-2.0"
] | permissive | AbdulMajeedkhurasani/mathlib | 835f8a5c5cf3075b250b3737172043ab4fa1edf6 | 79bc7323b164aebd000524ebafd198eb0e17f956 | refs/heads/master | 1,688,003,895,660 | 1,627,788,521,000 | 1,627,788,521,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 110,042 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura
-/
import logic.unique
import order.boolean_algebra
/-!
# Basic properties of sets
Sets in Lean are homogeneous; all their elements have the same type... |
87ce8505d1b719fcfd3148ec40104314a1d44ec4 | 82b86ba2ae0d5aed0f01f49c46db5afec0eb2bd7 | /tests/lean/run/evalconst.lean | 43f1a962aee41c05ed508bd97f9fc100cb698994 | [
"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 | 318 | lean | import Lean
open Lean
def x := 10
unsafe def tst : CoreM Unit := do
let env ← getEnv
IO.println $ env.evalConst Nat {} `x
#eval tst
def f (x : Nat) := x + 1
unsafe def tst2 : CoreM Unit := do
let env ← getEnv
let f ← liftIO $ IO.ofExcept $ env.evalConst (Nat → Nat) {} `f
IO.println $ (f 10)
#eval tst2
|
8b4ef34d66e59648bcd91ce93eb614c0aeda9fb1 | acc85b4be2c618b11fc7cb3005521ae6858a8d07 | /data/quot.lean | 019c97a7f0c7ee720f87a9e454d0b99b7ceab4cc | [
"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 | 625 | 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
Quotients -- extends the core library
-/
import data.set
open set
variables {α : Type*}
lemma forall_quotient_iff {α : Type*} [r : setoid α] {p : quotient r → Prop} :... |
d070e4549b99d3101c34ef4679dd412bf5b88042 | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/measure_theory/interval_integral.lean | 9c5d4eb76a5d22b440b6f46af91d0bacbd999e26 | [
"Apache-2.0"
] | permissive | ilitzroth/mathlib | ea647e67f1fdfd19a0f7bdc5504e8acec6180011 | 5254ef14e3465f6504306132fe3ba9cec9ffff16 | refs/heads/master | 1,680,086,661,182 | 1,617,715,647,000 | 1,617,715,647,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 82,412 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov
-/
import measure_theory.set_integral
import measure_theory.lebesgue_measure
import analysis.calculus.fderiv_measurable
import analysis.calculus.extend_deriv
/-... |
6ac1dd775591252cc4aa25ca534d5af22d99b81f | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/set_theory/ordinal.lean | 1962517056aa0fc2152c9247726394cd0d1bfac6 | [
"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 | 59,362 | 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 data.sum.order
import order.conditionally_complete_lattice
import order.succ_pred.basic
import set_theory.cardinal
/-!
# Ordinals
Ordinals ... |
4cfc4286249615ee2196c83eb76f0d21244fc4eb | 94e33a31faa76775069b071adea97e86e218a8ee | /src/set_theory/ordinal/basic.lean | 69d709f90437e096d5ea9f78e26388d81cd1229f | [
"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 | 47,863 | 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 data.sum.order
import order.initial_seg
import set_theory.cardinal.basic
/-!
# Ordinals
Ordinals are defined as equivalences of well-ordere... |
9de1d36d5494043ebfa88011a3a003939494b368 | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/algebraic_geometry/structure_sheaf.lean | c027db8e60d2c90952f4e09dade0e35a19031014 | [
"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 | 34,873 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Scott Morrison
-/
import algebraic_geometry.prime_spectrum
import algebra.category.CommRing.colimits
import algebra.category.CommRing.limits
import topology.sheaves.loc... |
e5d590b26f7e246b8bb7b6c9c275709e71c185d5 | ae1e94c332e17c7dc7051ce976d5a9eebe7ab8a5 | /tests/lean/run/Reparen.lean | 18ba96d65ead3a0f101b0761821b6dd2d8e335d7 | [
"Apache-2.0"
] | permissive | dupuisf/lean4 | d082d13b01243e1de29ae680eefb476961221eef | 6a39c65bd28eb0e28c3870188f348c8914502718 | refs/heads/master | 1,676,948,755,391 | 1,610,665,114,000 | 1,610,665,114,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,010 | lean | /-! Reprint file after removing all parentheses and then passing it through the parenthesizer -/
import Lean.Parser
open Lean
open Std.Format open Std
def unparenAux (parens body : Syntax) : Syntax :=
match parens.getHeadInfo, body.getHeadInfo, body.getTailInfo, parens.getTailInfo with
| some bi', some bi, some ti, s... |
6aee05bedac783e836cfed0bd26dbc45cf0e134a | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /src/group_theory/congruence.lean | 07ca22fdf1bab318fc7016b91ab6beba75b4ebcb | [
"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 | 42,772 | lean | /-
Copyright (c) 2019 Amelia Livingston. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Amelia Livingston
-/
import data.setoid.basic
import algebra.pi_instances
/-!
# Congruence relations
This file defines congruence relations: equivalence relations that preserve a ... |
fd6e3be7f04c75f81090715781625725af95fa22 | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch5/ex0404.lean | 165b49dcae695b99bce0b07423957486a2bad18d | [] | no_license | Ailrun/Theorem_Proving_in_Lean | ae6a23f3c54d62d401314d6a771e8ff8b4132db2 | 2eb1b5caf93c6a5a555c79e9097cf2ba5a66cf68 | refs/heads/master | 1,609,838,270,467 | 1,586,846,743,000 | 1,586,846,743,000 | 240,967,761 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 534 | lean | example (p q r : Prop) : p ∧ (q ∨ r) ↔ (p ∧ q) ∨ (p ∧ r) :=
begin
apply iff.intro,
intro h,
cases h.right with hq hr,
show (p ∧ q) ∨ (p ∧ r),
{ left, split, exact h.left, assumption },
show (p ∧ q) ∨ (p ∧ r),
{ right, split, exact h.left, assumption },
intro h,
cases h with... |
d96aca79d08d460c3367deb28cc0b8505f806398 | fe84e287c662151bb313504482b218a503b972f3 | /src/combinatorics/binseq.lean | f594d91e294fd3081dc4820a2ee919c1b4d607a3 | [] | 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 | 19,668 | lean | /-
Copyright (c) 2019 Neil Strickland. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Neil Strickland
-/
import data.list.basic data.vector data.finset data.nat.choose
import data.fintype.basic
import combinatorics.shift
import tactic.squeeze
namespace combinatorics... |
04202909caccdbf3a82300e07dff8634eb6bc1bf | 618003631150032a5676f229d13a079ac875ff77 | /src/data/equiv/list.lean | 492935d3d1112d08b57000d0c90b08c29524d3d5 | [
"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 | 10,296 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
Additional equiv and encodable instances for lists, finsets, and fintypes.
-/
import data.equiv.denumerable
open nat list
namespace encodable
variables {α : Type*}
se... |
b14c32f5f47344f763f77ec988072f501aa9b8bd | 9b9a16fa2cb737daee6b2785474678b6fa91d6d4 | /src/set_theory/ordinal.lean | a4b6f5a7e2292e77f2e426bcfe210ee2654286b9 | [
"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 | 124,776 | 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
Ordinal arithmetic.
Ordinals are defined as equivalences of well-ordered sets by order isomorphism.
-/
import order.order_iso set_theory.cardinal data.sum
noncomputable... |
cfdf37d73453eae9abb98eab9fdb0e32172f463a | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/1301.lean | ba57c1a0948b2894f14856b80513a09470fb5835 | [
"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 | 247 | lean | syntax "tac" : tactic
theorem a : True := by tac
#check a -- should be declared
theorem a' : True ∧ True := ⟨by tac, by tac⟩
#check a' -- should be declared
syntax "term" : term
def b (n : Nat) : Nat := term
#print b -- should be declared
|
46a403d323fb821834cfce15d69cd85c3bcb5636 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /archive/imo/imo2013_q5.lean | 261f9526df2d74d5b16da7d7e967863191d39efd | [
"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,983 | lean | /-
Copyright (c) 2021 David Renshaw. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Renshaw
-/
import algebra.geom_sum
import data.rat.defs
import data.real.basic
import tactic.positivity
/-!
# IMO 2013 Q5
Let `ℚ>₀` be the positive rational numbers. Let `f : ℚ... |
1f01bb92271ca02cb9547e27a71cdd3a573e5c05 | c8b4b578b2fe61d500fbca7480e506f6603ea698 | /src/flt_three/odd_prime_or_four.lean | ecd367c44595a58631818c79bd8b58116c3d187a | [] | no_license | leanprover-community/flt-regular | aa7e564f2679dfd2e86015a5a9674a6e1197f7cc | 67fb3e176584bbc03616c221a7be6fa28c5ccd32 | refs/heads/master | 1,692,188,905,751 | 1,691,766,312,000 | 1,691,766,312,000 | 421,021,216 | 19 | 4 | null | 1,694,532,115,000 | 1,635,166,136,000 | Lean | UTF-8 | Lean | false | false | 11,430 | lean | /-
Copyright (c) 2020 Ruben Van de Velde. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
-/
import data.int.parity
import ring_theory.int.basic
import ring_theory.prime
/-- Being equal to `4` or odd. -/
def odd_prime_or_four (z : ℤ) : Prop :=
z = 4 ∨ (prime z ∧ odd z)
lemm... |
0c096eb6b2d63b5c0c44bc05d12a13b1d62f758e | 60bf3fa4185ec5075eaea4384181bfbc7e1dc319 | /src/game/sup_inf/level02.lean | 50856ce8a3222e21f3397c1ada22614202fa23e5 | [
"Apache-2.0"
] | permissive | anrddh/real-number-game | 660f1127d03a78fd35986c771d65c3132c5f4025 | c708c4e02ec306c657e1ea67862177490db041b0 | refs/heads/master | 1,668,214,277,092 | 1,593,105,075,000 | 1,593,105,075,000 | 264,269,218 | 0 | 0 | null | 1,589,567,264,000 | 1,589,567,264,000 | null | UTF-8 | Lean | false | false | 1,458 | lean | import data.real.basic
namespace xena -- hide
-- World name : Sup and Inf
/-
# Chapter 3 : Sup and Inf
## Level 2
-/
/-
The completeness axiom on the reals states that any non-empty subset
$X \subseteq \mathbb{R}$ that is bounded above has a least upper bound.
Here we explore the converse statement: any set of ... |
5a4f7495b15aa6133ea8b1073bd02d13b2d08425 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/pendingMVarIssue.lean | 0479f6c0bf8fa4d5f19e99896914546ad36817ab | [
"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 | 318 | lean | structure Point where
x : Nat
y : Nat
def Point.compute1 (p : Point) : Point :=
let p := { p with x := 1 }
let p := { p with y := 0 }
if (p.x - p.y) > p.x then p else p
def Point.compute2 (p : Point) : Point :=
let q := { p with x := 1 }
let r := { q with y := 0 }
if (r.x - r.y) > r.x then r else r
|
d1d09968b62c5a49187acdb6ef536854121797ab | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/measure_theory/function/l2_space.lean | f865a5f5c37e501f5ace1ac420d40a41b991bafa | [
"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 | 10,964 | lean | /-
Copyright (c) 2021 Rémy Degenne. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Rémy Degenne
-/
import analysis.inner_product_space.basic
import measure_theory.integral.set_integral
/-! # `L^2` space
If `E` is an inner product space over `𝕜` (`ℝ` or `ℂ`), then `L... |
b592885e5e9615c840a5b2279699e338e2fada51 | 947b78d97130d56365ae2ec264df196ce769371a | /tests/lean/stdio.lean | 5da4c779c1b66dee2f7fbf3fe3170ebe1e061e13 | [
"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 | 783 | lean | new_frontend
open IO.FS
def usingIO {α} (x : IO α) := x
#eval usingIO do
let out ← IO.getStdout;
(out.putStrLn "print stdout" : IO Unit)
#eval usingIO do
let err ← IO.getStderr;
(err.putStr "print stderr" : IO Unit)
open usingIO IO
def test : IO Unit := do
FS.withFile "stdout1.txt" IO.FS.Mode.write $ fun h₁ => do
{ ... |
13242860d89cb6df9ff25b81608436dc884acee0 | 5c4a0908390c4938ae21bc616ff2a969ce62fd76 | /library/theories/analysis/normed_space.lean | 60541bd658154d838dd9b4625a5040d5e0ef4b42 | [
"Apache-2.0"
] | permissive | Bpalkmim/lean | 968be8a73a06fa6db19073cd463d2093464dc0f6 | 994815bc7793f5765beb693c82341cf01d20d807 | refs/heads/master | 1,610,964,748,106 | 1,455,564,675,000 | 1,455,564,675,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,427 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad
Normed spaces.
-/
import algebra.module .metric_space
open real nat classical
noncomputable theory
structure has_norm [class] (M : Type) : Type :=
(norm : M → ℝ)
namespa... |
2cc1d03f1502f55e62ae08b627f56fe106b895b3 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/algebra/continued_fractions/computation/basic.lean | e1dbd81ab9e8c89a383dc835fd855600028cef63 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,568 | lean | /-
Copyright (c) 2020 Kevin Kappelmann. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Kappelmann
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.algebra.continued_fractions.basic
import Mathlib.algebra.ordered_field
import Mathlib.a... |
e9f31bfd0283241e8191ef0bf3bf0badb463c63e | a4673261e60b025e2c8c825dfa4ab9108246c32e | /src/Lean/Meta/DiscrTreeTypes.lean | 7d6413bb94c4bda5352f7357032468557038dd94 | [
"Apache-2.0"
] | permissive | jcommelin/lean4 | c02dec0cc32c4bccab009285475f265f17d73228 | 2909313475588cc20ac0436e55548a4502050d0a | refs/heads/master | 1,674,129,550,893 | 1,606,415,348,000 | 1,606,415,348,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,489 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Expr
namespace Lean.Meta
/- See file `DiscrTree.lean` for the actual implementation and documentation. -/
namespace DiscrTree
inductive Key ... |
483435af401fc1833a30b6181b98399c2f9af1ed | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/playground/dir.lean | 84d947e65852bd44e7b4722ae3ad851f6b1be5c6 | [
"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 | 232 | lean | def main (xs : List String) : IO Unit :=
do
b₁ ← IO.isDir xs.head;
b₂ ← IO.fileExists xs.head;
d₁ ← IO.appDir;
d₂ ← IO.realPath ".";
IO.println b₁;
IO.println b₂;
IO.println d₁;
IO.println d₂
|
0d1d823a6a6057ebf56a7847c6a49f6df18a77b8 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/int/order/lemmas.lean | 9a3e5142a689107005da95be0bf8194de5049749 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 2,155 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
-/
import data.int.order.basic
import algebra.group_with_zero.divisibility
import algebra.order.ring.abs
/-!
# Further lemmas about the integers
> THIS FILE IS SYNCHRONI... |
ac43ec665e8932bb03c7010b21f1fe97aea9daec | 32025d5c2d6e33ad3b6dd8a3c91e1e838066a7f7 | /src/Lean/Elab/Syntax.lean | f66441040847d1de103ff15203b60668cb877ca1 | [
"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 | 21,229 | 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.Elab.Command
import Lean.Elab.Quotation
namespace Lean
namespace Elab
namespace Term
/-
Expand `optional «precedence»` where
«precedence» :=... |
3793b22b63cae774b66a3c04c797958f9a2de4f9 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/topology/sheaves/presheaf.lean | 06147fc2c2434ce0be4988a8d0d7e03203b1ba38 | [
"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 | 11,941 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Mario Carneiro, Reid Barton, Andrew Yang
-/
import category_theory.limits.kan_extension
import category_theory.adjunction
import topology.category.Top.opens
/-!
# Pres... |
fdbc639e2e903c42e67c27fc497866b1ec5de0db | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/tactic1.lean | 6fc22372a4d080d1f4fc4a0eca48c12416824504 | [
"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 | 282 | lean | variables p q r : Bool
(*
local env = get_environment()
local conjecture = parse_lean('p → q → p && q')
local tac = Repeat(conj_tac() ^ assumption_tac())
local proof = tac:solve(env, context(), conjecture)
env:add_theorem("T1", conjecture, proof)
*)
print environment 1.
|
904812191f5154f48caa03adf2f04d8507a4ac66 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/group_theory/specific_groups/alternating.lean | 89f6761f9cde42ad46b36cb47fc3093dfd4a631d | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 15,216 | lean | /-
Copyright (c) 2021 Aaron Anderson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson
-/
import algebra.group.conj_finite
import group_theory.perm.fin
import group_theory.subgroup.simple
import tactic.interval_cases
/-!
# Alternating Groups
> THIS FILE... |
d121c6638b4e1d2d1bbaf4f083d78dedcd5099df | 1abd1ed12aa68b375cdef28959f39531c6e95b84 | /src/algebra/module/basic.lean | 5de1027ecc45fbea6785141f206b4d58c5e38632 | [
"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 | 23,137 | lean | /-
Copyright (c) 2015 Nathaniel Thomas. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nathaniel Thomas, Jeremy Avigad, Johannes Hölzl, Mario Carneiro
-/
import algebra.big_operators.basic
import algebra.smul_with_zero
import group_theory.group_action.group
import tact... |
b12de75b195733fe2ae2f239602988169b5c3fae | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/mario_type_context.lean | 2fcdb12cffa3c35858e898dbf693c857f3668f2b | [
"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 | 995 | lean | -- see https://leanprover.zulipchat.com/#narrow/stream/116395-maths/topic/witt.20vectors/near/168407094
set_option profiler true
open tactic
constant semiring : Type → Type
constant comm_semiring : Type → Type
constant ring : Type → Type
constant comm_ring : Type → Type
attribute [class] semiring comm_semiring ring c... |
5bc24d3a4eb55e73e03589dd23043660deb93687 | 2a70b774d16dbdf5a533432ee0ebab6838df0948 | /_target/deps/mathlib/src/topology/uniform_space/basic.lean | 1041c1f1a03c0f48558c654665261bcfe0514354 | [
"Apache-2.0"
] | permissive | hjvromen/lewis | 40b035973df7c77ebf927afab7878c76d05ff758 | 105b675f73630f028ad5d890897a51b3c1146fb0 | refs/heads/master | 1,677,944,636,343 | 1,676,555,301,000 | 1,676,555,301,000 | 327,553,599 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 70,689 | 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, Patrick Massot
-/
import order.filter.lift
import topology.separation
/-!
# Uniform spaces
Uniform spaces are a generalization of metric spaces and top... |
16d900b0c5b2f1479f655320e947276760acc567 | 690889011852559ee5ac4dfea77092de8c832e7e | /test/simps.lean | bf1db8c5a39c568fbd60b06f38c8a0fae4860463 | [
"Apache-2.0"
] | permissive | williamdemeo/mathlib | f6df180148f8acc91de9ba5e558976ab40a872c7 | 1fa03c29f9f273203bbffb79d10d31f696b3d317 | refs/heads/master | 1,584,785,260,929 | 1,572,195,914,000 | 1,572,195,913,000 | 138,435,193 | 0 | 0 | Apache-2.0 | 1,529,789,739,000 | 1,529,789,739,000 | null | UTF-8 | Lean | false | false | 5,337 | lean | import tactic.simps
open function tactic expr
structure equiv (α : Sort*) (β : Sort*) :=
(to_fun : α → β)
(inv_fun : β → α)
(left_inv : left_inverse inv_fun to_fun)
(right_inv : right_inverse inv_fun to_fun)
infix ` ≃ `:25 := equiv
namespace foo
@[simps] protected def rfl {α} : α ≃ α :=
⟨id, λ x, x, λ x, rfl,... |
a951154066eeb7dca758d485560e6d1d236084ad | 3446e92e64a5de7ed1f2109cfb024f83cd904c34 | /src/game/world3/level5.lean | cdf6f490ffd963b55f1c9671d7880fbc7ca8bf22 | [] | no_license | kckennylau/natural_number_game | 019f4a5f419c9681e65234ecd124c564f9a0a246 | ad8c0adaa725975be8a9f978c8494a39311029be | refs/heads/master | 1,598,784,137,722 | 1,571,905,156,000 | 1,571,905,156,000 | 218,354,686 | 0 | 0 | null | 1,572,373,319,000 | 1,572,373,318,000 | null | UTF-8 | Lean | false | false | 1,100 | lean | import game.world3.level4 -- hide
import mynat.mul -- hide
namespace mynat -- hide
/-
# Multiplication World
## Level 5: `mul_assoc`
Currently our tools for multiplication include the
following:
* `mul_zero : ∀ m, m * 0 = 0`
* `zero_mul : ∀ m, 0 * m = m`
* `mul_succ : ∀ a b, a * succ b = a * b + b`
* `mul_add : ∀... |
8098972600e3e5272dce0115d53054d58915202d | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/data/int/comp_lemmas_auto.lean | 4699da38b653fd27307ab55ba763da2c35ae00e9 | [] | 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 | 4,366 | 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
Auxiliary lemmas used to compare int numerals.
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.data.int.order
namespace Mathlib
namespace int
/- Au... |
0a8932c953df8889294720980c31894128ec7f20 | ae1e94c332e17c7dc7051ce976d5a9eebe7ab8a5 | /stage0/src/Lean/Server/Watchdog.lean | d8ca0939304c3863b139eca08c2eda5f9f0ae8aa | [
"Apache-2.0"
] | permissive | dupuisf/lean4 | d082d13b01243e1de29ae680eefb476961221eef | 6a39c65bd28eb0e28c3870188f348c8914502718 | refs/heads/master | 1,676,948,755,391 | 1,610,665,114,000 | 1,610,665,114,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 20,535 | lean | /-
Copyright (c) 2020 Marc Huisinga. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Marc Huisinga, Wojciech Nawrocki
-/
import Init.System.IO
import Init.Data.ByteArray
import Std.Data.RBMap
import Lean.Elab.Import
import Lean.Data.Lsp
import Lean.Server.FileSource
... |
6ddb03fda7c1f13096ab916c87dced96c9eb1096 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /src/Init/Data/List/BasicAux.lean | 6e3b2d521dc7a27ac195c4e6c6d8e532c1243242 | [
"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,770 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
prelude
import Init.Data.List.Basic
import Init.Util
universes u
namespace List
/- The following functions can't be defined at `init.data.list.basic`, beca... |
b67c98cc00b7f7d3feaea0fbe89088dcaa6d8111 | 8e6cad62ec62c6c348e5faaa3c3f2079012bdd69 | /src/linear_algebra/quadratic_form.lean | 4b1223d03f3c8f302da73bd9268faab15b97cdb9 | [
"Apache-2.0"
] | permissive | benjamindavidson/mathlib | 8cc81c865aa8e7cf4462245f58d35ae9a56b150d | fad44b9f670670d87c8e25ff9cdf63af87ad731e | refs/heads/master | 1,679,545,578,362 | 1,615,343,014,000 | 1,615,343,014,000 | 312,926,983 | 0 | 0 | Apache-2.0 | 1,615,360,301,000 | 1,605,399,418,000 | Lean | UTF-8 | Lean | false | false | 28,326 | lean | /-
Copyright (c) 2020 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Anne Baanen
-/
import algebra.invertible
import linear_algebra.bilinear_form
import linear_algebra.determinant
import linear_algebra.special_linear_group
/-!
# Quadratic forms
This file... |
0cfb485476fdaf982d892713776a1d9016140844 | 3f7026ea8bef0825ca0339a275c03b911baef64d | /src/logic/basic.lean | 740456a2190321fd1ecb4d4f4e40b3180cdf15a8 | [
"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 | 28,357 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura
Theorems that require decidability hypotheses are in the namespace "decidable".
Classical versions are in the namespace "classical".
Note: in the pres... |
a5858f59a54bdced53003d7f06eaef28bad42f99 | d8870c0d7a56f998464cfef82fdac792d2fd9dac | /homework/teamwork1.lean | 774cc8499b53cd1dcf08c770468fb65494b986c7 | [] | no_license | williamdemeo/math2001-spring2019 | 565b70405e7b92c5f93a295d2114729786350b78 | 1b3bf3e0bf53684b064b3f96210ce1022850ebf0 | refs/heads/master | 1,587,030,510,505 | 1,558,394,100,000 | 1,558,394,100,000 | 165,477,693 | 2 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 573 | lean | -- Teamwork 1
-- Due: Friday 15 February by 2pm
-- Instructions. Replace each "sorry" with a proof of the given statement.
variables A B C D : Prop
-- Exercise 1
example : A ∧ (A → B) → B := sorry
-- Exercise 2
example : A → ¬ (¬ A ∧ B) := sorry
example (h : false) : A := sorry
-- Exercise 3
example : ¬ (A ∧ B) ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.