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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
38e784f3a6cbaaef8bd2cb14815de02720efbba8 | 36c7a18fd72e5b57229bd8ba36493daf536a19ce | /hott/types/nat/order.hlean | b0179f54e0242088c55ad7819919f42998ac43ff | [
"Apache-2.0"
] | permissive | YHVHvx/lean | 732bf0fb7a298cd7fe0f15d82f8e248c11db49e9 | 038369533e0136dd395dc252084d3c1853accbf2 | refs/heads/master | 1,610,701,080,210 | 1,449,128,595,000 | 1,449,128,595,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 14,189 | 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, Leonardo de Moura, Jeremy Avigad
The order relation on the natural numbers.
Note: this file has significant differences than the standard library version
-/
impo... |
cf6dab92f05f7fb6ebe33a54e9ddec25aa774302 | 4fa118f6209450d4e8d058790e2967337811b2b5 | /src/Spa/localization_Huber.lean | 99b5816112b08f27e42c067132fe7feb1d5ba72f | [
"Apache-2.0"
] | permissive | leanprover-community/lean-perfectoid-spaces | 16ab697a220ed3669bf76311daa8c466382207f7 | 95a6520ce578b30a80b4c36e36ab2d559a842690 | refs/heads/master | 1,639,557,829,139 | 1,638,797,866,000 | 1,638,797,866,000 | 135,769,296 | 96 | 10 | Apache-2.0 | 1,638,797,866,000 | 1,527,892,754,000 | Lean | UTF-8 | Lean | false | false | 7,239 | lean | import Huber_ring.localization
import Spa.rational_open_data
/-!
# Extending continuous valuations on Huber rings
In this file, we extend continuous valuations on Huber rings R
to rational localizations R(T/s) and their completions.
This is an important step in the definition of the structure presheaf on the adic sp... |
98e05badb56db8e8ecd4448cb62baae1fae0eccb | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/analysis/asymptotics/specific_asymptotics.lean | b98632ff3194edec510dda9c4e8c6f9128c44545 | [
"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 | 7,015 | lean | /-
Copyright (c) 2021 Anatole Dedecker. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anatole Dedecker
-/
import analysis.normed.order.basic
import analysis.asymptotics.asymptotics
/-!
# A collection of specific asymptotic results
> THIS FILE IS SYNCHRONIZED WITH MA... |
47baff76e13d1c57cec648653a1b62edee3be603 | acc85b4be2c618b11fc7cb3005521ae6858a8d07 | /data/set/intervals.lean | e2308eba3146e87c95cdfd414d935bafdb1a33e8 | [
"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 | 3,426 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Johannes Hölzl
Intervals
Nameing conventions:
`i`: infinite
`o`: open
`c`: closed
Each interval has the name `I` + letter for left side + letter for right side
TODO: This is j... |
b3d52f47138311ab7e5f06f8a20017ec9e0d81f8 | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/data/int/gcd.lean | 36524cc424548c94c9313bcae219e3f897c41258 | [
"Apache-2.0"
] | permissive | troyjlee/mathlib | e18d4b8026e32062ab9e89bc3b003a5d1cfec3f5 | 45e7eb8447555247246e3fe91c87066506c14875 | refs/heads/master | 1,689,248,035,046 | 1,629,470,528,000 | 1,629,470,528,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 24,418 | lean | /-
Copyright (c) 2018 Guy Leroy. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sangwoo Jo (aka Jason), Guy Leroy, Johannes Hölzl, Mario Carneiro
-/
import data.nat.prime
/-!
# Extended GCD and divisibility over ℤ
## Main definitions
* Given `x y : ℕ`, `xgcd x y` com... |
1786334d9bd4c1d86514da96d4b7aa44818be945 | 367134ba5a65885e863bdc4507601606690974c1 | /src/data/padics/padic_norm.lean | ce6792dcc5be65b1b285579966d5633fc9fbf302 | [
"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 | 26,106 | lean | /-
Copyright (c) 2018 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
-/
import ring_theory.int.basic
import algebra.field_power
import ring_theory.multiplicity
import data.real.cau_seq
import tactic.ring_exp
import tactic.basic
/-!
# p... |
d737af588e2a9ffa48a1b6266aa3e86003c075c3 | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/data/set/intervals/ord_connected.lean | c285ba565d30ad5b83748817fad3c70efc9d1794 | [
"Apache-2.0"
] | permissive | agjftucker/mathlib | d634cd0d5256b6325e3c55bb7fb2403548371707 | 87fe50de17b00af533f72a102d0adefe4a2285e8 | refs/heads/master | 1,625,378,131,941 | 1,599,166,526,000 | 1,599,166,526,000 | 160,748,509 | 0 | 0 | Apache-2.0 | 1,544,141,789,000 | 1,544,141,789,000 | null | UTF-8 | Lean | false | false | 4,752 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Yury G. Kudryashov
-/
import data.set.intervals.unordered_interval
import data.set.lattice
/-!
# Order-connected sets
We say that a set `s : set α` is `ord_connected` if for all `... |
d1a96fa6eafa084afe2a084b3a1b375abdfbd392 | 64874bd1010548c7f5a6e3e8902efa63baaff785 | /hott/algebra/precategory/natural_transformation.hlean | 638b83332d73c857b27ba8d6ee8cbef2049319ed | [
"Apache-2.0"
] | permissive | tjiaqi/lean | 4634d729795c164664d10d093f3545287c76628f | d0ce4cf62f4246b0600c07e074d86e51f2195e30 | refs/heads/master | 1,622,323,796,480 | 1,422,643,069,000 | 1,422,643,069,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,754 | 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, Jakob von Raumer
import .functor types.pi
open eq precategory functor truncation equiv sigma.ops sigma is_equiv function pi
inductive natural_transformation ... |
bd14216aa11498f844ea39eca678d9277566a8e7 | 07f5f86b00fed90a419ccda4298d8b795a68f657 | /library/data/rbtree/insert.lean | f71d24ea0b75032ee683d733b67dd6cbace57f07 | [
"Apache-2.0"
] | permissive | VBaratham/lean | 8ec5c3167b4835cfbcd7f25e2173d61ad9416b3a | 450ca5834c1c35318e4b47d553bb9820c1b3eee7 | refs/heads/master | 1,629,649,471,814 | 1,512,060,373,000 | 1,512,060,469,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 31,568 | 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.find
universes u v
/- TODO(Leo): remove after we cleanup stdlib simp lemmas -/
local attribute [-simp] or.comm or.left_comm or.assoc and... |
21d27811ba2170c7e4d66dd90570252e4a7cfb13 | a9fe717b93ccfa4b2e64faeb24f96dfefb390240 | /is_lia.lean | b6cf4740216c0a366fed5603ad525db15ff096c6 | [] | no_license | skbaek/omega | ab1f4a6daadfc8c855f14c39d9459ab841527141 | 715e384ed14e8eb177a326700066e7c98269e078 | refs/heads/master | 1,588,000,876,352 | 1,552,645,917,000 | 1,552,645,917,000 | 174,442,914 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,225 | lean | import .tactic
open tactic
meta def is_hyp (x : expr) : tactic bool :=
infer_type x >>= is_prop
meta def is_int (x : expr) : tactic bool :=
if x = `(int) then return tt
else if x = `(nat) then return ff
else failed
meta def is_lia_form : expr → tactic bool
| `(true) := failed
| `(false) := failed
| `(¬ %%px) ... |
491dce6582191b65b7772017294b9a79c332ea6e | 4950bf76e5ae40ba9f8491647d0b6f228ddce173 | /src/measure_theory/borel_space.lean | 0f2214448aa06a17029447667b4cd46ec94137c4 | [
"Apache-2.0"
] | permissive | ntzwq/mathlib | ca50b21079b0a7c6781c34b62199a396dd00cee2 | 36eec1a98f22df82eaccd354a758ef8576af2a7f | refs/heads/master | 1,675,193,391,478 | 1,607,822,996,000 | 1,607,822,996,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 47,825 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Yury Kudryashov
-/
import measure_theory.measure_space
import analysis.complex.basic
import analysis.normed_space.finite_dimension
import topology.G_delta
/-!
# Borel ... |
52748af3738d3ccdb650144e74e4dd3ffdc77c27 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/tactic/squeeze.lean | 6e1219ce33d9e777b963ec50486adcfa18e74e9e | [
"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 | 14,606 | lean | /-
Copyright (c) 2019 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Simon Hudon
-/
import control.traversable.basic
import tactic.simpa
open interactive interactive.types lean.parser
private meta def loc.to_string_aux : option name → string
| none := "⊢"... |
d71895cc6d407fe4e7ded099c82769489d3965e5 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/geometry/manifold/smooth_manifold_with_corners.lean | a169d7e06bcb7a308bb8259269a3cc8a1ee0a92c | [
"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 | 32,966 | 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.times_cont_diff
import geometry.manifold.charted_space
/-!
# Smooth manifolds (possibly with boundary or corners)
A smooth manifold i... |
0a6f92da4130d3f85dee330dc09ca84c5ea2e42e | 6b02ce66658141f3e0aa3dfa88cd30bbbb24d17b | /src/Lean/Meta/LevelDefEq.lean | bfb68753c9d48d2cd8dea6173fb5addc68c82e8e | [
"Apache-2.0"
] | permissive | pbrinkmeier/lean4 | d31991fd64095e64490cb7157bcc6803f9c48af4 | 32fd82efc2eaf1232299e930ec16624b370eac39 | refs/heads/master | 1,681,364,001,662 | 1,618,425,427,000 | 1,618,425,427,000 | 358,314,562 | 0 | 0 | Apache-2.0 | 1,618,504,558,000 | 1,618,501,999,000 | null | UTF-8 | Lean | false | false | 9,150 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Meta.Basic
import Lean.Meta.InferType
namespace Lean.Meta
private partial def decAux? : Level → MetaM (Option Level)
| Level.zero _ =... |
ea202200871dd519dc02fa904e613befe4eeb97b | 54d7e71c3616d331b2ec3845d31deb08f3ff1dea | /tests/lean/run/list_notation.lean | f8447b07948897373fe6188d1258a7372a046ce5 | [
"Apache-2.0"
] | permissive | pachugupta/lean | 6f3305c4292288311cc4ab4550060b17d49ffb1d | 0d02136a09ac4cf27b5c88361750e38e1f485a1a | refs/heads/master | 1,611,110,653,606 | 1,493,130,117,000 | 1,493,167,649,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 386 | lean | open nat
#eval [1, 2, 3]
#eval to_bool $ 1 ∈ [1, 2, 3]
#eval to_bool $ 4 ∈ [1, 2, 3]
#eval [1, 2, 3] ++ [3, 4]
#eval 2 :: [3, 4]
#eval ([] : list nat)
#eval (∅ : list nat)
#eval ({1, 3, 2, 2, 3, 1} : list nat)
#eval [1, 2, 3] ∪ [3, 4, 1, 5]
#eval [1, 2, 3] ∩ [3, 4, 1, 5]
#eval (mul 10) <$> [1, 2, 3]
#check ... |
b6a38fe692a74ac4eeadcb9d19bd520899227d0c | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Meta/InferType.lean | 6249806b12448b0ae2cddb0d82adc4bbc69dec2e | [
"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 | 17,214 | 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.LBool
import Lean.Meta.Basic
namespace Lean
/--
Auxiliary function for instantiating the loose bound variables in `e` with `args[start:st... |
c920a931d359ae5d76a64f48653ae9141c843cac | 6df8d5ae3acf20ad0d7f0247d2cee1957ef96df1 | /notes/2019.10.14.prop_logic/inference_rules.lean | 74fdd73ea16b15ec098f64c2768662d51ac73a2d | [] | no_license | derekjohnsonva/CS2102 | 8ed45daa6658e6121bac0f6691eac6147d08246d | b3f507d4be824a2511838a1054d04fc9aef3304c | refs/heads/master | 1,648,529,162,527 | 1,578,851,859,000 | 1,578,851,859,000 | 233,433,207 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,330 | lean |
--import .prop_logic
import .prop_logic
open prop_logic
open prop_logic.var
open prop_logic.unOp
open prop_logic.binOp
open prop_logic.pExp
/-
Define a few propositional variables.
-/
def P := varExp (mkVar 0)
def Q := varExp (mkVar 1)
def R := varExp (mkVar 2)
/-
Which of the following propositions are valid?
A... |
f0094fcafa4c7b25d2d9f8c013a7180ea615a759 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /stage0/src/Lean/Compiler/ExternAttr.lean | 59382d1095f40b74a665cda610e902e29c0db484 | [
"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 | 6,149 | 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
import Lean.Environment
import Lean.Attributes
import Lean.ProjFns
import Lean.Meta.Basic
namespace Lean
inductive ExternEntry where
| ... |
80d866ef52600fe637196c5345ca70dd70090e85 | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /src/Lean/CoreM.lean | 9af0a13f9bae1caf2088ee678ff387ece39b19a7 | [
"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,143 | 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.RecDepth
import Lean.Util.Trace
import Lean.Data.Options
import Lean.Environment
import Lean.Exception
import Lean.InternalExceptionId
impo... |
286fdccc54188303fe0eddf8fc87f97b7f7aa296 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/struct_bug3.lean | 75bcb6f6dbc85cc84233e6797478e2bff4167b85 | [
"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 | 100 | lean | structure foo :=
(f : Π {α : Type}, α)
(g : Π {α : Type}, α := @f)
structure bar extends foo
|
84021c6243ab0389b815417b97c4d5870b7218e1 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/int/sqrt.lean | f2c7764a4e7211934b0817ee6d780d5c7284503b | [] | 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 | 861 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.nat.sqrt
import Mathlib.PostPort
namespace Mathlib
namespace int
/-- `sqrt n` is the square ... |
fcb9a3022e6c1a603807504458857303d0c1e298 | b328e8ebb2ba923140e5137c83f09fa59516b793 | /stage0/src/Lean/Util/Profile.lean | a0cd020ff12ebea92016c5afe7b38eebb72e495e | [
"Apache-2.0"
] | permissive | DrMaxis/lean4 | a781bcc095511687c56ab060e816fd948553e162 | 5a02c4facc0658aad627cfdcc3db203eac0cb544 | refs/heads/master | 1,677,051,517,055 | 1,611,876,226,000 | 1,611,876,226,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,119 | lean | /-
Copyright (c) 2019 Sebastian Ullrich. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Sebastian Ullrich
-/
import Lean.Data.Position
namespace Lean
/-- Print and accumulate run time of `act` when option `profiler` is set to `true`. -/
@[extern "lean_profileit"]
def ... |
5cbea67e74d7a132f7bf171435a990876776de68 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/prodtst.lean | 77ea839595e70666dd941e7ccf6d186ec38d056e | [
"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 | 108 | lean | --
inductive prod2 (A B : Type.{_+1})
| mk : A → B → prod2
set_option pp.universes true
#check @prod2
|
497099d83c90202d2a172c7395ce79aa184c3687 | 05b503addd423dd68145d68b8cde5cd595d74365 | /src/set_theory/ordinal.lean | 0bf67ed146495250b74da435cb66f13db111af0c | [
"Apache-2.0"
] | permissive | aestriplex/mathlib | 77513ff2b176d74a3bec114f33b519069788811d | e2fa8b2b1b732d7c25119229e3cdfba8370cb00f | refs/heads/master | 1,621,969,960,692 | 1,586,279,279,000 | 1,586,279,279,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 138,183 | 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... |
0aef8645f5b47da656f7f4391a9863dd904ef413 | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/topology/category/UniformSpace.lean | 3a16612a8285dbbba2e1c9af724157997bcd8b4c | [
"Apache-2.0"
] | permissive | agjftucker/mathlib | d634cd0d5256b6325e3c55bb7fb2403548371707 | 87fe50de17b00af533f72a102d0adefe4a2285e8 | refs/heads/master | 1,625,378,131,941 | 1,599,166,526,000 | 1,599,166,526,000 | 160,748,509 | 0 | 0 | Apache-2.0 | 1,544,141,789,000 | 1,544,141,789,000 | null | UTF-8 | Lean | false | false | 6,942 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Reid Barton, Patrick Massot, Scott Morrison
-/
import category_theory.monad.limits
import topology.uniform_space.completion
import topology.category.Top.basic
/-!
# The category of un... |
49adcec713bda3bed77e7852188c57f62ee297c0 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/data/polynomial/degree/trailing_degree.lean | 0a5853e417ba4cc7750978e3241c595608c679a6 | [
"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,162 | lean | /-
Copyright (c) 2020 Damiano Testa. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Damiano Testa
-/
import data.polynomial.degree.definitions
/-!
# Trailing degree of univariate polynomials
## Main definitions
* `trailing_degree p`: the multiplicity of `X` in the p... |
924ad9677bf6611fd0efcf11fe7e449881091cd3 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/ring_theory/algebraic.lean | 0156da504a91a66f575458bca0cb4272bdebf56c | [
"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 | 14,451 | lean | /-
Copyright (c) 2019 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import linear_algebra.finite_dimensional
import ring_theory.integral_closure
import data.polynomial.integral_normalization
/-!
# Algebraic elements and algebraic ex... |
5cd0b6c04ffa40ba0a2864648894b75b4e58678e | 38bf3fd2bb651ab70511408fcf70e2029e2ba310 | /src/topology/algebra/group.lean | a97099933eb2d3a6be59b461ed2d7e33fe88d93f | [
"Apache-2.0"
] | permissive | JaredCorduan/mathlib | 130392594844f15dad65a9308c242551bae6cd2e | d5de80376088954d592a59326c14404f538050a1 | refs/heads/master | 1,595,862,206,333 | 1,570,816,457,000 | 1,570,816,457,000 | 209,134,499 | 0 | 0 | Apache-2.0 | 1,568,746,811,000 | 1,568,746,811,000 | null | UTF-8 | Lean | false | false | 16,492 | 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
Theory of topological groups.
-/
import data.equiv.algebra
import algebra.pointwise order.filter.pointwise
import group_theory.quotient... |
cf6f86354974200c9b766f5a2855c789b823f775 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/order/complete_boolean_algebra.lean | d084d45c86a3a316f6ac4d89fa0a82d7df29a175 | [
"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 | 12,222 | 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.complete_lattice
/-!
# Frames, completely distributive lattices and Boolean algebras
In this file we define and provide API for frames, c... |
f46920dd5146e1e3ef83b2282c7c036e94251743 | fd71e7836e9a5d14548f6d3291653cbb6c608dbe | /test/examples.lean | 2391dabb0c6b6c420dbf78c1d55dd283772b8257 | [] | no_license | cipher1024/slim_check | 382c80a98aed105a97eeac84f590a06dca4d8c7d | 5969b7f72e01fdd46f2502ed0cbf69c0699061d4 | refs/heads/master | 1,625,514,334,828 | 1,574,118,572,000 | 1,574,118,572,000 | 101,538,155 | 2 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 2,252 | lean |
import test.slim_check.tactics
namespace slim_check.examples
example : ∀ n : ℕ, n > n+1 :=
by expect_failure { slim_check }
open slim_check
run_cmd tactic.unsafe_run_io $ @testable.check (∀ n : ℕ, n > n+1) _ 100
run_cmd tactic.unsafe_run_io $ @testable.check (∀ n m : ℕ, n ≤ m) _ 100
run_cmd tactic.unsafe_run_io $... |
f26132f7c22c772d2021ff9079fd4832e1d4adfd | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/tactic/subtype_instance.lean | 0b6ac167a6f1934daa6c59f6efeec3ca4e59b168 | [
"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,443 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
Provides a `subtype_instance` tactic which builds instances for algebraic substructures
(sub-groups, sub-rings...).
-/
import data.string.basic
open tactic expr name list
na... |
c6a956cc5159d56e48f46bcd5385b794cf8f9dc0 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /test/pi_simp.lean | 726e925ce837fce7c93ea8e9d295bba2686cf6e9 | [
"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 | 649 | 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 algebra.group.pi
/-!
Test if `simp` can use a lemma about `pi.has_one` to simplify `1` coming from `pi.group`
-/
variables {I : Type*} {f : Π i : I, ... |
9274d11e7e3f4a57a49e3fab0132c68ea0cdd009 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/combinatorics/simple_graph/regularity/energy.lean | a4624af98ae2016b09c6fffc1610935c1b2bf3c1 | [
"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 | 1,760 | lean | /-
Copyright (c) 2022 Yaël Dillies, Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies, Bhavik Mehta
-/
import algebra.big_operators.order
import algebra.module.basic
import combinatorics.simple_graph.density
/-!
# Energy of a partition
> THIS ... |
951568cd5589df280b8b599bb6b6dcfafe904f4b | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/combinatorics/hall/finite.lean | 921de79ee91db3041424f7f2e330c8cf5eeb927a | [
"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,949 | lean | /-
Copyright (c) 2021 Alena Gusakov, Bhavik Mehta, Kyle Miller. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Alena Gusakov, Bhavik Mehta, Kyle Miller
-/
import data.fintype.basic
import data.set.finite
/-!
# Hall's Marriage Theorem for finite index types
This modul... |
13ccde98c076df31b999440fe6bc0ff610118e4f | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/number_theory/lucas_lehmer.lean | 5dfd6749a4ff3549fbfce0303fcfb8807a441bf1 | [
"Apache-2.0"
] | permissive | agjftucker/mathlib | d634cd0d5256b6325e3c55bb7fb2403548371707 | 87fe50de17b00af533f72a102d0adefe4a2285e8 | refs/heads/master | 1,625,378,131,941 | 1,599,166,526,000 | 1,599,166,526,000 | 160,748,509 | 0 | 0 | Apache-2.0 | 1,544,141,789,000 | 1,544,141,789,000 | null | UTF-8 | Lean | false | false | 17,134 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro, Scott Morrison, Ainsley Pahljina
-/
import tactic.ring_exp
import tactic.interval_cases
import data.nat.parity
import data.zmod.basic
import group_theory.order_of_elemen... |
554353c58b96cd523c6f56e77c8022b7998cb9c7 | 432d948a4d3d242fdfb44b81c9e1b1baacd58617 | /src/data/nat/choose/basic.lean | 768bd0c7ec0c096b780803aa0d09f304d12fe309 | [
"Apache-2.0"
] | permissive | JLimperg/aesop3 | 306cc6570c556568897ed2e508c8869667252e8a | a4a116f650cc7403428e72bd2e2c4cda300fe03f | refs/heads/master | 1,682,884,916,368 | 1,620,320,033,000 | 1,620,320,033,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,629 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Bhavik Mehta
-/
import data.nat.factorial
/-!
# Binomial coefficients
This file contains a definition of binomial coefficients and simple lemmas (i.e. those not
requiring ... |
7dd3a4fb42e2122e65753562f241c8e7cb8c3059 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/set_theory/game/impartial.lean | 94076d236cf679c6067feb405d19c71695e7d9a9 | [
"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 | 6,901 | lean | /-
Copyright (c) 2020 Fox Thomson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Fox Thomson
-/
import set_theory.game.basic
import tactic.nth_rewrite
/-!
# Basic definitions about impartial (pre-)games
We will define an impartial game, one in which left and right ... |
f98472a90d2b714e9d62a55a1d2af93bd46b0a3a | 4f065978c49388d188224610d9984673079f7d91 | /recursion.lean | d5285c5743ad26f6ca7bda0c177538ddb90ca4a1 | [] | no_license | kckennylau/Lean | b323103f52706304907adcfaee6f5cb8095d4a33 | 907d0a4d2bd8f23785abd6142ad53d308c54fdcb | refs/heads/master | 1,624,623,720,653 | 1,563,901,820,000 | 1,563,901,820,000 | 109,506,702 | 3 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 5,805 | lean | /-
f = ( nat n ↦ ( n<3 ? n : ( even(n) ? f(n−2)+f(n−3) : f(n−1)+f(n+1) ) ) )
where even = ( nat n ↦ exists m in nat ( m*2=n ) )
-/
def even : nat → Prop :=
λ n, ∃ m, m * 2 = n
def odd : nat → Prop :=
λ n, ∃ m, nat.succ (m * 2) = n
theorem even_xor_odd (n : nat) : xor (even n) (odd n) :=
begin
induction n with n ih... |
643832bf42ffe04f4e066e76bb209b9fa3dc94de | 3dd1b66af77106badae6edb1c4dea91a146ead30 | /tests/lean/run/class8.lean | 34956fe3ce357a0e1f76d858d36ec4595768e102 | [
"Apache-2.0"
] | permissive | silky/lean | 79c20c15c93feef47bb659a2cc139b26f3614642 | df8b88dca2f8da1a422cb618cd476ef5be730546 | refs/heads/master | 1,610,737,587,697 | 1,406,574,534,000 | 1,406,574,534,000 | 22,362,176 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 939 | lean | import standard
using num tactic pair
inductive inh (A : Type) : Prop :=
| inh_intro : A -> inh A
instance inh_intro
theorem inh_elim {A : Type} {B : Prop} (H1 : inh A) (H2 : A → B) : B
:= inh_rec H2 H1
theorem inh_exists [instance] {A : Type} {P : A → Prop} (H : ∃x, P x) : inh A
:= obtain w Hw, from H, inh_intro w... |
3e7f305e18ece49295dd980864007eb20e3a02cd | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/data/nat/modeq.lean | f5564bfc25c27e2d7926efb9e58d73e5c1d189bd | [
"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,718 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.int.gcd
import data.list.rotate
import tactic.abel
/-!
# Congruences modulo a natural number
This file defines the equivalence relation `a ≡ b [MOD n]` ... |
e2bf8f833397c32035b0c80fc41c6679cdc97537 | 626e312b5c1cb2d88fca108f5933076012633192 | /src/algebra/opposites.lean | f1606b5bbdb19805d0a75f5e06d757e486fccf48 | [
"Apache-2.0"
] | permissive | Bioye97/mathlib | 9db2f9ee54418d29dd06996279ba9dc874fd6beb | 782a20a27ee83b523f801ff34efb1a9557085019 | refs/heads/master | 1,690,305,956,488 | 1,631,067,774,000 | 1,631,067,774,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 21,534 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import data.opposite
import algebra.field
import algebra.group.commute
import group_theory.group_action.defs
import data.equiv.mul_add
/-!
# Algebraic operations on `αᵒᵖ`
Thi... |
76cb68b28931c73380d087d7abc194deab7e579e | 9028d228ac200bbefe3a711342514dd4e4458bff | /src/data/vector2.lean | 5892d75fd8e09694d9e7da091e48a7940bd7034d | [
"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 | 13,680 | 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 data.vector
import data.list.nodup
import data.list.of_fn
import control.applicative
/-!
# Additional theorems about the `vector` type
This file introduces th... |
49d0bc8467279e7d1b89b1e9d85cc09bf388c108 | 6afa22d5eee6e9a56b6a2f1210eca8f7a1067466 | /library/init/meta/widget/default.lean | e7426ae63aadf17a892d43da17391a83eae6d2c6 | [
"Apache-2.0"
] | permissive | giordano/lean | 72a1fabfeb2f1ccfd38673e2719a719cd6ffbb40 | 56f8877f1efa22215aca0b82f1c0ce2ff975b9c3 | refs/heads/master | 1,663,091,511,168 | 1,590,688,082,000 | 1,590,688,082,000 | 268,183,678 | 0 | 0 | Apache-2.0 | 1,590,885,425,000 | 1,590,885,424,000 | null | UTF-8 | Lean | false | false | 369 | lean | /-
Copyright (c) E.W.Ayers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: E.W.Ayers
-/
prelude
import init.meta.widget.basic
import init.meta.widget.interactive_expr
import init.meta.widget.tactic_component
import init.meta.widget.html_cmd
import init.meta.widget.comp... |
e9f9807cda9059db1051cddddd5daa169dca5850 | 8e6cad62ec62c6c348e5faaa3c3f2079012bdd69 | /src/linear_algebra/determinant.lean | 8b6ca8094b17d7ae32fc2d838c3e969b424e1f7f | [
"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 | 13,405 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Chris Hughes, Tim Baanen
-/
import data.matrix.pequiv
import data.fintype.card
import group_theory.perm.sign
import algebra.algebra.basic
import tactic.ring
import linear_algebra... |
384c979a8840c008093ecd3aca6ec0f14c630860 | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/set_theory/ordinal_notation.lean | e0550b0ec24389347933304534844811562a9609 | [
"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 | 35,755 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
Ordinal notations (constructive ordinal arithmetic for ordinals < ε₀).
-/
import set_theory.ordinal data.pnat.basic
open ordinal
open_locale ordinal -- get notation for ... |
628133527695a3d524c9caa6676ae35ecc9c1c43 | 07c6143268cfb72beccd1cc35735d424ebcb187b | /src/analysis/asymptotics.lean | 9d39ee644291da4c0b13bc80440757e20cedb1a2 | [
"Apache-2.0"
] | permissive | khoek/mathlib | bc49a842910af13a3c372748310e86467d1dc766 | aa55f8b50354b3e11ba64792dcb06cccb2d8ee28 | refs/heads/master | 1,588,232,063,837 | 1,587,304,803,000 | 1,587,304,803,000 | 176,688,517 | 0 | 0 | Apache-2.0 | 1,553,070,585,000 | 1,553,070,585,000 | null | UTF-8 | Lean | false | false | 44,437 | lean | /-
Copyright (c) 2019 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Yury Kudryashov
-/
import analysis.normed_space.basic topology.local_homeomorph tactic.alias
/-!
# Asymptotics
We introduce these relations:
* `is_O_with c f g l` : "... |
fcd7815898dbcdca78390a8fa729062074b966f7 | 958488bc7f3c2044206e0358e56d7690b6ae696c | /lean/tutorials/tutorial5.lean | c9c49022522a4bf40043c2a20e7de3ea886d2614 | [] | no_license | possientis/Prog | a08eec1c1b121c2fd6c70a8ae89e2fbef952adb4 | d4b3debc37610a88e0dac3ac5914903604fd1d1f | refs/heads/master | 1,692,263,717,723 | 1,691,757,179,000 | 1,691,757,179,000 | 40,361,602 | 3 | 0 | null | 1,679,896,438,000 | 1,438,953,859,000 | Coq | UTF-8 | Lean | false | false | 3,249 | lean | import data.real.basic
import algebra.group.pi
import tuto_lib
notation `|`x`|` := abs x
variables (u v w : ℕ → ℝ) (l l' : ℝ)
example : (∀ n, u n = l) → seq_limit u l :=
begin
intros H₁ ε H₂, use 0, intros n H₃, rw H₁, norm_num, linarith
end
example : l > 0 → seq_limit u l → ∃ N, ∀ n ≥ N, u n ≥ l/2 :=
begin
in... |
bb53cb68d81b7b274fc1fbda96ae16bcebd20715 | ae1e94c332e17c7dc7051ce976d5a9eebe7ab8a5 | /tests/bench/deriv.lean | 8e0c24bb1e0828a7febe10eaf2f9da8bcf2ce843 | [
"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,969 | lean | #lang lean4
/- Benchmark for new code generator -/
inductive Expr
| Val : Int → Expr
| Var : String → Expr
| Add : Expr → Expr → Expr
| Mul : Expr → Expr → Expr
| Pow : Expr → Expr → Expr
| Ln : Expr → Expr
namespace Expr
partial def pown : Int → Int → Int
| a, 0 => 1
| a, 1 => a
| a, n =>
let b := pown a (n / 2);... |
8fda7e0d57d029b0257ce4eb2ee01e43cef811af | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/analysis/calculus/fderiv.lean | 43aa9b099ff9f108481961499946e82241a2e567 | [
"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 | 114,667 | lean | /-
Copyright (c) 2019 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Sébastien Gouëzel, Yury Kudryashov
-/
import analysis.calculus.tangent_cone
import analysis.normed_space.units
/-!
# The Fréchet derivative
Let `E` and `F` be normed sp... |
550065e95c2cb5a15f976dfb220a9ae547b898c6 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/run/ind_tac1.lean | ef4d534e4897ddd1bd488a852bf74b225042e23b | [
"Apache-2.0"
] | permissive | soonhokong/lean-osx | 4a954262c780e404c1369d6c06516161d07fcb40 | 3670278342d2f4faa49d95b46d86642d7875b47c | refs/heads/master | 1,611,410,334,552 | 1,474,425,686,000 | 1,474,425,686,000 | 12,043,103 | 5 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 82 | lean | check @heq.rec_on
attribute heq.rec_on [recursor 6]
print [recursor] heq.rec_on
|
7c87d3632637cf5373e09d80c2a9746854c5f242 | 76df16d6c3760cb415f1294caee997cc4736e09b | /lean/src/tactic/with_cases.lean | aeef9cc7bc15aef571067ee8d2855fec15591b6b | [
"MIT"
] | permissive | uw-unsat/leanette-popl22-artifact | 70409d9cbd8921d794d27b7992bf1d9a4087e9fe | 80fea2519e61b45a283fbf7903acdf6d5528dbe7 | refs/heads/master | 1,681,592,449,670 | 1,637,037,431,000 | 1,637,037,431,000 | 414,331,908 | 6 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 305 | lean | import tactic.basic
open tactic.interactive
@[interactive] meta def constructor_c := `[with_cases { constructor }]
@[interactive] meta def split_c := `[with_cases { repeat { split } }]
@[interactive] meta def apply_c := with_cases ∘ apply
@[interactive] meta def by_cases_c := with_cases ∘ by_cases
|
0b8063a3a10c81c8a42dc19341b5adba956424da | 86f6f4f8d827a196a32bfc646234b73328aeb306 | /examples/introduction/unnamed_45.lean | 7f4a1b565452a054d880418532f8dedeb31e5044 | [] | no_license | jamescheuk91/mathematics_in_lean | 09f1f87d2b0dce53464ff0cbe592c568ff59cf5e | 4452499264e2975bca2f42565c0925506ba5dda3 | refs/heads/master | 1,679,716,410,967 | 1,613,957,947,000 | 1,613,957,947,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 21 | lean | #eval "Hello, World!" |
3b6420121a61c0591421ee7029c6839e7fd9eff4 | 958488bc7f3c2044206e0358e56d7690b6ae696c | /lean/hhg/chpt2.lean | f4740dbe9568f48937bc9b10e081e9aec1953a54 | [] | no_license | possientis/Prog | a08eec1c1b121c2fd6c70a8ae89e2fbef952adb4 | d4b3debc37610a88e0dac3ac5914903604fd1d1f | refs/heads/master | 1,692,263,717,723 | 1,691,757,179,000 | 1,691,757,179,000 | 40,361,602 | 3 | 0 | null | 1,679,896,438,000 | 1,438,953,859,000 | Coq | UTF-8 | Lean | false | false | 153 | lean | lemma L1 (a b : Prop) (Ha : a) (Hb : b) : a := by apply Ha
set_option pp.beta true -- aggressive beta reduction
set_option trace.simplify.rewrite true
|
fcec8fd93463b4df8b16d173a65fd2a071cb3530 | a19a4fce1e5677f4d20cbfdf60c04b6386ab8210 | /library/init/prod.lean | 6085c43c7366d6be1c61730da92766df51b0a2e7 | [
"Apache-2.0"
] | permissive | nthomas103/lean | 9c341a316e7d9faa00546462f90a8aa402e17eac | 04eaf184a92606a56e54d0d6c8d59437557263fc | refs/heads/master | 1,586,061,106,806 | 1,454,640,115,000 | 1,454,641,279,000 | 51,127,143 | 0 | 0 | null | 1,454,648,683,000 | 1,454,648,683,000 | null | UTF-8 | Lean | false | false | 3,474 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura, Jeremy Avigad
-/
prelude
import init.num init.wf
definition pair [constructor] := @prod.mk
notation A × B := prod A B
-- notation for n-ary tuples
notation `(... |
2612886d5421a6538311ab5d3424ebc73bf7c45c | fd3506535396cef3d1bdcf4ae5b87c8ed9ff2c2e | /migrated/algebra.lean | a7c4c4137facedf2fe6672f586834382c15ecea7 | [] | no_license | williamdemeo/leanproved | 77933dbcb8bfbae61a753ae31fa669b3ed8cda9d | d8c2e2ca0002b252fce049c4ff9be0e9e83a6374 | refs/heads/master | 1,598,674,802,432 | 1,437,528,488,000 | 1,437,528,488,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,520 | lean | /-
Copyright (c) 2015 Haitao Zhang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author : Haitao Zhang
-/
import algebra.group
open algebra function eq.ops
namespace migration
section group
variables {A : Type} [ambA : group A]
include ambA
theorem eq_inv_of_mul_eq_one {... |
7c4be91b6b253aa3278c43a32c72361098e24947 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/algebra/star/self_adjoint.lean | 27d5d68348dd7a7010ed4dbb806bedbf154e5ab0 | [
"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 | 6,029 | lean | /-
Copyright (c) 2021 Frédéric Dupuis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frédéric Dupuis
-/
import algebra.star.basic
import group_theory.subgroup.basic
/-!
# Self-adjoint elements of a star additive group
This file defines `self_adjoint R`, where `R` i... |
e3b4c1ab58429a99b9ac669917581bb5ecd7722c | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/588.lean | 383608452d699d3a5d2832ee74d771d2a27f2a4d | [
"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 | 341 | lean | import standard
open function
variables {a b r : Type}
definition f a := Πr, (a -> r) -> r
definition g (fn : a -> b) (sa : f a) : f b := sorry
-- ok
check λx, g id x = x
check λ(x : f a), g id x = x
universe variables l₁ l₂ l₃
check λ (x : f.{_ l₂} a), g.{_ _ l₂ l₂} id x = x
example (x : f a) : g id x = x :=
s... |
df92c94dc9dc326c24f6c57203fe589da7ee35f3 | ad3e8f15221a986da27c99f371922c0b3f5792b6 | /src/week07/e02_tactics.lean | f68ab58ee4fe347808c504ab8c901c607e498c81 | [] | no_license | VArtem/lean-itmo | a0e1424c8cc4c2de2ac85ab6fd4a12d80e9b85f1 | dc44cd06f9f5b984d051831b3aaa7364e64c2dc4 | refs/heads/main | 1,683,761,214,467 | 1,622,821,295,000 | 1,622,821,295,000 | 357,236,048 | 12 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,471 | lean | import tactic
-- Если вы не работали с монадами и do-блоками раньше, почитайте туториал в интернете
-- `tactic α` - функция, работающие в контексте состояния тактики и возвращает α
-- `tactic unit` - ничего не возвращает (или же возвращает `()`)
open tactic
meta def make_nat : tactic ℕ :=
return 42
-- Как использо... |
86e5fe8f8a09ec63d729dd26ae95f8d8a4ee0ce1 | 1a9d3677cccdaaccacb163507570e75d34043a38 | /src/week_4/Part_A_sets.lean | de93d7bc252888e06e972991e329f4acfa11e984 | [
"Apache-2.0"
] | permissive | alreadydone/formalising-mathematics | 687d386a72065795e784e270f5c05ea3948b67dd | 65869362cd7a2ac74dd1a97c7f9471835726570b | refs/heads/master | 1,680,260,936,332 | 1,616,563,371,000 | 1,616,563,371,000 | 348,780,769 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,225 | lean | import tactic -- import the tactics
import data.set.basic -- import the sets
import data.set.lattice -- infinite unions and intersections
/-
# Sets
## Introduction
In contrast to group theory, where we made our own definition
of a group and developed our own API (i.e. the lemmas we need
to prove basic results in gr... |
5ca765d45e684b1773d712841e1a6393479fad4d | 5e3548e65f2c037cb94cd5524c90c623fbd6d46a | /src_icannos_totilas/applications_lineaires/cpge_applin_5_a.lean | 78e7c182bc9f716a6abf1e26d4b16528cfa89ef7 | [] | 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 | 304 | lean | import algebra.module.linear_map
import data.real.basic
variables (R : Type*) (M : Type*) (X : Type*)
[field R] [add_comm_group M] [module R M] [set X]
[add_comm_group(X -> M)] [module R (X -> M)]
theorem cpge_applin_5_a :
∀ (a : X), ∃ g : linear_map R (X->M) M, (λf : X -> M, f a) = g := sorry |
e980af44a8d9614d914b4b518b99893ec98f25ca | 29cc89d6158dd3b90acbdbcab4d2c7eb9a7dbf0f | /Exercises week 4/21_homework_sheet.lean | d835294959cb5ca6de9c10b0040872c83c2067ae | [] | no_license | KjellZijlemaker/Logical_Verification_VU | ced0ba95316a30e3c94ba8eebd58ea004fa6f53b | 4578b93bf1615466996157bb333c84122b201d99 | refs/heads/master | 1,585,966,086,108 | 1,549,187,704,000 | 1,549,187,704,000 | 155,690,284 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,908 | lean | /- Homework 2.1: Functional Programming — Lists -/
/- Question 1: replicateting an element -/
/- 1.1. Define a function `replicate` that takes an element `a` of type `α` and a natural number `n`
and that returns a list of length `n` consisting of `n` occurrences of `a`: `[a, ..., a]` -/
def replicate {α : Type} (a: ... |
010edf0120893373e1d252e81d3f8a1f0688304e | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/data/polynomial/cardinal.lean | d9713aac0d3a8f337f1d018469e53ffa3703dada | [
"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 | 876 | lean | /-
Copyright (c) 2021 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import data.mv_polynomial.cardinal
import data.mv_polynomial.equiv
/-!
# Cardinality of Polynomial Ring
The reuslt in this file is that the cardinality of `polynomial R`... |
11b3bbf50a36fdfe18b21eeb89b96067adf99e58 | 22e97a5d648fc451e25a06c668dc03ac7ed7bc25 | /src/analysis/convex/basic.lean | 7674637e04a3e50b2d6ac4b10c8cc58282ac715d | [
"Apache-2.0"
] | permissive | keeferrowan/mathlib | f2818da875dbc7780830d09bd4c526b0764a4e50 | aad2dfc40e8e6a7e258287a7c1580318e865817e | refs/heads/master | 1,661,736,426,952 | 1,590,438,032,000 | 1,590,438,032,000 | 266,892,663 | 0 | 0 | Apache-2.0 | 1,590,445,835,000 | 1,590,445,835,000 | null | UTF-8 | Lean | false | false | 37,823 | lean | /-
Copyright (c) 2019 Alexander Bentkamp. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Alexander Bentkamp, Yury Kudriashov
-/
import data.set.intervals
import data.complex.module
import algebra.pointwise
/-!
# Convex sets and functions on real vector spaces
In a re... |
4e505a1a825b92b0a4e8d40b37987a96f5533a61 | f20db13587f4dd28a4b1fbd31953afd491691fa0 | /tests/lean/interactive/my_tac_class.lean | de071643c0a223a0f6a1577e121282ad6162acc7 | [
"Apache-2.0"
] | permissive | AHartNtkn/lean | 9a971edfc6857c63edcbf96bea6841b9a84cf916 | 0d83a74b26541421fc1aa33044c35b03759710ed | refs/heads/master | 1,620,592,591,236 | 1,516,749,881,000 | 1,516,749,881,000 | 118,697,288 | 1 | 0 | null | 1,516,759,470,000 | 1,516,759,470,000 | null | UTF-8 | Lean | false | false | 1,792 | lean | meta def mytac :=
state_t nat tactic
meta instance : monad mytac :=
state_t.monad _ _
meta instance : monad.has_monad_lift tactic mytac :=
monad.monad_transformer_lift (state_t nat) tactic
meta instance (α : Type) : has_coe (tactic α) (mytac α) :=
⟨monad.monad_lift⟩
namespace mytac
meta def step {α : Type} (t : my... |
bc3e2e50ef6d60873b5e17f40c79e8b042893360 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /leanpkg/leanpkg/git.lean | db746f8b92c040bd624b28c4a7adfa674c16b50b | [
"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 | 1,155 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Gabriel Ebner
-/
import leanpkg.lean_version system.io
variable [io.interface]
namespace leanpkg
def upstream_git_branch :=
if lean_version.is_release then
"lean-" ++ lean_... |
c7930d30dddc6be43d350e22df48fdb312dc6137 | 3dd1b66af77106badae6edb1c4dea91a146ead30 | /tests/lean/run/n1.lean | 0646d8e91f571a724e0735ed52a7a241eaf17dab | [
"Apache-2.0"
] | permissive | silky/lean | 79c20c15c93feef47bb659a2cc139b26f3614642 | df8b88dca2f8da1a422cb618cd476ef5be730546 | refs/heads/master | 1,610,737,587,697 | 1,406,574,534,000 | 1,406,574,534,000 | 22,362,176 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 843 | lean | variable A : Type.{1}
variable a : A
variable g : A → A
variable f : A → A → A
(*
local f = Const("f")
local g = Const("g")
local comma = name(",")
function parse_pair()
local p1 = parser.parse_expr()
parser.check_token_next(comma, "invalid pair, ',' expected")
print("line: " .. tostring(parser.pos()))
... |
6b27e11a4f4b023665201cc884dbad72a9b78edd | 491068d2ad28831e7dade8d6dff871c3e49d9431 | /library/data/list/sort.lean | 81981b32e4144a04b5f8a567c9694aa716885c81 | [
"Apache-2.0"
] | permissive | davidmueller13/lean | 65a3ed141b4088cd0a268e4de80eb6778b21a0e9 | c626e2e3c6f3771e07c32e82ee5b9e030de5b050 | refs/heads/master | 1,611,278,313,401 | 1,444,021,177,000 | 1,444,021,177,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,638 | lean | /-
Copyright (c) 2015 Leonardo de Moura. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
Naive sort for lists
-/
import data.list.comb data.list.set data.list.perm data.list.sorted logic.connectives algebra.order
namespace list
open decidable nat
va... |
bd3eb7e66b3fad5eadf2941ca520d2f754cbd62b | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/linear_algebra/invariant_basis_number.lean | 75a07fb8a24b028b9d71a27adeae1b0bd13d8793 | [
"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 | 12,231 | lean | /-
Copyright (c) 2020 Markus Himmel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel, Scott Morrison
-/
import ring_theory.principal_ideal_domain
import ring_theory.ideal.basic
/-!
# Invariant basis number property
We say that a ring `R` satisfies the in... |
9419f2426e4335f00d9ae3586b200a92d6e70d08 | 4bcaca5dc83d49803f72b7b5920b75b6e7d9de2d | /tests/leanpkg/user_attr_app/UserAttr.lean | 7a2ccb227cd106d6d47b259b8ed287987b34392f | [
"Apache-2.0"
] | permissive | subfish-zhou/leanprover-zh_CN.github.io | 30b9fba9bd790720bd95764e61ae796697d2f603 | 8b2985d4a3d458ceda9361ac454c28168d920d3f | refs/heads/master | 1,689,709,967,820 | 1,632,503,056,000 | 1,632,503,056,000 | 409,962,097 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 775 | lean | import UserAttr.Tst
open Lean
def tst : MetaM Unit := do
let env ← getEnv
assert! (blaAttr.hasTag env `f)
assert! (blaAttr.hasTag env `g)
assert! !(blaAttr.hasTag env `id)
pure ()
#eval tst
def declareLeanPath : MetaM Unit := do
addAndCompile <| Declaration.defnDecl {
name := `leanPath
type :=... |
d5d07e79baec3ba009747310c85da9cea3427bac | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/set_theory/schroeder_bernstein.lean | 61fe77af0942d35cb556d01e7e77e911dad69523 | [
"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 | 6,240 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro
-/
import order.fixed_points
import order.zorn
/-!
# Schröder-Bernstein theorem, well-ordering of cardinals
This file proves the Schröder-Bernstein the... |
0e8219f61115e1bd131652163b6ae730549ab654 | 26ac254ecb57ffcb886ff709cf018390161a9225 | /src/data/set/finite.lean | 53fec1c96939f49cdd6a2a88f3607becacfdf7d8 | [
"Apache-2.0"
] | permissive | eric-wieser/mathlib | 42842584f584359bbe1fc8b88b3ff937c8acd72d | d0df6b81cd0920ad569158c06a3fd5abb9e63301 | refs/heads/master | 1,669,546,404,255 | 1,595,254,668,000 | 1,595,254,668,000 | 281,173,504 | 0 | 0 | Apache-2.0 | 1,595,263,582,000 | 1,595,263,581,000 | null | UTF-8 | Lean | false | false | 25,866 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro
-/
import data.fintype.basic
import algebra.big_operators
/-!
# Finite sets
This file defines predicates `finite : set α → Prop` and `infinite : set α ... |
418f782164eaa5025897af9bbbdafaf76c0705cd | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Elab/Deriving/Ord.lean | a59c3710092e89cd12d1338549b0d57cecbd6b97 | [
"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 | 4,527 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Dany Fabian
-/
import Lean.Meta.Transform
import Lean.Elab.Deriving.Basic
import Lean.Elab.Deriving.Util
namespace Lean.Elab.Deriving.Ord
open Lean.Parser.Term
open Meta
def m... |
eeaf2cc6cd7716e3d146f323a389653b2d4bbfe7 | 4bcaca5dc83d49803f72b7b5920b75b6e7d9de2d | /stage0/src/Lean/Server/Rpc/Deriving.lean | dc9674db6e2ae4316954f54fd1297698675cc9ec | [
"Apache-2.0"
] | permissive | subfish-zhou/leanprover-zh_CN.github.io | 30b9fba9bd790720bd95764e61ae796697d2f603 | 8b2985d4a3d458ceda9361ac454c28168d920d3f | refs/heads/master | 1,689,709,967,820 | 1,632,503,056,000 | 1,632,503,056,000 | 409,962,097 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,499 | 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.Elab.Command
import Lean.Elab.Term
import Lean.Elab.Deriving.Basic
import Lean.PrettyPrinter
import Lean.Server.Rpc.Basic
namespace Lean.Serv... |
a40310806d9203d219a0c73478682acdb424d19a | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/measure_theory/constructions/prod.lean | 8fc239fc3e4eb91b011d910739076b9fce24b151 | [
"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 | 55,422 | lean | /-
Copyright (c) 2020 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
-/
import measure_theory.measure.giry_monad
import dynamics.ergodic.measure_preserving
import measure_theory.integral.set_integral
import measure_theory.measure.open... |
e88c2bd02ffab40bb5ff31c3cee478f280d6df75 | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/linear_algebra/invariant_basis_number.lean | 1be1e7788a1f3bb47008bc6fd8080cbd733dc8e2 | [
"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 | 8,918 | lean | /-
Copyright (c) 2020 Markus Himmel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel
-/
import ring_theory.principal_ideal_domain
import ring_theory.ideal.basic
/-!
# Invariant basis number property
We say that a ring `R` satisfies the invariant basis nu... |
cf41983fa900a2d6210641211ea6433bd917d449 | 9d2e3d5a2e2342a283affd97eead310c3b528a24 | /src/hints/thursday/afternoon/category_theory/exercise3/hint6.lean | 918ac895027e8f7dd87a79e0ea1481d3fde5d8a0 | [] | permissive | Vtec234/lftcm2020 | ad2610ab614beefe44acc5622bb4a7fff9a5ea46 | bbbd4c8162f8c2ef602300ab8fdeca231886375d | refs/heads/master | 1,668,808,098,623 | 1,594,989,081,000 | 1,594,990,079,000 | 280,423,039 | 0 | 0 | MIT | 1,594,990,209,000 | 1,594,990,209,000 | null | UTF-8 | Lean | false | false | 662 | lean | import for_mathlib.category_theory -- This imports some simp lemmas that I realised belong in mathlib while writing this exercise.
open category_theory
variables {C : Type*} [category C]
variables {D : Type*} [category D]
/-!
Let's get started on the second half of the exercise.
-/
lemma equiv_preserves_mono {X Y :... |
ceb19167d8c6b19144d541f2edcfe67ac1a7e9ce | 2c443ed3c09d98edcad40e5d286e53bc5a2ae838 | /src/category_theory_stuff/comma_cat.lean | a10ed7f410ac7e7fd2d22f23d8bb08d19dc75165 | [] | no_license | agusakov/riehl-solutions | f8be5e0bbd9b4d691cb8a45b6e4f4cc06aaf6c17 | 3cba620de377649e9269c53e17a65cfccd7db651 | refs/heads/master | 1,668,377,179,927 | 1,593,744,143,000 | 1,593,744,143,000 | 275,534,049 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 331 | lean | import category_theory.functor_category -- this transitively imports
-- category_theory.category
-- category_theory.functor
-- category_theory.natural_transformation
open category_theory
section comma_cat
universes v u -- the order matters (see below)
variables (C : Type u) [𝒞 : category.{v} C]
include 𝒞
end co... |
22004cdfd4ffef0deba05ae2b65d595a530056e1 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /library/init/meta/pexpr.lean | 49eae52e4dfdceb122fd47a847a20e829f836299 | [
"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 | 1,393 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.meta.expr
universe u
/-- Quoted expressions. They can be converted into expressions by using a tactic. -/
@[reducible] meta def pexpr :... |
e2b282435d71c2439642f434f46ff57b54815578 | 8c9f90127b78cbeb5bb17fd6b5db1db2ffa3cbc4 | /primes_are_endless.lean | fb17124a49a8e3107e94595428d5db9c60d314a8 | [] | no_license | picrin/lean | 420f4d08bb3796b911d56d0938e4410e1da0e072 | 3d10c509c79704aa3a88ebfb24d08b30ce1137cc | refs/heads/master | 1,611,166,610,726 | 1,536,671,438,000 | 1,536,671,438,000 | 60,029,899 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,797 | lean |
--def a : is_divisible 2 4 :=
-- exists.intro sorry
def magic : is_divisible 4 2 :=
Exists.intro 2 rfl
def is_prime: nat → Prop :=
λ p, ∀ (m : nat) (Pmdp : is_divisible p m), ((m = 1) ∨ (m = p)) ∧ (p ≠ 1)
def is_prime2: nat → Prop :=
λ p, ∀ (k : nat) (b1 : k < p) (b2 : 1 < k), (¬ is_divisible p k)
... |
7fff5b9456f55420389de5a0d543338202f88159 | ed27983dd289b3bcad416f0b1927105d6ef19db8 | /demo/my.lean | 05aa8d738894530664517e898f4b15dbd0263b58 | [] | no_license | liuxin-James/complogic-s21 | 0d55b76dbe25024473d31d98b5b83655c365f811 | 13e03e0114626643b44015c654151fb651603486 | refs/heads/master | 1,681,109,264,463 | 1,618,848,261,000 | 1,618,848,261,000 | 337,599,491 | 0 | 0 | null | 1,613,141,619,000 | 1,612,925,555,000 | null | UTF-8 | Lean | false | false | 29 | lean | import algebra
#check monoid |
8068a58f5fa78db0eb2f566db125962ef926ba0f | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/category_theory/limits/shapes/pullbacks.lean | 382993b2e79f6925e9fafca6c836818d68f3439b | [
"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 | 26,279 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Markus Himmel, Bhavik Mehta
-/
import category_theory.limits.shapes.wide_pullbacks
import category_theory.limits.shapes.binary_products
/-!
# Pullbacks
We define a ca... |
01bda6cb35d2ee607587f3e1ccdcf69e527f4c7f | 0845ae2ca02071debcfd4ac24be871236c01784f | /library/init/data/char/default.lean | a383af31bd7b3e7aa4d0fad19e1aeccfa0f69b82 | [
"Apache-2.0"
] | permissive | GaloisInc/lean4 | 74c267eb0e900bfaa23df8de86039483ecbd60b7 | 228ddd5fdcd98dd4e9c009f425284e86917938aa | refs/heads/master | 1,643,131,356,301 | 1,562,715,572,000 | 1,562,715,572,000 | 192,390,898 | 0 | 0 | null | 1,560,792,750,000 | 1,560,792,749,000 | null | UTF-8 | Lean | false | false | 200 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.data.char.basic
|
48284e48d37761be1a20d190318cea3abd90a7e8 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/data/set/intervals/basic.lean | 1c4c0e2cc4b6d105e054149e4a4f2b011ca6ef10 | [
"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 | 53,559 | 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, Yury Kudryashov, Rémy Degenne
-/
import order.min_max
import data.set.prod
/-!
# Intervals
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
... |
d655a0bfeea5c5cfaa2984d1af1e594f27e46d59 | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /library/data/sigma/wf.lean | f035d580f34eef0678fcccb0eef4e5067609644b | [
"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 | 3,316 | lean | -- Copyright (c) 2014 Microsoft Corporation. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Author: Leonardo de Moura
import data.sigma.decl logic.wf logic.cast
open well_founded
namespace sigma
section
variables {A : Type} {B : A → Type}
variable (Ra : A → A → P... |
adf2c076f8fbf0a1c5c5c21319f6907dcd7e3677 | 37a833c924892ee3ecb911484775a6d6ebb8984d | /src/category_theory/presheaves/default.lean | 5c1a77e27ceb2a9b99f1c1772a5c72af18426b54 | [] | no_license | silky/lean-category-theory | 28126e80564a1f99e9c322d86b3f7d750da0afa1 | 0f029a2364975f56ac727d31d867a18c95c22fd8 | refs/heads/master | 1,589,555,811,646 | 1,554,673,665,000 | 1,554,673,665,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,468 | 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
import category_theory.examples.topological_spaces
import category_theory.functor_category
import category_theory.whiskering
import c... |
c0b23032e365d9bbb437b613ff918a7cc7a33084 | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /tests/lean/run/ac_expr.lean | 9ce7c25cd49781766094d050a61b3df4056b5ac0 | [
"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 | 5,259 | lean | import Std
inductive Expr where
| var (i : Nat)
| op (lhs rhs : Expr)
deriving Inhabited, Repr
def List.getIdx : List α → Nat → α → α
| [], i, u => u
| a::as, 0, u => a
| a::as, i+1, u => getIdx as i u
structure Context (α : Type u) where
op : α → α → α
unit : α
assoc : (a b c : α) → op... |
137b1ee1e08d89fc20062cfb1a196bc46cac47cb | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/data/fintype/sort.lean | 06fb63dcdb78da135954c0fc4aee88547c315d3d | [
"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 | 1,893 | 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 data.finset.sort
variables {α : Type*}
open finset
/-- Given a linearly ordered fintype `α` of cardinal `k`, the order isomorphism... |
6e2befa7478af759630affc783c35d62a165532b | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/ring_theory/polynomial/basic.lean | 0b7c1c0e9781513725dbb96c6b1eef11611acb3a | [
"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 | 41,714 | lean | /-
Copyright (c) 2019 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import algebra.char_p.basic
import data.mv_polynomial.comm_ring
import data.mv_polynomial.equiv
import data.polynomial.field_division
import ring_theory.principal_ideal_domain... |
a888e162b21470101c799f5dd42a505768ebb5cb | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Meta/Injective.lean | d4d5cef408262351e08c4b8baf210317c628370e | [
"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 | 7,246 | 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.Meta.Transform
import Lean.Meta.Tactic.Injection
import Lean.Meta.Tactic.Apply
import Lean.Meta.Tactic.Refl
import Lean.Meta.Tactic.Cases
import... |
ff7b219da8f5ef698e7efd843861521fd44d5c24 | bb31430994044506fa42fd667e2d556327e18dfe | /src/algebra/big_operators/ring.lean | 5966de272a8c1182468b2644ad28fd68ed51e72c | [
"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 | 11,003 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
-/
import algebra.big_operators.basic
import algebra.field.defs
import data.finset.pi
import data.finset.powerset
/-!
# Results about big operators with values in a (s... |
ef839388dff2b2e45960a41481acc0dea5055942 | aa5a655c05e5359a70646b7154e7cac59f0b4132 | /stage0/src/Lean/Elab/Tactic/ElabTerm.lean | 4a71e6660ab941bdd25b35a0aac539c0958f642b | [
"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 | 5,370 | 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.Meta.CollectMVars
import Lean.Meta.Tactic.Apply
import Lean.Meta.Tactic.Constructor
import Lean.Meta.Tactic.Assert
import Lean.Elab.Tactic.Basic... |
8636377e61cd403887f61bc2bb6d9dbaca43e375 | 4fa161becb8ce7378a709f5992a594764699e268 | /src/linear_algebra/finsupp.lean | a7772f9036aaba1c4b645db7e70cde0f683b69da | [
"Apache-2.0"
] | permissive | laughinggas/mathlib | e4aa4565ae34e46e834434284cb26bd9d67bc373 | 86dcd5cda7a5017c8b3c8876c89a510a19d49aad | refs/heads/master | 1,669,496,232,688 | 1,592,831,995,000 | 1,592,831,995,000 | 274,155,979 | 0 | 0 | Apache-2.0 | 1,592,835,190,000 | 1,592,835,189,000 | null | UTF-8 | Lean | false | false | 17,107 | lean | /-
Copyright (c) 2019 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Johannes Hölzl
Linear structures on function with finite support `α →₀ M`.
-/
import data.monoid_algebra
noncomputable theory
open set linear_map submodule
open_locale classical
na... |
237ce63871145c425cec38cd1a3973648e70a6d6 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tests/lean/simpDisch.lean | fd3df0c13cd294483ad8e8f97d30ec36f3581c98 | [
"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 | 807 | lean | constant f : Nat → Nat
@[simp] axiom fEq (x : Nat) (h : x ≠ 0) : f x = x
example (x : Nat) (h : x ≠ 0) : f x = x + 0 := by
simp (discharger := trace_state; exact (fun h' => h') h)
example (x y : Nat) (h1 : x ≠ 0) (h2 : y ≠ 0) (h3 : x = y) : f x = f y + 0 := by
simp (discharger := trace_state; assumption)
assump... |
c9b21ad08e5c0d2c6901a833be64d81e47ffeceb | 8930e38ac0fae2e5e55c28d0577a8e44e2639a6d | /order/filter.lean | bff7ded1f167f11c63e5f96e6cb82ce420d6860f | [
"Apache-2.0"
] | permissive | SG4316/mathlib | 3d64035d02a97f8556ad9ff249a81a0a51a3321a | a7846022507b531a8ab53b8af8a91953fceafd3a | refs/heads/master | 1,584,869,960,527 | 1,530,718,645,000 | 1,530,724,110,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 70,826 | 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
Theory of filters on sets.
-/
import order.complete_lattice order.galois_connection data.set data.finset order.zorn
open lattice set
universes u v w x y
open set clas... |
a33f38e2517da182925660652b115695b2594e49 | 7282d49021d38dacd06c4ce45a48d09627687fe0 | /tests/lean/tst3.lean | 8b925381b84556913fa548fb16580979ee177967 | [
"Apache-2.0"
] | permissive | steveluc/lean | 5a0b4431acefaf77f15b25bbb49294c2449923ad | 92ba4e8b2d040a799eda7deb8d2a7cdd3e69c496 | refs/heads/master | 1,611,332,256,930 | 1,391,013,244,000 | 1,391,013,244,000 | 16,361,079 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,486 | lean | import if_then_else
set_option verbose false.
notation 10 if _ then _ : implies.
print environment 1.
print if true then false.
variable a : Bool.
print if true then if a then false.
set_option lean::pp::notation false.
print if true then if a then false.
variable A : Type.
variable f : A -> A -> A -> Bool.
notation 10... |
4a95c87a8d7b2d3fedf117adfe89157f32d61bed | ea5678cc400c34ff95b661fa26d15024e27ea8cd | /perm.lean | 7cd3b17c266c4d212312fed5475e017ab44bde00 | [] | no_license | ChrisHughes24/leanstuff | dca0b5349c3ed893e8792ffbd98cbcadaff20411 | 9efa85f72efaccd1d540385952a6acc18fce8687 | refs/heads/master | 1,654,883,241,759 | 1,652,873,885,000 | 1,652,873,885,000 | 134,599,537 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 26,458 | 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 data.fintype group_theory.order_of_element
universes u v
open equiv function finset fintype
variables {α : Type u} {β : Type v}
def subtype_perm (f : perm α) {p ... |
6c647be0643705045139ba6885cdf38f29098d80 | 6b2a480f27775cba4f3ae191b1c1387a29de586e | /group_rep_2/Tools/central_function_over_ring.lean | 151d923bd9623708ae80b1d9e4c99f39d2f45423 | [] | no_license | Or7ando/group_representation | a681de2e19d1930a1e1be573d6735a2f0b8356cb | 9b576984f17764ebf26c8caa2a542d248f1b50d2 | refs/heads/master | 1,662,413,107,324 | 1,590,302,389,000 | 1,590,302,389,000 | 258,130,829 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 1,302 | lean | import data.fintype.basic
import linear_algebra.basic
universe variables u v
variables {G :Type u} (R : Type v) [group G]
/--
A central fonction is a function `f : G → R` s.t `∀ s t : G, f (s * t) = f (t * s)`
-/
def central_function (f : G → R) := ∀ s t : G, f (s * t) = f (t * s)
lemma central (f : G → R)(hyp ... |
d6b10e862c16d8f640ad4ae88793e9ed180ce9d9 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/algebra/char_zero/defs.lean | a5497caaf488bc365fc2b2ea29875965b005c255 | [
"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 | 2,578 | lean | /-
Copyright (c) 2014 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.int.cast.defs
/-!
# Characteristic zero
A ring `R` is called of characteristic zero if every natural number `n` is non-zero when considered
as an eleme... |
45ed9bc62fb61710b1244ea7a2d46c57cd8b7572 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /stage0/src/Lean/Expr.lean | ff4e60ef3747998b20b99846de9a2271e8a4bd2c | [
"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 | 62,469 | lean | /-
Copyright (c) 2018 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Data.KVMap
import Lean.Level
namespace Lean
/-- Literal values for `Expr`. -/
inductive Literal where
| /-- Natural number literal -/
na... |
7b9926a7a59574d7f39d7553a63b6fef207958f5 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /test/rcases.lean | e295c99c6094364596168f0f94601aaa7083aa15 | [
"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 | 6,400 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
-/
import tactic.rcases
instance {α} : has_inter (set α) := ⟨λ s t, {a | a ∈ s ∧ a ∈ t}⟩
universe u
variables {α β γ : Type u}
example (x : α × β × γ) : true :=
begin
rc... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.