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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
9443cfec59d04778734a7abb9301a7dc32d15dac | 798dd332c1ad790518589a09bc82459fb12e5156 | /tactic/ext.lean | 87c91943508fb38baa1917cba623813365f285a2 | [
"Apache-2.0"
] | permissive | tobiasgrosser/mathlib | b040b7eb42d5942206149371cf92c61404de3c31 | 120635628368ec261e031cefc6d30e0304088b03 | refs/heads/master | 1,644,803,442,937 | 1,536,663,752,000 | 1,536,663,907,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,660 | lean |
import tactic.basic core data.sum tactic.rcases
universes u₁ u₂
open interactive interactive.types
open lean.parser nat tactic
meta def get_ext_subject : expr → tactic name
| (expr.pi n bi d b) :=
do v ← mk_local' n bi d,
b' ← whnf $ b.instantiate_var v,
get_ext_subject b'
| (expr.app _ e) :=
do t ← i... |
a790cd1e42c6f8a30c5e08a96e7493165cccbd4c | 05b503addd423dd68145d68b8cde5cd595d74365 | /src/algebra/pi_instances.lean | b71984a480a10809419f8bc406dd4fc9b37f2f12 | [
"Apache-2.0"
] | permissive | aestriplex/mathlib | 77513ff2b176d74a3bec114f33b519069788811d | e2fa8b2b1b732d7c25119229e3cdfba8370cb00f | refs/heads/master | 1,621,969,960,692 | 1,586,279,279,000 | 1,586,279,279,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 19,591 | 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
Pi instances for algebraic structures.
-/
import order.basic
import algebra.group.prod
import algebra.module
import data.finset
import ring_theory.subring
imp... |
2280a2a2207135abfeefe7a5e577861e38a7d5c1 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/stream/init.lean | 380462917deae85971d86370371d71b9c39d2242 | [
"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 | 20,195 | 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
-/
import data.stream.defs
import tactic.ext
import logic.function.basic
/-!
# Streams a.k.a. infinite lists a.k.a. infinite sequences
This file used to be i... |
4b8eb5b2d26501651e2c69dce938ae28a16eefc4 | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/lua9.lean | be0ae5ce5ea84ca02c84965909183259a3ac2816 | [
"Apache-2.0"
] | permissive | codyroux/lean0.1 | 1ce92751d664aacff0529e139083304a7bbc8a71 | 0dc6fb974aa85ed6f305a2f4b10a53a44ee5f0ef | refs/heads/master | 1,610,830,535,062 | 1,402,150,480,000 | 1,402,150,480,000 | 19,588,851 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 750 | lean | import Int.
variable x : Bool
(*
import("util.lua")
local env = get_environment()
local Int = Const("Int")
local plus = Const{"Int", "add"}
local x1, x2 = Consts("x1, x2")
print(env:type_check(Int))
print(env:type_check(plus))
env:add_var("x1", Int)
env:add_var("x2", Int)
print(plus(x1, x2))
print(e... |
3dd0a27e6975cc0e70fcf9adc6e9375f8d38993a | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/topology/algebra/uniform_group.lean | b78709b2c7c0caa196540078f35264b1f6714c89 | [
"Apache-2.0"
] | permissive | hikari0108/mathlib | b7ea2b7350497ab1a0b87a09d093ecc025a50dfa | a9e7d333b0cfd45f13a20f7b96b7d52e19fa2901 | refs/heads/master | 1,690,483,608,260 | 1,631,541,580,000 | 1,631,541,580,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 16,988 | lean | /-
Copyright (c) 2018 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Johannes Hölzl
-/
import topology.uniform_space.uniform_embedding
import topology.uniform_space.complete_separated
import topology.algebra.group
import tactic.abel
impo... |
1d0afed546813d7732536d802ab6290dc65c486d | 9bb72db9297f7837f673785604fb89b3184e13f8 | /library/init/wf.lean | f54700c6649b9b1bc9caa2f7ca5d2756e1d57fcc | [
"Apache-2.0"
] | permissive | dselsam/lean | ec83d7592199faa85687d884bbaaa570b62c1652 | 6b0bd5bc2e07e13880d332c89093fe3032bb2469 | refs/heads/master | 1,621,807,064,966 | 1,611,454,685,000 | 1,611,975,642,000 | 42,734,348 | 3 | 3 | null | 1,498,748,560,000 | 1,442,594,289,000 | C++ | UTF-8 | Lean | false | false | 7,203 | 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
-/
prelude
import init.data.nat.basic init.data.prod
universes u v
inductive acc {α : Sort u} (r : α → α → Prop) : α → Prop
| intro (x : α) (h : ∀ y, r y x → ... |
5853987445d122f210515863ceb7236a681cafbc | 618003631150032a5676f229d13a079ac875ff77 | /src/analysis/normed_space/bounded_linear_maps.lean | c04d2680d68735ef764eeb96e7465a21af47d072 | [
"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 | 19,366 | lean | /-
Copyright (c) 2018 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Johannes Hölzl
Continuous linear functions -- functions between normed vector spaces which are bounded and linear.
-/
import analysis.normed_space.multilinear
noncomp... |
1df4bd47213c160bd269e5ef8f2ccc92bc46e46b | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/using.lean | 5cd9475a3b22926c13d5d0bd6989039169d2ae26 | [
"Apache-2.0"
] | permissive | codyroux/lean0.1 | 1ce92751d664aacff0529e139083304a7bbc8a71 | 0dc6fb974aa85ed6f305a2f4b10a53a44ee5f0ef | refs/heads/master | 1,610,830,535,062 | 1,402,150,480,000 | 1,402,150,480,000 | 19,588,851 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 178 | lean | scope
using Nat
print add 0 1
check add_assoc
end
print add 0 1
namespace foo
using Nat
print add 0 1
end
using Nat::add plus
check plus_assoc
print add 0 1
|
c2fdc090ef45f84115b382f3a78c5ec8ca706025 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/analysis/special_functions/polynomials.lean | 8e9ca78ab5afc71150f29b8b76c3cf20a06a87fe | [
"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 | 10,706 | lean | /-
Copyright (c) 2020 Anatole Dedecker. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anatole Dedecker, Devon Tuma
-/
import analysis.asymptotics.asymptotic_equivalent
import analysis.asymptotics.specific_asymptotics
import data.polynomial.ring_division
/-!
# Limits ... |
2f4131fbb7036d2b8922c79ba4e68153b376702a | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/data/real/golden_ratio.lean | f08b613f981a842c351b2656398b4c23af4943c8 | [
"Apache-2.0"
] | permissive | jcommelin/mathlib | d8456447c36c176e14d96d9e76f39841f69d2d9b | ee8279351a2e434c2852345c51b728d22af5a156 | refs/heads/master | 1,664,782,136,488 | 1,663,638,983,000 | 1,663,638,983,000 | 132,563,656 | 0 | 0 | Apache-2.0 | 1,663,599,929,000 | 1,525,760,539,000 | Lean | UTF-8 | Lean | false | false | 5,624 | lean | /-
Copyright (c) 2020 Anatole Dedecker. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anatole Dedecker, Alexey Soloyev, Junyan Xu
-/
import data.real.irrational
import data.nat.fib
import data.fin.vec_notation
import tactic.ring_exp
import algebra.linear_recurrence
/... |
45d0676993c5c9f26af25ad5e2752785c997be74 | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /tests/lean/run/coe1.lean | 7c5596b803192764b5a9dd620ebd8227feed69ab | [
"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 | 582 | lean | constant A : Type.{1}
constant B : Type.{1}
constant f : A → B
coercion f
constant g : B → B → B
constants a1 a2 a3 : A
constants b1 b2 b3 : B
check g a1 b1
set_option pp.coercions true
check g a1 b1
constant eq {A : Type} : A → A → Type.{0}
check eq a1 a2
check eq a1 b1
set_option pp.implicit true
check eq a1 b1
set_... |
dded393941edf4828c062c48f80f2db6b998469d | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/tactic/elide.lean | e0424607dba031fecb02e33b1af03bf6b76001e0 | [
"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,996 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Simon Hudon
-/
import tactic.core
namespace tactic
namespace elide
meta def replace : ℕ → expr → tactic expr
| 0 e := do
t ← infer_type e,
expr.sort u ← infer_typ... |
83c0b312f696c974835561dd887c44a7ae1903ee | 137c667471a40116a7afd7261f030b30180468c2 | /src/analysis/normed_space/multilinear.lean | 391936281f594e8f8efac9de9105c58bb3dc65ec | [
"Apache-2.0"
] | permissive | bragadeesh153/mathlib | 46bf814cfb1eecb34b5d1549b9117dc60f657792 | b577bb2cd1f96eb47031878256856020b76f73cd | refs/heads/master | 1,687,435,188,334 | 1,626,384,207,000 | 1,626,384,207,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 73,398 | lean | /-
Copyright (c) 2020 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import analysis.normed_space.operator_norm
import topology.algebra.multilinear
/-!
# Operator norm on the space of continuous multilinear maps
When `f` is a c... |
7b2a675496726b2bf84303554b3ecc3b13806fad | ad0c7d243dc1bd563419e2767ed42fb323d7beea | /analysis/limits.lean | aae1160ab264197fe1ecd5f7775fe13fb01d8398 | [
"Apache-2.0"
] | permissive | sebzim4500/mathlib | e0b5a63b1655f910dee30badf09bd7e191d3cf30 | 6997cafbd3a7325af5cb318561768c316ceb7757 | refs/heads/master | 1,585,549,958,618 | 1,538,221,723,000 | 1,538,221,723,000 | 150,869,076 | 0 | 0 | Apache-2.0 | 1,538,229,323,000 | 1,538,229,323,000 | null | UTF-8 | Lean | false | false | 10,811 | 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
A collection of limit properties.
-/
import algebra.big_operators algebra.group_power tactic.norm_num
analysis.ennreal analysis.topology.infinite_sum
noncomputable th... |
e287a8ce5352e8585d387a2aa1e50ad49ad0304c | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/algebra/default.lean | 5ffc9a6f688f72365d0b4dde9f64f6d03c4085e1 | [] | 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 | 256 | 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
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.algebra.functions
namespace Mathlib
|
d0ef6e6dbe2c81f290a165aa4a3eb7f499364c04 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/462.lean | 1eceea59f978b26bb8a9b6a73f4cfd22d092f043 | [
"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 | 244 | lean | class FooClass (α : Type) where
foo : α
class BarClass (α : Type) where
bar : α
class FooBarClass (α : Type) where
foo : α
bar : α
instance (α : Type) [h : FooClass α] [h' : BarClass α] : FooBarClass α :=
{ h, h' with }
|
31252e5df7d10d9f369d4ecbd776f2ed8c6e6393 | b328e8ebb2ba923140e5137c83f09fa59516b793 | /src/Lean/Compiler/IR/Checker.lean | 833ece43340e6b4c6e58b88fe368e727c557654d | [
"Apache-2.0"
] | permissive | DrMaxis/lean4 | a781bcc095511687c56ab060e816fd948553e162 | 5a02c4facc0658aad627cfdcc3db203eac0cb544 | refs/heads/master | 1,677,051,517,055 | 1,611,876,226,000 | 1,611,876,226,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,440 | 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.Compiler.IR.CompilerM
import Lean.Compiler.IR.Format
namespace Lean.IR.Checker
structure CheckerContext where
env : Environment
localCtx :... |
d21b1dd394cd06845b965d804fd37776990be4d0 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/data/seq/seq.lean | 17c086e5bcc02bc0177e0f71c77cb9c94d7b06b2 | [
"Apache-2.0"
] | permissive | ramonfmir/mathlib | c5dc8b33155473fab97c38bd3aa6723dc289beaa | 14c52e990c17f5a00c0cc9e09847af16fabbed25 | refs/heads/master | 1,661,979,343,526 | 1,660,830,384,000 | 1,660,830,384,000 | 182,072,989 | 0 | 0 | null | 1,555,585,876,000 | 1,555,585,876,000 | null | UTF-8 | Lean | false | false | 28,495 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.lazy_list
import data.nat.basic
import data.stream.init
import data.seq.computation
universes u v w
/-
coinductive seq (α : Type u) : Type u
| nil : seq... |
3623bce39654f7f9efeeb398bee5160d96bb01da | 94935fb4ab68d4ce640296d02911624a93282575 | /src/solutions/thursday/afternoon/category_theory/exercise14.lean | d22a92847c3a557c6ff00a6cb8b60784c6a08e6b | [] | permissive | marius-leonhardt/lftcm2020 | 41c0d7fe3457c1cf3b72cbb1c312b48fc94b85d2 | a3eb53f18d9be9a5be748dfe8fe74d0d31a0c1f7 | refs/heads/master | 1,668,623,789,936 | 1,594,710,949,000 | 1,594,710,949,000 | 279,514,936 | 0 | 0 | MIT | 1,594,711,916,000 | 1,594,711,916,000 | null | UTF-8 | Lean | false | false | 925 | lean | import category_theory.monoidal.category
/-!
Let's construct the category of monoid objects in a monoidal category.
-/
universes v u
open category_theory
variables (C : Type u) [category.{v} C] [monoidal_category C]
structure Mon_in :=
(X : C)
(ι : 𝟙_ C ⟶ X)
(μ : X ⊗ X ⟶ X)
-- There are three missing axioms here!... |
ce17c55341adf5443afe573745affb54e29fd4db | 94e33a31faa76775069b071adea97e86e218a8ee | /src/data/nat/factorization/basic.lean | 471ef688ac994209417c8ae1bf59e7d0440aa2b0 | [
"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 | 24,279 | lean | /-
Copyright (c) 2021 Stuart Presnell. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Stuart Presnell
-/
import data.nat.prime
import data.finsupp.multiset
import algebra.big_operators.finsupp
/-!
# Prime factorizations
`n.factorization` is the finitely supported fu... |
52372fbfe5afbcbb5b08ea8da075df3585060356 | 9d2e3d5a2e2342a283affd97eead310c3b528a24 | /src/hints/thursday/afternoon/category_theory/exercise4/hint3.lean | 78c9671705be044c9a9ac46beb2e2d7dd3ce9dc0 | [] | 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 | 805 | lean | import algebra.category.CommRing
import category_theory.yoneda
noncomputable theory
open category_theory
open opposite
open polynomial
/-!
Now let's give the backwards map.
-/
def CommRing_forget_representable : Σ (R : CommRing), (forget CommRing) ≅ coyoneda.obj (op R) :=
⟨CommRing.of (polynomial ℤ),
{ hom :=
{ ... |
7c051487f422386b36970567a6611aedc16907d8 | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /src/analysis/inner_product_space/dual.lean | f4c25850079569382eb52d0e86ed8df9d4e0125e | [
"Apache-2.0"
] | permissive | dexmagic/mathlib | ff48eefc56e2412429b31d4fddd41a976eb287ce | 7a5d15a955a92a90e1d398b2281916b9c41270b2 | refs/heads/master | 1,693,481,322,046 | 1,633,360,193,000 | 1,633,360,193,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,979 | lean | /-
Copyright (c) 2020 Frédéric Dupuis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frédéric Dupuis
-/
import analysis.inner_product_space.projection
import analysis.normed_space.dual
/-!
# The Fréchet-Riesz representation theorem
We consider inner product spaces, ... |
d03943bfd11f4bef00884485ca017084fb3729a6 | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /tests/lean/run/inj2.lean | 7492d928cff8d9bdb041ce7cc8aa45d9431359bc | [
"Apache-2.0"
] | permissive | collares/lean4 | 861a9269c4592bce49b71059e232ff0bfe4594cc | 52a4f535d853a2c7c7eea5fee8a4fa04c682c1ee | refs/heads/master | 1,691,419,031,324 | 1,618,678,138,000 | 1,618,678,138,000 | 358,989,750 | 0 | 0 | Apache-2.0 | 1,618,696,333,000 | 1,618,696,333,000 | null | UTF-8 | Lean | false | false | 1,130 | lean | universes u v
inductive Vec2 (α : Type u) (β : Type v) : Nat → Type (max u v)
| nil : Vec2 α β 0
| cons : α → β → forall {n}, Vec2 α β n → Vec2 α β (n+1)
inductive Fin2 : Nat → Type
| zero (n : Nat) : Fin2 (n+1)
| succ {n : Nat} (s : Fin2 n) : Fin2 (n+1)
theorem test1 {α β} {n} (a₁ a₂ : α) (b₁ b₂ : β) ... |
bc4027fc52c343b83940c9b7ff17ed5c0d3e7cff | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/measure_theory/function/simple_func_dense.lean | 4380d9a8b7a36ca03e862e329ac5c0b961a9f720 | [
"Apache-2.0"
] | permissive | troyjlee/mathlib | e18d4b8026e32062ab9e89bc3b003a5d1cfec3f5 | 45e7eb8447555247246e3fe91c87066506c14875 | refs/heads/master | 1,689,248,035,046 | 1,629,470,528,000 | 1,629,470,528,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 41,359 | lean | /-
Copyright (c) 2019 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou, Yury Kudryashov, Heather Macbeth
-/
import measure_theory.function.l1_space
/-!
# Density of simple functions
Show that each Borel measurable function can be approximat... |
e43cc23318e174f983594362c7450f5e4a59e01c | a721fe7446524f18ba361625fc01033d9c8b7a78 | /src/principia/mynat/mod.lean | ef1ab748e6a2f93d750a1ef95a6c9d6fdd6297f3 | [] | no_license | Sterrs/leaning | 8fd80d1f0a6117a220bb2e57ece639b9a63deadc | 3901cc953694b33adda86cb88ca30ba99594db31 | refs/heads/master | 1,627,023,822,744 | 1,616,515,221,000 | 1,616,515,221,000 | 245,512,190 | 2 | 0 | null | 1,616,429,050,000 | 1,583,527,118,000 | Lean | UTF-8 | Lean | false | false | 1,880 | lean | import .dvd
import .nat_sub
import .induction
namespace hidden
namespace mynat
private lemma mod_lemma {m n : mynat} :
0 < n ∧ n ≤ m → m - n < m :=
begin
assume h,
cases h with h0n hnm,
have : 0 < m,
apply lt_le_chain n,
assumption,
assumption,
rw zero_lt_iff_succ at h0n,
cases h0n with k hk... |
ae295c5f1ff120f50aa030d9e316965ccf27f91a | 4fa161becb8ce7378a709f5992a594764699e268 | /src/data/nat/cast.lean | b20b796f1d605220be10e1a236b15c7bcaa8a423 | [
"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 | 8,796 | lean | /-
Copyright (c) 2014 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
Natural homomorphism from the natural numbers into a monoid with one.
-/
import algebra.ordered_field
import data.nat.basic
namespace nat
variables {α : Type*}
sectio... |
6730f42e3bcad4976a9ec05811e1002796746103 | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/data/nat/prime.lean | cedf3e93b66f715c22a6b97ace7ee0084eac0116 | [
"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 | 19,783 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Jeremy Avigad, Mario Carneiro
-/
import data.nat.sqrt data.nat.gcd data.list.basic data.list.perm
import algebra.group_power
import tactic.wlog
/-!
# Prime ... |
edfa8b56ba297d1cfcf456efb3c09a0f288aa5ac | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/category_theory/const.lean | 43d640956e9025932c05dbef49ae1c34e3d2a805 | [
"Apache-2.0"
] | permissive | gebner/mathlib | eab0150cc4f79ec45d2016a8c21750244a2e7ff0 | cc6a6edc397c55118df62831e23bfbd6e6c6b4ab | refs/heads/master | 1,625,574,853,976 | 1,586,712,827,000 | 1,586,712,827,000 | 99,101,412 | 1 | 0 | Apache-2.0 | 1,586,716,389,000 | 1,501,667,958,000 | Lean | UTF-8 | Lean | false | false | 2,447 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.functor_category
import category_theory.opposites
universes v₁ v₂ v₃ u₁ u₂ u₃ -- declare the `v`'s first; see `category_theory.category` for ... |
37b04ffe593f781a2238c4bd3995946c3ac4b4f9 | d5ecf6c46a2f605470a4a7724909dc4b9e7350e0 | /set_theory/ordinal.lean | a4fdc780b6c3326c2246637a066eca2196f23bdd | [
"Apache-2.0"
] | permissive | MonoidMusician/mathlib | 41f79df478987a636b735c338396813d2e8e44c4 | 72234ef1a050eea3a2197c23aeb345fc13c08ff3 | refs/heads/master | 1,583,672,205,771 | 1,522,892,143,000 | 1,522,892,143,000 | 128,144,032 | 0 | 0 | Apache-2.0 | 1,522,892,144,000 | 1,522,890,892,000 | Lean | UTF-8 | Lean | false | false | 117,014 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
Ordinal arithmetic.
Ordinals are defined as equivalences of well-ordered sets by order isomorphism.
-/
import order.order_iso set_theory.cardinal data.sum
noncomputable... |
b5c25a5aa9ce18b56879c1cb80cb2cd2da87b3df | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/rat/meta_defs.lean | 79bb6fd147b1c2605c0039060615f1af1fc49607 | [] | 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,422 | lean | /-
Copyright (c) 2019 Robert Y. Lewis . All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Robert Y. Lewis
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.rat.basic
import Mathlib.tactic.core
import Mathlib.PostPort
namespace Mathlib
/-!... |
cf8ac580be134a11c711bdc543f7073a901e6b60 | 4d7079ae603c07560e99d1ce35876f769cbb3e24 | /src/split_cycle.lean | b9811f22c1bcb9cfb01b9fbdda62327998ba7b69 | [] | no_license | chasenorman/Formalized-Voting | 72493a08aa09d98d0fb589731b842e2d08c991d0 | de04e630b83525b042db166670ba97f9952b5691 | refs/heads/main | 1,687,282,160,284 | 1,627,155,031,000 | 1,627,155,031,000 | 370,472,025 | 13 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 11,018 | lean | import main
open_locale classical
-- Example 3: A candidate x defeats a candidate y in P
-- just in case the margin of x over y is (i) positive and
-- (ii) greater than the weakest margin in each majority cycle containing x and y.
def split_cycle_CCR {V X : Type} : CCR V X :=
λ (P : Prof V X) (x y : X), ∀ [f: ... |
2dc4b8f8903e2137cfff6bac492af3a25b4ee9c6 | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch5/ex0507.lean | 2c463dda49dcd5d0939e937711e7c3614f3093d4 | [] | no_license | Ailrun/Theorem_Proving_in_Lean | ae6a23f3c54d62d401314d6a771e8ff8b4132db2 | 2eb1b5caf93c6a5a555c79e9097cf2ba5a66cf68 | refs/heads/master | 1,609,838,270,467 | 1,586,846,743,000 | 1,586,846,743,000 | 240,967,761 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 107 | lean | example (p q r : Prop) (hp : p) (hq : q) (hr : r) : p ∧ q ∧ r :=
by split; try { split }; assumption
|
1d7df757ddf87817a5ebe07c58e2b72f2c38aef0 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/ring_theory/int/basic.lean | 0608060bd07f458c12f26878c2e01f049d695f19 | [
"Apache-2.0"
] | permissive | robertylewis/mathlib | 3d16e3e6daf5ddde182473e03a1b601d2810952c | 1d13f5b932f5e40a8308e3840f96fc882fae01f0 | refs/heads/master | 1,651,379,945,369 | 1,644,276,960,000 | 1,644,276,960,000 | 98,875,504 | 0 | 0 | Apache-2.0 | 1,644,253,514,000 | 1,501,495,700,000 | Lean | UTF-8 | Lean | false | false | 14,262 | 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, Jens Wagemaker, Aaron Anderson
-/
import ring_theory.coprime.basic
import ring_theory.principal_ideal_domain
/-!
# Divisibility over ℕ and ℤ
This file collects result... |
21fc38bc92a430288dda2e5e091f3f07efe31c5f | 0f5090f82d527e0df5bf3adac9f9e2e1d81d71e2 | /src/michael/konigsberg.lean | f3adb1d54e4e1ffb5eaea5d29b82a4d5df70f4d8 | [] | no_license | apurvanakade/mc2020-lean-projects | 36eb42c4baccc37183635c36f8e1b3afa4ec1230 | 02466225aa629ab1232043bcc0a053a099fdb939 | refs/heads/master | 1,688,791,717,534 | 1,597,874,092,000 | 1,597,874,092,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 279 | lean | import .basic
import .eulerian_circuits
noncomputable theory
open_locale classical
-- universes u
-- variables {V : Type u} [fintype V]
open graph
open finset
def KonigsbergBridges : multigraph (fin 4) :=
multigraph_of_edges [(0,1), (0,2), (0,3), (1,2), (1,2), (2,3), (2,3)]
|
b754bdc22dd148caf20ce7b0042a17c850bf6dae | fe84e287c662151bb313504482b218a503b972f3 | /src/combinatorics/choose_fin.lean | d7ccc7e77a96abe2d36a2c7d01d45cfe576bb031 | [] | 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 | 17,157 | lean | /-
Copyright (c) 2019 Neil Strickland. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Neil Strickland
In this file we give an equivalence from lists in ℕ with no
duplicates to arbitrary lists in ℕ.
-/
import combinatorics.choose combinatorics.simplicial
open com... |
570bfa45af02f5e5b8f0628d806c2fdc99dce68c | 4b846d8dabdc64e7ea03552bad8f7fa74763fc67 | /library/init/meta/environment.lean | fe3e128e37e1f8b387bb580c0972c9e52c310a49 | [
"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 | 5,536 | 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.declaration init.meta.exceptional init.data.option.basic
meta constant environment : Type
namespace environment
/--
Information f... |
01968e8041b3b053d29300bb0f5704059ccbcec2 | 5e3548e65f2c037cb94cd5524c90c623fbd6d46a | /src_icannos_totilas/reduction/cpge_reduction_007_a.lean | b6166be8786d6bcd6bc135f05068b2e831e873b8 | [] | no_license | ahayat16/lean_exos | d4f08c30adb601a06511a71b5ffb4d22d12ef77f | 682f2552d5b04a8c8eb9e4ab15f875a91b03845c | refs/heads/main | 1,693,101,073,585 | 1,636,479,336,000 | 1,636,479,336,000 | 415,000,441 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 363 | lean | import algebra.module.basic
import algebra.module.linear_map
import linear_algebra.basic
import linear_algebra.prod
import linear_algebra.projection
import order.bounded_lattice
theorem cpge_reduction_7_a (R : Type*) (M : Type*)
[semiring R] [add_comm_monoid M] [module R M]
(E : submodule R M) (u : linear_map R M M... |
6fb40369c0a4045149305cca1cd43bc90c9813c8 | 6e36ebd5594a0d512dea8bc6ffe78c71b5b5032d | /src/mywork/Lectures/lecture_1a.lean | 693a5b14941dc7612683da849ede514caca3d546 | [] | no_license | wrw2ztk/cs2120f21 | cdc4b1b4043c8ae8f3c8c3c0e91cdacb2cfddb16 | f55df4c723d3ce989908679f5653e4be669334ae | refs/heads/main | 1,691,764,473,342 | 1,633,707,809,000 | 1,633,707,809,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,097 | lean | -- import definitions of real and rational numbers from mathlib
import data.real.basic
namespace cs2120
/-
The first part of this lesson is in the file, lecture_1.md.
Please start there then return here when you're done with
that document.
-/
/-
NUMBER SYSTEMS
-/
/-
Mathematicians think about operations on many ki... |
65611ac91df55a2436d47dc7dc5b17dd0e4ed01f | 947b78d97130d56365ae2ec264df196ce769371a | /src/Init/Data/List/Control.lean | 386b2258c5b870e3a60003a77f8e3a9c1ffa0e63 | [
"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 | 7,105 | 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.Control.Monad
import Init.Control.Alternative
import Init.Data.List.Basic
namespace List
universes u v w u₁ u₂
/-
Remark: we can define... |
e94de8ff90d1ff8d04b34a545ce96afaf2cc1ee9 | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/logic/function/iterate.lean | f28c8c257acd8c88c9379f5542ba3adfd3edb16b | [
"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 | 5,301 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import logic.function.conjugate
/-!
# Iterations of a function
In this file we prove simple properties of `nat.iterate f n` a.k.a. `f^[n]`:
* `iterate_zero`, `it... |
acac68560539808d32920c8d6d2c709269eaa1f8 | 6094e25ea0b7699e642463b48e51b2ead6ddc23f | /library/data/set/comm_semiring.lean | c19f90914dddc8284c93db28f99a0b336b3ce8e8 | [
"Apache-2.0"
] | permissive | gbaz/lean | a7835c4e3006fbbb079e8f8ffe18aacc45adebfb | a501c308be3acaa50a2c0610ce2e0d71becf8032 | refs/heads/master | 1,611,198,791,433 | 1,451,339,111,000 | 1,451,339,111,000 | 48,713,797 | 0 | 0 | null | 1,451,338,939,000 | 1,451,338,939,000 | null | UTF-8 | Lean | false | false | 856 | 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
(set A) is an instance of a commutative semiring
-/
import data.set.basic algebra.ring
open set
definition set_comm_semiring [instance] (A : Type) : comm_semi... |
0e12b1140ba099a77434c4cb11ed461f3221b039 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/logic/relation.lean | 068438fa9286cdebe146bffb3127912ac640d872 | [
"Apache-2.0"
] | permissive | lacker/mathlib | f2439c743c4f8eb413ec589430c82d0f73b2d539 | ddf7563ac69d42cfa4a1bfe41db1fed521bd795f | refs/heads/master | 1,671,948,326,773 | 1,601,479,268,000 | 1,601,479,268,000 | 298,686,743 | 0 | 0 | Apache-2.0 | 1,601,070,794,000 | 1,601,070,794,000 | null | UTF-8 | Lean | false | false | 13,261 | 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
Transitive reflexive as well as reflexive closure of relations.
-/
import tactic.basic
variables {α : Type*} {β : Type*} {γ : Type*} {δ : Type*}
namespace relation
s... |
fd98e3510f32989161a1d62e55d659b4d2919d4b | 8e381650eb2c1c5361be64ff97e47d956bf2ab9f | /src/scheme.lean | 1193b9ce83238a284cf12dde09bd1607b98cff1c | [] | no_license | alreadydone/lean-scheme | 04c51ab08eca7ccf6c21344d45d202780fa667af | 52d7624f57415eea27ed4dfa916cd94189221a1c | refs/heads/master | 1,599,418,221,423 | 1,562,248,559,000 | 1,562,248,559,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 724 | lean | /-
Definition of a scheme.
https://stacks.math.columbia.edu/tag/01II
-/
import topology.basic
import sheaves.covering.covering
import sheaves.presheaf_of_rings_maps
import sheaves.locally_ringed_space
import spectrum_of_a_ring.zariski_topology
import spectrum_of_a_ring.structure_sheaf
open topological_space
uni... |
3a0dfaa80f6102c0fc2259fdbaf06ce6d0043334 | 9028d228ac200bbefe3a711342514dd4e4458bff | /src/data/set/intervals/ord_connected.lean | 4081a617140b8a345249de02350de699a97fc7e1 | [
"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,404 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Yury G. Kudryashov
-/
import data.set.intervals.unordered_interval
import data.set.lattice
/-!
# Order-connected sets
We say that a set `s : set α` is `ord_connected` if for all `... |
caefc2f46a592d885750e927a7449ef9028f1da6 | 87a08a8e9b222ec02f3327dca4ae24590c1b3de9 | /src/category_theory/isomorphism.lean | d88280f065a3d218bba5a9c2af581a1058b5188a | [
"Apache-2.0"
] | permissive | naussicaa/mathlib | 86d05223517a39e80920549a8052f9cf0e0b77b8 | 1ef2c2df20cf45c21675d855436228c7ae02d47a | refs/heads/master | 1,592,104,950,080 | 1,562,073,069,000 | 1,562,073,069,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,432 | lean | -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Tim Baumann, Stephen Morgan, Scott Morrison, Floris van Doorn
import category_theory.functor
universes v u -- declare the `v`'s first; see `category_theory.category` for an exp... |
d89cee9b19c352d2b364a38d9faa0996d1d2e9df | ec62863c729b7eedee77b86d974f2c529fa79d25 | /21/b.lean | 401b6b19525910121ad90f000390b1e471d75ec1 | [] | no_license | rwbarton/advent-of-lean-4 | 2ac9b17ba708f66051e3d8cd694b0249bc433b65 | 417c7e2718253ba7148c0279fcb251b6fc291477 | refs/heads/main | 1,675,917,092,057 | 1,609,864,581,000 | 1,609,864,581,000 | 317,700,289 | 24 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,701 | lean | import Std.Data.HashSet
import Std.Data.HashMap
open Std
def parseLine (str : String) : List String × List String :=
match (str.dropRight 1).splitOn " (contains " with
| [l, r] => (l.splitOn " ", r.splitOn ", ")
| _ => panic! "invalid parse"
structure Graph where
ingredients : HashSet String
options : HashMap St... |
0cf933b8667c7b186e0692591028cc65f645d295 | ee8cdbabf07f77e7be63a449b8483ce308d37218 | /lean/src/valid/mathd-algebra-185.lean | c65cc5632ebbdc0e69efae80594a4cbd775b9431 | [
"MIT",
"Apache-2.0"
] | permissive | zeta1999/miniF2F | 6d66c75d1c18152e224d07d5eed57624f731d4b7 | c1ba9629559c5273c92ec226894baa0c1ce27861 | refs/heads/main | 1,681,897,460,642 | 1,620,646,361,000 | 1,620,646,361,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 364 | lean | /-
Copyright (c) 2021 OpenAI. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kunhao Zheng
-/
import data.real.basic
import data.finset.basic
example (f : ℝ → ℝ) (h₀ : ∀ x, f x = abs ( x + 4 ) ) (h₁ : fintype {x : ℝ | f x < 9}) : finset.card { x : ℝ | f x < 9 }.to_fins... |
213218425d1baef7e4a514da1441197d028ddd84 | 947b78d97130d56365ae2ec264df196ce769371a | /tests/lean/namedHoles.lean | a9ee142f63cbf5cf713e8e4a49e2a802d872e9b9 | [
"Apache-2.0"
] | permissive | shyamalschandra/lean4 | 27044812be8698f0c79147615b1d5090b9f4b037 | 6e7a883b21eaf62831e8111b251dc9b18f40e604 | refs/heads/master | 1,671,417,126,371 | 1,601,859,995,000 | 1,601,860,020,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,449 | lean | new_frontend
def f (x : Nat) (y : Bool) :=
x + if y then 1 else 0
def g (x y : Nat) :=
x + y
#check f ?x ?x -- error the first occurrence (?x : Nat) and the second (?x : Bool)
#check g ?x ?x -- ok
def h1 (x : Nat) : Nat := by
refine g ?hole ?hole; -- it is the same hole
case hole => exact x
#eval h1 10
theorem e... |
0e212cd14a03e3a0f5cb2a7c2b9997e0c8eff04d | 4376c25f060c13471bb89cdb12aeac1d53e53876 | /src/espaces-metriques/custom/cauchy.lean | 827bb9fa3f9316ff9491bba88e8e56fdd3c4367e | [
"MIT"
] | permissive | RaitoBezarius/projet-maths-lean | 8fa7df563d64c256561ab71893c523fc1424b85c | 42356e980e021a20c3468f5ca1639fec01bb934f | refs/heads/master | 1,613,002,128,339 | 1,589,289,282,000 | 1,589,289,282,000 | 244,431,534 | 0 | 1 | MIT | 1,584,312,574,000 | 1,583,169,883,000 | TeX | UTF-8 | Lean | false | false | 13,256 | lean | import .defs
import .sequences
import .bolzano_weierstrass
open espace_metrique
open_locale classical
noncomputable theory
section suites
variables {X:Type} [espace_metrique X]
variables {Y:Type} [espace_metrique Y]
variables {Z:Type} [espace_metrique Z]
def fonction_distance (x : ℕ → X) (y: X) (n: ℕ) := d (x n) y
... |
d8308ec101f8572104de53b0af7e7df275b48964 | a4673261e60b025e2c8c825dfa4ab9108246c32e | /src/Lean/Util/CollectFVars.lean | 27716f74876002b2b2142dcd33f29e7b5e120559 | [
"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 | 1,173 | 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.Expr
namespace Lean.CollectFVars
structure State :=
(visitedExpr : ExprSet := {})
(fvarSet : NameSet := {})
instance : Inhabited ... |
9e7e6de8d13ed4738d3c86b93b605d8c6a0ba751 | 46125763b4dbf50619e8846a1371029346f4c3db | /src/data/int/basic.lean | 13f1ea5b87b0dd2dfdd732801650e0e03a8e0a98 | [
"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 | 52,193 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
The integers, with addition, multiplication, and subtraction.
-/
import data.nat.basic algebra.char_zero algebra.order_functions
open nat
namespace int
instance : inha... |
b3872d994db318c734e4d754bceda35c7ed3deba | b392eb79fb36952401156496daa60628ccb07438 | /MathPort/Basic.lean | 6f870b74186a4ece2e710fa4daf45096058fb9d4 | [
"Apache-2.0"
] | permissive | AurelienSaue/mathportsource | d9eabe74e3ab7774baa6a10a6dc8d4855ff92266 | 1a164e4fff7204c522c1f4ecc5024fd909be3b0b | refs/heads/master | 1,685,214,377,305 | 1,623,621,223,000 | 1,623,621,223,000 | 364,191,042 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,075 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Daniel Selsam
-/
import MathPort.Util
import MathPort.Path
import Lean
import Std.Data.HashSet
import Std.Data.HashMap
namespace MathPort
open Lean Lean.Meta Lean.Elab Lean.El... |
9757f3159e59437cffe0b1f0df7741b4f16d4a92 | ebf7140a9ea507409ff4c994124fa36e79b4ae35 | /src/hints/category_theory/exercise3/hint2.lean | 3780f98e6e94df71eceeed403661b4b589dafbef | [] | no_license | fundou/lftcm2020 | 3e88d58a92755ea5dd49f19c36239c35286ecf5e | 99d11bf3bcd71ffeaef0250caa08ecc46e69b55b | refs/heads/master | 1,685,610,799,304 | 1,624,070,416,000 | 1,624,070,416,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 564 | lean | import category_theory.equivalence
open category_theory
variables {C : Type*} [category C]
variables {D : Type*} [category D]
lemma equiv_reflects_mono {X Y : C} (f : X ⟶ Y) (e : C ≌ D)
(hef : mono (e.functor.map f)) : mono f :=
begin
split,
intros Z g h w,
-- Let's think about the maths here.
-- We're try... |
31705ae7ac7b77ed1c509c835ae53e838f860f67 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/data/finset/sym.lean | 73d53a96cc41ad824779a7928790f91fad7cb49a | [
"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 | 5,822 | lean | /-
Copyright (c) 2021 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies
-/
import data.finset.prod
import data.sym.sym2
/-!
# Symmetric powers of a finset
This file defines the symmetric powers of a finset as `finset (sym α n)` and `finset (sy... |
5d71a672aea24a87cdd40399557eb63d7161cfb2 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/eq_some_iff_get_eq_issue.lean | 7adc3d1de12347db63d3044740e650674dc4ddf6 | [
"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 | 655 | lean | @[simp]
theorem exists_prop {p q : Prop} : (∃ h : p, q) ↔ p ∧ q :=
Iff.intro (fun ⟨hp, hq⟩ => And.intro hp hq) (fun ⟨hp, hq⟩ => Exists.intro hp hq)
namespace Option
def get {α : Type u} : ∀ {o : Option α}, isSome o → α
| some x, h => x
@[simp] theorem isSome_none : @isSome α none = false := rfl
@[simp] theorem isSom... |
92d65ceab417155f1ee80168d36f6cbf41440547 | 4727251e0cd73359b15b664c3170e5d754078599 | /archive/imo/imo1988_q6.lean | a7c1b02a90224ae41297b8873f5e2611da7615e6 | [
"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 | 13,867 | 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 data.nat.prime
import data.rat.basic
import order.well_founded
import tactic.linarith
/-!
# IMO 1988 Q6 and constant descent Vieta jumping
Question 6 of IMO... |
8db84a92aacb3fb331ab7df242f5d46b2452e2f1 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/linear_algebra/matrix/basis.lean | 93e3ff341dd4006679bf4b3be9bbf32395913962 | [
"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 | 7,874 | 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.matrix.reindex
import linear_algebra.matrix.to_lin
/-!
# Bases and matrices
This file defines the ma... |
9880a5993f234d0dfe73695fdac361c569a113ed | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /src/Init/Data/BinomialHeap/Basic.lean | 48f9d9cd086b1278fa7ab5050ac3984b42c7c98b | [
"Apache-2.0"
] | permissive | mhuisi/lean4 | 28d35a4febc2e251c7f05492e13f3b05d6f9b7af | dda44bc47f3e5d024508060dac2bcb59fd12e4c0 | refs/heads/master | 1,621,225,489,283 | 1,585,142,689,000 | 1,585,142,689,000 | 250,590,438 | 0 | 2 | Apache-2.0 | 1,602,443,220,000 | 1,585,327,814,000 | C | UTF-8 | Lean | false | false | 5,145 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import Init.Data.List
universes u
namespace BinomialHeapImp
structure HeapNodeAux (α : Type u) (h : Type u) :=
(val : α) (rank : Nat) (children : ... |
77b516317568e32adc288b4a7509e63039064fa7 | c777c32c8e484e195053731103c5e52af26a25d1 | /archive/imo/imo2019_q4.lean | a4d25853dab7fa1fdbe144abed6e46097db2e886 | [
"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 | 4,134 | lean | /-
Copyright (c) 2020 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
-/
import tactic.interval_cases
import algebra.big_operators.order
import data.nat.multiplicity
/-!
# IMO 2019 Q4
Find all pairs `(k, n)` of positive integers such... |
6a58cca603bcbd4fd84379a21afe88567eecab0d | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/ring_theory/algebra_tower.lean | b91df05ad08f00ff4c1fc3f36865cfd703bf25a2 | [
"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 | 19,959 | lean | /-
Copyright (c) 2020 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import algebra.invertible
import ring_theory.adjoin
import linear_algebra.basis
import algebra.algebra.basic
/-!
# Towers of algebras
We set up the basic theory of algebra t... |
0522ef6829bda7151c099220faf75b331862e70d | 82b86ba2ae0d5aed0f01f49c46db5afec0eb2bd7 | /src/Lean/Elab/LetRec.lean | ac98751efdb2cddc38d6ed9bfbb7ab5b2d2d40e8 | [
"Apache-2.0"
] | permissive | banksonian/lean4 | 3a2e6b0f1eb63aa56ff95b8d07b2f851072d54dc | 78da6b3aa2840693eea354a41e89fc5b212a5011 | refs/heads/master | 1,673,703,624,165 | 1,605,123,551,000 | 1,605,123,551,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,643 | 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.Attributes
import Lean.Elab.Binders
import Lean.Elab.DeclModifiers
import Lean.Elab.SyntheticMVars
namespace Lean.Elab.Term
open Meta
str... |
a5a2715ea24aab3c73500e01da14c58cb4925143 | 3dd1b66af77106badae6edb1c4dea91a146ead30 | /library/standard/classical.lean | c4e112410dc47d7b6b70bbfdb359c4a19fdf061f | [
"Apache-2.0"
] | permissive | silky/lean | 79c20c15c93feef47bb659a2cc139b26f3614642 | df8b88dca2f8da1a422cb618cd476ef5be730546 | refs/heads/master | 1,610,737,587,697 | 1,406,574,534,000 | 1,406,574,534,000 | 22,362,176 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,579 | 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
import logic cast
using eq_proofs
axiom prop_complete (a : Prop) : a = true ∨ a = false
theorem case (P : Prop → Prop) (H1 : P true) (H2 : P false) (a :... |
1dd0a373b6feda07d239d2ec59e3e73bc43cc0da | 5e3548e65f2c037cb94cd5524c90c623fbd6d46a | /src_icannos_totilas/aops/1988-IMO-Problem_3.lean | aba6abbb43e91cd7027c7f6c7ca0a4641e2a399c | [] | no_license | ahayat16/lean_exos | d4f08c30adb601a06511a71b5ffb4d22d12ef77f | 682f2552d5b04a8c8eb9e4ab15f875a91b03845c | refs/heads/main | 1,693,101,073,585 | 1,636,479,336,000 | 1,636,479,336,000 | 415,000,441 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 309 | lean | import set_theory.cardinal
theorem IMO_Problem_3_1988 (f : ℕ -> ℕ) :
f(1) = 1 ∧ f(3) = 3 ∧ (∀ n : ℕ, f(2*n) =f(n)) ∧
(∀ n : ℕ, f(4*n+1) = 2*f(2*n+1)-f(n)) ∧
(∀ n : ℕ, f(4*n+3) = 3*f(2*n+1) - 2 *f(n)) →
∃ S : set ℕ, ((∀ n ∈ S, n ≤ 1988) ∧ cardinal.mk S = 92) := sorry |
d6d1713a15e67942321b2faa7868295dbc5169fc | 9dd3f3912f7321eb58ee9aa8f21778ad6221f87c | /tests/lean/notation_error_pos.lean | 446d0c88520a91a00400edcac62f9a50ff84b8ff | [
"Apache-2.0"
] | permissive | bre7k30/lean | de893411bcfa7b3c5572e61b9e1c52951b310aa4 | 5a924699d076dab1bd5af23a8f910b433e598d7a | refs/heads/master | 1,610,900,145,817 | 1,488,006,845,000 | 1,488,006,845,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 166 | lean | notation `foo` := "a" + 1
notation `bla` a := a + 1
notation `boo` a := 1 + a
notation `cmd` a := λ x, x + a
check foo
check bla "a"
check boo "a"
check cmd "b"
|
43d0bdafbca36017a405edd58c67a6ab53b5e6b3 | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /04_Quantifiers_and_Equality.org.18.lean | b3283f9dde6ef86c22953fa14d9cc9a8119cc291 | [] | 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 | 225 | lean | /- page 54 -/
import standard
import data.nat
open nat
theorem T2 (a b c : nat) (H1 : a = b) (H2 : b = c + 1) : a ≠ 0 :=
calc
a = b : H1
... = c + 1 : H2
... = succ c : add_one c
... ≠ 0 : succ_ne_zero c
|
72dbf4412384347c4b9c80d41e67fba4a5d0180c | 1d02a718c550dba762f0c3d2ad13d16a43649ca1 | /src/util.lean | c488ec6d9c45807b93a89a5e4d22de147bdadedc | [
"Apache-2.0"
] | permissive | mhuisi/rc-correctness | 48488dfbbe18e222399b0c5252d2803a9dd1be74 | 2b7878ac594ba285b0b5cdabe96f41c6e3bbcc87 | refs/heads/master | 1,590,988,773,033 | 1,585,334,858,000 | 1,585,334,858,000 | 190,653,803 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 30,177 | lean | import tactic.fin_cases
import logic.function
import data.nat.basic
namespace list
open well_founded_tactics
-- sizeof_lt_sizeof_of_mem, map_wf, map_wf_eq_map courtesy of Sebastian Ullrich
lemma sizeof_lt_sizeof_of_mem {α} [has_sizeof α] {a : α} : ∀ {l : list α}, a ∈ l → sizeof a < sizeof l
| [] h := abs... |
c552b005f38f1881d1c18c720ad97ded94bddf3a | 08bd4ba4ca87dba1f09d2c96a26f5d65da81f4b4 | /src/Lean/Server/Utils.lean | adb2120b88013bcb427db78782299b8d3b13f226 | [
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"Apache-2.0",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | gebner/lean4 | d51c4922640a52a6f7426536ea669ef18a1d9af5 | 8cd9ce06843c9d42d6d6dc43d3e81e3b49dfc20f | refs/heads/master | 1,685,732,780,391 | 1,672,962,627,000 | 1,673,459,398,000 | 373,307,283 | 0 | 0 | Apache-2.0 | 1,691,316,730,000 | 1,622,669,271,000 | Lean | UTF-8 | Lean | false | false | 5,047 | lean | /-
Copyright (c) 2020 Wojciech Nawrocki. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Wojciech Nawrocki, Marc Huisinga
-/
import Lean.Data.Lsp.Communication
import Lean.Data.Lsp.Diagnostics
import Lean.Data.Lsp.Extra
import Lean.Data.Lsp.TextSync
import Lean.Server.... |
89d0f9f65209d1ba6700a71b635d08a9e46bc7b8 | 187f08b3b7d0ba0b5da6964ac75c1cf00fa7e9c7 | /library/data/int/order.lean | e7e09947da1d5478f7969f65d3d34e3fc2a20ff9 | [
"Apache-2.0"
] | permissive | adamduracz/lean | 5e7d83d3c90bbdc6cbd24855b444570b087c21f0 | 1b15036dba469020d37f7d6b77b88974d8a36cb1 | refs/heads/master | 1,586,369,880,279 | 1,427,508,695,000 | 1,427,508,737,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 32,871 | lean | /-
Copyright (c) 2014 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: data.int.order
Authors: Floris van Doorn, Jeremy Avigad
The order relation on the integers. We show that int is an instance of linear_comm_ordered_ring
and transfer the results.
-/
... |
98252108ac84905f7ab763d9970efbd874d997a4 | 737dc4b96c97368cb66b925eeea3ab633ec3d702 | /tests/lean/run/renameI.lean | b2961a5c2cfe8e6abe714e7e96481d954c6548d0 | [
"Apache-2.0"
] | permissive | Bioye97/lean4 | 1ace34638efd9913dc5991443777b01a08983289 | bc3900cbb9adda83eed7e6affeaade7cfd07716d | refs/heads/master | 1,690,589,820,211 | 1,631,051,000,000 | 1,631,067,598,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 153 | lean | example : ∀ a b c d : Nat, a = b → a = d → a = c → c = b := by
intros
renameI h1 _ h2
apply Eq.trans
apply Eq.symm
exact h2
exact h1
|
d5474ddb190491f34dacaf5269b05ddddf1c7410 | 98000ddc36f1ec26addea0df1853c69fa0e71d67 | /fin_seq.lean | d684cc34533b362e5207029240458a2fe48ac756 | [] | no_license | SCRK16/Intuitionism | 50b7b5ed780a75c4ff1339c3d36f1133b8acdfe3 | a3d9920ae056b39a66e37d1d0e03d246bca1e961 | refs/heads/master | 1,670,199,869,808 | 1,598,045,061,000 | 1,598,045,061,000 | 254,657,585 | 1 | 0 | null | 1,590,754,909,000 | 1,586,529,604,000 | Lean | UTF-8 | Lean | false | false | 5,506 | lean | /-
This file defines finite sequences from {0, ..., n} to ℕ
-/
import data.fin
import tactic
import ..Intuitionism.nat_seq
@[ext] structure fin_seq := mk :: (len : ℕ) (seq : fin len → ℕ)
namespace fin_seq
def finitize (a : 𝒩) (n : ℕ) : fin_seq := {
len := n,
seq := λ i, a i.val
}
lemma finitize_len (a : �... |
90f65910f6394609cd6e8f5e13720fbf48b7304c | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/tactic/rcases.lean | 960a9be7c9806b40b5cef10e5eb3ef0ef4b82b28 | [
"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 | 44,973 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.dlist
import tactic.core
import tactic.clear
/-!
# Recursive cases (`rcases`) tactic and related tactics
`rcases` is a tactic that will perform `cases`... |
9230c03994d5c1f66ba13233101c9203097fdccd | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/analysis/convolution.lean | 83e485df2d1000d1cb59e243b08a9d13f70e7805 | [
"Apache-2.0"
] | permissive | ramonfmir/mathlib | c5dc8b33155473fab97c38bd3aa6723dc289beaa | 14c52e990c17f5a00c0cc9e09847af16fabbed25 | refs/heads/master | 1,661,979,343,526 | 1,660,830,384,000 | 1,660,830,384,000 | 182,072,989 | 0 | 0 | null | 1,555,585,876,000 | 1,555,585,876,000 | null | UTF-8 | Lean | false | false | 43,003 | lean | /-
Copyright (c) 2022 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
-/
import measure_theory.group.integration
import measure_theory.group.prod
import measure_theory.function.locally_integrable
import analysis.calculus.specific_funct... |
627ece35e0f1a01bb0710f23691fa2da13e75d46 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/data/polynomial/div.lean | c247ba1f4b93a66e939331abedd532206f89912c | [
"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 | 21,776 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Johannes Hölzl, Scott Morrison, Jens Wagemaker
-/
import data.polynomial.inductions
import data.polynomial.monic
import ring_theory.multiplicity
/-!
# Division of univaria... |
b3b589795251b3afd3c5ccb6e717fbd3a659628f | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/tactic/algebra.lean | 0c65b8fc25d618cc09cca651d577eb19f39bc439 | [
"Apache-2.0"
] | permissive | gebner/mathlib | eab0150cc4f79ec45d2016a8c21750244a2e7ff0 | cc6a6edc397c55118df62831e23bfbd6e6c6b4ab | refs/heads/master | 1,625,574,853,976 | 1,586,712,827,000 | 1,586,712,827,000 | 99,101,412 | 1 | 0 | Apache-2.0 | 1,586,716,389,000 | 1,501,667,958,000 | Lean | UTF-8 | Lean | false | false | 2,271 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
-/
import tactic.core
open lean.parser
namespace tactic
@[user_attribute]
meta def ancestor_attr : user_attribute unit (list name) :=
{ name := `ancestor,
descr := "ance... |
7f189752042f42a078bd2c2d414ed565e820ce89 | 297c4ceafbbaed2a59b6215504d09e6bf201a2ee | /finset/quot.lean | 27bd522f70784aa08b695b864c0b87a6d42f98a3 | [] | no_license | minchaowu/Kruskal.lean3 | 559c91b82033ce44ea61593adcec9cfff725c88d | a14516f47b21e636e9df914fc6ebe64cbe5cd38d | refs/heads/master | 1,611,010,001,429 | 1,497,935,421,000 | 1,497,935,421,000 | 82,000,982 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,316 | lean | universe variables u v
namespace quot
section
universe variables u_a u_b u_c
variables {A : Type u_a} {B : Type u_b} {C : Type u_c}
variables [s₁ : setoid A] [s₂ : setoid B]
include s₁ s₂
attribute [reducible, elab_as_eliminator]
protected definition lift₂
(f : A → B → C)(c : ∀ a₁ a₂ b₁ b₂, a₁ ≈ b₁... |
ed92c19aa40e9cc62f8091c7e3d848fd0e91d465 | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /stage0/src/Lean/ScopedEnvExtension.lean | e8387c5f5c1db410b014f1b249c686085b8d69af | [
"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 | 8,513 | 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.Environment
import Lean.Data.NameTrie
import Lean.Attributes
namespace Lean
namespace ScopedEnvExtension
inductive Entry (α : Type) where
|... |
48e17313755f813644c42fc6ee3bbc07ab89d6af | b70031c8e2c5337b91d7e70f1e0c5f528f7b0e77 | /src/algebra/archimedean.lean | a05fed526c8881c9de249ae996feac4ad3275ecd | [
"Apache-2.0"
] | permissive | molodiuc/mathlib | cae2ba3ef1601c1f42ca0b625c79b061b63fef5b | 98ebe5a6739fbe254f9ee9d401882d4388f91035 | refs/heads/master | 1,674,237,127,059 | 1,606,353,533,000 | 1,606,353,533,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 12,800 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
Archimedean groups and fields.
-/
import algebra.field_power
import data.rat
variables {α : Type*}
/-- An ordered additive commutative monoid is called `archimedean` ... |
d4b7ca537b626d9affefdf6f8cd8285d4d8a5fcd | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/combinatorics/simple_graph/connectivity.lean | d6621ff6c91d3b79d824e98f9bd9485be882a3bf | [
"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 | 79,012 | lean | /-
Copyright (c) 2021 Kyle Miller. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kyle Miller
-/
import combinatorics.simple_graph.basic
import combinatorics.simple_graph.subgraph
import data.list.rotate
/-!
# Graph connectivity
> THIS FILE IS SYNCHRONIZED WITH MATHL... |
f3b134802225437e2e04d0090ae53b76b8679a89 | 26ac254ecb57ffcb886ff709cf018390161a9225 | /src/data/holor.lean | 52bd8f061c279f19e3fd5582cba34174a99a428b | [
"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 | 14,153 | lean | /-
Copyright (c) 2018 Alexander Bentkamp. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Alexander Bentkamp
-/
import algebra.pi_instances
/-!
# Basic properties of holors
Holors are indexed collections of tensor coefficients. Confusingly,
they are often called tenso... |
91623690fb3aa4bc1bf4630708ba07e3cc31395b | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/list/nodup.lean | 2db0e46040191beacdcd6162cf8e4c56912fe7e7 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,422 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Kenny Lau
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.list.pairwise
import Mathlib.data.list.forall2
import Mathlib.PostPort
uni... |
a9581b28b4095a74a7a0cb7416f2bcc8b9828670 | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/tactic/slice.lean | 6d90012be88194332ac267020ad7d772053088c9 | [
"Apache-2.0"
] | permissive | fpvandoorn/mathlib | b21ab4068db079cbb8590b58fda9cc4bc1f35df4 | b3433a51ea8bc07c4159c1073838fc0ee9b8f227 | refs/heads/master | 1,624,791,089,608 | 1,556,715,231,000 | 1,556,715,231,000 | 165,722,980 | 5 | 0 | Apache-2.0 | 1,552,657,455,000 | 1,547,494,646,000 | Lean | UTF-8 | Lean | false | false | 2,958 | lean | -- Copyright (c) 2018 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Scott Morrison
import category_theory.category
open category_theory
-- TODO someone might like to generalise this tactic to work with other associative structures.
namespace ... |
e28837858decf5174c6809e518cb2f51b4e99f37 | 206422fb9edabf63def0ed2aa3f489150fb09ccb | /src/data/equiv/local_equiv.lean | 8abd1669ccc32c5fc487deba787e9ee71ab25145 | [
"Apache-2.0"
] | permissive | hamdysalah1/mathlib | b915f86b2503feeae268de369f1b16932321f097 | 95454452f6b3569bf967d35aab8d852b1ddf8017 | refs/heads/master | 1,677,154,116,545 | 1,611,797,994,000 | 1,611,797,994,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 24,977 | 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 o... |
118eac80b30ed3d53e6f3bf54ecf7f6ab42bb42f | 22e97a5d648fc451e25a06c668dc03ac7ed7bc25 | /src/meta/expr.lean | 61750f78cfc8230ecb9e28bc6276c2baf62ee37e | [
"Apache-2.0"
] | permissive | keeferrowan/mathlib | f2818da875dbc7780830d09bd4c526b0764a4e50 | aad2dfc40e8e6a7e258287a7c1580318e865817e | refs/heads/master | 1,661,736,426,952 | 1,590,438,032,000 | 1,590,438,032,000 | 266,892,663 | 0 | 0 | Apache-2.0 | 1,590,445,835,000 | 1,590,445,835,000 | null | UTF-8 | Lean | false | false | 33,075 | lean | /-
Copyright (c) 2019 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Simon Hudon, Scott Morrison, Keeley Hoek, Robert Y. Lewis
-/
import data.string.defs
import tactic.derive_inhabited
/-!
# Additional operations on expr and related typ... |
cfb557d2c2382526978d4847f0e5b9a6abf4ff3b | 4950bf76e5ae40ba9f8491647d0b6f228ddce173 | /src/data/quot.lean | dc5be9e7b5f286687c8ce2801f24e7a5991d0508 | [
"Apache-2.0"
] | permissive | ntzwq/mathlib | ca50b21079b0a7c6781c34b62199a396dd00cee2 | 36eec1a98f22df82eaccd354a758ef8576af2a7f | refs/heads/master | 1,675,193,391,478 | 1,607,822,996,000 | 1,607,822,996,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 20,070 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
-/
import logic.relator
/-!
# Quotient types
This module extends the core library's treatment of quotient types (`init.data.quot`).
## Tags
quotient
-/
variables {α... |
92cff5902f35f4bb3c116b3b3bf593065614844f | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/topology/category/TopCommRing.lean | ddb4cdeee78af31b59ca2bc1198e53857195e370 | [
"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 | 2,684 | 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.instances.complex
universes u
open category_theory
/-- A bundled topologi... |
30e476e9542d8dbce3c7a937e93c22fe4c76c367 | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/data/polynomial/basic.lean | f1806d5998969e08a753e393985629a070ec54c6 | [
"Apache-2.0"
] | permissive | agjftucker/mathlib | d634cd0d5256b6325e3c55bb7fb2403548371707 | 87fe50de17b00af533f72a102d0adefe4a2285e8 | refs/heads/master | 1,625,378,131,941 | 1,599,166,526,000 | 1,599,166,526,000 | 160,748,509 | 0 | 0 | Apache-2.0 | 1,544,141,789,000 | 1,544,141,789,000 | null | UTF-8 | Lean | false | false | 5,361 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Johannes Hölzl, Scott Morrison, Jens Wagemaker
-/
import tactic.ring_exp
import tactic.chain
import data.monoid_algebra
import data.finset.sort
/-!
# Theory of univariate ... |
7b8ec54c4dfaa6570f815d2e2ba788ba0c09d0f5 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/list/bag_inter.lean | 4942b526ae006d0df30881b86a2f5a2f7ee2ae8e | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,066 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Scott Morrison
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.list.basic
import Mathlib.PostPort
universes u
namespace Mathlib
n... |
0ba4f635004c2b3ae157dcdee92b126554355acf | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/algebra/big_operators.lean | 63ea3425ba3e05b3c2ac90af70a0ef278384a073 | [
"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 | 36,072 | 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 tactic.tauto data.list.basic data.finset data.nat.enat
import algebra.group algebra.ordered_group algebra.group_... |
b9185f2547751a07cdf476812f5f3660b0fa675e | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /doc/demo/set.lean | 17d310a3f46ac664044dc3bd53271a95fa6faa56 | [
"Apache-2.0"
] | permissive | codyroux/lean0.1 | 1ce92751d664aacff0529e139083304a7bbc8a71 | 0dc6fb974aa85ed6f305a2f4b10a53a44ee5f0ef | refs/heads/master | 1,610,830,535,062 | 1,402,150,480,000 | 1,402,150,480,000 | 19,588,851 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,203 | lean | import macros
definition Set (A : Type) : Type := A → Bool
definition element {A : Type} (x : A) (s : Set A) := s x
infix 60 ∈ : element
definition subset {A : Type} (s1 : Set A) (s2 : Set A) := ∀ x, x ∈ s1 → x ∈ s2
infix 50 ⊆ : subset
theorem subset_trans {A : Type} {s1 s2 s3 : Set A} (H1 : s1 ⊆ s2) (H2 : s2 ⊆ s3)... |
dc31aff21d6e79670d61a82a043e28720e063d35 | f1a12d4db0f46eee317d703e3336d33950a2fe7e | /dlo/dlo_main.lean | 017e5fa827c468a65345aea43ed0a2460a1955f0 | [
"Apache-2.0"
] | permissive | avigad/qelim | bce89b79c717b7649860d41a41a37e37c982624f | b7d22864f1f0a2d21adad0f4fb3fc7ba665f8e60 | refs/heads/master | 1,584,548,938,232 | 1,526,773,708,000 | 1,526,773,708,000 | 134,967,693 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,133 | lean | import .dlo_qelim .to_fm
open tactic
meta def to_idx : expr → tactic nat
| (expr.var n) := return n
| _ := failed
meta def to_adlo (β : Type) [reflected β] (i : nat) : expr → tactic (adlo × list β)
| `(%%(expr.var m) = %%(expr.var n)) := return ((m =' n), [])
| `(%%(expr.var m) = %%ne) :=
do bn ← eval_expr β n... |
5bc5f5388c099811137ea9ba27621aee381005c0 | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/ring_theory/ideal/operations.lean | fe0da9f4b9fa8639e1befd98aabe2b5c86eda6d1 | [
"Apache-2.0"
] | permissive | agjftucker/mathlib | d634cd0d5256b6325e3c55bb7fb2403548371707 | 87fe50de17b00af533f72a102d0adefe4a2285e8 | refs/heads/master | 1,625,378,131,941 | 1,599,166,526,000 | 1,599,166,526,000 | 160,748,509 | 0 | 0 | Apache-2.0 | 1,544,141,789,000 | 1,544,141,789,000 | null | UTF-8 | Lean | false | false | 39,873 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
More operations on modules and ideals.
-/
import data.nat.choose
import data.equiv.ring
import ring_theory.algebra_operations
import ring_theory.ideal.basic
universes u v w x
o... |
f6752700a2737a33314b2a645552dc32d2251615 | d6124c8dbe5661dcc5b8c9da0a56fbf1f0480ad6 | /Papyrus/Script/Module.lean | fe1b7af371547aba36d22d689b86f7b36b6296dd | [
"Apache-2.0"
] | permissive | xubaiw/lean4-papyrus | c3fbbf8ba162eb5f210155ae4e20feb2d32c8182 | 02e82973a5badda26fc0f9fd15b3d37e2eb309e0 | refs/heads/master | 1,691,425,756,824 | 1,632,122,825,000 | 1,632,123,075,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,110 | lean | import Lean.Parser
import Papyrus.Builders
import Papyrus.Script.Do
import Papyrus.Script.ParserUtil
namespace Papyrus.Script
open Builder Lean Parser Term
@[runParserAttributeHooks]
def llvmModDef := leading_parser
Parser.ident >> " do " >> modDoSeq
scoped syntax (name := doLlvmModDef)
"llvm " &"module " llvmModD... |
863e422cb78a545aeb610c60c81f40f37b6746d0 | 69bc7d0780be17e452d542a93f9599488f1c0c8e | /exam_1_review.lean | 6bcc4cf9ce340d5b9b4659d4c9209c91c3128bfe | [] | no_license | joek13/cs2102-notes | b7352285b1d1184fae25594f89f5926d74e6d7b4 | 25bb18788641b20af9cf3c429afe1da9b2f5eafb | refs/heads/master | 1,673,461,162,867 | 1,575,561,090,000 | 1,575,561,090,000 | 207,573,549 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,284 | lean | /-
Give examples of terms of various types, including basic data types and function types.
To answer the function-type-related questions, you really must know how to write lambda expressions.
-/
/-
Types of terms:
- literal terms (e.g. 5, tt, "hello")
- identifier terms (e.g. x)
- application expressions
-/
/- Writi... |
76a65f58061224fe2f8b93649a991bfd570a5f43 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/induction_tac2.lean | 682916b632c78f722b22def1a9a61c29336b4f1b | [
"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 | 212 | lean | import data.nat
open nat
example (a : nat) : a + 0 = a :=
begin
induction a using nat.strong_induction_on with a IH,
cases a,
reflexivity,
have aux : a + 0 = a, from IH a (lt.base a),
rewrite -aux
end
|
68c83f01a0ba287a1bc5d8aae046c4bfc6a716ed | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/private.lean | bd6aab1bf444a002d4cf9a6db70ed963cbbc9ff8 | [
"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 | 978 | lean |
-- Issue 1
def foo := 10
def f (x : Nat) := x + x
namespace Bla
private def foo := "hello"
#check foo == "world" -- `foo` resolves to private `Bla.foo`
private def foo : Float := 1.0 -- should produce error like in other programming languages
end Bla
#check foo == 0
#check Bla.foo
-- Issue 2
namespace Boo
d... |
a8d5720fd9e266e866694c35fd9f8ccc6fbab335 | 6b2a480f27775cba4f3ae191b1c1387a29de586e | /group_rep_2/orthoganality_of_character/orthoganality.lean | ca66ebc546a5fac2430f0f2141800ff2f7e4819f | [] | no_license | Or7ando/group_representation | a681de2e19d1930a1e1be573d6735a2f0b8356cb | 9b576984f17764ebf26c8caa2a542d248f1b50d2 | refs/heads/master | 1,662,413,107,324 | 1,590,302,389,000 | 1,590,302,389,000 | 258,130,829 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 14,352 | lean | import schur_theorem.schur
import data.complex.basic
import Tools.tools
import basic_definitions.matrix_representation
import Reynold_operator.reynold_scalar_product
open_locale big_operators
universes u v w w'
variables {G : Type u} [group G]
{X : Type v} [fintype X][decidable_eq X]
{ρ : group_r... |
20eda1f287b6276543d1a068ca05518d8886fdff | e429a7c31201d4c56a2716f77a99c4831967b0de | /definitions.lean | 12c419f5e773b914a53045b6e7b993dee5127ecd | [] | no_license | jthickstun/lean | cdb5ee8ec78294167d771a6167c0947419afa9eb | 8254b987f06be1f98ef2e0cc33b7d4655d77dc85 | refs/heads/master | 1,620,156,057,836 | 1,557,865,724,000 | 1,557,865,724,000 | 106,618,304 | 8 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 2,360 | lean | namespace nat
def eq : ℕ → ℕ → bool
| m n := if m = n then tt else ff
end nat
namespace nt
/-
Basic abstract number-theoretic definitions
-/
def composite (n : ℕ) : Prop := n ≠ 0 ∧ ∃ a : ℕ, ∃ b : ℕ, a ≠ 1 ∧ b ≠ 1 ∧ n = a*b
def irreducible (p : ℕ) : Prop := p ≠ 0 ∧ p ≠ 1 ∧ ∀ k : ℕ, (k ∣ p) → (k = 1 ∨ k = p)
def pri... |
d47a18de521d21ea01e6715ad0fe1f393920dfaf | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/algebraic_topology/simplex_category.lean | 9197ab92e072bda708db8cfca6452e1ed465a9a3 | [
"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 | 17,609 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Scott Morrison, Adam Topaz
-/
import order.category.NonemptyFinLinOrd
import category_theory.skeletal
import data.finset.sort
import tactic.linarith
/-! # The simplex... |
e53d923e5e3f3fc60cedd891b5decce351d6c9ce | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/data/finsupp/pointwise.lean | f65336514fb542e99e716a74f63b4ba867f7e50a | [
"Apache-2.0"
] | permissive | gebner/mathlib | eab0150cc4f79ec45d2016a8c21750244a2e7ff0 | cc6a6edc397c55118df62831e23bfbd6e6c6b4ab | refs/heads/master | 1,625,574,853,976 | 1,586,712,827,000 | 1,586,712,827,000 | 99,101,412 | 1 | 0 | Apache-2.0 | 1,586,716,389,000 | 1,501,667,958,000 | Lean | UTF-8 | Lean | false | false | 1,937 | 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 data.finsupp
/-!
# The pointwise product on `finsupp`.
TODO per issue #1864:
We intend to remove the convolution product on finsupp, and define
it only on a ... |
28ccd4f3703e69f86ec7533576dc18633a55b148 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/field_theory/intermediate_field.lean | 28460f81f825290c11f67a33a9a9d075cb1d881d | [
"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 | 12,132 | lean | /-
Copyright (c) 2020 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen
-/
import field_theory.subfield
import field_theory.tower
/-!
# Intermediate fields
Let `L / K` be a field extension, given as an instance `algebra K L`.
This file defines ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.