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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
5fba7d25df410af7e367e2b67db99e3f7847b406 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/linear_algebra/span.lean | 1b35892df4ab64043a1a6c709961e7f6586dccf1 | [
"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 | 33,880 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro, Kevin Buzzard, Yury Kudryashov, Frédéric Dupuis,
Heather Macbeth
-/
import linear_algebra.basic
import order.omega_complete_partial_order
/-!
# The s... |
70ff15d52a91351d487f0e79c694fbd65410c855 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/run/pattern3.lean | e239df386089514bcec7bd93dea3932a0956a437 | [
"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 | 126 | lean | constant Sum : (nat → nat) → nat → nat
attribute [forward]
lemma l1 (f : nat → nat) : Sum f 0 = 0 :=
sorry
print l1
|
28501af5e96560242bb2b029ce8506b284f5514f | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/data/finsupp.lean | 40b9e7485d56bf5f4ec2599957e35b3921c1b9d9 | [
"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 | 61,653 | 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
Type of functions with finite support.
Functions with finite support provide the basis for the following concrete instances:
* ℕ →₀ α: Polynomials (where α is a ring... |
70c0d12f7e3c0e62b9e12de30725c563f71c099e | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/playground/patcheqnspace.lean | e860113cd260336520c995e81e9c676a4dd162b1 | [
"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,755 | lean | import init.lean.parser
import init.lean.parser.transform
open Lean
open Lean.Parser
def getAtomTrailingSpace : Syntax → Nat
| Syntax.atom (some info) _ => info.trailing.stopPos - info.trailing.startPos
| _ => 0
def getMinTrailingSpace (ps : Array Syntax) (i : Nat) : Nat :=
ps.foldl (fun acc (p : Syntax) =>
let spa... |
b6d9842682c534bd4115a46bc1dfb44e1c8ab9c2 | f083c4ed5d443659f3ed9b43b1ca5bb037ddeb58 | /data/prod.lean | cacfaaf616d73ae1e282b59a36a12e419e93948f | [
"Apache-2.0"
] | permissive | semorrison/mathlib | 1be6f11086e0d24180fec4b9696d3ec58b439d10 | 20b4143976dad48e664c4847b75a85237dca0a89 | refs/heads/master | 1,583,799,212,170 | 1,535,634,130,000 | 1,535,730,505,000 | 129,076,205 | 0 | 0 | Apache-2.0 | 1,551,697,998,000 | 1,523,442,265,000 | Lean | UTF-8 | Lean | false | false | 2,222 | 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
Extends theory on products
-/
import tactic.ext
universes u v
variables {α : Type u} {β : Type v}
@[simp] theorem prod.forall {p : α × β → Prop} : (∀ x, p x) ↔ (∀ a b... |
5ab244171f8b476cbe442576bd4d5aa82b05a8a3 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/continued_fractions/computation/basic.lean | a7d533da3b7d24955d691d3ed363729e2341d96c | [
"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,034 | lean | /-
Copyright (c) 2020 Kevin Kappelmann. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Kappelmann
-/
import algebra.order.floor
import algebra.continued_fractions.basic
/-!
# Computable Continued Fractions
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any change... |
3b07202d4bcce9c3376cc1c3e2bce67846c0c265 | efa51dd2edbbbbd6c34bd0ce436415eb405832e7 | /20161026_ICTAC_Tutorial/ex41.lean | bc532b3b96cac02e9e8583672f4988e8e832082e | [
"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 | 303 | lean | variables (A : Type) (r : A → A → Prop)
variable trans_r : ∀ x y z, r x y → r y z → r x z
variables (a b c : A)
variables (hab : r a b) (hbc : r b c)
check trans_r -- ∀ (x y z : A), r x y → r y z → r x z
check trans_r a b c
check trans_r a b c hab
check trans_r a b c hab hbc
|
f6689aeeb1550bac825bb7cdd9dfe1792bd2117d | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/structPrivateFieldBug.lean | 790f1fa48b2dc796dd350bc89029f57bd30d2ade | [
"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 | 247 | lean | structure A where
private x : Nat := 10
def g (a : Nat) : A :=
{}
theorem ex1 (a : Nat) : (g a |>.x) = 10 :=
rfl
structure B extends A where
y : Nat
def f (a : Nat) : B :=
{ y := a }
theorem ex2 (a : Nat) : (f a |>.x) = 10 :=
rfl
|
407c02f6a233436ff0425ba6070b91d21022bd6d | 94e33a31faa76775069b071adea97e86e218a8ee | /src/topology/homeomorph.lean | 8dbee1460d6d002e5e27e5d62a3433fe99ffa402 | [
"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 | 20,202 | lean | /-
Copyright (c) 2019 Reid Barton. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Patrick Massot, Sébastien Gouëzel, Zhouhang Zhou, Reid Barton
-/
import logic.equiv.fin
import topology.dense_embedding
import topology.support
/-!
# Homeomorphisms
This... |
cb83355b0a3cde0f6de330526aba3f47d1da217f | 5df84495ec6c281df6d26411cc20aac5c941e745 | /src/formal_ml/cardinal_set.lean | bf83aa037d38991490e0e16e225e752896ba3a0d | [
"Apache-2.0"
] | permissive | eric-wieser/formal-ml | e278df5a8df78aa3947bc8376650419e1b2b0a14 | 630011d19fdd9539c8d6493a69fe70af5d193590 | refs/heads/master | 1,681,491,589,256 | 1,612,642,743,000 | 1,612,642,743,000 | 360,114,136 | 0 | 0 | Apache-2.0 | 1,618,998,189,000 | 1,618,998,188,000 | null | UTF-8 | Lean | false | false | 16,995 | lean | /-
Copyright 2020 Google LLC
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
di... |
bfa6ee297005e8abbcb30ce1189eeea7730b1201 | 86f6f4f8d827a196a32bfc646234b73328aeb306 | /examples/logic/unnamed_1703.lean | bdb6421c115c5166a0bc177f4a64cb5a4d5a837b | [] | no_license | jamescheuk91/mathematics_in_lean | 09f1f87d2b0dce53464ff0cbe592c568ff59cf5e | 4452499264e2975bca2f42565c0925506ba5dda3 | refs/heads/master | 1,679,716,410,967 | 1,613,957,947,000 | 1,613,957,947,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 117 | lean | import data.real.basic
-- BEGIN
example {x y : ℝ} : x ≤ y ∧ ¬ y ≤ x ↔ x ≤ y ∧ x ≠ y :=
sorry
-- END |
59bd2492756b0428483e8994636128b4bec57dda | 92b50235facfbc08dfe7f334827d47281471333b | /library/data/encodable.lean | f148461fdcaadcc48e9c1b2a3d6e60834fdef4c7 | [
"Apache-2.0"
] | permissive | htzh/lean | 24f6ed7510ab637379ec31af406d12584d31792c | d70c79f4e30aafecdfc4a60b5d3512199200ab6e | refs/heads/master | 1,607,677,731,270 | 1,437,089,952,000 | 1,437,089,952,000 | 37,078,816 | 0 | 0 | null | 1,433,780,956,000 | 1,433,780,955,000 | null | UTF-8 | Lean | false | false | 9,938 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
Type class for encodable types.
Note that every encodable type is countable.
-/
import data.fintype data.list data.sum data.nat data.subtype data.countable dat... |
b7c4945892dd6a1c4cbe95572380f326e26bc43d | 969dbdfed67fda40a6f5a2b4f8c4a3c7dc01e0fb | /src/algebraic_topology/simplicial_object.lean | d09440094311bba7fdcf2ce333df84571cf84342 | [
"Apache-2.0"
] | permissive | SAAluthwela/mathlib | 62044349d72dd63983a8500214736aa7779634d3 | 83a4b8b990907291421de54a78988c024dc8a552 | refs/heads/master | 1,679,433,873,417 | 1,615,998,031,000 | 1,615,998,031,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,575 | lean | /-
Copyright (c) 2021 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Scott Morrison
-/
import algebraic_topology.simplex_category
import category_theory.category.ulift
import category_theory.limits.functor_category
import category_theory... |
790ec61066f23f26e126489bc957798ab4e91dc3 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/pkg/frontend/Frontend/Main.lean | 2a4f622de8eb89979c36337796f7754290b905e1 | [
"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 | 370 | lean | import Frontend.Compile
open Lean
unsafe def main (args : List String) : IO UInt32 := do
initSearchPath (← findSysroot)
let mut count : UInt32 := 0
for mod in args do
IO.println s!"Compiling {mod}"
let (_env, msgs) ← compileModule mod.toName true
for m in msgs do IO.println (← m.toString)
if msg... |
fd76a5686dd5311f3117ffb61d4fe8b602822bbe | 8eeb99d0fdf8125f5d39a0ce8631653f588ee817 | /src/topology/constructions.lean | 027ccd5076a1d2909f93ae704a919e8afddb7247 | [
"Apache-2.0"
] | permissive | jesse-michael-han/mathlib | a15c58378846011b003669354cbab7062b893cfe | fa6312e4dc971985e6b7708d99a5bc3062485c89 | refs/heads/master | 1,625,200,760,912 | 1,602,081,753,000 | 1,602,081,753,000 | 181,787,230 | 0 | 0 | null | 1,555,460,682,000 | 1,555,460,682,000 | null | UTF-8 | Lean | false | false | 34,487 | 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
-/
import topology.maps
/-!
# Constructions of new topological spaces from old ones
This file constructs products, sums, subtypes and q... |
f8a7f2fae60db1cf6813cb603242523f4c0619ea | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/simp_match_reducibility_issue.lean | 32c67e8f520d801db16a8a182ae2fb4d912d1821 | [
"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 | 292 | lean | import data.vector namespace test
universes u v
section
open vector
variable α : Type u
variables m n k : ℕ
variable v : vector α m
variable w : vector α n
theorem append_nil : append v nil = v :=
by cases v; simp [vector.append, vector.nil]; reflexivity
end
end test
|
c6be753cb9ced7067348cb186ef0d7cd7de61ea3 | ecdf4e083eb363cd3a0d6880399f86e2cd7f5adb | /src/algebraic_geometry/affine_variety.lean | af119c929e219d70fcbbe5143f7fcbb284bef19d | [] | no_license | fpvandoorn/formalabstracts | 29aa71772da418f18994c38379e2192a6ef361f7 | cea2f9f96d89ee1187d1b01e33f22305cdfe4d59 | refs/heads/master | 1,609,476,761,601 | 1,558,130,287,000 | 1,558,130,287,000 | 97,261,457 | 0 | 2 | null | 1,550,879,230,000 | 1,500,056,313,000 | Lean | UTF-8 | Lean | false | false | 17,536 | lean | import ring_theory.basic
..category_theory.group_object
..category_theory.limits2
tactic.omitted
category_theory.limits.opposites
topology.opens
open category_theory ideal set topological_space
noncomputable theory
universes u v w
-- we set some priorities of instances very low, be... |
883a9ad52a31427ed6a901c783191783201638e9 | bb31430994044506fa42fd667e2d556327e18dfe | /src/algebra/lie/subalgebra.lean | db9b94416b12079558a23dd6d4d70b41348800a2 | [
"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 | 23,376 | lean | /-
Copyright (c) 2021 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import algebra.lie.basic
import ring_theory.noetherian
/-!
# Lie subalgebras
This file defines Lie subalgebras of a Lie algebra and provides basic related definitions and... |
cfa0727425b01c8980dfd9982c9d8223e48510bc | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/PPInstances.lean | c4ffea177705f89342020c5bfe61cd8eeeaac244 | [
"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,527 | lean | class Semiring (α : Type) where add : α → α → α
class Ring (α : Type) where add : α → α → α
class AddCommMonoid (α : Type) where
class AddCommGroup (α : Type) where
class Module (α β : Type) [Semiring α] [AddCommMonoid β] where
class NormedField (α : Type) where
add : α → α → α
add_comm : ∀ (x y : α), @Add.add ... |
810f422321abed7f120110035d2b0e435bd9c06a | 618003631150032a5676f229d13a079ac875ff77 | /src/tactic/mk_iff_of_inductive_prop.lean | b81291c65d0c467aa68046c18c4a1e9eaa38cfbc | [
"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,155 | 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
Generation function for iff rules for inductives, like for `list.chain`:
∀{α : Type*} (R : α → α → Prop) (a : α) (l : list α),
chain R a l ↔ l = [] ∨ ∃{b : α... |
e7cc21399ab5c1c480dd9f5e49fc2cc60df58821 | 856e2e1615a12f95b551ed48fa5b03b245abba44 | /src/data/matrix/basic.lean | 77341b243035183737b610f59cf6d9fcc7436140 | [
"Apache-2.0"
] | permissive | pimsp/mathlib | 8b77e1ccfab21703ba8fbe65988c7de7765aa0e5 | 913318ca9d6979686996e8d9b5ebf7e74aae1c63 | refs/heads/master | 1,669,812,465,182 | 1,597,133,610,000 | 1,597,133,610,000 | 281,890,685 | 1 | 0 | null | 1,595,491,577,000 | 1,595,491,576,000 | null | UTF-8 | Lean | false | false | 28,168 | lean | /-
Copyright (c) 2018 Ellen Arlt. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Ellen Arlt, Blair Shi, Sean Leather, Mario Carneiro, Johan Commelin
-/
import algebra.pi_instances
import algebra.big_operators.ring
/-!
# Matrices
-/
universes u v w
open_locale big_ope... |
01a09bf5efae67226b80ec14ca9893b2527c756f | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/hott/subst_tac.hlean | 10e04903424cfb8c73e172cb00017582a7cbb30e | [
"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,067 | hlean | open nat
example (A B : Type) (a : A) (b : B) (h₁ : A = B) (h₂ : eq.rec_on h₁ a = b) : b = eq.rec_on h₁ a :=
begin
subst h₁ h₂
end
example (A B : Type) (a : A) (b : B) (h₁ : A = B) (h₂ : eq.rec_on h₁ a = b) : b = eq.rec_on h₁ a :=
begin
subst B h₂
end
example (a b c : nat) (a0 : a = 0) (b1 : b = 1 + a) (ab : a =... |
b9e5b9bc625d329c8a1e5763173e7d6296b40cfe | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/num2.lean | 4a2e9a85b046136edd5cec6b0d5817cd1326d4af | [
"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 | 343 | lean | prelude set_option pp.notation false
definition Prop := Type.{0}
constant eq {A : Type} : A → A → Prop
infixl `=`:50 := eq
constant N : Type.{1}
constant z : N
constant o : N
constant b : N
notation 0 := z
notation 1 := o
check 1
check 0
constant G : Type.{1}
constant gz : G
constant a : G
notation 0 := gz
check... |
7a19ac0cc988cecbf071db946106e79a83a3ba42 | 0c9c1ff8e5013c525bf1d72338b62db639374733 | /library/init/algebra/classes.lean | c3b73d515ca422bc4c537db5563c816383df420f | [
"Apache-2.0"
] | permissive | semorrison/lean | 1f2bb450c3400098666ff6e43aa29b8e1e3cdc3a | 85dcb385d5219f2fca8c73b2ebca270fe81337e0 | refs/heads/master | 1,638,526,143,586 | 1,634,825,588,000 | 1,634,825,588,000 | 258,650,844 | 0 | 0 | Apache-2.0 | 1,587,772,955,000 | 1,587,772,954,000 | null | UTF-8 | Lean | false | false | 13,793 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.logic init.data.ordering.basic
universes u v
/-!
# Unbundled algebra classes
These classes and the `@[algebra]` attribute are part of ... |
c6d96752e218c806352ca6b55daeb97820217086 | 54d7e71c3616d331b2ec3845d31deb08f3ff1dea | /tests/lean/defeq_simp1.lean | 8542b9ff6349338558944fbabf7f4370642e01fa | [
"Apache-2.0"
] | permissive | pachugupta/lean | 6f3305c4292288311cc4ab4550060b17d49ffb1d | 0d02136a09ac4cf27b5c88361750e38e1f485a1a | refs/heads/master | 1,611,110,653,606 | 1,493,130,117,000 | 1,493,167,649,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 676 | lean | @[reducible]
def nat_has_add2 : has_add nat :=
⟨λ x y : nat, nat.add x y⟩
set_option pp.all true
open tactic
example (a b : nat) (H : @add nat (id (id nat.has_add)) a b = @add nat nat_has_add2 a b) : true :=
by do
s ← simp_lemmas.mk_default,
get_local `H >>= infer_type >>= s^.dsimplify >>= trace,
constructor
... |
5b7e666652c90256cf126c61c43d62184742e5ba | 0d9b0a832bc57849732c5bd008a7a142f7e49656 | /src/example_deadlocks.lean | 670698e253b7d6fabdb861c6a84efbe751283442 | [] | no_license | mirefek/sokoban.lean | bb9414af67894e4d8ce75f8c8d7031df02d371d0 | 451c92308afb4d3f8e566594b9751286f93b899b | refs/heads/master | 1,681,025,245,267 | 1,618,997,832,000 | 1,618,997,832,000 | 359,491,681 | 10 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,418 | lean | import .deadlocks
namespace deadlocks_example
open deadlocks
def lev := sokolevel.from_string "
######
# #
# $@ #
# . #
######
"
@[reducible]
def deadlock_local (dl : boxint) : Prop := deadlock lev.avail lev.goal dl
def deadlocks_local (dls : list boxint) : Prop
:= dls.pall (λ dl, deadlock_local dl)
def generate... |
2f47641287366f0ee9ee4abd561f8c74bd06ea56 | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /tests/lean/run/tactic7.lean | c0a1fd57ce3156038d2f527d4face343a5f1626d | [
"Apache-2.0"
] | permissive | chubbymaggie/lean | 0d06ae25f9dd396306fb02190e89422ea94afd7b | d2c7b5c31928c98f545b16420d37842c43b4ae9a | refs/heads/master | 1,611,313,622,901 | 1,430,266,839,000 | 1,430,267,083,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 327 | lean | import logic
open tactic
theorem tst {A B : Prop} (H1 : A) (H2 : B) : A ∧ B ∧ A
:= by apply and.intro; state; assumption; apply and.intro; assumption
check tst
theorem tst2 {A B : Prop} (H1 : A) (H2 : B) : A ∧ B ∧ A
:= by repeat ((apply @and.intro | assumption) ; trace "STEP"; state; trace "----------")
check tst2
|
012efc9e1ec8eba0bb442395863cc1ee52023fd8 | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /03_Propositions_and_Proofs.org.2.lean | 650d0bdf46d026cf278965645760ae594899446b | [] | no_license | cjmazey/lean-tutorial | ba559a49f82aa6c5848b9bf17b7389bf7f4ba645 | 381f61c9fcac56d01d959ae0fa6e376f2c4e3b34 | refs/heads/master | 1,610,286,098,832 | 1,447,124,923,000 | 1,447,124,923,000 | 43,082,433 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 408 | lean | /- page 33 -/
import standard
namespace hide
constant and : Prop → Prop → Prop
constant or : Prop → Prop → Prop
constant not : Prop → Prop
constant implies : Prop → Prop → Prop
-- BEGIN
constant Proof : Prop → Type
constant and_comm : Π p q : Prop, Proof (implies (and p q) (and q p))
variables p q : Prop
check and... |
c3d274d2f20f8889e0d966feacddb0904bed960a | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/run/consume.lean | 226f736e809296061f67c7e28fbf3097ee90a06c | [
"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 | 116 | lean | definition pr2 {A : Type} (a b : A) := a
check pr2
check pr2
check pr2
check @pr2
check @pr2
check @@pr2
check pr2
|
756651367de5c3cf3d322de30e4dc542bf77119f | cf39355caa609c0f33405126beee2739aa3cb77e | /library/init/control/except.lean | bd3ce437b1ec8a86863c30060537e281e6efbaeb | [
"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 | 5,227 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jared Roesch, Sebastian Ullrich
The except monad transformer.
-/
prelude
import init.control.alternative init.control.lift
universes u v w
inductive except (ε : Type u) (α : ... |
360d76ac4198eeb634bc5e63487ce9ea2dba10e9 | 57fdc8de88f5ea3bfde4325e6ecd13f93a274ab5 | /algebra/big_operators.lean | 2132236c84bd659508f29ac9de12b3d8c326fd67 | [
"Apache-2.0"
] | permissive | louisanu/mathlib | 11f56f2d40dc792bc05ee2f78ea37d73e98ecbfe | 2bd5e2159d20a8f20d04fc4d382e65eea775ed39 | refs/heads/master | 1,617,706,993,439 | 1,523,163,654,000 | 1,523,163,654,000 | 124,519,997 | 0 | 0 | Apache-2.0 | 1,520,588,283,000 | 1,520,588,283,000 | null | UTF-8 | Lean | false | false | 14,412 | 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
Some big operators for lists and finite sets.
-/
import data.list.basic data.list.perm data.finset
algebra.group algebra.ordered_group algebra.group_power
universes ... |
c6e6f3267797baaf41d1e0ef3e6812da4e07ff61 | 26ac254ecb57ffcb886ff709cf018390161a9225 | /src/ring_theory/algebraic.lean | 7f826f66fb8a6b3c1e15f80e2715f4e7193d10a1 | [
"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 | 4,692 | lean | /-
Copyright (c) 2019 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import linear_algebra.finite_dimensional
import ring_theory.integral_closure
import data.polynomial.field_division
/-!
# Algebraic elements and algebraic extensions... |
1de15a31042f859af53d6a5fcd68a4f23fffc6ce | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /stage0/src/Lean/PrettyPrinter/Delaborator.lean | 41be185991bdf8ac4e9ee0d6718303ea97d9ae2d | [
"Apache-2.0"
] | permissive | WojciechKarpiel/lean4 | 7f89706b8e3c1f942b83a2c91a3a00b05da0e65b | f6e1314fa08293dea66a329e05b6c196a0189163 | refs/heads/master | 1,686,633,402,214 | 1,625,821,189,000 | 1,625,821,258,000 | 384,640,886 | 0 | 0 | Apache-2.0 | 1,625,903,617,000 | 1,625,903,026,000 | null | UTF-8 | Lean | false | false | 251 | 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.PrettyPrinter.Delaborator.Basic
import Lean.PrettyPrinter.Delaborator.Builtins
|
9cd47747d47281a5912a6494753fe67a73d23bc6 | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/category_theory/functor.lean | 46ae92f320764c2fafd3335c624da874b9dfd0ce | [
"Apache-2.0"
] | permissive | vaibhavkarve/mathlib | a574aaf68c0a431a47fa82ce0637f0f769826bfe | 17f8340912468f49bdc30acdb9a9fa02eeb0473a | refs/heads/master | 1,621,263,802,637 | 1,585,399,588,000 | 1,585,399,588,000 | 250,833,447 | 0 | 0 | Apache-2.0 | 1,585,410,341,000 | 1,585,410,341,000 | null | UTF-8 | Lean | false | false | 3,478 | 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
Defines a functor between categories.
(As it is a 'bundled' object rather than the `is_functorial` typeclass parametrised
by the underlyin... |
9013cc2bfdce6b7bf1325b8f2a71ca700231da3c | 5ec8f5218a7c8e87dd0d70dc6b715b36d61a8d61 | /ast.lean | 0baa7a2d7efb77b6a663438badad9b8721235551 | [] | no_license | mbrodersen/kremlin | f9f2f9dd77b9744fe0ffd5f70d9fa0f1f8bd8cec | d4665929ce9012e93a0b05fc7063b96256bab86f | refs/heads/master | 1,624,057,268,130 | 1,496,957,084,000 | 1,496,957,084,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 22,852 | lean | import .lib .integers .floats .maps .errors
namespace ast
open integers maps errors floats
/- * Syntactic elements -/
/- Identifiers (names of local variables, of global symbols and functions,
etc) are represented by the type [positive] of positive integers. -/
def ident := pos_num
instance pos_num_eq : decidabl... |
12e47981ae17a37b00a32207d4aa9970e0533a68 | 947b78d97130d56365ae2ec264df196ce769371a | /src/Lean/Elab/Tactic/Match.lean | 6000c9419715827b2cb4fe282fe0405347a96a8a | [
"Apache-2.0"
] | permissive | shyamalschandra/lean4 | 27044812be8698f0c79147615b1d5090b9f4b037 | 6e7a883b21eaf62831e8111b251dc9b18f40e604 | refs/heads/master | 1,671,417,126,371 | 1,601,859,995,000 | 1,601,860,020,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,108 | 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.Match
import Lean.Elab.Tactic.Basic
import Lean.Elab.Tactic.Induction
namespace Lean
namespace Elab
namespace Tactic
structure AuxMatchTe... |
ffdcd79ee0700fdf9ece4f53588ffdcb1da30055 | 5fbbd711f9bfc21ee168f46a4be146603ece8835 | /lean/natural_number_game/power/3.lean | bf34026a944c10cc8af8c4ccf83427cf6b9981bf | [
"LicenseRef-scancode-warranty-disclaimer"
] | no_license | goedel-gang/maths | 22596f71e3fde9c088e59931f128a3b5efb73a2c | a20a6f6a8ce800427afd595c598a5ad43da1408d | refs/heads/master | 1,623,055,941,960 | 1,621,599,441,000 | 1,621,599,441,000 | 169,335,840 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 110 | lean | lemma pow_one (a : mynat) : a ^ (1 : mynat) = a :=
rwa [one_eq_succ_zero, pow_succ, pow_zero, one_mul],
end
|
7efb5ca07dc27e71bf8c7e19be58898b8a8df8fc | 75db7e3219bba2fbf41bf5b905f34fcb3c6ca3f2 | /tests/lean/bad_namespace.lean | b5a3ba24beafbf35d60c14dd2950253226dcb9fd | [
"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 | 17 | lean | namespace _root_
|
fbf739a944edddb50f740fddd8a0cd67fe1bd86f | 1dd482be3f611941db7801003235dc84147ec60a | /src/topology/metric_space/basic.lean | 421f5c989585eca3dbcce27de6db9f3e78bcfe0a | [
"Apache-2.0"
] | permissive | sanderdahmen/mathlib | 479039302bd66434bb5672c2a4cecf8d69981458 | 8f0eae75cd2d8b7a083cf935666fcce4565df076 | refs/heads/master | 1,587,491,322,775 | 1,549,672,060,000 | 1,549,672,060,000 | 169,748,224 | 0 | 0 | Apache-2.0 | 1,549,636,694,000 | 1,549,636,694,000 | null | UTF-8 | Lean | false | false | 61,407 | lean | /-
Copyright (c) 2015, 2017 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Metric spaces.
Authors: Jeremy Avigad, Robert Y. Lewis, Johannes Hölzl, Mario Carneiro, Sébastien Gouëzel
Many definitions and theorems expected on metric spaces are already introduced o... |
38674a84c4917dcc7b856889d11310aba20dbaa6 | 8cb37a089cdb4af3af9d8bf1002b417e407a8e9e | /library/init/meta/constructor_tactic.lean | cca43e168cd8eb9f50f644116601eb7426249061 | [
"Apache-2.0"
] | permissive | kbuzzard/lean | ae3c3db4bb462d750dbf7419b28bafb3ec983ef7 | ed1788fd674bb8991acffc8fca585ec746711928 | refs/heads/master | 1,620,983,366,617 | 1,618,937,600,000 | 1,618,937,600,000 | 359,886,396 | 1 | 0 | Apache-2.0 | 1,618,936,987,000 | 1,618,936,987,000 | null | UTF-8 | Lean | false | false | 3,280 | 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
/- Return target after instantiating metavars and whnf -/
private meta def target' : tactic... |
77e90b40664e74c2f067259aafb203451e54e6f4 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/topology/algebra/algebra.lean | 7bff5853a3d23de275052c79c7748b8239e38a72 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 6,361 | lean | /-
Copyright (c) 2021 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import algebra.algebra.subalgebra.basic
import topology.algebra.module.basic
import ring_theory.adjoin.basic
/-!
# Topological (sub)algebras
A topological algebra o... |
3444df70f09b6e4a41753c76828c2b8558adfa4b | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tests/lean/run/structuralEqns3.lean | 3e568ac8bc950230213227d29a012600b6ca7654 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | cipher1024/lean4 | 6e1f98bb58e7a92b28f5364eb38a14c8d0aae393 | 69114d3b50806264ef35b57394391c3e738a9822 | refs/heads/master | 1,642,227,983,603 | 1,642,011,696,000 | 1,642,011,696,000 | 228,607,691 | 0 | 0 | Apache-2.0 | 1,576,584,269,000 | 1,576,584,268,000 | null | UTF-8 | Lean | false | false | 392 | lean | import Lean
open Lean
open Lean.Meta
def tst (declName : Name) : MetaM Unit := do
IO.println (← getEqnsFor? declName)
inductive Wk: Nat -> Nat -> Type 0 where
| id: Wk n n
| step: Wk m n -> Wk (Nat.succ m) n
def wk_comp : Wk n m → Wk m l → Wk n l
| Wk.id, σ => σ
| Wk.step ρ, σ => Wk.step (wk_comp ρ σ)
#ev... |
b4a308a78f439d8a3649a4ffd4b83fe3259699f5 | 42610cc2e5db9c90269470365e6056df0122eaa0 | /hott/init/equiv.hlean | 2dda02d68a998d5e5bb670c413755818b5975a6e | [
"Apache-2.0"
] | permissive | tomsib2001/lean | 2ab59bfaebd24a62109f800dcf4a7139ebd73858 | eb639a7d53fb40175bea5c8da86b51d14bb91f76 | refs/heads/master | 1,586,128,387,740 | 1,468,968,950,000 | 1,468,968,950,000 | 61,027,234 | 0 | 0 | null | 1,465,813,585,000 | 1,465,813,585,000 | null | UTF-8 | Lean | false | false | 17,634 | hlean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad, Jakob von Raumer, Floris van Doorn
Ported from Coq HoTT
-/
prelude
import .path .function
open eq function lift
/- Equivalences -/
-- This is our definition of... |
50e266f2b1eb6fcba5d3d681372bbe2386619b4f | fcf3ffa92a3847189ca669cb18b34ef6b2ec2859 | /src/world2/level1.lean | 961f295586a3032dc1cff9fdbc03ff71b91a5dee | [
"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 | 274 | lean | import mynat.definition
import mynat.add
namespace mynat
lemma zero_add (n : mynat) : 0 + n = n :=
begin [nat_num_game]
induction n with d hd,
{
rw add_zero,
refl,
},
{
rw add_succ,
rw hd,
refl,
},
end
end mynat |
92717021a3d57a653734747493c5544bfe1b7725 | b186c784450e8bcbcf835ab3f10fa7e73f27bc2e | /existential_quantifier.lean | 85651f453f882f49a627f91bd4f9648ad488aaaa | [] | no_license | esclear/Learning-Lean | 9780a0efe769e275992cf3ab4ebf55809ec53b48 | d81d5c4743b94c96d8f1bb135e1f13a1d99b3154 | refs/heads/master | 1,593,312,896,806 | 1,565,904,243,000 | 1,565,904,243,000 | 200,125,941 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,949 | lean | open classical
variables (α : Type) (p q : α → Prop)
variable a : α
variable r : Prop
theorem dne {p : Prop} (hp : ¬¬p) : p :=
by_contradiction (assume hnp : ¬p, absurd hnp hp)
--
example : (∃ x : α, r) → r :=
assume h : (∃ x : α, r),
exists.elim h
(assume w,
assume hr : r,
hr)
example : r → ... |
ef15f5efe4fa548b93a64b53b01cd3ac2a5233e0 | 367134ba5a65885e863bdc4507601606690974c1 | /src/measure_theory/giry_monad.lean | 30ec040b36595a9c486f4b3f7af4cdec94e3b6ab | [
"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 | 8,045 | 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 measure_theory.integration
/-!
# The Giry monad
Let X be a measurable space. The collection of all measures on X again
forms a measurable space. This constru... |
26e95097e567b829b4ab90e1f37b4ae2a4f81e11 | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /src/Lean/Meta/ReduceEval.lean | 6c867be77601a31735fe94587829808984c1d209 | [
"Apache-2.0"
] | permissive | WojciechKarpiel/lean4 | 7f89706b8e3c1f942b83a2c91a3a00b05da0e65b | f6e1314fa08293dea66a329e05b6c196a0189163 | refs/heads/master | 1,686,633,402,214 | 1,625,821,189,000 | 1,625,821,258,000 | 384,640,886 | 0 | 0 | Apache-2.0 | 1,625,903,617,000 | 1,625,903,026,000 | null | UTF-8 | Lean | false | false | 1,872 | lean | /-
Copyright (c) 2020 Sebastian Ullrich. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
-/
/-! Evaluation by reduction -/
import Lean.Meta.Offset
namespace Lean.Meta
class ReduceEval (α : Type) where
reduceEval : Expr → MetaM α
def reduceEval [... |
41ec48179c8a30ef9520e3609d9602bfd56b818d | 9028d228ac200bbefe3a711342514dd4e4458bff | /src/representation_theory/maschke.lean | a1ae33acd1db1ba61af23d3a428cbec0e3d1dbdd | [
"Apache-2.0"
] | permissive | mcncm/mathlib | 8d25099344d9d2bee62822cb9ed43aa3e09fa05e | fde3d78cadeec5ef827b16ae55664ef115e66f57 | refs/heads/master | 1,672,743,316,277 | 1,602,618,514,000 | 1,602,618,514,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,896 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Scott Morrison
-/
import algebra.monoid_algebra
import algebra.invertible
import algebra.char_p
import linear_algebra.basis
/-!
# Maschke's theorem
We prove Maschke's theorem for fini... |
e7c5cb48420ef6bfb269005e4b511158a9efeb0d | 46125763b4dbf50619e8846a1371029346f4c3db | /src/data/semiquot.lean | e589352c7500910b8ff6f12010842309611758d5 | [
"Apache-2.0"
] | permissive | thjread/mathlib | a9d97612cedc2c3101060737233df15abcdb9eb1 | 7cffe2520a5518bba19227a107078d83fa725ddc | refs/heads/master | 1,615,637,696,376 | 1,583,953,063,000 | 1,583,953,063,000 | 246,680,271 | 0 | 0 | Apache-2.0 | 1,583,960,875,000 | 1,583,960,875,000 | null | UTF-8 | Lean | false | false | 7,510 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
A data type for semiquotients, which are classically equivalent to
nonempty sets, but are useful for programming; the idea is that
a semiquotient set `S` represents som... |
48f25d13a194605219922de07c4c6c64dcc66460 | 0c9c1ff8e5013c525bf1d72338b62db639374733 | /library/init/meta/tactic.lean | 998c30e309b5c978a511a90e7d019c41779c7ce4 | [
"Apache-2.0"
] | permissive | semorrison/lean | 1f2bb450c3400098666ff6e43aa29b8e1e3cdc3a | 85dcb385d5219f2fca8c73b2ebca270fe81337e0 | refs/heads/master | 1,638,526,143,586 | 1,634,825,588,000 | 1,634,825,588,000 | 258,650,844 | 0 | 0 | Apache-2.0 | 1,587,772,955,000 | 1,587,772,954,000 | null | UTF-8 | Lean | false | false | 76,478 | 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.function init.data.option.basic init.util
import init.control.combinators init.control.monad init.control.alternative init.control.monad... |
318443865f0b1db6946f6417174c53bd6cdcd790 | ed27983dd289b3bcad416f0b1927105d6ef19db8 | /src/inClassNotes/type_library/sum_test.lean | d43e2a50e59399284a14deb0ed59fc2142558858 | [] | no_license | liuxin-James/complogic-s21 | 0d55b76dbe25024473d31d98b5b83655c365f811 | 13e03e0114626643b44015c654151fb651603486 | refs/heads/master | 1,681,109,264,463 | 1,618,848,261,000 | 1,618,848,261,000 | 337,599,491 | 0 | 0 | null | 1,613,141,619,000 | 1,612,925,555,000 | null | UTF-8 | Lean | false | false | 1,676 | lean | /-
The "sum" type is used to hold either
a value of a type, α, or a value of
another type, β.
Here's the definition
universe u
inductive sum (α β : Type u) : Type u
| inl (a : α) : sum
| inr (b : β) : sum
In Haskell this type builder is called Either.
-/
/-
Example #1
A value of a sum type can be used
as a mor... |
76214f39ced57954571f995b5585a97bfe2a5146 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/data/finmap.lean | 32dff22f8305d0f109a5d8138df3dc89f2b5b699 | [
"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 | 19,079 | lean | /-
Copyright (c) 2018 Sean Leather. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sean Leather, Mario Carneiro
-/
import data.list.alist
import data.finset.basic
import data.pfun
/-!
# Finite maps over `multiset`
-/
universes u v w
open list
variables {α : Type u} {β... |
2ada8bf5f655e48970262f04eec340c958de6756 | 453dcd7c0d1ef170b0843a81d7d8caedc9741dce | /data/list/perm.lean | 8dc5ffc24e9cf15967c977eab0ed80271ac8c2b3 | [
"Apache-2.0"
] | permissive | amswerdlow/mathlib | 9af77a1f08486d8fa059448ae2d97795bd12ec0c | 27f96e30b9c9bf518341705c99d641c38638dfd0 | refs/heads/master | 1,585,200,953,598 | 1,534,275,532,000 | 1,534,275,532,000 | 144,564,700 | 0 | 0 | null | 1,534,156,197,000 | 1,534,156,197,000 | null | UTF-8 | Lean | false | false | 37,872 | 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
List permutations.
-/
import data.list.basic
namespace list
universe variables uu vv
variables {α : Type uu} {β : Type vv}
/-... |
d592782696f8cf4cc49afb69354f4e383b117c0a | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/functor/left_derived.lean | 8f8f9baf18c768c2633b8b1e361e132923d40cd0 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 7,816 | lean | /-
Copyright (c) 2021 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.preadditive.projective_resolution
/-!
# Left-derived functors
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a... |
2ef5ccb6d942c4159919d94d95de4fecfe75a97a | 359199d7253811b032ab92108191da7336eba86e | /src/mywork/blah.lean | 8a80bd4e198d0659aef584bf3811977ed2f457bd | [] | no_license | arte-et-marte/my_cs2120f21 | 0bc6215cb5018a3b7c90d9d399a173233f587064 | 91609c3609ad81fda895bee8b97cc76813241e17 | refs/heads/main | 1,693,298,928,348 | 1,634,931,202,000 | 1,634,931,202,000 | 399,946,705 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 465 | lean | /-
Social Networks
-/
axioms
(Person : Type)
(Nice : Person → Prop)
(Likes : Person → Person → Prop)
/-
What does this say, in English? It is true?
-/
example :
-- If there's a person, p1, who everyone likes,
(∃ (p1 : Person), ∀ (p2 : Person), Likes p2 p1) →
-- then everyone likes someone
(∀ (e : Pers... |
0974b69edb2d3428587083d123e3dfccbda9b7a9 | c76cc4eaee3c806716844e49b5175747d1aa170a | /src/solutions_sheet_five.lean | 1c8df166b78006a58ba2e8a5e88e15f97b63da58 | [] | no_license | ImperialCollegeLondon/M40002 | 0fb55848adbb0d8bc4a65ca5d7ed6edd18764c28 | a499db70323bd5ccae954c680ec9afbf15ffacca | refs/heads/master | 1,674,878,059,748 | 1,607,624,828,000 | 1,607,624,828,000 | 309,696,750 | 3 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,214 | lean | import tactic
import data.real.basic
import data.pnat.basic
local notation `|` x `|` := abs x
def is_limit (a : ℕ → ℝ) (l : ℝ) : Prop :=
∀ ε > 0, ∃ N, ∀ n ≥ N, | a n - l | < ε
def tends_to_plus_infinity (a : ℕ → ℝ) : Prop :=
∀ B, ∃ N, ∀ n ≥ N, B < a n
def is_convergent (a : ℕ → ℝ) : Prop :=
∃ l : ℝ, is_limit a l
... |
b0990daf73b6e580d916dc4953c6cc4c27c9006a | 367134ba5a65885e863bdc4507601606690974c1 | /src/order/compactly_generated.lean | 8e3965f7c8277fe2319e254cbc7652434413a8d7 | [
"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 | 20,341 | lean | /-
Copyright (c) 2021 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import data.set.finite
import data.finset.order
import order.well_founded
import order.order_iso_nat
import order.atoms
import order.zorn
import tactic.tfae
/-!
# Compactn... |
1268f4a27e2c0e318fc6369bde7c389bdc7102ed | 7007bb645068e0b6b859aab9da7cf5c1c79e98be | /library/init/meta/tactic.lean | 211c2ff85b06300652357454f9d9cfcd44e2c687 | [
"Apache-2.0"
] | permissive | EdAyers/lean | 7d3fb852380bc386545ebc119b7d03c128c3ce1c | be72c8dc527a062e243a408480f487a55b06cb0a | refs/heads/master | 1,624,443,179,694 | 1,592,837,958,000 | 1,592,837,958,000 | 154,972,348 | 0 | 0 | Apache-2.0 | 1,557,768,267,000 | 1,540,649,772,000 | C++ | UTF-8 | Lean | false | false | 71,301 | 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.function init.data.option.basic init.util
import init.control.combinators init.control.monad init.control.alternative init.control.monad... |
af2f92f9a7d3cbfe8487ead9f7c5b70f54df0a8d | d436468d80b739ba7e06843c4d0d2070e43448e5 | /src/logic/relator.lean | d596d474e261d1a2477140777a39352675b0528a | [
"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 | 3,698 | 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
Relator for functions, pairs, sums, and lists.
-/
namespace relator
universe variables u₁ u₂ v₁ v₂
reserve infixr ` ⇒ `:40
/- TODO(johoelzl):
* should we introduce ... |
d719eb764520ff192367bc61f9f1f55f53f07187 | 75c54c8946bb4203e0aaf196f918424a17b0de99 | /src/regular_open_algebra.lean | ca173a96784dc655b12b5d01d2909e9c00dc4e8e | [
"Apache-2.0"
] | permissive | urkud/flypitch | 261e2a45f1038130178575406df8aea78255ba77 | 2250f5eda14b6ef9fc3e4e1f4a9ac4005634de5c | refs/heads/master | 1,653,266,469,246 | 1,577,819,679,000 | 1,577,819,679,000 | 259,862,235 | 1 | 0 | Apache-2.0 | 1,588,147,244,000 | 1,588,147,244,000 | null | UTF-8 | Lean | false | false | 29,647 | lean | /-
Copyright (c) 2019 The Flypitch Project. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jesse Han, Floris van Doorn
-/
import .set_theory order.complete_boolean_algebra
local attribute [instance] classical.prop_decidable
open set
meta def not_as_big_bertha : ta... |
103df93ddeff198542ccddba4f5b132173051895 | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /src/Lean/Server/Watchdog.lean | e10edeabfbb95363adac1fe8e6b64935dc3b0020 | [
"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 | 25,292 | 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 Init.System.IO
import Init.Data.ByteArray
import Std.Data.RBMap
import Lean.Elab.Import
import Lean.Data.Lsp
import Lean.Server.FileSource
... |
4c7e73da162fd8e25bc6061e9951ebb988148a58 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/data/multiset/sections.lean | 34ca9ce9caa608c2ead17951ec7200e6a97f7fc2 | [
"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,230 | lean | /-
Copyright (c) 2018 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
-/
import data.multiset.basic
/-!
# Sections of a multiset
-/
namespace multiset
variables {α : Type*}
section sections
/--
The sections of a multiset of multisets `... |
9c31e52afb8dd05dbd1c4a6b710ffd8e2bf13b20 | 5b273b8c05e2f73fb74340ce100ce261900a98cd | /sum_between_nats.lean | 950ce389c271a1555c9f995331cc3214f243b03b | [] | no_license | ChrisHughes24/leanstuff1 | 2eba44bc48da6e544e07495b41e1703f81dc1c24 | cbcd788b8b1d07b20b2fff4482c870077a13d1c0 | refs/heads/master | 1,631,670,333,297 | 1,527,093,981,000 | 1,527,093,981,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 19,820 | 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.nat.basic algebra.group data.real.cau_seq tactic.ring data.nat.choose algebra.archimedean
open nat is_absolute_value
variables {α : Type*} {β : Type*}
def ... |
bdcd3b43acd672bbe04d8f09bd732d738b827af0 | 6b609a616109fa46986f865a054cd5a3a29d42b2 | /Congruence_Manipulation.lean | b0ac977d5d600c00ecda1b0b7f68e626d85707ef | [] | no_license | kckennylau/Lean_ElementaryNT | ae013bb3df1d2c0869098aca751b55236c88f742 | c93c5754b99a906a62e67a754bd4bac8c0c4c525 | refs/heads/master | 1,621,064,756,453 | 1,509,670,063,000 | 1,509,670,063,000 | 109,455,937 | 0 | 0 | null | 1,509,756,894,000 | 1,509,756,894,000 | null | UTF-8 | Lean | false | false | 13,569 | lean |
-- a congruent to b modulo m
def cong (a:int) (b: int) (m: int): Prop := ∃ x: int, a-b = m*x
-- p is prime
def is_prime (p:nat): Prop := ∀ x y: int, cong (x*y) 0 p → cong x 0 p ∨ cong y 0 p
-- f is the floor of a/b
def floor (a:int) (b:int) (f:int): Prop := (f*b ≤ a ∧ ∀ y: int, y*b ≤ a → y≤f)
-- g is the gcd of a... |
7b1d4445b9ead673b52f6e17e0394ce7f2e5f4e2 | efa51dd2edbbbbd6c34bd0ce436415eb405832e7 | /20161026_ICTAC_Tutorial/ex24.lean | b49d9ebdc158169516c6618553605cb29b471182 | [
"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 | 341 | lean | /- Σ x : A, B x -/
variable A : Type
variable B : A → Type
variable a : A
variable b : B a
check sigma.mk a b -- Σ (a : A), B a
check (sigma.mk a b).1 -- A
check (sigma.mk a b).2 -- B (sigma.fst (sigma.mk a b))
eval (sigma.mk a b).1 -- a
eval (sigma.mk a b).2 -- b
eval sigma.fst (sigma.mk a b)
eval sigma.sn... |
0c6ac669c316f2f5210e0072ad5ab76e58b52896 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/lean/smartUnfolding.lean | 243a863d2ddce770456f6ca1f7cb923226348975 | [
"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 | 247 | 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 with h
trace_state -- without smart unfolding the state would be a mess
assumption
|
fb6499fde2d0e56043cb5aefc095d046ee852e9d | 2a70b774d16dbdf5a533432ee0ebab6838df0948 | /_target/deps/mathlib/src/data/equiv/mul_add.lean | 83f6b2e48905a2a723ca59ba04ff90740b4d4998 | [
"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 | 16,368 | lean | /-
Copyright (c) 2018 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Callum Sutton, Yury Kudryashov
-/
import algebra.group.hom
import algebra.group.type_tags
import algebra.group.units_hom
/-!
# Multiplicative and additive equivs
In t... |
33dcdd7aa43c881e33e801741cd7d9e54152594a | b561a44b48979a98df50ade0789a21c79ee31288 | /src/Lean/Elab.lean | b56422ff40a6db7ae4292eec7ac322a1a5230134 | [
"Apache-2.0"
] | permissive | 3401ijk/lean4 | 97659c475ebd33a034fed515cb83a85f75ccfb06 | a5b1b8de4f4b038ff752b9e607b721f15a9a4351 | refs/heads/master | 1,693,933,007,651 | 1,636,424,845,000 | 1,636,424,845,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,187 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Elab.Import
import Lean.Elab.Exception
import Lean.Elab.Command
import Lean.Elab.Term
import Lean.Elab.App
import Lean.Elab.Binders
import Lean.... |
e457e7fe20139642f2dedf9d4490a13803e5a4b2 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/eqThm.lean | 4cbcb76345b6ae9db692b7b5472184c5fff0df48 | [
"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,436 | 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 => `(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 _ =>... |
f98464d3e9f551332ba61c8f072e80abc9168f4d | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/openTermTactic.lean | 101dde0ce0c24c1b8715ca6047985321cd0ea42d | [
"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 | 897 | lean | def f (x : Nat) :=
open Nat in
succ (succ x)
theorem f_eq : f x = Nat.succ (Nat.succ x) :=
rfl
def g (x : Nat) := open Nat in succ (succ x)
theorem f_eq_g : f x = g x := rfl
def h (x : Nat) := Nat.succ (open Nat in succ x)
theorem f_eq_h : f x = h x := rfl
open Nat in
def h' (x : Nat) := succ x
theorem ex ... |
5d3ec53de33dd22baa18460682b19c3081d7fd9f | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/field_theory/abel_ruffini.lean | 54929a6b44529906e35d69568cfe6d5f467690ee | [
"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 | 17,428 | lean | /-
Copyright (c) 2020 Thomas Browning and Patrick Lutz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Thomas Browning, Patrick Lutz
-/
import group_theory.solvable
import field_theory.polynomial_galois_group
import ring_theory.roots_of_unity
/-!
# The Abel-Ruffini T... |
8fa2a4637ee82be8887259b2c7f2853e9bb0d3ed | 471bedbd023d35c9d078c2f936dd577ace7f5813 | /library/init/meta/declaration.lean | 6e179294ab47514b4e939affeee5816e6135254f | [
"Apache-2.0"
] | permissive | lambdaxymox/lean | e06f0fa503666df827edd9867d7f49ca017aae64 | fc13c8c72a15dab71a2c2b31410c2cadc3526bd7 | refs/heads/master | 1,666,785,407,985 | 1,666,153,673,000 | 1,666,153,673,000 | 310,165,986 | 0 | 0 | Apache-2.0 | 1,604,542,096,000 | 1,604,542,095,000 | null | UTF-8 | Lean | false | false | 5,469 | 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.expr init.meta.name init.meta.task
/--
Reducibility hints are used in the convertibility checker.
When trying to solve a constrain... |
b63c9fe9ef61996e36e0b96077865e9d56e580d5 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/lie/of_associative.lean | e63c1a71f10e12cb57d8e45e6fcd603648b033d3 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 10,761 | lean | /-
Copyright (c) 2021 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import algebra.lie.basic
import algebra.lie.subalgebra
import algebra.lie.submodule
import algebra.algebra.subalgebra.basic
/-!
# Lie algebras of associative algebras
> T... |
d425a6d739ab91f2bd3b4462ae923560f75e2d16 | 9d2e3d5a2e2342a283affd97eead310c3b528a24 | /src/exercises_sources/thursday/afternoon/category_theory/exercise8.lean | 7a307acad0a36cf48af6c6349ca17487392c8448 | [] | permissive | Vtec234/lftcm2020 | ad2610ab614beefe44acc5622bb4a7fff9a5ea46 | bbbd4c8162f8c2ef602300ab8fdeca231886375d | refs/heads/master | 1,668,808,098,623 | 1,594,989,081,000 | 1,594,990,079,000 | 280,423,039 | 0 | 0 | MIT | 1,594,990,209,000 | 1,594,990,209,000 | null | UTF-8 | Lean | false | false | 1,557 | lean | import algebra.category.Module.basic
import linear_algebra.finite_dimensional
/-!
Every monomorphism in fdVec splits.
This is not-so-secretly an exercise in using the linear algebra library
-/
variables (𝕜 : Type) [field 𝕜]
open category_theory
abbreviation Vec := Module 𝕜
@[derive category]
def fdVec := { V :... |
1eea8587428d593322fb9d7cee3e8186ead29ea0 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/algebra/group_with_zero/basic.lean | 49998d2c7aceb20a4cd157799b6324939d9eba27 | [
"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 | 45,938 | 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 logic.nontrivial
import algebra.group.units_hom
import algebra.group.inj_surj
import algebra.group_with_zero.defs
/-!
# Groups with an adjoined zero element
... |
4038c3ca963665c23273b577b6fcc254b1307c41 | 556aeb81a103e9e0ac4e1fe0ce1bc6e6161c3c5e | /src/starkware/cairo/common/cairo_secp/verification/verification/signature_recover_public_key_nondet_bigint3_soundness.lean | 5bcaefe0717d40b0b545f26b28c4e8e490d51ef3 | [] | permissive | starkware-libs/formal-proofs | d6b731604461bf99e6ba820e68acca62a21709e8 | f5fa4ba6a471357fd171175183203d0b437f6527 | refs/heads/master | 1,691,085,444,753 | 1,690,507,386,000 | 1,690,507,386,000 | 410,476,629 | 32 | 9 | Apache-2.0 | 1,690,506,773,000 | 1,632,639,790,000 | Lean | UTF-8 | Lean | false | false | 6,644 | lean | /-
File: signature_recover_public_key_nondet_bigint3_soundness.lean
Autogenerated file.
-/
import starkware.cairo.lean.semantics.soundness.hoare
import .signature_recover_public_key_code
import ..signature_recover_public_key_spec
open tactic
open starkware.cairo.common.cairo_secp.bigint
open starkware.cairo.common.ca... |
566cb1dea6027aa54a696d602cd163cea92b07a0 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/data/fin/fin2.lean | d005f33e90a0d39dba6d72aadd1fc1fd00df94c2 | [
"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,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
-/
/-!
# Inductive type variant of `fin`
`fin` is defined as a subtype of `ℕ`. This file defines an equivalent type, `fin2`, which is
defined inductively. This is usef... |
119540f82af51eeab1eebb739a79f33cb690d4af | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/tactic24.lean | 65049d7b39222643c63a40d780c4c20afeeff76b | [
"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 | 653 | lean | import logic
open tactic
notation `(` h `|` r:(foldl `|` (e r, tactic.or_else r e) h) `)` := r
infixl `;`:15 := tactic.and_then
definition my_tac1 := apply @eq.refl
definition my_tac2 := repeat (apply @and.intro | assumption)
tactic_hint my_tac1
tactic_hint my_tac2
theorem T1 {A : Type.{2}} (a : A) : a = a
:= _
th... |
f8f73bfd394fbbf383526a26442c3ec2c814383b | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/linear_algebra/matrix/to_linear_equiv.lean | d11f840052bdb835a03aa1f8329778bf45486ef1 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 7,274 | 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, Patrick Massot, Casper Putz, Anne Baanen
-/
import linear_algebra.finite_dimensional
import linear_algebra.matrix.general_linear_group
import linear_algebra.matrix.nond... |
3a3f1f330eade6ef3e30b5aacba910db0f13a9b3 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/algebra/module/prod.lean | 9620c9d1cfe25bfa486597837fe7df22a9d99a8a | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,456 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon, Patrick Massot
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.algebra.module.basic
import Mathlib.PostPort
universes u_1 u_2 u_3
namespace M... |
2a8cc72459fed75473d0ad859cf2455c3a1fedbd | 680b0d1592ce164979dab866b232f6fa743f2cc8 | /library/theories/analysis/metric_space.lean | c5e89957b88b63d6f5c464a41c85e9c4028c83aa | [
"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 | 10,012 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad
Metric spaces.
-/
import data.real.division
open real eq.ops classical
structure metric_space [class] (M : Type) : Type :=
(dist : M → M → ℝ)
(dist_self : ∀ x : M, di... |
3a6db06a639f78e62a520206e1b0cb8af7dc346b | ba4794a0deca1d2aaa68914cd285d77880907b5c | /src/game/world2/level4.lean | dd926d299c083f832962ba876fa142b507479bd2 | [
"Apache-2.0"
] | permissive | ChrisHughes24/natural_number_game | c7c00aa1f6a95004286fd456ed13cf6e113159ce | 9d09925424da9f6275e6cfe427c8bcf12bb0944f | refs/heads/master | 1,600,715,773,528 | 1,573,910,462,000 | 1,573,910,462,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 900 | lean | import mynat.definition -- hide
import mynat.add -- hide
import game.world2.level3 -- hide
namespace mynat -- hide
/-
# Addition World
## Level 4: `add_comm` (boss level)
[boss battle music]
Look in Theorem statements -> Addition world to see the proofs you have.
These should be enough.
-/
/- Lemma
On the set of ... |
d31d670393f775716b59fc3462a5cd8be9011a23 | b9a81ebb9de684db509231c4469a7d2c88915808 | /src/super/resolution.lean | 35df2e3d04117b43fdba2264798898fa558d5ab1 | [] | no_license | leanprover/super | 3dd81ce8d9ac3cba20bce55e84833fadb2f5716e | 47b107b4cec8f3b41d72daba9cbda2f9d54025de | refs/heads/master | 1,678,482,996,979 | 1,676,526,367,000 | 1,676,526,367,000 | 92,215,900 | 12 | 6 | null | 1,513,327,539,000 | 1,495,570,640,000 | Lean | UTF-8 | Lean | false | false | 2,262 | lean | /-
Copyright (c) 2017 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner
-/
import .clause .prover_state .utils
open tactic monad native
namespace super
variable gt : expr → expr → bool
variables (ac1 ac2 : derived_clause)
variables (c1 c2 : ... |
dc3b8302a2a47bcae61e477009e13448a14d0802 | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/group_theory/subgroup.lean | a22f526b9f9bfd6d78daae0b97f869baf43ddd5c | [
"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 | 71,636 | lean | /-
Copyright (c) 2020 Kexing Ying. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kexing Ying
-/
import group_theory.submonoid
import algebra.group.conj
import algebra.pointwise
import order.atoms
/-!
# Subgroups
This file defines multiplicative and additive subgroup... |
25ec5d7e2877fbc1799ba8108199fbb423ef49f8 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/data/complex/module.lean | b9246960022e51936c04f7f7a2f6289b251297ee | [
"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 | 15,811 | lean | /-
Copyright (c) 2020 Alexander Bentkamp, Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Alexander Bentkamp, Sébastien Gouëzel, Eric Wieser
-/
import algebra.order.smul
import data.complex.basic
import data.fin.vec_notation
import field_theory.tower
... |
665f5be9298790b02925439c8b835122e3b0bd83 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/topology/algebra/algebra.lean | b484baf2e78cfd89a8dcdc21922c275f1fc0a91c | [
"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 | 6,061 | lean | /-
Copyright (c) 2021 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import algebra.algebra.subalgebra.basic
import topology.algebra.module.basic
import topology.algebra.field
/-!
# Topological (sub)algebras
A topological algebra ove... |
b3c52d0df51ee307243cafa514e3d022bc89e4bc | 54deab7025df5d2df4573383df7e1e5497b7a2c2 | /data/set/prod.lean | 93906ece7575bf76b883ecf3244628a49ee3f2c4 | [
"Apache-2.0"
] | permissive | HGldJ1966/mathlib | f8daac93a5b4ae805cfb0ecebac21a9ce9469009 | c5c5b504b918a6c5e91e372ee29ed754b0513e85 | refs/heads/master | 1,611,340,395,683 | 1,503,040,489,000 | 1,503,040,489,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,205 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Johannes Hölzl
-/
import data.set.lattice data.prod
universes u v w x
variables {α : Type u} {β : Type v} {γ : Type w} {δ : Type x}
variables {s s₁ s₂ : set α} {t t₁ t₂ : set β}
namesp... |
6d52b80ec7a3820f4e278a1e1bd05b612c23ad05 | 218e2afdf9209a5f82db7ac0089f79064e52bd80 | /lean/src/test.lean | 55bc3913fc79010e56e40c4a478c7a3937985388 | [
"MIT",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | mk12/analysis-i | 1f022e81cdc5cae5b25360f93000186874e1d02b | e85deae5441f705d9284eeb204c9c3ecb450c93a | refs/heads/main | 1,637,808,582,073 | 1,636,857,479,000 | 1,636,857,479,000 | 67,387,570 | 8 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 497 | lean | import standard
open eq.ops
open nat classical set
check sigma.
-- Axiom of specification for Mem
-- section specification
-- parameters {X : Set} (P : Mem X → Prop)
-- definition specify_mem : Set :=
-- λ x, x ∈ X ∧ ∀ Hx : x ∈ X, P (Mem.mk Hx)
-- definition specify_mem_subset : specify_mem ⊆ X... |
b68bc4782154e4120a94f803be77da6ab99b5480 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/rewrite9.lean | 25403496520c02fc2f4a5ed0111abda8fd09e05f | [
"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 | 200 | lean | import data.nat
open nat
constant f : nat → nat
theorem tst1 (x y : nat) (H1 : (λ z, z + 0) x = y) (H2 : x = y + 0) (H3 : x = y * 0) : f x = f y :=
begin
rewrite [▸ x = y at (H1, H2), H2]
end
|
149903ed0d856591df0e478a4f0db593bc0c1e29 | 491068d2ad28831e7dade8d6dff871c3e49d9431 | /tests/lean/coe.lean | 758f8b098c8e2195dd1e6bd60de9be722a0bfd5f | [
"Apache-2.0"
] | permissive | davidmueller13/lean | 65a3ed141b4088cd0a268e4de80eb6778b21a0e9 | c626e2e3c6f3771e07c32e82ee5b9e030de5b050 | refs/heads/master | 1,611,278,313,401 | 1,444,021,177,000 | 1,444,021,177,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 251 | lean | import logic
set_option pp.notation false
inductive Functor :=
mk : (Π (A B : Type), A → B) → Functor
definition Functor.to_fun [coercion] (f : Functor) {A B : Type} : A → B :=
Functor.rec (λ f, f) f A B
constant f : Functor
check f 0 = 0
|
8061b697d548e0619a5ab5097594ac6733d0c948 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /src/Init/WFTactics.lean | e019a077e3cdd725f2609b87d6291fa18b8adac5 | [
"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,578 | lean | /-
Copyright (c) 2022 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
prelude
import Init.SizeOf
import Init.WF
/-- Unfold definitions commonly used in well founded relation definitions.
This is primarily intended for internal... |
6d43c3606c1f6090ae97d55f10394d37847a8a4c | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/topology/category/TopCommRing.lean | c5b2e678d71c2ac1e66ab01df505044a7d60a265 | [
"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 | 3,531 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import algebra.category.CommRing.basic
import topology.category.Top.basic
import topology.algebra.ring
/-!
# Category of topological commutative rings
We introduce ... |
9c2dbb30e34872e7a55c7a4a90c232330bd7239f | 07c6143268cfb72beccd1cc35735d424ebcb187b | /src/data/real/basic.lean | 090cdc60e421003d65d9219aee89753f96ad1b7a | [
"Apache-2.0"
] | permissive | khoek/mathlib | bc49a842910af13a3c372748310e86467d1dc766 | aa55f8b50354b3e11ba64792dcb06cccb2d8ee28 | refs/heads/master | 1,588,232,063,837 | 1,587,304,803,000 | 1,587,304,803,000 | 176,688,517 | 0 | 0 | Apache-2.0 | 1,553,070,585,000 | 1,553,070,585,000 | null | UTF-8 | Lean | false | false | 26,276 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Floris van Doorn
The (classical) real numbers ℝ. This is a direct construction
from Cauchy sequences.
-/
import order.conditionally_complete_lattice data.real.cau_seq_... |
76d5bc4509684c13942b656b1182e15258178ef5 | f618aea02cb4104ad34ecf3b9713065cc0d06103 | /src/logic/embedding.lean | 351497664c081253a67b832d042b66f7dbf5c50f | [
"Apache-2.0"
] | permissive | joehendrix/mathlib | 84b6603f6be88a7e4d62f5b1b0cbb523bb82b9a5 | c15eab34ad754f9ecd738525cb8b5a870e834ddc | refs/heads/master | 1,589,606,591,630 | 1,555,946,393,000 | 1,555,946,393,000 | 182,813,854 | 0 | 0 | null | 1,555,946,309,000 | 1,555,946,308,000 | null | UTF-8 | Lean | false | false | 6,204 | 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
Injective functions.
-/
import data.equiv.basic data.option.basic data.subtype
universes u v w x
namespace function
structure embedding (α : Sort*) (... |
08bfb905884f3a54759d3c1eaf91e76aa09d8082 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/276.lean | 36905318c8aecd11cab651849c5bccf2cf4684ba | [
"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 | 289 | lean | universe u v
-- `#check` works
set_option pp.all true in
#check fun {α : Sort v} => PEmpty.rec (fun _ => α)
-- but `def` doesn't work
-- error: (kernel) compiler failed to infer low level type, unknown declaration 'PEmpty.rec'
def PEmpty.elim {α : Sort v} := PEmpty.rec (fun _ => α)
|
7ba1f30afd52e4d0f703cde8cd378e0409d46bb0 | 597e185014db6ce8a949dac0322798f11218338b | /src/kruskal_katona_abstract.lean | d6a1af3342f11da72611dd6bd4d070ef9926c704 | [] | no_license | b-mehta/lean-experiments | 58ce21c7106dfde163c236175fee30b341ba69ee | 5f0aed189f724ae6f739ec75dcdddcd2687614e1 | refs/heads/master | 1,598,987,002,293 | 1,576,649,380,000 | 1,576,649,380,000 | 219,032,370 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,501 | lean | import data.finset
import data.fintype
open fintype
open finset
variable {n : ℕ}
local notation `X` := fin n
def compress_family (U V : finset X) (𝒜 : finset (finset X)) : finset (finset X) := sorry
def shadow (𝒜 : finset (finset X)) : finset (finset X) := sorry
reserve prefix `∂`:90
notation ∂𝒜 := shadow 𝒜
... |
2d2340e164b1b371f461dd41b36dcebdd1f8e8e7 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/data/bitvec/core.lean | d256483d96bf7c6f809cac6253b48488b495ccd8 | [
"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 | 8,736 | lean | /-
Copyright (c) 2015 Joe Hendrix. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Joe Hendrix, Sebastian Ullrich
-/
import data.vector
import data.nat.basic
/-!
# Basic operations on bitvectors
This is a work-in-progress, and contains additions to other theories.
T... |
210e90e3033558c727d87e593abc6d5fd7887cc5 | 6ae186a0c6ab366b39397ec9250541c9d5aeb023 | /src/category_theory/products/associator.lean | 2c44ac326f1cc511ee6f077b613c8400b2315911 | [] | no_license | ThanhPhamPhuong/lean-category-theory | 0d5c4fe1137866b4fe29ec2753d99aa0d0667881 | 968a29fe7c0b20e10d8a27e120aca8ddc184e1ea | refs/heads/master | 1,587,206,682,489 | 1,544,045,056,000 | 1,544,045,056,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,583 | 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
import category_theory.products
import category_theory.equivalence
open category_theory
namespace category_theory.prod
universes u₁ v₁ u₂ v₂ u₃... |
49781d99eff0b34e911b4e16ddb96bb5ffe3d324 | 4b846d8dabdc64e7ea03552bad8f7fa74763fc67 | /library/init/meta/task.lean | 43c9331dd9a24f72c273a9ad427b812198f92e21 | [
"Apache-2.0"
] | permissive | pacchiano/lean | 9324b33f3ac3b5c5647285160f9f6ea8d0d767dc | fdadada3a970377a6df8afcd629a6f2eab6e84e8 | refs/heads/master | 1,611,357,380,399 | 1,489,870,101,000 | 1,489,870,101,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 727 | lean | prelude
import init.category
meta constant {u} task : Type u → Type u
namespace task
meta constant {u} get {α : Type u} (t : task α) : α
protected meta constant {u} pure {α : Type u} (t : α) : task α
protected meta constant {u v} map {α : Type u} {β : Type v} (f : α → β) (t : task α) : task β
protected meta constant... |
ca7c46bf31bcf09077517ce225213dc74bbad2d9 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/typeclass_loop.lean | d872a7e269a5e7ef8a6690affadcd0626936bc32 | [
"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 | 123 | lean |
example (M : Type → Type) [Monad M] : ExceptT Unit (ReaderT Unit (StateT Unit M)) Unit := do
let ctx ← read;
pure ()
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.