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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
6fc5239950b81d2d0a03907d574c4b0df6288dfb | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/fintype/basic.lean | 88ddb700bf59b39f923219defe19c1435d27b2f7 | [
"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 | 39,072 | 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.finset.image
/-!
# Finite types
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding PR to mathlib4.
This file... |
6ac2a7c129261013aa3dfffc81591df20525b322 | 83d56f27a2d4619301ce53e12f816410643fe9fd | /lean/Cyclone_Static_Semantics_Kinding_And_Context_Well_Formedness.lean | 75e91a69773cdff992453c25c237142c028daa42 | [] | no_license | briangmilnes/CycloneCoqSemantics | cad5d09328fd70876d11f79b81d30954c7db6a60 | 190c0fc57d5aebfde244efb06a119f108de7a150 | refs/heads/master | 1,621,135,368,013 | 1,609,910,991,000 | 1,609,910,991,000 | 26,649,090 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,377 | lean | /-
This is the definition of formal syntax for Dan Grossman's Thesis,
"SAFE PROGRAMMING AT THE C LEVEL OF ABSTRACTION".
This defines the static semantics of statements and expressions, pg. 63.
-/
import .Cyclone_Formal_Syntax
import .Environments
/- This is nothing but ok. -/
inductive WFD : Delta → Prop
| em... |
ff9dc957ffb7879d59c0eaacfb385bc363f1264c | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/tactic/itauto.lean | ab0bd666b98b86736aecfe969149fef159e546d8 | [
"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 | 30,323 | lean | /-
Copyright (c) 2021 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import tactic.hint
/-!
# Intuitionistic tautology (`itauto`) decision procedure
The `itauto` tactic will prove any intuitionistic tautology. It implements the well... |
62547d48d946fd5158045f33e31a4c7772314fd9 | 2a70b774d16dbdf5a533432ee0ebab6838df0948 | /_target/deps/mathlib/src/measure_theory/haar_measure.lean | d5c014af2132de99ffebb83274276e3eded7fa59 | [
"Apache-2.0"
] | permissive | hjvromen/lewis | 40b035973df7c77ebf927afab7878c76d05ff758 | 105b675f73630f028ad5d890897a51b3c1146fb0 | refs/heads/master | 1,677,944,636,343 | 1,676,555,301,000 | 1,676,555,301,000 | 327,553,599 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 29,842 | 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.content
import measure_theory.group
/-!
# Haar measure
In this file we prove the existence of Haar measure for a locally compact Hausdorff ... |
8c9b86c2163b66db003516d4849ad9b75611ddac | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Elab/PreDefinition/Structural/SmartUnfolding.lean | 9ee8bbec75372d2bae30b44b8d20f8b253c4c250 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 3,238 | 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.Elab.PreDefinition.Basic
import Lean.Elab.PreDefinition.Structural.Basic
namespace Lean.Elab.Structural
open Meta
partial def addSmartUnfoldin... |
cb090637b0ce3ec49598ea226b55ca57684d59a6 | f3a5af2927397cf346ec0e24312bfff077f00425 | /src/game/world2/level6.lean | bb91442a3c0e2fc4dae9f76abb3c0280c56f4950 | [
"Apache-2.0"
] | permissive | ImperialCollegeLondon/natural_number_game | 05c39e1586408cfb563d1a12e1085a90726ab655 | f29b6c2884299fc63fdfc81ae5d7daaa3219f9fd | refs/heads/master | 1,688,570,964,990 | 1,636,908,242,000 | 1,636,908,242,000 | 195,403,790 | 277 | 84 | Apache-2.0 | 1,694,547,955,000 | 1,562,328,792,000 | Lean | UTF-8 | Lean | false | false | 4,985 | lean | import mynat.definition -- hide
import mynat.add -- hide
import game.world2.level5 -- hide
import tactic.ring -- hide
namespace mynat -- hide
/-
# Addition World
## Level 6: `add_right_comm`
Lean sometimes writes `a + b + c`. What does it mean? The convention is
that if there are no brackets displayed in an addit... |
bbd3fe83bdc391900c02fd56c518fa21ce9a6832 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/data/sym2.lean | 961978d7d4a9428ec239124421f628d004878df6 | [
"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 | 13,884 | lean | /-
Copyright (c) 2020 Kyle Miller All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Kyle Miller.
-/
import tactic.linarith
import data.sym
open function
open sym
/-!
# The symmetric square
This file defines the symmetric square, which is `α × α` modulo
swapping. This i... |
3a247575e848e96fe2de1ee0e9b5aec5da0d42fc | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch6/ex0406.lean | 2f98fa39bc4fb7e77107cd42ddc777b1382cd711 | [] | 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 | 372 | lean | variable {α : Type*}
def is_prefix (l₁ : list α) (l₂ : list α) : Prop :=
∃ t, l₁ ++ t = l₂
def list_has_le : has_le (list α) := ⟨is_prefix⟩
section
local attribute [instance] list_has_le
theorem list.is_prefix_refl (l : list α) : l ≤ l :=
⟨[], by simp⟩
end
-- error:
-- theorem bar (l : list α) : l ≤ l :=... |
1eb210e10d0d3d85c9b1b6fd1923f8fac4308f36 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /library/init/meta/contradiction_tactic.lean | cf56cf665b23731de3c23ac4e95c0062f991ca70 | [
"Apache-2.0"
] | permissive | soonhokong/lean-osx | 4a954262c780e404c1369d6c06516161d07fcb40 | 3670278342d2f4faa49d95b46d86642d7875b47c | refs/heads/master | 1,611,410,334,552 | 1,474,425,686,000 | 1,474,425,686,000 | 12,043,103 | 5 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 2,661 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.meta.tactic init.function
namespace tactic
open expr tactic decidable environment
private meta_definition contra_A_not_A : list expr ... |
c4c3cf24f7008cc4248b7d6a683a246a446dac51 | ec62863c729b7eedee77b86d974f2c529fa79d25 | /7/a.lean | 1b160e6c2a07a25616a3aeb51913892fb3860089 | [] | 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 | 1,309 | lean | import Lean.Util.SCC
import Std.Data.HashMap
def solve (rules : Std.HashMap String (List (Int × String))) : Int := do
let sccs := Lean.SCC.scc (rules.toList.map Prod.fst) (λ bag => (rules.find! bag).map Prod.snd)
-- which bags can reach "shiny gold" after ≥ 0 steps?
let mut valid : Std.HashMap String Bool := Std.HashM... |
cf3bf7a1146daa069177e39fd1b7364560935441 | 367134ba5a65885e863bdc4507601606690974c1 | /archive/imo/imo1987_q1.lean | 587dc285eba7571383419e3eb5c8a912ad04bca3 | [
"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 | 4,117 | lean | /-
Copyright (c) 2021 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Yury Kudryashov
-/
import data.fintype.card
import dynamics.fixed_points.basic
/-!
# Formalization of IMO 1987, Q1
Let $p_{n, k}$ be the number of permutations of a set of cardinalit... |
f1a795d3ca24dd9fe28a97f404c4d8bcaa4c78fd | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/analysis/special_functions/trigonometric/chebyshev.lean | 255c3de11c234912842188097053f9888984da98 | [
"Apache-2.0"
] | permissive | AntoineChambert-Loir/mathlib | 64aabb896129885f12296a799818061bc90da1ff | 07be904260ab6e36a5769680b6012f03a4727134 | refs/heads/master | 1,693,187,631,771 | 1,636,719,886,000 | 1,636,719,886,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,268 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import analysis.special_functions.trigonometric.basic
import ring_theory.polynomial.chebyshev
/-!
# Multiple angle formulas in terms of Chebyshev polynomials
* `pol... |
a766d3a9bb71abc7acc84d5ac7107113a59bbee2 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/1681.lean | e6e36a8300743386fd80d9752cca799f6766d250 | [
"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 | 148 | lean | example : Nat → Nat := by
refine' (fun x => _)
trace_state
sorry
example : Nat → Nat := by
refine' (fun x => ?_)
trace_state
sorry
|
6dd08277fabc94cb4974deb97a06a4c0de98b625 | 32025d5c2d6e33ad3b6dd8a3c91e1e838066a7f7 | /tests/lean/run/meta6.lean | 2749a7572e57ea7b8411f9f98ebcdc344fe1bedf | [
"Apache-2.0"
] | permissive | walterhu1015/lean4 | b2c71b688975177402758924eaa513475ed6ce72 | 2214d81e84646a905d0b20b032c89caf89c737ad | refs/heads/master | 1,671,342,096,906 | 1,599,695,985,000 | 1,599,695,985,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,501 | lean | import Lean.Meta
open Lean
open Lean.Meta
def print (msg : MessageData) : MetaM Unit :=
trace! `Meta.debug msg
def check (x : MetaM Bool) : MetaM Unit :=
unlessM x $ throwError "check failed"
def nat := mkConst `Nat
def boolE := mkConst `Bool
def succ := mkConst `Nat.succ
def zero := mkConst `Nat.zero
def add ... |
f24b87b0193d3c7835567d36f17f620a8d9405c2 | 7b02c598aa57070b4cf4fbfe2416d0479220187f | /algebra/cogroup.hlean | c1256b60fc3b0997b57760331fbb7da93179451a | [
"Apache-2.0"
] | permissive | jdchristensen/Spectral | 50d4f0ddaea1484d215ef74be951da6549de221d | 6ded2b94d7ae07c4098d96a68f80a9cd3d433eb8 | refs/heads/master | 1,611,555,010,649 | 1,496,724,191,000 | 1,496,724,191,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,323 | hlean | import algebra.group_theory ..pointed ..homotopy.smash
open eq pointed algebra group eq equiv is_trunc is_conn prod prod.ops
smash susp unit pushout trunc prod
section
variables {A B C : Type*}
definition prod.pair_pmap (f : C →* A) (g : C →* B)
: C →* A ×* B :=
pmap.mk (λ c, (f c, g c)) (pair_eq (res... |
c2282ee5e8bb69df7ffc86f3ab4aa7ed02c1ecb5 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/blast_cc8.lean | ee05abde1c86195d1cf11469a258f3d556cf92f9 | [
"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 | 1,859 | lean | import data.finset data.set
open set finset
set_option blast.strategy "cc"
structure finite_set [class] {T : Type} (xs : set T) :=
(to_finset : finset T) (is_equiv : to_set to_finset = xs)
definition finset_set.is_subsingleton [instance] (T : Type) (xs : set T) : subsingleton (finite_set xs) :=
begin
constructor, i... |
0e1b56a57316f3fd54c927e6927a2b477bbb0345 | 649957717d58c43b5d8d200da34bf374293fe739 | /src/algebra/group/units_hom.lean | aa754a816dad356706ab00adbcf163b3d6a741f0 | [
"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,174 | lean | /-
Copyright (c) 2018 Johan Commelin All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Chris Hughes, Kevin Buzzard
Lift monoid homomorphisms to group homomorphisms of their units subgroups.
-/
import algebra.group.units algebra.group.hom
namespace units
... |
a9e078644e7a25c4f2b39bab706b252315026e65 | 3dd1b66af77106badae6edb1c4dea91a146ead30 | /tests/lean/crash.lean | 98bcd47c1a1f2de5c48ce0dd080ca0d684ab787e | [
"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 | 148 | lean | import logic
section
hypothesis P : Prop.
theorem crash
:= assume H : P,
have H' : ¬ P,
from H,
_.
|
88b5d42b02cd5d885fb273ffc86f01c10a401486 | 7c92a46ce39266c13607ecdef7f228688f237182 | /src/for_mathlib/topological_groups.lean | 1b901062e5460a5c827c7f619de657dd2d06e0f4 | [
"Apache-2.0"
] | permissive | asym57/lean-perfectoid-spaces | 3217d01f6ddc0d13e9fb68651749469750420767 | 359187b429f254a946218af4411d45f08705c83e | refs/heads/master | 1,609,457,937,251 | 1,577,542,616,000 | 1,577,542,675,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 27,280 | lean | import tactic.abel
import topology.algebra.group
import topology.algebra.uniform_ring
import ring_theory.subring
import for_mathlib.topology
import for_mathlib.filter
import for_mathlib.data.set.basic
import algebra.pointwise
/-
open filter function
universe u
class filter_at_one (α : Type u) [group α] :=
(F : fil... |
c585c0130338a4c9e9eefc069d4ac58b6099d417 | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /src/Lean/Compiler/LCNF/LCtx.lean | 00b92535106b9d8418136da32a18e702062abfc5 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | tobiasgrosser/lean4 | ce0fd9cca0feba1100656679bf41f0bffdbabb71 | ebdbdc10436a4d9d6b66acf78aae7a23f5bd073f | refs/heads/master | 1,673,103,412,948 | 1,664,930,501,000 | 1,664,930,501,000 | 186,870,185 | 0 | 0 | Apache-2.0 | 1,665,129,237,000 | 1,557,939,901,000 | Lean | UTF-8 | Lean | false | false | 2,639 | 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
-/
import Lean.LocalContext
import Lean.Compiler.LCNF.Basic
namespace Lean.Compiler.LCNF
/--
LCNF local context.
-/
structure LCtx where
params : HashMap... |
b6fbe77fb421eac61c53aac793fed22a774da428 | fe84e287c662151bb313504482b218a503b972f3 | /src/combinatorics/triangle_count.lean | 9d4c2629e1ac56861c51edd90c8a5119abb32aa1 | [] | no_license | NeilStrickland/lean_lib | 91e163f514b829c42fe75636407138b5c75cba83 | 6a9563de93748ace509d9db4302db6cd77d8f92c | refs/heads/master | 1,653,408,198,261 | 1,652,996,419,000 | 1,652,996,419,000 | 181,006,067 | 4 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 640 | lean | /-
Copyright (c) 2019 Neil Strickland. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Neil Strickland
(This is part of an attempt to formalise some material from
a basic undergraduate combinatorics course.)
Consider the set (T n) of triples (x,y,z) in ℕ³ with x + y... |
177c1a5df0c76a3aa436f5dc13cf802c8e620fe6 | 9ee042bf34eebe0464f0f80c0db14ceb048dab10 | /stage0/src/Lean/Elab/PreDefinition/Main.lean | b707ce187317ef4920d59d78db0d8dc741ec3219 | [
"Apache-2.0"
] | permissive | dexmagic/lean4 | 7507e7b07dc9f49db45df5ebd011886367dc2a6c | 48764b60d5bac337eaff4bf8a3d63a216e1d9e03 | refs/heads/master | 1,692,156,265,016 | 1,633,276,980,000 | 1,633,339,480,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,228 | 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.PreDefinition.Basic
import Lean.Elab.PreDefinition.Structural
import Lean.Elab.PreDefinition.WF
namespace Lean.Elab
open Meta
open Term
pr... |
3e47d678622e3df9f861628d8dd95f5d96ac201d | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /archive/imo/imo2021_q1.lean | 397823fa856e1ba00a5fcc4db92c5230e0bf7aec | [
"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 | 8,463 | lean | /-
Copyright (c) 2021 Mantas Bakšys. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mantas Bakšys
-/
import data.real.sqrt
import tactic.interval_cases
import tactic.linarith
import tactic.norm_cast
import tactic.norm_num
import tactic.ring_exp
/-!
# IMO 2021 Q1
> T... |
81559d1598be1b1250c8e495cb20a9d8644a64f5 | e0f9ba56b7fedc16ef8697f6caeef5898b435143 | /src/category_theory/equivalence.lean | fd9abed22cff0ff1fbae26d68300b9f723d88f50 | [
"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 | 15,035 | 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.fully_faithful
import category_theory.whiskering
import tactic.slice
namespace category_theory
... |
b201377f8b52a5b260ac333bdfeefdb873d0854a | 2f4707593665f4eac651cd5e5b39ea8eabafe0d6 | /src/homeos.lean | 70b9e0c10587ac9e36af1a91a5c09d069fb0f5ed | [] | no_license | PatrickMassot/lean-differential-topology | 941d2ac639b2c8bcfcbad85fe5ff0a4676d159e9 | 5b020daa5f935140c53408748a9f11ba02e7bf42 | refs/heads/master | 1,543,081,959,510 | 1,536,089,170,000 | 1,536,089,170,000 | 112,875,905 | 12 | 5 | null | 1,520,841,685,000 | 1,512,247,905,000 | Lean | UTF-8 | Lean | false | false | 4,220 | lean | 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.left_inverse (f : equiv α... |
e6e3abdf1e58ac834ced143ca337b561658db8b7 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/run/record2.lean | 4cbc4f816c642b3d4b9c3dd069d7bb3c65592c1f | [
"Apache-2.0"
] | permissive | soonhokong/lean-osx | 4a954262c780e404c1369d6c06516161d07fcb40 | 3670278342d2f4faa49d95b46d86642d7875b47c | refs/heads/master | 1,611,410,334,552 | 1,474,425,686,000 | 1,474,425,686,000 | 12,043,103 | 5 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 259 | lean | set_option pp.universes true
section
parameter (A : Type)
section
parameter (B : Type)
structure point :=
mk :: (x : A) (y : B)
check point
check point.mk
check point.x
end
check point
check point.mk
check point.x
end
|
9e5d5f02bf31c0891c10e41833a5be814f499123 | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/linear_algebra/finsupp.lean | dd776febbc638dcbb31345207b4e55fdc759b0db | [
"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 | 39,500 | lean | /-
Copyright (c) 2019 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
-/
import data.finsupp.basic
import linear_algebra.basic
import linear_algebra.pi
/-!
# Properties of the module `α →₀ M`
Given an `R`-module `M`, the `R`-module struc... |
363e255976cb8f92caef6e868b0a28661cfc3953 | 437dc96105f48409c3981d46fb48e57c9ac3a3e4 | /src/algebra/group_with_zero.lean | d2a63fcc1a3ff429b0ade0345fc04b6c3c536a1b | [
"Apache-2.0"
] | permissive | dan-c-k/mathlib | 08efec79bd7481ee6da9cc44c24a653bff4fbe0d | 96efc220f6225bc7a5ed8349900391a33a38cc56 | refs/heads/master | 1,658,082,847,093 | 1,589,013,201,000 | 1,589,013,201,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 19,096 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import algebra.group.is_unit
/-!
# G₀roups with an adjoined zero element
This file describes structures that are not usually studied on their own right in mathemati... |
542afc0bfc6d046ecb233c2d7096d90577d28435 | 2eab05920d6eeb06665e1a6df77b3157354316ad | /src/measure_theory/measurable_space_def.lean | 581f36c78c90dfcd9a1547b8adde483dc8595a7f | [
"Apache-2.0"
] | permissive | ayush1801/mathlib | 78949b9f789f488148142221606bf15c02b960d2 | ce164e28f262acbb3de6281b3b03660a9f744e3c | refs/heads/master | 1,692,886,907,941 | 1,635,270,866,000 | 1,635,270,866,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 17,461 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro
-/
import algebra.indicator_function
import data.equiv.encodable.lattice
import data.set.countable
import order.disjointed
import order.filter.basic
impo... |
639d78cbccfcac46e88a63045573a30f7d13a99d | c45b34bfd44d8607a2e8762c926e3cfaa7436201 | /uexp/src/uexp/rules/index.lean | 2ff1f08d687ef249f4297d6f2e7fe124627f594c | [
"BSD-2-Clause"
] | permissive | Shamrock-Frost/Cosette | b477c442c07e45082348a145f19ebb35a7f29392 | 24cbc4adebf627f13f5eac878f04ffa20d1209af | refs/heads/master | 1,619,721,304,969 | 1,526,082,841,000 | 1,526,082,841,000 | 121,695,605 | 1 | 0 | null | 1,518,737,210,000 | 1,518,737,210,000 | null | UTF-8 | Lean | false | false | 1,140 | lean | import ..sql
import ..tactics
import ..u_semiring
import ..extra_constants
import ..ucongr
import ..TDP ..canonize
set_option profiler true
open Expr
open Proj
open Pred
open SQL
open tree
notation `int` := datatypes.int
variable integer_10: const datatypes.int
lemma IndexQ0:
forall Γ r (R: relation r) t0 (l:... |
5eccc4dcf91f0a5490ae14c6e736174139c26aed | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /stage0/src/Lean/Elab/Quotation/Util.lean | 7acaebf94d6f9a2367b7f9c143433d6888b5aa15 | [
"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 | 1,310 | lean | /-
Copyright (c) 2020 Sebastian Ullrich. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
-/
import Lean.Elab.Term
namespace Lean.Elab.Term.Quotation
open Lean.Syntax
partial def getAntiquotationIds : Syntax → TermElabM (Array Syntax) :=
go #[]
wh... |
38f57ef731bb8a46e9f1549cb188c66b80f8ab53 | 1e3a43e8ba59c6fe1c66775b6e833e721eaf1675 | /src/algebra/group/hom.lean | 0013f4b53ac1c1016bb3bfb0abdf4ce55e2d10ae | [
"Apache-2.0"
] | permissive | Sterrs/mathlib | ea6910847b8dfd18500486de9ab0ee35704a3f52 | d9327e433804004aa1dc65091bbe0de1e5a08c5e | refs/heads/master | 1,650,769,884,257 | 1,587,808,694,000 | 1,587,808,694,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,392 | lean | /-
Copyright (c) 2018 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Kevin Buzzard, Scott Morrison, Johan Commelin, Chris Hughes,
Johannes Hölzl, Yury Kudryashov
-/
import algebra.group.basic
/-!
# monoid and group homomorphisms
This... |
5abb2983572cf50abbefe2d2640bd851391ea559 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/tactic/finish.lean | 447eea05b38e7a224784c0c9afb3ce8837dbdb12 | [
"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 | 23,120 | lean | /-
Copyright (c) 2017 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Jesse Michael Han
-/
import logic.basic tactic.core tactic.hint
/-!
# The `finish` family of tactics
These tactics do straightforward things: they call the simplifier,... |
55894933e22b346485194d97aa9eb11db5205e64 | 88892181780ff536a81e794003fe058062f06758 | /src/positive_nat/mod.lean | d09365a09c4e616d4033476ecfa9085b68a2a944 | [] | no_license | AtnNn/lean-sandbox | fe2c44280444e8bb8146ab8ac391c82b480c0a2e | 8c68afbdc09213173aef1be195da7a9a86060a97 | refs/heads/master | 1,623,004,395,876 | 1,579,969,507,000 | 1,579,969,507,000 | 146,666,368 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,249 | lean | import positive_nat.lemmas
import tactic.well_founded_tactics
namespace positive_nat namespace natural
def mod : natural → natural → natural
| a b := if h : b < a then
have sub.total a b < a := sub_lt_of_lt h,
mod (sub.total a b) b else a
using_well_founded lib.wf_tacs
instance has_mod : has_mod natural := ⟨mod⟩
de... |
89abe631dd0a7cc75ea9c913ea49f167bebe0c08 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/logic/is_empty.lean | 349093c9bcf8b0a23dec21841b44360d332cf287 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 6,136 | lean | /-
Copyright (c) 2021 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
-/
import logic.function.basic
import tactic.protected
/-!
# Types that are empty
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a c... |
faa6919b68d94649af649ac8c670a943026092f5 | d436468d80b739ba7e06843c4d0d2070e43448e5 | /src/linear_algebra/bilinear_form.lean | f7d9863c90933c9db6881d362eefa18e1d892867 | [
"Apache-2.0"
] | permissive | roro47/mathlib | 761fdc002aef92f77818f3fef06bf6ec6fc1a28e | 80aa7d52537571a2ca62a3fdf71c9533a09422cf | refs/heads/master | 1,599,656,410,625 | 1,573,649,488,000 | 1,573,649,488,000 | 221,452,951 | 0 | 0 | Apache-2.0 | 1,573,647,693,000 | 1,573,647,692,000 | null | UTF-8 | Lean | false | false | 9,004 | 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.tensor_product
/-!
# Bilinear form
This file defines a bilinear form over a module. Basic ideas
such as orthogonality are also introduced,... |
064a8302223d78fe70b11f9bfad319b902819bef | e2fc96178628c7451e998a0db2b73877d0648be5 | /src/classes/context_free/basics/elementary.lean | c21a1d5f7444b73d8ae33d0bc3b1baf88e8b3f87 | [
"BSD-2-Clause"
] | permissive | madvorak/grammars | cd324ae19b28f7b8be9c3ad010ef7bf0fabe5df2 | 1447343a45fcb7821070f1e20b57288d437323a6 | refs/heads/main | 1,692,383,644,884 | 1,692,032,429,000 | 1,692,032,429,000 | 453,948,141 | 7 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,257 | lean | import classes.context_free.basics.toolbox
import utilities.list_utils
import utilities.written_by_others.trim_assoc
variables {T : Type}
/-- Context-free grammar for the empty language (i.e., `∈` always gives `false`). -/
def cfg_empty_lang : CF_grammar T :=
CF_grammar.mk (fin 1) 0 []
/-- Characterization of the e... |
963b36c3f6a57684d1e462e7bb32434d4050b9a1 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/category_theory/subobject/limits.lean | bba0b81fc951128dc54221fb9bd4b3e8d8a26959 | [
"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,017 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta, Scott Morrison
-/
import category_theory.subobject.lattice
/-!
# Specific subobjects
We define `equalizer_subobject`, `kernel_subobject` and `image_subobject`, which ar... |
b96af64e0e2f6c7a32db25687938d8da4148ff54 | e0b0b1648286e442507eb62344760d5cd8d13f2d | /stage0/src/Lean/Elab/Inductive.lean | ecda08548953fce6ee4660ef5cd43f6e6406037a | [
"Apache-2.0"
] | permissive | MULXCODE/lean4 | 743ed389e05e26e09c6a11d24607ad5a697db39b | 4675817a9e89824eca37192364cd47a4027c6437 | refs/heads/master | 1,682,231,879,857 | 1,620,423,501,000 | 1,620,423,501,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 24,781 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Util.ReplaceLevel
import Lean.Util.ReplaceExpr
import Lean.Util.CollectLevelParams
import Lean.Util.Constructions
import Lean.Meta.CollectFVars
... |
5fe6abb59dbb80fbf03d36d2e79ea1e9541bf505 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/data/list/sort.lean | 381bbefa01e87851ca668785e5dd0d1cc1858690 | [
"Apache-2.0"
] | permissive | jjgarzella/mathlib | 96a345378c4e0bf26cf604aed84f90329e4896a2 | 395d8716c3ad03747059d482090e2bb97db612c8 | refs/heads/master | 1,686,480,124,379 | 1,625,163,323,000 | 1,625,163,323,000 | 281,190,421 | 2 | 0 | Apache-2.0 | 1,595,268,170,000 | 1,595,268,169,000 | null | UTF-8 | Lean | false | false | 13,858 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
-/
import data.list.perm
import data.list.chain
/-!
# Sorting algorithms on lists
In this file we define `list.sorted r l` to be an alias for `pairwise r l`. This alias ... |
4efc878d0e58268e93aab36b7acb124ae241b707 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/ring_theory/free_comm_ring_auto.lean | f7f82560039acc6484e6531809756a5958148038 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,841 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.equiv.functor
import Mathlib.data.mv_polynomial.equiv
import Mathlib.data.mv_pol... |
1606d688f6fc7ce8323687eb24618c87afeaea6e | 6fca17f8d5025f89be1b2d9d15c9e0c4b4900cbf | /src/game/world3/level9.lean | 77714f7d2fc7f63873313b5775e6a06ff642f7c5 | [
"Apache-2.0"
] | permissive | arolihas/natural_number_game | 4f0c93feefec93b8824b2b96adff8b702b8b43ce | 8e4f7b4b42888a3b77429f90cce16292bd288138 | refs/heads/master | 1,621,872,426,808 | 1,586,270,467,000 | 1,586,270,467,000 | 253,648,466 | 0 | 0 | null | 1,586,219,694,000 | 1,586,219,694,000 | null | UTF-8 | Lean | false | false | 1,160 | lean | import game.world3.level8 -- hide
import mynat.mul -- hide
namespace mynat -- hide
/-
# Multiplication World
## Level 9: `mul_left_comm`
You are equipped with
* `mul_assoc (a b c : mynat) : (a * b) * c = a * (b * c)`
* `mul_comm (a b : mynat) : a * b = b * a`
Re-read the docs for `rw` so you know all the tricks.
Y... |
a7a246189a0ba613b7569d9e9e808d6d2c92f1a7 | bdd56e6eb0f467437e368d613de75299495d4054 | /src/basic.lean | 0e362ae330300fb8823313c3976b4007d4133f42 | [] | no_license | truong111000/formalabstracts | 49a04c268ccee136e48e24e9d5dcb6fedea4b53e | 93a89a5c05c6fbc23eb9b914b60dcc353e609cd2 | refs/heads/master | 1,589,551,767,824 | 1,555,708,723,000 | 1,555,708,723,000 | 182,326,292 | 0 | 0 | null | 1,555,708,332,000 | 1,555,708,331,000 | null | UTF-8 | Lean | false | false | 2,431 | lean | /- This file contains various definitions and lemmas which don't fit anywhere else, or when there
is not enough material to make its own file -/
import data.pfun data.set.finite data.nat.enat topology.basic
import tactic.fattribute
universes u v
variables {α : Type*} {β : Type*}
axiom omitted {P : Prop} : P
notat... |
2fa6bd3bf71b8f8f93d7781198b3beeccf518bc0 | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /tests/lean/run/inductive_pred.lean | 4928af43c4336cef0acd14e5c2708aaf78b291a1 | [
"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 | 1,611 | lean | inductive LE : Nat → Nat → Prop
| refl : LE n n
| succ : LE n m → LE n m.succ
theorem LE.trans : LE m n → LE n o → LE m o := by
intro h1 h2
induction h2 with
| refl => assumption
| succ h2 ih => exact succ (ih h1)
theorem LE.trans' : LE m n → LE n o → LE m o
| h1, refl => h1
| h1, succ h2 => succ (... |
3e161dc96f642ad92d34f8ce0ea22d86e71957c7 | 7282d49021d38dacd06c4ce45a48d09627687fe0 | /tests/lean/norm_tac.lean | 49367f8701796ee9439f91c5b0bb7b4debfd3ed7 | [
"Apache-2.0"
] | permissive | steveluc/lean | 5a0b4431acefaf77f15b25bbb49294c2449923ad | 92ba4e8b2d040a799eda7deb8d2a7cdd3e69c496 | refs/heads/master | 1,611,332,256,930 | 1,391,013,244,000 | 1,391,013,244,000 | 16,361,079 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 432 | lean | import Int
import tactic
set_option pp::implicit true
set_option pp::coercion true
set_option pp::notation false
variable vector (A : Type) (sz : Nat) : Type
variable read {A : Type} {sz : Nat} (v : vector A sz) (i : Nat) (H : i < sz) : A
variable V1 : vector Int 10
definition D := read V1 1 (by trivial)
print environm... |
7a00bce9272c60dafbcb93e298096616c202266d | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/topology/algebra/ring/ideal.lean | a39462b874272fcec66e10a9efcce3af804d1158 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 2,769 | lean | /-
Copyright (c) 2018 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot
-/
import topology.algebra.ring.basic
import ring_theory.ideal.quotient
/-!
# Ideals and quotients of topological rings
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any... |
0a31605b60cc2324536b5f7351be66a99cec98a9 | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /library/data/int/order.lean | 37279d254fbc4c57aaaa9f8ff2bdb93f1432a4a9 | [
"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 | 23,728 | lean | -- Copyright (c) 2014 Floris van Doorn. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Author: Floris van Doorn
-- int.order
-- =========
-- The order relation on the integers, and the sign function.
import .basic
open nat (hiding case)
open decidable
open fake_simpli... |
f07f076819fde440f178a8589f890052675e2feb | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/field_theory/fixed.lean | 599e38b16412755a310f9cc3099baa6dfa8a5ce7 | [
"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 | 14,365 | 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.polynomial.group_ring_action
import field_theory.normal
import field_theory.separable
import field_theory.tower
/-!
# Fixed field under a group action.
This i... |
21f15186b40dc2eabeccb480b23f9ab9864ef162 | 7e30cf50cf3bbcaa0cccc30ec76b1989e576d5d4 | /src/sylow2.lean | bba1771f597ff3d7bf628731173c0389cc3c71f0 | [] | no_license | moritz-hl/sylowlean | 5a989e86cf81b72f493e0e581cd677112b93cf65 | 7815b584bc8f7aa9086f7cbbb14fe47af79a8cc5 | refs/heads/master | 1,649,896,516,149 | 1,584,206,608,000 | 1,584,206,608,000 | 236,824,289 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,756 | lean | import group_theory.group_action group_theory.quotient_group
import group_theory.order_of_element data.zmod.basic
import group_theory.coset
open equiv fintype finset mul_action function
open equiv.perm is_subgroup list quotient_group
open nat
universes u v w
variables {G : Type u} {α : Type v} {β : Type w} [group G]
... |
5f38a71acb3bb2f66b62218b8dd3f8b956d72cb4 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /src/Lean/Elab/Term.lean | 1c2042c9fb81986279c5bebdcba8bfcd22e2c4e7 | [
"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 | 79,847 | 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.ResolveName
import Lean.Log
import Lean.Deprecated
import Lean.Util.Sorry
import Lean.Util.ReplaceExpr
import Lean.Structure
... |
b2d43825e912a70237b25fb42a2fee5643f6915f | 367134ba5a65885e863bdc4507601606690974c1 | /src/category_theory/epi_mono.lean | a99725e79cb879e50cad63f2386651cb6d020bfc | [
"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 | 6,267 | lean | /-
Copyright (c) 2019 Reid Barton. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Reid Barton, Scott Morrison
Facts about epimorphisms and monomorphisms.
The definitions of `epi` and `mono` are in `category_theory.category`,
since they are used by some lemmas for `is... |
2501ae6d36aae1920e0a84cfc5ab8e53f399631b | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /src/Lean/Data/Lsp/Basic.lean | 5977d9106fe63f45b8d3bb8a1153966d26a323ed | [
"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,610 | lean | /-
Copyright (c) 2020 Marc Huisinga. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Marc Huisinga, Wojciech Nawrocki
-/
import Lean.Data.Json
import Lean.Data.JsonRpc
/-! Defines most of the 'Basic Structures' in the LSP specification
(https://microsoft.github.io/lan... |
8a35f0ab87022fd2d2d824a1470768531420114a | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/tactic25.lean | 60f3258c28ecda7ab809087a0c4447042af26115 | [
"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 | 642 | lean | import logic
open tactic
definition my_tac1 := apply @eq.refl
definition my_tac2 := repeat (or_else (apply and.intro) assumption)
tactic_hint my_tac1
tactic_hint my_tac2
theorem T1 {A : Type.{2}} (a : A) : a = a
theorem T2 {a b c : Prop} (Ha : a) (Hb : b) (Hc : c) : a ∧ b ∧ c
notation `(` h `|` r:(foldl `|` (e r, ... |
90439b378ed286a8a5f261aa618f5c3874cdba5b | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/run/have2.lean | aae47af585194ce446f3e3ad0279fecebf90fe29 | [
"Apache-2.0"
] | permissive | soonhokong/lean-osx | 4a954262c780e404c1369d6c06516161d07fcb40 | 3670278342d2f4faa49d95b46d86642d7875b47c | refs/heads/master | 1,611,410,334,552 | 1,474,425,686,000 | 1,474,425,686,000 | 12,043,103 | 5 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 174 | lean | prelude
definition Prop : Type.{1} := Type.{0}
constants a b c : Prop
axiom Ha : a
axiom Hb : b
axiom Hc : c
check have H1 : a, from Ha,
have H2 : a, from H1,
H2
|
40a2d74af79775e86590cc5de4de19e88c64d264 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/lake/Lake/Build/Store.lean | 63cf94ed12ca0b76c4109f547831923427615d11 | [
"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,868 | lean | /-
Copyright (c) 2022 Mac Malone. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mac Malone
-/
import Lake.Build.Data
import Lake.Util.StoreInsts
/-!
# The Lake Build Store
The Lake build store is the map of Lake build keys to build task and/or
build results that is ... |
067098cb6120c77801ed1bd4f8440c106853f1cd | dc253be9829b840f15d96d986e0c13520b085033 | /homotopy/smash.hlean | 9ce3b5f95db8015154115146d2879d04ae6bde69 | [
"Apache-2.0"
] | permissive | cmu-phil/Spectral | 4ce68e5c1ef2a812ffda5260e9f09f41b85ae0ea | 3b078f5f1de251637decf04bd3fc8aa01930a6b3 | refs/heads/master | 1,685,119,195,535 | 1,684,169,772,000 | 1,684,169,772,000 | 46,450,197 | 42 | 13 | null | 1,505,516,767,000 | 1,447,883,921,000 | Lean | UTF-8 | Lean | false | false | 57,162 | hlean | -- Authors: Floris van Doorn
import homotopy.smash types.pointed2 .pushout ..pointed
open bool pointed eq equiv is_equiv sum bool prod unit circle cofiber prod.ops wedge is_trunc
function unit
/- To prove: Σ(X × Y) ≃ ΣX ∨ ΣY ∨ Σ(X ∧ Y) (notation means suspension, wedge, smash) -/
/- To prove: Σ(X ∧ Y) ≃ X ... |
b4fe7aa177dc856b789126e06ada5cb1edabc71c | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/analysis/calculus/fderiv/equiv.lean | b3fdd1441a86315c35a0cd6e72606e9d1dd4fc56 | [
"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,978 | lean | /-
Copyright (c) 2019 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Sébastien Gouëzel, Yury Kudryashov
-/
import analysis.calculus.fderiv.linear
import analysis.calculus.fderiv.comp
/-!
# The derivative of a linear equivalence
> THIS FI... |
0e3dcbc13d99df96ec8a2209503a33d600287c71 | 853df553b1d6ca524e3f0a79aedd32dde5d27ec3 | /src/measure_theory/probability_mass_function.lean | 8fa5ad8192ac032efa5c296b73808f47fec53d3f | [
"Apache-2.0"
] | permissive | DanielFabian/mathlib | efc3a50b5dde303c59eeb6353ef4c35a345d7112 | f520d07eba0c852e96fe26da71d85bf6d40fcc2a | refs/heads/master | 1,668,739,922,971 | 1,595,201,756,000 | 1,595,201,756,000 | 279,469,476 | 0 | 0 | null | 1,594,696,604,000 | 1,594,696,604,000 | null | UTF-8 | Lean | false | false | 4,778 | 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
Probability mass function -- discrete probability measures
-/
import topology.instances.ennreal
noncomputable theory
variables {α : Type*} {β : Type*} {γ : Type*}
open_l... |
caa2bc853936e81a76088c494dce9db159121b0d | 22e97a5d648fc451e25a06c668dc03ac7ed7bc25 | /src/analysis/normed_space/operator_norm.lean | 6543cb0c5856ad991d4911478b98dbf0059a4a16 | [
"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 | 28,752 | lean | /-
Copyright (c) 2019 Jan-David Salchow. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jan-David Salchow, Sébastien Gouëzel, Jean Lo
Operator norm on the space of continuous linear maps
Define the operator norm on the space of continuous linear maps between normed s... |
15ba65cfade2a51016b9b6f3642621016c5dedc7 | 367134ba5a65885e863bdc4507601606690974c1 | /src/order/semiconj_Sup.lean | f02e3ae8a1af874830f091767271909012ebad62 | [
"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 | 5,395 | 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 order.conditionally_complete_lattice
import logic.function.conjugate
import order.ord_continuous
import data.equiv.mul_add
/-!
# Semiconjugate by `Sup`... |
b49cd2784217c1a84afce5c47ad624bfa0f642b3 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/data/multiset/fold.lean | 94e79d0543047b765f3c43383df1f2e61d12f1fc | [
"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 | 4,260 | 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.dedup
import data.list.min_max
/-!
# The fold operation for a commutative associative operation over a multiset.
-/
namespace multiset
variable... |
781e6b437ebead18728ca62cce7ec0a1facf1bbe | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /hott/init/default.hlean | 8d3e80475e81f1e4823d246328c4c14ebbf7b414 | [
"Apache-2.0"
] | permissive | soonhokong/lean-osx | 4a954262c780e404c1369d6c06516161d07fcb40 | 3670278342d2f4faa49d95b46d86642d7875b47c | refs/heads/master | 1,611,410,334,552 | 1,474,425,686,000 | 1,474,425,686,000 | 12,043,103 | 5 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 930 | hlean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Jakob von Raumer, Floris van Doorn
-/
prelude
import init.datatypes init.reserved_notation init.tactic init.logic
import init.bool init.num init.relation ini... |
1846bdf9b65b1b5baeb253ed9f693afb19722195 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/pi/algebra.lean | e3b8a2e710add3a62bac23335a6c09c147110deb | [
"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 | 11,823 | lean | /-
Copyright (c) 2020 Eric Wieser. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon, Patrick Massot, Eric Wieser
-/
import tactic.to_additive
import algebra.group.defs
import logic.unique
import tactic.congr
import tactic.simpa
import tactic.split_ifs
import ... |
4ae17fea21efa51d27e5dfdf7800e67de8001f07 | f0f12a5b81106a798deda31dca238c11997a605e | /Playlean4/Group/LRClasses.lean | b130c51f154ab38ea67821d8edc0e0fbcc9797f4 | [
"MIT"
] | permissive | thejohncrafter/playlean4 | fe7119d492aab07048f78333eeda9862f6471740 | 81df180a71b8d84d0f45bc98db367aad203cf5df | refs/heads/master | 1,683,152,783,765 | 1,621,879,382,000 | 1,621,879,382,000 | 366,563,501 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,508 | lean |
import Playlean4.Group.Basic
import Playlean4.Group.Subgroup
import Playlean4.Group.Action
import Playlean4.Group.OnSet
set_option quotPrecheck.allowSectionVars true
namespace Group
namespace Subgroup
variable {G : Type} (law : G → G → G) [grp : Group G law]
local infixl:70 " * " => id' law
@[appUnexpander id'] d... |
62db69ee41426f07f9ccfcb8c3da9fc18e84c948 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/topology/metric_space/hausdorff_distance_auto.lean | 52e3a35b0e2488b27c5551b431a97af87c3f730e | [] | 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 | 25,046 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.topology.metric_space.isometry
import Mathlib.topology.instances.ennreal
import Mathli... |
88a843d8b2d92e36c0e30572632b65b44466b584 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /test/lint_simp_var_head.lean | d41f488d02b029ea34bd247a21a169bdd5b85e1b | [
"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 | 914 | lean | import tactic.lint
-- The following simp lemma has the variable `f` as head symbol of the left-hand side:
@[simp] axiom const_zero_eq_zero (f : ℕ → ℕ) (x) : f x = 0
example (f : ℕ → ℕ) : f 42 = 0 :=
begin
-- Hence it doesn't work:
success_if_fail {simp},
-- BTW, rw doesn't work either:
success_if_fail {rw co... |
9f6f8046a4ed5f92bd62d661743e4e4569e289fb | 4727251e0cd73359b15b664c3170e5d754078599 | /src/category_theory/skeletal.lean | 3695508690f728343130d01c3554c71f301d1216 | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 10,915 | 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.category.preorder
import category_theory.isomorphism_classes
import category_theory.thin
/-!
# Skeleton of a category
Define skeletal categories ... |
60b6f4c480b2813413b84165db13873cc032bfc5 | f68ef9a599ec5575db7b285d4960e63c5d464ccc | /Exercises/Lista 3/conditions-hamiltonian.lean | 5f97fac2fa09554822b518d4e98e0dc72279e6de | [] | no_license | lucasmoschen/discrete-mathematics | a38d5970cc571b0b9d202bf6a43efeb8ed6f66e3 | 0f1945cc5eb094814c926cd6ae4a8b4c5c579a1e | refs/heads/master | 1,677,111,757,003 | 1,611,500,097,000 | 1,611,500,097,000 | 205,903,359 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,285 | lean | -- Conditions
variables {x11 x12 x13 x14 x21 x22 x23 x24 x31 x32 x33 x34 x41 x42 x43 x44: Prop}
-- Aqui eu escrevo as propriedades de forma separada. Depois, demonstro-as.
-- Condition 1
variable f1: x11 ∨ x21 ∨ x31 ∨ x41
variable f2: x12 ∨ x22 ∨ x32 ∨ x42
variable f3: x13 ∨ x23 ∨ x33 ∨ x43
variable f4: x14 ∨ x24 ... |
c881a296d98b0c3ffde421b348a228c138ac7bf6 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/ctorUnivTooBig.lean | b7248e31fa89c46ce33d854f00ca1d78e91125f4 | [
"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,145 | lean | inductive Bla : Type u where
| nil : Bla
| cons : (α : Type u) → (a : α) → Bla → Bla -- Error
inductive Foo : Type where
| leaf
| mk (α : Type) (a : α) -- Error
| mk₂
inductive Foo' : Type u where
| leaf
| mk : Sort (max u v) → a → Foo' -- Error
| mk₂
inductive Boo : Type u where
| nil : Boo
| ... |
67861835a0e6382285113c79462fcd4ff8c4ba07 | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/analysis/special_functions/arsinh.lean | ce36f427d4ab401e4d96eb27ce77ba3a214746b1 | [
"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 | 2,943 | lean | /-
Copyright (c) 2020 James Arthur. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: James Arthur, Chris Hughes, Shing Tak Lam
-/
import analysis.special_functions.trigonometric
/-!
# Inverse of the sinh function
In this file we prove that sinh is bijective and hence h... |
7c76fafe474984015a584c4891787d718ee861b0 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/analysis/normed_space/spectrum.lean | d222373613d9bb7f43bae169ab8eefa558071cab | [
"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 | 27,875 | lean | /-
Copyright (c) 2021 Jireh Loreaux. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jireh Loreaux
-/
import field_theory.is_alg_closed.spectrum
import analysis.complex.liouville
import analysis.complex.polynomial
import analysis.analytic.radius_liminf
import topology.a... |
0454f1a30cb78756e92fafe02085835f5340a76e | fe25de614feb5587799621c41487aaee0d083b08 | /src/Lean/Elab/Do.lean | 4f8e6ae08234af107780017938a78c06176df85c | [
"Apache-2.0"
] | permissive | pollend/lean4 | e8469c2f5fb8779b773618c3267883cf21fb9fac | c913886938c4b3b83238a3f99673c6c5a9cec270 | refs/heads/master | 1,687,973,251,481 | 1,628,039,739,000 | 1,628,039,739,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 69,664 | 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.Term
import Lean.Elab.BindersUtil
import Lean.Elab.PatternVar
import Lean.Elab.Quotation.Util
import Lean.Parser.Do
-- HACK: avoid code ex... |
3ac78eb7b24c24bc3a706b13286bec74ee68ba08 | c8b4b578b2fe61d500fbca7480e506f6603ea698 | /scripts/lint_project.lean | c4044b9e0a5ac5258131a2d5a7561ddc44e7f1c5 | [] | no_license | leanprover-community/flt-regular | aa7e564f2679dfd2e86015a5a9674a6e1197f7cc | 67fb3e176584bbc03616c221a7be6fa28c5ccd32 | refs/heads/master | 1,692,188,905,751 | 1,691,766,312,000 | 1,691,766,312,000 | 421,021,216 | 19 | 4 | null | 1,694,532,115,000 | 1,635,166,136,000 | Lean | UTF-8 | Lean | false | false | 4,699 | lean | /-
Copyright (c) 2020 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis, Gabriel Ebner
-/
import tactic.lint
import system.io -- these are required
import all -- then import everything, to parse the library for failing linters
/-!
# l... |
04583b1897be96639d93fa11bcc3c7a0500dd660 | fe208a542cea7b2d6d7ff79f94d535f6d11d814a | /src/Logic/excluded_middle.lean | f6f8ba5f15992c62c67952f35067965710ebe1df | [] | no_license | ImperialCollegeLondon/M1F_room_342_questions | c4b98b14113fe900a7f388762269305faff73e63 | 63de9a6ab9c27a433039dd5530bc9b10b1d227f7 | refs/heads/master | 1,585,807,312,561 | 1,545,232,972,000 | 1,545,232,972,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,847 | lean | -- TODO -- post this on M1F blackboard and on Xena blackboard
-- No -- put it on M1F example class questions github site
/-
Equivalent formulations of the law of the excluded middle.
Dr Britnell's axioms were:
1) P → (Q → P)
2) (¬ Q → ¬ P) → (P → Q)
3) (P → (Q → R)) → ((P → Q) → (P → R))
Here I fo... |
8a4ed3f1c03b7a51e57166384344a3ae2a3ee397 | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /doc/demo/reflif.lean | e4f27c129bdef781a29c91ac5f766cab99b6f726 | [
"Apache-2.0"
] | permissive | codyroux/lean0.1 | 1ce92751d664aacff0529e139083304a7bbc8a71 | 0dc6fb974aa85ed6f305a2f4b10a53a44ee5f0ef | refs/heads/master | 1,610,830,535,062 | 1,402,150,480,000 | 1,402,150,480,000 | 19,588,851 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 542 | lean | import macros
scope
variable A : Type
variable R : A → A → Bool
axiom Symm {x y : A} : R x y → R y x
axiom Trans {x y z : A} : R x y → R y z → R x z
theorem ReflIf (Linked : ∀ x, ∃ y, R x y) : ∀ x, R x x :=
take x, obtain (w : A) (Hw : R x w), from Linked x,
let lemma1 : R w x := Symm Hw
... |
795150a38cc6efaf5a0f61cdb6e5d131b23e5e94 | e6b8240a90527fd55d42d0ec6649253d5d0bd414 | /src/algebra/module.lean | aca4750dc92a5c4483eda11532aeab66ac38e39d | [
"Apache-2.0"
] | permissive | mattearnshaw/mathlib | ac90f9fb8168aa642223bea3ffd0286b0cfde44f | d8dc1445cf8a8c74f8df60b9f7a1f5cf10946666 | refs/heads/master | 1,606,308,351,137 | 1,576,594,130,000 | 1,576,594,130,000 | 228,666,195 | 0 | 0 | Apache-2.0 | 1,576,603,094,000 | 1,576,603,093,000 | null | UTF-8 | Lean | false | false | 16,990 | lean | /-
Copyright (c) 2015 Nathaniel Thomas. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nathaniel Thomas, Jeremy Avigad, Johannes Hölzl, Mario Carneiro
Modules over a ring.
## Implementation notes
Throughout the `linear_map` section implicit `{}` brackets are often ... |
bdf49bd48b7aa0232554a937c54e9b5a24425154 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/record8.lean | d8f7471f512e0e45833b29e888bf467cac5ac60d | [
"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 | 47 | lean | structure point :=
(x y : nat)
#check point.x
|
11d4257c63b82a0e63f1fbbafe0fb1eb1980886c | e151e9053bfd6d71740066474fc500a087837323 | /src/hott/init/hedberg.lean | 1fc86551a647b1460acc19043f5b0e3f7f610ecb | [
"Apache-2.0"
] | permissive | daniel-carranza/hott3 | 15bac2d90589dbb952ef15e74b2837722491963d | 913811e8a1371d3a5751d7d32ff9dec8aa6815d9 | refs/heads/master | 1,610,091,349,670 | 1,596,222,336,000 | 1,596,222,336,000 | 241,957,822 | 0 | 0 | Apache-2.0 | 1,582,222,839,000 | 1,582,222,838,000 | null | UTF-8 | Lean | false | false | 1,335 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
Hedberg's Theorem: every type with decidable equality is a set
-/
import .trunc .logic
universes u v w
hott_theory
namespace hott
open eq nat is_trunc sigma... |
0dd7480f3b26516c74b5a3da22052a793886300d | 26ac254ecb57ffcb886ff709cf018390161a9225 | /src/tactic/simps.lean | de0f10dd609713ff326949cfdc229d3d2dfd5bfc | [
"Apache-2.0"
] | permissive | eric-wieser/mathlib | 42842584f584359bbe1fc8b88b3ff937c8acd72d | d0df6b81cd0920ad569158c06a3fd5abb9e63301 | refs/heads/master | 1,669,546,404,255 | 1,595,254,668,000 | 1,595,254,668,000 | 281,173,504 | 0 | 0 | Apache-2.0 | 1,595,263,582,000 | 1,595,263,581,000 | null | UTF-8 | Lean | false | false | 8,893 | 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
-/
import tactic.core
/-!
# simps attribute
This file defines the `@[simps]` attribute, to automatically generate simp-lemmas
reducing a definition when projections... |
55a50dcf85693a9afeea9689fd4f9a49b48bd81f | 680b0d1592ce164979dab866b232f6fa743f2cc8 | /library/algebra/ordered_field.lean | b7f4fae5e7ea88132dc17bb38ead8ae2cf66c50f | [
"Apache-2.0"
] | permissive | syohex/lean | 657428ab520f8277fc18cf04bea2ad200dbae782 | 081ad1212b686780f3ff8a6d0e5f8a1d29a7d8bc | refs/heads/master | 1,611,274,838,635 | 1,452,668,188,000 | 1,452,668,188,000 | 49,562,028 | 0 | 0 | null | 1,452,675,604,000 | 1,452,675,602,000 | null | UTF-8 | Lean | false | false | 20,295 | lean | /-
Copyright (c) 2014 Robert Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Lewis
-/
import algebra.ordered_ring algebra.field
open eq eq.ops
structure linear_ordered_field [class] (A : Type) extends linear_ordered_ring A, field A
section linear_ordered... |
45f1d598cbdd62ca0d1bfa46c60c32e6be224d49 | c6ff7f82fbfbc4ed06a4edc8adf7239c6aba6945 | /src/algebra/algebra/basic.lean | 2dc2fde917fde5c26819f1fdb1d5a1ffcff17671 | [
"Apache-2.0"
] | permissive | jpablo/mathlib | f14c9042506cce59176d3d22b457f190e78938a3 | fd453cf1569b8f9396476287b046d216e92224e4 | refs/heads/master | 1,690,443,975,886 | 1,631,043,219,000 | 1,631,043,219,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 57,379 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Yury Kudryashov
-/
import algebra.iterate_hom
import data.equiv.ring_aut
import linear_algebra.tensor_product
import tactic.nth_rewrite
/-!
# Algebra over Commutative Semiring
... |
18477c507b5dc8fb73d96ce256e35db575190f00 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/interactive/hoverDot.lean | 7d442d2a0c38aa827e6bd9316007b1d189720d86 | [
"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 | 569 | lean | structure Foo where
f₁ : Nat
def Foo.f₂ (f : Foo) : Nat :=
f.f₁
def Foo.foo : Foo := ⟨10⟩
#check Foo.foo.f₁.succ
--^ textDocument/hover
open Foo
#check foo.f₁.succ
--^ textDocument/hover
--^ textDocument/hover
--^ textDocument/hover
#check foo.f₂.succ
--^ textDocument... |
5b7d0428d6739e77f7a4de9542dea69619b74459 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Parser/Types.lean | be0aff2186d888e9d12109d5c8bad62401e5cc3a | [
"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 | 15,782 | 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.Data.Trie
import Lean.Syntax
import Lean.Message
namespace Lean.Parser
abbrev mkAtom (info : SourceInfo) (val : String) : S... |
3c376ed55fbddcca6749c72474609429ef7de745 | 88892181780ff536a81e794003fe058062f06758 | /src/stackoverflow/exists_of_prop.lean | aa370ed67ed3f630bca9106adc9427cfd6759c58 | [] | no_license | AtnNn/lean-sandbox | fe2c44280444e8bb8146ab8ac391c82b480c0a2e | 8c68afbdc09213173aef1be195da7a9a86060a97 | refs/heads/master | 1,623,004,395,876 | 1,579,969,507,000 | 1,579,969,507,000 | 146,666,368 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 283 | lean | import tactic.interactive
example : ¬ ∀ (α : Type) (r : Prop), r → (∃ x : α, r) :=
begin
intro h,
cases h empty _ true.intro with w,
cases w
end
example (α : Type) [inhabited α] (r : Prop) : r → (∃ x : α, r) :=
λ h, ⟨inhabited.default α, h⟩
#print foo
|
1f48180ee3f99662e1934bff34ddc5188173ff1f | c777c32c8e484e195053731103c5e52af26a25d1 | /src/linear_algebra/tensor_power.lean | a17d3b28dab14d177162a7491ba0e0c7b3e356dc | [
"Apache-2.0"
] | permissive | kbuzzard/mathlib | 2ff9e85dfe2a46f4b291927f983afec17e946eb8 | 58537299e922f9c77df76cb613910914a479c1f7 | refs/heads/master | 1,685,313,702,744 | 1,683,974,212,000 | 1,683,974,212,000 | 128,185,277 | 1 | 0 | null | 1,522,920,600,000 | 1,522,920,600,000 | null | UTF-8 | Lean | false | false | 11,072 | lean | /-
Copyright (c) 2021 Eric Wieser. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Eric Wieser
-/
import linear_algebra.pi_tensor_product
import logic.equiv.fin
import algebra.direct_sum.algebra
/-!
# Tensor power of a semimodule over a commutative semirings
We defin... |
e763ccebabccfe7ca0cdc2634abc19b477424468 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/category_theory/functor/epi_mono.lean | 521a68d8ff7334d41c2aa33333c17dd65eb54cfd | [
"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 | 12,058 | lean | /-
Copyright (c) 2022 Markus Himmel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel
-/
import category_theory.epi_mono
import category_theory.limits.shapes.strong_epi
import category_theory.lifting_properties.adjunction
/-!
# Preservation and reflection ... |
3667e742159e03c4ba633be3736d1d3f73dba736 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/order/omega_complete_partial_order.lean | fcc6b94f4a6c34a29807de82d8d99e2e814f08b7 | [
"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 | 27,523 | lean | /-
Copyright (c) 2020 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
-/
import data.pfun
import order.preorder_hom
import tactic.wlog
import tactic.monotonicity
/-!
# Omega Complete Partial Orders
An omega-complete partial order is a partial ... |
3726c14f2cb2d58cb060d47ff3ee38013b9c49c2 | 87a08a8e9b222ec02f3327dca4ae24590c1b3de9 | /src/measure_theory/measurable_space.lean | 6ac1589463af1cfbf5e0f693097fc39f74d09330 | [
"Apache-2.0"
] | permissive | naussicaa/mathlib | 86d05223517a39e80920549a8052f9cf0e0b77b8 | 1ef2c2df20cf45c21675d855436228c7ae02d47a | refs/heads/master | 1,592,104,950,080 | 1,562,073,069,000 | 1,562,073,069,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 39,198 | 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
Measurable spaces -- σ-algberas
-/
import data.set.disjointed order.galois_connection data.set.countable
open set lattice encodable
local attribute [ins... |
1d2a649ff0d4672a07d84608b7257092e6dd0bdc | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/monoid_algebra/degree.lean | 2aae4a028c4e4aef8120bdd8f7c8293add240d88 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 6,600 | lean | /-
Copyright (c) 2022 Damiano Testa. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Damiano Testa
-/
import algebra.monoid_algebra.support
/-!
# Lemmas about the `sup` and `inf` of the support of `add_monoid_algebra`
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any c... |
b80ffce0fd67c4e7a95054e4b943974c2202120a | 46125763b4dbf50619e8846a1371029346f4c3db | /src/order/copy.lean | 995892b82546276eee843c3aa7bbc636cfe6fd49 | [
"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 | 4,580 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import order.conditionally_complete_lattice
/-!
# Tooling to make copies of lattice structures
Sometimes it is useful to make a copy of a lattice structure
where o... |
98136ccded80ee9f85f789113b7749ad6d3bd594 | febba19712b2aefe4d6c7fb0230b8d7e272c98c4 | /src/metatheorem.lean | 2d50a4593e51d016cef651bc0bce6e3fa1805f25 | [] | no_license | hcheval/formalized-proof-mining | e6eb980feb644ae269f43d9af93ac584b7a47a17 | 216cc73fccd84900a1ba7eaae5f73732496d6afe | refs/heads/master | 1,689,621,410,792 | 1,629,912,272,000 | 1,629,912,272,000 | 399,855,572 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,317 | lean | import dialectica
import proof
import realizers
import majorizability
import data.equiv.basic
section
parameters {ι : Type} {gri : ground_interpretation ι}
local notation `𝔽` := formula ι gri
local notation `𝕋` := type ι gri
variables {greq : Π {i : ι}, ∥𝕏 i // gri ∥ → ∥𝕏 i // gri ∥ → 𝔽}
local infixr... |
e82d9e696bd4e85c3f2945fb042056398eb8bbf5 | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/data/polynomial/eval.lean | e69cffdc09335810fedb1cde016512d0381e1e5b | [
"Apache-2.0"
] | permissive | abentkamp/mathlib | d9a75d291ec09f4637b0f30cc3880ffb07549ee5 | 5360e476391508e092b5a1e5210bd0ed22dc0755 | refs/heads/master | 1,682,382,954,948 | 1,622,106,077,000 | 1,622,106,077,000 | 149,285,665 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 26,662 | 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.induction
import data.polynomial.degree.definitions
import deprecated.ring
/-!
# Theory of univari... |
f72d3fc94a8cfe19d8b1b9d51e610fa3b510fc81 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/smartUnfolding.lean | 0f8029133cfa445867c68ecf8730643359b076f2 | [
"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 | 160 | lean | theorem ex1 (x y : Nat) (h : x + 2 = y + 2) : x = y := by
injection h with h
trace_state -- without smart unfolding the state would be a mess
injection h
|
d0ff3ca88ef295241e22481bc3508bdf11d4290f | e0b0b1648286e442507eb62344760d5cd8d13f2d | /stage0/src/Lean/Elab/Tactic/Simp.lean | f8609346d2e924aa35d8387b7ecd39369ae56728 | [
"Apache-2.0"
] | permissive | MULXCODE/lean4 | 743ed389e05e26e09c6a11d24607ad5a697db39b | 4675817a9e89824eca37192364cd47a4027c6437 | refs/heads/master | 1,682,231,879,857 | 1,620,423,501,000 | 1,620,423,501,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,544 | 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.Tactic.Simp
import Lean.Elab.Tactic.Basic
import Lean.Elab.Tactic.ElabTerm
import Lean.Elab.Tactic.Location
import Lean.Meta.Tactic.Replace... |
d9ed61f37ba2313935f5a11e806eb2793e8c04a3 | 5719a16e23dfc08cdea7a5bf035b81690f307965 | /src/Init/Lean/Elab/Term.lean | e39fe0994a7850f3c076c5ac55e508deb2a2d728 | [
"Apache-2.0"
] | permissive | postmasters/lean4 | 488b03969a371e1507e1e8a4df9ebf63c7cbe7ac | f3976fc53a883ac7606fc59357d43f4b51016ca7 | refs/heads/master | 1,655,582,707,480 | 1,588,682,595,000 | 1,588,682,595,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 56,828 | 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
-/
prelude
import Init.Lean.Util.Sorry
import Init.Lean.Structure
import Init.Lean.Meta.ExprDefEq
import Init.Lean.Meta.AppBuilder
import Init.Lean.Meta.SynthI... |
1a3ee07b987dad8324145d662de14e2a438654f3 | 853df553b1d6ca524e3f0a79aedd32dde5d27ec3 | /src/data/mv_polynomial.lean | 2c5ad423691f4400ea6a28e9f02bf3d95ae3f53b | [
"Apache-2.0"
] | permissive | DanielFabian/mathlib | efc3a50b5dde303c59eeb6353ef4c35a345d7112 | f520d07eba0c852e96fe26da71d85bf6d40fcc2a | refs/heads/master | 1,668,739,922,971 | 1,595,201,756,000 | 1,595,201,756,000 | 279,469,476 | 0 | 0 | null | 1,594,696,604,000 | 1,594,696,604,000 | null | UTF-8 | Lean | false | false | 59,746 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Johan Commelin, Mario Carneiro, Shing Tak Lam
-/
import data.polynomial
import data.equiv.ring
import data.equiv.fin
import tactic.omega
/-!
# Multivariate polynomials... |
59fe88e460b762fd67d2770b9937a66f96c6c1cf | 54c9ed381c63410c9b6af3b0a1722c41152f037f | /Binport/Rules.lean | 74dce7bc2cdb3fc30e73a4bc4ef732db62b18b37 | [
"Apache-2.0"
] | permissive | dselsam/binport | 0233f1aa961a77c4fc96f0dccc780d958c5efc6c | aef374df0e169e2c3f1dc911de240c076315805c | refs/heads/master | 1,687,453,448,108 | 1,627,483,296,000 | 1,627,483,296,000 | 333,825,622 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,679 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Daniel Selsam, Gabriel Ebner
-/
import Binport.Util
import Binport.Basic
import Lean
import Std.Data.HashSet
import Std.Data.HashMap
namespace Binport
open Lean
open Std (Hash... |
4f57af667ec3447ff3f7a2d532f7071397c27c58 | 08bd4ba4ca87dba1f09d2c96a26f5d65da81f4b4 | /src/Init/Control/Basic.lean | 3314218e46b67163c9c66d97e818073aa5b7a9f3 | [
"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 | 9,724 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura, Sebastian Ullrich
-/
prelude
import Init.Core
universe u v w
@[reducible]
def Functor.mapRev {f : Type u → Type v} [Functor f] {α β : Type u} : f α → (α → β)... |
ea6b64daa9f92acb784cff19aa39c75650369de7 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/tactic/unify_equations_auto.lean | cec001571c53a95c0216180eb507b6c72b45cff5 | [] | 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,563 | lean | /-
Copyright (c) 2020 Jannis Limperg. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jannis Limperg
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.tactic.core
import Mathlib.PostPort
namespace Mathlib
/-!
# The `unify_equations` tactic
... |
ca2ed2c686d23d30e2c8058a502b27af38df6fb5 | f20db13587f4dd28a4b1fbd31953afd491691fa0 | /library/init/meta/interactive_base.lean | f325adc664ac76e924cd6ec0c46fa9416b5cd78f | [
"Apache-2.0"
] | permissive | AHartNtkn/lean | 9a971edfc6857c63edcbf96bea6841b9a84cf916 | 0d83a74b26541421fc1aa33044c35b03759710ed | refs/heads/master | 1,620,592,591,236 | 1,516,749,881,000 | 1,516,749,881,000 | 118,697,288 | 1 | 0 | null | 1,516,759,470,000 | 1,516,759,470,000 | null | UTF-8 | Lean | false | false | 8,263 | 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.option.instances
import init.meta.lean.parser init.meta.tactic init.meta.has_reflect
open lean
open lean.parser
local postfix `?`... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.