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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
127c4e93b8a12effdeb13559e352ccd21f27d500 | a4673261e60b025e2c8c825dfa4ab9108246c32e | /src/Std/Data/RBMap.lean | 571c2bd8747f320b4c7fbcee8a72967f3454c795 | [
"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 | 12,644 | 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
-/
namespace Std
universes u v w w'
inductive Rbcolor :=
| red | black
inductive RBNode (α : Type u) (β : α → Type v) :=
| leaf ... |
fb4e4235d765ea7fa68a0aefa08c7691c31efe7a | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/data/sigma/order.lean | bf30be59b47ed640a9c8766b96b24677fbc1c54a | [
"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,632 | 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.sigma.lex
import order.bounded_order
import order.lexicographic
/-!
# Orders on a sigma type
This file defines two orders on a sigma type:
* The disjoint su... |
18e1a17d99e91745ec43e74d0da6123086d56600 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/linear_algebra/free_module/basic.lean | 705aebe40706117baedee2bbcd18c58b3cb1a06c | [
"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 | 5,945 | lean | /-
Copyright (c) 2021 Riccardo Brasca. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Riccardo Brasca
-/
import linear_algebra.direct_sum.finsupp
import logic.small
import linear_algebra.std_basis
/-!
# Free modules
We introduce a class `module.free R M`, for `R` a... |
5be7f93dd0d5447e18549b4b689d43dde0acc4c8 | ac2987d8c7832fb4a87edb6bee26141facbb6fa0 | /Mathlib/Tactic/OpenPrivate.lean | 9e2aa5e5e83827f53ed003ad3c2ee70ac2f96dff | [
"Apache-2.0"
] | permissive | AurelienSaue/mathlib4 | 52204b9bd9d207c922fe0cf3397166728bb6c2e2 | 84271fe0875bafdaa88ac41f1b5a7c18151bd0d5 | refs/heads/master | 1,689,156,096,545 | 1,629,378,840,000 | 1,629,378,840,000 | 389,648,603 | 0 | 0 | Apache-2.0 | 1,627,307,284,000 | 1,627,307,284,000 | null | UTF-8 | Lean | false | false | 4,734 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
-/
import Lean.Elab.Command
import Lean.Util.FoldConsts
open Lean Parser.Tactic Elab Command
namespace Lean
def Meta.collectPrivateIn [Monad m] [MonadEnv m] [Mo... |
a677852b52925f12cf9efa63f9fc8177f049ed84 | b32d3853770e6eaf06817a1b8c52064baaed0ef1 | /src/super/prover.lean | 80d17b0bd46d451fe7f59c0040ca236e6125905a | [] | no_license | gebner/super2 | 4d58b7477b6f7d945d5d866502982466db33ab0b | 9bc5256c31750021ab97d6b59b7387773e54b384 | refs/heads/master | 1,635,021,682,021 | 1,634,886,326,000 | 1,634,886,326,000 | 225,600,688 | 4 | 2 | null | 1,598,209,306,000 | 1,575,371,550,000 | Lean | UTF-8 | Lean | false | false | 7,653 | lean | import super.prover_state super.selection
super.inferences.distinct super.inferences.resolution
super.inferences.clausify super.inferences.empty_clause
super.inferences.subsumption super.inferences.superposition
super.inferences.factoring super.inferences.inhabited
super.inferences.demod
super.eqn_lemmas
n... |
213fbf26ef78fb8efb04e8289503817efddc43f6 | 0845ae2ca02071debcfd4ac24be871236c01784f | /library/init/control/conditional.lean | 206cdad08f8e85529a744459bc59b94dc96de93e | [
"Apache-2.0"
] | permissive | GaloisInc/lean4 | 74c267eb0e900bfaa23df8de86039483ecbd60b7 | 228ddd5fdcd98dd4e9c009f425284e86917938aa | refs/heads/master | 1,643,131,356,301 | 1,562,715,572,000 | 1,562,715,572,000 | 192,390,898 | 0 | 0 | null | 1,560,792,750,000 | 1,560,792,749,000 | null | UTF-8 | Lean | false | false | 1,077 | 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.control.monad init.data.option.basic
universes u v
class HasToBool (α : Type u) :=
(toBool : α → Bool)
export HasToBool (toBool)
insta... |
5c7630745625444e9fba9b406bfb26a7161af867 | 8eeb99d0fdf8125f5d39a0ce8631653f588ee817 | /src/data/equiv/ring.lean | 7b4b91ad819ceb00402b4d30b32b8c51e04ecc29 | [
"Apache-2.0"
] | permissive | jesse-michael-han/mathlib | a15c58378846011b003669354cbab7062b893cfe | fa6312e4dc971985e6b7708d99a5bc3062485c89 | refs/heads/master | 1,625,200,760,912 | 1,602,081,753,000 | 1,602,081,753,000 | 181,787,230 | 0 | 0 | null | 1,555,460,682,000 | 1,555,460,682,000 | null | UTF-8 | Lean | false | false | 12,055 | 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 data.equiv.mul_add
import algebra.field
import algebra.opposites
/-!
# (Semi)ring equivs
In this file we define extension of ... |
b0404b47f0bca761c4829bbda884c00b3318b0c4 | 38bf3fd2bb651ab70511408fcf70e2029e2ba310 | /src/linear_algebra/finsupp.lean | a5b054ded5d5356397a305588b3dc3a88fe02f63 | [
"Apache-2.0"
] | permissive | JaredCorduan/mathlib | 130392594844f15dad65a9308c242551bae6cd2e | d5de80376088954d592a59326c14404f538050a1 | refs/heads/master | 1,595,862,206,333 | 1,570,816,457,000 | 1,570,816,457,000 | 209,134,499 | 0 | 0 | Apache-2.0 | 1,568,746,811,000 | 1,568,746,811,000 | null | UTF-8 | Lean | false | false | 15,713 | 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.finsupp linear_algebra.basic
noncomputable theory
local attribute [instance, priority 10] cla... |
ea99a17423546e2ad822ec47c3b523d5f9ecf72c | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/polynomial/cancel_leads.lean | e3c969d48bda85f4c913d4e97cccc2e89b3fc4eb | [] | 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 | 2,079 | lean | /-
Copyright (c) 2020 Aaron Anderson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.polynomial.degree.definitions
import Mathlib.PostPort
universes u_1
namespace Mathl... |
330e421d8bd0aeefcd10406376c6f922d48a3952 | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /src/Lean/Elab/Deriving/BEq.lean | 58105bb064cf501e13c423d5fcb6959dfa1bda72 | [
"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 | 4,448 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Meta.Transform
import Lean.Elab.Deriving.Basic
import Lean.Elab.Deriving.Util
namespace Lean.Elab.Deriving.BEq
open Lean.Parser.Term
open Meta
... |
ec7b77673f634cc899abcf87ecbded1bb3436822 | 02fbe05a45fda5abde7583464416db4366eedfbf | /library/init/algebra/classes.lean | 378cca49f35e518a915e77c1fd0eb90e2a830e4c | [
"Apache-2.0"
] | permissive | jasonrute/lean | cc12807e11f9ac6b01b8951a8bfb9c2eb35a0154 | 4be962c167ca442a0ec5e84472d7ff9f5302788f | refs/heads/master | 1,672,036,664,637 | 1,601,642,826,000 | 1,601,642,826,000 | 260,777,966 | 0 | 0 | Apache-2.0 | 1,588,454,819,000 | 1,588,454,818,000 | null | UTF-8 | Lean | false | false | 13,152 | 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.logic init.data.ordering.basic
universes u v
@[algebra] class is_symm_op (α : Type u) (β : out_param (Type v)) (op : α → α → β) : Prop ... |
adb0aea5443f1c7f16dca72bedb0541060f0d172 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/algebra/ordered_ring.lean | 26c0f43dd94ceae521f376a9e8234f06096cce39 | [
"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 | 43,960 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Mario Carneiro
-/
import algebra.ordered_group
set_option old_structure_cmd true
universe u
variable {α : Type u}
/-- An `ordered_semiring α` is a s... |
391ed863f0124143daea1c6c61410c06b069c808 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/monoidal/internal/functor_category.lean | 8e39949a504efc9c6a072a6e8533f0e46f690dda | [
"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,243 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.monoidal.CommMon_
import category_theory.monoidal.functor_category
/-!
# `Mon_ (C ⥤ D) ≌ C ⥤ Mon_ D`
> THIS FILE IS SYNCHRONIZED WITH MATHLIB... |
d84f7a28ef22c7cdb583275405f7fead77af15bc | 968e2f50b755d3048175f176376eff7139e9df70 | /examples/prop_logic_theory/unnamed_2204.lean | 3c36b1f02a4cfe422716dce35986134e92ed96a5 | [] | no_license | gihanmarasingha/mth1001_sphinx | 190a003269ba5e54717b448302a27ca26e31d491 | 05126586cbf5786e521be1ea2ef5b4ba3c44e74a | refs/heads/master | 1,672,913,933,677 | 1,604,516,583,000 | 1,604,516,583,000 | 309,245,750 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 847 | lean | variables {p q : Prop}
-- BEGIN
theorem not_or_of_not_and_not : ¬p ∧ ¬q → ¬(p ∨ q) :=
begin
assume h₁ : ¬p ∧ ¬q, -- Assume `h₁ : ¬p ∧ ¬q`. By implication introduction, it suffices to prove `¬(p ∨ q)`.
cases h₁ with h₃ h₄, -- We have `h₃ : ¬p` and `h₄ : ¬q` by left and right `∧` elim. on `h₁`.
assume h₅ : p ∨ q, ... |
d431a2dbb14026f032ddb4f50d3528810b440ae8 | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/ring_theory/ideal/basic.lean | 6aa9e1cb02cdbd79e8dc019de89ceea7cd33dc63 | [
"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 | 30,528 | 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 linear_algebra.quotient
import order.zorn
import order.atoms
import order.compactly_generated
/-!
# Ideals over ... |
5df7c861dc4be171e98fc4d19dcdf1e223237e5a | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/data/polynomial/degree/lemmas.lean | ff2759e8da78d499778455f1e183c15a15f91613 | [
"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 | 8,686 | 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 data.polynomial.eval
import tactic.interval_cases
/-!
# Theory of degrees of polynomials
Some of the main results... |
3674b7b7c5d58112210d5a9f408164972d0b11c5 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/category/Mon/colimits.lean | b1bbcb32c2f8daa8e03747e0c01cb3a27cc34b4f | [
"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,654 | 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 algebra.category.Mon.basic
import category_theory.limits.has_limits
import category_theory.concrete_category.elementwise
/-!
# The category of monoids has all... |
e942e7d771681f6360607af2bab94578e37830d5 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/topology/metric_space/gromov_hausdorff.lean | f26cca3205147887c05d64a28a70f01fdc9b5a02 | [
"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 | 55,705 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Sébastien Gouëzel
-/
import topology.metric_space.closeds
import set_theory.cardinal
import topology.metric_space.gromov_hausdorff_realized
import topology.metric_space.completion
/... |
75d57372cbe618e5ed421b2c44e6076f0045360c | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/topology/fiber_bundle/trivialization.lean | fcde8b14a33e42b363e7a0a83baa80929977aefc | [
"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 | 31,422 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import data.bundle
import topology.algebra.order.field
import topology.local_homeomorph
/-!
# Trivializations
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any... |
cbc53d9e2764388b363afdfdadb61d2783197b85 | 1abd1ed12aa68b375cdef28959f39531c6e95b84 | /src/data/list/permutation.lean | 1221305360e015b1b14a4a4a662bf9cfc1f8b691 | [
"Apache-2.0"
] | permissive | jumpy4/mathlib | d3829e75173012833e9f15ac16e481e17596de0f | af36f1a35f279f0e5b3c2a77647c6bf2cfd51a13 | refs/heads/master | 1,693,508,842,818 | 1,636,203,271,000 | 1,636,203,271,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,846 | 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 data.list.basic
/-!
# Permutations of a list
In this file we prove properties about `... |
8e14758014f4324e4b0240e900c6e811c798aad9 | 08bd4ba4ca87dba1f09d2c96a26f5d65da81f4b4 | /src/Lean/Elab/Tactic/Location.lean | 51bd35d2b4b5ec79c8c3befb93763d0202cfb3d5 | [
"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 | 2,222 | 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.Tactic.Basic
import Lean.Elab.Tactic.ElabTerm
namespace Lean.Elab.Tactic
/-- Denotes a set of locations where a tactic should be applied ... |
6bc38ffa10b05fa52375a75320f669097a518a68 | 367134ba5a65885e863bdc4507601606690974c1 | /src/topology/uniform_space/uniform_convergence.lean | b6ff3e3d303a7ee3e4e018a203e4af7955b4d2da | [
"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 | 16,649 | lean | /-
Copyright (c) 2020 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import topology.uniform_space.basic
/-!
# Uniform convergence
A sequence of functions `Fₙ` (with values in a metric space) converges uniformly on a set `s` to... |
b76c38ea4794b7a809636b8a7fb485fb8d3c83e1 | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /08_Building_Theories_and_Proofs.org.14.lean | 0bb51519ad8b88812a13764ec7d2b48222eed189 | [] | no_license | cjmazey/lean-tutorial | ba559a49f82aa6c5848b9bf17b7389bf7f4ba645 | 381f61c9fcac56d01d959ae0fa6e376f2c4e3b34 | refs/heads/master | 1,610,286,098,832 | 1,447,124,923,000 | 1,447,124,923,000 | 43,082,433 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 804 | lean | import standard
namespace hide
variables {A : Type} (R : A → A → Prop)
definition reflexive : Prop := ∀ (a : A), R a a
definition symmetric : Prop := ∀ ⦃a b : A⦄, R a b → R b a
definition transitive : Prop := ∀ ⦃a b c : A⦄, R a b → R b c → R a c
definition euclidean : Prop := ∀ ⦃a b c : A⦄, R a b → R a c → R b c
v... |
02a20d29cf886e0674037b4e0735f1502fe2e26d | 4f643cce24b2d005aeeb5004c2316a8d6cc7f3b1 | /src/for_mathlib/filter_decides.lean | 81b4897389168ba2e5dfafb4239cfdf86b933aa3 | [] | no_license | rwbarton/lean-omin | da209ed061d64db65a8f7f71f198064986f30eb9 | fd733c6d95ef6f4743aae97de5e15df79877c00e | refs/heads/master | 1,674,408,673,325 | 1,607,343,535,000 | 1,607,343,535,000 | 285,150,399 | 9 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,858 | lean | import order.filter
import for_mathlib.boolean_subalgebra
/-
We say a filter F *decides* a set S if either S or Sᶜ belongs to F.
The sets decided by a filter form a boolean subalgebra.
For a fixed boolean subalgebra A, an *ultrafilter on A*
is a filter which decides every member of A.
To check that a filter F is an ul... |
57da5802c2001117199d438797e115425ada184a | bdb33f8b7ea65f7705fc342a178508e2722eb851 | /data/sigma/basic.lean | 209d7e533b7ca43c0306d03618cbb6616ab6e3e1 | [
"Apache-2.0"
] | permissive | rwbarton/mathlib | 939ae09bf8d6eb1331fc2f7e067d39567e10e33d | c13c5ea701bb1eec057e0a242d9f480a079105e9 | refs/heads/master | 1,584,015,335,862 | 1,524,142,167,000 | 1,524,142,167,000 | 130,614,171 | 0 | 0 | Apache-2.0 | 1,548,902,667,000 | 1,524,437,371,000 | Lean | UTF-8 | Lean | false | false | 4,042 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Johannes Hölzl
-/
section sigma
variables {α : Type*} {β : α → Type*}
instance [inhabited α] [inhabited (β (default α))] : inhabited (sigma β) :=
⟨⟨default α, default (β (default α))⟩... |
dc3d928a0eb96986c9392e87faa07eaf07a98494 | a2ee6a66690e8da666951cac0c243d42db11f9f3 | /src/algebra/continued_fractions/computation/approximations.lean | a3b38bd994c1294cfb2c87f9484806021367f2cc | [
"Apache-2.0"
] | permissive | shyamalschandra/mathlib | 6d414d7c334bf383e764336843f065bd14c44273 | ca679acad147870b2c5087d90fe3550f107dea49 | refs/heads/master | 1,671,730,354,335 | 1,601,883,576,000 | 1,601,883,576,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 14,642 | lean | /-
Copyright (c) 2020 Kevin Kappelmann. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Kappelmann
-/
import algebra.continued_fractions.computation.translations
import algebra.continued_fractions.continuants_recurrence
import algebra.continued_fractions.terminate... |
260ede93d706dcd5b5d127134e30dc4fd58532a0 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/defeq_simp_lemmas1.lean | 1fda928e18a64dc94fb96d6465bdbfd68d915347 | [
"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 | 537 | lean | namespace foo
universe l
constants (A : Type.{l})
definition q (x : A) := x
definition h (x : A) : A := q x
definition g (x y : A) := h y
definition f (x y z : A) := g (g x y) z
definition d (x y z w : A) := f (f x y z) (f y z w) (f x w z)
definition h.def [defeq] (x : A) : h x = q x := rfl
definition g.def [defeq] (... |
957deda9562bf549c8f4adbd4dbce81d9145deb7 | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /library/tools/fake_simplifier.lean | 2d01a65c3afc5b1fa3a44681c33a34dc3832d7d9 | [
"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 | 158 | lean | import .tactic
open tactic
namespace fake_simplifier
-- until we have the simplifier...
opaque definition simp : tactic := apply sorry
end fake_simplifier
|
e0e040647b91c506e642ae0707c438103bb7835b | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /archive/100-theorems-list/73_ascending_descending_sequences.lean | cf9e834ddcd461ac0fb3f0604e42a51e4fdf45fa | [
"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,136 | lean | /-
Copyright (c) 2020 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta
-/
import tactic.basic
import data.fintype.basic
/-!
# Erdős–Szekeres theorem
This file proves Theorem 73 from the [100 Theorems List](https://www.cs.ru.nl/~freek/100/), a... |
2fc5bfb129199793482ab49a733b7b2197d2516d | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/data/real/cardinality.lean | 316ee34160c3da0abc1cf8c09b01971e9ce6be62 | [
"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,894 | 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
The cardinality of the reals.
-/
import data.real.basic set_theory.ordinal analysis.specific_limits data.rat.denumerable
open nat set
noncomputable theory
namespa... |
4a9d06695ea29211fd748a161cf3d25bbadc273d | 6e9cd8d58e550c481a3b45806bd34a3514c6b3e0 | /src/group_theory/order_of_element.lean | 561ea9d318a3fa5ecd6e54f455139f033dad2897 | [
"Apache-2.0"
] | permissive | sflicht/mathlib | 220fd16e463928110e7b0a50bbed7b731979407f | 1b2048d7195314a7e34e06770948ee00f0ac3545 | refs/heads/master | 1,665,934,056,043 | 1,591,373,803,000 | 1,591,373,803,000 | 269,815,267 | 0 | 0 | Apache-2.0 | 1,591,402,068,000 | 1,591,402,067,000 | null | UTF-8 | Lean | false | false | 24,258 | 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
-/
import group_theory.coset
import data.nat.totient
import data.set.finite
open function
variables {α : Type*} {s : set α} {a a₁ a₂ b c: α}
-- TODO this lemma isn't u... |
9a1ce5cd0e913cb0d9b0c00317c129546171b5fa | 4727251e0cd73359b15b664c3170e5d754078599 | /src/data/sum/basic.lean | 5bcda17b5f4ed88fe3217d4730485545118545cd | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 14,802 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Yury G. Kudryashov
-/
import data.option.basic
/-!
# Disjoint union of types
This file proves basic results about the sum type `α ⊕ β`.
`α ⊕ β` is the type made of a... |
e992003b526f45e24d7835e2334331dcb13ee9ee | 94e33a31faa76775069b071adea97e86e218a8ee | /src/group_theory/submonoid/operations.lean | 6516c992520255cd354c20483b3242ec1ae613ae | [
"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 | 44,942 | lean | /-
Copyright (c) 2018 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Kenny Lau, Johan Commelin, Mario Carneiro, Kevin Buzzard,
Amelia Livingston, Yury Kudryashov
-/
import group_theory.group_action.defs
import group_theory.submonoid.basi... |
337a33fbad89a832d88985e511befe311ab37fcb | 2b2a05a7af89c79da194505bf88205a6c4e05d68 | /src/game/world_03_multiplication.lean | ba48ffba62ec2e128ec0689f0ce3390ef8343f42 | [] | no_license | lacrosse/natural_number_game | 6401a11a8c965da3903ae6695f84586edf6fac85 | 400179cde1d3fcc9744901dabff98813ba2b544f | refs/heads/master | 1,677,566,006,582 | 1,612,576,917,000 | 1,612,576,917,000 | 335,655,947 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,679 | lean | import game.world_02_addition
namespace mynat
lemma zero_mul (m : mynat) : 0 * m = 0 := begin[nat_num_game]
induction m,
rwa mul_zero,
end
lemma mul_one (m : mynat) : m * 1 = m := begin[nat_num_game]
induction m,
rwa zero_mul,
rwa [one_eq_succ_zero, mul_succ, mul_zero, zero_add],
end
lemma one_mul (m : myn... |
8610d1b44bde804b39ec341f0215c968d278ef5a | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/algebra/punit_instances.lean | 4428aa177d370c6ad6d7846ffe7dd303d8e0362b | [
"Apache-2.0"
] | permissive | dupuisf/mathlib | 62de4ec6544bf3b79086afd27b6529acfaf2c1bb | 8582b06b0a5d06c33ee07d0bdf7c646cae22cf36 | refs/heads/master | 1,669,494,854,016 | 1,595,692,409,000 | 1,595,692,409,000 | 272,046,630 | 0 | 0 | Apache-2.0 | 1,592,066,143,000 | 1,592,066,142,000 | null | UTF-8 | Lean | false | false | 2,607 | lean | /-
Copyright (c) 2019 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
Instances on punit.
-/
import algebra.module.basic
universes u
namespace punit
variables (x y : punit.{u+1}) (s : set punit.{u+1})
@[to_additive add_comm_group]
instance : com... |
ce581d1298358ebc0c5170b4378d7cbea1b2d007 | 86f6f4f8d827a196a32bfc646234b73328aeb306 | /examples/logic/unnamed_1291.lean | ac1a24d297670ecd4b9f3fbb21e45ce75005ad16 | [] | 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 | 145 | lean | import tactic
open_locale classical
variable (Q : Prop)
-- BEGIN
example (h : ¬ ¬ Q) : Q :=
sorry
example (h : Q) : ¬ ¬ Q :=
sorry
-- END |
c68b5229982eb1f5a630ef770e0473f7b2fc0016 | 78269ad0b3c342b20786f60690708b6e328132b0 | /src/library_dev/topology/uniform_space.lean | 9f771c378a7e94569f246542e929f3ed3d33da0d | [] | no_license | dselsam/library_dev | e74f46010fee9c7b66eaa704654cad0fcd2eefca | 1b4e34e7fb067ea5211714d6d3ecef5132fc8218 | refs/heads/master | 1,610,372,841,675 | 1,497,014,421,000 | 1,497,014,421,000 | 86,526,137 | 0 | 0 | null | 1,490,752,133,000 | 1,490,752,132,000 | null | UTF-8 | Lean | false | false | 52,374 | 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 uniform spaces.
-/
import ..algebra.lattice.filter .topological_space .continuity
open set lattice filter
set_option eqn_compiler.zeta true
attribute [trans... |
52f675857b4fdd7a08cccc7dd922f4b33512c829 | aa44b2a5876642f9460205af61a5449b74465655 | /src/special_functions.lean | bb89982f23904ff17a9442cc28aa3f3a8d80e500 | [] | no_license | robertylewis/mathematica_examples | d129d67de147dc2792dcf0b6b70fac9b2eaf8274 | e317381c49db032accef2a92e7650d029952ad76 | refs/heads/master | 1,632,630,516,240 | 1,631,905,726,000 | 1,631,905,726,000 | 80,952,455 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,847 | lean | /-
Copyright (c) 2017 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Robert Y. Lewis
-/
import mathematica
import analysis.calculus.deriv
open tactic
/-!
This demo shows how we can axiomatically accept results from Mathematica.
Bessel functions <https... |
710e74892e8c93027e531728644f9b35baa58300 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/extra/rec2.lean | ff1f20c5e9d44eb2a8f1cb2b9860c366963b0471 | [
"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 | 129 | lean | set_option pp.implicit true
set_option pp.notation false
definition ideq : Π {A : Type} {a b : A}, a = b → a = b,
ideq H := H
|
215c586e8de614e45117f2dab0ca4e683d1f99c9 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/nat_bug.lean | 2a7f560631c284cfe95de7349f9a2ab52c1ae149 | [
"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 | 798 | lean | open decidable
namespace experiment
inductive nat : Type
| zero : nat
| succ : nat → nat
definition refl := @eq.refl
namespace nat
definition pred (n : nat) : nat := nat.rec zero (fun m x, m) n
theorem pred_zero : pred zero = zero := refl _
theorem pred_succ (n : nat) : pred (succ n) = n := refl _
theorem zero_or_suc... |
64097ce0cea9b957df05a08f623e26c1625d5e3f | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/data/nat/periodic.lean | 1adf5012fd993d58cd578f839cf13a9a1299fd00 | [
"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 | 2,165 | lean | /-
Copyright (c) 2021 Bolton Bailey. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bolton Bailey
-/
import algebra.periodic
import data.nat.count
import data.nat.interval
/-!
# Periodic Functions on ℕ
This file identifies a few functions on `ℕ` which are periodic, a... |
0e3f5cf7b32b413b476f1927bd797559fda0c8b4 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/geometry/manifold/charted_space.lean | b6087b9922aadd3bc27c8fa9de2630ee31bac343 | [
"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 | 46,839 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import topology.local_homeomorph
/-!
# Charted spaces
A smooth manifold is a topological space `M` locally modelled on a euclidean space (or a euclidean
half-... |
b31169b7e21e4fa1eef60b3eb41dbec828af3a3f | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /archive/imo/imo1977_q6.lean | d25483e0e534066f6023257b358574f8f3d5f906 | [
"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,387 | lean | /-
Copyright (c) 2021 Tian Chen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Tian Chen
-/
import data.pnat.basic
/-!
# IMO 1977 Q6
Suppose `f : ℕ+ → ℕ+` satisfies `f(f(n)) < f(n + 1)` for all `n`.
Prove that `f(n) = n` for all `n`.
We first prove the problem stat... |
36e7be4ff62974b1674be765720d4b8eb7dc3ef9 | 367134ba5a65885e863bdc4507601606690974c1 | /src/algebra/continued_fractions/computation/default.lean | 4bb62a79f1165becdfc7e8e1fa2e56e3e7f81d63 | [
"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 | 339 | lean | /-
Copyright (c) 2020 Kevin Kappelmann. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Kappelmann
-/
import algebra.continued_fractions.computation.basic
import algebra.continued_fractions.computation.translations
/-!
# Default Exports for the Computation of Cont... |
2853b8efcbf0ba573e4d5402c058ecfecea577f2 | 8b9cc39aef95580045a98cd3aac5961a7611e7b8 | /src/polytope.lean | 96c1ea5ebe15c13c70b44686f8a53bcf3d4dc1cd | [] | no_license | vihdzp/polytope | de2202d393ca744cd879f3a316784dc67607af8f | c2c6ed3ace5fa6af0fac0c923bdf44a2d8c76a49 | refs/heads/master | 1,688,255,728,556 | 1,627,359,324,000 | 1,627,359,324,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 25,202 | lean | import tactic set_theory.ordinal order.bounded_lattice order.zorn data.set.intervals.ord_connected order.rel_iso data.finset.preimage
open_locale cardinal
set_option old_structure_cmd true
/-- A partial order with a least and greatest element. -/
class bounded_partial_order (α : Type*) extends order_top α, order_bot... |
75cc6ae90a1aaae2b6bb71729188c348a86ed9fe | 6b45072eb2b3db3ecaace2a7a0241ce81f815787 | /data/seq/wseq.lean | 8f1e9962b0df2a986ae5aec5525eb6dd07bc4213 | [] | no_license | avigad/library_dev | 27b47257382667b5eb7e6476c4f5b0d685dd3ddc | 9d8ac7c7798ca550874e90fed585caad030bbfac | refs/heads/master | 1,610,452,468,791 | 1,500,712,839,000 | 1,500,713,478,000 | 69,311,142 | 1 | 0 | null | 1,474,942,903,000 | 1,474,942,902,000 | null | UTF-8 | Lean | false | false | 51,748 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
-/
import data.seq.seq data.seq.computation data.dlist
universes u v w
-- While the `seq` structure allows for lists which may not be finite,
-- a weak sequence a... |
6d267b65843415ab4d1232dc46bde8a5bf3ce4cd | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/order/complete_lattice.lean | 661c44ec5c255b91437fcefc2dfc33b96d0a0e12 | [
"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 | 52,531 | 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 order.bounds
import data.set.bool
/-!
# Theory of complete lattices
## Main definitions
* `Sup` and `Inf` are the supremum and the infimum of a set;
* `supr... |
9e28e2ba1a465ce1c425ceaa9f275fe6182abb89 | 4c630d016e43ace8c5f476a5070a471130c8a411 | /category_theory/examples/topological_spaces.lean | fe99b8c457290b748b14145142c3b2bf4548284b | [
"Apache-2.0"
] | permissive | ngamt/mathlib | 9a510c391694dc43eec969914e2a0e20b272d172 | 58909bd424209739a2214961eefaa012fb8a18d2 | refs/heads/master | 1,585,942,993,674 | 1,540,739,585,000 | 1,540,916,815,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,535 | lean | -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Patrick Massot, Scott Morrison, Mario Carneiro
import category_theory.full_subcategory
import category_theory.functor_category
import category_theory.natural_isomorphism
import ... |
18203c8b3e12fc77350570fa566fc17943fec7f3 | 6b2a480f27775cba4f3ae191b1c1387a29de586e | /group_rep_2/Tools/diagonal_sum.lean | f11f411d6542698b24c3a9814170a663afdb0e56 | [] | no_license | Or7ando/group_representation | a681de2e19d1930a1e1be573d6735a2f0b8356cb | 9b576984f17764ebf26c8caa2a542d248f1b50d2 | refs/heads/master | 1,662,413,107,324 | 1,590,302,389,000 | 1,590,302,389,000 | 258,130,829 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 1,438 | lean | import data.fintype.basic
import algebra.big_operators
open_locale big_operators
open_locale classical
open finset
universes u v
variables (X : Type u)[fintype X][decidable_eq X](R : Type v) [ add_comm_group R]
(Y: Type )[fintype Y][decidable_eq Y]
/--
# But :: ∑ (x : X × X), ite (x.snd = x.fst) (1 : R) ... |
57b60e99ff83c81a9acb7de78e22a8eedd85303c | 1789ef53372ad44b5ce5db2341556f91c8c31395 | /src/Mermin_Peres.lean | d0bcbabbfa4c8acbb313eddda5479c486bb95c42 | [] | no_license | iceplant/Mermin_Peres | d0a0f4c9f27111b3fee4e0ab5119ef1eafc59dc2 | d7ea59b5767157420b0fae9dfc09f22ad2826564 | refs/heads/master | 1,609,583,206,767 | 1,582,220,678,000 | 1,582,220,678,000 | 239,577,114 | 1 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 9,769 | lean | -- import init.data.nat.basic
-- import init.algebra.ring
-- import init.algebra.norm_num
import init
import tactic
import data.nat.parity
import data.finset
import data.fintype
import algebra.big_operators
import data.real.basic
set_option class.instance_max_depth 15000000
#eval 2
open_locale classical
--open_l... |
18c21e7cc002d583a49316cec68c17f194a0fa8f | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/group_theory/subgroup.lean | cabe0ceaaa30cd66af01340ac6a342d1a05630e5 | [
"Apache-2.0"
] | permissive | lacker/mathlib | f2439c743c4f8eb413ec589430c82d0f73b2d539 | ddf7563ac69d42cfa4a1bfe41db1fed521bd795f | refs/heads/master | 1,671,948,326,773 | 1,601,479,268,000 | 1,601,479,268,000 | 298,686,743 | 0 | 0 | Apache-2.0 | 1,601,070,794,000 | 1,601,070,794,000 | null | UTF-8 | Lean | false | false | 44,783 | lean | /-
Copyright (c) 2020 Kexing Ying. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kexing Ying
-/
import group_theory.submonoid
import algebra.group.conj
/-!
# Subgroups
This file defines multiplicative and additive subgroups as an extension of submonoids, in a bundle... |
0eb2ca2d847fc2e45dca12767ba00af9bf425a74 | 74caf7451c921a8d5ab9c6e2b828c9d0a35aae95 | /library/init/algebra/order.lean | 26c7b72056e1004fae051479f69c7155c7a50a90 | [
"Apache-2.0"
] | permissive | sakas--/lean | f37b6fad4fd4206f2891b89f0f8135f57921fc3f | 570d9052820be1d6442a5cc58ece37397f8a9e4c | refs/heads/master | 1,586,127,145,194 | 1,480,960,018,000 | 1,480,960,635,000 | 40,137,176 | 0 | 0 | null | 1,438,621,351,000 | 1,438,621,351,000 | null | UTF-8 | Lean | false | false | 8,396 | 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.logic
/- Make sure instances defined in this file have lower priority than the ones
defined for concrete structures -/
set_option def... |
177485bc5bbeab3a26260cc04382c2c799591a91 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/compiler/array_test.lean | 84e3221c8d973888454ea3a69814535961e37fd4 | [
"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,237 | lean | def foo (a : Array Nat) : Array Nat :=
let a := a.push 0
let a := a.push 1
let a := a.push 2
let a := a.push 3
a
def main : IO UInt32 := do
let a : Array Nat := Array.empty
IO.println (toString a)
IO.println (toString a.size)
let a := foo a
IO.println (toString a)
let a := a.map (fun a => a + 10)
IO.println (to... |
e4392745212c8b315085e195eee4366ab6328958 | 36938939954e91f23dec66a02728db08a7acfcf9 | /lean/deps/galois_stdlib/src/galois/data/bool.lean | 23e31f1a488400803143a9765db0ad19e9bac566 | [
"Apache-2.0"
] | permissive | pnwamk/reopt-vcg | f8b56dd0279392a5e1c6aee721be8138e6b558d3 | c9f9f185fbefc25c36c4b506bbc85fd1a03c3b6d | refs/heads/master | 1,631,145,017,772 | 1,593,549,019,000 | 1,593,549,143,000 | 254,191,418 | 0 | 0 | null | 1,586,377,077,000 | 1,586,377,077,000 | null | UTF-8 | Lean | false | false | 376 | lean | -- Boolean operations.
/- Implication over Booleans. -/
def bimplies : bool → bool → bool
| tt y := y
| ff _ := tt
/- Return conjunction of all elements in list. -/
def ball : list bool → bool
| [] := tt
| (tt::r) := ball r
| (ff::r) := ff
/- Return disjunction of all elements in list. -/
def bany : list bool → bool... |
3d4a61d2ede1f5fc639b75c0a27dab842c39648e | ec62863c729b7eedee77b86d974f2c529fa79d25 | /9/a.lean | 091d66beb320213071289a161ef3e0557de818f8 | [] | no_license | rwbarton/advent-of-lean-4 | 2ac9b17ba708f66051e3d8cd694b0249bc433b65 | 417c7e2718253ba7148c0279fcb251b6fc291477 | refs/heads/main | 1,675,917,092,057 | 1,609,864,581,000 | 1,609,864,581,000 | 317,700,289 | 24 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 495 | lean | def bufSize : Nat := 25
def isPairSum (xs : List Int) (y : Int) : Bool := do
for x₁ in xs do
for x₂ in xs do
if x₁ ≠ x₂ && x₁ + x₂ == y then return true
return false
def firstBad (xs : List Int) : Int := do
let mut old := xs.take bufSize
for x in xs.drop bufSize do
if ! isPairSum old x then return x
old := ... |
391536e2c6f7265022093b48b123992f93d29bd9 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /src/Init/System/IO.lean | 1919b54d671e99313764269afbf72e9868396f9e | [
"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 | 24,913 | 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... |
2d72a3dbc5aae17c41c79d4c7ddf1f5d52892234 | b82c5bb4c3b618c23ba67764bc3e93f4999a1a39 | /src/formal_ml/measurable_space.lean | 53e965a9b17c71c70d08d0b465facff1870c1f3a | [
"Apache-2.0"
] | permissive | nouretienne/formal-ml | 83c4261016955bf9bcb55bd32b4f2621b44163e0 | 40b6da3b6e875f47412d50c7cd97936cb5091a2b | refs/heads/master | 1,671,216,448,724 | 1,600,472,285,000 | 1,600,472,285,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 18,215 | 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... |
56c051256388003d4991a19bc24ff35956c63c64 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tests/lean/resolveGlobalName.lean | 4218a786dc76372f60210370f716af8c97fcf90b | [
"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 | 590 | lean | import Lean
def Boo.x := 1
def Foo.x := 2
def Foo.x.y := 3
def Bla.x := 4
namespace Test
export Bla (x)
end Test
open Lean
open Lean.Elab.Term
open Lean.Elab.Command
syntax (name := resolveKind) "#resolve " ident : command
@[commandElab resolveKind] def elabResolve : CommandElab :=
fun stx => liftTermElabM none d... |
adaff992af569f71e5ddc8169a7f107e5463ff31 | 2c096fdfecf64e46ea7bc6ce5521f142b5926864 | /src/Lean/Data/HashMap.lean | 99b1de34d5ae0550f28472c6c053ff3a6d835512 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | Kha/lean4 | 1005785d2c8797ae266a303968848e5f6ce2fe87 | b99e11346948023cd6c29d248cd8f3e3fb3474cf | refs/heads/master | 1,693,355,498,027 | 1,669,080,461,000 | 1,669,113,138,000 | 184,748,176 | 0 | 0 | Apache-2.0 | 1,665,995,520,000 | 1,556,884,930,000 | Lean | UTF-8 | Lean | false | false | 9,308 | lean | /-
Copyright (c) 2018 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
import Lean.Data.AssocList
namespace Lean
def HashMapBucket (α : Type u) (β : Type v) :=
{ b : Array (AssocList α β) // b.size.isPowerOfTwo }
def HashMap... |
18327d5d3c23566cbb20b47b4f0cb9e8456cf533 | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /src/Lean/Data/Lsp/LanguageFeatures.lean | efc12a85cc5cf9c6e4d46fc70ec4e0175a821d37 | [
"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,699 | lean | /-
Copyright (c) 2020 Wojciech Nawrocki. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Wojciech Nawrocki
-/
import Lean.Data.Json
import Lean.Data.Lsp.Basic
namespace Lean
namespace Lsp
open Json
structure CompletionOptions where
triggerCharacters? : Option (A... |
f0b20f47fefe3def00a88e5fa910fe664b81c527 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/data/hash_map.lean | 604e8f0e096459e8384eb4c3083ba265d04b9339 | [
"Apache-2.0"
] | permissive | lacker/mathlib | f2439c743c4f8eb413ec589430c82d0f73b2d539 | ddf7563ac69d42cfa4a1bfe41db1fed521bd795f | refs/heads/master | 1,671,948,326,773 | 1,601,479,268,000 | 1,601,479,268,000 | 298,686,743 | 0 | 0 | Apache-2.0 | 1,601,070,794,000 | 1,601,070,794,000 | null | UTF-8 | Lean | false | false | 27,893 | 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, Mario Carneiro
-/
import data.pnat.basic
import data.list.range
import data.array.lemmas
import algebra.group
import data.sigma.basic
universes u v w
/-- `b... |
a4d85d47b2cbf3c507390416822522f14ba7355d | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/group_theory/complement.lean | 42dfae52b389841fa689387acc83073bd6eb71b0 | [
"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 | 12,271 | lean | /-
Copyright (c) 2021 Thomas Browning. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Thomas Browning
-/
import group_theory.group_action
import group_theory.order_of_element
import group_theory.quotient_group
/-!
# Complements
In this file we define the complement ... |
9e909f0cda36ef0430f13db8a0fd50ffbccbb1ce | e791a827712b9cda7e14eb9861a152725a60f884 | /algebra.lean | dac572a767b5cdf4500887bf81056a691a2fe17c | [] | no_license | Shamrock-Frost/FormalComplexAnalysis | 29bf1d45f59b22d6553b24fe5b630464f9c2d9fa | 3cac79d9b603b1edf7df1bc7e948c74eb86a2cc0 | refs/heads/master | 1,588,634,495,874 | 1,554,397,551,000 | 1,554,397,551,000 | 179,541,347 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,896 | lean | lemma {u} FOIL {R : Type u} [ring R] : ∀ a b c d : R, (a + b) * (c + d) = a*c + a*d + b*c + b*d :=
by { intros, rw [left_distrib, right_distrib, right_distrib], ac_refl }
lemma {u} FOIL_neg_square {R : Type u} [comm_ring R] : ∀ a b : R, (a - b) * (a - b) = a*a + (-(a*b)+ -(a*b)) + b*b :=
by { intros, rw sub_eq_add_neg... |
56c2ed34f91dc70b96b14427122020fb1101fc8e | 94e33a31faa76775069b071adea97e86e218a8ee | /src/data/multiset/nodup.lean | 09b5860fe59e1665df34f194adf4d22e16bc3335 | [
"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 | 9,640 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.multiset.bind
import data.multiset.powerset
import data.multiset.range
/-!
# The `nodup` predicate for multisets without duplicate elements.
-/
n... |
bfdf77f97a0d6f5d01c258762f90e51748d6c6ac | 92b50235facfbc08dfe7f334827d47281471333b | /hott/hit/circle.hlean | d7a17712c2fcf20928eab241bf4b1d92f01561fc | [
"Apache-2.0"
] | permissive | htzh/lean | 24f6ed7510ab637379ec31af406d12584d31792c | d70c79f4e30aafecdfc4a60b5d3512199200ab6e | refs/heads/master | 1,607,677,731,270 | 1,437,089,952,000 | 1,437,089,952,000 | 37,078,816 | 0 | 0 | null | 1,433,780,956,000 | 1,433,780,955,000 | null | UTF-8 | Lean | false | false | 9,711 | 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 circle
-/
import .sphere
import types.bool types.int.hott types.equiv
import algebra.fundamental_group algebra.hott
open eq susp bool sphere_in... |
56d4dc38205487f8e3c5b447e702302afa2eef5a | 592ee40978ac7604005a4e0d35bbc4b467389241 | /Library/generated/mathscheme-lean/InvolutiveRingoid.lean | b8b5b4788fbe269a63dbc7e66fd5ed431308e68b | [] | 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 | 14,081 | 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 InvolutiveRingoid
structure InvolutiveRingoid (A : Type) : Type :=
(prim : (A → A))
(one : A)
(fixes_prim_one : (prim one) = one)
(involutive_prim... |
858b121fe30d022f512ec20de31515f4cfbb1f85 | 3618c6e11aa822fd542440674dfb9a7b9921dba0 | /src/coprod/free_group.lean | 9b77e4af9fe6eb910a2a42dba75de6f4185d87d1 | [] | no_license | ChrisHughes24/single_relation | 99ceedcc02d236ce46d6c65d72caa669857533c5 | 057e157a59de6d0e43b50fcb537d66792ec20450 | refs/heads/master | 1,683,652,062,698 | 1,683,360,089,000 | 1,683,360,089,000 | 279,346,432 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,183 | lean | import coprod.basic
import data.int.basic
import algebra.group_power
import logic.embedding
import data.equiv.mul_add
import group_theory.subgroup
notation `C∞` := multiplicative ℤ
@[reducible] def free_group (ι : Type*) := coprod (λ i : ι, C∞)
namespace free_group
variables {ι : Type*} [decidable_eq ι] {M : Type*} ... |
283df630bec22cf94e2a424afb09b6a2c47493e8 | 0bd6c950c82dcba3e46dc8d8acb5ecc60b917520 | /EulerPartition.lean | 76125836e89b30ce30d43230dcc1499020fedf9d | [] | no_license | truonghoangle/formalabstracts | 976dbbdede5c71346a3c534a8f319456248d4610 | b889ec60143315053a51b1829a5dc4d82ba503b3 | refs/heads/master | 1,584,899,948,798 | 1,537,184,894,000 | 1,537,184,894,000 | 140,428,980 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 434 | lean |
import data.set.finite data.multiset
open set finset
variable α : Type
def square (n:ℕ ):multiset ℕ :=multiset.join(multiset.repeat (multiset.range (n+1)) (n+1))
theorem Euler_Partition (n :ℕ): (multiset.filter (λ s:multiset ℕ , multiset.sum (s.map (λ i,i)) =n ∧ (∀ i, i∈ s→ i % 2=1)) (multiset.powerset (square... |
2a2c65c15678675f08c4d34a3990653da48a7245 | 618003631150032a5676f229d13a079ac875ff77 | /src/meta/expr.lean | de514c49c4cd9c617f4d9e7035c13d491ec6a3e7 | [
"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 | 33,075 | lean | /-
Copyright (c) 2019 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Simon Hudon, Scott Morrison, Keeley Hoek, Robert Y. Lewis
-/
import data.string.defs
import tactic.derive_inhabited
/-!
# Additional operations on expr and related typ... |
ead7a4ff22edb67e4ebd520683a0869229a14a6f | ee8cdbabf07f77e7be63a449b8483ce308d37218 | /lean/src/test/aime-1984-p1.lean | 7c1732511a2dbc2760148ae3c0817d2e4a55c160 | [
"Apache-2.0",
"MIT"
] | permissive | zeta1999/miniF2F | 6d66c75d1c18152e224d07d5eed57624f731d4b7 | c1ba9629559c5273c92ec226894baa0c1ce27861 | refs/heads/main | 1,681,897,460,642 | 1,620,646,361,000 | 1,620,646,361,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 455 | lean | /-
Copyright (c) 2021 OpenAI. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kunhao Zheng
-/
import data.nat.basic
import data.finset.basic
import algebra.big_operators.basic
open_locale big_operators
example (u : ℕ → ℕ) (h₀ : ∀ n, u (n + 1) = u n + 1) (h₁ : ∑ k in fi... |
6dc7e98f5530a6a7f3cfd3e6f6795a1b63df94bb | f07ebb00c1b0eed4d4e2df146b6ab5d8aa10802d | /ch4.lean | aba03d8c41a2e278f6eff776920431a19c02ca27 | [] | no_license | jgarte/theorem-proving-in-lean | 7762e7339ef94269f04e2d8c89ccdcc77053204f | 4b7b62f3ca82d4463f6e607e0ef974c9577a5b7e | refs/heads/master | 1,650,893,202,520 | 1,587,934,185,000 | 1,587,934,185,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,712 | lean | -- Chapter 4
-- 1.
variables (α : Type) (p q : α → Prop)
-- naming: eq = equivalence.
theorem eq1 : (∀ x, p x ∧ q x) ↔ (∀ x, p x) ∧ (∀ x, q x) :=
iff.intro
(assume h : (∀ x, p x ∧ q x),
and.intro
(assume z : α, (h z).left)
(assume z : α, (h z).right))
(assume h : (∀ x, p x) ∧ (∀ x, q x),
show... |
21e332769d153c1ba60528d544e4ebf897f15d95 | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/algebra/group_power/lemmas.lean | ec04d26d5f4d95c56c7a70c436f2b37f286ab568 | [
"Apache-2.0"
] | permissive | ilitzroth/mathlib | ea647e67f1fdfd19a0f7bdc5504e8acec6180011 | 5254ef14e3465f6504306132fe3ba9cec9ffff16 | refs/heads/master | 1,680,086,661,182 | 1,617,715,647,000 | 1,617,715,647,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 32,897 | 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 algebra.group_power.basic
import algebra.invertible
import algebra.opposites
import data.list.basic
import data.int.cast
import data.equiv.basic... |
e61b82450c660ce65335f3651c7e17f0883f8eb6 | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /archive/imo/imo1998_q2.lean | 7199b8ac8c23cc5dacfc1c37a98763ac0ca48906 | [
"Apache-2.0"
] | permissive | ilitzroth/mathlib | ea647e67f1fdfd19a0f7bdc5504e8acec6180011 | 5254ef14e3465f6504306132fe3ba9cec9ffff16 | refs/heads/master | 1,680,086,661,182 | 1,617,715,647,000 | 1,617,715,647,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,574 | lean | /-
Copyright (c) 2020 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import data.fintype.basic
import data.int.parity
import algebra.big_operators.order
import tactic.ring
import tactic.noncomm_ring
/-!
# IMO 1998 Q2
In a competition, there... |
2aa5a4e49b920f647fb6af3160565a61db098b47 | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/measure_theory/measure/content.lean | 3228c5593b5516196a4af4ccc4067f3e74bdedb9 | [
"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,937 | lean | /-
Copyright (c) 2020 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
-/
import measure_theory.measure.measure_space
import measure_theory.measure.regular
import topology.opens
import topology.compacts
/-!
# Contents
In this file we ... |
0981eaf003e7734ba4facde73403a9708182b815 | 737dc4b96c97368cb66b925eeea3ab633ec3d702 | /src/Lean/Meta/Match/MatcherInfo.lean | 6d9545447c2242e599093e0fa82e95c8732ae7ad | [
"Apache-2.0"
] | permissive | Bioye97/lean4 | 1ace34638efd9913dc5991443777b01a08983289 | bc3900cbb9adda83eed7e6affeaade7cfd07716d | refs/heads/master | 1,690,589,820,211 | 1,631,051,000,000 | 1,631,067,598,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,719 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Meta.Basic
namespace Lean.Meta
namespace Match
/--
A "matcher" auxiliary declaration has the following structure:
- `numParams` parameters
- m... |
1c70ea671956d1457891febb65605102a391859d | 1abd1ed12aa68b375cdef28959f39531c6e95b84 | /src/topology/instances/ennreal.lean | d2c9baecb0c05023bcad35f380d5e9938972378e | [
"Apache-2.0"
] | permissive | jumpy4/mathlib | d3829e75173012833e9f15ac16e481e17596de0f | af36f1a35f279f0e5b3c2a77647c6bf2cfd51a13 | refs/heads/master | 1,693,508,842,818 | 1,636,203,271,000 | 1,636,203,271,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 56,231 | 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 topology.instances.nnreal
import topology.algebra.ordered.liminf_limsup
import topology.metric_space.lipschitz
/-!
# Extended non-negative reals
-/
noncomputa... |
12779e4332a9f9332f74d84aa5f0ec96f42acf1a | 5e3548e65f2c037cb94cd5524c90c623fbd6d46a | /src_icannos_totilas/groupes/cpge_groupe_9_a_bis.lean | 0b82de9d94f7723bc32316844d7b2a9a97d59791 | [] | no_license | ahayat16/lean_exos | d4f08c30adb601a06511a71b5ffb4d22d12ef77f | 682f2552d5b04a8c8eb9e4ab15f875a91b03845c | refs/heads/main | 1,693,101,073,585 | 1,636,479,336,000 | 1,636,479,336,000 | 415,000,441 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 193 | lean | import group_theory.subgroup
theorem cpge_groupe_9_a_bis {G1 : Type*} [group G1] {G2 : Type*} [group G2]
(f : G1 →* G2) : (∀ (a ∈ f.ker), ∀ (x : G1), f (x * a * x⁻¹) = 1) := sorry |
150fda0a3e1da3f3a2c8da42fcd34b6e04462b97 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /stage0/src/Lean/Meta/DiscrTree.lean | 016d51da553cca49b7e612dfafa99f36e1d1f1a1 | [
"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 | 21,490 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Meta.Basic
import Lean.Meta.FunInfo
import Lean.Meta.InferType
import Lean.Meta.WHNF
namespace Lean.Meta.DiscrTree
/-
(Imperfect) discriminat... |
8c76b6b068e42a9506677b99e60d14f004455f55 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/sort.lean | f0292bd51b07625fbc06b7a4f2081dce6921539e | [
"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 | 38 | lean | #check Sort
#check Sort 0
#check Prop
|
aa9ad8f5d7634d7655e67ce71d14fa8683fc796d | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/linear_algebra/pi.lean | 5d2567d628bb6f73f789339efa5588da121c48e0 | [
"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 | 18,224 | 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, Kevin Buzzard, Yury Kudryashov, Eric Wieser
-/
import linear_algebra.basic
import logic.equiv.fin
/-!
# Pi types of modules
This file defines construc... |
c058f534fd124fd84a2f4b5362b0d434a5b08ea5 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/category_theory/closed/functor.lean | 44589883772c83819ec638a6b7e9bb6a661de1ab | [
"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 | 6,615 | lean | /-
Copyright (c) 2020 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta
-/
import category_theory.closed.cartesian
import category_theory.limits.preserves.shapes.binary_products
import category_theory.adjunction.fully_faithful
/-!
# Cartesian ... |
7db8acfbbbaf76ae19c7623666cd106e68966b23 | 86f6f4f8d827a196a32bfc646234b73328aeb306 | /examples/basics/unnamed_877.lean | 06959d055fe0925826963dbba2adbe28d6f86baa | [] | 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 | 204 | lean | import algebra.ring
namespace my_ring
variables {R : Type*} [ring R]
-- BEGIN
lemma one_add_one_eq_two : 1 + 1 = (2 : R) :=
by refl
theorem two_mul (a : R) : 2 * a = a + a :=
sorry
-- END
end my_ring |
8363cae6846da38d2eb6c5f2e0057969b8b20604 | c021f28e58f8acea72ed5cf5cc1a92c725760ea5 | /src/Gröbner.lean | 07584d4c999c2008887efc4b27a5366c4e63c8e2 | [] | no_license | robertylewis/ring_equational_reasoner | 3233b9f3578d0d0d2f38551062b2c37c747f0e0d | beb35c80a69d74c9551aeed3e17aa2071b5842c3 | refs/heads/master | 1,599,224,363,883 | 1,572,960,322,000 | 1,572,960,322,000 | 219,737,924 | 0 | 0 | null | 1,572,956,310,000 | 1,572,956,307,000 | null | UTF-8 | Lean | false | false | 25,874 | lean | import group_theory.coset ring_theory.ideals data.int.modeq group_theory.quotient_group
tactic.fin_cases tactic.tidy data.mv_polynomial tactic.find
open tactic prod native environment interactive lean.parser ideal classical lattice declaration rbtree
local infixl ` ⬝ ` := has_mul.mul
local notation x`²`:99 := x... |
4bff569c7c16d40f98aa56c81d240bd00efc405f | 367134ba5a65885e863bdc4507601606690974c1 | /src/data/nat/prime.lean | 38fff598fa0b9d49abd8c5132eebe8fdc7bc58fe | [
"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 | 30,432 | 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
-/
import data.nat.sqrt
import data.nat.gcd
import algebra.group_power
import tactic.wlog
import tactic.norm_num
/-!
# Prime n... |
cde5a9c022fe4c7935ccaa54f9dae6b5a6e0611f | de91c42b87530c3bdcc2b138ef1a3c3d9bee0d41 | /old/eval/math_eval.lean | 272c07b8d5fb3aaf80c2a30dac55f8c287b52a64 | [] | no_license | kevinsullivan/lang | d3e526ba363dc1ddf5ff1c2f36607d7f891806a7 | e9d869bff94fb13ad9262222a6f3c4aafba82d5e | refs/heads/master | 1,687,840,064,795 | 1,628,047,969,000 | 1,628,047,969,000 | 282,210,749 | 0 | 1 | null | 1,608,153,830,000 | 1,595,592,637,000 | Lean | UTF-8 | Lean | false | false | 435 | lean | import ..environment.environment
variables {K : Type*} [field K] [inhabited K]{f : fm K TIME} (sp : spc K f)
open lang.math
namespace lang.math_eval
def fm_eval {K : Type*} [field K] [inhabited K] (f : fm K TIME) : env K f → fm_expr K → fm K TIME
| e (fm_expr.lit f) := f
| e (fm_expr.var v) := e.f v
def sp_eval ... |
e69359dba8aabd73bcd9f0b77383512114a9b0ad | 38ee9024fb5974f555fb578fcf5a5a7b71e669b5 | /Mathlib/Tactic/ShowTerm.lean | a01ca8836444cc029ace3b95e94ba7b203566d44 | [
"Apache-2.0"
] | permissive | denayd/mathlib4 | 750e0dcd106554640a1ac701e51517501a574715 | 7f40a5c514066801ab3c6d431e9f405baa9b9c58 | refs/heads/master | 1,693,743,991,894 | 1,636,618,048,000 | 1,636,618,048,000 | 373,926,241 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 807 | lean | /-
Copyright (c) 2021 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Scott Morrison
-/
import Lean.Elab.Tactic.Basic
import Mathlib.Tactic.TryThis
open Lean
open Lean.Meta
open Lean.Elab.Tactic
open Tactic.TryThis
namespace Lean.Elab.Tactic
/--
`showT... |
35a227bbc1c74554092015e596035456d018ae80 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /archive/imo/imo2001_q6.lean | 73dbd931eacb86fa91f1e7eb04577e33a0309022 | [
"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 | 2,070 | lean | /-
Copyright (c) 2021 Sara Díaz Real. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sara Díaz Real
-/
import data.int.basic
import algebra.associated
import tactic.linarith
import tactic.ring
/-!
# IMO 2001 Q6
Let $a$, $b$, $c$, $d$ be integers with $a > b > c > d > ... |
053f97a9b7fb29ebf69bac70cb0ff75703375afe | 80d0f8071ea62262937ab36f5887a61735adea09 | /src/certigrad/prove_model_ok.lean | b6254c0ac2c92474a2ad720e1432f238c12b8948 | [
"Apache-2.0"
] | permissive | wudcscheme/certigrad | 94805fa6a61f993c69a824429a103c9613a65a48 | c9a06e93f1ec58196d6d3b8563b29868d916727f | refs/heads/master | 1,679,386,475,077 | 1,551,651,022,000 | 1,551,651,022,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 21,743 | lean | /-
Copyright (c) 2017 Daniel Selsam. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Daniel Selsam
Tactics to prove specific models satisfy the preconditions of backprop_correct.
-/
import data.list.set .tfacts .graph .predicates .expected_value .reparam .kl .tactics .p... |
b9906e16900da9d8c970c28ebc95a9ba56ddf5a9 | bb31430994044506fa42fd667e2d556327e18dfe | /src/topology/perfect.lean | f788259dc54aef6ee4ef7d1ae3f8c2c35d2686aa | [
"Apache-2.0"
] | permissive | sgouezel/mathlib | 0cb4e5335a2ba189fa7af96d83a377f83270e503 | 00638177efd1b2534fc5269363ebf42a7871df9a | refs/heads/master | 1,674,527,483,042 | 1,673,665,568,000 | 1,673,665,568,000 | 119,598,202 | 0 | 0 | null | 1,517,348,647,000 | 1,517,348,646,000 | null | UTF-8 | Lean | false | false | 7,999 | lean | /-
Copyright (c) 2022 Felix Weilacher. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Felix Weilacher
-/
import topology.separation
import topology.bases
/-!
# Perfect Sets
In this file we define perfect subsets of a topological space, and prove some basic properties... |
0f712d97813ecdcd7084bf955d7bae5d08d7e1af | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/data/fintype/basic.lean | 832434c04f5828880f4865a9a02f3fc09eec6e50 | [
"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 | 43,711 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
Finite types.
-/
import tactic.wlog
import data.finset.powerset
import data.finset.lattice
import data.finset.pi
import data.array.lemmas
universes u v
variables {α : ... |
1b0441b4d2171340a430a8bbbd21a22f8df0b1db | 675b8263050a5d74b89ceab381ac81ce70535688 | /src/field_theory/galois.lean | 9fe65dda9c500ccabd5135bb4fd32688113cd121 | [
"Apache-2.0"
] | permissive | vozor/mathlib | 5921f55235ff60c05f4a48a90d616ea167068adf | f7e728ad8a6ebf90291df2a4d2f9255a6576b529 | refs/heads/master | 1,675,607,702,231 | 1,609,023,279,000 | 1,609,023,279,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 17,646 | lean | /-
Copyright (c) 2020 Thomas Browning and Patrick Lutz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Thomas Browning and Patrick Lutz
-/
import field_theory.normal
import field_theory.primitive_element
import field_theory.fixed
import ring_theory.power_basis
/-!
# ... |
e116889ab877de2aa2c3a66aa44965acd78f5c3b | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/algebraic_geometry/structure_sheaf.lean | e475436f0c5b5456a1c7a4c830e19649f54434ee | [
"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 | 25,022 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Scott Morrison
-/
import algebraic_geometry.prime_spectrum
import algebra.category.CommRing.colimits
import algebra.category.CommRing.limits
import topology.sheaves.loc... |
9f58c6574aee8aab384cc8d6f7ad60e4176a381a | 9d00e4b237465921fb33aa10eed92a2495ca2e46 | /implRules.lean | 53163e8d01ce2c7faaa65ee5eedc652cc763def1 | [] | no_license | Bpalkmim/LeanNatD | 7756abf1ed7b0e7a3e3b9d16ad756018f5c70c7c | 2e73bb44e44b955839e7a0874cd7013fbfb9c4e3 | refs/heads/master | 1,610,999,141,530 | 1,475,515,895,000 | 1,475,515,895,000 | 69,893,600 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,437 | lean | namespace implRules
print " "
print "Provas com IMPL - início"
print " "
constant Proof : Prop → Type
constant implies : Prop → Prop → Prop
constants A B C : Prop
-- Definições
constant impl_intro {X Y : Prop} : (Π x : Proof X, Proof Y) → Proof Y → Proof (implies X Y)
constant impl_elim {X Y : Prop} : Proof (implies... |
aaa0a2d8008ff0faeefd7e8a9aac4116fa51207b | 367134ba5a65885e863bdc4507601606690974c1 | /src/algebra/module/linear_map.lean | ee980b505cbaa0792d6b0924e1bf52f8cbd254ad | [
"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 | 18,668 | lean | /-
Copyright (c) 2020 Anne Baanen. 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, Anne Baanen
-/
import algebra.group.hom
import algebra.module.basic
import algebra.group_action_hom
/-!
# Linear maps and... |
7f70213a49d96046166e513d0b8a11803ca243c4 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /test/push_neg.lean | 81dfb40898fd444dd648afe688a9bbb3815965db | [
"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 | 2,038 | lean | import tactic.push_neg
import data.int.basic
example (h : ∃ p: ℕ, ¬ ∀ n : ℕ, n > p) (h' : ∃ p: ℕ, ¬ ∃ n : ℕ, n < p) : ¬ ∀ n : ℕ, n = 0 :=
begin
push_neg at *,
guard_target_strict ∃ (n : ℕ), n ≠ 0,
guard_hyp_strict h : ∃ (p n : ℕ), n ≤ p,
guard_hyp_strict h' : ∃ (p : ℕ), ∀ (n : ℕ), p ≤ n,
use 1,
end
-- In th... |
5c95b977d1d2c9bf34ed4fac8b979b201ad2b3cc | 3dd1b66af77106badae6edb1c4dea91a146ead30 | /tests/lean/run/tactic6.lean | 6ef178c481dfc160a12874ddc290ca50e6411a51 | [
"Apache-2.0"
] | permissive | silky/lean | 79c20c15c93feef47bb659a2cc139b26f3614642 | df8b88dca2f8da1a422cb618cd476ef5be730546 | refs/heads/master | 1,610,737,587,697 | 1,406,574,534,000 | 1,406,574,534,000 | 22,362,176 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 180 | lean | import standard
using tactic (renaming id->id_tac)
definition id {A : Type} (a : A) := a
theorem tst {A B : Prop} (H1 : A) (H2 : B) : id A
:= by unfold id; assumption
check tst
|
5021e5c4c8181ecf93914b1f3fdc8f295cb86da9 | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /src/data/multiset/antidiagonal.lean | e47b30cfdec503374259b939a60ba2475a6708ee | [
"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 | 3,053 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.multiset.powerset
/-!
# The antidiagonal on a multiset.
The antidiagonal of a multiset `s` consists of all pairs `(t₁, t₂)`
such that `t₁ + t₂ = s`. The... |
5aa3f9738af8de5bd36b164ab35bb6946fae514d | 70f8755415fa7a17f87402cde4651e9f4db1b5bb | /src/qpf.lean | 3e2dc8ffa5a459ca853c397d045a62fa2971f4cf | [
"Apache-2.0"
] | permissive | shingarov/qpf | ab935dc2298db12c87ac011a2e4d2c27e0bdef4b | debe2eacb8cf46b21aba2eaf3f2e20940da0263b | refs/heads/master | 1,653,705,576,607 | 1,570,136,035,000 | 1,570,136,035,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 19,370 | lean | /-
Copyright (c) 2018 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad
We assume the following:
`P` : a polynomial functor
`W` : its W-type
`M` : its M-type
`F` : a functor
We define:
`q` : `qpf` data, representing `F` as a quoti... |
5e18605b18c5469dd8a399b2a45239a74afded1b | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebraic_topology/nerve.lean | 09c8373d1a4ba7901e2d6f1b24ee03002956aa74 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 1,446 | 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_set
/-!
# The nerve of a category
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding PR to m... |
ca4d461c053bbc9d96c7f014c42ee9287fa18b67 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/group_theory/sylow_auto.lean | 24a0408d4cdaf86d0501c4a87a07c1278b1cdd45 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,612 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.group_theory.group_action.default
import Mathlib.group_theory.quotient_group
import Mathlib.gro... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.