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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
91e88babe3c0dc77775cadfb80a82ef5da2be328 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/group_ring_action/basic.lean | 539cca73b344f90f020421b0e56ada6a0a5653c0 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 2,973 | 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.ring.equiv
import algebra.field.defs
import group_theory.group_action.group
/-!
# Group action on rings
This file defines the typeclass of monoid acting on se... |
e9e762fc16a6cc941a44ff77f7a87a9dcdb30a96 | 54f4ad05b219d444b709f56c2f619dd87d14ec29 | /my_project/src/lovelib.lean | 8c327e0e000fc684e41c96f5c96c46e4c6883f79 | [] | no_license | yizhou7/learning-lean | 8efcf838c7276e235a81bd291f467fa43ce56e0a | 91fb366c624df6e56e19555b2e482ce767cd8224 | refs/heads/master | 1,675,649,087,737 | 1,609,022,281,000 | 1,609,022,281,000 | 272,072,779 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,789 | lean | import algebra
import data.real.basic
import logic.basic
import order
import tactic.explode
import tactic.find
import tactic.linarith
import tactic.rcases
import tactic.rewrite
import tactic.ring_exp
import tactic.tidy
import tactic.where
/-! # LoVe Library
This files contains a few extensions on top of Lean's core ... |
1205e21c849b7bad5dce654809b724fefda4f01b | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/consume.lean | e8d6b5d6eebd5e8ed397b62cfb74918baf8ef6e8 | [
"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 | 123 | lean | definition pr2 {A : Type} (a b : A) := a
#check pr2
#check pr2
#check pr2
#check @pr2
#check @pr2
#check @@pr2
#check pr2
|
23f6ea209c67e86b85fb8387e30361985349005a | b7f22e51856f4989b970961f794f1c435f9b8f78 | /hott/init/path.hlean | c7114d9b66b7419780e3ace7ab77847cfd81a79f | [
"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 | 30,528 | hlean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Jakob von Raumer, Floris van Doorn
Ported from Coq HoTT
-/
prelude
import .function .tactic
open function eq
/- Path equality -/
namespace eq
variables {A ... |
e9bf4e48e0e9e97b7b4c62bfc8d74b125c389f95 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/finally.lean | b46ffef2d1afc7999c0f66f27286c727c41ea038 | [
"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,855 | lean | def checkM (b : IO Bool) : IO Unit :=
unless (← b) do throw $ IO.userError "failed"
abbrev M := ExceptT String $ StateRefT Nat IO
def f1 : M Nat :=
throw "error 1"
def f2 : M Nat :=
throwThe IO.Error $ IO.userError "error 2"
def tst1 : M Nat := do
try
try f1 finally set 100; IO.println "finisher executed"
catch _... |
8660eb2c706211cf714466bdc372904cf4e677dc | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /src/Lean/Elab/AuxDiscr.lean | c07326fac386abdcaf56db148729ba9b8b434022 | [
"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 | 1,130 | lean | /-
Copyright (c) 2022 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
namespace Lean
/--
Create an auxiliary identifier for storing non-atomic discriminants.
This kind of free variable is cleared before elaborating a `ma... |
93ba4b00c71bb1b6eb0366767a7ae879b3e84677 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/analysis/complex/isometry.lean | 7718c6c229a3beacd455fa478380beba8d9a070f | [
"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,716 | 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... |
641681f00fdb130c2e13d4a95e7db2c6fbe97ca8 | 74d9d5f45c6ce5c4f2faf215c04a68eab55fe525 | /src/homeos.lean | c5e77def239c37feaa495e6150f3ce8dea1bfc74 | [] | no_license | joshpoll/differential_geometry | 290bb8a934ca3b3b6b707d810e6d4b941710b710 | 57e00a7e37b7c4c73c847429171ff63d3a48def5 | refs/heads/master | 1,584,551,626,391 | 1,527,747,643,000 | 1,527,747,643,000 | 135,014,993 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,816 | lean | -- From Patrick Massot
import analysis.topology.topological_space
import analysis.topology.continuity
open set function
local notation f`⁻¹` := f.symm
variables {α : Type*} {β : Type*} {γ : Type*} {δ : Type*}
[topological_space α] [topological_space β] [topological_space γ] [topological_space δ]
theorem equiv.l... |
b239af9314f150a9967c85611fd6fb7d6f343ff9 | 37a833c924892ee3ecb911484775a6d6ebb8984d | /src/category_theory/presheaves/V_pre.lean | de7445836cbbb5da1027f11eeb7220c0e216f339 | [] | no_license | silky/lean-category-theory | 28126e80564a1f99e9c322d86b3f7d750da0afa1 | 0f029a2364975f56ac727d31d867a18c95c22fd8 | refs/heads/master | 1,589,555,811,646 | 1,554,673,665,000 | 1,554,673,665,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 809 | lean | import ring_theory.ideals
import category_theory.presheaves.stalk
import category_theory.presheaves.map
import category_theory.examples.TopRing
import category_theory.sigma_category
open category_theory
open category_theory.limits
open category_theory.examples
universes u v
namespace category_theory.presheaves
-- T... |
698ab1e782617b0a8e9b16e13ffa0c7920635c41 | 92b50235facfbc08dfe7f334827d47281471333b | /hott/init/pathover.hlean | d3ead5838a8363dcc5ae8848c7d863551a0dc4ac | [
"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,136 | hlean | /-
Copyright (c) 2015 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Floris van Doorn
Basic theorems about pathovers
-/
prelude
import .path .equiv
open equiv is_equiv equiv.ops
variables {A A' : Type} {B : A → Type} {C : Πa, B a → Type}
... |
7c37818c9a70bcfeea5a417daac54d486f9e9adf | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/ring_theory/multiplicity.lean | 236e86e8e6d4c8876846292bbc961b52dcad8718 | [
"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,375 | lean | /-
Copyright (c) 2018 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis, Chris Hughes
-/
import algebra.associated data.int.gcd algebra.big_operators
import tactic.converter.interactive
variables {α : Type*}
open nat roption
theorem nat... |
7bc0fd5b1ef47489796ba3017b1da35febc94ad4 | 367134ba5a65885e863bdc4507601606690974c1 | /test/matrix.lean | fc890016b2f9ba5266bde5f689931960df4e98aa | [
"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,174 | lean | import data.matrix.notation
import linear_algebra.determinant
import group_theory.perm.fin
import tactic.norm_swap
variables {α β : Type} [semiring α] [ring β]
namespace matrix
open_locale matrix
example {a a' b b' c c' d d' : α} :
![![a, b], ![c, d]] + ![![a', b'], ![c', d']] = ![![a + a', b + b'], ![c + c', d +... |
b54a3d877cd61e5e90e699c22e82ed3444f913c4 | 2ee768fce4d0783536570385ee340d97e2411436 | /src/v_prop.lean | 1590a5bb5b06cfa5583b33681f2fb6b509965f07 | [] | no_license | agjftucker/exists-unique | 835cf0c0ec622d49dbceb84be37db62e6ab8a6d0 | 1fba6035a08347f424c765d8a1c56b1a15c8abbe | refs/heads/master | 1,683,445,592,336 | 1,622,649,822,000 | 1,622,649,822,000 | 309,485,697 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,910 | lean | import v_def
local prefix `𝒫`:100 := fun {α : Type} (s : finset α), {t // t ≤ s}
variables {𝒩 : Type} {T : with_top ℝ} {ψ ψ' : ∀ (B : finset 𝒩), Tt T → X 𝒩 → 𝒫 B}
lemma V_empty_eq_univ (t : Tt T) : V ψ ∅ t = set.univ :=
begin
apply set.eq_univ_of_forall,
intro y,
apply finset.empty_subset,
end
variables ... |
5b09fda15beed43d48a7ba2a4f2d78b7a9c8ff0b | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Meta/DecLevel.lean | 3cc5fe3c9135474d76c8136c05e2ff36f9b72810 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 2,704 | 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.Basic
import Lean.Meta.InferType
namespace Lean.Meta
structure DecLevelContext where
/--
If `true`, then `decAux? ?m` returns a fres... |
2391d8fcbfaa3dcde68419c201a3c9a1e64b8642 | 6214e13b31733dc9aeb4833db6a6466005763162 | /src/progress.lean | fc34386f253229e3801827181b4e6e9210a17c57 | [] | no_license | joshua0pang/esverify-theory | 272a250445f3aeea49a7e72d1ab58c2da6618bbe | 8565b123c87b0113f83553d7732cd6696c9b5807 | refs/heads/master | 1,585,873,849,081 | 1,527,304,393,000 | 1,527,304,393,000 | 154,901,199 | 1 | 0 | null | 1,540,593,067,000 | 1,540,593,067,000 | null | UTF-8 | Lean | false | false | 15,190 | lean | import .definitions3 .logic
lemma exp.progress {R: spec} {P: prop} {Q: propctx} {e: exp} {σ: env}:
(⊩ σ: P) → (FV R.to_prop ⊆ FV P) → (σ ⊨ R.to_prop.to_vc) → (R ⋀ P ⊩ e: Q) →
is_dvalue (R, σ, e) ∨ ∃s', (R, σ, e) ⟹ s' :=
assume env_verified: (⊩ σ : P),
assume fv_R: FV R.to_prop ⊆ FV P,
assume R_valid... |
851d41e93a6fed1b48959f958a1ee60d4af64944 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/linear_algebra/bilinear_form.lean | e2144232457edc3ddd0f5debd43004789914c2cd | [
"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 | 28,134 | lean | /-
Copyright (c) 2018 Andreas Swerdlow. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Andreas Swerdlow
-/
import linear_algebra.matrix
import linear_algebra.tensor_product
import linear_algebra.nonsingular_inverse
/-!
# Bilinear form
This file defines a bilinear for... |
64d71a7b27aca2004d975888dcf5a86c31a38ae8 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/probability/process/adapted.lean | 21b1047306077e3fbf110f363fee518687eec05b | [
"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 | 8,930 | lean | /-
Copyright (c) 2021 Kexing Ying. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kexing Ying, Rémy Degenne
-/
import probability.process.filtration
import topology.instances.discrete
/-!
# Adapted and progressively measurable processes
This file defines some standar... |
ce1d02526aa1e41a9df75bbdf361a79db38bd125 | 37da0369b6c03e380e057bf680d81e6c9fdf9219 | /hott/eq2.hlean | 8bbf07af56585ca23e2642ef5f7aac32c9a38f76 | [
"Apache-2.0"
] | permissive | kodyvajjha/lean2 | 72b120d95c3a1d77f54433fa90c9810e14a931a4 | 227fcad22ab2bc27bb7471be7911075d101ba3f9 | refs/heads/master | 1,627,157,512,295 | 1,501,855,676,000 | 1,504,809,427,000 | 109,317,326 | 0 | 0 | null | 1,509,839,253,000 | 1,509,655,713,000 | C++ | UTF-8 | Lean | false | false | 12,039 | hlean | /-
Copyright (c) 2015 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Floris van Doorn
Theorems about 2-dimensional paths
-/
import .cubical.square .function
open function is_equiv equiv
namespace eq
variables {A B C : Type} {f : A → B} {a a' a₁ a₂... |
61cd32b6c66c814fe6546f563810411c3eaf9a02 | ab8267ccbb4efcc212537904eac8db218951dcf2 | /prenex.lean | f158c3c231465cc5e600cd2611db23e8b648b5d6 | [
"Apache-2.0"
] | permissive | minchaowu/auto- | 3b954c91de72b239884cc7d5e234dcd75ca0e1a2 | 7079dcad4e38b2addb8a1e01781547db67fd278e | refs/heads/master | 1,610,417,081,627 | 1,484,174,338,000 | 1,484,174,338,000 | 78,468,738 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,221 | lean | open classical tactic expr list
section prop_equivalence
local attribute [instance] prop_decidable
variables {a b : Prop}
theorem not_not_iff (a : Prop) : ¬¬a ↔ a :=
iff.intro classical.by_contradiction not_not_intro
theorem implies_iff_not_or (a b : Prop) : (a → b) ↔ (¬ a ∨ b) :=
iff.intro
(λ h, if... |
64a4d735b063ac3a0622aeb5c27f73e0102b3c21 | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/category_theory/isomorphism.lean | c4118397c81fe3a80d52a474beec006340767295 | [
"Apache-2.0"
] | permissive | vaibhavkarve/mathlib | a574aaf68c0a431a47fa82ce0637f0f769826bfe | 17f8340912468f49bdc30acdb9a9fa02eeb0473a | refs/heads/master | 1,621,263,802,637 | 1,585,399,588,000 | 1,585,399,588,000 | 250,833,447 | 0 | 0 | Apache-2.0 | 1,585,410,341,000 | 1,585,410,341,000 | null | UTF-8 | Lean | false | false | 10,624 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Tim Baumann, Stephen Morgan, Scott Morrison, Floris van Doorn
-/
import category_theory.functor
import tactic.reassoc_axiom
/-!
# Isomorphisms
This file defines isomorphisms between ... |
b41b89bc5f0f975d6a00cb8b188db207a4cee143 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/data/real/hyperreal.lean | de5b5d7c49da388c70d3d965e3e233ffe3b4635a | [
"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 | 36,957 | lean | /-
Copyright (c) 2019 Abhimanyu Pallavi Sudhir. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Abhimanyu Pallavi Sudhir
-/
import order.filter.filter_product
import analysis.specific_limits.basic
/-!
# Construction of the hyperreal numbers as an ultraproduct of real s... |
811f60e232fe499cd893e7dbdbb9045920038faf | e953c38599905267210b87fb5d82dcc3e52a4214 | /library/data/set/finite.lean | 0a080695f8d91bda4bde8739625a242520c396aa | [
"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 | 7,190 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad
The notion of "finiteness" for sets. This approach is not computational: for example, just because
an element s : set A satsifies finite s doesn't mean that we can com... |
08953c67051a6f61f030ad15355ae341925e3874 | 947b78d97130d56365ae2ec264df196ce769371a | /tests/lean/run/def3.lean | ac41679e8e8ca1647a52613803441afa1d20cc61 | [
"Apache-2.0"
] | permissive | shyamalschandra/lean4 | 27044812be8698f0c79147615b1d5090b9f4b037 | 6e7a883b21eaf62831e8111b251dc9b18f40e604 | refs/heads/master | 1,671,417,126,371 | 1,601,859,995,000 | 1,601,860,020,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 101 | lean | new_frontend
abbrev N := Nat
def f : N → Nat
| 0 => 1
| n+1 => n
theorem ex1 : f 0 = 1 :=
rfl
|
5c1cddf3a020a0ba4e6b8084007371ebb77e701b | c0ddb2cf190d518bc0f2f0ee221dd22b1172888f | /mguaypaq/insertion_sort.lean | c390b3cebb0e639a12c501a825630918354f29d1 | [] | no_license | mguaypaq/haskell-math | 3b314552878517806b3151aa36aae422f383fad1 | 1ce7f3067eb8966fe7e7e4bffdf073b1f815fc04 | refs/heads/master | 1,607,775,289,122 | 1,582,435,358,000 | 1,582,435,358,000 | 234,125,578 | 0 | 0 | null | 1,579,106,398,000 | 1,579,106,397,000 | null | UTF-8 | Lean | false | false | 3,879 | lean | -- Every nonempty list of distinct strictly positive integers
-- has a member at least as large as the length of the list.
----------------------------------------------------------------
-- The proposition that a list has distinct elements.
def list.distinct : list nat -> Prop
| [] := true
| (head :: tail) := (h... |
c15efbea18baa19dd04ced494f2c70ee6b67c376 | 9dd3f3912f7321eb58ee9aa8f21778ad6221f87c | /library/init/data/basic.lean | 58e83b0185288df51b77bdd51cac0af040eb265b | [
"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 | 583 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.data.setoid init.data.quot init.data.bool.basic init.data.unit
import init.data.nat.basic init.data.prod init.data.sum.basic
import init... |
f7a93c3917ffb02d36966e6b5e0ce6e853e1ef90 | e0f9ba56b7fedc16ef8697f6caeef5898b435143 | /src/control/applicative.lean | f05497b6d434ef68d335f26063813b3bb6fa58da | [
"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 | 5,417 | lean | /-
Copyright (c) 2017 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Simon Hudon
Instances for identity and composition functors
-/
import control.functor
universe variables u v w
section lemmas
open function
variables {F : Type u → Type v}
variables [... |
b7aa06c1b3c2f3087579b2c0c0a87fc24ab577dd | 4fa161becb8ce7378a709f5992a594764699e268 | /src/order/basic.lean | 142c2c1483b7fd362b40c131e515e6f14669d869 | [
"Apache-2.0"
] | permissive | laughinggas/mathlib | e4aa4565ae34e46e834434284cb26bd9d67bc373 | 86dcd5cda7a5017c8b3c8876c89a510a19d49aad | refs/heads/master | 1,669,496,232,688 | 1,592,831,995,000 | 1,592,831,995,000 | 274,155,979 | 0 | 0 | Apache-2.0 | 1,592,835,190,000 | 1,592,835,189,000 | null | UTF-8 | Lean | false | false | 17,916 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Mario Carneiro
-/
import data.set.basic
open function
/-!
# Basic definitions about `≤` and `<`
## Definitions
### Predicates on functions
- `monotone f`: a function ... |
3123792f868ec9a775f551f263704a87a1d240d1 | 3984ab8555ab1e1084e22ef652544acdfc231f27 | /src/v0.1/cfr.lean | c1ebea64221908b5b677427ef74a5f6d2160f124 | [] | no_license | mrakgr/CFR-in-Lean | a35c7a478795cc794cc0caff3199cf28c8ee5448 | 720a3260297bcc158e08833d38964450dcaad2eb | refs/heads/master | 1,598,515,917,940 | 1,572,612,355,000 | 1,572,612,355,000 | 217,296,108 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,765 | lean | import helpers
def regret_match {n : nat} (a : array n rat) :=
let sum := a.foldl 0 (fun a s, max a 0 + s) in
if sum = 0 then have v : rat, from 1 / n, array.init n (fun _, v)
else a.map (fun a, max a 0 / sum)
structure Node {𝔸 : Type*} (actions : Σ (n : nat), fin n → 𝔸) := mk ::
(strategy_sum : ar... |
cb482e094a18da72fa764f979b3b8a91d23b264a | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/algebra/ring/default.lean | 2457a19007fc9a01852e3301de9c666490e88da5 | [] | 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 | 288 | lean | /-
Copyright (c) 2020 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.algebra.ring.basic
import Mathlib.PostPort
namespace Mathlib
|
7375e6d8cab7634ad19f0f65467bb4a0b9597ba6 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/evalWithMVar.lean | 04d4a7131bb0355d9c96c70e84b38b006dde8af9 | [
"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 | 251 | lean |
def c {α} : Sum α Nat :=
Sum.inr 10
def Sum.someRight {α β} (s : Sum α β) : Option β :=
match s with
| Sum.inl _ => none
| Sum.inr b => some b
#check Sum.someRight c
#eval Sum.someRight c
#check Sum.someRight (s := c)
#check c.someRight
|
dd02b47d81a5ed6b56f623ceab98cd5dea7d61e0 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/analysis/box_integral/partition/measure.lean | eaa177011ee6b41245cf4586161256c15bdf9dd2 | [
"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 | 3,733 | 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 analysis.box_integral.partition.additive
import measure_theory.measure.lebesgue
/-!
# Box-additive functions defined by measures
In this file we prove a fe... |
7507d7644a950c530238fa06ff5a1fd4d64441c6 | a4673261e60b025e2c8c825dfa4ab9108246c32e | /stage0/src/Lean/Parser/Term.lean | 79b4050782d4a9f686430e120e203fc8f00c3ed1 | [
"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 | 13,860 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Sebastian Ullrich
-/
import Lean.Parser.Basic
import Lean.Parser.Level
namespace Lean
namespace Parser
builtin_initialize
registerBuiltinParserAttribute `... |
a0b6c8ff4a40f429667f7b7294905fe8715f8a49 | 649957717d58c43b5d8d200da34bf374293fe739 | /src/data/rat/denumerable.lean | 57bf6b06c392502015c0850859e27d588188ede5 | [
"Apache-2.0"
] | permissive | Vtec234/mathlib | b50c7b21edea438df7497e5ed6a45f61527f0370 | fb1848bbbfce46152f58e219dc0712f3289d2b20 | refs/heads/master | 1,592,463,095,113 | 1,562,737,749,000 | 1,562,737,749,000 | 196,202,858 | 0 | 0 | Apache-2.0 | 1,562,762,338,000 | 1,562,762,337,000 | null | UTF-8 | Lean | false | false | 1,061 | lean | /-
Copyright (c) 2019 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Chris Hughes
-/
import data.rat.basic set_theory.cardinal
namespace rat
open denumerable
instance : infinite ℚ :=
infinite.of_injective (coe : ℕ → ℚ) nat.cast_injective
private def de... |
a4226735d4d4bc08f48a25c8f9649c051930ce91 | a46270e2f76a375564f3b3e9c1bf7b635edc1f2c | /4.6.5.lean | 9ea4ba61ba79967e488d7b872f04713fb1623859 | [
"CC0-1.0"
] | permissive | wudcscheme/lean-exercise | 88ea2506714eac343de2a294d1132ee8ee6d3a20 | 5b23b9be3d361fff5e981d5be3a0a1175504b9f6 | refs/heads/master | 1,678,958,930,293 | 1,583,197,205,000 | 1,583,197,205,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,727 | lean | open classical
variables (α : Type) (p q : α → Prop)
variable a : α
variable r : Prop
example : (∃ x : α, r) → r :=
assume h: (∃ x: α, r),
match h with ⟨w, hr⟩ := hr end
example : r → (∃ x : α, r) :=
assume hr: r,
⟨a, hr⟩
example : (∃ x, p x ∧ r) ↔ (∃ x, p x) ∧ r := ⟨
assume h: (∃ x, p x ... |
ab543f5a0e3934db261d3b9efe67a32acf7f0e59 | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /src/data/nat/modeq.lean | 6bd6fe2e85b00a11e87513b90b6ae88a8343dccc | [
"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 | 15,690 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.int.gcd
import data.list.rotate
import tactic.abel
/-!
# Congruences modulo a natural number
This file defines the equivalence relation `a ≡ b [MOD n]` ... |
d94a1aa35904eee955d4f879ec265652430a24af | ae9f8bf05de0928a4374adc7d6b36af3411d3400 | /src/formal_ml/probability_space.lean | 54085388460231869f584107918336d0173d1c55 | [
"Apache-2.0"
] | permissive | NeoTim/formal-ml | bc42cf6beba9cd2ed56c1cd054ab4eb5402ed445 | c9cbad2837104160a9832a29245471468748bb8d | refs/heads/master | 1,671,549,160,900 | 1,601,362,989,000 | 1,601,362,989,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 50,807 | 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... |
7d3c6754ec65ccc5afc6ffecd1da2a5e4864ed40 | dd4e652c749fea9ac77e404005cb3470e5f75469 | /src/string.lean | 2af8245ac07ef151689363e672a135241912a444 | [] | no_license | skbaek/cvx | e32822ad5943541539966a37dee162b0a5495f55 | c50c790c9116f9fac8dfe742903a62bdd7292c15 | refs/heads/master | 1,623,803,010,339 | 1,618,058,958,000 | 1,618,058,958,000 | 176,293,135 | 3 | 2 | null | null | null | null | UTF-8 | Lean | false | false | 256 | lean | namespace string
def resize_core : nat → list char → list char
| 0 _ := []
| k [] := list.repeat ' ' k
| (k+1) (c::cs) := c::(resize_core k cs)
def resize (k : nat) (s : string) : string :=
⟨resize_core k s.data⟩
end string |
9c1db62413e6de06b1852af6bd631c73fb63afca | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/data/bundle.lean | 30eb9875bdb20be193eb1c5ceeb4314aa6ddf652 | [
"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 | 5,134 | lean | /-
Copyright © 2021 Nicolò Cavalleri. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nicolò Cavalleri
-/
import tactic.basic
import algebra.module.basic
/-!
# Bundle
Basic data structure to implement fiber bundles, vector bundles (maybe fibrations?), etc. This file
s... |
9da3268d38b82f4474765ac33feb4fcce9b92b01 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/ring_theory/free_comm_ring.lean | a6b8ee2fced5e18e246be370695090a5d40d31b6 | [
"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 | 14,500 | lean | /-
Copyright (c) 2019 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Johan Commelin
-/
import data.equiv.functor
import data.mv_polynomial.equiv
import data.mv_polynomial.comm_ring
import ring_theory.free_ring
import deprecated.ring
/-!
# Free co... |
160c69d4ca5a339441cf2c209f42cd8ab0a488b7 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /hott/homotopy/EM.hlean | d17c0a906f524796d093bbdbfdd1425710981b6e | [
"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 | 11,783 | hlean | /-
Copyright (c) 2016 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
Eilenberg MacLane spaces
-/
import hit.groupoid_quotient .hopf .freudenthal .homotopy_group
open algebra pointed nat eq category group algebra is_trunc iso pointe... |
9ed9c58dac6bbe5a559f4d53e609b8457f5f76dc | 4727251e0cd73359b15b664c3170e5d754078599 | /src/data/list/of_fn.lean | 6e1e9563a30fdba7470ced1a77235d11b22bbc3c | [
"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 | 4,088 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.fin.basic
import data.list.basic
/-!
# Lists from functions
Theorems and lemmas for dealing with `list.of_fn`, which converts a function on `fin n` to a... |
18198986bcaaf243559b94ceee66b16878defe48 | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /stage0/src/Init/Data/Float.lean | 9664fedc4a3875ae4bc89614a8a3788a6c2fbf66 | [
"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 | 4,558 | 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
-/
prelude
import Init.Core
import Init.Data.Int.Basic
import Init.Data.ToString.Basic
structure FloatSpec where
float : Type
val : float
lt : floa... |
cc0f3abe755fee02645aa928252c12566dfeae4a | e514e8b939af519a1d5e9b30a850769d058df4e9 | /src/tactic/rewrite_search/core/engine.lean | 28b2b572947e594323224be728b62ec08d2ffcfa | [] | no_license | semorrison/lean-rewrite-search | dca317c5a52e170fb6ffc87c5ab767afb5e3e51a | e804b8f2753366b8957be839908230ee73f9e89f | refs/heads/master | 1,624,051,754,485 | 1,614,160,817,000 | 1,614,160,817,000 | 162,660,605 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 11,410 | lean | import tactic.rewrite_search.discovery.collect
import lib.string
import .types
import .debug
import .backtrack
import .explain
universe u
namespace tactic.rewrite_search
variables {α β γ δ : Type} (i : inst α β γ δ) (g : search_state α β γ δ) (m : metric α β γ δ)
private meta def chop : list char → list string → ... |
30e0bd1d3e77a330e5728e9e97c06fffc1f58b7d | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/ring_theory/noetherian.lean | a0067dc2d6d6f95ccb888b5f7687fb666fdd6597 | [
"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 | 22,602 | lean | /-
Copyright (c) 2018 Mario Carneiro, Kevin Buzzard. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Kevin Buzzard
-/
import algebra.algebra.subalgebra.basic
import algebra.algebra.tower
import algebra.ring.idempotents
import group_theory.finiteness
impo... |
0f4a5416b04f2681f2ab01cf4c8ebb0e3ab5baeb | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tests/lean/substBadMotive.lean | 30ccdfae5b00596b0fe0d34fac9fdf45be3f07cb | [
"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,606 | lean | namespace Ex1
variable (a : Nat) (i : Fin a) (h : 1 = a)
example : i < a := h ▸ i.2 -- `▸` uses `subst` here
end Ex1
namespace Ex2
def heapifyDown' (a : Array α) (i : Fin a.size) : Array α := sorry
def heapifyDown (a : Array α) (i : Fin a.size) : Array α :=
heapifyDown' a ⟨i.1, a.size_swap i i ▸ i.2⟩ -- Error, f... |
92529c1b2d6fbcdf22b68d3141213915f272bce2 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebra/big_operators/finprod.lean | 4e2771dd7af7e89879242d272e8de45b7685fec9 | [
"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 | 48,485 | lean | /-
Copyright (c) 2020 Kexing Ying and Kevin Buzzard. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kexing Ying, Kevin Buzzard, Yury Kudryashov
-/
import algebra.big_operators.order
import algebra.indicator_function
/-!
# Finite products and sums over types and sets
... |
1c32be2d7c9c5dd90590ad1253ab456f2d18622e | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/algebra/star/module.lean | ca4b31001dbc4d61194dab2ba1e376aa47a23bfb | [
"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 | 1,389 | lean | /-
Copyright (c) 2021 Eric Wieser. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Eric Wieser, Frédéric Dupuis
-/
import algebra.star.basic
import data.equiv.module
/-!
# The star operation, bundled as a star-linear equiv
We define `star_linear_equiv`, which is the s... |
930abfe06f19a7e6fb1bd174de9ace0227da5f1d | 874a8d2247ab9a4516052498f80da2e32d0e3a48 | /IVT_attempt.lean | 3cb0caffa73bbddd981626d5fb20fe9f47e54457 | [] | no_license | AlexKontorovich/Spring2020Math492 | 378b36c643ee029f5ab91c1677889baa591f5e85 | 659108c5d864ff5c75b9b3b13b847aa5cff4348a | refs/heads/master | 1,610,780,595,457 | 1,588,174,859,000 | 1,588,174,859,000 | 243,017,788 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 1,698 | lean | import
data.real.basic
data.set.basic
order.basic
topology.algebra.continuous_functions
analysis.normed_space.basic
topology.metric_space.lipschitz
tactic.tfae
order.liminf_limsup
order.complete_lattice
data.set.intervals
topology.algebra.group
order.conditionally_complete_lattice
order.complete_lattice
o... |
c8f1aaf79730f6c55937d0e9b1f539ea56935514 | ed27983dd289b3bcad416f0b1927105d6ef19db8 | /src/inClassNotes/dihedral_group.lean | 3f9895c6b1b3e5ad3426d6da6a5648903920ae58 | [] | no_license | liuxin-James/complogic-s21 | 0d55b76dbe25024473d31d98b5b83655c365f811 | 13e03e0114626643b44015c654151fb651603486 | refs/heads/master | 1,681,109,264,463 | 1,618,848,261,000 | 1,618,848,261,000 | 337,599,491 | 0 | 0 | null | 1,613,141,619,000 | 1,612,925,555,000 | null | UTF-8 | Lean | false | false | 1,329 | lean | import algebra
#check monoid
namespace hidden
inductive Action_D4 : Type
| R0
| R90
| R180
| R270
| H
| V
| D
| D'
open Action_D4
#check Action_D4
def comp: Action_D4 → Action_D4 → Action_D4
| R0 b := b
| b R0 := b
| R90 R90 := R180
| R90 R180 := R270
| R90 R270 := R0
| R90 H:= D'
| R90 V:= D
| R90 D:= H
| R90 D':... |
a3b9b3abca2dae518eb743e8b79c9de796e3889d | 4727251e0cd73359b15b664c3170e5d754078599 | /src/measure_theory/decomposition/lebesgue.lean | c474ed9d9fde2040852fca017c72b0a8427f3533 | [
"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 | 65,112 | lean | /-
Copyright (c) 2021 Kexing Ying. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kexing Ying
-/
import measure_theory.measure.complex
import measure_theory.measure.sub
import measure_theory.decomposition.jordan
import measure_theory.measure.with_density_vector_measure... |
288f8e34244f61b66201ce80879e00cc7d9ea244 | 843cffbd2a25fd01677509247a92e9e8b33bec48 | /equiv_rel_challenge.lean | b552936de5044a6ed2483e149b8f281f56216e12 | [] | no_license | AlexandruBosinta/MyLeanPlayground | 9a78eba4a5c7a2b82edf84e1794a966f53f06c4f | 5dc50a590d784bfc27e7fb37b6361a6dcc1b2790 | refs/heads/master | 1,586,230,010,351 | 1,542,487,422,000 | 1,542,487,422,000 | 158,016,626 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 503 | lean | definition cong_mod_n (n a b : ℤ) := ∃ k : ℤ, n * k = a - b
theorem cong_mod_n_equiv : ∀ (n : ℕ), equivalence (cong_mod_n n) := λ n,
⟨λ a, ⟨0, by rw [mul_zero, sub_eq_add_neg, add_neg_self]⟩, λ x y h, exists.elim h
(λ a cong, ⟨-a, by rw [←neg_mul_eq_mul_neg, cong, neg_sub]⟩), λ x y z hxy hyz, exists.elim hxy
(λ ... |
dfa62402109b50e56a8ed47288ddd5202b28d88a | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tests/lean/run/isDefEqIssue.lean | 1a7c9e97269915ca0d6bb8c84f343982575c8708 | [
"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 | 192 | lean | constant getA (s : String) : Array String := #[]
private def resolveLValAux (s : String) (i : Nat) : Nat :=
let s1 := s
let as := getA s1
if h : i < as.size then
i - 1
else
i
|
9bfa6bf7973f4621bf84b5923d99c108f29fb223 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/repeat_tac.lean | 19008f635b54a59baf2819c6e759f6419d00c95f | [
"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 | 150 | lean | example (p q r s : Prop) : p → q → r → s → (p ∧ q) ∧ (r ∧ s ∧ p) ∧ (p ∧ r ∧ q) :=
by intros; repeat { constructor }; assumption
|
a632c0c9504b244458b3b215befb93c60335c6db | 78630e908e9624a892e24ebdd21260720d29cf55 | /src/logic_propositional/prop_14.lean | 4c48f8632c2f5f30cd0e54d4356f58622e20d853 | [
"CC0-1.0"
] | permissive | tomasz-lisowski/lean-logic-examples | 84e612466776be0a16c23a0439ff8ef6114ddbe1 | 2b2ccd467b49c3989bf6c92ec0358a8d6ee68c5d | refs/heads/master | 1,683,334,199,431 | 1,621,938,305,000 | 1,621,938,305,000 | 365,041,573 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 358 | lean | namespace prop_14
variables A B C : Prop
theorem prop_14 : ((A → C) ∨ (B → C)) → ((A ∧ B) → C) :=
assume h1: ((A → C) ∨ (B → C)),
assume h2: A ∧ B,
have h3: A, from and.left h2,
have h4: B, from and.right h2,
show C, from or.elim h1
(assume h5: A → C,
h5 h3)
(assume h6: B → C,
h6 h4)
-- end namespa... |
115cce1594a69cb49f6830789d3ec81c1017d977 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/vmo1.lean | 256f8e4dfc4999513bfd0e39f3a5b859e10f863d | [
"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 | 136 | lean | meta def cheese : string := "edam"
meta def fromage : string := "comte"
#eval cheese
attribute [vm_override fromage] cheese
#eval cheese |
164e3937fc8a1e0b45076792c7e1c2460f53962a | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/analysis/normed_space/finite_dimension.lean | 5904e6ee3c44fc505a20bffe8487fe10f86d22d5 | [
"Apache-2.0"
] | permissive | agjftucker/mathlib | d634cd0d5256b6325e3c55bb7fb2403548371707 | 87fe50de17b00af533f72a102d0adefe4a2285e8 | refs/heads/master | 1,625,378,131,941 | 1,599,166,526,000 | 1,599,166,526,000 | 160,748,509 | 0 | 0 | Apache-2.0 | 1,544,141,789,000 | 1,544,141,789,000 | null | UTF-8 | Lean | false | false | 12,222 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import analysis.normed_space.operator_norm
import linear_algebra.finite_dimensional
import tactic.omega
/-!
# Finite dimensional normed spaces over complete fi... |
d945ca9a3c89eec865748eb597901f2c8a3e726d | 86f6f4f8d827a196a32bfc646234b73328aeb306 | /examples/logic/unnamed_1211.lean | 67521edac490e59fbfc8b44ecf859be1744a8be4 | [] | 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 | 103 | lean | import data.real.basic
-- BEGIN
example (x : ℝ) (h : ∀ ε > 0, x ≤ ε) : x ≤ 0 :=
sorry
-- END |
04511e4d1a33e840b9fec334c7f36d76af377021 | caa1512363b76923d0e9cdb716122a5c26c3c6bc | /src/eigenvectors/linear_combination.lean | 24e0116d42aa7a19b28b20fb8e4ba7a13b2e6b77 | [] | no_license | apurvanakade/cvx | deb20e425ce478159a98e1ffc0d37f9c88a89280 | b47784831339df5a3e45f5cddd84edc545f95808 | refs/heads/master | 1,687,403,288,536 | 1,555,930,740,000 | 1,555,930,740,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 11,112 | lean | /-
Linear combinations with duplicates
-/
import linear_algebra.basic
noncomputable theory
open classical function lattice
local attribute [instance] prop_decidable
/-- linear combinations over an indexed family -/
@[reducible] def lc (ι : Type*) (α : Type*) (β : Type*) [has_zero α] (v : ι → β) := ι →₀ α
namespace l... |
00a18c75d48b743729983577c92fcc407d67ce21 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/multiConstantError.lean | 42aeda8a0d9f316d5339edc8c574450bbea74be4 | [
"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 | 49 | lean | opaque a b c : Nat
opaque a α β : β → Bool
|
23005d7a41a377b6f7e7a5aab8624f41870e4163 | 626e312b5c1cb2d88fca108f5933076012633192 | /src/topology/instances/ennreal.lean | bdab0192891ea10f6b8bd3a6c18f532751077788 | [
"Apache-2.0"
] | permissive | Bioye97/mathlib | 9db2f9ee54418d29dd06996279ba9dc874fd6beb | 782a20a27ee83b523f801ff34efb1a9557085019 | refs/heads/master | 1,690,305,956,488 | 1,631,067,774,000 | 1,631,067,774,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 54,925 | 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
/-!
# Extended non-negative reals
-/
noncomputable theory
open classical set filter m... |
a7a034cc4ef9498878d175466b6d238200be7a6a | 367134ba5a65885e863bdc4507601606690974c1 | /src/algebra/lie/ideal_operations.lean | 4c84ac9b87e211da9543b458ca30748c6ad0b202 | [
"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 | 11,307 | 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.submodule
/-!
# Ideal operations for Lie algebras
Given a Lie module `M` over a Lie algebra `L`, there is a natural action of the Lie ideals of `L`
on ... |
962728f23eb788f2ff69563a2ec7ff28a7415c95 | 46125763b4dbf50619e8846a1371029346f4c3db | /src/data/set/countable.lean | 26b62d263714161cec046c099f3465d0ae181e4a | [
"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 | 8,080 | 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
Countable sets.
-/
import data.equiv.list data.set.finite logic.function data.set.function
noncomputable theory
open function set encodable
open classical (hiding som... |
6b0f4374d8d52bcd1ef860e064a90d3e7b1c38f3 | 57fdc8de88f5ea3bfde4325e6ecd13f93a274ab5 | /analysis/topology/topological_space.lean | 19ea74ba50cc5f5e253190fd8566de28af95c446 | [
"Apache-2.0"
] | permissive | louisanu/mathlib | 11f56f2d40dc792bc05ee2f78ea37d73e98ecbfe | 2bd5e2159d20a8f20d04fc4d382e65eea775ed39 | refs/heads/master | 1,617,706,993,439 | 1,523,163,654,000 | 1,523,163,654,000 | 124,519,997 | 0 | 0 | Apache-2.0 | 1,520,588,283,000 | 1,520,588,283,000 | null | UTF-8 | Lean | false | false | 50,473 | 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
Theory of topological spaces.
Parts of the formalization is based on the books:
N. Bourbaki: General Topology
I. M. James: Topologies and Uniformit... |
dc267467a8cf20bebe724b2cdd21eb0397719b4f | 4727251e0cd73359b15b664c3170e5d754078599 | /src/set_theory/cardinal/finite.lean | 31afa0177383ebe19bf2767edd5dda8bd46315a1 | [
"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 | 1,327 | 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 set_theory.cardinal.basic
/-!
# Finite Cardinality Functions
## Main Definitions
* `nat.card α` is the cardinality of `α` as a natural number.
If `α` is i... |
dc0fc3148e9673aa5b237966873bbdf86d11caff | efa51dd2edbbbbd6c34bd0ce436415eb405832e7 | /20150803_CADE/examples/ex5.lean | bfa6e974a645f8ecb48343441193677d5c622b43 | [
"Apache-2.0"
] | permissive | leanprover/presentations | dd031a05bcb12c8855676c77e52ed84246bd889a | 3ce2d132d299409f1de269fa8e95afa1333d644e | refs/heads/master | 1,688,703,388,796 | 1,686,838,383,000 | 1,687,465,742,000 | 29,750,158 | 12 | 9 | Apache-2.0 | 1,540,211,670,000 | 1,422,042,683,000 | Lean | UTF-8 | Lean | false | false | 585 | lean | open nat
inductive list (A : Type) :=
| nil {} : list A
| cons : A → list A → list A
open list
infixr `::` := cons
check 1 :: 2 :: nil
variable {A : Type}
definition append : list A → list A → list A
| nil ys := ys
| (x::xs) ys := x :: append xs ys
infix `++` := append
eval (1::nil) ++ (2::3::nil)
theore... |
2c7c5456e98b889c881585e87ca4a6f3a9518941 | 88fb7558b0636ec6b181f2a548ac11ad3919f8a5 | /tests/lean/quote_error_pos.lean | d4810fe782ef30beb917f6b5987f7dd136e219a3 | [
"Apache-2.0"
] | permissive | moritayasuaki/lean | 9f666c323cb6fa1f31ac597d777914aed41e3b7a | ae96ebf6ee953088c235ff7ae0e8c95066ba8001 | refs/heads/master | 1,611,135,440,814 | 1,493,852,869,000 | 1,493,852,869,000 | 90,269,903 | 0 | 0 | null | 1,493,906,291,000 | 1,493,906,291,000 | null | UTF-8 | Lean | false | false | 362 | lean | open tactic
meta def apply_zero_add (a : pexpr) : tactic unit :=
to_expr `(zero_add %%a) >>= exact
example (a : nat) : 0 + a = a :=
begin
apply_zero_add `(tt), -- Error should be here
end
meta def apply_zero_add2 (a : pexpr) : tactic unit :=
`[apply zero_add %%a]
example (a : nat) : 0 + a = a :=
begin
apply_zer... |
ce94368f46259101f4c3abd3281c248796d0bb2c | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/ring_theory/noetherian_auto.lean | 1a520403790234ea8067924cb6bb6c06a2074a5d | [] | 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 | 16,320 | lean | /-
Copyright (c) 2018 Mario Carneiro and Kevin Buzzard. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Kevin Buzzard
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.algebraic_geometry.prime_spectrum
import Mathlib.data.mult... |
8ba57b7b7c2e289d1ff3678e2b68815f4f64748b | 3d2a7f1582fe5bae4d0bdc2fe86e997521239a65 | /spatial-reasoning/spatial-reasoning-problem-12.lean | cebd9865211d3b334edff32a9a2a18bfd5f76e6c | [] | no_license | own-pt/common-sense-lean | e4fa643ae010459de3d1bf673be7cbc7062563c9 | f672210aecb4172f5bae265e43e6867397e13b1c | refs/heads/master | 1,622,065,660,261 | 1,589,487,533,000 | 1,589,487,533,000 | 254,167,782 | 3 | 2 | null | 1,589,487,535,000 | 1,586,370,214,000 | Lean | UTF-8 | Lean | false | false | 215 | lean | /- Spatial Reasoning Problem 12 -/
/- It can be found at: SpatialQs.txt -/
/- (12) Jane is standing in front of John.
A van is parked in front of John.
John cannot see Jane.
Is the van in front of Jane?-/
|
90abfa7a4f4e8edccb382262292633d791a7b470 | 947b78d97130d56365ae2ec264df196ce769371a | /src/Lean/Meta/Match/MVarRenaming.lean | c7f5647ea3ee9bd6ec200a6e9535b00828430171 | [
"Apache-2.0"
] | permissive | shyamalschandra/lean4 | 27044812be8698f0c79147615b1d5090b9f4b037 | 6e7a883b21eaf62831e8111b251dc9b18f40e604 | refs/heads/master | 1,671,417,126,371 | 1,601,859,995,000 | 1,601,860,020,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,024 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Util.ReplaceExpr
namespace Lean
namespace Meta
/- A mapping from MVarId to MVarId -/
structure MVarRenaming :=
(map : NameMap MVarId := {})
d... |
9a3e103d99fb7248500c2f796209af96159b85ce | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/topology/algebra/group.lean | db1f0b8046b37b1f736763013256b6081017eecf | [
"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 | 20,386 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro, Patrick Massot
Theory of topological groups.
-/
import order.filter.pointwise
import group_theory.quotient_group
import topology.algebra.monoid
import... |
ccdeb0bbea254990381eed82d3ae7a84bee44a6a | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/analysis/special_functions/complex/arg.lean | ce2eb9bd195aaa59785b80a3a40aff6bea34faad | [
"Apache-2.0"
] | permissive | ramonfmir/mathlib | c5dc8b33155473fab97c38bd3aa6723dc289beaa | 14c52e990c17f5a00c0cc9e09847af16fabbed25 | refs/heads/master | 1,661,979,343,526 | 1,660,830,384,000 | 1,660,830,384,000 | 182,072,989 | 0 | 0 | null | 1,555,585,876,000 | 1,555,585,876,000 | null | UTF-8 | Lean | false | false | 25,317 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Abhimanyu Pallavi Sudhir, Jean Lo, Calle Sönne, Benjamin Davidson
-/
import algebra.order.to_interval_mod
import analysis.special_functions.trigonometric.angle
import analy... |
e2e635503ac871ce1457b38303d7d688e4e1ec87 | b2e508d02500f1512e1618150413e6be69d9db10 | /src/data/fintype.lean | c6d9898285c33c2af3d8096ae54472c009c0fc7a | [
"Apache-2.0"
] | permissive | callum-sutton/mathlib | c3788f90216e9cd43eeffcb9f8c9f959b3b01771 | afd623825a3ac6bfbcc675a9b023edad3f069e89 | refs/heads/master | 1,591,371,888,053 | 1,560,990,690,000 | 1,560,990,690,000 | 192,476,045 | 0 | 0 | Apache-2.0 | 1,568,941,843,000 | 1,560,837,965,000 | Lean | UTF-8 | Lean | false | false | 30,849 | 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 data.finset algebra.big_operators data.array.lemmas
universes u v
variables {α : Type*} {β : Type*} {γ : Type*}
/-- `fintype α` means that `α` ... |
b8832bc8d80a393e641221e1ac388aa68202b88e | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/category_theory/limits/preserves/basic.lean | 82dc5430cca2f7973eb9c805fe92a7645b510ac6 | [
"Apache-2.0"
] | permissive | agjftucker/mathlib | d634cd0d5256b6325e3c55bb7fb2403548371707 | 87fe50de17b00af533f72a102d0adefe4a2285e8 | refs/heads/master | 1,625,378,131,941 | 1,599,166,526,000 | 1,599,166,526,000 | 160,748,509 | 0 | 0 | Apache-2.0 | 1,544,141,789,000 | 1,544,141,789,000 | null | UTF-8 | Lean | false | false | 16,093 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Reid Barton, Bhavik Mehta
-/
import category_theory.limits.limits
/-!
# Preservation and reflection of (co)limits.
There are various distinct notions of "preserving l... |
86f10cbe5c8d5569aa14cbd9359d2af47432e2c3 | 367134ba5a65885e863bdc4507601606690974c1 | /test/monotonicity/test_cases.lean | e17a5e5f3b7d9319fc5a96fe44847c0fc3b1cc62 | [
"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,124 | lean | /-
Copyright (c) 2019 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Simon Hudon
-/
import tactic.monotonicity.interactive
open list tactic tactic.interactive
meta class elaborable (α : Type) (β : out_param Type) :=
(elaborate : α → tactic β)
export el... |
9b4a04b8807dcfaa027e7c4b98f9fcfc4412cb3f | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/analysis/p_series_auto.lean | 9c537efb4f824213f49c759406d718708d8bf079 | [] | 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 | 6,098 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Yury G. Kudryashov
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.analysis.special_functions.pow
import Mathlib.PostPort
universes u_1
namespace Ma... |
26c53527cb1eda6196d4cd9fcc6139ecd95f92de | 037dba89703a79cd4a4aec5e959818147f97635d | /src/2019/questions/sheet2.lean | a3e61986419e149d88d3585926dff54e30a8ff57 | [] | no_license | ImperialCollegeLondon/M40001_lean | 3a6a09298da395ab51bc220a535035d45bbe919b | 62a76fa92654c855af2b2fc2bef8e60acd16ccec | refs/heads/master | 1,666,750,403,259 | 1,665,771,117,000 | 1,665,771,117,000 | 209,141,835 | 115 | 12 | null | 1,640,270,596,000 | 1,568,749,174,000 | Lean | UTF-8 | Lean | false | false | 3,513 | lean | /- Math40001 : Introduction to university mathematics.
Problem Sheet 2, October 2019.
This is a Lean file. It can be read with the Lean theorem prover.
You can work on this file online at
https://tinyurl.com/Lean-M40001-Example-Sheet-2
or you can install Lean and its maths library following the
instructions at
ht... |
a28077c096fcb16474ff871e104e6b2e7f7cea34 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/fail/non_meta_rec_fn.lean | dcdbf0ff24191a08212361a307aac1d0c475dc7a | [
"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 | 109 | lean | lemma main : false :=
begin
have helper : true → false := λ ⟨⟩, _fun_match _x,
exact helper ⟨⟩
end |
aff406750fd257ef2c3eedf13dd4c164e14c431c | 592ee40978ac7604005a4e0d35bbc4b467389241 | /Library/generated/mathscheme-lean/MedialMagma.lean | c63c3eff44480648c626fcdcceeb29bc35a1d837 | [] | 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,875 | 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 MedialMagma
structure MedialMagma (A : Type) : Type :=
(op : (A → (A → A)))
(mediates : (∀ {w x y z : A} , (op (op x y) (op z w)) = (op (op x z) (op y w))))
... |
a2ab71a2c7d14ae6bd8b9163923c9fec884bb7fb | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /tests/lean/run/rational.lean | 9855253fdcd67797984ee1a765b8655ca9c894b9 | [
"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 | 586 | lean | structure Rat where
num : Int
den : Nat
pos : den > 0
instance (n : Nat) : OfNat Rat n where
ofNat := {
num := n
den := 1
pos := decide!
}
instance : Add Rat where
add a b := {
num := a.num * b.den + b.num * a.den
den := a.den * b.den
pos := sorry
}
instance : Coe Int Rat where
... |
f09088cdd914a1a832680d61dd8b319adafa5332 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/analysis/quaternion.lean | edf0e50c73d874d3aa38cdb56708f8ed2a84f987 | [
"Apache-2.0"
] | permissive | robertylewis/mathlib | 3d16e3e6daf5ddde182473e03a1b601d2810952c | 1d13f5b932f5e40a8308e3840f96fc882fae01f0 | refs/heads/master | 1,651,379,945,369 | 1,644,276,960,000 | 1,644,276,960,000 | 98,875,504 | 0 | 0 | Apache-2.0 | 1,644,253,514,000 | 1,501,495,700,000 | Lean | UTF-8 | Lean | false | false | 3,366 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import algebra.quaternion
import analysis.inner_product_space.basic
/-!
# Quaternions as a normed algebra
In this file we define the following structures on the s... |
990637c896fe71ed662c6f2dee5ca5dac19bf799 | 22e97a5d648fc451e25a06c668dc03ac7ed7bc25 | /src/data/equiv/ring.lean | 5557539ed8c45bbd5c1aca170be37d05dec0a241 | [
"Apache-2.0"
] | permissive | keeferrowan/mathlib | f2818da875dbc7780830d09bd4c526b0764a4e50 | aad2dfc40e8e6a7e258287a7c1580318e865817e | refs/heads/master | 1,661,736,426,952 | 1,590,438,032,000 | 1,590,438,032,000 | 266,892,663 | 0 | 0 | Apache-2.0 | 1,590,445,835,000 | 1,590,445,835,000 | null | UTF-8 | Lean | false | false | 9,533 | 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 deprecated.ring
/-!
# (Semi)ring equivs
In this file we define extension of `e... |
39517098e37d536be3d1f5ae0dc7430c926b0f7a | b7f22e51856f4989b970961f794f1c435f9b8f78 | /library/data/hlist.lean | 71543d8455fca2fa4e1272a974bea52c9ddc51b0 | [
"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 | 2,706 | 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
Heterogeneous lists
-/
import data.list logic.cast
open list
inductive hlist {A : Type} (B : A → Type) : list A → Type :=
| nil {} : hlist B []
| cons : ∀ {... |
460f6bacf1e6b737248deb01a266120182d6eda1 | 82b86ba2ae0d5aed0f01f49c46db5afec0eb2bd7 | /tests/lean/run/letrecInProofs.lean | 066f8fa600e6b78b46766f15665bdd9171a5036e | [
"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 | 2,727 | lean | import Lean
inductive Tree
| leaf : Tree
| node : Tree → Tree → Tree
abbrev notSubtree (x : Tree) (t : Tree) : Prop :=
Tree.ibelow (motive := fun z => x ≠ z) t
infix:50 "≮" => notSubtree
theorem Tree.acyclic (x t : Tree) : x = t → x ≮ t := by
let rec right (x s : Tree) (b : Tree) (h : x ≮ b) : node s x ≠ b ... |
13fda084411601c1cd96a957231a38cc719a57d2 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/ring_theory/polynomial/selmer.lean | f8ba5e77ea676df2a12c32686cb9d65cbd9e3a57 | [
"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,441 | lean | /-
Copyright (c) 2022 Thomas Browning. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Thomas Browning
-/
import data.polynomial.unit_trinomial
import tactic.linear_combination
/-!
# Irreducibility of Selmer Polynomials
This file proves irreducibility of the Selmer p... |
7ab62e68fb1c46af5223161c4c0038bed3412e13 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/decEq.lean | aa2ed2d1a6d88bc82fb8629be41d1c1d3d689330 | [
"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 | 457 | lean | inductive Vec (α : Type u) : Nat → Type u
| nil : Vec α 0
| cons : α → {n : Nat} → Vec α n → Vec α (n+1)
deriving DecidableEq
inductive Test (α : Type)
| mk₀
| mk₁ : (n : Nat) → (α × α) → List α → Vec α n → Test α
| mk₂ : Test α → α → Test α
deriving DecidableEq
def t1 [DecidableEq α] : DecidableEq (Ve... |
e9c0208c749e638759ec6ff4031162200b41e325 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/euclidean_domain/basic.lean | 026e3911720ba5a1a847fbb306c712c409510a0d | [
"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 | 10,205 | lean | /-
Copyright (c) 2018 Louis Carlin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Louis Carlin, Mario Carneiro
-/
import algebra.euclidean_domain.defs
import algebra.ring.divisibility
import algebra.ring.regular
import algebra.group_with_zero.divisibility
import algeb... |
346ff280e3471f451e244f5f16ae2dad15cbf559 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/data/bool.lean | 8448a50c3fd7dcad02b5f0c674db330662d195e6 | [
"Apache-2.0"
] | permissive | AntoineChambert-Loir/mathlib | 64aabb896129885f12296a799818061bc90da1ff | 07be904260ab6e36a5769680b6012f03a4727134 | refs/heads/master | 1,693,187,631,771 | 1,636,719,886,000 | 1,636,719,886,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,977 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Jeremy Avigad
-/
/-!
# booleans
This file proves various trivial lemmas about booleans and their
relation to decidable propositions.
## Notations
This fil... |
aed0122f6f1bfeb6eae24e62fc6dab9892caa915 | 94096349332b0a0e223a22a3917c8f253cd39235 | /src/game/world1/level4.lean | 159eecbe7f1c119ff11649f7702dd475e83b1fe2 | [] | no_license | robertylewis/natural_number_game | 26156e10ef7b45248549915cc4d1ab3d8c3afc85 | b210c05cd627242f791db1ee3f365ee7829674c9 | refs/heads/master | 1,598,964,725,038 | 1,572,602,236,000 | 1,572,602,236,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,144 | lean | import mynat.add -- definition of addition
namespace mynat -- hide
/-
# World 1 : Tutorial world
## Level 4: addition
We have a new import -- the definition of addition.
Peano defined addition `a + b` by induction on `b`, or,
more precisely, by *recursion* on `b`. He first explained how to add 0 to a number:
this i... |
767ffcbe6463b0058ea343205c7dcdbf4aa9a42a | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch3/ex0402.lean | 1f683c0f132ec6af306d82c54d35497117db43d3 | [] | no_license | Ailrun/Theorem_Proving_in_Lean | ae6a23f3c54d62d401314d6a771e8ff8b4132db2 | 2eb1b5caf93c6a5a555c79e9097cf2ba5a66cf68 | refs/heads/master | 1,609,838,270,467 | 1,586,846,743,000 | 1,586,846,743,000 | 240,967,761 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 158 | lean | variables p q : Prop
example (h : p ∧ q) : q ∧ p :=
have hp : p, from and.left h,
suffices hq : q, from and.intro hq hp,
show q, from and.right h
|
1d342e52a3e4574d4a746c3f26bddaf3ef0b3712 | 88fb7558b0636ec6b181f2a548ac11ad3919f8a5 | /library/init/data/nat/lemmas.lean | 61982643a7895c717ea920a6e8cf5edf3ad06a22 | [
"Apache-2.0"
] | permissive | moritayasuaki/lean | 9f666c323cb6fa1f31ac597d777914aed41e3b7a | ae96ebf6ee953088c235ff7ae0e8c95066ba8001 | refs/heads/master | 1,611,135,440,814 | 1,493,852,869,000 | 1,493,852,869,000 | 90,269,903 | 0 | 0 | null | 1,493,906,291,000 | 1,493,906,291,000 | null | UTF-8 | Lean | false | false | 36,916 | 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, Jeremy Avigad
-/
prelude
import init.data.nat.basic init.data.nat.div init.data.nat.pow init.meta init.algebra.functions
namespace nat
attribute [pre_smt] na... |
62ca25984f2adcd9d7de9a2fc3daca35ad53a2ac | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/ring_theory/algebraic.lean | 46567de090a3e881b298b394667f2097c9300899 | [
"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 | 17,650 | lean | /-
Copyright (c) 2019 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import linear_algebra.finite_dimensional
import ring_theory.integral_closure
import data.polynomial.integral_normalization
/-!
# Algebraic elements and algebraic ex... |
7d6a54f8f2739d92932b296e8dca7d4747d49025 | 9b9a16fa2cb737daee6b2785474678b6fa91d6d4 | /src/category_theory/fully_faithful.lean | 07aaf23bc1b37c7b046d0066617956d10f4156da | [
"Apache-2.0"
] | permissive | johoelzl/mathlib | 253f46daa30b644d011e8e119025b01ad69735c4 | 592e3c7a2dfbd5826919b4605559d35d4d75938f | refs/heads/master | 1,625,657,216,488 | 1,551,374,946,000 | 1,551,374,946,000 | 98,915,829 | 0 | 0 | Apache-2.0 | 1,522,917,267,000 | 1,501,524,499,000 | Lean | UTF-8 | Lean | false | false | 2,820 | lean | -- Copyright (c) 2018 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Scott Morrison
import category_theory.isomorphism
universes v₁ v₂ v₃ u₁ u₂ u₃ -- declare the `v`'s first; see `category_theory.category` for an explanation
namespace category_... |
cacaff552a31069453b191e252e1caecb36e5950 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/qpf/multivariate/constructions/comp.lean | 696059a149783a2d5ed0133089e40bfeef2e73f6 | [] | 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,128 | lean | /-
Copyright (c) 2018 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad, Simon Hudon
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.pfunctor.multivariate.basic
import Mathlib.data.qpf.multivariate.basic
impor... |
71cdbca7aeaa0dfde17ceb5a810b1ef4e4801349 | 78630e908e9624a892e24ebdd21260720d29cf55 | /src/logic_first_order/fol_07.lean | f7117ee24309bb1f2c2abf26b2c3869616f2efe4 | [
"CC0-1.0"
] | permissive | tomasz-lisowski/lean-logic-examples | 84e612466776be0a16c23a0439ff8ef6114ddbe1 | 2b2ccd467b49c3989bf6c92ec0358a8d6ee68c5d | refs/heads/master | 1,683,334,199,431 | 1,621,938,305,000 | 1,621,938,305,000 | 365,041,573 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 281 | lean | namespace fol_07
variable A : Type
variable R : A → A → Prop
variable hxy : ∀ x y, R x y ∨ R y x
include hxy
theorem fol_07 : ∀ x, R x x :=
assume s,
have h1: R s s ∨ R s s, from hxy s s,
or.elim h1
(assume h2: R s s,
h2)
(assume h3: R s s,
h3)
end fol_07 |
606970a8f22ecdbbb77ccefae6536c34c9bf146b | 5fbbd711f9bfc21ee168f46a4be146603ece8835 | /lean/natural_number_game/function/5.lean | 1780e404acaf86e9f57c97eebae4e13eeb531b05 | [
"LicenseRef-scancode-warranty-disclaimer"
] | no_license | goedel-gang/maths | 22596f71e3fde9c088e59931f128a3b5efb73a2c | a20a6f6a8ce800427afd595c598a5ad43da1408d | refs/heads/master | 1,623,055,941,960 | 1,621,599,441,000 | 1,621,599,441,000 | 169,335,840 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 77 | lean | example (P Q : Type) : P → (Q → P) :=
begin
intros p q,
exact p,
end
|
b535c5ad4767672252419646bbdc3aa8b889c146 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/computability/partrec.lean | db8f468cf94473f8dea84bdd2967ea6a46af910f | [
"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 | 29,044 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import computability.primrec
import data.nat.psub
import data.pfun
/-!
# The partial recursive functions
The partial recursive functions are defined similarly to th... |
240d216671c5de8791a2cfbd6314722fa5a1198f | 7b681d6cc18477cf6b60470d9782923d3ea63915 | /W3-Inductive.lean | d0974af1ae4a17ccb49e8f0e108d85804b4593f0 | [] | no_license | osoulim/LEAN | a7458f597abbe5c36ebbb3f36eab29a4c60f5140 | 5e0dc240e86e392fdab4b2ffdcc3174c0cce7b66 | refs/heads/master | 1,591,850,481,195 | 1,561,547,647,000 | 1,561,547,647,000 | 193,852,039 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 470 | lean | inductive List (α : Type) : Type
| nil : List
| cons : α -> List -> List
notation `[]` := List.nil _
notation a ` :: ` l := List.cons a l
def map {α β} ( f: α -> β ) : List α -> List β
| [] := []
| (a :: l) := f a :: map l
def length {α} : List α -> ℕ
| [] := 0
| (a :: l) := length l + 1
inductive Props: T... |
3b807d1b5117bc1cd6819891850bbf9341a0368c | b0d97c09d47e3b0a68128c64cad26ab132d23108 | /src/analytic.lean | a2a96e356394a797c4061375a7682f06f51b62c7 | [] | no_license | jmvlangen/RIP-seminar | 2ad32c1c6fceb59ac7ae3b2251baf08f4c0c0caa | ed6771404dd4bcec298de2dfdc89d5e9cfd331bb | refs/heads/master | 1,585,865,817,237 | 1,546,865,823,000 | 1,546,865,823,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,656 | lean | import algebra.field algebra.ring
import analysis.normed_space analysis.ennreal
import analysis.topology.infinite_sum
import analysis.complex
/--
- A formal power series over a ring R is a formal expression of the form
-
- ∑ᵢ aᵢ zⁱ
-
- where i ∈ ℕ and aᵢ ∈ R. Thus, the data necessary to specify a formal power
-... |
a4804ec7ee7bc2021402e30d8d0aacec31b20538 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/topology/metric_space/infsep.lean | 3de55c17a31e9efadb96ceb708a7f589df823a59 | [
"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 | 19,165 | lean | /-
Copyright (c) 2022 Wrenna Robson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Wrenna Robson
-/
import topology.metric_space.basic
/-!
# Infimum separation
This file defines the extended infimum separation of a set. This is approximately dual to the
diameter of ... |
508ceb2fa502f93b31af591b757ada894e17b02a | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/combinatorics/simple_graph/strongly_regular.lean | 5f8a7113bd96a7f43f03504d447be4199c8a68be | [
"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 | 7,034 | lean | /-
Copyright (c) 2021 Alena Gusakov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Alena Gusakov
-/
import combinatorics.simple_graph.basic
import data.set.finite
/-!
# Strongly regular graphs
## Main definitions
* `G.is_SRG_with n k ℓ μ` (see `simple_graph.is_SRG_w... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.