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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
8d756f2806096485e8ebc7dae2dbb33cb5370607 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/sum_bug.lean | d45f3e5d87276ee142f93820a30b8a6184752420 | [
"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,359 | lean | -- Copyright (c) 2014 Microsoft Corporation. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Author: Leonardo de Moura, Jeremy Avigad
import logic
open inhabited decidable
namespace play
-- TODO: take this outside the namespace when the inductive package handles it better
... |
cecfaece7f42728148cfc364e8eb6a996a22b1b5 | 38bf3fd2bb651ab70511408fcf70e2029e2ba310 | /src/topology/basic.lean | 4c7fc309c9e81ec35c60fdf8a12711be6ffcb941 | [
"Apache-2.0"
] | permissive | JaredCorduan/mathlib | 130392594844f15dad65a9308c242551bae6cd2e | d5de80376088954d592a59326c14404f538050a1 | refs/heads/master | 1,595,862,206,333 | 1,570,816,457,000 | 1,570,816,457,000 | 209,134,499 | 0 | 0 | Apache-2.0 | 1,568,746,811,000 | 1,568,746,811,000 | null | UTF-8 | Lean | false | false | 33,006 | 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, Jeremy Avigad
-/
import order.filter
/-!
# Basic theory of topological spaces.
The main definition is the type class `topological space α` which endo... |
fe3b310dca988c84c767d8e9dcdf330b029e5dc9 | 7b66d83f3b69dae0a3dfb684d7ebe5e9e3f3c913 | /src/solutions/tuesday/afternoon/sets.lean | 7ca1f79ae298561cb2d6f464944ca1d1cb96b69e | [] | permissive | dpochekutov/lftcm2020 | 58a09e10f0e638075b97884d3c2612eb90296adb | cdfbf1ac089f21058e523db73f2476c9c98ed16a | refs/heads/master | 1,669,226,265,076 | 1,594,629,725,000 | 1,594,629,725,000 | 279,213,346 | 1 | 0 | MIT | 1,594,622,757,000 | 1,594,615,843,000 | null | UTF-8 | Lean | false | false | 11,142 | lean | import data.set.basic data.set.lattice data.nat.parity
import tactic.linarith
open set nat function
open_locale classical
variables {α : Type*} {β : Type*} {γ : Type*} {I : Type*}
/-!
## Set exercises
These are collected from *Mathematics in Lean*.
We will go over the examples together, and then let you
work on t... |
6d49f943fca712e19218ad2ac52aefc055eb6e9a | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/algebra/module/ulift.lean | 55abefb3f31183b16b8581ab8320087e6076d360 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,672 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.linear_algebra.basic
import Mathlib.algebra.ring.ulift
import Mathlib.PostPort
universes u... |
68fb6b5e63e1ad63902688cbfb1fdb20ae2cfbee | 52b9f0379b3b0200088f3b2ec594d4dd3d3e6128 | /bquant.lean | 638d0116bf41820f3526542f2b4326731103c936 | [] | no_license | minchaowu/mathematica_examples | f83fdf092a136f157dde8119b8a75c2cd4d91aae | fcc65b0b9fcb854f8671c0ebbca77bb3c1a9ecc1 | refs/heads/master | 1,610,729,580,720 | 1,498,331,049,000 | 1,498,331,049,000 | 99,731,631 | 0 | 0 | null | 1,502,222,706,000 | 1,502,222,706,000 | null | UTF-8 | Lean | false | false | 4,736 | 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
Show that "bounded" quantifiers: (∃x, x < n ∧ P x) and (∀x, x < n → P x)
are decidable when P is decidable.
This module allow us to write if-then-else express... |
c062f30b016057cf2ff01afe523083e6f644693c | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/lean/run/eqThm.lean | a6aa20d52f9fc22da9e2b6e9df07fa4be2b4ca75 | [
"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,428 | lean | def f : Nat → Bool → Nat
| 0, true => 1
| 0, false => 2
| 1, true => 3
| 1, _ => 4
| x+2, true => f x true
| x+2, b => f x (not b)
macro "urfl" : tactic => `(set_option smartUnfolding false in rfl)
theorem f_main_eq : f x b = f.match_1 (fun _ _ => Nat) x b (fun _ => 1) (fun _ => 2) (fun _ => 3) (fun... |
d0630d1a25dfcb8b712d9fd4773aaab98c9088d2 | a959f48a0621edea632487cf2130bbf70d301e05 | /src/squeeze.lean | c493d4e085e810b57f11d7f77627aa310ef40d0f | [] | no_license | cipher1024/lean-differential-topology | cf441b36af9fdb022f10afff6a2fdc5aa4afa379 | 1938b0a5d9e89faff89dac4bc51598698cae6dbb | refs/heads/master | 1,619,477,568,536 | 1,527,790,354,000 | 1,527,790,354,000 | 124,159,851 | 0 | 0 | null | 1,520,385,485,000 | 1,520,385,485,000 | null | UTF-8 | Lean | false | false | 1,691 | lean | import analysis.metric_space
local notation f `→_{`:50 a `}`:0 b := filter.tendsto f (nhds a) (nhds b)
lemma squeeze {X : Type*} [metric_space X] (f g h : X → ℝ) (x₀ : X) (y : ℝ):
(∀ x : X, f x ≤ g x) → (∀ x : X, g x ≤ h x) → (f →_{x₀} y) → (h →_{x₀} y) → (g →_{x₀} y) :=
begin
intros ineq_fg ineq_gh lim_f lim_h... |
7152a98149e7c755c35ad92ee96af820c1bfb3e4 | 84a9fc5d67b057efbf3a74e2eaa539d7f9badc27 | /modexp.lean | 70287211ebf70032cd6d55336b4506f1149b7850 | [] | no_license | agentultra/lean-modexp | 2606769ea3f1c4417d0b4c3d448c655ed97a3f67 | f59a433db8aa7b62d9ae26f0037b4f23cfb7afed | refs/heads/master | 1,610,731,162,684 | 1,502,413,558,000 | 1,502,413,558,000 | 99,747,888 | 0 | 0 | null | 1,502,238,319,000 | 1,502,238,319,000 | null | UTF-8 | Lean | false | false | 5,682 | lean |
import .lib.data.fin
import .lib.data.list
import .lib.data.pow
import data.bitvec
def word_size : ℕ := 32
def window_size : ℕ := 4
def word_vals : ℕ := 2^word_size
def win_vals : ℕ := 2^window_size
lemma window_size_pos
: window_size > 0 :=
of_as_true trivial
lemma win_vals_gt_one
: win_vals > 1 :=
begin
cha... |
7af384f033ebe6b34b80249a16e4a14d6b3e409d | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/data/equiv/ring.lean | 2af4a9500e2c21bd05d4b065b0332083b21043c4 | [
"Apache-2.0"
] | permissive | dupuisf/mathlib | 62de4ec6544bf3b79086afd27b6529acfaf2c1bb | 8582b06b0a5d06c33ee07d0bdf7c646cae22cf36 | refs/heads/master | 1,669,494,854,016 | 1,595,692,409,000 | 1,595,692,409,000 | 272,046,630 | 0 | 0 | Apache-2.0 | 1,592,066,143,000 | 1,592,066,142,000 | null | UTF-8 | Lean | false | false | 10,423 | lean | /-
Copyright (c) 2018 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Callum Sutton, Yury Kudryashov
-/
import data.equiv.mul_add
import algebra.field
import algebra.opposites
import deprecated.ring
/-!
# (Semi)ring equivs
In this file ... |
b4837e0ce52b9807220826ee2269e6f1b1284521 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/category_theory/functor/category.lean | f91b56bef38eebdca69088efb8786505090401a3 | [
"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 | 5,456 | 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.natural_transformation
import category_theory.isomorphism
/-!
# The category of functors and na... |
0384f68ea81404b904725b42c7a549ce7f08db74 | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/tactic/monotonicity/interactive.lean | 2d10e24372a27e39623cf111b81465fe6db56e76 | [
"Apache-2.0"
] | permissive | rmitta/mathlib | 8d90aee30b4db2b013e01f62c33f297d7e64a43d | 883d974b608845bad30ae19e27e33c285200bf84 | refs/heads/master | 1,585,776,832,544 | 1,576,874,096,000 | 1,576,874,096,000 | 153,663,165 | 0 | 2 | Apache-2.0 | 1,544,806,490,000 | 1,539,884,365,000 | Lean | UTF-8 | Lean | false | false | 21,465 | 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.basic
import category.basic
import category.traversable
import category.traversable.derive
import data.dlist
import logic.basic
import tactic.cor... |
7443e73fee42cd75259ea1420492b74883216a99 | d53312f14e4be505a8abcc1969b73308b038f020 | /06-formalizacija-dokazov/dokazi.lean | 8cf8a6454e21eae10e88eac255a4ffed8c92ebcb | [] | no_license | lunar-starlight/teorija-programskih-jezikov | 18ccdfaa9200c10c2b1ec14624419532dd671d25 | bfdf69114a6b13b1ae5735e8749b543f722e5965 | refs/heads/master | 1,667,393,466,506 | 1,577,651,158,000 | 1,577,651,158,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,657 | lean | inductive naravno : Type
| nic : naravno
| nasl : naravno -> naravno
inductive seznam_naravnih_stevil : Type
| prazen : seznam_naravnih_stevil
| sestavljen : naravno -> seznam_naravnih_stevil -> seznam_naravnih_stevil
inductive seznam_dolzine : naravno -> Type
| prazen : seznam_dolzine naravno.nic
| sestavljen : ∀ n,... |
06552c96202ffd53294bab4030b5f47268f56e84 | 618003631150032a5676f229d13a079ac875ff77 | /src/analysis/complex/polynomial.lean | dd067328eaf405519cc46b038cdca52a841bcfba | [
"Apache-2.0"
] | permissive | awainverse/mathlib | 939b68c8486df66cfda64d327ad3d9165248c777 | ea76bd8f3ca0a8bf0a166a06a475b10663dec44a | refs/heads/master | 1,659,592,962,036 | 1,590,987,592,000 | 1,590,987,592,000 | 268,436,019 | 1 | 0 | Apache-2.0 | 1,590,990,500,000 | 1,590,990,500,000 | null | UTF-8 | Lean | false | false | 6,116 | lean | /-
Copyright (c) 2019 Chris Hughes All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import topology.algebra.polynomial
import analysis.special_functions.pow
/-!
# The fundamental theorem of algebra
This file proves that every nonconstant complex polynom... |
4d332984bd4640d8b44bb76e6152b3ad90f315d8 | 97f752b44fd85ec3f635078a2dd125ddae7a82b6 | /hott/algebra/category/precategory.hlean | 63001121f85a8097a856910b60370021fce0f389 | [
"Apache-2.0"
] | permissive | tectronics/lean | ab977ba6be0fcd46047ddbb3c8e16e7c26710701 | f38af35e0616f89c6e9d7e3eb1d48e47ee666efe | refs/heads/master | 1,532,358,526,384 | 1,456,276,623,000 | 1,456,276,623,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 12,173 | hlean | /-
Copyright (c) 2015 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
-/
import types.trunc types.pi arity
open eq is_trunc pi equiv equiv.ops
namespace category
/-
Just as in Coq-HoTT we add two redundant fields to precategories:... |
c313f0fec153bcb049c5a7364dac942c1a05ed20 | 92b50235facfbc08dfe7f334827d47281471333b | /library/logic/identities.lean | f1fde36bff23f40f6bc0d8afbcf88069f96b00ed | [
"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 | 5,572 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura
Useful logical identities. Since we are not using propositional extensionality, some of the
calculations use the type class support provided by... |
0e9a2d0791a7bb7f8b28239d8d6418774e36b0ae | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/topology/algebra/ordered/basic.lean | 36258201e03c3e9c1d1232adc424980105494a81 | [
"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 | 121,358 | 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, Yury Kudryashov
-/
import algebra.group_with_zero.power
import data.set.intervals.pi
import order.filter.interval
import topology.algebra.group
import t... |
06fe5d397eb7782585caae55af069b3eed843db9 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/ring_theory/witt_vector/mul_coeff.lean | 74dc138c4ece95f46fdabeca3764148e8056f3f0 | [
"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 | 12,694 | lean | /-
Copyright (c) 2022 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis, Heather Macbeth
-/
import ring_theory.witt_vector.truncated
import data.mv_polynomial.supported
/-!
# Leading terms of Witt vector multiplication
The goal of this ... |
e8555b4632b90a5f58a730453a2ba828aac79d15 | 4e0d7c3132ce31edc5829849735dd25db406b144 | /lean/love08_operational_semantics_demo.lean | 702968dafa2d9f9939c484ba519f21298a195dd6 | [] | no_license | gonzalgu/logical_verification_2020 | a0013a6c22ea254e9f4d245f2948f0f4d44df4bb | 724d0457dff2c3ff10f9ab2170388f4c5e958b75 | refs/heads/master | 1,660,886,374,533 | 1,589,859,641,000 | 1,589,859,641,000 | 256,069,971 | 0 | 0 | null | 1,586,997,430,000 | 1,586,997,429,000 | null | UTF-8 | Lean | false | false | 21,701 | lean | import .lovelib
/-! # LoVe Demo 8: Operational Semantics
In this and the next two lectures, we will see how to use Lean to specify the
syntax and semantics of programming languages and to reason about the
semantics. -/
set_option pp.beta true
namespace LoVe
/-! ## Formal Semantics
A formal semantics helps speci... |
23ca94e8a2b45f6d8f2e6e4fa8ef52aa66d2b881 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/bench/rbmap500k.lean | 1ad9fdd347d15610ad0e0b4337a97231b6fd6c9b | [
"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,836 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.coe init.data.option.basic init.system.io
universe u v w w'
inductive color
| Red | Black
inductive Tree
| Leaf {} ... |
ba918dee2d6e410aaf016b1f3a5b2f0b3e9fad69 | 592f865bb4e2e537ae3552cb83c32fb99c8d4c68 | /src/README.lean | c58d1512c1a799afe4256b291cb2478719aec1c1 | [] | no_license | BassemSafieldeen/Entropy_and_reversible_catalysis | 250dbb9446690ab89d89a6a512c8f888e09e8596 | 5dd6ee062f61e26bbcf254477e3e24aa3fc489af | refs/heads/master | 1,678,747,213,156 | 1,615,540,586,000 | 1,615,540,586,000 | 322,216,014 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,483 | lean | import linear_algebra.eigenspace
import to_mathlib_maybe.Hilbert_space
import to_mathlib_maybe.pTrace
import to_qShannon_theory_maybe.state
import to_qShannon_theory_maybe.entropy
open_locale tensor_product big_operators
notation `Trₑ ` ρ := bipartite.Tr₂ ρ
variables
{ℋₛ : Type} [complex_hilbert_space ℋₛ]
{ℋₑ : Ty... |
a6f3763275cc78fbdb96c23157b418a5bf502686 | f5f7e6fae601a5fe3cac7cc3ed353ed781d62419 | /src/topology/uniform_space/basic.lean | 11d559a12917fb166a8f23fa12abb173a3ac4897 | [
"Apache-2.0"
] | permissive | EdAyers/mathlib | 9ecfb2f14bd6caad748b64c9c131befbff0fb4e0 | ca5d4c1f16f9c451cf7170b10105d0051db79e1b | refs/heads/master | 1,626,189,395,845 | 1,555,284,396,000 | 1,555,284,396,000 | 144,004,030 | 0 | 0 | Apache-2.0 | 1,533,727,664,000 | 1,533,727,663,000 | null | UTF-8 | Lean | false | false | 42,339 | 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 uniform spaces.
Uniform spaces are a generalization of metric spaces and topological groups. Many concepts directly
generaliz... |
0e7267d51c712d3908a3157d46cdd48dd503130b | bb31430994044506fa42fd667e2d556327e18dfe | /src/geometry/euclidean/angle/oriented/affine.lean | c627fc75e299123bc865280ee5e8dbee3af71b96 | [
"Apache-2.0"
] | permissive | sgouezel/mathlib | 0cb4e5335a2ba189fa7af96d83a377f83270e503 | 00638177efd1b2534fc5269363ebf42a7871df9a | refs/heads/master | 1,674,527,483,042 | 1,673,665,568,000 | 1,673,665,568,000 | 119,598,202 | 0 | 0 | null | 1,517,348,647,000 | 1,517,348,646,000 | null | UTF-8 | Lean | false | false | 44,408 | lean | /-
Copyright (c) 2022 Joseph Myers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Joseph Myers
-/
import analysis.convex.side
import geometry.euclidean.angle.oriented.basic
import geometry.euclidean.angle.unoriented.affine
/-!
# Oriented angles.
This file defines or... |
083f34f9900a5eaeb7852a0e13a5123e7d1d90c4 | ac92829298855d39b757cf1fddca8f058436f027 | /hott/hit/pushout.hlean | 56525a1d14caa6206b3cf32013b59de0b05386d5 | [
"Apache-2.0"
] | permissive | avigad/lean2 | 7af27190b9697b69a13268a133c1d3c8df85d2cf | 34dbd6c3ae612186b8f0f80d12fbf5ae7a059ec9 | refs/heads/master | 1,592,027,477,851 | 1,500,732,234,000 | 1,500,732,234,000 | 75,484,066 | 0 | 0 | null | 1,480,781,056,000 | 1,480,781,056,000 | null | UTF-8 | Lean | false | false | 14,475 | hlean | /-
Copyright (c) 2015-16 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Ulrik Buchholtz, Jakob von Raumer
Declaration and properties of the pushout
-/
import .quotient types.sigma types.arrow_2
open quotient eq sum equiv is_trunc ... |
55259640d181fd38ffa96593f38f9cc4e1449244 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/topology/separation.lean | 3636cee11d7d9c2dc8f4d83f51757135e09cf8f0 | [
"Apache-2.0"
] | permissive | dupuisf/mathlib | 62de4ec6544bf3b79086afd27b6529acfaf2c1bb | 8582b06b0a5d06c33ee07d0bdf7c646cae22cf36 | refs/heads/master | 1,669,494,854,016 | 1,595,692,409,000 | 1,595,692,409,000 | 272,046,630 | 0 | 0 | Apache-2.0 | 1,592,066,143,000 | 1,592,066,142,000 | null | UTF-8 | Lean | false | false | 22,383 | 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
Separation properties of topological spaces.
-/
import topology.subset_properties
open set filter
open_locale topological_space filter
local attribute ... |
79a5bf13ff06bb7fdf1ce7729dca3db1ec8a104d | a11f4536efad51bc2b648123619720f3b9318c0f | /src/intro_bije_card_inf.lean | 622578ae03670c671d879b0640affa8b587dcecc | [] | no_license | ezrasitorus/codewars_lean | 909471d43f5130669a90b8e11afc37aec2f21d8f | 6d1abcc1253403511f4cfd767c645596175e4fd3 | refs/heads/master | 1,672,659,589,352 | 1,603,281,507,000 | 1,603,281,507,000 | 288,579,451 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,283 | lean | import init.function
import tactic
structure iso (A : Type) (B : Type) :=
(a_to_b : A → B)
(b_to_a : B → A)
(a_b_a : ∀ a, b_to_a (a_to_b a) = a)
(b_a_b : ∀ b, a_to_b (b_to_a b) = b)
open function
-- Task 0
-- Find a bijection between bool and bit. (provided for you as an example)
inductive bit : Type
| b0... |
21a723c717af061c559565d7ae8487a610e2aeb6 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/lake/Lake/Config/LeanConfig.lean | 12c17f7eeee6006642f9aa1780a2e81b651e604a | [
"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,633 | lean | /-
Copyright (c) 2022 Mac Malone. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mac Malone
-/
namespace Lake
/--
Lake equivalent of CMake's
[`CMAKE_BUILD_TYPE`](https://stackoverflow.com/a/59314670).
-/
inductive BuildType
/--
Debug optimization, asserts enabled,... |
09408597cb1c23e1d5091cc5c0210a6224cd1aa3 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/order/category/Lattice.lean | 3fa08568307f4151517ab069655b443dbaadb166 | [
"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 | 2,557 | lean | /-
Copyright (c) 2022 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies
-/
import order.category.PartialOrder
import order.hom.lattice
/-!
# The category of lattices
This defines `Lattice`, the category of lattices.
Note that `Lattice` doesn'... |
18cd5488eab29858bd2873162ca8b89b1ba1fb6e | 1e3a43e8ba59c6fe1c66775b6e833e721eaf1675 | /src/algebra/group/units.lean | 873778049066abb7bafa20739d4832e656078ed5 | [
"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 | 7,480 | lean | /-
Copyright (c) 2017 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Mario Carneiro, Johannes, Hölzl, Chris Hughes
-/
import logic.function
import algebra.group.to_additive
/-!
# Units (i.e., invertible elements) of a multiplicative monoid
-/
un... |
def8c59bff7cc29b087b05a237b1f56ad1eae9ea | 022547453607c6244552158ff25ab3bf17361760 | /src/group_theory/group_action/defs.lean | 5a4d2179e4fcea2659571e1d46a301c786ea146f | [
"Apache-2.0"
] | permissive | 1293045656/mathlib | 5f81741a7c1ff1873440ec680b3680bfb6b7b048 | 4709e61525a60189733e72a50e564c58d534bed8 | refs/heads/master | 1,687,010,200,553 | 1,626,245,646,000 | 1,626,245,646,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 13,545 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Yury Kudryashov
-/
import algebra.group.defs
import algebra.group.hom
import logic.embedding
/-!
# Definitions of group actions
This file defines a hierarchy of group act... |
db4fc4752d9ac6fba2009c1e6e587f8d6cf8b3f8 | 5719a16e23dfc08cdea7a5bf035b81690f307965 | /src/Init/Lean/Expr.lean | e04f2500e59e96e02ab202bf976ea8301f7abe56 | [
"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 | 33,696 | lean | /-
Copyright (c) 2018 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.HashMap
import Init.Data.HashSet
import Init.Data.PersistentHashMap
import Init.Data.PersistentHashSet
import Init.Lean.Data.KVMap
... |
0f97ff8b09d27bb4b3ff1194fb099f3ced03f8db | fffbc47930dc6615e66ece42324ce57a21d5b64b | /src/data/complex/exponential.lean | 2e24af0ca312bc01b58ed541d6f2523abd8ef169 | [
"Apache-2.0"
] | permissive | skbaek/mathlib | 3caae8ae413c66862293a95fd2fbada3647b1228 | f25340175631cdc85ad768a262433f968d0d6450 | refs/heads/master | 1,588,130,123,636 | 1,558,287,609,000 | 1,558,287,609,000 | 160,935,713 | 0 | 0 | Apache-2.0 | 1,544,271,146,000 | 1,544,271,146,000 | null | UTF-8 | Lean | false | false | 46,949 | 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
-/
import algebra.archimedean
import data.nat.choose data.complex.basic
import tactic.linarith
local attribute [instance, priority 0] cla... |
edc8e502cca6367d2d2fb16deb82a0bb60fa6fbe | 02005f45e00c7ecf2c8ca5db60251bd1e9c860b5 | /src/ring_theory/witt_vector/init_tail.lean | ddd1dd2611d152311c98580b70e162b220e0af2e | [
"Apache-2.0"
] | permissive | anthony2698/mathlib | 03cd69fe5c280b0916f6df2d07c614c8e1efe890 | 407615e05814e98b24b2ff322b14e8e3eb5e5d67 | refs/heads/master | 1,678,792,774,873 | 1,614,371,563,000 | 1,614,371,563,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,450 | lean | /-
Copyright (c) 2020 Johan Commelin and Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Robert Y. Lewis
-/
import ring_theory.witt_vector.basic
import ring_theory.witt_vector.is_poly
/-!
# `init` and `tail`
Given a Witt vector `x`, ... |
344f8c1636298671663cb77e1092f03241b9c7c8 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/ring_theory/polynomial/gauss_lemma.lean | 66f7b3256fe3b026e8efd10c55d79e2e824f2101 | [
"Apache-2.0"
] | permissive | stjordanis/mathlib | 51e286d19140e3788ef2c470bc7b953e4991f0c9 | 2568d41bca08f5d6bf39d915434c8447e21f42ee | refs/heads/master | 1,631,748,053,501 | 1,627,938,886,000 | 1,627,938,886,000 | 228,728,358 | 0 | 0 | Apache-2.0 | 1,576,630,588,000 | 1,576,630,587,000 | null | UTF-8 | Lean | false | false | 7,922 | lean | /-
Copyright (c) 2020 Aaron Anderson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson
-/
import ring_theory.int.basic
import ring_theory.localization
/-!
# Gauss's Lemma
Gauss's Lemma is one of a few results pertaining to irreducibility of primitive pol... |
b33d78823e6cbe7f140a1a51d59c103f217189d5 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/probability/ident_distrib.lean | b876aaa80a4bc9d644dc15f2554ef06d610c21dd | [
"Apache-2.0"
] | permissive | urkud/mathlib | eab80095e1b9f1513bfb7f25b4fa82fa4fd02989 | 6379d39e6b5b279df9715f8011369a301b634e41 | refs/heads/master | 1,658,425,342,662 | 1,658,078,703,000 | 1,658,078,703,000 | 186,910,338 | 0 | 0 | Apache-2.0 | 1,568,512,083,000 | 1,557,958,709,000 | Lean | UTF-8 | Lean | false | false | 12,302 | lean | /-
Copyright (c) 2022 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 probability.variance
/-!
# Identically distributed random variables
Two random variables defined on two (possibly different) probability spaces but tak... |
28e0041d202dc7b2de163dc60c933c30a07902c9 | a25cc44b447f2fbde61e4b848318762eb892f2bf | /src/itloc.lean | ec4c61a1e003a5ca0def2f9df9449ec3c11c929a | [] | no_license | NeilStrickland/itloc | 20f9b9bcaa4d5840f7f32e84108174b294d84b1a | 5b13b5b418766d10926b983eb3dd2ac42abf63d8 | refs/heads/master | 1,592,747,030,159 | 1,578,138,004,000 | 1,578,138,004,000 | 197,470,135 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 71,117 | 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 file formalises part of the paper "Iterated chromatic
localization" by Nicola Bellumat and Neil Strickland. We have
formalised all of the combinatorial conten... |
e61d881f4d1c3f2de0e0167c28949bd0598115ab | fe84e287c662151bb313504482b218a503b972f3 | /src/commutative_algebra/regular.lean | 66966caec4d502415c8d36ee1194c40bec843e8d | [] | 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 | 3,661 | lean | import algebra.ring
import algebra.group_power group_theory.submonoid
import algebra.geom_sum commutative_algebra.nilpotent
universe u
variables {A : Type u} [comm_ring A]
namespace commutative_algebra
def is_regular (a : A) : Prop := ∀ (x : A), a * x = 0 → x = 0
variable (A)
lemma is_regular_one : is_regular (1 :... |
4aa95c4c9c73bc6b7d66ceb1acd1ed77197ce34b | 4727251e0cd73359b15b664c3170e5d754078599 | /src/set_theory/ordinal/topology.lean | e3d157dfc54442289024d9d8951b29d4b2ed72cf | [
"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,006 | lean | /-
Copyright (c) 2022 Violeta Hernández Palacios. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Violeta Hernández Palacios
-/
import set_theory.ordinal.arithmetic
import topology.algebra.order.basic
/-!
### Topology of ordinals
We prove some miscellaneous results in... |
823a4aca395f2aa1bfe32adbad14be627789b4f7 | 67190c9aacc0cac64fb4463d93e84c696a5be896 | /Lists of exercises/List 6/Lista6-LucasDomingues.lean | 3851767059fc51ca221635351fd30f2950bdac07 | [] | no_license | lucasresck/Discrete-Mathematics | ffbaf55943e7ce2c7bc50cef7e3ef66a0212f738 | 0a08081c5f393e5765259d3f1253c3a6dd043dac | refs/heads/master | 1,596,627,857,734 | 1,573,411,500,000 | 1,573,411,500,000 | 212,489,764 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,780 | lean | -- Estudante: Lucas Emanuel Resck Domingues
open set
variable U : Type
variables A B : set U
lemma eq_of_subset_of_subset {U : Type} {A B : set U} (h1 : A ⊆ B) (h2 : B ⊆ A): A = B := sorry
lemma first {U : Type} {A B : set U}: powerset (A ∩ B) ⊆ powerset A ∩ powerset B :=
assume X,
show X ∈ powerset (A ∩ B... |
2c6aa05b30a09ad05e6407c54b8aab6ff4e88ff9 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/category_theory/limits/shapes/equalizers.lean | 8bfcf93b45f4f9ce4bce13ebc5ea7240c56f85bb | [
"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 | 29,886 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Markus Himmel
-/
import category_theory.epi_mono
import category_theory.limits.limits
/-!
# Equalizers and coequalizers
This file defines (co)equalizers as special ca... |
ff78adce25c6e6580f190b9178948dfdc7db0ba9 | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/geometry/manifold/algebra/smooth_functions.lean | 846b5465be702b01976fd7dc5d21de52552223b8 | [
"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 | 7,954 | lean | /-
Copyright © 2020 Nicolò Cavalleri. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nicolò Cavalleri
-/
import geometry.manifold.algebra.structures
import geometry.manifold.times_cont_mdiff_map
/-!
# Algebraic structures over smooth functions
In this file, we defin... |
4b54fbf293dea196ccff21b9777b70bd70ec6874 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/analysis/special_functions/trigonometric/complex_deriv.lean | a1c2f4550f6e87996d6e846e9da3aa0ec6a77a25 | [
"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 | 2,541 | 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 analysis.special_functions.trigonometric.complex
/-!
# Complex trigonometric functions
Basic f... |
4824d7a36406d64b9c1119f0b9f1c6d3ae1b80be | 1abd1ed12aa68b375cdef28959f39531c6e95b84 | /src/data/rbtree/insert.lean | bd24f7ee40bd43824812e721b3c72dde1d5e74e8 | [
"Apache-2.0"
] | permissive | jumpy4/mathlib | d3829e75173012833e9f15ac16e481e17596de0f | af36f1a35f279f0e5b3c2a77647c6bf2cfd51a13 | refs/heads/master | 1,693,508,842,818 | 1,636,203,271,000 | 1,636,203,271,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 34,166 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import data.rbtree.find
universes u v
local attribute [simp] rbnode.lift
namespace rbnode
variables {α : Type u}
open color
@[simp] lemma balance1_eq₁ (... |
2e08afbb7d68fa5bcf244d2698cafa9778111a24 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/univ_bug1.lean | 5fed27ae578f1dd504fb1db3f56b117e5abfbdd2 | [
"Apache-2.0"
] | permissive | leanprover-community/lean | 12b87f69d92e614daea8bcc9d4de9a9ace089d0e | cce7990ea86a78bdb383e38ed7f9b5ba93c60ce0 | refs/heads/master | 1,687,508,156,644 | 1,684,951,104,000 | 1,684,951,104,000 | 169,960,991 | 457 | 107 | Apache-2.0 | 1,686,744,372,000 | 1,549,790,268,000 | C++ | UTF-8 | Lean | false | false | 1,048 | lean | ----------------------------------------------------------------------------------------------------
--- Copyright (c) 2014 Microsoft Corporation. All rights reserved.
--- Released under Apache 2.0 license as described in the file LICENSE.
--- Author: Jeremy Avigad
------------------------------------------------------... |
c3f2ac2c1627d1f3cb09f98fffd59166c9739b48 | 5719a16e23dfc08cdea7a5bf035b81690f307965 | /stage0/src/Init/Lean/Delaborator.lean | 28ca37e83b768a78dacbad65b2c113335d36e741 | [
"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 | 18,909 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
-/
/-!
The delaborator is the first stage of the pretty printer, and the inverse of the
elaborator: it turns fully elaborated `Expr` core terms back into surf... |
aef62f19fd89f2565c7794ecf826974b419ad432 | efa51dd2edbbbbd6c34bd0ce436415eb405832e7 | /20161026_ICTAC_Tutorial/ex19.lean | 82dc15f7c2afccdba74db7597ef6ab3d46eae08a | [
"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 | 215 | lean | variables (A B C : Type)
variables (g : B → C) (f : A → B) (h : A → A)
variable x : A
def compose := g (f x)
def do_twice := h (h x)
def do_thrice := h (h (h x))
print compose
print do_twice
print do_thrice
|
d3ec940917c72ee5370b19cd2e521991094d6cfa | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/field_theory/minpoly.lean | 4196cadcea6869e4c46f25fbf6517127738e0f99 | [] | 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 | 11,220 | lean | /-
Copyright (c) 2019 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Johan Commelin
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.ring_theory.integral_closure
import Mathlib.data.polynomial.field_division
impo... |
9b93364098f5f1068752e14dddcb0eb74db62e8c | 4727251e0cd73359b15b664c3170e5d754078599 | /src/category_theory/sites/spaces.lean | cd20ac5cdb4261076f87bfaf0a6f029a1be5950e | [
"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 | 3,536 | 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.sites.grothendieck
import category_theory.sites.pretopology
import category_theory.limits.lattice
import topology.sets.opens
/-!
# Grothendieck to... |
3d937a45f674f7d230bcaa205492959a80195de6 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/lean/run/flat_expr.lean | aab6e134539a17d6d7fc8abd5bd77d28922986e8 | [
"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 | 2,362 | lean | import Std
inductive Expr where
| var (i : Nat)
| op (lhs rhs : Expr)
def List.getIdx : List α → Nat → α → α
| [], i, u => u
| a::as, 0, u => a
| a::as, i+1, u => getIdx as i u
structure Context (α : Type u) where
op : α → α → α
unit : α
assoc : (a b c : α) → op (op a b) c = op a (op b c)... |
f8e0954e640b7a1dc1939558b3d137dc76bcdde7 | 0af6d26e9f8331d7bec8783227838f554953962c | /lean-1.lean | 50f0698aa1c72f43ddaa4f40b6637803c2abb374 | [] | no_license | LorenzoEvans/Theorem-Proving-In-Lean | 79f081e582e318efab76d727e114baf686448885 | 816d9f5d8153c60bdd264e76dae90537774e0526 | refs/heads/master | 1,621,585,653,664 | 1,586,055,238,000 | 1,586,055,238,000 | 252,618,889 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,401 | lean | constant m : nat
-- m is a natural number
constant n : nat
-- n is a constant number
-- constant f : nat → nat
constant f'' : ℕ -> ℕ
-- constant p : nat × nat
constant q : prod nat nat
-- constant g : nat → nat → nat
constant g' : nat → (nat → nat)
-- constant h : nat × nat → nat
constant F : (nat → nat) → nat
con... |
b2cee5fc7f9276723fae60f150b35a47a242c6d0 | 618003631150032a5676f229d13a079ac875ff77 | /src/set_theory/game/state.lean | 21978ae26b3a2700f197bbcaec5a269e4defcb0c | [
"Apache-2.0"
] | permissive | awainverse/mathlib | 939b68c8486df66cfda64d327ad3d9165248c777 | ea76bd8f3ca0a8bf0a166a06a475b10663dec44a | refs/heads/master | 1,659,592,962,036 | 1,590,987,592,000 | 1,590,987,592,000 | 268,436,019 | 1 | 0 | Apache-2.0 | 1,590,990,500,000 | 1,590,990,500,000 | null | UTF-8 | Lean | false | false | 8,376 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import set_theory.game.short
/-!
# Games described via "the state of the board".
We provide a simple mechanism for constructing combinatorial (pre-)games, by descri... |
4723e294e0e0afb80fdc2a20170a2373ffb05543 | bdb33f8b7ea65f7705fc342a178508e2722eb851 | /data/int/modeq.lean | 53d156d742bea7c94d5d20f471b490a5ba83e541 | [
"Apache-2.0"
] | permissive | rwbarton/mathlib | 939ae09bf8d6eb1331fc2f7e067d39567e10e33d | c13c5ea701bb1eec057e0a242d9f480a079105e9 | refs/heads/master | 1,584,015,335,862 | 1,524,142,167,000 | 1,524,142,167,000 | 130,614,171 | 0 | 0 | Apache-2.0 | 1,548,902,667,000 | 1,524,437,371,000 | Lean | UTF-8 | Lean | false | false | 3,306 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import data.int.basic data.nat.modeq
namespace int
def modeq (n a b : ℤ) := a % n = b % n
notation a ` ≡ `:50 b ` [ZMOD `:50 n `]`:0 := modeq n a b
namespace modeq
v... |
f1f0dfcd05752f9797d3117608b1ed18225b1d8d | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /archive/100-theorems-list/93_birthday_problem.lean | af7b9325e6a9428d5497129b8e4f51f41a80b7ac | [
"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 | 759 | lean | /-
Copyright (c) 2021 Eric Rodriguez. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Eric Rodriguez
-/
import data.fintype.card_embedding
/-!
# Birthday Problem
This file proves Theorem 93 from the [100 Theorems List](https://www.cs.ru.nl/~freek/100/).
As opposed to... |
9f23d13112ad4375ca39bef0f5867575803b3a1d | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/652.lean | 17eab4846a74b5f2da255a81997e4f8d236b6100 | [
"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 | 357 | lean | section
parameters {b c : bool}
definition R : Prop := (b = c)
parameters (b c)
definition R2 := R
parameter (c)
parameter (b)
definition R3 := R
parameter {c}
parameter (b)
definition R4 := R
parameters {c b}
definition R5 := R
parameters (c)
definition R6 := R
end
check @R
check @R2
che... |
348175a48e2152c3dd21302e1b7de2402344fb04 | 037dba89703a79cd4a4aec5e959818147f97635d | /src/2022/sets/sheet2.lean | 50861d8c1c8be317a9a0ac08eaa9712e0302580d | [] | 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 | 1,985 | lean | /-
Copyright (c) 2022 Kevin Buzzard. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author : Kevin Buzzard
-/
import tactic -- imports all the Lean tactics
/-!
# Sets in Lean, example sheet 2 : the empty set and the "universal set".
We know what the empty subset of `X` is, ... |
9f2c9a9f50082f29e428a5c102665afd647935c8 | de91c42b87530c3bdcc2b138ef1a3c3d9bee0d41 | /old/not_in_use/accelerationOverride.lean | da18b62e05b707178cbff37c00aad57122fc3322 | [] | no_license | kevinsullivan/lang | d3e526ba363dc1ddf5ff1c2f36607d7f891806a7 | e9d869bff94fb13ad9262222a6f3c4aafba82d5e | refs/heads/master | 1,687,840,064,795 | 1,628,047,969,000 | 1,628,047,969,000 | 282,210,749 | 0 | 1 | null | 1,608,153,830,000 | 1,595,592,637,000 | Lean | UTF-8 | Lean | false | false | 373 | lean | import ..imperative_DSL.environment
import ..eval.accelerationEval
open lang.classicalAcceleration
def assignAcceleration : environment.env → lang.classicalAcceleration.var → lang.classicalAcceleration.expr → environment.env
| i v e := environment.env.mk i.g i.t i.v
(λ r, if (varEq v r)
then (classic... |
9cb5a3587e753b7b67a784c612de99271dbc05f8 | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /tests/lean/slow/list_elab2.lean | 8c968363d844aba9284b311c4d63a0764a2f543e | [
"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 | 7,986 | lean | ----------------------------------------------------------------------------------------------------
--- Copyright (c) 2014 Parikshit Khanna. All rights reserved.
--- Released under Apache 2.0 license as described in the file LICENSE.
--- Authors: Parikshit Khanna, Jeremy Avigad
----------------------------------------... |
eaa031a843f0650f9f5774a48a0e3af8aabc0697 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/order/category/Preorder.lean | 853e3b2a3aefa49178bc1105bd7c08ee624e819d | [
"Apache-2.0"
] | permissive | robertylewis/mathlib | 3d16e3e6daf5ddde182473e03a1b601d2810952c | 1d13f5b932f5e40a8308e3840f96fc882fae01f0 | refs/heads/master | 1,651,379,945,369 | 1,644,276,960,000 | 1,644,276,960,000 | 98,875,504 | 0 | 0 | Apache-2.0 | 1,644,253,514,000 | 1,501,495,700,000 | Lean | UTF-8 | Lean | false | false | 1,832 | 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 category_theory.concrete_category.bundled_hom
import algebra.punit_instances
import order.hom.basic
/-!
# Category of preorders
This defines `Preorder`, the ... |
b310e7dc845fd0a0f633e505c4351b24f4402834 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/topology/category/Profinite/projective.lean | 64b5bef31b32524d4251fd1411ea99611970e58a | [
"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,108 | lean | /-
Copyright (c) 2021 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import topology.category.Profinite.basic
import topology.stone_cech
import category_theory.preadditive.projective
/-!
# Profinite sets have enough projectives
> TH... |
9093c33b1e1a86808880f5a429758415f704a258 | 1b8f093752ba748c5ca0083afef2959aaa7dace5 | /src/category_theory/adjunctions/examples/functor_categories.lean | 244d31cc02788c1b1acefdfd86bde7de4fbf4849 | [] | no_license | khoek/lean-category-theory | 7ec4cda9cc64a5a4ffeb84712ac7d020dbbba386 | 63dcb598e9270a3e8b56d1769eb4f825a177cd95 | refs/heads/master | 1,585,251,725,759 | 1,539,344,445,000 | 1,539,344,445,000 | 145,281,070 | 0 | 0 | null | 1,534,662,376,000 | 1,534,662,376,000 | null | UTF-8 | Lean | false | false | 849 | lean | -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Scott Morrison
import category_theory.adjunctions
open category_theory
namespace categories.adjunctions
universes u₁ u₂ u₃
variable {C : Type (u₁+1)}
variable [large_categor... |
faeae50843d1052685643c27cbf88f681df4a945 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/category_theory/category/preorder.lean | ab0380b5f2c29b83260db4f97c8bed2d78defb77 | [
"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 | 5,830 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Stephen Morgan, Scott Morrison, Johannes Hölzl, Reid Barton
-/
import category_theory.category.Cat
import order.category.Preorder
/-!
# Preorders as categories
We install a categor... |
d3dfa30613d31ecfe09173d8925c64e184f6c044 | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/data/int/gcd.lean | ff236b40e01bde844a420e00a153cdba5708b2a1 | [
"Apache-2.0"
] | permissive | ilitzroth/mathlib | ea647e67f1fdfd19a0f7bdc5504e8acec6180011 | 5254ef14e3465f6504306132fe3ba9cec9ffff16 | refs/heads/master | 1,680,086,661,182 | 1,617,715,647,000 | 1,617,715,647,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 14,625 | lean | /-
Copyright (c) 2018 Guy Leroy. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sangwoo Jo (aka Jason), Guy Leroy, Johannes Hölzl, Mario Carneiro
-/
import data.nat.prime
/-!
# Extended GCD and divisibility over ℤ
## Main definitions
* Given `x y : ℕ`, `xgcd x y` com... |
567d5cf4edc0993a6bd84f8e8450fa0a00bfa775 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/readDir.lean | de87492dcd54b70d3f52acdb6857485c71225ec1 | [
"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 | 50 | lean | #eval repr <$> System.FilePath.readDir "Reformat"
|
4cabf879ffbb8341b41aa8a4c391a954abb08843 | 367134ba5a65885e863bdc4507601606690974c1 | /src/algebra/category/Group/biproducts.lean | ef00e2626a7ca3caee2e0454ac9c62041b8f9c39 | [
"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,649 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import algebra.category.Group.limits
import algebra.category.Group.preadditive
import category_theory.limits.shapes.biproducts
import category_theory.limits.shapes.ty... |
adc5c27f848ab95f3471e5b56c7874d5dfadbce0 | 75db7e3219bba2fbf41bf5b905f34fcb3c6ca3f2 | /tests/lean/run/blast_tuple2.lean | eca1cd6697c28dce985c0f6dbc7659ba7d7a0eb4 | [
"Apache-2.0"
] | permissive | jroesch/lean | 30ef0860fa905d35b9ad6f76de1a4f65c9af6871 | 3de4ec1a6ce9a960feb2a48eeea8b53246fa34f2 | refs/heads/master | 1,586,090,835,348 | 1,455,142,203,000 | 1,455,142,277,000 | 51,536,958 | 1 | 0 | null | 1,455,215,811,000 | 1,455,215,811,000 | null | UTF-8 | Lean | false | false | 3,352 | lean | import data.fin
open function
constant tuple.{l} : Type.{l} → nat → Type.{l}
constant nil {A : Type} : tuple A 0
constant cons {A : Type} {n : nat} : A → tuple A n → tuple A (nat.succ n)
constant append {A : Type} {n m : nat} : tuple A n → tuple A m → tuple A (n + m)
constant reverse {A : Type} {n : nat} : tuple A n →... |
4b3efd514b6eb7f2139da0ea649bf6f69808fcba | 4fa161becb8ce7378a709f5992a594764699e268 | /src/order/filter/bases.lean | b14d487caec3839a5880dcfcbae801963d4c4c57 | [
"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 | 31,244 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Yury Kudryashov, Johannes Hölzl, Mario Carneiro, Patrick Massot
-/
import order.filter.at_top_bot
import data.set.countable
/-!
# Filter bases
A filter basis `B : filter_basis α` on ... |
891e1c38aa3b4a4c4d02b81a916abe99c375cc8b | c86b74188c4b7a462728b1abd659ab4e5828dd61 | /src/Lean/Elab/Term.lean | f73a3103d004285e15302478fb4a16f68653a2b7 | [
"Apache-2.0"
] | permissive | cwb96/lean4 | 75e1f92f1ba98bbaa6b34da644b3dfab2ce7bf89 | b48831cda76e64f13dd1c0edde7ba5fb172ed57a | refs/heads/master | 1,686,347,881,407 | 1,624,483,842,000 | 1,624,483,842,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 74,501 | 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.Util.Sorry
import Lean.Util.ReplaceExpr
import Lean.Structure
import Lean.Meta.ExprDefEq
import Lean.... |
21945e227c29f109cf0fd4e5b873a8f8c457a31e | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/CompilerCSE.lean | be616f278add6095ae0dfc9cc74ebf9a06afe8fb | [
"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 | 626 | lean | import Lean.Compiler.Main
import Lean.Compiler.LCNF.Testing
import Lean.Elab.Do
open Lean
open Lean.Compiler.LCNF
-- Run compilation twice to avoid the output caused by the inliner
#eval Compiler.compile #[``Lean.Meta.synthInstance, ``Lean.Elab.Term.Do.elabDo]
@[cpass]
def cseFixTest : PassInstaller := Testing.asser... |
64a4d2b42ad7aedd3eb5c556d0c5a618bd8b380f | 4e3bf8e2b29061457a887ac8889e88fa5aa0e34c | /lean/love01_definitions_and_lemma_statements_homework_sheet.lean | 9f97383f079a8b253973e9749084a062e5245fc8 | [] | no_license | mukeshtiwari/logical_verification_2019 | 9f964c067a71f65eb8884743273fbeef99e6503d | 16f62717f55ed5b7b87e03ae0134791a9bef9b9a | refs/heads/master | 1,619,158,844,208 | 1,585,139,500,000 | 1,585,139,500,000 | 249,906,380 | 0 | 0 | null | 1,585,118,728,000 | 1,585,118,727,000 | null | UTF-8 | Lean | false | false | 1,653 | lean | /- LoVe Homework 1: Definitions and Lemma Statements -/
/- Replace the placeholders (e.g., `:= sorry`) with your solutions. -/
import .lovelib
namespace LoVe
/- Question 1: Snoc -/
/- 1.1. Define the function `snoc` that appends a single element to the end of
a list. -/
def snoc {α : Type} : list α → α → list α
... |
7eb1a8e5c7b065b259754d5e75555a20fb548d5b | fcf3ffa92a3847189ca669cb18b34ef6b2ec2859 | /src/world6/level8.lean | 4438c17c7f16af0889eeed41289b1955498d3ebb | [
"Apache-2.0"
] | permissive | nomoid/lean-proofs | 4a80a97888699dee42b092b7b959b22d9aa0c066 | b9f03a24623d1a1d111d6c2bbf53c617e2596d6a | refs/heads/master | 1,674,955,317,080 | 1,607,475,706,000 | 1,607,475,706,000 | 314,104,281 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 231 | lean | lemma not_iff_imp_false (P : Prop) : ¬ P ↔ P → false := iff.rfl
example (P Q : Prop) : (P → Q) → (¬ Q → ¬ P) :=
begin
repeat {rw not_iff_imp_false},
intros pq qf p,
apply qf,
apply pq,
exact p,
end |
26f2be5cfa22eb31f5681813061a4daecfc82e77 | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/data/list/perm.lean | 3240c72f788a16fc6f3c3483ac23f1d873e675b5 | [
"Apache-2.0"
] | permissive | waynemunro/mathlib | e3fd4ff49f4cb43d4a8ded59d17be407bc5ee552 | 065a70810b5480d584033f7bbf8e0409480c2118 | refs/heads/master | 1,693,417,182,397 | 1,634,644,781,000 | 1,634,644,781,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 54,160 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Jeremy Avigad, Mario Carneiro
-/
import data.list.bag_inter
import data.list.erase_dup
import data.list.permutation
import data.list.zip
import logic.relation... |
9629a35f2eaebbb8e99f5c9997c9982474ef4c35 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebraic_geometry/projective_spectrum/scheme.lean | 1ae0d6c22164a7a2c0293f3b18790439ee4fbb84 | [
"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 | 22,433 | lean | /-
Copyright (c) 2022 Jujian Zhang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jujian Zhang
-/
import algebraic_geometry.projective_spectrum.structure_sheaf
import algebraic_geometry.Spec
import ring_theory.graded_algebra.radical
/-!
# Proj as a scheme
This file ... |
76ff14ddd29de166770e01bd33d68c790912f75d | 7a14c92ca487a5bae1f8059518914887863eeb97 | /.config.lean | a9546c372d636591d736a55bca8e87ff63012e90 | [
"MIT"
] | permissive | se0lus/MT1300 | 5ea32a7bc19507a644a16969b9d2b5e5a718f1c9 | 0b35b2fb54cddd4eaa74af03cd47493edf359565 | refs/heads/main | 1,688,477,034,302 | 1,628,572,811,000 | 1,628,572,811,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 249,738 | lean | #
# Automatically generated file; DO NOT EDIT.
# OpenWrt Configuration
#
CONFIG_MODULES=y
CONFIG_HAVE_DOT_CONFIG=y
# CONFIG_TARGET_sunxi is not set
# CONFIG_TARGET_apm821xx is not set
# CONFIG_TARGET_ath25 is not set
# CONFIG_TARGET_ar71xx is not set
# CONFIG_TARGET_ath79 is not set
# CONFIG_TARGET_bcm27xx is not set
... |
8554bd45d5c7e3930e66f7a133adb167aa6b0c14 | 618003631150032a5676f229d13a079ac875ff77 | /test/rename_var.lean | 098ce807abfc9d7b50539084f5193698be38f347 | [
"Apache-2.0"
] | permissive | awainverse/mathlib | 939b68c8486df66cfda64d327ad3d9165248c777 | ea76bd8f3ca0a8bf0a166a06a475b10663dec44a | refs/heads/master | 1,659,592,962,036 | 1,590,987,592,000 | 1,590,987,592,000 | 268,436,019 | 1 | 0 | Apache-2.0 | 1,590,990,500,000 | 1,590,990,500,000 | null | UTF-8 | Lean | false | false | 685 | lean | import tactic.rename_var
example (P : ℕ → ℕ → Prop) (h : ∀ n, ∃ m, P n m) : true :=
begin
rename_var n q at h,
guard_hyp_strict h := ∀ (q : ℕ), ∃ (m : ℕ), P q m,
rename_var m z at h,
guard_hyp_strict h := ∀ (q : ℕ), ∃ (z : ℕ), P q z,
trivial
end
example (P : ℕ → ℕ → Prop) (h : ∀ n, ∃ m, P n m) : ∀ n, ∃ m,... |
e82549f28ba43b3e7a0d8dd4c4e953707abd4f12 | 12dabd587ce2621d9a4eff9f16e354d02e206c8e | /world06/level01.lean | 3007aed2e83e412a648eb9e59566e50ecb4d28b4 | [] | no_license | abdelq/natural-number-game | a1b5b8f1d52625a7addcefc97c966d3f06a48263 | bbddadc6d2e78ece2e9acd40fa7702ecc2db75c2 | refs/heads/master | 1,668,606,478,691 | 1,594,175,058,000 | 1,594,175,058,000 | 278,673,209 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 72 | lean | example (P Q : Prop) (p : P) (h : P → Q) : Q :=
begin
exact h(p),
end
|
32dffa9c7e9a033d5e30aeeb5fb90da2180210b8 | efce24474b28579aba3272fdb77177dc2b11d7aa | /src/homotopy_theory/formal/i_category/lemmas.lean | 364febd7b22f3b8642650f92b295032b1bbc94f0 | [
"Apache-2.0"
] | permissive | rwbarton/lean-homotopy-theory | cff499f24268d60e1c546e7c86c33f58c62888ed | 39e1b4ea1ed1b0eca2f68bc64162dde6a6396dee | refs/heads/lean-3.4.2 | 1,622,711,883,224 | 1,598,550,958,000 | 1,598,550,958,000 | 136,023,667 | 12 | 6 | Apache-2.0 | 1,573,187,573,000 | 1,528,116,262,000 | Lean | UTF-8 | Lean | false | false | 1,610 | lean | import category_theory.colimit_lemmas
import .definitions
universes v u
open category_theory
open category_theory.category
local notation f ` ∘ `:80 g:80 := g ≫ f
namespace homotopy_theory.cofibrations
open category_theory.has_initial_object category_theory.preserves_initial_object
open category_theory.preserves_cop... |
d4dbe35e9499f048d46fd2b550824df073fd85c7 | 46125763b4dbf50619e8846a1371029346f4c3db | /src/algebra/ring.lean | 3877aab0cc655b17a909e34f0fe7308d9a136b7c | [
"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 | 27,435 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Floris van Doorn, Amelia Livingston
-/
import algebra.group.with_one
import deprecated.group
import tactic.norm_cast
/-!
# Properties and homomorphis... |
50180c3e312ea02af692becd7b20c98b2297a5ab | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebra/continued_fractions/translations.lean | 5849efbafcf652f8f71a65afe167a16ea7a1a743 | [
"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,959 | lean | /-
Copyright (c) 2019 Kevin Kappelmann. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Kappelmann
-/
import algebra.continued_fractions.basic
/-!
# Basic Translation Lemmas Between Functions Defined for Continued Fractions
## Summary
Some simple translation lem... |
ef06c45c76dea21ef5a3c8814ed0b00fc65ebf52 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/order/min_max.lean | 46d96d9a40b4d0eb32fd346c95fbb369d2fbc9c8 | [
"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 | 7,751 | 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 order.lattice
/-!
# `max` and `min`
This file proves basic properties about maxima and minima on a `linear_order`.
## Tags
min, max
-/
universes u v
varia... |
0fa506cb43e682b902ab45716ff288f8ecf844e3 | 2fbe653e4bc441efde5e5d250566e65538709888 | /src/analysis/normed_space/basic.lean | a28862f7608335ac1bef0ce7526315bddde2cff3 | [
"Apache-2.0"
] | permissive | aceg00/mathlib | 5e15e79a8af87ff7eb8c17e2629c442ef24e746b | 8786ea6d6d46d6969ac9a869eb818bf100802882 | refs/heads/master | 1,649,202,698,930 | 1,580,924,783,000 | 1,580,924,783,000 | 149,197,272 | 0 | 0 | Apache-2.0 | 1,537,224,208,000 | 1,537,224,207,000 | null | UTF-8 | Lean | false | false | 35,477 | lean | /-
Copyright (c) 2018 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Normed spaces.
Authors: Patrick Massot, Johannes Hölzl
-/
import algebra.pi_instances
import linear_algebra.basic
import topology.instances.nnreal topology.instances.complex
import topology.a... |
723ed57a37d3960c2ece3497e45e6754cf309a3a | ae1e94c332e17c7dc7051ce976d5a9eebe7ab8a5 | /tests/compiler/StackOverflowTask.lean | 1f4d314c9109c4fb305519cff1c5f8fa110f17f7 | [
"Apache-2.0"
] | permissive | dupuisf/lean4 | d082d13b01243e1de29ae680eefb476961221eef | 6a39c65bd28eb0e28c3870188f348c8914502718 | refs/heads/master | 1,676,948,755,391 | 1,610,665,114,000 | 1,610,665,114,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 147 | lean | #lang lean4
partial def foo : Nat → Nat | n => foo n + 1
@[neverExtract]
def main : IO Unit := IO.println $ Task.get $ Task.spawn fun _ => foo 0
|
00aeab43be2b0fc523989daa30c12ab213753ed7 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/run/elab_crash1.lean | de1b787d671ddae05c4f28e48d8f96ac67adfdae | [
"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 | 321 | lean | open expr tactic
meta_definition to_expr_target (a : pexpr) : tactic expr :=
do tgt ← target,
to_expr `((%%a : %%tgt))
example (A : Type) (a : A) : A :=
by do to_expr_target `(sorry) >>= exact
example (A : Type) (a : A) : A :=
by do refine `(sorry)
example (a : nat) : nat :=
by do to_expr `(nat.zero) >>= exact
|
790c41bffb583668b7cd90904ffaf0d738b5302c | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/order/group/densely_ordered.lean | eb80253c691380c3f4255b18a4953b1c7489f4cb | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 1,388 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Mario Carneiro, Johannes Hölzl
-/
import algebra.order.monoid.canonical.defs
import algebra.order.group.defs
import algebra.order.monoid.order_dual
/-... |
9f15ede88e2267f541c582919fc9d75daac11579 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/limits/constructions/over/connected.lean | c09beeb8112d468b91d0ce201b4022da758861cf | [
"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 | 3,014 | lean | /-
Copyright (c) 2018 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Reid Barton, Bhavik Mehta
-/
import category_theory.limits.creates
import category_theory.over
import category_theory.is_connected
/-!
# Connected limits in the over c... |
5382877044d26e98f0383056ef29488e49d2b18c | 618003631150032a5676f229d13a079ac875ff77 | /docs/tutorial/category_theory/Ab.lean | 772bf9e7e0a521eb95e7f2f88eb5d5f6771df50b | [
"Apache-2.0"
] | permissive | awainverse/mathlib | 939b68c8486df66cfda64d327ad3d9165248c777 | ea76bd8f3ca0a8bf0a166a06a475b10663dec44a | refs/heads/master | 1,659,592,962,036 | 1,590,987,592,000 | 1,590,987,592,000 | 268,436,019 | 1 | 0 | Apache-2.0 | 1,590,990,500,000 | 1,590,990,500,000 | null | UTF-8 | Lean | false | false | 577 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import algebra.category.Group
import category_theory.limits.shapes.kernels
open category_theory
open category_theory.limits
/-!
Some small examples of using limits ... |
c41eb2e20bd3354ffbfe70655dbe56e18f30bed9 | 274748215b6d042f0d9c9a505f9551fa8e0c5f38 | /src/affine_algebraic_set/union.lean | 504c2c1053b02a7995dda84e8ba7c8bc8e3f738e | [
"Apache-2.0"
] | permissive | ImperialCollegeLondon/M4P33 | 878ecb515c77d20cc799ff1ebd78f1bf4fd65c12 | 1a179372db71ad6802d11eacbc1f02f327d55f8f | refs/heads/master | 1,607,519,867,193 | 1,583,344,297,000 | 1,583,344,297,000 | 233,316,107 | 59 | 4 | Apache-2.0 | 1,579,285,778,000 | 1,578,788,367,000 | Lean | UTF-8 | Lean | false | false | 7,280 | lean | /-
Algebraic geometry lecture 1:
The union of two algebraic sets is an algebraic set.
Kevin Buzzard
-/
import affine_algebraic_set.basic -- the basic theory of affine algebraic sets.
/-!
# The union of two affine algebraic sets is affine.
Let k be a field and let n be a natural number. We prove the following
theor... |
5da69aa944526e0af5e5858fa9e82ab3ad14793b | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/topology/metric_space/gromov_hausdorff_realized.lean | d4c8ea3a88b514c396fcbc970e04220e86b504f7 | [
"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 | 26,268 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import topology.metric_space.gluing
import topology.metric_space.hausdorff_distance
import topology.continuous_function.bounded
/-!
# The Gromov-Hausdorff dist... |
6fa6877cfd800582c7fefe2e3466dc7d28a4594e | 2fbe653e4bc441efde5e5d250566e65538709888 | /src/tactic/basic.lean | 0ae372875b6ae12eea6717e33611b1f9019013bc | [
"Apache-2.0"
] | permissive | aceg00/mathlib | 5e15e79a8af87ff7eb8c17e2629c442ef24e746b | 8786ea6d6d46d6969ac9a869eb818bf100802882 | refs/heads/master | 1,649,202,698,930 | 1,580,924,783,000 | 1,580,924,783,000 | 149,197,272 | 0 | 0 | Apache-2.0 | 1,537,224,208,000 | 1,537,224,207,000 | null | UTF-8 | Lean | false | false | 475 | lean | import
tactic.alias
tactic.cache
tactic.clear
tactic.converter.interactive
tactic.core
tactic.ext
tactic.generalize_proofs
tactic.interactive
tactic.suggest
tactic.lift
tactic.localized
tactic.mk_iff_of_inductive_prop
tactic.push_neg
tactic.rcases
tactic.rename
tactic.replacer
tactic.r... |
8766edd92bcb963efb46710c2328d6422481ba4e | c777c32c8e484e195053731103c5e52af26a25d1 | /src/ring_theory/is_adjoin_root.lean | 087a07edd462b31239011afe25778fbf325d341f | [
"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 | 27,509 | lean | /-
Copyright (c) 2022 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen
-/
import data.polynomial.algebra_map
import field_theory.minpoly.is_integrally_closed
import ring_theory.power_basis
/-!
# A predicate on adjoining roots of polynomial
This... |
632183a0c42c6da1650ad9c6a47c11516f3f1493 | fe84e287c662151bb313504482b218a503b972f3 | /src/try.lean | b730a641b88146fea8451bb1c855b70bf5a12fb4 | [] | 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 | 1,318 | lean | import algebra.ring
import data.list.min_max data.polynomial
import order.lattice_extra
set_option pp.all false
instance R0 : comm_ring bool := begin
letI : has_zero bool := ⟨ff⟩,
letI : has_add bool := ⟨bxor⟩,
letI : has_neg bool := ⟨id⟩,
letI : has_one bool := ⟨tt⟩,
letI : has_mul bool := ⟨band⟩,
refine_stru... |
47b435f2a361f00f02f518a49dcc4b028f099f84 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/tactic/omega/int/dnf.lean | 561ba2f5019b784dfaaba35ac27003e0b63b12f2 | [
"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 | 6,263 | lean | /- Copyright (c) 2019 Seul Baek. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Seul Baek
DNF transformation. -/
import tactic.omega.clause
import tactic.omega.int.form
namespace omega
namespace int
open_locale omega.int
/-- push_neg p returns the result of normaliz... |
2db682ae1a4f89706e86b020902dc4fc264bbdcd | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/forest_height.lean | f5c0dad7e7e52884f9ef957b1581093b3b9c1c90 | [
"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 | 4,300 | lean | import data.nat data.sum data.sigma data.bool
open nat sigma algebra
inductive tree (A : Type) : Type :=
| node : A → forest A → tree A
with forest : Type :=
| nil : forest A
| cons : tree A → forest A → forest A
namespace manual
check tree.rec_on
definition tree.height {A : Type} (t : tree A) : nat :=
tree.rec_on ... |
b4024d25fb38d0ac2d80841ae2915b3ecb1fbc7a | 37da0369b6c03e380e057bf680d81e6c9fdf9219 | /hott/hit/quotient.hlean | 737c63f041edd3891e232b8549d847d73084196b | [
"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 | 13,679 | hlean | /-
Copyright (c) 2015 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Ulrik Buchholtz
Quotients. This is a quotient without truncation for an arbitrary type-valued binary relation.
See also .set_quotient
-/
/-
The hit quotient is ... |
89f372bcaa4e3f891fee8a0b8fc2fcb7839613ac | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /test/simps.lean | 9fc1d7553696582693a855b8b9c03a65f8103c30 | [
"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 | 35,918 | lean | import algebra.group.hom
import data.sum.basic
import tactic.simps
universes v u w
-- set_option trace.simps.verbose true
-- set_option trace.simps.debug true
-- set_option trace.app_builder true
open function tactic expr
structure equiv (α : Sort*) (β : Sort*) :=
(to_fun : α → β)
(inv_fun : β → α)
(left_inv ... |
a096b28b234d6088e991ada8207a4e48478d84da | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/linear_algebra/dimension.lean | 49171e5a0333cedca5f5601b39c8474b853b3a3c | [
"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 | 31,138 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Johannes Hölzl, Sander Dahmen
-/
import linear_algebra.basis
import linear_algebra.std_basis
import set_theory.cardinal_ordinal
/-!
# Dimension of modules and vector s... |
73584f86cb14ac51df2f2e3d094a7af9b71cef39 | 7565ffb53cc64430691ce89265da0f944ee43051 | /hott/homotopy/join.hlean | 79d042cdbf3c226c29b620bffc325470929d5fb6 | [
"Apache-2.0"
] | permissive | EgbertRijke/lean2 | cacddba3d150f8b38688e044960a208bf851f90e | 519dcee739fbca5a4ab77d66db7652097b4604cd | refs/heads/master | 1,606,936,954,854 | 1,498,836,083,000 | 1,498,910,882,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 22,790 | hlean | /-
Copyright (c) 2015 Jakob von Raumer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jakob von Raumer, Ulrik Buchholtz
Declaration of a join as a special case of a pushout
-/
import hit.pushout .sphere cubical.cube
open eq function prod equiv is_trunc bool sigma.o... |
79d0ffefddedf52ba9453e7795b86a6eab6ec6ac | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/data/equiv/local_equiv.lean | 9c0561f392c4bbdda8005091abb29257d38b41bf | [
"Apache-2.0"
] | permissive | rmitta/mathlib | 8d90aee30b4db2b013e01f62c33f297d7e64a43d | 883d974b608845bad30ae19e27e33c285200bf84 | refs/heads/master | 1,585,776,832,544 | 1,576,874,096,000 | 1,576,874,096,000 | 153,663,165 | 0 | 2 | Apache-2.0 | 1,544,806,490,000 | 1,539,884,365,000 | Lean | UTF-8 | Lean | false | false | 21,831 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import data.equiv.basic
/-!
# Local equivalences
This files defines equivalences between subsets of given types.
An element `e` of `local_equiv α β` is made ... |
ce2439899743e87863a48a9888d045d798f0e3f3 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/geometry/euclidean/monge_point.lean | 529b1f18eb2028391004cf5dbb85cb1664bb659d | [
"Apache-2.0"
] | permissive | Lix0120/mathlib | 0020745240315ed0e517cbf32e738d8f9811dd80 | e14c37827456fc6707f31b4d1d16f1f3a3205e91 | refs/heads/master | 1,673,102,855,024 | 1,604,151,044,000 | 1,604,151,044,000 | 308,930,245 | 0 | 0 | Apache-2.0 | 1,604,164,710,000 | 1,604,163,547,000 | null | UTF-8 | Lean | false | false | 38,722 | lean | /-
Copyright (c) 2020 Joseph Myers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Joseph Myers.
-/
import geometry.euclidean.circumcenter
noncomputable theory
open_locale big_operators
open_locale classical
open_locale real
open_locale real_inner_product_space
/-!
# ... |
d1d8662deb437e255abaefcb8946b41b3185e33e | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /test/finish1.lean | baba361f61d70b2d3b385abcc414a312d2627607 | [
"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 | 4,833 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
-/
import tactic.finish
/-!
# Examples to test `finish`
The designations "clarify," "safe," "iauto," etc. are from a previous tableau prover.
-/
open auto
secti... |
b96e6ac263b8a563d1ad9308236a028c8dc3a877 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/measure_theory/integral/set_to_l1.lean | fdb5dcd6ab6d781cb93604f9c2b542ce030008e6 | [
"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 | 88,329 | lean | /-
Copyright (c) 2021 Rémy Degenne. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou, Yury Kudryashov, Sébastien Gouëzel, Rémy Degenne
-/
import measure_theory.function.simple_func_dense_lp
/-!
# Extension of a linear function from indicators to L1
> THIS... |
dc1cb4e533a61b00de288ecdfecc82d12f3e12cb | a4673261e60b025e2c8c825dfa4ab9108246c32e | /stage0/src/Init/Data/ByteArray/Basic.lean | c7be7abff8c9e0f174e694e13c20f1bc44f17d04 | [
"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 | 2,675 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
prelude
import Init.Data.Array.Basic
import Init.Data.Array.Subarray
import Init.Data.UInt
import Init.Data.Option.Basic
universes u
structure ByteArray :=
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.