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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
8f99ee1630b90de6ec73b7335fd0f7ad78ea593d | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/data/set/basic.lean | 801efa8f2407c5a6d3dbaee9a40e3b4c27745299 | [
"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 | 88,348 | 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... |
2e7ee4260f710cd3623d69a2e8ea1271516e1c0e | f5f7e6fae601a5fe3cac7cc3ed353ed781d62419 | /src/category_theory/limits/preserves.lean | 259e1cc0ad9851c8fc85a2a257658f22df948079 | [
"Apache-2.0"
] | permissive | EdAyers/mathlib | 9ecfb2f14bd6caad748b64c9c131befbff0fb4e0 | ca5d4c1f16f9c451cf7170b10105d0051db79e1b | refs/heads/master | 1,626,189,395,845 | 1,555,284,396,000 | 1,555,284,396,000 | 144,004,030 | 0 | 0 | Apache-2.0 | 1,533,727,664,000 | 1,533,727,663,000 | null | UTF-8 | Lean | false | false | 11,109 | lean | -- Copyright (c) 2018 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Scott Morrison, Reid Barton
-- Preservation and reflection of (co)limits.
import category_theory.whiskering
import category_theory.limits.limits
open category_theory
namespac... |
0f0672543465c29fcc49e98c914a985eda010c2f | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /src/topology/metric_space/antilipschitz.lean | 890bf6c813a77f748110a5f7370bbf18ed2b25b9 | [
"Apache-2.0"
] | permissive | dexmagic/mathlib | ff48eefc56e2412429b31d4fddd41a976eb287ce | 7a5d15a955a92a90e1d398b2281916b9c41270b2 | refs/heads/master | 1,693,481,322,046 | 1,633,360,193,000 | 1,633,360,193,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,785 | 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.metric_space.lipschitz
import topology.uniform_space.complete_separated
/-!
# Antilipschitz functions
We say that a map `f : α → β` between two (e... |
f0241f62efbbfa332f6adf13950b95178bdf5377 | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /src/Lean/Parser/Syntax.lean | 195f49fc769b5308d99af064b0710c61fdef2715 | [
"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 | 5,778 | 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, Sebastian Ullrich
-/
import Lean.Parser.Command
import Lean.Parser.Tactic
namespace Lean
namespace Parser
builtin_initialize
registerBuiltinParserAttribut... |
eed143b91ce2d450d46cdafba1c5a3300c34875b | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/control/uliftable.lean | 11e218581357f1938f466c54d9efc546a375a3d0 | [
"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 | 5,581 | lean | /-
Copyright (c) 2020 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 control.monad.cont
import control.monad.writer
import data.equiv.basic
import tactic.interactive
/-!
# Universe lifting for type families... |
8329988d52d91e92a0d5d4b0020c0c6c62bbc981 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/topology/local_extr.lean | d323c3e4a13421e4657866cc71dbbf472b20ef2c | [
"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 | 19,152 | lean | /-
Copyright (c) 2019 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import order.filter.extr
import topology.continuous_on
/-!
# Local extrema of functions on topological spaces
## Main definitions
This file defines special versi... |
8524f8385d5c6aa51150acbc9f2c650898792b9a | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/set_theory/game/domineering.lean | 7244547795e37915d16aab9e88f2b3a90f3ab13e | [
"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 | 7,970 | 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 set_theory.game.state
/-!
# Domineering as a combinatorial game.
We define the game of Domineering, played on a chessboard of arbitrary shape
(possibly even ... |
d1745f81cc70374453ded055fc0e9cf31bcc2994 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/ring/prod.lean | a42dfd687bd8a6174cbdf3decdada46d1c949cb8 | [
"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,774 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Chris Hughes, Mario Carneiro, Yury Kudryashov
-/
import data.int.cast.prod
import algebra.group.prod
import algebra.ring.equiv
import algebra.order.monoid.prod
/-!
# ... |
5c293f56fe82a1d8cf7adcd79e355aba84772405 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/algebra/module/hom.lean | 3b3a7d881cf7f9e5cf46acec6f95aaa56dfa0ecb | [
"Apache-2.0"
] | permissive | jjgarzella/mathlib | 96a345378c4e0bf26cf604aed84f90329e4896a2 | 395d8716c3ad03747059d482090e2bb97db612c8 | refs/heads/master | 1,686,480,124,379 | 1,625,163,323,000 | 1,625,163,323,000 | 281,190,421 | 2 | 0 | Apache-2.0 | 1,595,268,170,000 | 1,595,268,169,000 | null | UTF-8 | Lean | false | false | 1,667 | 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 algebra.module.pi
/-!
# Bundled hom instances for module and multiplicative actions
This file defines instances for module, mul_action and related structures on bu... |
46569455e12baf6536427d2caa0d0a7646944ec6 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/analysis/fourier/riemann_lebesgue_lemma.lean | d986b81e740a8037ce333fdf0de65c5b47aeffcd | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 16,756 | lean | /-
Copyright (c) 2022 David Loeffler. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Loeffler
-/
import analysis.fourier.fourier_transform
import analysis.inner_product_space.dual
import analysis.inner_product_space.euclidean_dist
import measure_theory.function.... |
d43d744b7d8b29e0aa52f5c98ea6d909d5a409ec | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch2/ex0503.lean | f34740a172dbc3bc68771868e86eef3ab17439dd | [] | 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 | 91 | lean | def foo := let a := nat in λ x : a, x + 2
/-
def bar := (λ a, λ x : a, x + 2) nat
-/
|
6b0618f68209c5b610c4a081ee4eb60addade011 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /library/init/data/list/basic.lean | be8da52c4de797f03b8c170975e5333a15e8077f | [
"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 | 7,337 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
prelude
import init.logic init.data.nat.basic init.data.bool.basic
open decidable list
universes u v w
instance (α : Type u) : inhabited (list α) :=
⟨list.... |
0b1d1e469515f64e28bd8801d539b51de1c212a6 | 5b273b8c05e2f73fb74340ce100ce261900a98cd | /int_gcd.lean | 9cf4d65d7a6a85509cfc4015396573192fb3f0fb | [] | no_license | ChrisHughes24/leanstuff1 | 2eba44bc48da6e544e07495b41e1703f81dc1c24 | cbcd788b8b1d07b20b2fff4482c870077a13d1c0 | refs/heads/master | 1,631,670,333,297 | 1,527,093,981,000 | 1,527,093,981,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,042 | lean | import data.int.basic data.nat.gcd
namespace int
lemma dvd_mod_iff {k m n : ℤ} (h : k ∣ n) : k ∣ m % n ↔ k ∣ m :=
let t := @dvd_add_iff_left _ _ _ (m % n) _ (dvd_trans h (dvd_mul_right n (m / n))) in
by rwa mod_add_div at t
@[simp] lemma gcd_zero_left (a : ℤ) : gcd 0 a = a.nat_abs := nat.gcd_zero_left _
@[simp] lem... |
1552de28514cb1a6115df8e584137b9b068c9b9a | 87a08a8e9b222ec02f3327dca4ae24590c1b3de9 | /src/data/list/basic.lean | f61f757114f4c4c7900be823e6036804976a3539 | [
"Apache-2.0"
] | permissive | naussicaa/mathlib | 86d05223517a39e80920549a8052f9cf0e0b77b8 | 1ef2c2df20cf45c21675d855436228c7ae02d47a | refs/heads/master | 1,592,104,950,080 | 1,562,073,069,000 | 1,562,073,069,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 206,625 | lean | /-
Copyright (c) 2014 Parikshit Khanna. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Parikshit Khanna, Jeremy Avigad, Leonardo de Moura, Floris van Doorn, Mario Carneiro
Basic properties of lists.
-/
import
tactic.interactive tactic.mk_iff_of_inductive_prop
logi... |
406e51ae0856a59c7c1daaa52db9cb07a39fc9d5 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/check2.lean | eba96a0b49beab363010920a6218552764bd806e | [
"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 | 61 | lean | import logic
set_option pp.metavar_args true
check eq.rec_on
|
a2217ea69b7b000e0e118b954231aa9dd06806a0 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/module/submodule/bilinear.lean | d2c2755e21d5711598a5646b1a4f5eef7074d2ad | [
"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) 2019 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Eric Wieser
-/
import linear_algebra.span
import linear_algebra.bilinear_map
/-!
# Images of pairs of submodules under bilinear maps
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
... |
dd7ce5e184d7e6d9292661bdd0b2a95a82285974 | b2fe74b11b57d362c13326bc5651244f111fa6f4 | /src/analysis/calculus/fderiv.lean | 3908ad0ad25f8c1277c428fab7fa6d29c82f540b | [
"Apache-2.0"
] | permissive | midfield/mathlib | c4db5fa898b5ac8f2f80ae0d00c95eb6f745f4c7 | 775edc615ecec631d65b6180dbcc7bc26c3abc26 | refs/heads/master | 1,675,330,551,921 | 1,608,304,514,000 | 1,608,304,514,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 120,096 | 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... |
ebf47fcaadbfd1a68343f71e22abcb4eb048a84b | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /hott/algebra/trunc_group.hlean | a3911246d577ba28260c51850c22c7227518a759 | [
"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 | 2,484 | 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
truncating an ∞-group to a group
-/
import hit.trunc algebra.group
open eq is_trunc trunc
namespace algebra
section
parameters (A : Type) (mul : A → A → A) ... |
0aea4fc3dc0e7e895c23c35fdfb21dd73a882359 | ad0c7d243dc1bd563419e2767ed42fb323d7beea | /data/padics/padic_norm.lean | e0f893dfc3e3bb8796efcb990debccfd7b9746e0 | [
"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 | 17,199 | 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
Define the p-adic valuation on ℤ and ℚ, and the p-adic norm on ℚ
-/
import data.rat data.int.gcd algebra.field_power
import tactic.wlog tactic.ring
universe u
open ... |
4f45ae2d09c165f6c87aa09e541b0ba2fb4ec281 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/topology/uniform_space/uniform_embedding.lean | 3f18c6cf87cd4fc01303a126cf039a876de20be5 | [
"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 | 22,708 | 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, Sébastien Gouëzel, Patrick Massot
-/
import topology.uniform_space.cauchy
import topology.uniform_space.separation
import topology.dense_embedding
/-!
# Uniform embedd... |
67db6e34fba05e8becc79c07da0f8044cc44d7d0 | 8c9f90127b78cbeb5bb17fd6b5db1db2ffa3cbc4 | /zulip_question_lists.lean | f7c830f7d04026e5a0273fbeed1935f1ce5e5373 | [] | 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 | 360 | lean | inductive natlist : Type
| nil : natlist
| cons : nat → natlist → natlist
definition list_sum : natlist → nat :=
λ list : natlist,
natlist.rec_on list 0 (λ list_element : nat, λ previous_list : natlist, λ IH: nat, list_element + IH)
open natlist
#reduce list_sum $ cons 2 $ cons 2 nil
#eval list_sum ... |
2d35592ce419935cce2ac1bdaba98a6dcb3f6901 | 88fb7558b0636ec6b181f2a548ac11ad3919f8a5 | /tests/lean/run/wfrec1.lean | 4f12d82a679dce785ce1b862e09eaf54005399a0 | [
"Apache-2.0"
] | permissive | moritayasuaki/lean | 9f666c323cb6fa1f31ac597d777914aed41e3b7a | ae96ebf6ee953088c235ff7ae0e8c95066ba8001 | refs/heads/master | 1,611,135,440,814 | 1,493,852,869,000 | 1,493,852,869,000 | 90,269,903 | 0 | 0 | null | 1,493,906,291,000 | 1,493,906,291,000 | null | UTF-8 | Lean | false | false | 673 | lean | private definition S := Σ a : nat, nat
private definition R : S → S → Prop := sigma.skip_left nat (<)
private definition Rwf : well_founded R :=
sigma.skip_left_wf nat nat.lt_wf
private definition f_aux : ∀ (p₁ : S), (∀ p₂ : S, R p₂ p₁ → nat) → nat
| (sigma.mk n (m+1)) F := F (sigma.mk (n+10) (m - n)) (sigma.mk_skip_... |
ed56b0fa5cff0ba1979924cf354ffe2704453d95 | 8e6cad62ec62c6c348e5faaa3c3f2079012bdd69 | /src/group_theory/perm/basic.lean | 0053f34bea91686d544a618ef56016ed898d413d | [
"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 | 11,986 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Mario Carneiro
-/
import data.equiv.basic
import algebra.group.basic
import algebra.group.hom
import algebra.group.pi
import algebra.group.prod
/-!
# The gro... |
6fb1225f58c6211963c804caeb2b90341273fae5 | 4fa161becb8ce7378a709f5992a594764699e268 | /src/analysis/normed_space/real_inner_product.lean | 63053c2109681506970e8e091ff6cc1ef17c7343 | [
"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 | 38,920 | lean | /-
Copyright (c) 2019 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou, Sébastien Gouëzel
-/
import algebra.quadratic_discriminant
import tactic.apply_fun
import tactic.monotonicity
import topology.metric_space.pi_Lp
/-!
# Inner Product Spac... |
6988083e8f13078b648021b24679470398d877ab | d31b9f832ff922a603f76cf32e0f3aa822640508 | /src/hott/init/hedberg.lean | ee6e274e7097f374623695a3deb474d229391108 | [
"Apache-2.0"
] | permissive | javra/hott3 | 6e7a9e72a991a2fae32e5764982e521dca617b16 | cd51f2ab2aa48c1246a188f9b525b30f76c3d651 | refs/heads/master | 1,585,819,679,148 | 1,531,232,382,000 | 1,536,682,965,000 | 154,294,022 | 0 | 0 | Apache-2.0 | 1,540,284,376,000 | 1,540,284,375,000 | null | UTF-8 | Lean | false | false | 1,400 | 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
Hedberg's Theorem: every type with decidable equality is a set
-/
import .trunc .logic
universes u v w
hott_theory
namespace hott
open eq nat is_trunc sigma... |
90493195ebee90c65b76b01400dafb2c91b66609 | 618003631150032a5676f229d13a079ac875ff77 | /src/data/padics/hensel.lean | 6a13f9fc6705ef4299563217bee2561a495b5da1 | [
"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 | 21,536 | lean | /-
Copyright (c) 2018 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
-/
import data.padics.padic_integers
import topology.metric_space.cau_seq_filter
import analysis.specific_limits
import topology.algebra.polynomial
/-!
# Hensel's lem... |
01f7559017f1075c954b636f221e858329bc62ec | 4727251e0cd73359b15b664c3170e5d754078599 | /src/topology/sheaves/sheaf_condition/sites.lean | e5d79effb61c58ab977e13bc04c641f650978383 | [
"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 | 24,097 | lean | /-
Copyright (c) 2021 Justus Springer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Justus Springer
-/
import category_theory.sites.spaces
import topology.sheaves.sheaf
import category_theory.sites.dense_subsite
/-!
# The sheaf condition in terms of sites.
The th... |
efa6540a155f1210b19f87a9bf28cb0710cb3e19 | 87a08a8e9b222ec02f3327dca4ae24590c1b3de9 | /src/order/complete_lattice.lean | cddeea265acdaf1f1d763310e932ed95d783be70 | [
"Apache-2.0"
] | permissive | naussicaa/mathlib | 86d05223517a39e80920549a8052f9cf0e0b77b8 | 1ef2c2df20cf45c21675d855436228c7ae02d47a | refs/heads/master | 1,592,104,950,080 | 1,562,073,069,000 | 1,562,073,069,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 34,144 | 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 complete lattices.
-/
import order.bounded_lattice data.set.basic tactic.pi_instances
set_option old_structure_cmd true
open set
namespace lattice
universes... |
9eda9302e70847a9a63727b807df3a68afb87a53 | b2fe74b11b57d362c13326bc5651244f111fa6f4 | /src/field_theory/normal.lean | fcb9f756686dce97ff99413082520a94ce4eadee | [
"Apache-2.0"
] | permissive | midfield/mathlib | c4db5fa898b5ac8f2f80ae0d00c95eb6f745f4c7 | 775edc615ecec631d65b6180dbcc7bc26c3abc26 | refs/heads/master | 1,675,330,551,921 | 1,608,304,514,000 | 1,608,304,514,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,578 | lean | /-
Copyright (c) 2020 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import field_theory.minimal_polynomial
import field_theory.splitting_field
import linear_algebra.finite_dimensional
/-!
# Normal field extensions
In this file we define norm... |
b86454a85320834ed20aa21de98816a0afeaf952 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/analysis/complex/roots_of_unity.lean | 6270034cff7fe757eb3461775d0562278445d033 | [
"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 | 3,584 | 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 analysis.special_functions.complex.log
import ring_theory.roots_of_unity
/-!
# Complex roots of unity
In this file we show that the `n`-th complex roots of u... |
db780f8e831d200f10494a82292a537f2257a9b2 | 2385ce0e3b60d8dbea33dd439902a2070cca7a24 | /tests/lean/run/back4.lean | fb6ed9232bb8f434deceb3081e2446f14bc15828 | [
"Apache-2.0"
] | permissive | TehMillhouse/lean | 68d6fdd2fb11a6c65bc28dec308d70f04dad38b4 | 6bbf2fbd8912617e5a973575bab8c383c9c268a1 | refs/heads/master | 1,620,830,893,339 | 1,515,592,479,000 | 1,515,592,997,000 | 116,964,828 | 0 | 0 | null | 1,515,592,734,000 | 1,515,592,734,000 | null | UTF-8 | Lean | false | false | 1,603 | lean | /- Lean also support E-matching: a heuristic lemma instantiation procedure
that is available in many SMT solvers.
Goals such as mk_mem_list can also be discharged using heuristic instantiation. -/
open list tactic
universe variable u
lemma in_tail {α : Type u} {a : α} (b : α) {l : list α} : a ∈ l → a ∈ b... |
1c35129bc68bcdbfe2d81cc3f54e5702b7ad71c5 | acc85b4be2c618b11fc7cb3005521ae6858a8d07 | /order/boolean_algebra.lean | 0317e20374ac6239f67c3e3f094b3585fe4024ee | [
"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 | 5,772 | 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
Type class hierarchy for Boolean algebras.
-/
import order.bounded_lattice
set_option old_structure_cmd true
universes u
variables {α : Type u} {x y z w : α}
namespa... |
7118b060a3ed4cabbada8c0ae05cd3319e247fc2 | b2fe74b11b57d362c13326bc5651244f111fa6f4 | /src/tactic/ext.lean | 4048d2b51ece3871cca902460a7236d31ec4bb0d | [
"Apache-2.0"
] | permissive | midfield/mathlib | c4db5fa898b5ac8f2f80ae0d00c95eb6f745f4c7 | 775edc615ecec631d65b6180dbcc7bc26c3abc26 | refs/heads/master | 1,675,330,551,921 | 1,608,304,514,000 | 1,608,304,514,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 18,770 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon, Jesse Michael Han
-/
import tactic.rcases
import data.sum
import logic.function.basic
universes u₁ u₂
open interactive interactive.types
section ext
open lean.parser nat ta... |
d91f33f8580542f90350902b7c8823cd8795b3bb | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/lean/run/newfrontend4.lean | 313e3de21b0c60ccb24f6bf5d84faf86fa83c26a | [
"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 | 2,251 | lean | new_frontend
-- set_option syntaxMaxDepth 100
-- set_option trace.Elab true
-- set_option trace.Meta true
-- set_option trace.Meta.synthInstance false
def adapt1 {m m' σ σ'} {n n' : Type → Type} [MonadFunctor m m' n n'] [MonadStateAdapter σ σ' m m'] : MonadStateAdapter σ σ' n n' :=
⟨fun split join => monadMap @(fun α... |
e1c94f5408cf8e7d493b55869f63623e5253425c | 4727251e0cd73359b15b664c3170e5d754078599 | /src/field_theory/is_alg_closed/classification.lean | 0480bdd8de3b3ce99bf958238169d6fa0b7978bb | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 8,562 | lean | /-
Copyright (c) 2022 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import data.W.cardinal
import ring_theory.algebraic_independent
import field_theory.is_alg_closed.basic
import field_theory.intermediate_field
import data.polynomial.card... |
715bde18f6a8fc1bd2fa140ee03eda4fff8e8229 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/category_theory/epi_mono.lean | ee627322025359c8617ab789111fa49972a0083a | [
"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 | 9,220 | lean | /-
Copyright (c) 2019 Reid Barton. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Reid Barton, Scott Morrison
-/
import category_theory.opposites
import category_theory.groupoid
/-!
# Facts about epimorphisms and monomorphisms.
The definitions of `epi` and `mono` are... |
f96de9742fc1af6541d62fc5b400965c95b33163 | 1446f520c1db37e157b631385707cc28a17a595e | /tests/bench/parser.lean | 38c16f5d0f1cb4d79ce54f47f8577688da50c956 | [
"Apache-2.0"
] | permissive | bdbabiak/lean4 | cab06b8a2606d99a168dd279efdd404edb4e825a | 3f4d0d78b2ce3ef541cb643bbe21496bd6b057ac | refs/heads/master | 1,615,045,275,530 | 1,583,793,696,000 | 1,583,793,696,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 241 | lean | import Init.Lean.Parser
def main : List String → IO Unit
| [fname, n] => do
env ← Lean.mkEmptyEnvironment;
n.toNat.forM $ fun _ =>
Lean.Parser.parseFile env fname *> pure ();
pure ()
| _ => throw $ IO.userError "give file"
|
040bb4e9c1ad04c6a5ec3799a881376bc1acbe89 | 60bf3fa4185ec5075eaea4384181bfbc7e1dc319 | /src/game/sup_inf/level01.lean | 2cbb696d4768ed558eb87ce6d04039338fb81b51 | [
"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,065 | lean | import data.real.basic -- imports the real numbers ℝ
namespace xena -- hide
-- World name : Sup and Inf
/-
# Chapter 3 : Sup and Inf
## Level 1 : Upper bounds
-/
/-
Let $X$ be a set of real numbers.
We say a real number $b$ is an *upper bound* for $X$ if every $x \in X$ is at most $b$.
-/
def is_upper_bound (X : ... |
3f742fddff4ad6033b140741aa6f6dee03e1c586 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/order/rel_iso.lean | bbb073b837f78ad89c10f62c56eca41280c4cdab | [
"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 | 22,572 | 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 algebra.group.defs
import data.fun_like.basic
import logic.embedding
import logic.equiv.set
import order.rel_classes
/-!
# Relation homomorphisms, embeddings,... |
5a9a3c83716820a6b12d575a628f6d6eb23bdb66 | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/data/nat/pairing.lean | e099aff59cc99468611fb3abe4bbb16dc442e4a2 | [
"Apache-2.0"
] | permissive | fpvandoorn/mathlib | b21ab4068db079cbb8590b58fda9cc4bc1f35df4 | b3433a51ea8bc07c4159c1073838fc0ee9b8f227 | refs/heads/master | 1,624,791,089,608 | 1,556,715,231,000 | 1,556,715,231,000 | 165,722,980 | 5 | 0 | Apache-2.0 | 1,552,657,455,000 | 1,547,494,646,000 | Lean | UTF-8 | Lean | false | false | 3,836 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Mario Carneiro
Elegant pairing function.
-/
import data.nat.sqrt
open prod decidable
namespace nat
/-- Pairing function for the natural numbers. -/
def mkp... |
73c6722ad2e2237b75c2a8c79bac433dc148bb84 | 9d2e3d5a2e2342a283affd97eead310c3b528a24 | /src/solutions/thursday/afternoon/category_theory/exercise10.lean | ba5aa164f605a5cbcc6f012c2479763d9687e16c | [] | 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 | 1,633 | lean | import category_theory.limits.shapes.zero
import category_theory.full_subcategory
import algebra.homology.chain_complex
import data.int.basic
/-!
(WARNING: this is an incomplete exercise. It's probably doable from this point,
but it's more of a lesson/warning about dependent type theory hell than an enjoyable activity... |
b6f0d55aff449d4db45564ca1355aac17c6d45f8 | 01ae0d022f2e2fefdaaa898938c1ac1fbce3b3ab | /categories/two_category.lean | 9cfef6e7d5c41746259dd962c800963965442a2c | [] | no_license | PatrickMassot/lean-category-theory | 0f56a83464396a253c28a42dece16c93baf8ad74 | ef239978e91f2e1c3b8e88b6e9c64c155dc56c99 | refs/heads/master | 1,629,739,187,316 | 1,512,422,659,000 | 1,512,422,659,000 | 113,098,786 | 0 | 0 | null | 1,512,424,022,000 | 1,512,424,022,000 | null | UTF-8 | Lean | false | false | 4,448 | 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
import .natural_transformation
open categories
open categories.functor
open categories.natural_transformation
namespace categories.two_category
... |
4c8cfab40c9e944a377df518ccd0d9b0c038ba31 | 41ebf3cb010344adfa84907b3304db00e02db0a6 | /uexp/src/uexp/rules/pullAggregateThroughUnion.lean | 96235303b5cfeecc4b20901fea2b31b323770456 | [
"BSD-2-Clause"
] | permissive | ReinierKoops/Cosette | e061b2ba58b26f4eddf4cd052dcf7abd16dfe8fb | eb8dadd06ee05fe7b6b99de431dd7c4faef5cb29 | refs/heads/master | 1,686,483,953,198 | 1,624,293,498,000 | 1,624,293,498,000 | 378,997,885 | 0 | 0 | BSD-2-Clause | 1,624,293,485,000 | 1,624,293,484,000 | null | UTF-8 | Lean | false | false | 2,005 | lean | import ..sql
import ..tactics
import ..u_semiring
import ..extra_constants
import ..meta.cosette_tactics
open Expr
open Proj
open Pred
open SQL
open tree
notation `int` := datatypes.int
theorem rule:
forall ( Γ scm_t scm_account scm_bonus scm_dept scm_emp: Schema) (rel_t: relation scm_t) (rel_account: relation ... |
75868a2df71617648a2619c16470c7545ff341e6 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/algebra/free.lean | 918f0a86f230e01feddc70ba991513ce96991542 | [
"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 | 22,644 | 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 data.equiv.basic
import control.applicative
import control.traversable.basic
/-!
# Free constructions
## Main definitions
* `free_magma α`: free magma (structure with... |
11d9c7db9abffd97d88fe04e5eceab81c4572e5a | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/372c.lean | 2af68a24058f1c2c3c153d31836382aff307a8ba | [
"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 | 180 | lean | def foo (n : ℕ) := Type
def beta (n : ℕ) : foo n :=
by unfold foo; exact ℕ → ℕ
noncomputable lemma baz (n : ℕ) : beta n := id
example : ℕ := by apply baz <|> exact 0
|
175861b45188fc8904070853dc0d4fd47f548dc9 | 491068d2ad28831e7dade8d6dff871c3e49d9431 | /tests/lean/run/class_coe.lean | d1afe594775ff726705ea50b2f0da67b617865b6 | [
"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 | 1,358 | lean | import data.num
namespace play
constants int nat real : Type.{1}
constant nat_add : nat → nat → nat
constant int_add : int → int → int
constant real_add : real → real → real
inductive add_struct [class] (A : Type) :=
mk : (A → A → A) → add_struct A
definition add {A : Type} {S : add_struct A} (a b : A) : A :=
add_... |
470d519396c595153f7b86b073e5979ef95657f9 | 94637389e03c919023691dcd05bd4411b1034aa5 | /src/zzz_junk/04_type_library/08_nat.lean | 3d8377280442b900650d6fbfddf52d17d29a4977 | [] | no_license | kevinsullivan/complogic-s21 | 7c4eef2105abad899e46502270d9829d913e8afc | 99039501b770248c8ceb39890be5dfe129dc1082 | refs/heads/master | 1,682,985,669,944 | 1,621,126,241,000 | 1,621,126,241,000 | 335,706,272 | 0 | 38 | null | 1,618,325,669,000 | 1,612,374,118,000 | Lean | UTF-8 | Lean | false | false | 798 | lean | #print nat
namespace hidden
/-
The nat type represents the set
of natural numbers, and infinite
set. It explains that a natural
number is either zero or it's one
more than (the successor, succ,
of) any given natural number, n'.
This is an inductive definition
in which "larger" objects of a
given type are construc... |
2fe305bffdabb6b195910c3714099e3ee77c4a23 | c45b34bfd44d8607a2e8762c926e3cfaa7436201 | /uexp/src/uexp/rules/ex1sigmod92.lean | e2681a610fab56db461a19f9e6f0ceeeaf60e329 | [
"BSD-2-Clause"
] | permissive | Shamrock-Frost/Cosette | b477c442c07e45082348a145f19ebb35a7f29392 | 24cbc4adebf627f13f5eac878f04ffa20d1209af | refs/heads/master | 1,619,721,304,969 | 1,526,082,841,000 | 1,526,082,841,000 | 121,695,605 | 1 | 0 | null | 1,518,737,210,000 | 1,518,737,210,000 | null | UTF-8 | Lean | false | false | 3,556 | lean | import ..sql
import ..tactics
import ..u_semiring
import ..extra_constants
import ..cosette_tactics
open Expr
open Proj
open Pred
open SQL
variables i1 i20 i85 : const datatypes.int
theorem rule :
forall (Γ scm_pur scm_itm scm_itp : Schema)
(rel_pur : relation scm_pur)
(rel_itm : relation ... |
af0ebca12c938ff0c51b1f25cd1a1b97a93946d1 | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/category_theory/category/Rel.lean | 7426a456c4288d7953ea4627c850a8a92e093b80 | [
"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 | 778 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.category
/-!
The category of types with binary relations as morphisms.
-/
namespace category_theory
universe u
/-- A type synonym for `Type... |
f07ab37ed217131752b25248f1cf86fa22347bef | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/order/ord_continuous.lean | 76b10cb70da4ff9578f0d965622f4ce009997c5f | [] | 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,270 | 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, Johannes Hölzl
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.order.conditionally_complete_lattice
import Mathlib.logic.function.... |
470d9069347e9b65646bec98849d3d0392faeeb9 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tests/lean/interactive/plainGoal.lean | 686fea2fbb70d9ae089d2ae0a4af40cc8c415360 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | cipher1024/lean4 | 6e1f98bb58e7a92b28f5364eb38a14c8d0aae393 | 69114d3b50806264ef35b57394391c3e738a9822 | refs/heads/master | 1,642,227,983,603 | 1,642,011,696,000 | 1,642,011,696,000 | 228,607,691 | 0 | 0 | Apache-2.0 | 1,576,584,269,000 | 1,576,584,268,000 | null | UTF-8 | Lean | false | false | 1,428 | lean | example : α → α := by
--^ $/lean/plainGoal
--^ $/lean/plainGoal
intro a
--^ $/lean/plainGoal
--^ $/lean/plainGoal
--v $/lean/plainGoal
focus
apply a
example : α → α := by
--^ $/lean/plainGoal
example : 0 + n = n := by
induction n with
| zero => simp... |
4b34886068c16661656ff77c8b5533200b60ac6e | 367134ba5a65885e863bdc4507601606690974c1 | /src/data/fintype/sort.lean | 94240f5526021eb703bf364164775e2b27d8c4e7 | [
"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,924 | 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.fintype.basic
import data.finset.sort
variables {α : Type*}
open finset
/-- Given a linearly ordered fintype `α` of cardinal `k`, the order isomorphism
... |
e91c4790a065c151beeec44dc80342da87036be3 | 491068d2ad28831e7dade8d6dff871c3e49d9431 | /hott/homotopy/sphere.hlean | d21d807811d9b43da8f72536f67ded159d48a555 | [
"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 | 6,460 | 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
Declaration of the n-spheres
-/
import .susp types.trunc
open eq nat susp bool is_trunc unit pointed
/-
We can define spheres with the following possible indic... |
80d2c0aa47c72aa1e8289406284a7d86944dd8bb | 957a80ea22c5abb4f4670b250d55534d9db99108 | /library/init/function.lean | abcd06a6c21e943ea155745b1040bb237bd3f7a9 | [
"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 | 5,394 | 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, Haitao Zhang
General operations on functions.
-/
prelude
import init.data.prod init.funext init.logic
universes u₁ u₂ u₃ u₄
namespace function... |
cdcec413ab3cf2f7486c19e9019f017faed22573 | 30b012bb72d640ec30c8fdd4c45fdfa67beb012c | /data/padics/padic_numbers.lean | 12f09804108a73373cd22b2a757fb7a7fecce58b | [
"Apache-2.0"
] | permissive | kckennylau/mathlib | 21fb810b701b10d6606d9002a4004f7672262e83 | 47b3477e20ffb5a06588dd3abb01fe0fe3205646 | refs/heads/master | 1,634,976,409,281 | 1,542,042,832,000 | 1,542,319,733,000 | 109,560,458 | 0 | 0 | Apache-2.0 | 1,542,369,208,000 | 1,509,867,494,000 | Lean | UTF-8 | Lean | false | false | 28,377 | 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
Define the p-adic numbers (rationals) ℚ_p as the completion of ℚ wrt the p-adic norm.
Show that the p-adic norm extends to ℚ_p, that ℚ is embedded in ℚ_p, and that ℚ_... |
ff852c2b1a91465409a131c3907fe9abf16d1218 | 2eab05920d6eeb06665e1a6df77b3157354316ad | /src/order/liminf_limsup.lean | 2c52ae19f18895fbd4f0ef89f6bc5377d8c207b4 | [
"Apache-2.0"
] | permissive | ayush1801/mathlib | 78949b9f789f488148142221606bf15c02b960d2 | ce164e28f262acbb3de6281b3b03660a9f744e3c | refs/heads/master | 1,692,886,907,941 | 1,635,270,866,000 | 1,635,270,866,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 24,478 | lean | /-
Copyright (c) 2018 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel, Johannes Hölzl, Rémy Degenne
-/
import order.filter.partial
import order.filter.at_top_bot
/-!
# liminfs and limsups of functions and filters
Defines the Liminf... |
7a59993ed1840df900dfe5609e5bca0bc8908462 | d7189ea2ef694124821b033e533f18905b5e87ef | /galois/temporal/temporal.lean | d45d192344d8df9b0b135612c0991b41b4f64154 | [
"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 | 16,335 | lean | /- A shallow embedding of temporal logic -/
import galois.tactic
import galois.nat.lemmas
import galois.subset.subset
universe variables u v
open subset
namespace temporal
/--An ordered series of events over states --/
def trace (T : Type u) : Type u := nat -> T
/--Type of Propositions over traces --/
@[reducible... |
de9d1b7cbb4bfaac53949bf9f5e87173e7081c84 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /test/matrix.lean | 19921b72ff509f569a39ec91817b515e4584b937 | [
"Apache-2.0"
] | permissive | jjgarzella/mathlib | 96a345378c4e0bf26cf604aed84f90329e4896a2 | 395d8716c3ad03747059d482090e2bb97db612c8 | refs/heads/master | 1,686,480,124,379 | 1,625,163,323,000 | 1,625,163,323,000 | 281,190,421 | 2 | 0 | Apache-2.0 | 1,595,268,170,000 | 1,595,268,169,000 | null | UTF-8 | Lean | false | false | 3,678 | lean | import data.matrix.notation
import linear_algebra.matrix.determinant
import group_theory.perm.fin
import tactic.norm_swap
variables {α β : Type} [semiring α] [ring β]
namespace matrix
open_locale matrix
example {a a' b b' c c' d d' : α} :
![![a, b], ![c, d]] + ![![a', b'], ![c', d']] = ![![a + a', b + b'], ![c + ... |
89985fd1a969b04c9bb4fb24d88e8a797a452214 | 432d948a4d3d242fdfb44b81c9e1b1baacd58617 | /src/data/polynomial/basic.lean | 91c1df76a9cbd1f003717d1871deb3f69614d3f8 | [
"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 | 11,419 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Johannes Hölzl, Scott Morrison, Jens Wagemaker
-/
import tactic.ring_exp
import tactic.chain
import algebra.monoid_algebra
import data.finset.sort
/-!
# Theory of univaria... |
e80f8f438b91cd9e8ef11e958f18e27b589361b8 | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /src/data/setoid/basic.lean | 8e07d6a3a744263f37e6fe10f17117c78e01fbad | [
"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 | 16,478 | lean | /-
Copyright (c) 2019 Amelia Livingston. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Amelia Livingston, Bryan Gin-ge Chen
-/
import order.galois_connection
/-!
# Equivalence relations
This file defines the complete lattice of equivalence relations on a type, resul... |
090e02ee6a0376d55ebac67950ec10785b665aba | 7da5ceac20aaab989eeb795a4be9639982e7b35a | /src/data/pfun2.lean | 701f12fb02594f0b8eed104fd2c79b3130986c5f | [
"MIT"
] | permissive | formalabstracts/formalabstracts | 46c2f1b3a172e62ca6ffeb46fbbdf1705718af49 | b0173da1af45421239d44492eeecd54bf65ee0f6 | refs/heads/master | 1,606,896,370,374 | 1,572,988,776,000 | 1,572,988,776,000 | 96,763,004 | 165 | 28 | null | 1,555,709,319,000 | 1,499,680,948,000 | Lean | UTF-8 | Lean | false | false | 2,891 | lean | /- various properties about pfun and roption -/
import basic data.pfun
open set
universes u v w
variables {α : Type u} {β : Type v} {γ : Type w} {n : ℕ}
namespace roption
def compatible (o₁ o₂ : roption α) : Prop := ∀{{x y}}, x ∈ o₁ → y ∈ o₂ → x = y
namespace compatible
variables {o₁ o₂ o₃ : roption α}
infix ... |
9008a346c4306115550f9d06c00c8b2a8d506abe | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/category/applicative.lean | 1942cbc3bf703486631f6cd3da5853d1bc033826 | [
"Apache-2.0"
] | permissive | fpvandoorn/mathlib | b21ab4068db079cbb8590b58fda9cc4bc1f35df4 | b3433a51ea8bc07c4159c1073838fc0ee9b8f227 | refs/heads/master | 1,624,791,089,608 | 1,556,715,231,000 | 1,556,715,231,000 | 165,722,980 | 5 | 0 | Apache-2.0 | 1,552,657,455,000 | 1,547,494,646,000 | Lean | UTF-8 | Lean | false | false | 5,419 | lean | /-
Copyright (c) 2017 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Simon Hudon
Instances for identity and composition functors
-/
import category.functor
universe variables u v w
section lemmas
open function
variables {F : Type u → Type v}
variables... |
a3b95de1bfb2a651c7ee3492cd3e4de3587aa9d0 | a4673261e60b025e2c8c825dfa4ab9108246c32e | /stage0/src/Lean/Elab/Inductive.lean | a3ff70fa08f566785d3e6a1f91b2864c778b8825 | [
"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 | 23,774 | 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.ReplaceLevel
import Lean.Util.ReplaceExpr
import Lean.Util.CollectLevelParams
import Lean.Util.Constructions
import Lean.Elab.Command
impor... |
e30ea7649affd412e5fb22a00cbc72321382ece3 | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /tests/lean/or_shortcircuit.lean | c69dec62793259b3cbbbcbcc02ada2818dc6a6dc | [
"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 | 420 | lean | @[noinline] def c1 (x : Nat) : Bool :=
dbgTrace! "executed c1"
x == 0
@[noinline] def c2 (x : Nat) : Bool :=
dbgTrace! "executed c2"
x == 0
@[noinline] def c3 (x : Nat) : Bool :=
dbgTrace! "executed c3"
x > 0
@[noinline] def f (x : Nat) := x + 1
def tst (x : Nat) : Nat := do
let x := if !c1 x || (!c2 ... |
3852deb72540afea441a69df7c7b67ced734015f | 5fbbd711f9bfc21ee168f46a4be146603ece8835 | /lean/natural_number_game/inequality/07.lean | 086136e2b3296f0aeb6773999e07d5abf6f9a3aa | [
"LicenseRef-scancode-warranty-disclaimer"
] | no_license | goedel-gang/maths | 22596f71e3fde9c088e59931f128a3b5efb73a2c | a20a6f6a8ce800427afd595c598a5ad43da1408d | refs/heads/master | 1,623,055,941,960 | 1,621,599,441,000 | 1,621,599,441,000 | 169,335,840 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 134 | lean | lemma le_zero (a : mynat) (h : a ≤ 0) : a = 0 :=
begin
cases h with n hn,
symmetry at hn,
exact add_right_eq_zero a n hn,
end
|
bc03c43f20f41b4cc982087428905b5a2ab2e1d8 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/algebra/module/basic.lean | b74782dd8a5512bbb9a7bda1aa3f3c14eaaed6a4 | [
"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 | 19,587 | 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.group.hom
import group_theory.group_action.group
import algebra.s... |
f9e556c82e6d25b6b729937d77e6935fbd80457f | 437dc96105f48409c3981d46fb48e57c9ac3a3e4 | /src/algebra/ordered_field.lean | 717cab048f3de182ae12960046e63f6fcf40565f | [
"Apache-2.0"
] | permissive | dan-c-k/mathlib | 08efec79bd7481ee6da9cc44c24a653bff4fbe0d | 96efc220f6225bc7a5ed8349900391a33a38cc56 | refs/heads/master | 1,658,082,847,093 | 1,589,013,201,000 | 1,589,013,201,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,134 | 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 algebra.ordered_ring
import algebra.field
section linear_ordered_field
variables {α : Type*} [linear_ordered_field α] {a b c d : α}
lemma div_pos : 0 < a → 0... |
1172b5f3b4f57093660f5a3fbb804c2abdd68c9d | 22e97a5d648fc451e25a06c668dc03ac7ed7bc25 | /src/algebra/group_power.lean | b589f3dc5e1a857345eb3128f8f70e38282b4817 | [
"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 | 29,861 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Robert Y. Lewis
-/
import data.int.basic
import data.equiv.basic
import deprecated.ring
/-!
# Power operations on monoids and groups
The power operation on monoids and ... |
5f32e80d6149aa20d73c37e8f5b5e69bf29f77c3 | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/analysis/complex/real_deriv.lean | de69b7c23e758517433663de49b692c7e89ff94e | [
"Apache-2.0"
] | permissive | hikari0108/mathlib | b7ea2b7350497ab1a0b87a09d093ecc025a50dfa | a9e7d333b0cfd45f13a20f7b96b7d52e19fa2901 | refs/heads/master | 1,690,483,608,260 | 1,631,541,580,000 | 1,631,541,580,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,622 | lean | /-
Copyright (c) Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel, Yourong Zang
-/
import analysis.calculus.times_cont_diff
import analysis.complex.conformal
import analysis.calculus.conformal
/-! # Real differentiability of complex-... |
c7c55e59322eebb2e19471c2aa0a0a55be092e7b | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/data/rat/denumerable.lean | 7a6323f2876bfc4c79136d943175970382a2181b | [
"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 | 1,211 | lean | /-
Copyright (c) 2019 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import set_theory.cardinal
/-!
# Denumerability of ℚ
This file proves that ℚ is infinite, denumerable, and deduces that it has cardinality `omega`.
-/
namespace rat
op... |
40d61574be2dd0235c94a5eaa70b894901760cf2 | 22e97a5d648fc451e25a06c668dc03ac7ed7bc25 | /src/data/mv_polynomial.lean | 4499fa490ea34c68bdc433e46ceffcb94cb04325 | [
"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 | 58,094 | 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, Johan Commelin, Mario Carneiro, Shing Tak Lam
-/
import data.polynomial
import data.equiv.ring
import data.equiv.fin
import tactic.omega
/-!
# Multivariate polynomials... |
8c5932481c3b0517072a487e1bb1be19fd595d43 | 947b78d97130d56365ae2ec264df196ce769371a | /tests/lean/run/proofIrrelFVar.lean | 899e2501b0f135b21eae77fdb3fe21d1fa0de011 | [
"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 | 183 | lean | new_frontend
universes u
variables {α : Type u} {p : α → Prop}
theorem ex (a : α) (h1 h2 : p a) (h : Subtype.mk a h1 = Subtype.mk a h1) : Subtype.mk a h1 = Subtype.mk a h2 :=
h
|
559c4af02bb0b89503be633a69143086719375e8 | 86f6f4f8d827a196a32bfc646234b73328aeb306 | /examples/logic/unnamed_508.lean | ec61ed1d045e9d29d2352999be1ca962ad8ad8c7 | [] | 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 | 202 | lean | variables {α : Type*} [partial_order α]
variables (s : set α) (a b : α)
def set_ub (s : set α) (a : α) := ∀ x, x ∈ s → x ≤ a
example (h : set_ub s a) (h' : a ≤ b) : set_ub s b :=
sorry |
12e810a3595b3bdcf3f738efcec98019f82e7260 | a81826cfd4fd71c797ea79b8e827b03ccb332c17 | /src/wonky_sq/zero_lemmas.lean | d7e2496ae9401680215b8258a6b2f9cc2913ef94 | [
"Apache-2.0"
] | permissive | jamesa9283/Generalised-Trigonometric-Functions-for-Lean | 0a0f4774363c3708be466526935c6d07f4b970f0 | 33775fb8286eacfc17397fe41af9d446cbdd78f3 | refs/heads/master | 1,669,337,232,958 | 1,597,061,947,000 | 1,597,061,947,000 | 276,104,804 | 0 | 0 | null | 1,593,540,795,000 | 1,593,523,262,000 | Lean | UTF-8 | Lean | false | false | 1,296 | lean | import tactic
import data.real.basic
import data.complex.exponential
import analysis.special_functions.pow
import wonky_sq.basic
/-!
# Defining the functions at zero
## Wonky Square GTFs
Let us show that these functions follow general trigonometric convention. We
are going to show here that they have have valu... |
a84ca4d5ceadd62a9b737ba7f7c39ef04dbd602b | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/measure_theory/bochner_integration.lean | c1986d69b3d3a354cfea1313481561ef6cbe48bd | [] | 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 | 66,805 | lean | /-
Copyright (c) 2019 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou, Yury Kudryashov
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.measure_theory.simple_func_dense
import Mathlib.analysis.normed_space.bounde... |
bd592e27a4fcc097d13883b27cd494638418c7e0 | a4673261e60b025e2c8c825dfa4ab9108246c32e | /stage0/src/Lean/Meta/Match/MVarRenaming.lean | ef7be449e0f88a683a181ff8dec0dfad9ae0587d | [
"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,034 | 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.ReplaceExpr
namespace Lean.Meta
/- A mapping from MVarId to MVarId -/
structure MVarRenaming :=
(map : NameMap MVarId := {})
def MVarR... |
d61df0ae8c98b5366a6d3979a94a4bd9d63e7dbf | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/set_theory/cardinal.lean | 05f99aeb6ebc6f0f95ca24635ad3c4f1691e3b63 | [
"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 | 52,248 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro, Floris van Doorn
-/
import data.set.countable
import set_theory.schroeder_bernstein
import data.fintype.card
import data.nat.enat
/-!
# Cardinal Number... |
81b5c91b0c171e1acf58e10e9b29b64637d7ff70 | 1546f9083f4babf70df0329497d1ee05adc8c665 | /src/monoidal_categories_reboot/monoidal_functor.lean | 52b92f43f482f4e59e4d70316627fdf5b526a401 | [
"Apache-2.0"
] | permissive | khoek/monoidal-categories-reboot | 0899b0d4552ff039388042059c91f7207c6c34e5 | ed3df8ecce5d4e3d95cb858911bad12bb632cf8a | refs/heads/master | 1,588,877,903,131 | 1,554,987,273,000 | 1,554,987,273,000 | 180,791,863 | 0 | 0 | null | 1,554,987,295,000 | 1,554,987,295,000 | null | UTF-8 | Lean | false | false | 5,966 | lean | -- Copyright (c) 2018 Michael Jendrusch. All rights reserved.
import category_theory.category
import category_theory.functor
import category_theory.products
import category_theory.natural_isomorphism
import .tensor_product
import .monoidal_category
import tactic.rewrite_search
import tactic.interactive
import .slice_t... |
a4e9cb32dc136011254be1f7859c92dc1b3b59a4 | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/group_theory/nilpotent.lean | dbcd636d945d562dacb313aa9e7863af351af9b4 | [
"Apache-2.0"
] | permissive | hikari0108/mathlib | b7ea2b7350497ab1a0b87a09d093ecc025a50dfa | a9e7d333b0cfd45f13a20f7b96b7d52e19fa2901 | refs/heads/master | 1,690,483,608,260 | 1,631,541,580,000 | 1,631,541,580,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 16,110 | lean | /-
Copyright (c) 2021 Kevin Buzzard. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Buzzard, Ines Wright
-/
import group_theory.general_commutator
import group_theory.quotient_group
/-!
# Nilpotent groups
An API for nilpotent groups, that is, groups for which... |
88b2317d3f71dcdf0b9a3004707f4c323926f73e | 5756a081670ba9c1d1d3fca7bd47cb4e31beae66 | /Mathport/Syntax/Translate/Tactic/Mathlib/Cache.lean | 3e0d99b8928d7863c32ff1320a46198fff6c4a30 | [
"Apache-2.0"
] | permissive | leanprover-community/mathport | 2c9bdc8292168febf59799efdc5451dbf0450d4a | 13051f68064f7638970d39a8fecaede68ffbf9e1 | refs/heads/master | 1,693,841,364,079 | 1,693,813,111,000 | 1,693,813,111,000 | 379,357,010 | 27 | 10 | Apache-2.0 | 1,691,309,132,000 | 1,624,384,521,000 | Lean | UTF-8 | Lean | false | false | 1,567 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import Mathport.Syntax.Translate.Tactic.Mathlib.Interactive
open Lean
open Lean.Elab.Tactic (Location)
namespace Mathport.Translate.Tactic
open AST3
open Tra... |
588f2ae0c6a289f6c958d3caf2b895844c033cfd | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/interp.lean | 9ef1761547439599a519a812cf3b745c9984ee02 | [
"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 | 2,022 | lean | inductive Vector (α : Type u) : Nat → Type u
| nil : Vector α 0
| cons : α → Vector α n → Vector α (n+1)
infix:67 " :: " => Vector.cons
inductive Ty where
| int
| bool
| fn (a r : Ty)
abbrev Ty.interp : Ty → Type
| int => Int
| bool => Bool
| fn a r => a.interp → r.interp
inductive HasType : Fi... |
e926a753f6b7927e351cfe053fb87f0824fb80c8 | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/order/fixed_points.lean | 830d361fa86ed6908849826272c6bb06b5b068c8 | [
"Apache-2.0"
] | permissive | fpvandoorn/mathlib | b21ab4068db079cbb8590b58fda9cc4bc1f35df4 | b3433a51ea8bc07c4159c1073838fc0ee9b8f227 | refs/heads/master | 1,624,791,089,608 | 1,556,715,231,000 | 1,556,715,231,000 | 165,722,980 | 5 | 0 | Apache-2.0 | 1,552,657,455,000 | 1,547,494,646,000 | Lean | UTF-8 | Lean | false | false | 8,675 | 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, Kenny Lau
Fixed point construction on complete lattices.
-/
import order.complete_lattice
universes u v w
variables {α : Type u} {β : Type v} {γ : Type w}
namespace ... |
5fbfcf42c879a2650645512aaa712aca7f32fe40 | 4950bf76e5ae40ba9f8491647d0b6f228ddce173 | /src/order/filter/germ.lean | 5c3d76720d5204ad0e9a63b42a3c1e2932231d47 | [
"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 | 21,344 | 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, Abhimanyu Pallavi Sudhir
-/
import order.filter.basic
import algebra.module.pi
/-!
# Germ of a function at a filter
The germ of a function `f : α → β` at a fi... |
87b9b9227f88e68ed220c1e2d47dff1978e3d316 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/field_theory/finite/galois_field.lean | d787c29c4b3c7cdd30f91a9846f8bec8503f4f90 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 9,777 | lean | /-
Copyright (c) 2021 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson, Alex J. Best, Johan Commelin, Eric Rodriguez, Ruben Van de Velde
-/
import algebra.char_p.algebra
import data.zmod.algebra
import field_theory.finite.basic
import fiel... |
3e031512a0eb525e13c646a1c6c595b0b40b32f0 | 51c1a276984eccde1889df19fbc87b914cad4613 | /lib/data/pow.lean | 91120d8b20c02314256dbce138f08b6e1a0135b2 | [] | no_license | cipher1024/lean-modexp | 6c0e996654b6a31c2e7be646072091530e4ffb9f | d779c1b9f588e86181beca26e32c4c1ae8ef1f36 | refs/heads/master | 1,609,627,624,569 | 1,510,265,500,000 | 1,510,265,500,000 | 99,388,479 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 1,612 | lean |
import algebra.group_power
universe u
section pow
open nat (hiding pow_succ)
variable {α : Type u}
section comm_monoid
variables [monoid α]
lemma pow_pow_comm (p : α) (x y : ℕ)
: p^x^y = p^y^x :=
by rw [← pow_mul p,mul_comm,pow_mul]
end comm_monoid
section linear_ordered_semiring
variable [linear_ordered_sem... |
1ac1b177a5a91da7913bf20117418a2d5805f1d0 | cf39355caa609c0f33405126beee2739aa3cb77e | /library/init/classical.lean | 47fe033fa2cdf879144f375dd501b2dcba9ed465 | [
"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 | 5,559 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Jeremy Avigad, Mario Carneiro
-/
prelude
import init.data.subtype.basic init.funext
namespace classical
universes u v
/-- The axiom -/
axiom choice {α : Sor... |
34def3d4c2260e42693371f81d5ed52225f3714e | 5df84495ec6c281df6d26411cc20aac5c941e745 | /src/formal_ml/hahn.lean | a5e45a28369404e76cc11de930c6e6282d5349bc | [
"Apache-2.0"
] | permissive | eric-wieser/formal-ml | e278df5a8df78aa3947bc8376650419e1b2b0a14 | 630011d19fdd9539c8d6493a69fe70af5d193590 | refs/heads/master | 1,681,491,589,256 | 1,612,642,743,000 | 1,612,642,743,000 | 360,114,136 | 0 | 0 | Apache-2.0 | 1,618,998,189,000 | 1,618,998,188,000 | null | UTF-8 | Lean | false | false | 57,744 | lean | /-
Copyright 2020 Google LLC
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
di... |
2953e44afa058f0bc3b30e50fde4196c0c13cb68 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /test/norm_num.lean | 3a5632417f06aa22c74d74e3ba938ef1e8c5fbdf | [
"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 | 12,581 | lean | /-
Copyright (c) 2017 Simon Hudon All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon, Mario Carneiro
-/
import tactic.norm_num
/-!
# Tests for `norm_num` extensions
-/
constant real : Type
notation `ℝ` := real
@[instance] constant real.linear_ordered_ring : ... |
254c006b2a599a8df013516be04d02ccb9aff840 | 41ebf3cb010344adfa84907b3304db00e02db0a6 | /uexp/src/uexp/rules/aggregation.lean | 0ef2af2944f2aa0a2bfd3909ac9072c1668f6ad6 | [
"BSD-2-Clause"
] | permissive | ReinierKoops/Cosette | e061b2ba58b26f4eddf4cd052dcf7abd16dfe8fb | eb8dadd06ee05fe7b6b99de431dd7c4faef5cb29 | refs/heads/master | 1,686,483,953,198 | 1,624,293,498,000 | 1,624,293,498,000 | 378,997,885 | 0 | 0 | BSD-2-Clause | 1,624,293,485,000 | 1,624,293,484,000 | null | UTF-8 | Lean | false | false | 999 | lean | import ..sql
import ..tactics
import ..u_semiring
import ..extra_constants
import ..meta.cosette_tactics
open Expr
open Proj
open Pred
open SQL
open tree
theorem aggegation_query :
forall (Γ : Schema) s (a : relation s) C0 (value : Column C0 s) C1 (label: Column C1 s) (l : const C1),
(denoteSQL ((SELECT *
... |
06479e8234371fbb107ccb304e19e6b3db75ebec | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/algebra/order/with_zero.lean | 426b80974405494580a7086092d94ae3c057730c | [
"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 | 9,553 | lean | /-
Copyright (c) 2020 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Johan Commelin, Patrick Massot
-/
import algebra.order.group
import algebra.group_with_zero
import algebra.group_with_zero.power
import tactic.abel
/-!
# Linearly ordered commu... |
c1ea429ee99d47738a512ed73498a88d3c698ea7 | e61a235b8468b03aee0120bf26ec615c045005d2 | /src/Init/Lean/Data/Json/Parser.lean | 5d6545480af8465be620a7776da98827c6b1b09d | [
"Apache-2.0"
] | permissive | SCKelemen/lean4 | 140dc63a80539f7c61c8e43e1c174d8500ec3230 | e10507e6615ddbef73d67b0b6c7f1e4cecdd82bc | refs/heads/master | 1,660,973,595,917 | 1,590,278,033,000 | 1,590,278,033,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,242 | lean | /-
Copyright (c) 2019 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner, Marc Huisinga
-/
prelude
import Init.Lean.Data.Json.Basic
import Init.Control.Except
namespace Lean
inductive Quickparse.Result (α : Type)
| success (pos : String.Iter... |
8c42af6988c127b3c02b4946412bf58e5a759d2e | b7f22e51856f4989b970961f794f1c435f9b8f78 | /hott/algebra/e_closure.hlean | 2aa3cc3d475a26b57d43ac1c7d6d13df42bcf28f | [
"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 | 10,833 | hlean | /-
Copyright (c) 2015 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Floris van Doorn
The "equivalence closure" of a type-valued relation.
A more appropriate intuition is the type of words formed from the relation,
and inverses, concatenations and r... |
8e652676bbfbcd703565ac10088af5e1ba834586 | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/field_theory/primitive_element.lean | 0f211cd49bccf2a31da845e9886adefe90fc0774 | [
"Apache-2.0"
] | permissive | hikari0108/mathlib | b7ea2b7350497ab1a0b87a09d093ecc025a50dfa | a9e7d333b0cfd45f13a20f7b96b7d52e19fa2901 | refs/heads/master | 1,690,483,608,260 | 1,631,541,580,000 | 1,631,541,580,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,072 | lean | /-
Copyright (c) 2020 Thomas Browning, Patrick Lutz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Thomas Browning, Patrick Lutz
-/
import field_theory.adjoin
import field_theory.algebraic_closure
import field_theory.separable
/-!
# Primitive Element Theorem
In thi... |
44d91d631192c50a505d9dc81024b04c7a1dd469 | 592ee40978ac7604005a4e0d35bbc4b467389241 | /Library/generated/mathscheme-lean/Lattice.lean | 6fe88ed6483811a9fbc384d82f7589369cec2c76 | [] | 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 | 9,540 | 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 Lattice
structure Lattice (A : Type) : Type :=
(times : (A → (A → A)))
(plus : (A → (A → A)))
(commutative_times : (∀ {x y : A} , (times x y) = (times y ... |
ede9a48566bf69086359bdaad29a5980dd0a652d | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/congr_lemma1.lean | 385e00ce401f8919e1af60b92d9c8e72ed779f41 | [
"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 | 235 | lean | open tactic
set_option pp.binder_types true
example : true :=
by do
ite ← mk_const `ite,
l ← mk_congr_lemma_simp ite,
trace (congr_lemma.type l),
l ← mk_hcongr_lemma ite,
trace (congr_lemma.type l),
constructor
|
fb8b37f6ca5db276a526e7d0397a2a4d329a2952 | cf39355caa609c0f33405126beee2739aa3cb77e | /library/init/meta/pexpr.lean | a641349cf9b0d14f15f73ed13a2de622c445127a | [
"Apache-2.0"
] | permissive | leanprover-community/lean | 12b87f69d92e614daea8bcc9d4de9a9ace089d0e | cce7990ea86a78bdb383e38ed7f9b5ba93c60ce0 | refs/heads/master | 1,687,508,156,644 | 1,684,951,104,000 | 1,684,951,104,000 | 169,960,991 | 457 | 107 | Apache-2.0 | 1,686,744,372,000 | 1,549,790,268,000 | C++ | UTF-8 | Lean | false | false | 1,539 | 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 :... |
395c1ce33d894e15846a7fd84f6c2895deb7a95b | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/field_theory/algebraic_closure.lean | a03fdf6f784b24f64d15d5e1e1ac1c622b209cf0 | [
"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 | 15,266 | lean | /-
Copyright (c) 2020 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import algebra.direct_limit
import field_theory.splitting_field
/-!
# Algebraic Closure
In this file we define the typeclass for algebraically closed fields and algebraic cl... |
cbbd9a7e2e2c792f6eab0827b9e03b21513f229e | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/tactic/derive_fintype.lean | 96311d442a03d55c602d24ab362bdd73b8c5f97d | [
"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,322 | lean | /-
Copyright (c) 2020 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.fintype.basic
/-!
# Derive handler for `fintype` instances
This file introduces a derive handler to automatically generate `fintype`
instances for struc... |
d84f834f4bc1e930c125edcbd640f8a19fcf3af9 | 680b0d1592ce164979dab866b232f6fa743f2cc8 | /library/algebra/group_bigops.lean | d10398d9bac97d978810d8ed4874d98d6ab77bbb | [
"Apache-2.0"
] | permissive | syohex/lean | 657428ab520f8277fc18cf04bea2ad200dbae782 | 081ad1212b686780f3ff8a6d0e5f8a1d29a7d8bc | refs/heads/master | 1,611,274,838,635 | 1,452,668,188,000 | 1,452,668,188,000 | 49,562,028 | 0 | 0 | null | 1,452,675,604,000 | 1,452,675,602,000 | null | UTF-8 | Lean | false | false | 16,833 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Jeremy Avigad
Finite products on a monoid, and finite sums on an additive monoid. There are three versions:
Prodl, Suml : products and sums over lists
Prod, Sum... |
98cfe7be4720da5f5aed2886032c9f88f1d111f5 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/number_theory/basic.lean | d8517764b3f7200b743971abd20f6f42b1b88097 | [
"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 | 1,002 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Kenny Lau
-/
import algebra.geom_sum
import ring_theory.ideal.basic
section
open ideal ideal.quotient
lemma dvd_sub_pow_of_dvd_sub {R : Type*} [comm_ring R] {p : ℕ}... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.