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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
49f1a252884e9f7cd9899ab1e2c72434a738518b | e0f9ba56b7fedc16ef8697f6caeef5898b435143 | /src/topology/algebra/infinite_sum.lean | 64bb20c078f52259f14156809bf6ad04c6093d97 | [
"Apache-2.0"
] | permissive | anrddh/mathlib | 6a374da53c7e3a35cb0298b0cd67824efef362b4 | a4266a01d2dcb10de19369307c986d038c7bb6a6 | refs/heads/master | 1,656,710,827,909 | 1,589,560,456,000 | 1,589,560,456,000 | 264,271,800 | 0 | 0 | Apache-2.0 | 1,589,568,062,000 | 1,589,568,061,000 | null | UTF-8 | Lean | false | false | 35,445 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
Infinite sum over a topological monoid
This sum is known as unconditionally convergent, as it sums to the same value under all possible
permutations. For Euclidean spa... |
066367606ecdfa4d0d13034aa575ef45bc604152 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/linear_algebra/special_linear_group.lean | 7ddc9aa1a2761cf55fe72a98da821f4ed9761d66 | [
"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 | 5,696 | lean | /-
Copyright (c) 2020 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Anne Baanen.
The Special Linear group $SL(n, R)$
-/
import linear_algebra.matrix
import linear_algebra.nonsingular_inverse
/-!
# The Special Linear group $SL(n, R)$
This file de... |
9603debef283c6ed1f9e6c6a4405baf009fb1fdb | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /src/algebra/order/sub.lean | da3fa7b8a813cebf20d7b7347a3df349eb459eb4 | [
"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 | 27,618 | lean | /-
Copyright (c) 2021 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
-/
import algebra.order.monoid
/-!
# Ordered Subtraction
This file proves lemmas relating (truncated) subtraction with an order. We provide a class
`has_ordered_su... |
27a38995ab87ef0605ca63af6e01f33095fa6c08 | 1a61aba1b67cddccce19532a9596efe44be4285f | /library/init/tactic.lean | 1f16ab20aebd90674999cadc282dc0a797da5a13 | [
"Apache-2.0"
] | permissive | eigengrau/lean | 07986a0f2548688c13ba36231f6cdbee82abf4c6 | f8a773be1112015e2d232661ce616d23f12874d0 | refs/heads/master | 1,610,939,198,566 | 1,441,352,386,000 | 1,441,352,494,000 | 41,903,576 | 0 | 0 | null | 1,441,352,210,000 | 1,441,352,210,000 | null | UTF-8 | Lean | false | false | 6,821 | 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
This is just a trick to embed the 'tactic language' as a Lean
expression. We should view 'tactic' as automation that when execute
produces a term. tactic.buil... |
fae63d8bcd760c46549a73423594b60f531f2b97 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/bench/rbmap500k.lean | e1ef3f43d70b13102f65f998b5c5f90a9cbd92b0 | [
"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,838 | 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
-/
prelude
import init.coe init.data.option.basic init.system.io
universes u v w w'
inductive color
| Red | Black
inductive Tree
| Leaf {} ... |
9d861dee5a561c9c5a5ed4e90468927ab453f9db | ba4794a0deca1d2aaa68914cd285d77880907b5c | /src/game/world8/level4.lean | 6700729952b38f934d02006d3cef71e869373b26 | [
"Apache-2.0"
] | permissive | ChrisHughes24/natural_number_game | c7c00aa1f6a95004286fd456ed13cf6e113159ce | 9d09925424da9f6275e6cfe427c8bcf12bb0944f | refs/heads/master | 1,600,715,773,528 | 1,573,910,462,000 | 1,573,910,462,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,013 | lean | import mynat.definition -- hide
import mynat.add -- hide
import game.world8.level3 -- hide
namespace mynat -- hide
/-
# Advanced Addition World
## Level 4: `eq_iff_succ_eq_succ`
Here is an `iff` goal. You can split it into two goals (the implications in both
directions) using the `split` tactic, which is how you're... |
1190f603fb29a016c611d6085bb6a01fa73dfc6f | 853df553b1d6ca524e3f0a79aedd32dde5d27ec3 | /src/ring_theory/ideals.lean | 98d3a6be84a18b6c7a534d0c1b6da36059d1919b | [
"Apache-2.0"
] | permissive | DanielFabian/mathlib | efc3a50b5dde303c59eeb6353ef4c35a345d7112 | f520d07eba0c852e96fe26da71d85bf6d40fcc2a | refs/heads/master | 1,668,739,922,971 | 1,595,201,756,000 | 1,595,201,756,000 | 279,469,476 | 0 | 0 | null | 1,594,696,604,000 | 1,594,696,604,000 | null | UTF-8 | Lean | false | false | 20,092 | 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, Mario Carneiro
-/
import algebra.associated
import algebra.pointwise
import linear_algebra.basic
import order.zorn
universes u v
variables {α : Type u} {β : Type v... |
9694589225352465241d6098b5d58c52ad683563 | eeee7bfb5e0033ce2c5099a3cf5c87a3c71b1f62 | /src/adic_space.lean | 8fa53e9dce6b4734426b77438344b463973cfe4e | [
"Apache-2.0"
] | permissive | jesse-michael-han/lean-perfectoid-spaces | f0c652bc1a0de64de90bb8c98f26d9579b226a9c | 45b42a5302dca28910ae9c6e3847c025e5ba4180 | refs/heads/master | 1,584,646,248,214 | 1,528,569,065,000 | 1,528,569,065,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,797 | lean | import for_mathlib.prime
import for_mathlib.is_cover
import analysis.topology.topological_structures
import data.nat.prime
import algebra.group_power
import for_mathlib.presheaves
import for_mathlib.topology
open nat function
variables (R : Type) [comm_ring R] [topological_space R] [topological_ring R]
-- Scholz... |
3ef4ea8b9142ddc661c7dcef1e68a25356a4e8d2 | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /tests/lean/run/frontend_meeting_2022_09_13.lean | b8074fcb50a3ef5ff933e42cef70664593920015 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | tobiasgrosser/lean4 | ce0fd9cca0feba1100656679bf41f0bffdbabb71 | ebdbdc10436a4d9d6b66acf78aae7a23f5bd073f | refs/heads/master | 1,673,103,412,948 | 1,664,930,501,000 | 1,664,930,501,000 | 186,870,185 | 0 | 0 | Apache-2.0 | 1,665,129,237,000 | 1,557,939,901,000 | Lean | UTF-8 | Lean | false | false | 3,158 | lean | import Lean
/-
(1) How are the source information, comments etc stored in the Syntax tree? In particular, how can one recreate the original source?
-/
elab "#reprint" e:term : command => do
let some val := e.raw.reprint | throwError "failed to reprint"
IO.println val
#reprint
let x : Nat := 3 -- My comment 1
... |
7a9c9ca7953adfbd856db034d3730390e90d995b | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/pi.lean | 97564dfd147a7d340c6a0760596565c5d212f1b1 | [] | 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 | 3,239 | lean | /-
Copyright (c) 2020 Eric Wieser. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon, Patrick Massot, Eric Wieser
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.tactic.split_ifs
import Mathlib.tactic.simpa
import Mathlib.algebra.... |
a86ee7a21ebdd4a90f53062f3e460b3313e6878b | 94e33a31faa76775069b071adea97e86e218a8ee | /src/algebra/category/FinVect.lean | f78a110c0bf5d86ce41ce1f439ec4986396dd768 | [
"Apache-2.0"
] | permissive | urkud/mathlib | eab80095e1b9f1513bfb7f25b4fa82fa4fd02989 | 6379d39e6b5b279df9715f8011369a301b634e41 | refs/heads/master | 1,658,425,342,662 | 1,658,078,703,000 | 1,658,078,703,000 | 186,910,338 | 0 | 0 | Apache-2.0 | 1,568,512,083,000 | 1,557,958,709,000 | Lean | UTF-8 | Lean | false | false | 5,267 | lean | /-
Copyright (c) 2021 Jakob von Raumer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jakob von Raumer
-/
import category_theory.monoidal.rigid.basic
import category_theory.monoidal.subcategory
import linear_algebra.tensor_product_basis
import linear_algebra.coevaluat... |
f9959e0b74e0b47106f1d5b0d02281f8432b7f95 | 82b86ba2ae0d5aed0f01f49c46db5afec0eb2bd7 | /src/Init/System/IO.lean | 5d66eada39ae76fc75d710011ba69e3d8a9c1d27 | [
"Apache-2.0"
] | permissive | banksonian/lean4 | 3a2e6b0f1eb63aa56ff95b8d07b2f851072d54dc | 78da6b3aa2840693eea354a41e89fc5b212a5011 | refs/heads/master | 1,673,703,624,165 | 1,605,123,551,000 | 1,605,123,551,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 18,532 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Luke Nelson, Jared Roesch, Leonardo de Moura, Sebastian Ullrich
-/
prelude
import Init.Control.EState
import Init.Control.Reader
import Init.Data.String
import Init.Data.ByteArr... |
1b3b2812df8dec97ebba44858a0d137e60030978 | e9078bde91465351e1b354b353c9f9d8b8a9c8c2 | /two_quotient_and_ap.hlean | 31c384d5a6afd54953451680631d2c67eb714c6b | [
"Apache-2.0"
] | permissive | EgbertRijke/leansnippets | 09fb7a9813477471532fbdd50c99be8d8fe3e6c4 | 1d9a7059784c92c0281fcc7ce66ac7b3619c8661 | refs/heads/master | 1,610,743,957,626 | 1,442,532,603,000 | 1,442,532,603,000 | 41,563,379 | 0 | 0 | null | 1,440,787,514,000 | 1,440,787,514,000 | null | UTF-8 | Lean | false | false | 1,520 | hlean | import hit.two_quotient hit.interval
open two_quotient sum unit interval e_closure eq function
namespace test
definition A := interval + unit
inductive R : A → A → Type :=
| Rmk0 : R (inl zero) (inr star)
| Rmk1 : R (inl one) (inr star)
open R
-- definition torus_R (x y : unit) := bool
-- local infi... |
e3847fe7a000989656f700eba33d06fbdc537de1 | c45b34bfd44d8607a2e8762c926e3cfaa7436201 | /uexp/src/uexp/rules/relationalAlgebra.lean | abdf5b0698e4b44fd8643a3030b2276af175247c | [
"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 | 2,877 | lean | import ..u_semiring
import ..sql
import ..tactics
import ..ucongr
import ..TDP
set_option profiler true
open Expr
open Proj
open Pred
open SQL
lemma commutativeSelect:
forall Γ s a slct0 slct1,
denoteSQL ((SELECT * FROM1 (SELECT * FROM1 a WHERE slct1) WHERE slct0): SQL Γ s) =
denoteSQL ((SELECT * FROM1 (SEL... |
0a3c06d0b0edc5dc3ef0302e5983c79991ec18f9 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/data/set/lattice.lean | 3f784fc371977b191b16d2ad7905bcc47d1ab462 | [
"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 | 48,594 | 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, Johannes Hölzl, Mario Carneiro
-- QUESTION: can make the first argument in ∀ x ∈ a, ... implicit?
-/
import order.complete_boolean_algebra
import data... |
45c1bf290ff26fcc5b2cc458ba6ba1ec2f92045d | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/ring_theory/polynomial/vieta.lean | d98adcd5c1f08420da5c1c15831d284bf2838864 | [
"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 | 4,426 | lean | /-
Copyright (c) 2020 Hanting Zhang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hanting Zhang
-/
import ring_theory.polynomial.symmetric
/-!
# Vieta's Formula
The main result is `vieta.prod_X_add_C_eq_sum_esymm`, which shows that the product of linear terms
`λ + ... |
df0652b336c9314442990cf758b77e4811791c7b | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/finset/basic.lean | b5a9474b392566ff28c01b488a61a94b7b6257bf | [] | 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 | 115,318 | 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, Minchao Wu, Mario Carneiro
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.multiset.finset_ops
import Mathli... |
4410efb7841aa9360783a753fa3a862e872a9925 | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /src/data/equiv/fin.lean | 989c861556f852697dac2ba2304db0191d2ac73c | [
"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 | 13,799 | 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.fin
import data.equiv.basic
import tactic.norm_num
/-!
# Equivalences for `fin n`
-/
universe variables u
variables {m n : ℕ}
/-- Equivalence between `fin 0` an... |
6715c8f8e215d967e02c44b306bfa8ffdde68e9a | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/hom/equiv/type_tags.lean | 9f40a2cd08224bcf185eea80cef01b4e94d2c1f7 | [
"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 | 3,235 | lean | /-
Copyright (c) 2018 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Callum Sutton, Yury Kudryashov
-/
import algebra.hom.equiv.basic
import algebra.group.type_tags
/-!
# Additive and multiplicative equivalences associated to `multiplic... |
557aa9aab4b1da37fe3bfd9cbe7e2f88617c9d94 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Elab/Deriving/SizeOf.lean | 0d904db525f4e312369c334c1a80f085564c7442 | [
"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 | 807 | 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.SizeOf
import Lean.Elab.Deriving.Basic
/-!
Remark: `SizeOf` instances are automatically generated. We add support for `deriving instance` ... |
8d174e1f3883a28c62e8c9b8bedade0aa0a38cec | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/analysis/calculus/fderiv/basic.lean | ca62479ba25cc811a223a704973c0aed857040de | [
"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 | 47,357 | 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.asymptotics.asymptotic_equivalent
import analysis.calculus.tangent_cone
import analysis.normed_space.bounded_linear_... |
e4c96df29396b11ccdc8072526742bf526747270 | 367134ba5a65885e863bdc4507601606690974c1 | /src/algebra/lie/matrix.lean | f99c9bae24bf09fb7b2587ee22c3b33a4d184c42 | [
"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 | 3,354 | lean | /-
Copyright (c) 2021 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import algebra.lie.of_associative
import linear_algebra.matrix
/-!
# Lie algebras of matrices
An important class of Lie algebras are those arising from the associative al... |
15419ee07f558d1e087ab51a5ae704205477bc4e | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /hott/types/prod.hlean | c2db35d3e7ab9235c1d1f2c95bb19457e745e29e | [
"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 | 8,707 | 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, Jakob von Raumer
Ported from Coq HoTT
Theorems about products
-/
open eq equiv is_equiv is_trunc prod prod.ops unit
variables {A A' B B' C D : Type} {P Q : A → T... |
1535d6715be292bd77fe5aafcd2cb4208909c986 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/algebra/continued_fractions/basic_auto.lean | 5c680985c70a4851759057da74c98bad517e27db | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 14,823 | lean | /-
Copyright (c) 2019 Kevin Kappelmann. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Kappelmann
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.seq.seq
import Mathlib.algebra.field
import Mathlib.PostPort
universes u_1 l u_2 ... |
ea9dc24b24c2d58f67a2149ba688e239d9263dd2 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/ring_theory/perfection.lean | dbae95179f92c3c7ec195488db7ab245602c90b4 | [
"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 | 25,374 | 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.char_p
import algebra.ring.pi
import analysis.special_functions.pow
import field_theory.perfect_closure
import ring_theory.localization
import ring_theory.subri... |
dba1da24c2678ec5e6d9c08e762dd14f8220cfe1 | 453dcd7c0d1ef170b0843a81d7d8caedc9741dce | /algebra/order_functions.lean | 416181a29a9cfec7dc76eb28fd87e05193defa39 | [
"Apache-2.0"
] | permissive | amswerdlow/mathlib | 9af77a1f08486d8fa059448ae2d97795bd12ec0c | 27f96e30b9c9bf518341705c99d641c38638dfd0 | refs/heads/master | 1,585,200,953,598 | 1,534,275,532,000 | 1,534,275,532,000 | 144,564,700 | 0 | 0 | null | 1,534,156,197,000 | 1,534,156,197,000 | null | UTF-8 | Lean | false | false | 6,676 | 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.ordered_group order.lattice
open lattice
universes u v
variables {α : Type u} {β : Type v}
section
variables [decidable_linear_order α] [decidable_l... |
bfee8cdd662474299a3290eb0d9e67bf61313f66 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/non_exhaustive_error.lean | 6a0622b7866c56092a73d82e38d61d6a7f26b2c3 | [
"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 | 658 | lean | --
def g : ℕ × ℕ → ℕ
| (0, n) := n
| (m+2, 0) := m
definition f : string → nat → bool
| "hello world" 1 := tt
| "bye" _ := tt
def foo (y : ℕ) : ℕ → ℕ → ℕ
| 0 a := a
| (x+1) 0 := 3 + foo x 10
| (x+1) (n+2) := 42
namespace other
mutual def f, g
with f : nat → nat → nat
| 0 0 := 1
with g : nat → na... |
bc04f6302cab36e3410d502e894d463fec21f116 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/analysis/complex/isometry.lean | f28b06bd52e84bc68e7ecdf871d7cb6d997b3005 | [
"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,462 | lean | /-
Copyright (c) 2021 François Sunatori. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: François Sunatori
-/
import analysis.complex.circle
import linear_algebra.determinant
import linear_algebra.general_linear_group
/-!
# Isometries of the Complex Plane
The lemma `l... |
cd44efc02f333f49e1259a92c623a432e026cfbb | 205f0fc16279a69ea36e9fd158e3a97b06834ce2 | /EXAMS/exam1-practice.lean | 2654d120baf4a0886ea414f8683215e4ffb17c63 | [] | no_license | kevinsullivan/cs-dm-lean | b21d3ca1a9b2a0751ba13fcb4e7b258010a5d124 | a06a94e98be77170ca1df486c8189338b16cf6c6 | refs/heads/master | 1,585,948,743,595 | 1,544,339,346,000 | 1,544,339,346,000 | 155,570,767 | 1 | 3 | null | 1,541,540,372,000 | 1,540,995,993,000 | Lean | UTF-8 | Lean | false | false | 7,852 | lean | /-***************-/
/- ** BASICS ** --/
/-***************-/
/-
#
Write a defintion of x as a value of
type nat having the specific value 0.
Be sure it type-checks.
-/
def x : nat := 0
def x' := 0
/-
#
Write a definition of f as a function
of type ℕ → ℕ that returns the square of
the value to which it is appl... |
cd0ca06cf6207aa29d48e41b3c541acc538bd0e7 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/linear_algebra/finsupp.lean | 93d32abc4829870c45fdd8f098fa8a8572e172ea | [
"Apache-2.0"
] | permissive | gebner/mathlib | eab0150cc4f79ec45d2016a8c21750244a2e7ff0 | cc6a6edc397c55118df62831e23bfbd6e6c6b4ab | refs/heads/master | 1,625,574,853,976 | 1,586,712,827,000 | 1,586,712,827,000 | 99,101,412 | 1 | 0 | Apache-2.0 | 1,586,716,389,000 | 1,501,667,958,000 | Lean | UTF-8 | Lean | false | false | 17,126 | 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 linear_algebra.basic
noncomputable theory
open set linear_map submodule
open... |
f051d575723a004bb815bbb0578e4df84df82b59 | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/ring_theory/adjoin_root.lean | 46c99fa0da797ea84462cdedf3a09006715d4a3f | [
"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 | 3,418 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Chris Hughes
Adjoining roots of polynomials
-/
import data.polynomial ring_theory.principal_ideal_domain
noncomputable theory
universes u v w
variables {α : Type u... |
b672624eee9e364987b71a26701ba42832f42e24 | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /src/algebra/lie/submodule.lean | 981f2fa1dd92424b47289d8ddad4b8fefd8827fa | [
"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 | 33,387 | lean | /-
Copyright (c) 2021 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import algebra.lie.subalgebra
import ring_theory.noetherian
/-!
# Lie submodules of a Lie algebra
In this file we define Lie submodules and Lie ideals, we construct the l... |
4c7bc1ab7d83b23ae6ab71f1d33dc7ac84805dc2 | 7b9ff28673cd3dd7dd3dcfe2ab8449f9244fe05a | /src/jesse/exercises-day-one.lean | a74ecc86ad00b712a554f199979ddef85e07056c | [] | no_license | jesse-michael-han/hanoi-lean-2019 | ea2f0e04f81093373c48447065765a964ee82262 | a5a9f368e394d563bfcc13e3773863924505b1ce | refs/heads/master | 1,591,320,223,247 | 1,561,022,886,000 | 1,561,022,886,000 | 192,264,820 | 1 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 4,847 | lean | open classical
/- Fill in the `sorry`s below -/
local attribute [instance, priority 0] prop_decidable
example (p : Prop) : p ∨ ¬ p :=
begin
by_cases p,
{ sorry },
{ sorry }
end
example (p : Prop) : p ∨ ¬ p :=
begin
by_cases h' : p,
{ sorry },
{ sorry }
end
/-
Give a calculational proof of the theorem l... |
0dd5369afc68e641d70e81d0095ec493ce449f3c | 80162757f50b09d3cad5564907e4c9b00742e045 | /list.lean | 2ef38b836aa778b602fd4fdcb03bb5d6d6455b73 | [] | no_license | EdAyers/edlib | cc30d0a54fed347a85b6df6045f68e6b48bc71a3 | 78b8c5d91f023f939c102837d748868e2f3ed27d | refs/heads/master | 1,586,459,758,216 | 1,571,322,179,000 | 1,571,322,179,000 | 160,538,917 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,288 | lean |
namespace list
universes u
variables {α : Type u} {l l₁ l₂: list α} {a : α}
@[simp] lemma rev_nil : @list.reverse α [] = [] := begin unfold reverse, unfold reverse_core end
@[simp] lemma rev_core_nil : reverse_core [] l = l := rfl
@[simp] lemma rev_core_cons : reverse_core (a::l₁) l = reverse_core... |
937c271e3f0d24addab467d28f877638c6efd690 | 53618200bef52920c1e974173f78cd378d268f3e | /hott/hit/pushout.hlean | aed77ccebbb7eea76e55534115d168e7f1f13ce8 | [
"Apache-2.0"
] | permissive | sayantangkhan/lean2 | cc41e61102e0fcc8b65e8501186dcca40b19b22e | 0fc0378969678eec25ea425a426bb48a184a6db0 | refs/heads/master | 1,590,323,112,724 | 1,489,425,932,000 | 1,489,425,932,000 | 84,854,525 | 0 | 0 | null | 1,489,425,509,000 | 1,489,425,509,000 | null | UTF-8 | Lean | false | false | 13,947 | hlean | /-
Copyright (c) 2015-16 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Ulrik Buchholtz, Jakob von Raumer
Declaration and properties of the pushout
-/
import .quotient types.sigma types.arrow_2
open quotient eq sum equiv is_trunc ... |
69bbac9b1d8772c37c0846f204434bf4d6ee9de6 | 592ee40978ac7604005a4e0d35bbc4b467389241 | /Library/generated/mathscheme-lean/Band.lean | 12782a70b0858234d1ea73a13b790c2948b7f63c | [] | 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 | 5,511 | 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 Band
structure Band (A : Type) : Type :=
(op : (A → (A → A)))
(associative_op : (∀ {x y z : A} , (op (op x y) z) = (op x (op y z))))
(idempotent_op : (∀ ... |
c6229415d20647fd5df3751f7691a2629ec37372 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /src/Lean/Meta/Match/Match.lean | 2e5e3892324db34a92ecb096f026b1d39c549244 | [
"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 | 44,085 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Util.CollectLevelParams
import Lean.Util.CollectFVars
import Lean.Util.Recognizers
import Lean.Compiler.ExternAttr
import Lean.Meta.Check
import... |
c605d8b677d178a7cc98356129f444801b452704 | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /tests/lean/num2.lean | 2516627d7f843ac4da5906c63f6840cafc2ea173 | [
"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 | 335 | lean | set_option pp.notation false
definition Prop := Type.{0}
constant eq {A : Type} : A → A → Prop
infixl `=`:50 := eq
constant N : Type.{1}
constant z : N
constant o : N
constant b : N
notation 0 := z
notation 1 := o
check 1
check 0
constant G : Type.{1}
constant gz : G
constant a : G
notation 0 := gz
check 0 = a
c... |
0eebde3f46f727856d5e6adc21dd762542bb2061 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/playground/forIn.lean | e237e81292e6080bd9df63073970acc11abfd144 | [
"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,522 | lean |
namespace ForIn
inductive Step.{u} (α : Type u)
| done : α → Step α
| yield : α → Step α
class Fold.{u, v, w, z} (m : Type w → Type z) [Monad m] (α : outParam (Type u)) (s : Type v) : Type (max v u z (w+1)):=
(fold {β : Type w} (as : s) (init : β) (f : α → β → m (Step β)) : m β)
export Fold (fold)
class FoldMap.... |
98e05d92bfd6d7694f81c4b1b1e389d84b2b93bb | c31182a012eec69da0a1f6c05f42b0f0717d212d | /src/breen_deligne/eg.lean | 12221ae0af36581e2e1b196b23bb5242220c6fb5 | [] | no_license | Ja1941/lean-liquid | fbec3ffc7fc67df1b5ca95b7ee225685ab9ffbdc | 8e80ed0cbdf5145d6814e833a674eaf05a1495c1 | refs/heads/master | 1,689,437,983,362 | 1,628,362,719,000 | 1,628,362,719,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,874 | lean | import breen_deligne.constants
open_locale nnreal
namespace breen_deligne
namespace eg
/-!
# An explicit nontrivial example of Breen-Deligne data
This example is explained in Definition 1.10 of
the blueprint https://leanprover-community.github.io/liquid/ .
-/
open universal_map
/-- The `i`-th rank of this BD p... |
de325f69cb38af819cc49c3fca88151e7d1f7842 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/1385.lean | dffa4d1d3c9039634f551de70ce80198319bf766 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 1,029 | lean | def S := List Nat
opaque TSpec : NonemptyType
def T (s : S) : Type := TSpec.type
instance (s : S) : Nonempty (T s) :=
TSpec.property
inductive Op : (ishapes : List S) → (oshape : S) → Type
| binary : (shape : S) → Op [shape, shape] shape
| gemm : {m n p : Nat} → Op [[m, n], [n, p]] [m, p]
noncomputable def O... |
ce0f6548b8157a8a878da2a48ff70984ae4bcf62 | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /stage0/src/Lean/Elab/Tactic/Delta.lean | 3e9b7fae76c7c2bb10fbc91198c68bd39142463d | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | tobiasgrosser/lean4 | ce0fd9cca0feba1100656679bf41f0bffdbabb71 | ebdbdc10436a4d9d6b66acf78aae7a23f5bd073f | refs/heads/master | 1,673,103,412,948 | 1,664,930,501,000 | 1,664,930,501,000 | 186,870,185 | 0 | 0 | Apache-2.0 | 1,665,129,237,000 | 1,557,939,901,000 | Lean | UTF-8 | Lean | false | false | 1,436 | 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.Tactic.Delta
import Lean.Elab.Tactic.Basic
import Lean.Elab.Tactic.Location
namespace Lean.Elab.Tactic
open Meta
def deltaLocalDecl (decl... |
a2e41bc4048c496d69c37dadbe72b2f5f27d1a47 | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/tactic/omega/nat/main.lean | a6abb2a6871221589aee0390997fc9eac733b555 | [
"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,172 | lean | /-
Copyright (c) 2019 Seul Baek. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Seul Baek
Main procedure for linear natural number arithmetic.
-/
import tactic.omega.prove_unsats
import tactic.omega.nat.dnf
import tactic.omega.nat.neg_elim
import tactic.omega.nat.sub_... |
d2e7a9e920675d6d2107e18b2b881b6e468c856c | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/linear_algebra/matrix/charpoly/minpoly.lean | f0722405b08807e3329b5196b4260153f29d402a | [
"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 | 1,852 | lean | /-
Copyright (c) 2020 Aaron Anderson, Jalex Stark. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson, Jalex Stark
-/
import linear_algebra.matrix.charpoly.coeff
import linear_algebra.matrix.to_lin
import ring_theory.power_basis
/-!
# The minimal polynomia... |
cb647514c2a7d69f92928ffb2da3a7caa4ce6bc5 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/declareConfigElabBug.lean | af9e7eec8f1e08a06d5c29392019adcf49523780 | [
"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 | 194 | lean | set_option trace.Elab true
theorem ex (h : a = b) : (fun x => x) a = b := by
simp (config := { beta := false, failIfUnchanged := false })
trace_state
simp (config := { beta := true }) [h]
|
15f9e1d9d4ed668ebfd46afc466e43e4d471b660 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/combinatorics/quiver/basic.lean | 37c9b5a9eb9457d9bac9eaeb361ce84a4b8dbcd3 | [
"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 | 3,116 | lean | /-
Copyright (c) 2021 David Wärn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Wärn, Scott Morrison
-/
import data.opposite
/-!
# Quivers
This module defines quivers. A quiver on a type `V` of vertices assigns to every
pair `a b : V` of vertices a type `a ⟶ b... |
96aad0d4f591c660e26b0c66e1bfadc93769048c | b7f22e51856f4989b970961f794f1c435f9b8f78 | /library/data/int/basic.lean | 16e23d7f050441d2e1f24a3a3c3d259fe39654b7 | [
"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 | 23,401 | lean | /-
Copyright (c) 2014 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Jeremy Avigad
The integers, with addition, multiplication, and subtraction. The representation of the integers is
chosen to compute efficiently.
To faciliate prov... |
2646d664319b5dbe67543966ffbfb14e988c09a8 | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /counterexamples/canonically_ordered_comm_semiring_two_mul.lean | 10bbc8194f05af8a911e91ca85441bdd3ebbf3bc | [
"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 | 9,494 | lean | /-
Copyright (c) 2021 Damiano Testa. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Damiano Testa
-/
import data.zmod.basic
import ring_theory.subsemiring
import algebra.order.monoid
/-!
A `canonically_ordered_comm_semiring` with two different elements `a` and `b` suc... |
786fb0831fc14ea7dfb8055d7c77be2c9c3d353f | e0f9ba56b7fedc16ef8697f6caeef5898b435143 | /src/field_theory/minimal_polynomial.lean | a3e898d5dc32b83394f884959090e2038f5416b4 | [
"Apache-2.0"
] | permissive | anrddh/mathlib | 6a374da53c7e3a35cb0298b0cd67824efef362b4 | a4266a01d2dcb10de19369307c986d038c7bb6a6 | refs/heads/master | 1,656,710,827,909 | 1,589,560,456,000 | 1,589,560,456,000 | 264,271,800 | 0 | 0 | Apache-2.0 | 1,589,568,062,000 | 1,589,568,061,000 | null | UTF-8 | Lean | false | false | 8,858 | lean | /-
Copyright (c) 2019 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Johan Commelin
-/
import ring_theory.integral_closure
/-!
# Minimal polynomials
This file defines the minimal polynomial of an element x of an A-algebra B,
under the assu... |
c1970b34d80044ea20b3113d02d9bae793392cb4 | 08bd4ba4ca87dba1f09d2c96a26f5d65da81f4b4 | /src/Lean/Linter/MissingDocs.lean | 3d8200fc4748e7f9b642d5a2ba0882561bd16445 | [
"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",
"Apache-2.0",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | gebner/lean4 | d51c4922640a52a6f7426536ea669ef18a1d9af5 | 8cd9ce06843c9d42d6d6dc43d3e81e3b49dfc20f | refs/heads/master | 1,685,732,780,391 | 1,672,962,627,000 | 1,673,459,398,000 | 373,307,283 | 0 | 0 | Apache-2.0 | 1,691,316,730,000 | 1,622,669,271,000 | Lean | UTF-8 | Lean | false | false | 10,289 | lean | /-
Copyright (c) 2022 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import Lean.Meta.Tactic.Simp.SimpTheorems
import Lean.Elab.Command
import Lean.Elab.SetOption
import Lean.Linter.Util
namespace Lean.Linter
open Elab.Command Parser... |
9b94338a94f7af50701e9d78aaa9af728a20c2d1 | ce89339993655da64b6ccb555c837ce6c10f9ef4 | /bluejam/chap7/section7.2.lean | 74d1221ad05c4f0f0bca4dd6b0e0bd08f45b71b0 | [] | no_license | zeptometer/LearnLean | ef32dc36a22119f18d843f548d0bb42f907bff5d | bb84d5dbe521127ba134d4dbf9559b294a80b9f7 | refs/heads/master | 1,625,710,824,322 | 1,601,382,570,000 | 1,601,382,570,000 | 195,228,870 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 544 | lean | universe u
namespace hidden
variables {α β γ : Type u}
example : inhabited bool := inhabited.mk tt
example : inhabited nat := inhabited.mk 0
def partial_composite (f : α → option β) (g : β → option γ) (x : α) : option γ
:= option.rec_on (f x) none (λ x, g x)
def func1 (n : nat) : option nat := cond (2 ∣ n) (some n... |
9bf3af7056eb97fdb6b563c647f62e1d6eb61824 | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /src/ring_theory/valuation/basic.lean | 770878f7bbfff17cd7ddd7287b78af56ad699526 | [
"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 | 24,509 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Buzzard, Johan Commelin, Patrick Massot
-/
import algebra.order.with_zero
import algebra.group_power
import ring_theory.ideal.operations
import algebra.punit_instances
/-!
# T... |
dc2be34ddcd0b1ed1c07639df8555336e903806b | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/meta/smt/default.lean | 506567fa1412361ae402c0020992034b638de4bc | [] | 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 | 493 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.meta.smt.congruence_closure
import Mathlib.Lean3Lib.init.cc_lemmas
import Mathlib.Lean3Lib.init.meta.smt... |
86591f7cc70a3ad80dfb7dad4505092333750c26 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/run/whnfinst.lean | a0d119f707377a61f33fe98da585424439e061d6 | [
"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 | 441 | lean | open decidable
attribute [reducible]
definition decidable_bin_rel {A : Type} (R : A → A → Prop) := Πx y, decidable (R x y)
section
variable {A : Type}
variable (R : A → A → Prop)
theorem tst1 (H : Πx y, decidable (R x y)) (a b c : A) : decidable (R a b ∧ R b a) :=
by tactic.apply_instance
theorem tst2 (H ... |
1e0a09d591f8cd6dfc9eda146bc1e5e2318d409a | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/ring_theory/ideal/quotient.lean | 9eeff6d9cb963f241c9b9e50ec49a19ce3f6e2b2 | [
"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 | 15,513 | 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, Mario Carneiro, Anne Baanen
-/
import linear_algebra.quotient
import ring_theory.ideal.basic
/-!
# Ideal quotients
This file defines ideal quotients as a special c... |
a603f330e2d0afcfd5ddcc5c6ad2a95e5995781b | 46125763b4dbf50619e8846a1371029346f4c3db | /src/category_theory/category/default.lean | 68e48fadaebeadc9ff7f4085488d456e26a5a6b5 | [
"Apache-2.0"
] | permissive | thjread/mathlib | a9d97612cedc2c3101060737233df15abcdb9eb1 | 7cffe2520a5518bba19227a107078d83fa725ddc | refs/heads/master | 1,615,637,696,376 | 1,583,953,063,000 | 1,583,953,063,000 | 246,680,271 | 0 | 0 | Apache-2.0 | 1,583,960,875,000 | 1,583,960,875,000 | null | UTF-8 | Lean | false | false | 7,208 | 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, Johannes Hölzl, Reid Barton
-/
import tactic.basic
import tactic.tidy
/-!
# Categories
Defines a category, as a type class parametrised by the type o... |
481605d7207e9d2d07464a9b66d84a20c793e118 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /library/data/rat/default.lean | a9cb20ed7c0ee6a138b87d92031ed63eb4313c4a | [
"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 | 180 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad
-/
import .basic .order
|
4bd87340ef4c2a624a7fe2232d0c3d8f782cc98c | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/ring_theory/hahn_series.lean | bfe54278a2a602412a24309bcc2b1ab8580dccf4 | [
"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 | 56,874 | lean | /-
Copyright (c) 2021 Aaron Anderson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson
-/
import order.well_founded_set
import algebra.big_operators.finprod
import ring_theory.valuation.basic
import algebra.module.pi
import ring_theory.power_series.basic
... |
e9a769bd20559c3602f94162e5defa1e7fdc296d | 9c2e8d73b5c5932ceb1333265f17febc6a2f0a39 | /src/S4/test.lean | 03ab1be1564b06d37d0b434966339b5dbe137742 | [
"MIT"
] | permissive | minchaowu/ModalTab | 2150392108dfdcaffc620ff280a8b55fe13c187f | 9bb0bf17faf0554d907ef7bdd639648742889178 | refs/heads/master | 1,626,266,863,244 | 1,592,056,874,000 | 1,592,056,874,000 | 153,314,364 | 12 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 396 | lean | import .tableau
open fml
def fml.iff (φ ψ : fml) := and (impl φ ψ) (impl ψ φ)
def test (ϕ : fml) := fml_is_sat [neg ϕ]
local infix ` ∨ `:1000 := fml.or
local infix ` ∧ `:1000 := fml.and
local infix ` -> `:1000 := fml.impl
local infix ` <-> `:1000 := fml.iff
local prefix `~` := fml.neg
precedence `p`:max
local pref... |
f96d1bbb5e9b7c13058fe3c7da2450c2bdf0e58c | 08bd4ba4ca87dba1f09d2c96a26f5d65da81f4b4 | /src/Lean/Elab/LetRec.lean | 41a5153137f126426937d05a272d802b3ed14551 | [
"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",
"Apache-2.0",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | gebner/lean4 | d51c4922640a52a6f7426536ea669ef18a1d9af5 | 8cd9ce06843c9d42d6d6dc43d3e81e3b49dfc20f | refs/heads/master | 1,685,732,780,391 | 1,672,962,627,000 | 1,673,459,398,000 | 373,307,283 | 0 | 0 | Apache-2.0 | 1,691,316,730,000 | 1,622,669,271,000 | Lean | UTF-8 | Lean | false | false | 5,040 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Elab.Attributes
import Lean.Elab.Binders
import Lean.Elab.DeclModifiers
import Lean.Elab.SyntheticMVars
import Lean.Elab.DeclarationRange
names... |
d2956f7b09994c61cf1a9b5974f7097df81c7f6a | b70447c014d9e71cf619ebc9f539b262c19c2e0b | /hott/types/equiv.hlean | 0af87c1241e06ae494745f262d040027b9eb89f8 | [
"Apache-2.0"
] | permissive | ia0/lean2 | c20d8da69657f94b1d161f9590a4c635f8dc87f3 | d86284da630acb78fa5dc3b0b106153c50ffccd0 | refs/heads/master | 1,611,399,322,751 | 1,495,751,007,000 | 1,495,751,007,000 | 93,104,167 | 0 | 0 | null | 1,496,355,488,000 | 1,496,355,487,000 | null | UTF-8 | Lean | false | false | 12,921 | 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
Ported from Coq HoTT
Theorems about the types equiv and is_equiv
-/
import .fiber .arrow arity ..prop_trunc cubical.square .pointed
open eq is_trunc sigma sigma.op... |
49fbd439ef746fcfdbff5ebd70eb65e10b5a9f55 | ce89339993655da64b6ccb555c837ce6c10f9ef4 | /zeptometer/topprover/16.lean | 7ac6871112a0aea3918e1d2a39f6ff80deeb3823 | [] | no_license | zeptometer/LearnLean | ef32dc36a22119f18d843f548d0bb42f907bff5d | bb84d5dbe521127ba134d4dbf9559b294a80b9f7 | refs/heads/master | 1,625,710,824,322 | 1,601,382,570,000 | 1,601,382,570,000 | 195,228,870 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 465 | lean | inductive gcd : ℕ → ℕ → ℕ → Prop
| gcd_0 : ∀ n, gcd n 0 n
| gcd_step : ∀ n m p, gcd m n p → gcd (n + m) n p
| gcd_swap : ∀ n m p, gcd m n p → gcd n m p
example : forall n, gcd n (n + 1) 1 := begin
intros n,
apply gcd.gcd_swap,
apply gcd.gcd_step,
induction n,
apply gcd.gcd_0,
apply gcd.gcd_swap... |
e04d3cbdeb959ae0efd7d89685c4c7676b7a125d | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/probability/conditional_probability.lean | 6fc49d21525362e0f6a1184f4ab753ce00789c1e | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 6,772 | lean | /-
Copyright (c) 2022 Rishikesh Vaishnav. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Rishikesh Vaishnav
-/
import measure_theory.measure.measure_space
/-!
# Conditional Probability
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a co... |
c5431a533272a2f5b9dbd42062e2966a27e2649c | 491068d2ad28831e7dade8d6dff871c3e49d9431 | /tests/lean/run/parity.lean | c5664ea347e9c6e24c17a74ac9a82d7e33dd01f2 | [
"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 | 676 | lean | import data.nat
open nat
namespace foo
inductive Parity : nat → Type :=
| even : ∀ n : nat, Parity (2 * n)
| odd : ∀ n : nat, Parity (2 * n + 1)
open Parity
definition parity : Π (n : nat), Parity n
| parity 0 := even 0
| parity (n+1) :=
begin
have aux : Parity n, from parity n,
cases aux with [k, k]... |
e6fad2c5f4f5e6f67311a98be7496b019e1460ca | 5c7fe6c4a9d4079b5457ffa5f061797d42a1cd65 | /src/exercises/src_07_existential_quantification.lean | fb2425f6ea7691e65cbf73cf65820da8527fd2c1 | [] | no_license | gihanmarasingha/mth1001_tutorial | 8e0817feeb96e7c1bb3bac49b63e3c9a3a329061 | bb277eebd5013766e1418365b91416b406275130 | refs/heads/master | 1,675,008,746,310 | 1,607,993,443,000 | 1,607,993,443,000 | 321,511,270 | 3 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,910 | lean | import tactic.linarith
namespace mth1001
section existential_quantification
/-
An integer `n` is `even` if there is some integer `m` such that `n = 2*m`. This condition is
expressed as
`∃ m, n = 2 * m`,
where the symbol `∃` is called 'the universal quantifier', read as 'there exists' or 'there is',
and typed as `... |
5a004cdc0ea90f78d0b996166c3ef1cd7ccbcb72 | df7bb3acd9623e489e95e85d0bc55590ab0bc393 | /lean/love03_forward_proofs_exercise_sheet.lean | 84f939941c7ecf83dc79109b01c63f01aec81311 | [] | no_license | MaschavanderMarel/logical_verification_2020 | a41c210b9237c56cb35f6cd399e3ac2fe42e775d | 7d562ef174cc6578ca6013f74db336480470b708 | refs/heads/master | 1,692,144,223,196 | 1,634,661,675,000 | 1,634,661,675,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,792 | lean | import .lovelib
/- # LoVe Exercise 3: Forward Proofs -/
set_option pp.beta true
set_option pp.generalized_field_notation false
namespace LoVe
/- ## Question 1: Connectives and Quantifiers
1.1. Supply structured proofs of the following lemmas. -/
lemma I (a : Prop) :
a → a :=
sorry
lemma K (a b : Prop) :
a... |
f0ce1a69aa63520ddac132224ab2d267508fb494 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Compiler/IR/EmitUtil.lean | e5d0b1087c6a9543360f06bd85d9c9b73c98bb4f | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 3,177 | 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.Compiler.InitAttr
import Lean.Compiler.IR.CompilerM
/-! # Helper functions for backend code generators -/
namespace Lean.IR
/-- Return true if... |
6ed57b3ee421eda6f072471138f114832837b4db | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/data/list/basic.lean | b1c895ff94181c9c036d4ac3c5d2bccf995661c9 | [
"Apache-2.0"
] | permissive | gebner/mathlib | eab0150cc4f79ec45d2016a8c21750244a2e7ff0 | cc6a6edc397c55118df62831e23bfbd6e6c6b4ab | refs/heads/master | 1,625,574,853,976 | 1,586,712,827,000 | 1,586,712,827,000 | 99,101,412 | 1 | 0 | Apache-2.0 | 1,586,716,389,000 | 1,501,667,958,000 | Lean | UTF-8 | Lean | false | false | 141,573 | 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
-/
import
tactic.interactive
logic.basic logic.function
algebra.group order.basic
data.li... |
3a8709a4b7fefe3c38b77110d065ea0b33bdcdd9 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/data/int/gcd.lean | a2077e651c53c9e5f3c5cbf8dcd3d94d2962e7ff | [
"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 | 26,464 | 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
import data.int.order
/-!
# Extended GCD and divisibility over ℤ
## Main definitions
* Given `x... |
5db4152fc8d4aa72f2ca8862e9e195cd967a70de | 9dd3f3912f7321eb58ee9aa8f21778ad6221f87c | /tests/lean/run/e16.lean | a92cc0a1bdf0d1221bd77c8610bfd9213907aaef | [
"Apache-2.0"
] | permissive | bre7k30/lean | de893411bcfa7b3c5572e61b9e1c52951b310aa4 | 5a924699d076dab1bd5af23a8f910b433e598d7a | refs/heads/master | 1,610,900,145,817 | 1,488,006,845,000 | 1,488,006,845,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 555 | lean | prelude
inductive nat : Type
| zero : nat
| succ : nat → nat
namespace nat end nat open nat
inductive {u} list (A : Type u) : Type u
| nil {} : list
| cons : A → list → list
namespace list end list open list
check nil
check nil.{0}
check @nil.{0} nat
check @nil nat
check cons zero nil
inductive {u} vector (A : Ty... |
6da33f9e637afb01eeaeadc7d86470cb67e059de | 2eab05920d6eeb06665e1a6df77b3157354316ad | /src/data/subtype.lean | be2fbfbe7887964e2e6ee695d23334468879d29d | [
"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 | 7,157 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
-/
import tactic.ext
import tactic.lint
import tactic.simps
/-!
# Subtypes
This file provides basic API for subtypes, which are defined in core.
A subtype is a type m... |
a353717c61d6f841b642e7e2d815ce7de3df6aed | 4727251e0cd73359b15b664c3170e5d754078599 | /src/order/filter/partial.lean | fd96d8812e96609075b86825f8fdc3b662d280d0 | [
"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 | 10,766 | lean | /-
Copyright (c) 2019 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
-/
import order.filter.basic
import data.pfun
/-!
# `tendsto` for relations and partial functions
This file generalizes `filter` definitions from functions to partial fu... |
809c0a3fcf0cd1858184a999211dad3fe9ef0ab8 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/category_theory/monoidal/preadditive.lean | 9e9e69a16954d458d8b94c616ef159adea7c82e2 | [
"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,859 | lean | /-
Copyright (c) 2021 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.preadditive.additive_functor
import category_theory.monoidal.category
/-!
# Preadditive monoidal categories
A monoidal category is `monoidal_... |
d64419f22d71dc50dc01e3ff149723f223a22102 | ae1e94c332e17c7dc7051ce976d5a9eebe7ab8a5 | /tests/compiler/lazylist.lean | 4c0df537d45d2411bfd21e5f93ee1c899b2ed772 | [
"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 | 3,909 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
universes u v w
inductive LazyList (α : Type u)
| nil : LazyList α
| cons (hd : α) (tl : LazyList α) : LazyList α
| delayed... |
59673724f7ef1ed9d8c084389397a322238f5c94 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebraic_topology/split_simplicial_object.lean | 718739e71a906f1fe4f8587cbc00349a00cc9b4b | [
"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 | 13,770 | lean | /-
Copyright (c) 2022 Joël Riou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Joël Riou
-/
import algebraic_topology.simplicial_object
import category_theory.limits.shapes.finite_products
/-!
# Split simplicial objects
In this file, we introduce the notion of spl... |
cad9d63171101775b362033585d772f8c8077b17 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/analysis/complex/cauchy_integral.lean | 18fe7a89179125cc2cee8c06daebdccfe8f67dba | [
"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 | 36,813 | lean | /-
Copyright (c) 2021 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import measure_theory.measure.complex_lebesgue
import measure_theory.integral.divergence_theorem
import measure_theory.integral.circle_integral
import analysis.calc... |
91a3d35215a7f5034b85361579a4ce18be0ab83b | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /src/Lean/Parser/Tactic.lean | 531dfb6b225e1b0b906e50b65c20b8579b0482ac | [
"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 | 1,250 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Sebastian Ullrich
-/
import Lean.Parser.Term
namespace Lean
namespace Parser
namespace Tactic
builtin_initialize
register_parser_alias "tacticSeq" tact... |
5114e15ea65aaa1276c98639132cf224ce4478b2 | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/tactic/lint.lean | cbf5403a2952dfc1d61255b6c1f0826c6884a14b | [
"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 | 24,957 | lean | /-
Copyright (c) 2019 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Robert Y. Lewis
-/
import tactic.core
/-!
# lint command
This file defines the following user commands to spot common mistakes in the code.
* `#lint`: check all dec... |
949796dd001d86c9622d59dabd42564e7c9aed97 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/concrete_category/unbundled_hom.lean | 22237c3b072b5296eeb21ef824da30d92dfb3f7e | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 2,302 | 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 category_theory.concrete_category.bundled_hom
/-!
# Category instances for structures that use unbundled homs
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> ... |
b8b3157391cb52c1bee092db76c675e66e9d3a94 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /src/Lean/Util/CollectMVars.lean | 58b1e107887217fe8934b03643253f5e6f494098 | [
"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,152 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Expr
namespace Lean
namespace CollectMVars
structure State where
visitedExpr : ExprSet := {}
result : Array MVarId := #[]
in... |
943cf942c785e07f532a7ba27a8f576dc4d17822 | 934eae675a9d997202bb021816325184e7d694aa | /_notes/Languages/lean/myproject/typeclass.lean | bf07c24a9a45dec91b4dff3f4d3fea0818e3fad3 | [] | no_license | philzook58/philzook58.github.io | da78841df4ffd9a19c81e0eab833983d95a64b70 | 76000a5847bd6ee41dff25937ae916835bbcf03f | refs/heads/master | 1,692,951,958,916 | 1,692,631,945,000 | 1,692,631,945,000 | 91,513,884 | 9 | 4 | null | 1,677,330,791,000 | 1,494,977,989,000 | Jupyter Notebook | UTF-8 | Lean | false | false | 1,629 | lean |
-- Use and abuse of instance parameters in the Lean mathematical library
-- https://arxiv.org/pdf/2202.01629.pdf
class GoodNum (n : Int) where
instance : GoodNum 3 where
instance : GoodNum 4 where
#check (inferInstance : GoodNum 4)
-- set_option in
--variable (mylist : Type)
def mylist := Type
--variable (cons : ... |
947d191edd6c004cc3783895fdb58047d7e00372 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/monoidal/rigid/basic.lean | 60a4001ff3ccc8d6a53691050b9a928d0cc41ffe | [
"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 | 28,240 | lean | /-
Copyright (c) 2021 Jakob von Raumer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jakob von Raumer
-/
import category_theory.monoidal.coherence_lemmas
import category_theory.closed.monoidal
import tactic.apply_fun
/-!
# Rigid (autonomous) monoidal categories
> T... |
f9da18e11a85b56aeff8e694b92fc81448bcff42 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/notation2.lean | b9a1d2593c468d023a561bec467ff7e60b4df841 | [
"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 | 323 | lean | --
inductive List (T : Type) : Type
| nil {} : List
| cons : T → List → List
open List
notation (name := cons2) h :: t := cons h t
notation (name := list2) `[` l:(foldr `,` (h t, cons h t) nil) `]` := l
infixr (name := cons) `::` := cons
#check (1:nat) :: 2 :: nil
#check (1:nat) :: 2 :: 3 :: 4 :: 5 :: nil
#print ]
|
641156a215981b2d36764a94d9dd63de375041a0 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/tactic11.lean | 9aa53a80b26b9d41c123148a367bd50485577e66 | [
"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 | 517 | lean | import logic
theorem tst (a b : Prop) (H : a ↔ b) : b ↔ a
:= have H1 : a → b, -- We need to mark H1 as fact, otherwise it is not visible by tactics
from iff.elim_left H,
by apply iff.intro;
intro Hb;
apply (iff.elim_right H Hb);
intro Ha;
apply (H1 Ha)
theorem tst2 (a b : Prop) (H : ... |
2167a483c62eefa18e432b9d322d65e09782ca72 | 432d948a4d3d242fdfb44b81c9e1b1baacd58617 | /src/linear_algebra/free_module.lean | bd78f69c81d1204570007ddcbad89a0742b8f5ed | [
"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 | 17,039 | lean | /-
Copyright (c) 2020 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen
-/
import linear_algebra.basis
import linear_algebra.finsupp_vector_space
import ring_theory.principal_ideal_domain
import ring_theory.finiteness
/-! # Free modules
A free `... |
09e305b60953a23e53bf54b19f4a59eedd495c3b | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/data/vector2.lean | 4e8906ae91225a41e12c61bfa337a21bc5ea8452 | [
"Apache-2.0"
] | permissive | gebner/mathlib | eab0150cc4f79ec45d2016a8c21750244a2e7ff0 | cc6a6edc397c55118df62831e23bfbd6e6c6b4ab | refs/heads/master | 1,625,574,853,976 | 1,586,712,827,000 | 1,586,712,827,000 | 99,101,412 | 1 | 0 | Apache-2.0 | 1,586,716,389,000 | 1,501,667,958,000 | Lean | UTF-8 | Lean | false | false | 10,289 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
Additional theorems about the `vector` type.
-/
import data.vector data.list.nodup data.list.of_fn
import category.traversable.basic data.set.basic tactic.tauto
univer... |
7a655bdcda5be22adfd4f76920e829641bb8aef5 | 4950bf76e5ae40ba9f8491647d0b6f228ddce173 | /src/data/set/basic.lean | 4267eb8310719ff4b4c9c13e39b12fa52ce10403 | [
"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 | 93,597 | 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... |
f0d2995125cc142419e2e19b01c1535d6439b618 | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/linear_algebra/determinant.lean | d875e938de4456998e2e2e448193ddfc8b7116b3 | [
"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 | 4,663 | 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
-/
import data.matrix.basic
import group_theory.perm.sign
universes u v
open equiv equiv.perm finset function
namespace matrix
variables {n : Type u} [fintype n] ... |
e0b9d54a2443df8280aae540ccf33b4c0008546f | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/polynomial/identities_auto.lean | 750257fc346642544794f8c289be2b514f849f39 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,622 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.polynomial.derivative
import Mathlib.PostP... |
7c4f06c8a9ab097c8cb8dc209d68b7758eb454c7 | 205f0fc16279a69ea36e9fd158e3a97b06834ce2 | /src/07_Negation/in-class-quiz.lean | ba3b2cf3ae5cafe1524b8ddf55dcc8927fb9fed3 | [] | no_license | kevinsullivan/cs-dm-lean | b21d3ca1a9b2a0751ba13fcb4e7b258010a5d124 | a06a94e98be77170ca1df486c8189338b16cf6c6 | refs/heads/master | 1,585,948,743,595 | 1,544,339,346,000 | 1,544,339,346,000 | 155,570,767 | 1 | 3 | null | 1,541,540,372,000 | 1,540,995,993,000 | Lean | UTF-8 | Lean | false | false | 1,875 | lean | /-
This in-class exercise requires solutions to two problems
-/
/-
PROBLEM #1.
In Lean, define pf1 to be a proof of the proposition
that, "for any proposition, Q, (Q ∧ ¬ Q) → false.
Here is a start on an answer. We use λ to
introduce the assumption that Q is some proposition.
The underscore is what you have to f... |
713c92d9a9b654a6420a11ba04ec504058e4d6a4 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/int/div.lean | 3a93b34352da62477fce325605f21b4925781e38 | [
"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 | 1,820 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
-/
import data.int.dvd.basic
import data.nat.order.lemmas
import algebra.ring.regular
/-!
# Lemmas relating `/` in `ℤ` with the ordering.
-/
open nat
namespace int
the... |
dbbcd3a6415079f7a8fc09cc494e3cb591509106 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/topology/dense_embedding.lean | a57dde88d904dd5d4642b66c9ad86c92d70ba557 | [
"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 | 12,912 | lean | /-
Copyright (c) 2019 Reid Barton. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro, Patrick Massot
-/
import topology.separation
import topology.bases
/-!
# Dense embeddings
This file defines three properties of functions:
* `dense_rang... |
310cb2f6980d82db25b4020242703f961b1ea22b | 5ae26df177f810c5006841e9c73dc56e01b978d7 | /src/category_theory/adjunction/limits.lean | 3421e92e79d0e1d52a7e7b1cf96f4abab7f5f329 | [
"Apache-2.0"
] | permissive | ChrisHughes24/mathlib | 98322577c460bc6b1fe5c21f42ce33ad1c3e5558 | a2a867e827c2a6702beb9efc2b9282bd801d5f9a | refs/heads/master | 1,583,848,251,477 | 1,565,164,247,000 | 1,565,164,247,000 | 129,409,993 | 0 | 1 | Apache-2.0 | 1,565,164,817,000 | 1,523,628,059,000 | Lean | UTF-8 | Lean | false | false | 5,535 | lean | /-
Copyright (c) 2019 Reid Barton. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Reid Barton, Johan Commelin
-/
import category_theory.adjunction.basic
import category_theory.limits.preserves
open opposite
namespace category_theory.adjunction
open category_theory
op... |
bf52de57e056f1e8773ec72bf3f6734d85cc34a9 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/check.lean | 092c1427e851ac6aaa02def7a5dd579a024c69cc | [
"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 | 60 | lean | --
#check and.intro
#check or.elim
#check eq
#check eq.rec
|
ddaf5b3101016fb808d8d76b2319d1e8b6e6ed93 | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/data/polynomial/ring_division.lean | f5c1fb1dec489f958ee9a243409393b3a4f23cd5 | [
"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 | 27,881 | 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, Johan Commelin
-/
import data.polynomial.algebra_map
import data.polynomial.degree.lemmas
import data.polynomial.div
/-!
# ... |
dcf7c7cfd817bb3099baed25a88d062c7b4decc5 | 9028d228ac200bbefe3a711342514dd4e4458bff | /src/tactic/omega/coeffs.lean | 1aa233e78a758e78df528dfb03b9ebeb5614a742 | [
"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 | 10,610 | lean | /-
Copyright (c) 2019 Seul Baek. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Seul Baek
-/
/-
Non-constant terms of linear constraints are represented
by storing their coefficients in integer lists.
-/
import data.list.func
import tactic.ring
import tactic.omega.mis... |
ad1a4e9c7c512dece311dafb0d3ce7f7f30ef137 | a4673261e60b025e2c8c825dfa4ab9108246c32e | /stage0/src/Lean/Elab/Syntax.lean | 6a294dfd35ba5c3ebe3cea258d6f08e53ef86a17 | [
"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,972 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Elab.Command
import Lean.Elab.Quotation
namespace Lean.Elab.Term
/-
Expand `optional «precedence»` where
«precedence» := parser! " : " >> prec... |
bd9fc1140401070e59095be839fff19c8f6824e4 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/algebraic_topology/dold_kan/notations.lean | 67fda8f17e311e498f950cfe0656c7dd9ab5a815 | [
"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 | 891 | lean | /-
Copyright (c) 2022 Joël Riou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Joël Riou
-/
import algebraic_topology.alternating_face_map_complex
/-!
# Notations for the Dold-Kan equivalence
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file re... |
9945275ae490623434381a034018e6d73fe28480 | e953c38599905267210b87fb5d82dcc3e52a4214 | /library/data/finset/comb.lean | afce8c5f1eb0ca57291e8a8c06558147c14f37f5 | [
"Apache-2.0"
] | permissive | c-cube/lean | 563c1020bff98441c4f8ba60111fef6f6b46e31b | 0fb52a9a139f720be418dafac35104468e293b66 | refs/heads/master | 1,610,753,294,113 | 1,440,451,356,000 | 1,440,499,588,000 | 41,748,334 | 0 | 0 | null | 1,441,122,656,000 | 1,441,122,656,000 | null | UTF-8 | Lean | false | false | 17,807 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura, Jeremy Avigad
Combinators for finite sets.
-/
import data.finset.basic logic.identities
open list quot subtype decidable perm function
namespace finset
/- i... |
ebefd61e71be8e9a3bf64e45f614c80fcd0e6d60 | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/data/multiset/interval.lean | 0171872d6b22b0de76a27e9e241d9a6e8869fc15 | [
"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 | 2,807 | lean | /-
Copyright (c) 2021 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies
-/
import data.finset.interval
/-!
# Intervals as multisets
This file provides basic results about all the `multiset.Ixx`, which are defined in
`order.locally_finite`.
##... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.