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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
61c4625f9380253c79d65bdf9145ac02c6a49aac | 4727251e0cd73359b15b664c3170e5d754078599 | /src/data/int/absolute_value.lean | 5c3a369601a7d5cebf6cb7d3d2176e6a63b168cc | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 1,080 | lean | /-
Copyright (c) 2021 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen
-/
import algebra.module.basic
import group_theory.group_action.units
import data.int.cast
import algebra.order.absolute_value
/-!
# Absolute values and the integers
This fi... |
e0b0bd52e6b6b898c91f4d92832dfa9dfe4fb784 | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/group_theory/perm/list.lean | 7c292af0366fb831d48777ba4195bf9ff3f2afb0 | [
"Apache-2.0"
] | permissive | waynemunro/mathlib | e3fd4ff49f4cb43d4a8ded59d17be407bc5ee552 | 065a70810b5480d584033f7bbf8e0409480c2118 | refs/heads/master | 1,693,417,182,397 | 1,634,644,781,000 | 1,634,644,781,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 16,371 | lean | /-
Copyright (c) 2021 Yakov Pechersky. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yakov Pechersky
-/
import data.list.rotate
import group_theory.perm.support
/-!
# Permutations from a list
A list `l : list α` can be interpreted as a `equiv.perm α` where each ele... |
08ba072202e1b7b659440bf41daf802d4118a1c9 | 367134ba5a65885e863bdc4507601606690974c1 | /src/number_theory/primes_congruent_one.lean | 35a705b0a0c9506c160c3c01f38d94d1041fdb92 | [
"Apache-2.0"
] | permissive | kodyvajjha/mathlib | 9bead00e90f68269a313f45f5561766cfd8d5cad | b98af5dd79e13a38d84438b850a2e8858ec21284 | refs/heads/master | 1,624,350,366,310 | 1,615,563,062,000 | 1,615,563,062,000 | 162,666,963 | 0 | 0 | Apache-2.0 | 1,545,367,651,000 | 1,545,367,651,000 | null | UTF-8 | Lean | false | false | 3,741 | lean | /-
Copyright (c) 2020 Riccardo Brasca. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Riccardo Brasca
-/
import ring_theory.polynomial.cyclotomic
import topology.algebra.polynomial
import field_theory.finite.basic
/-!
# Primes congruent to one
We prove that, for any ... |
9675f0f6b2f8d7b983d8ea31683c651b2e7ace6b | c777c32c8e484e195053731103c5e52af26a25d1 | /src/analysis/calculus/local_extr.lean | ef494a5da1bcb7e1759675feda0b93aa727e4c36 | [
"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 | 20,675 | lean | /-
Copyright (c) 2019 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import analysis.calculus.deriv
import topology.algebra.order.extend_from
import topology.algebra.polynomial
/-!
# Local extrema of smooth functions
## Main defini... |
a7405198241f4fc61ec4b655525bcdd51a7c3cd1 | 2c41ae31b2b771ad5646ad880201393f5269a7f0 | /Lean/Qualities/Satisfactory.lean | 83d312e351940cb2b6ecec408a20683f46a0bef3 | [] | no_license | kevinsullivan/Boehm | 926f25bc6f1a8b6bd47d333d936fdfc278228312 | 55208395bff20d48a598b7fa33a4d55a2447a9cf | refs/heads/master | 1,586,127,134,302 | 1,488,252,326,000 | 1,488,252,326,000 | 32,836,930 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 479 | lean | import SystemModel.System
import Qualities.Affordable
import Qualities.Resilient
/- Satisfactory -/
/-
An instance of type [SystemType] is satisfactory if, and only if,
it is both [Affordable] and [Resilient]. These
system qualities are themselves composites of lower-level system
qualities, as detailed in their res... |
4c6509114fa603c4ed5e029280106405e9787f24 | 1a61aba1b67cddccce19532a9596efe44be4285f | /hott/init/bool.hlean | 545183412e98d40e6073c25cbcd30eaa7c6f35c6 | [
"Apache-2.0"
] | permissive | eigengrau/lean | 07986a0f2548688c13ba36231f6cdbee82abf4c6 | f8a773be1112015e2d232661ce616d23f12874d0 | refs/heads/master | 1,610,939,198,566 | 1,441,352,386,000 | 1,441,352,494,000 | 41,903,576 | 0 | 0 | null | 1,441,352,210,000 | 1,441,352,210,000 | null | UTF-8 | Lean | false | false | 675 | hlean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.reserved_notation
-- this is not in init.types, because that file depends on init.num,
-- which depends on these definitions
namespace... |
2d3752b995c7aac6a526db27583ddb4d7f8327a1 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tmp/new-frontend/parser/module.lean | 2ced51fdb3d39a25c11232a8da4c21f75cb6b6de | [
"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 | 4,934 | lean | /-
Copyright (c) 2018 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Sebastian Ullrich
Module-Level parsers
-/
prelude
import init.lean.parser.command
namespace Lean
namespace Parser
open Combinators MonadParsec
open Parser.HasTokens Parser.Has... |
151ca6d448598827ec6615371f4470b6b83414d4 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/group_theory/complement.lean | b8529e315df560fc9b0a6cc7ef2d63fb422d1a08 | [
"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 | 16,264 | lean | /-
Copyright (c) 2021 Thomas Browning. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Thomas Browning
-/
import group_theory.group_action
import group_theory.order_of_element
import group_theory.quotient_group
/-!
# Complements
In this file we define the complement ... |
ebfe9587b2c96ab1613c6b68450fc233b758038a | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/server/edits.lean | 377e2306a2056b72e59a22109c853dcb0f0ac70f | [
"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,140 | lean | import Lean.Data.Lsp
open IO Lean Lsp
def main : IO Unit := do
Ipc.runWith (←IO.appPath) #["--server"] do
let hIn ← Ipc.stdin
hIn.write (←FS.readBinFile "init_vscode_1_47_2.log")
hIn.flush
discard $ Ipc.readResponseAs 0 InitializeResult
Ipc.writeNotification ⟨"initialized", InitializedParams.mk⟩
... |
4726bf028fdaa65ce6b5cc2e230ca2dd4f465ca0 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/analysis/calculus/local_extr.lean | c1a923bfcbf29056371f51087dbe93ccdde1f03c | [
"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 | 14,847 | lean | /-
Copyright (c) 2019 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import topology.local_extr analysis.calculus.deriv
/-! # Local extrema of smooth functions
## Main definitions
In a real normed space `E` we define `pos_tangent... |
781c024520c5339273e5affd1ee33604b907ab1a | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/simp_out_params_ready.lean | 7aee9029e9fc838ce136948a83e4c6325131147e | [
"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 | 854 | lean | prelude
import init.data.int.basic
import init.meta.interactive
namespace in_param
class A (α β : Type) -- no out_param!
instance inst : A ℕ ℤ := ⟨⟩
def p (_ : Type) : Prop := false
@[simp] lemma l {α β} [A α β] : p α ↔ p β := iff.rfl
-- `simp` should fail to apply `l` here since the `β` parameter to `l` can't be in... |
8aa39338e7a2d2c9827c68b689668f57c7d8f70d | 94e33a31faa76775069b071adea97e86e218a8ee | /src/measure_theory/integral/bochner.lean | 504473b3158e3ba8628634c12207f1a60d6fe6c3 | [
"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 | 72,279 | 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, Sébastien Gouëzel, Rémy Degenne
-/
import measure_theory.integral.set_to_l1
import analysis.normed_space.bounded_linear_maps
import topology.sequences
/... |
aa516bae99cd1289a16660303683673408ff0927 | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /src/topology/algebra/ordered.lean | abbcc1c732f984ebd1e98c1cdb7671aeefe5453c | [
"Apache-2.0"
] | permissive | kmill/mathlib | ea5a007b67ae4e9e18dd50d31d8aa60f650425ee | 1a419a9fea7b959317eddd556e1bb9639f4dcc05 | refs/heads/master | 1,668,578,197,719 | 1,593,629,163,000 | 1,593,629,163,000 | 276,482,939 | 0 | 0 | null | 1,593,637,960,000 | 1,593,637,959,000 | null | UTF-8 | Lean | false | false | 91,380 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro, Yury Kudryashov
-/
import tactic.tfae
import order.liminf_limsup
import data.set.intervals
import topology.algebra.group
/-!
# Theory of topology on or... |
569dcd1184bcb263e6662f454ca74c9ce66fa25b | 5df84495ec6c281df6d26411cc20aac5c941e745 | /src/formal_ml/with_density_compose_eq_multiply_alone.lean | cb9a72fed13726dd79e822cffb6edde16d54a4ba | [
"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 | 1,904 | lean | import measure_theory.measurable_space
import measure_theory.integration
import measure_theory.borel_space
namespace measure_theory
namespace with_density
lemma compose_eq_multiply {Ω:Type*} [M:measurable_space Ω] (μ:measure_theory.measure Ω) (f g:Ω → ennreal) (H1:measurable f) (H2:measurable g):
∫⁻ a, g a ∂(μ.with_... |
f06f2d25b664cd8f472c9e788e049609c923fddf | ce89339993655da64b6ccb555c837ce6c10f9ef4 | /bluejam/topprover/02.lean | 4c2d09ca854c4ce352401f3a01db129b0565d855 | [] | no_license | zeptometer/LearnLean | ef32dc36a22119f18d843f548d0bb42f907bff5d | bb84d5dbe521127ba134d4dbf9559b294a80b9f7 | refs/heads/master | 1,625,710,824,322 | 1,601,382,570,000 | 1,601,382,570,000 | 195,228,870 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 62 | lean | example : ∀ (n m : ℕ), n + m = m + n :=
by exact add_comm
|
303184460bc7e3e0006c18f1885f074943838b61 | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/logic/basic.lean | faa9c7c9dadf40a57006e67cd3a5e9f1a33ba1e1 | [
"Apache-2.0"
] | permissive | waynemunro/mathlib | e3fd4ff49f4cb43d4a8ded59d17be407bc5ee552 | 065a70810b5480d584033f7bbf8e0409480c2118 | refs/heads/master | 1,693,417,182,397 | 1,634,644,781,000 | 1,634,644,781,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 61,007 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura
-/
import tactic.doc_commands
import tactic.reserved_notation
/-!
# Basic logic properties
This file is one of the earliest imports in mathlib.
## Im... |
19023fbd34e6aa8bf42a42a5ac7684c4fdbc052b | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /library/data/empty.lean | 29e4b2e07e9cfdfbf849654f2b256944efa23689 | [
"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 | 1,377 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad, Floris van Doorn
-/
import logic.cast
namespace empty
protected definition elim (A : Type) : empty → A :=
empty.rec (λe, A)
attribute [instance]
protecte... |
4d63458354ea3619e74a8d3cbbf8520e5b0bc30d | 4b846d8dabdc64e7ea03552bad8f7fa74763fc67 | /library/init/cc_lemmas.lean | 56f3ca3edfaee03a2f33369c1f86531c28e3eff8 | [
"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 | 4,675 | 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.propext init.classical
/- Lemmas use by the congruence closure module -/
lemma iff_eq_of_eq_true_left {a b : Prop} (h : a = true) : (a... |
9ccb5152ee016ecfbdcc38021fab065d6eed53cd | aa5a655c05e5359a70646b7154e7cac59f0b4132 | /src/Lean/Elab/Term.lean | cc414fa61f019ec74d1f4c93ef696555bcc86229 | [
"Apache-2.0"
] | permissive | lambdaxymox/lean4 | ae943c960a42247e06eff25c35338268d07454cb | 278d47c77270664ef29715faab467feac8a0f446 | refs/heads/master | 1,677,891,867,340 | 1,612,500,005,000 | 1,612,500,005,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 62,899 | 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.ResolveName
import Lean.Util.Sorry
import Lean.Structure
import Lean.Meta.ExprDefEq
import Lean.Meta.AppBuilder
import Lean.Meta.SynthInstance
i... |
3713d4eef9489c19f644017cc251076139099c29 | 556aeb81a103e9e0ac4e1fe0ce1bc6e6161c3c5e | /src/starkware/cairo/common/cairo_secp/verification/verification/signature_recover_public_key_compute_doubling_slope_soundness.lean | 9f33ee517616c34196d07c76b50fb26c292be007 | [] | 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 | 11,877 | lean | /-
File: signature_recover_public_key_compute_doubling_slope_soundness.lean
Autogenerated file.
-/
import starkware.cairo.lean.semantics.soundness.hoare
import .signature_recover_public_key_code
import ..signature_recover_public_key_spec
import .signature_recover_public_key_verify_zero_soundness
import .signature_reco... |
b58da8b2c9832010afc8e6ef86bae3e29cfb12f2 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/lean/run/reduce3.lean | 5e5bb21cff716dea7e8eb09d7853a5c7b1790229 | [
"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 | 781 | lean | def fact : Nat → Nat
| 0 => 1
| (n+1) => (n+1)*fact n
#check fact 6
#eval fact 10
new_frontend
-- set_option pp.all true
theorem tst1 : 100000000000 + 200000000000 = 300000000000 :=
rfl
theorem tst2 : 100000000000 * 200000000000 = 20000000000000000000000 :=
rfl
theorem tst3 : fact 7 = 5040 :=
rfl
theorem tst4 ... |
44571e28a8407224712ad4edec7885170cc0f092 | 88892181780ff536a81e794003fe058062f06758 | /src/100_theorems/t069.lean | 8b43daec7ec4cedc11f13a83fd2aac498a79fe69 | [] | no_license | AtnNn/lean-sandbox | fe2c44280444e8bb8146ab8ac391c82b480c0a2e | 8c68afbdc09213173aef1be195da7a9a86060a97 | refs/heads/master | 1,623,004,395,876 | 1,579,969,507,000 | 1,579,969,507,000 | 146,666,368 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 388 | lean | import algebra.euclidean_domain
-- Greatest Common Divisor Algorithm
universe u
open euclidean_domain
#check dvd_gcd
theorem t069 {α : Type u} [euclidean_domain α] [decidable_eq α] (a b : α) :
∃ c, c ∣ a ∧ c ∣ b ∧ (∀ x : α, x ∣ a → x ∣ b → x ∣ c)
:= begin
use gcd a b,
rw ← and_assoc,
split,
{ exact gcd_dvd... |
74d04a67b1e99d423bdd809baa20ccb8b145ec67 | cbb817439c51008d66b37ce6b1964fea61434d35 | /theorem-proving-in-lean/src/chap_7.lean | 31d40afa3b9502a02717bbf5a5784b4573f88c3d | [] | no_license | tomhoule/theorem-proving-in-lean-exercises | a07f99d4f6b41ce003e8a0274c7bc46359fa62b2 | 60ccc71b8a6df6924e7cc90aab713b804f78da9f | refs/heads/master | 1,663,582,321,828 | 1,590,352,467,000 | 1,590,352,476,000 | 257,107,936 | 3 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 21,266 | lean |
-- Working through section 7.1
namespace hidden
inductive bool : Type
| ff : bool
| tt : bool
def band (b1 b2 : bool) : bool :=
bool.rec_on b1 bool.ff b2
theorem t_and_f_is_f : band bool.tt bool.ff = bool.ff := rfl
theorem f_and_t_is_f : band bool.ff bool.tt = bool.ff := rfl
theorem... |
e61bde857fcf1f11c96da391c6ce44519a2e3f67 | f083c4ed5d443659f3ed9b43b1ca5bb037ddeb58 | /data/multiset.lean | 1df36218cc6566331e03abc35d54a7a956da77cf | [
"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 | 119,508 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
Multisets.
-/
import logic.function order.boolean_algebra
data.list.basic data.list.perm data.list.sort data.quot data.string
algebra.order_functions algebra.... |
bc81612f647995be49c93edfe37d9ce5db4797ec | 09b3e1beaeff2641ac75019c9f735d79d508071d | /Mathlib/Algebra/Group/Defs.lean | b27feb898ed38e03f8c98493ee78299b6e8df0e1 | [
"Apache-2.0"
] | permissive | abentkamp/mathlib4 | b819079cc46426b3c5c77413504b07541afacc19 | f8294a67548f8f3d1f5913677b070a2ef5bcf120 | refs/heads/master | 1,685,309,252,764 | 1,623,232,534,000 | 1,623,232,534,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 11,012 | lean | import Mathlib.Data.Nat.Basic -- *only* for notation ℕ which should be in a "prelude"
import Mathlib.Tactic.Spread
/-!
# Typeclasses for monoids and groups etc
-/
/-
## Stuff which was in core Lean 3
-- this should also be in a "prelude" -- it is not in mathlib3's algebra.group.defs
-/
class Zero (α : Type u) wh... |
05015a458edb57026cff6eb98e6bc1b16fa471af | 02005f45e00c7ecf2c8ca5db60251bd1e9c860b5 | /src/analysis/normed_space/units.lean | 4d7f4424f827c55e638f165d19a0c1faccb53fbe | [
"Apache-2.0"
] | permissive | anthony2698/mathlib | 03cd69fe5c280b0916f6df2d07c614c8e1efe890 | 407615e05814e98b24b2ff322b14e8e3eb5e5d67 | refs/heads/master | 1,678,792,774,873 | 1,614,371,563,000 | 1,614,371,563,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 11,036 | lean | /-
Copyright (c) 2020 Heather Macbeth. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Heather Macbeth
-/
import analysis.specific_limits
import analysis.asymptotics.asymptotics
/-!
# The group of units of a complete normed ring
This file contains the basic theory for... |
036d0119b2be2f6195401e7d9e85525bf9577913 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/qpf/univariate/basic_auto.lean | c4743f878ceac1d171a712dda7e6e8812a4eddf0 | [] | 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 | 17,390 | lean | /-
Copyright (c) 2018 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.pfunctor.univariate.default
import Mathlib.PostPort
universes u l u_1
namespace Mathli... |
5de1af4bf75e24f8159d74477f62fcf7a36146bb | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/model_theory/language_map.lean | a6a5e85c3d5340d156e4b57366eae6a4e9fc8da7 | [
"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 | 19,747 | lean | /-
Copyright (c) 2021 Aaron Anderson, Jesse Michael Han, Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson, Jesse Michael Han, Floris van Doorn
-/
import model_theory.basic
/-!
# Language Maps
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> ... |
b448e83aa001e5940af8c15bff3db5749ece8606 | 36c7a18fd72e5b57229bd8ba36493daf536a19ce | /tests/lean/run/blast2.lean | 259f07084693061aad53f14b187634f7577dcf49 | [
"Apache-2.0"
] | permissive | YHVHvx/lean | 732bf0fb7a298cd7fe0f15d82f8e248c11db49e9 | 038369533e0136dd395dc252084d3c1853accbf2 | refs/heads/master | 1,610,701,080,210 | 1,449,128,595,000 | 1,449,128,595,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 113 | lean | example (a b : Prop) : forall (Ha : a) (Hb : b), a :=
by blast
example (a b : Prop) : a → b → a :=
by blast
|
0de9507750fd40164db27802dd6955e99c2a5341 | 53618200bef52920c1e974173f78cd378d268f3e | /hott/cubical/square.hlean | a182181f3f9f123b72c1d862f06a07d34e35fa4c | [
"Apache-2.0"
] | permissive | sayantangkhan/lean2 | cc41e61102e0fcc8b65e8501186dcca40b19b22e | 0fc0378969678eec25ea425a426bb48a184a6db0 | refs/heads/master | 1,590,323,112,724 | 1,489,425,932,000 | 1,489,425,932,000 | 84,854,525 | 0 | 0 | null | 1,489,425,509,000 | 1,489,425,509,000 | null | UTF-8 | Lean | false | false | 31,937 | hlean | /-
Copyright (c) 2015 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Jakob von Raumer
Squares in a type
-/
import types.eq
open eq equiv is_equiv sigma
namespace eq
variables {A B : Type} {a a' a'' a₀₀ a₂₀ a₄₀ a₀₂ a₂₂ a₂₄ a₀₄ a₄... |
e9557b5c7282ecbdab41713dd249058b9ad7ce30 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/topology/category/Top/limits/konig.lean | 0548dc673a9b21b8e8179e44baca4611f8bf94b7 | [
"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 | 5,298 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Scott Morrison, Mario Carneiro, Andrew Yang
-/
import topology.category.Top.limits.basic
/-!
# Topological Kőnig's lemma
A topological version of Kőnig's lemma is tha... |
02004847bcedeaf75f2c9aa27e67010e21d3c969 | c213e436cb87414954d055137f2a847a9674d7d2 | /src/analysis/convex.lean | d4b4d698eb66e5e987df3ab4b4016b3cef754ec1 | [
"Apache-2.0"
] | permissive | dsanjen/mathlib | 642d270c3d209cfdfb097c2ddc9dd36c102fae9f | a3844c85c606acca5922408217d55891b760fad6 | refs/heads/master | 1,606,199,308,451 | 1,576,274,676,000 | 1,576,274,676,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 30,765 | lean | /-
Copyright (c) 2019 Alexander Bentkamp. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Alexander Bentkamp
Convex sets and functions on real vector spaces
-/
import analysis.normed_space.basic
import data.complex.basic
import data.set.intervals
import tactic.interac... |
225c2ce2253492c85f88a2a3274c5a9eab6e9d6c | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/etaStruct.lean | ebee4062c87114a1749f4d69bbffb51de1fbf317 | [
"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,973 | lean | example (x : α × β) : x = (x.1, x.2) :=
rfl -- Should work with eta for structures
example (x : Unit) : x = ⟨⟩ :=
rfl -- Should work with eta for structures
structure Equiv (α : Sort u) (β : Sort v) where
toFun : α → β
invFun : β → α
left_inv : ∀ x, invFun (toFun x) = x
right_inv : ∀ x, toFun (invFu... |
2dd0afb6a0e3f140cabba80fff6e5ad7f2f7d12f | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Meta/Tactic/Unfold.lean | 7d99d0861ae1527ad5b90619b8936d636e439cb5 | [
"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,969 | lean | /-
Copyright (c) 2022 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Meta.Eqns
import Lean.Meta.Tactic.Delta
import Lean.Meta.Tactic.Simp.Main
namespace Lean.Meta
private def getSimpUnfoldContext : MetaM Simp.Co... |
45ba731f6fb2368d6c70e46b3520c60793152ba1 | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /tests/lean/bigUnivOffsets.lean | 5b1b186b78f055d03bdc9013e632e474a4276803 | [
"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 | 63 | lean | #check Type 100000000
universes u
#check Type (u + 10000000)
|
01ca1e57d69bcd86805ad69ae46dc84af035315e | 618003631150032a5676f229d13a079ac875ff77 | /src/topology/algebra/open_subgroup.lean | ac6474ec645b865717b038316b4576c7c0eeabec | [
"Apache-2.0"
] | permissive | awainverse/mathlib | 939b68c8486df66cfda64d327ad3d9165248c777 | ea76bd8f3ca0a8bf0a166a06a475b10663dec44a | refs/heads/master | 1,659,592,962,036 | 1,590,987,592,000 | 1,590,987,592,000 | 268,436,019 | 1 | 0 | Apache-2.0 | 1,590,990,500,000 | 1,590,990,500,000 | null | UTF-8 | Lean | false | false | 6,039 | 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 order.filter.lift
import topology.opens
import topology.algebra.ring
section
open topological_space
variables (G : Type*) [group G] [topological_space G]
/-- ... |
fe166e5e78d091d20053da9e5ca3120560cf7f5b | 4727251e0cd73359b15b664c3170e5d754078599 | /src/measure_theory/integral/vitali_caratheodory.lean | aca51ddb1aa9507fdb0882c0a0e2497da830b31e | [
"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 | 29,811 | lean | /-
Copyright (c) 2021 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 measure_theory.measure.regular
import topology.semicontinuous
import measure_theory.integral.bochner
import topology.instances.ereal
/-!
# Vitali-Carat... |
bfbd7e1915608994437edc2869193bafdd0a73d6 | 51241b440c9d9e72556bd50c272c2654f722af28 | /20170116_POPL/backchain/ematch.lean | 4b75afd2db03c8631c0691e9aa2598ee3ad9fa1c | [
"Apache-2.0"
] | permissive | jroesch/presentations | deb419a483a788fa6bf3c5b4949e151186e9ea6d | b64fd2bf65a64faf16c52729cde0436f0d2f2cca | refs/heads/master | 1,610,543,247,969 | 1,484,284,236,000 | 1,484,284,236,000 | 78,833,725 | 0 | 0 | null | 1,484,298,759,000 | 1,484,298,759,000 | null | UTF-8 | Lean | false | false | 1,365 | lean | /- Lean also support E-matching: a heuristic lemma instantiation procedure
that is available in many SMT solver.
Goals such as mk_mem_list can also be discharged using heuristic instantiation. -/
open list tactic
universe variable u
lemma in_tail {α : Type u} {a : α} (b : α) {l : list α} : a ∈ l → a ∈ b... |
4807671616f3776df35d3d8fc61992ff8c6be47a | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /04_Quantifiers_and_Equality.org.23.lean | 7934c9a9f953d8c6b8e38e02db851e4ad5d69cc7 | [] | 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 | 424 | lean | /- page 56 -/
import standard
import data.nat
open nat
definition is_even (a : nat) := ∃ b, a = 2*b
-- BEGIN
theorem even_plus_even {a b : nat} (H1 : is_even a) (H2 : is_even b) :
is_even (a + b) :=
obtain (w1 : nat) (Hw1 : a = 2*w1), from H1,
obtain (w2 : nat) (Hw2 : b = 2*w2), from H2,
exists.intro (w1 + w2)
(calc... |
49ac3266365a50e8c5a2eaf52bd0e9f668a117ce | 206422fb9edabf63def0ed2aa3f489150fb09ccb | /src/topology/order.lean | 6e5cb01877c3b32468c7e188c270ecd3a6bb1314 | [
"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 | 29,337 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro
-/
import topology.tactic
/-!
# Ordering on topologies and (co)induced topologies
Topologies on a fixed type `α` are ordered, by reverse inclusion.
Tha... |
0dea5e74a60c6b0459f5cc1e2f3a5c0e62aca9a7 | f7315930643edc12e76c229a742d5446dad77097 | /library/init/logic.lean | 95c28f0f471cb8936c0a42beaa341724ee11c2b6 | [
"Apache-2.0"
] | permissive | bmalehorn/lean | 8f77b762a76c59afff7b7403f9eb5fc2c3ce70c1 | 53653c352643751c4b62ff63ec5e555f11dae8eb | refs/heads/master | 1,610,945,684,489 | 1,429,681,220,000 | 1,429,681,449,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 16,184 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: init.logic
Authors: Leonardo de Moura, Jeremy Avigad, Floris van Doorn
-/
prelude
import init.datatypes init.reserved_notation
/- implication -/
definition trivial := true.int... |
088b1dbf4fdc9ddc46623e106e8e2b8711f03168 | 94ec458bb9c7783744397f9a68d867bd7a765e18 | /src/construction.lean | 5875bcdbe78ce0b50f9ca8a173d5e3478170418a | [] | no_license | myuon/lean-cate | b8fcfd7965a348155152b3fc7d5041b356721945 | 9e71e61c2a09d64b17ab3145ff6dde564387950a | refs/heads/master | 1,611,236,436,038 | 1,462,408,916,000 | 1,462,408,916,000 | 47,414,605 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,905 | lean | import category
open category functor natrans
open eq eq.ops
open prod
section product
lemma prod_subst {a a' b b' : Type} (H₁ : a = a') (H₂ : b = b')
: (a,b) = (a',b') := H₁ ▸ rfl ⬝ H₂ ▸ rfl
definition prod_category (C D : category) : category := category.mk
((@obj C) × (@obj D))
(λa b, (@hom C (pr₁ ... |
10f38c42594ecf90d0aa4982ddb4caa2d1c405fb | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/elab15.lean | e1cc828aa63abb180c37530b9c3ea9f900784e5c | [
"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 | 311 | lean | open tactic
set_option pp.notation false
universe variables u
#check
λ (A : Type u) (a b c d : A) (H₁ : a = b) (H₂ : c = b) (H₃ : d = c),
have a = c, by do { transitivity, assumption, symmetry, assumption },
show a = d, by do { transitivity, this ← get_local "this", exact this, symmetry, assumption }
|
d2b86b8db4d549c214e6b8daad90dc5e7fe21e2f | ece1fcd81204f318535500cde1f3c6433de98f46 | /src/for_mathlib/mv_polynomial.lean | b9a0cdeeb9cc0904e629b5f6039b1eecec8f28f1 | [
"Apache-2.0"
] | permissive | stjordanis/M4P33 | ab5d90bda269428aee16885dbd33f0d21d7d2f79 | d3b56421fcb03b935d9012e5a5b35e1c1ad0b0b4 | refs/heads/master | 1,607,921,471,294 | 1,579,298,081,000 | 1,579,298,081,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 877 | lean | import data.mv_polynomial
namespace mv_polynomial
theorem eval_one {X : Type*} {R : Type*} [comm_semiring R]
(x : X → R) : eval x 1 = 1 := eval_C _
-- this must be done somewhere else because it's in polynomial namespace
theorem eval_pow {X : Type*} {R : Type*} [comm_semiring R]
(f : mv_polynomial X R) (m : ℕ)... |
9dd1a3ce69ddacdf228987148ad7907027bce423 | 3268ab3a126f0fef71459fbf170dc38efe5d0506 | /colimit/seq_colim.hlean | d1323084181df24410a7eb2032e20d450c4ab66e | [
"Apache-2.0"
] | permissive | soraismus/Spectral | f043fed1a4e02ddfeba531769b2980eb817471f4 | 32512bf47db3a1b932856e7ed7c7830b1fc07ef0 | refs/heads/master | 1,585,628,705,579 | 1,538,609,948,000 | 1,538,609,974,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 40,549 | hlean | /-
Copyright (c) 2015 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Egbert Rijke
-/
import hit.colimit .sequence cubical.squareover types.arrow types.equiv
cubical.pathover2
open eq nat sigma sigma.ops quotient equiv pi is_t... |
e94990b04db4a49f197534203912b872fd5243af | 5756a081670ba9c1d1d3fca7bd47cb4e31beae66 | /PrintAST.lean | ceb68f54f3a566c04b5e9197c647c392df8d9897 | [
"Apache-2.0"
] | permissive | leanprover-community/mathport | 2c9bdc8292168febf59799efdc5451dbf0450d4a | 13051f68064f7638970d39a8fecaede68ffbf9e1 | refs/heads/master | 1,693,841,364,079 | 1,693,813,111,000 | 1,693,813,111,000 | 379,357,010 | 27 | 10 | Apache-2.0 | 1,691,309,132,000 | 1,624,384,521,000 | Lean | UTF-8 | Lean | false | false | 255 | lean | import Mathport.Syntax.Parse
open Mathport
def main (args : List String) : IO Unit := do
for fileName in args do
let (ast3, tacticInvocations) ← parseAST3 fileName
IO.println (repr ast3)
for ti in tacticInvocations do IO.println (repr ti) |
1c496801a27dd41440db3e9e238f196955d955ad | 4727251e0cd73359b15b664c3170e5d754078599 | /src/analysis/normed_space/hahn_banach.lean | 2a49649ee1276525107006ae099dd6b03e85b321 | [
"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 | 6,469 | lean | /-
Copyright (c) 2020 Yury Kudryashov All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov, Heather Macbeth
-/
import analysis.convex.cone
import analysis.normed_space.is_R_or_C
import analysis.normed_space.extend
/-!
# Hahn-Banach theorem
In this file we p... |
68ed8fec61c1f75db7b83b8679643f42f418ed6c | 75db7e3219bba2fbf41bf5b905f34fcb3c6ca3f2 | /hott/types/arrow.hlean | 94397298d9ed9f92dba0c18cf7eb7b7d23cb119d | [
"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 | 5,125 | hlean | /-
Copyright (c) 2014 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Floris van Doorn
Ported from Coq HoTT
Theorems about arrow types (function spaces)
-/
import types.pi
open eq equiv is_equiv funext pi equiv.ops is_trunc unit
namespace pi
vari... |
d7223007cb4e0125fd607d2c50747a786afb69f8 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/data/list/sigma.lean | e3065c48f913199f9150f2fbd9a2659ab97af96e | [
"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 | 25,747 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Sean Leather
-/
import data.list.range
import data.list.perm
/-!
# Utilities for lists of sigmas
This file includes several ways of interacting with `list (sigma β)`,... |
8269e0382e5661771e71d8a067de3fea63ef0715 | 5bf112cf7101c6c6303dc3fd0b3179c860e61e56 | /lean/problems/combinatorics/imo_2018_sl.lean | e05417f6193efe8428002f0d602aede30e4d84cd | [
"Apache-2.0"
] | permissive | fredfeng/formal-encoding | 7ab645f49a553dfad2af03fcb4289e40fc679759 | 024efcf58672ac6b817caa10dfe8cd9708b07f1b | refs/heads/master | 1,597,236,551,123 | 1,568,832,149,000 | 1,568,832,149,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,634 | lean | import background
namespace IMOGrandChallenge
namespace Problems
namespace Combinatorics
def IMO_2018_SL_C1 : Prop :=
-- note: current formulation builds in the symmetry that WLOG `S₁.card = m`
-- better to follow the question's wording more closely?
∀ (n : ℕ), n ≥ 3 →
∃ (S : FiniteSet ℕgt0), S.card = 2 * n ∧... |
4f28e970a1885e80d9d568c306d29d81758d7e26 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/char_zero/defs.lean | b816a3933863221d63392d4788a2f179b387bb29 | [
"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,858 | lean | /-
Copyright (c) 2014 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.int.cast.defs
/-!
# Characteristic zero
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding PR to mathlib4.
A... |
8e9dbd29e8ebc2f4f6223a8784497de4e5c1e5ef | 28be2ab6091504b6ba250b367205fb94d50ab284 | /src/game/world8/level10.lean | 70098c440d5c9f5283e096d4aa5cea605f03daa5 | [
"Apache-2.0"
] | permissive | postmasters/natural_number_game | 87304ac22e5e1c5ac2382d6e523d6914dd67a92d | 38a7adcdfdb18c49c87b37831736c8f15300d821 | refs/heads/master | 1,649,856,819,031 | 1,586,444,676,000 | 1,586,444,676,000 | 255,006,061 | 0 | 0 | Apache-2.0 | 1,586,664,599,000 | 1,586,664,598,000 | null | UTF-8 | Lean | false | false | 1,991 | lean | import game.world8.level9 -- hide
namespace mynat -- hide
/-
# Advanced Addition World
## Level 10: `add_left_eq_zero`
## Important: the definition of `≠`
In Lean, `a ≠ b` is *defined to mean* `(a = b) → false`.
This means that if you see `a ≠ b` you can *literally treat
it as saying* `(a = b) → false`. Computer s... |
cdf5a6c6041022fe8273d9d71b6be228b713ed21 | b2fe74b11b57d362c13326bc5651244f111fa6f4 | /src/algebra/big_operators/basic.lean | f13a117f93c60ef334763b00f1538486e400a3c9 | [
"Apache-2.0"
] | permissive | midfield/mathlib | c4db5fa898b5ac8f2f80ae0d00c95eb6f745f4c7 | 775edc615ecec631d65b6180dbcc7bc26c3abc26 | refs/heads/master | 1,675,330,551,921 | 1,608,304,514,000 | 1,608,304,514,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 49,307 | 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 data.finset.fold
import data.equiv.mul_add
import tactic.abel
/-!
# Big operators
In this file we define products and sums indexed by finite sets (specifica... |
bc2e309ad3c8032bf700b4972e318eb3fed09273 | d4f8579bd5c4a56a88575ff0f1957193d83cf965 | /src/knuth.lean | b7e80b9baadfd748b5cd28399b7c7da66a0d0d75 | [] | no_license | ldct/lean-textbooks | 5b14efc448c6c0ee6b2a89d1c2243c5e343ea88c | 6550da16cd3f4c31145d3eb759a9326740a7dcd6 | refs/heads/master | 1,668,538,459,925 | 1,594,208,495,000 | 1,594,208,495,000 | 271,553,644 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,625 | lean | -- Graham, Knuth, Patashnik
-- Concrete Mathematics
import tactic
import data.real.basic
import data.num.basic
-- Chapter 1
def T_hanoi : ℕ → ℤ
| nat.zero := 0
| (nat.succ x) := (2* T_hanoi x) + 1
example : T_hanoi 10 = 2^10 - 1 :=
begin
repeat { rw T_hanoi },
comp_val
end
example (n : ℕ) : T_hanoi n = 2^n ... |
c4e2ad2e0db159facc878dcddbb1c6834d1c7659 | 0845ae2ca02071debcfd4ac24be871236c01784f | /library/init/control/applicative.lean | fc963e28b74729e89b21d00156287610a4bc4107 | [
"Apache-2.0"
] | permissive | GaloisInc/lean4 | 74c267eb0e900bfaa23df8de86039483ecbd60b7 | 228ddd5fdcd98dd4e9c009f425284e86917938aa | refs/heads/master | 1,643,131,356,301 | 1,562,715,572,000 | 1,562,715,572,000 | 192,390,898 | 0 | 0 | null | 1,560,792,750,000 | 1,560,792,749,000 | null | UTF-8 | Lean | false | false | 1,080 | 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, Sebastian Ullrich
-/
prelude
import init.control.functor
open Function
universes u v
class HasPure (f : Type u → Type v) :=
(pure {} {α : Type u} : α → f α)
... |
d1853f663dc94820ffd6c3aad1cc00f81d3ff0f9 | 08a8ee10652ba4f8592710ceb654b37e951d9082 | /src/hott/prop_trunc.lean | 89e3d5c84504e211841d16ad9ed3146b717326ef | [
"Apache-2.0"
] | permissive | felixwellen/hott3 | e9f299c84d30a782a741c40d38741ec024d391fb | 8ac87a2699ab94c23ea7984b4a5fbd5a7052575c | refs/heads/master | 1,619,972,899,098 | 1,509,047,351,000 | 1,518,040,986,000 | 120,676,559 | 0 | 0 | null | 1,518,040,503,000 | 1,518,040,503,000 | null | UTF-8 | Lean | false | false | 1,967 | lean | /-
Copyright (c) 2015 Jakob von Raumer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jakob von Raumer, Floris van Doorn
Proof of the @[hott] theorem that (is_trunc n A) is a mere proposition
We prove this here to avoid circular dependency of files
We want to use thi... |
a29b01e9d303848dc29ea02431d844de20e4c563 | a7602958ab456501ff85db8cf5553f7bcab201d7 | /Notes/Logic_and_Proof/Chapter9/9.30.lean | feea34b58fadfc9ac8a8983ada68462961e9b9eb | [] | no_license | enlauren/math-logic | 081e2e737c8afb28dbb337968df95ead47321ba0 | 086b6935543d1841f1db92d0e49add1124054c37 | refs/heads/master | 1,594,506,621,950 | 1,558,634,976,000 | 1,558,634,976,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,492 | lean | -- 9.3 Using the existential quantifier
import init.data.nat
open nat
variable U : Type
variables A B : U → Prop
variable y: U
variable h: A(y)
-- ∃-introduction.
example: ∃ x, A x :=
exists.intro y h
-- You can see that we require some free variable |x|, such that some |A x| is
-- true. Then we simply |exists.i... |
bbb41df135f6f2f7f1df50984b843b705eadce65 | 5ee26964f602030578ef0159d46145dd2e357ba5 | /src/for_mathlib/sheaves/presheaf_maps.lean | 188f6e050264d35552b195c7a8ad6fb06d04d868 | [
"Apache-2.0"
] | permissive | fpvandoorn/lean-perfectoid-spaces | 569b4006fdfe491ca8b58dd817bb56138ada761f | 06cec51438b168837fc6e9268945735037fd1db6 | refs/heads/master | 1,590,154,571,918 | 1,557,685,392,000 | 1,557,685,392,000 | 186,363,547 | 0 | 0 | Apache-2.0 | 1,557,730,933,000 | 1,557,730,933,000 | null | UTF-8 | Lean | false | false | 3,182 | lean | /-
Continuous maps and presheaves.
https://stacks.math.columbia.edu/tag/008C
Author: Ramon Fernandez Mir
-/
import for_mathlib.sheaves.opens
import for_mathlib.sheaves.presheaf
universes u v w
open topological_space
variables {α : Type u} [topological_space α]
variables {β : Type v} [topological_space β]
va... |
084b57948f5e9058bc102c0de84b3ed341f7e210 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/structure_instance_bug3.lean | 8c4562a8c65f610616e79a82de3f2185d67e6db2 | [
"Apache-2.0"
] | permissive | GaloisInc/lean | aa1e64d604051e602fcf4610061314b9a37ab8cd | f1ec117a24459b59c6ff9e56a1d09d9e9e60a6c0 | refs/heads/master | 1,592,202,909,807 | 1,504,624,387,000 | 1,504,624,387,000 | 75,319,626 | 2 | 1 | Apache-2.0 | 1,539,290,164,000 | 1,480,616,104,000 | C++ | UTF-8 | Lean | false | false | 25 | lean | example : monad set := {} |
fc002f0bd435cef931a0a368d139525367da2125 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/autobound_and_macroscopes.lean | 60409397cd3b4bc1b0d3ccb088825a146963a645 | [
"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 | 58 | lean | macro "A" : term => `(id x)
theorem test : A = A := sorry
|
ddafb04bbe64372963ad595575896835fc2e24ba | 53618200bef52920c1e974173f78cd378d268f3e | /hott/types/eq.hlean | 2178c2d1ce50adb4270c5c04e31ee276e53af536 | [
"Apache-2.0"
] | permissive | sayantangkhan/lean2 | cc41e61102e0fcc8b65e8501186dcca40b19b22e | 0fc0378969678eec25ea425a426bb48a184a6db0 | refs/heads/master | 1,590,323,112,724 | 1,489,425,932,000 | 1,489,425,932,000 | 84,854,525 | 0 | 0 | null | 1,489,425,509,000 | 1,489,425,509,000 | null | UTF-8 | Lean | false | false | 21,787 | hlean | /-
Copyright (c) 2014 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Floris van Doorn
Partially ported from Coq HoTT
Theorems about path types (identity types)
-/
import types.sigma
open eq sigma sigma.ops equiv is_equiv is_trunc
namespace eq
/- P... |
f306cb6d1382e80d12842a810bdfa02883bdb7ba | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/playground/matchEqs.lean | a4c5186d624bc6c2e8c5ebf0a73cd6b6460f305f | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | EdAyers/lean4 | 57ac632d6b0789cb91fab2170e8c9e40441221bd | 37ba0df5841bde51dbc2329da81ac23d4f6a4de4 | refs/heads/master | 1,676,463,245,298 | 1,660,619,433,000 | 1,660,619,433,000 | 183,433,437 | 1 | 0 | Apache-2.0 | 1,657,612,672,000 | 1,556,196,574,000 | Lean | UTF-8 | Lean | false | false | 1,482 | lean | import Lean
syntax (name := test) "test%" ident : command
open Lean.Elab
open Lean.Elab.Command
@[commandElab test] def elabTest : CommandElab := fun stx => do
let id ← resolveGlobalConstNoOverloadWithInfo stx[1]
liftTermElabM none do
Lean.Meta.Match.mkEquationsFor id
return ()
def f (xs ys : List String) ... |
071763854379d1e8c96e45390646487ce85b7a74 | e030b0259b777fedcdf73dd966f3f1556d392178 | /library/init/category/combinators.lean | c33c6532ac06cf97cc1f121b804087219f418358 | [
"Apache-2.0"
] | permissive | fgdorais/lean | 17b46a095b70b21fa0790ce74876658dc5faca06 | c3b7c54d7cca7aaa25328f0a5660b6b75fe26055 | refs/heads/master | 1,611,523,590,686 | 1,484,412,902,000 | 1,484,412,902,000 | 38,489,734 | 0 | 0 | null | 1,435,923,380,000 | 1,435,923,379,000 | null | UTF-8 | Lean | false | false | 3,191 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
Monad combinators, as in Haskell's Control.Monad.
-/
prelude
import init.category.monad init.data.list.basic
universe variables u v w
namespace monad
/- Remark: ... |
fd1d4a75e3bdcac859b5099b3ef76343f0011c20 | 2fb7334a212c3858db44039b5fa6cd57fd5d1443 | /src/sites.lean | a1d1571d54c1adb4b171e948ae2dbfce24a0e76a | [] | no_license | ImperialCollegeLondon/condensed-sets | 24514be041533b07fd62d337b1d6a5ce2b09c78c | e308291646396003dbed3896e5fbb40cb57c7050 | refs/heads/master | 1,628,397,992,041 | 1,601,549,576,000 | 1,601,549,576,000 | 224,198,323 | 3 | 1 | null | 1,601,549,578,000 | 1,574,774,780,000 | Lean | UTF-8 | Lean | false | false | 9,239 | lean | import category_theory.opposites
import category_theory.limits.shapes.products
import category_theory.limits.shapes.pullbacks
import sieve
namespace category_theory
namespace category_theory.limits
section topologies
universes v u
variables (C : Type u) [category.{v} C]
-- SGA 4 II Def 1.1.
structure grothendieck_t... |
493b5b4fd744a356bc0b1fb213dfc772a4043650 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/category_theory/limits/constructions/filtered.lean | 1836ccd9793c59fc1b518feee2ad8d99e346f826 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 3,556 | lean | /-
Copyright (c) 2022 Markus Himmel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel
-/
import category_theory.limits.constructions.limits_of_products_and_equalizers
import category_theory.limits.opposites
/-!
# Constructing colimits from finite colimits ... |
52709f5c2840538b6cb2f95a90e91a23c4b283cd | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/data/complex/exponential.lean | 0bb684b1894fca49965797e4e91984bf0a943111 | [
"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 | 46,572 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Abhimanyu Pallavi Sudhir
-/
import algebra.archimedean algebra.geom_sum
import data.nat.choose data.complex.basic
import tactic.linarith
local notation `abs'` := _root_.ab... |
a4673eee2452f7161edc76f192cb5a17da6c7277 | e151e9053bfd6d71740066474fc500a087837323 | /src/hott/types/nat/hott.lean | fe1cf8591695007d80cc8eae8060bb36ad42d14c | [
"Apache-2.0"
] | permissive | daniel-carranza/hott3 | 15bac2d90589dbb952ef15e74b2837722491963d | 913811e8a1371d3a5751d7d32ff9dec8aa6815d9 | refs/heads/master | 1,610,091,349,670 | 1,596,222,336,000 | 1,596,222,336,000 | 241,957,822 | 0 | 0 | Apache-2.0 | 1,582,222,839,000 | 1,582,222,838,000 | null | UTF-8 | Lean | false | false | 9,901 | lean | /-
Copyright (c) 2015 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Floris van Doorn
Theorems about the natural numbers specific to HoTT
-/
import .order ..pointed .sub
universes u v w
hott_theory
namespace hott
open nat is_trunc hott.algebra hott.i... |
a3d58bc691440f965ce923712c99e85c41e77075 | aa101d73b1a3173c7ec56de02b96baa8ca64c42e | /src/my_exercises/06_sub_sequences.lean | 1c9d9dfa182959adac2fe42b095dead310ce3349 | [
"Apache-2.0"
] | permissive | gihanmarasingha/tutorials | b554d4d53866c493c4341dc13e914b01444e95a6 | 56617114ef0f9f7b808476faffd11e22e4380918 | refs/heads/master | 1,671,141,758,153 | 1,599,173,318,000 | 1,599,173,318,000 | 282,405,870 | 0 | 0 | Apache-2.0 | 1,595,666,751,000 | 1,595,666,750,000 | null | UTF-8 | Lean | false | false | 6,269 | lean | import tuto_lib
/-
This file continues the elementary study of limits of sequences.
It can be skipped if the previous file was too easy, it won't introduce
any new tactic or trick.
Remember useful lemmas:
abs_le (x y : ℝ) : |x| ≤ y ↔ -y ≤ x ∧ x ≤ y
abs_add (x y : ℝ) : |x + y| ≤ |x| + |y|
abs_sub (x y : ℝ) : |x - y... |
77b03bddb7a0dcd146c52378c9c1940f360f5879 | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/linear_algebra/linear_combination.lean | b0713950dbb8a5c99ac05057b7708ede0b747e0a | [
"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 | 10,134 | 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
The module `lc α β` of linear combinations over `β` (`α` is the scalar ring)
-/
import linear_algebra.basic
noncomputable theory
open classical functio... |
eab69b5e09c72e09466c1b701be7944739dfcfb3 | 28be2ab6091504b6ba250b367205fb94d50ab284 | /src/game/world8/level1.lean | 188671dcaac9d332f007003869b364904d7fcfd0 | [
"Apache-2.0"
] | permissive | postmasters/natural_number_game | 87304ac22e5e1c5ac2382d6e523d6914dd67a92d | 38a7adcdfdb18c49c87b37831736c8f15300d821 | refs/heads/master | 1,649,856,819,031 | 1,586,444,676,000 | 1,586,444,676,000 | 255,006,061 | 0 | 0 | Apache-2.0 | 1,586,664,599,000 | 1,586,664,598,000 | null | UTF-8 | Lean | false | false | 1,848 | lean | import mynat.definition -- hide
import mynat.add -- hide
import game.world2.level6 -- hide
namespace mynat -- hide
/- Axiom : succ_inj {a b : mynat} :
succ(a) = succ(b) → a = b
-/
/-
# Advanced Addition World
## Level 1: `succ_inj`. A function.
Peano's original collection of axioms for the natural numbers contai... |
93457561384de60cfe018c7ac694a0c8aca2942b | 9d2e3d5a2e2342a283affd97eead310c3b528a24 | /src/solutions/thursday/afternoon/category_theory/exercise3.lean | 8a631a12299dd2c623a79068ecdbe350b3beaba0 | [] | 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,142 | lean | import for_mathlib.category_theory -- This imports some simp lemmas that I realised belong in mathlib while writing this exercise.
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)) : ... |
d8f1fa7ba250005c19b7858af50192e6eeed83de | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/order/filter/curry.lean | 49208acf1904c1199adf15ed064fa132338638d0 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 3,779 | lean | /-
Copyright (c) 2022 Kevin H. Wilson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin H. Wilson
-/
import order.filter.prod
/-!
# Curried Filters
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding PR to mathlib4.
This... |
d39c7e5a797bdf85e23ca030b00b7487f2c3ce1a | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/interactive/1525.lean | 11c4a4718b3480cd5c291ba644476050e0326cda | [
"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 | 69 | lean | -- should not produce any server panics
structure Foo where
/--/-/
|
5187db6ff33c5f889f6380da6e09a32269883a08 | 75db7e3219bba2fbf41bf5b905f34fcb3c6ca3f2 | /library/algebra/ring_power.lean | dbf2bf56e2e5178f8b892d024877659c807ad21a | [
"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 | 4,864 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad
Properties of the power operation in various structures, including ordered rings and fields.
-/
import .group_power .ordered_field
open nat
variable {A : Type}
section s... |
bc28ae0c18f11d1a5807286cccee463d8efaf911 | 947b78d97130d56365ae2ec264df196ce769371a | /src/Lean/Syntax.lean | aea9b543b9ecf4a6e7fd61228df3b4dfcfdb34ff | [
"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 | 15,686 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Sebastian Ullrich, Leonardo de Moura
-/
import Lean.Data.Name
import Lean.Data.Format
namespace Lean
namespace SourceInfo
def updateTrailing (info : SourceInfo) (trailing : Opt... |
2a1bd1d98a76381709c68344a8c05044941cf706 | 2eab05920d6eeb06665e1a6df77b3157354316ad | /src/analysis/specific_limits.lean | beba708cba4731a01afd955b757b286aebf8ab95 | [
"Apache-2.0"
] | permissive | ayush1801/mathlib | 78949b9f789f488148142221606bf15c02b960d2 | ce164e28f262acbb3de6281b3b03660a9f744e3c | refs/heads/master | 1,692,886,907,941 | 1,635,270,866,000 | 1,635,270,866,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 47,624 | 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 algebra.geom_sum
import analysis.asymptotics.asymptotics
import order.filter.archimedean
import order.iterate
import topology.instances.ennreal
/-!
# A collec... |
bc2cdde5309da19bc6db0b031cdb0f5218fb9bcd | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/data/multiset/fold.lean | d19fd144d8bae13604e02a00572dec2e00e2f4fb | [
"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 | 3,787 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
-/
import data.multiset.erase_dup
/-!
# The fold operation for a commutative associative operation over a multiset.
-/
namespace multiset
variables {α β : Type*}
/-! #... |
fc87690eaf2d32483d2d95b98c5fb1a8b336bc6a | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch5/ex0607.lean | fca48faf3acb666a2ed20e79e0178c3dc7baf456 | [] | 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 | 210 | lean | universe u
def tuple (α : Type u) (n : ℕ) :=
{ l : list α // list.length l = n }
variables {α : Type u} {n : ℕ}
example (h : n = 0) (t : tuple α n) : tuple α 0 :=
begin
rw h at t,
exact t
end
|
4b42e09ebfd9c6faefb79c985e3049d4bc27c1b8 | efa51dd2edbbbbd6c34bd0ce436415eb405832e7 | /20170116_POPL/assoc/builtin_ac.lean | 0aba69b6a8ff5c9f8316486845cd86b9b23d122a | [
"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 | 813 | lean | /-
Lean has a tactic (cc) that performs congruence closure modulo associativity and commutativity.
However, in this unit, we will not focus on it, but on how to implement our own tactics.
In the remaining files in this unit, we will construct a tactic that "flats" nested applications
of associated operators.
-/
import ... |
22c4b9b2b60a24f80c5f45cc18444c5acfce6d7a | a721fe7446524f18ba361625fc01033d9c8b7a78 | /src/principia/myrat/frac.lean | 751236f0badd511b43f540ad2122d056e65c6f4e | [] | 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 | 6,039 | lean | import ..myint.le
namespace hidden
open myint
open myring
open ordered_myring
open ordered_integral_domain
structure frac :=
-- Numerator
(num : myint)
-- Denominator
(denom : myint)
-- Proof that the denominator is positive
(denom_pos : 0 < denom)
namespace frac
variables {x y z : frac}
theorem num_and_denom_eq ... |
7b246375a0bf56eba0d59d3d1e40f3968d96db7c | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/tactic3.lean | 713fcd092bfca11d045f4c05bcef40641dadfecf | [
"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 | 256 | lean | (* import("tactic.lua") *)
variables p q r : Bool
theorem T1 : p → p /\ q → r → q /\ r /\ p := _.
(* Repeat(OrElse(conj_tac(), conj_hyp_tac(), assumption_tac())) *)
done
-- Display proof term generated by previous tactic
print environment 1 |
6c11c4ca2fa53c4ac93c925e969c2201a02ebb1f | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/category/Module/monoidal/symmetric.lean | 177cae80fa58d23da2f761fd7df51609b262ff82 | [
"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,284 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Buzzard, Scott Morrison, Jakob von Raumer
-/
import category_theory.monoidal.braided
import algebra.category.Module.monoidal.basic
/-!
# The symmetric monoidal structure on `Mod... |
a118cf039ec031fe0522ac63e44c7ea0c3e2cce3 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/tactic/norm_cast.lean | 720e06dfe9f0bb8324cc58c16500e403c380c616 | [
"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 | 26,170 | lean | /-
Copyright (c) 2019 Paul-Nicolas Madelaine. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Paul-Nicolas Madelaine, Robert Y. Lewis
Normalizing casts inside expressions.
-/
import tactic.converter.interactive
import tactic.hint
/-!
# A tactic for normalizing casts i... |
df2fac62a67aad608bddee3c50ba2f482ece7d94 | 9028d228ac200bbefe3a711342514dd4e4458bff | /src/algebra/group/hom.lean | 3dd66e0363a4e6e18a87bc85dc1a292a170d9a08 | [
"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 | 24,110 | lean | /-
Copyright (c) 2018 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Kevin Buzzard, Scott Morrison, Johan Commelin, Chris Hughes,
Johannes Hölzl, Yury Kudryashov
-/
import algebra.group.commute
/-!
# monoid and group homomorphisms
Th... |
62cac2ee647dcec49f2496de8cb11aa906caeda3 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/monoidal/discrete_auto.lean | f876c3f1c5b8dea35e3130990be75ec41180c64b | [] | 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,497 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.category_theory.monoidal.natural_transformation
import Mathlib.category_theory.discrete_cat... |
f61e17466c52c6681ad774ec6f1239e8bc35ea50 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/number_theory/liouville/measure.lean | b8fc7040fa943379aaf9a55be502a14838b4883e | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 6,277 | lean | /-
Copyright (c) 2021 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov
-/
import measure_theory.measure.lebesgue.basic
import number_theory.liouville.residual
import number_theory.liouville.liouville_with
import analysis.p_series
/... |
c945f0ca92e12d18b57482128ea77acb7f77b37e | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/algebra/linear_recurrence.lean | 7ecb0dfd91b71381b3c4d992b7bb1bb557e90a15 | [
"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 | 8,254 | lean | /-
Copyright (c) 2020 Anatole Dedecker. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anatole Dedecker
-/
import data.polynomial.ring_division
import linear_algebra.dimension
import algebra.polynomial.big_operators
/-!
# Linear recurrence
Informally, a "linear recur... |
f680d95f1a86dd2291cd5c61db9db32e30645aba | ba4794a0deca1d2aaa68914cd285d77880907b5c | /src/game/world4/level6.lean | 8d5103f098a9f86602716620bb7cec87bff2695a | [
"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 | 684 | lean | import game.world4.level5 -- hide
namespace mynat -- hide
/-
# Power World
## Level 6: `mul_pow`
You might find the tip at the end of level 9 of Multiplication World
useful in this one. You can go to the main menu and pop back into
Multiplication World and take a look -- you won't lose any of your
proofs. You'll o... |
feb5f50777a6befdb6ad7bee17697667afe5f84b | b9d8165d695e844c92d9d4cdcac7b5ab9efe09f7 | /src/topology/continuous_on.lean | 2bd1ec61d29239ccf1dc02df6fe504b9104cc1ae | [
"Apache-2.0"
] | permissive | spapinistarkware/mathlib | e917d9c44bf85ef51db18e7a11615959f714efc5 | 0a9a1ff463a1f26e27d7c391eb7f6334f0d90383 | refs/heads/master | 1,606,808,129,547 | 1,577,478,369,000 | 1,577,478,369,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 22,965 | lean | /-
Copyright (c) 2019 Reid Barton. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import topology.constructions
/-!
# Neighborhoods and continuity relative to a subset
This file defines relative versions
`nhds_within` of `nhds`
`contin... |
e45ea02a92075056d3152998a5c560870832be52 | e0f9ba56b7fedc16ef8697f6caeef5898b435143 | /src/data/real/cau_seq.lean | 479a1b7ebd2c348601adac3899b5bdddcd71bf19 | [
"Apache-2.0"
] | permissive | anrddh/mathlib | 6a374da53c7e3a35cb0298b0cd67824efef362b4 | a4266a01d2dcb10de19369307c986d038c7bb6a6 | refs/heads/master | 1,656,710,827,909 | 1,589,560,456,000 | 1,589,560,456,000 | 264,271,800 | 0 | 0 | Apache-2.0 | 1,589,568,062,000 | 1,589,568,061,000 | null | UTF-8 | Lean | false | false | 24,816 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import algebra.big_operators
/-!
# Cauchy sequences
A basic theory of Cauchy sequences, used in the construction of the reals and p-adic numbers. Where
applicable, ... |
2a16ae831b5afaf0cd9a4c8ca6823493ee679445 | c09f5945267fd905e23a77be83d9a78580e04a4a | /src/topology/basic.lean | aac6607b9bfc99626a4056e6e7c6731d817e3a5e | [
"Apache-2.0"
] | permissive | OHIHIYA20/mathlib | 023a6df35355b5b6eb931c404f7dd7535dccfa89 | 1ec0a1f49db97d45e8666a3bf33217ff79ca1d87 | refs/heads/master | 1,587,964,529,965 | 1,551,819,319,000 | 1,551,819,319,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 34,552 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro
Theory of topological spaces.
Parts of the formalization is based on the books:
N. Bourbaki: General Topology
I. M. James: Topologies and Uniformit... |
b894140d7b2eeb07ad6ca81888dafa5e29ee6f71 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/order/directed.lean | 0456ab1e72b134068f4c8760ac56912f3d3809d6 | [
"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,915 | 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 data.set.image
import order.lattice
import order.max
/-!
# Directed indexed families and sets
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to thi... |
7a5353c5f835891eb35691537d1211a64ce6949e | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Init/System/IOError.lean | 4e76bb964ee1b046800b53f5da996b104bb0b639 | [
"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 | 8,953 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
-/
prelude
import Init.Core
import Init.Data.UInt.Basic
import Init.Data.ToString.Basic
import Init.Data.String.Basic
/--
Imitate the structure of IOErrorType in H... |
4b6cae453048aaaa52324b141f74f1c2bc6bcb72 | 649957717d58c43b5d8d200da34bf374293fe739 | /src/data/string/defs.lean | 6d13cd954eda146f0302b2b44c3ff335b1f4ebcb | [
"Apache-2.0"
] | permissive | Vtec234/mathlib | b50c7b21edea438df7497e5ed6a45f61527f0370 | fb1848bbbfce46152f58e219dc0712f3289d2b20 | refs/heads/master | 1,592,463,095,113 | 1,562,737,749,000 | 1,562,737,749,000 | 196,202,858 | 0 | 0 | Apache-2.0 | 1,562,762,338,000 | 1,562,762,337,000 | null | UTF-8 | Lean | false | false | 389 | lean | import data.list.defs
namespace string
def map_tokens (c : char) (f : list string → list string) : string → string :=
intercalate (singleton c) ∘ f ∘ split (= c)
def over_list (f : list char → list char) : string → string :=
list.as_string ∘ f ∘ string.to_list
def split_on (c : char) (s : string) : list string :=
(... |
2a2c7ce2d38acf64e184ef9c2ed15f49ec6de585 | 64874bd1010548c7f5a6e3e8902efa63baaff785 | /tests/lean/run/eq22.lean | fae15af6a5c9aefde79d4d349039d6c69f301d82 | [
"Apache-2.0"
] | permissive | tjiaqi/lean | 4634d729795c164664d10d093f3545287c76628f | d0ce4cf62f4246b0600c07e074d86e51f2195e30 | refs/heads/master | 1,622,323,796,480 | 1,422,643,069,000 | 1,422,643,069,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 246 | lean | import data.list
open list
definition head {A : Type} : Π (l : list A), l ≠ nil → A,
head nil h := absurd rfl h,
head (a :: l) _ := a
theorem head_cons {A : Type} (a : A) (l : list A) (h : a :: l ≠ nil) : head (a :: l) h = a :=
rfl
|
6358d1ae2e3321d315c67c3f203c3347da79d39a | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/stxMacro.lean | 6b8259ac7cf92601731b5d251ef3ed9b5d6a0f90 | [
"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 | 305 | lean | -- Macro for the `syntax` category
macro "many " x:stx : stx => `(stx| ($x)*)
syntax "sum! " (many term:max) : term
macro_rules
| `(sum! $xs*) => do
let mut r ← `(0)
for x in xs do
r ← `($r + $x)
return r
#check sum! 1 2 3
#eval sum! 1 2 3
#check sum!
theorem ex : sum! 1 2 3 = 6 :=
rfl
|
e27219eb2431e6cf6a86e271ac1566d538bc4a3a | 1d265c7dd8cb3d0e1d645a19fd6157a2084c3921 | /src/other/emoji_proof.lean | 370c35dbf6775de6c8d9d23f9b4bfeaee713dd00 | [
"MIT"
] | permissive | hanzhi713/lean-proofs | de432372f220d302be09b5ca4227f8986567e4fd | 4d8356a878645b9ba7cb036f87737f3f1e68ede5 | refs/heads/master | 1,585,580,245,658 | 1,553,646,623,000 | 1,553,646,623,000 | 151,342,188 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 1,109 | lean | def and_emoji (a b : Prop) := a ∧ b
def or_emoji (a b : Prop) := a ∨ b
def iff_emoji (a b : Prop) := a ↔ b
def impl_emoji (a b : Prop) := a → b
infix `😂` : 55 := and_emoji
infix `😆` : 45 := iff_emoji
infix `😶` : 55 := or_emoji
infix `😉` : 50 := and.intro
infix `😇` : 40 := iff.intro
notation `🤜` a : 50 := or.inl... |
01c755b42ace2bde059c679feaa984c4f98f4f11 | cf39355caa609c0f33405126beee2739aa3cb77e | /library/init/data/int/default.lean | 931f9d77ce04b3ea4d2fd9ebed05fa104d8e7e0e | [
"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 | 274 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.data.int.basic init.data.int.order init.data.int.comp_lemmas
import init.data.int.bitwise
|
d7da56873ceac39ad68ce16f09e178246771ee24 | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch2/ex0903.lean | ddbd03ea1472d7c9e317e2b08638a8a5fdde1623 | [] | 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 | 485 | lean | namespace hidden
universe u
constant list : Type u → Type u
namespace list
constant cons : Π α : Type u, α → list α → list α
constant nil : Π α : Type u, list α
constant append : Π α : Type u, list α → list α → list α
end list
end hidden
open hidden.list
variable α : Type
variable a : α
variables... |
abd088c7e639a5d4acca9fad61ad781b3ddaaeab | 33340b3a23ca62ef3c8a7f6a2d4e14c07c6d3354 | /lia/main.lean | b2de282f9a95268131d619ec5bfdcb0dc98a7c48 | [] | no_license | lclem/cooper | 79554e72ced343c64fed24b2d892d24bf9447dfe | 812afc6b158821f2e7dac9c91d3b6123c7a19faf | refs/heads/master | 1,607,554,257,488 | 1,578,694,133,000 | 1,578,694,133,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 919 | lean | import ..tactics .reify .normalize .eval_qe .bval
open tactic
meta def lia : tactic unit :=
do reify, normalize, quant_elim,
exact_dec_trivial, -- `[simp only [list.map]],
exact_dec_trivial
axiom any : ∀ {p : Prop}, p
meta def vm_dec_eval : tactic unit :=
do `((qe %%fx).eval _) ← target,
f ← eval_expr for... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.