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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
eb8ac736acff9742dcddb17649643eab2edfeaf2 | 2c096fdfecf64e46ea7bc6ce5521f142b5926864 | /tests/compiler/computedFieldsExtern.lean | 0be4797b8d4bfd0a7ef32292011f6df15ce33348 | [
"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 | Kha/lean4 | 1005785d2c8797ae266a303968848e5f6ce2fe87 | b99e11346948023cd6c29d248cd8f3e3fb3474cf | refs/heads/master | 1,693,355,498,027 | 1,669,080,461,000 | 1,669,113,138,000 | 184,748,176 | 0 | 0 | Apache-2.0 | 1,665,995,520,000 | 1,556,884,930,000 | Lean | UTF-8 | Lean | false | false | 365 | lean | inductive Exp
| var (i : Nat)
| app (a b : Exp)
with
@[computed_field, extern c inline "(lean_ctor_get_uint64(#1, lean_ctor_num_objs(#1)*sizeof(void*)) + 40)"]
hash : Exp → UInt64
| .var i => Hashable.hash i
| .app a b => a.hash + b.hash
def main : IO Unit := do
-- should be 30 + 3*40 = 150
IO.prin... |
5ab758929f07705f8e08c6e4d4bbd8130b5b40f0 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/linear_algebra/quadratic_form/basic.lean | cc81cb334b3c064cf408bdd9d4cae238ab35e4ff | [
"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 | 39,363 | lean | /-
Copyright (c) 2020 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen, Kexing Ying, Eric Wieser
-/
import algebra.invertible
import linear_algebra.matrix.determinant
import linear_algebra.matrix.bilinear_form
/-!
# Quadratic forms
This file d... |
9c13e7944cdb521ba9773c627c6dc0f98e3badfe | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/order/filter/zero_and_bounded_at_filter.lean | 3fec25c7b891b018080cb6be736bd9973bf97f07 | [
"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 | 3,265 | lean | /-
Copyright (c) 2022 Chris Birkbeck. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Birkbeck, David Loeffler
-/
import order.filter
import algebra.module.submodule.basic
import topology.algebra.monoid
import analysis.asymptotics.asymptotics
/-!
# Zero and Boun... |
feee32a599059d11d274d3f12eb4dff84bad34de | c777c32c8e484e195053731103c5e52af26a25d1 | /src/topology/gluing.lean | 6186f6da75bf7e709a8e3aa43191adf65b10289c | [
"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 | 18,618 | lean | /-
Copyright (c) 2021 Andrew Yang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Andrew Yang
-/
import category_theory.glue_data
import category_theory.concrete_category.elementwise
import topology.category.Top.limits.pullbacks
import topology.category.Top.opens
/-!
... |
4e1ccca8b338b59833e45b24499ab54fbb51090a | 432d948a4d3d242fdfb44b81c9e1b1baacd58617 | /src/number_theory/arithmetic_function.lean | f18f69ffe6cb2a7b4a5630a73846793f774ab08d | [
"Apache-2.0"
] | permissive | JLimperg/aesop3 | 306cc6570c556568897ed2e508c8869667252e8a | a4a116f650cc7403428e72bd2e2c4cda300fe03f | refs/heads/master | 1,682,884,916,368 | 1,620,320,033,000 | 1,620,320,033,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 32,429 | lean | /-
Copyright (c) 2020 Aaron Anderson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson
-/
import algebra.big_operators.ring
import number_theory.divisors
import algebra.squarefree
import algebra.invertible
/-!
# Arithmetic Functions and Dirichlet Convolut... |
f0b40b8ebb139bdb484f99fb0e38e7f4b3f73314 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/tactic/unify_equations.lean | d3363eb4576391c1ed961235d70b0d8b20748e15 | [
"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 | 14,582 | lean | /-
Copyright (c) 2020 Jannis Limperg. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jannis Limperg
-/
import tactic.core
/-!
# The `unify_equations` tactic
This module defines `unify_equations`, a first-order unification tactic that
unifies one or more equations in ... |
b65666bb0a9b683c3bdb46716cfb50c4484a2033 | ff5230333a701471f46c57e8c115a073ebaaa448 | /tests/lean/case.lean | f96715e88ee6cb337c351470f216164cf0449128 | [
"Apache-2.0"
] | permissive | stanford-cs242/lean | f81721d2b5d00bc175f2e58c57b710d465e6c858 | 7bd861261f4a37326dcf8d7a17f1f1f330e4548c | refs/heads/master | 1,600,957,431,849 | 1,576,465,093,000 | 1,576,465,093,000 | 225,779,423 | 0 | 3 | Apache-2.0 | 1,575,433,936,000 | 1,575,433,935,000 | null | UTF-8 | Lean | false | false | 502 | lean | example (xs : list ℕ) : ℕ :=
begin
induction xs,
case list.cons {}
end
example (xs : list ℕ) : ℕ :=
begin
cases xs,
case list.cons {}
end
example (xs : list ℕ) : ℕ :=
begin
induction xs,
case list.cons : x xs {
cases xs,
case list.cons : x xs {}
}
end
open list
example (xs : list ℕ) : ℕ :=
begi... |
c36a25dc3489b7895e0c588eae7babe6e60407fe | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/simplifier9.lean | 90f1d84bcdad241f4e56ba2a17047b9c2ed14ba3 | [
"Apache-2.0"
] | permissive | soonhokong/lean | cb8aa01055ffe2af0fb99a16b4cda8463b882cd1 | 38607e3eb57f57f77c0ac114ad169e9e4262e24f | refs/heads/master | 1,611,187,284,081 | 1,450,766,737,000 | 1,476,122,547,000 | 11,513,992 | 2 | 0 | null | 1,401,763,102,000 | 1,374,182,235,000 | C++ | UTF-8 | Lean | false | false | 1,038 | lean | -- Rewriting with (tmp)-local hypotheses
import logic.quantifiers
attribute imp_congr [congr]
attribute forall_congr [congr]
universe l
constants (T : Type.{l}) (P Q : T → Prop)
set_option simplify.max_steps 50000
constants (x y : T)
#simplify iff env 0 x = y → x = y
#simplify iff env 0 T → x = y → x = y
#simplif... |
bc5be513e013b4bc0e14fb09fa781289a0c32428 | 9028d228ac200bbefe3a711342514dd4e4458bff | /src/topology/metric_space/basic.lean | 880c485956e78a69de3d9e4bc71493bfbb1ee816 | [
"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 | 75,200 | lean | /-
Copyright (c) 2015, 2017 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Metric spaces.
Authors: Jeremy Avigad, Robert Y. Lewis, Johannes Hölzl, Mario Carneiro, Sébastien Gouëzel
Many definitions and theorems expected on metric spaces are already introduced o... |
e28a7ef0b89de829830ca75b0b0c33f01bc1fdf2 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/run/type_equations.lean | 6e3e0b80b8df36417113c4efb5c36db704d16ff1 | [
"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 | 855 | lean | open nat
inductive Expr
| zero : Expr
| one : Expr
| add : Expr → Expr → Expr
namespace Expr
inductive direct_subterm : Expr → Expr → Prop
| add_1 : ∀ e₁ e₂ : Expr, direct_subterm e₁ (add e₁ e₂)
| add_2 : ∀ e₁ e₂ : Expr, direct_subterm e₂ (add e₁ e₂)
theorem direct_subterm_wf : well_founded direct_subterm :=
sorr... |
e6798903deffbab8c7888b12b7fa9dd4b033798c | 12dabd587ce2621d9a4eff9f16e354d02e206c8e | /world01/level02.lean | cec993e7e9d9f62ebbdb0c692a8725e99e6fcdd4 | [] | no_license | abdelq/natural-number-game | a1b5b8f1d52625a7addcefc97c966d3f06a48263 | bbddadc6d2e78ece2e9acd40fa7702ecc2db75c2 | refs/heads/master | 1,668,606,478,691 | 1,594,175,058,000 | 1,594,175,058,000 | 278,673,209 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 151 | lean | import mynat.definition
import mynat.add
import mynat.mul
lemma example2 (x y : mynat) (h : y = x + 7) : 2 * y = 2 * (x + 7) :=
begin
rw h,
refl,
end
|
f81c501bbf14472c12d9287e6a9e3fcec03cf196 | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /stage0/src/Lean/Meta/Tactic/Simp/Main.lean | 4b77edc2baf225245702e819640c02fae77d5d9a | [
"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 | 14,736 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Meta.Transform
import Lean.Meta.Tactic.Replace
import Lean.Meta.Tactic.Util
import Lean.Meta.Tactic.Clear
import Lean.Meta.Tactic.Simp.Types
imp... |
f4b70d846698d4759e2b4fc2edc158f66bcd90db | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/tactic/linarith/verification_auto.lean | 15e3a81f4eda4a9185cda610e595e8ec134a0fe2 | [] | 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 | 905 | lean | /-
Copyright (c) 2020 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.tactic.linarith.elimination
import Mathlib.tactic.linarith.parsing
import Mathlib.PostPor... |
69d801278f1a0fcf51a8ba5e23332fafa912249f | 94e33a31faa76775069b071adea97e86e218a8ee | /src/probability/integration.lean | d91f922d314fee5da36e5773a226a972c0009781 | [
"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 | 13,645 | lean | /-
Copyright (c) 2021 Martin Zinkevich. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Martin Zinkevich, Vincent Beffara
-/
import measure_theory.integral.set_integral
import probability.independence
/-!
# Integration in Probability Theory
Integration results for ind... |
bb72918673d67cdde877a4d8c081bd2e5663a90a | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/data/finset/locally_finite.lean | cc747739879f42e36826dfdf91ed427c40f6f003 | [
"Apache-2.0"
] | permissive | AntoineChambert-Loir/mathlib | 64aabb896129885f12296a799818061bc90da1ff | 07be904260ab6e36a5769680b6012f03a4727134 | refs/heads/master | 1,693,187,631,771 | 1,636,719,886,000 | 1,636,719,886,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 13,107 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Yaël Dillies
-/
import order.locally_finite
/-!
# Intervals as finsets
This file provides basic results about all the `finset.Ixx`, which are defined in
`order.locall... |
64bd7ed453f9146dc15698179ab26a16022870bd | 30b012bb72d640ec30c8fdd4c45fdfa67beb012c | /data/real/ennreal.lean | d10d0f064a03676df6678eceeda4919ea5450dd4 | [
"Apache-2.0"
] | permissive | kckennylau/mathlib | 21fb810b701b10d6606d9002a4004f7672262e83 | 47b3477e20ffb5a06588dd3abb01fe0fe3205646 | refs/heads/master | 1,634,976,409,281 | 1,542,042,832,000 | 1,542,319,733,000 | 109,560,458 | 0 | 0 | Apache-2.0 | 1,542,369,208,000 | 1,509,867,494,000 | Lean | UTF-8 | Lean | false | false | 19,068 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Johannes Hölzl
Extended non-negative reals
-/
import data.real.nnreal order.bounds tactic.norm_num
noncomputable theory
open classical set lattice
local attribute [instance] prop_deci... |
1f68a54cd9e94f6311047937186c34943648f497 | 3dd1b66af77106badae6edb1c4dea91a146ead30 | /tests/lean/run/tactic19.lean | 27ac93d44d2f17f9efaa6651c0b5775c77eeaa03 | [
"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 | 206 | lean | import standard
using tactic
theorem tst {A : Type} {f : A → A → A} {a b c : A} (H1 : a = b) (H2 : b = c) : f a b = f b c
:= by apply congr;
apply (subst H2);
apply refl;
assumption
|
ce6832df72da4de7bf995291b2ddecac6610e638 | d6124c8dbe5661dcc5b8c9da0a56fbf1f0480ad6 | /test/run/ir/instructionRefs.lean | 35d05f0a26c349ea545188736c61d36dfd76cbea | [
"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 | 4,886 | lean | import Papyrus
open Papyrus
def assertEq [Repr α] [DecidableEq α]
(expected actual : α) : IO (PLift (expected = actual)) := do
if h : expected = actual then return PLift.up h else
throw <| IO.userError s!"expected '{repr expected}', got '{repr actual}'"
def assertBEq [Repr α] [BEq α] (expected actual : α) : IO... |
e058132252bdf12df9b95b232e9a98f8a3ecee51 | fffbc47930dc6615e66ece42324ce57a21d5b64b | /src/set_theory/ordinal.lean | d82d5528e8bc5f7b39f237568b931c26b344cf6f | [
"Apache-2.0"
] | permissive | skbaek/mathlib | 3caae8ae413c66862293a95fd2fbada3647b1228 | f25340175631cdc85ad768a262433f968d0d6450 | refs/heads/master | 1,588,130,123,636 | 1,558,287,609,000 | 1,558,287,609,000 | 160,935,713 | 0 | 0 | Apache-2.0 | 1,544,271,146,000 | 1,544,271,146,000 | null | UTF-8 | Lean | false | false | 133,566 | 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... |
b9a775d60257f09c12e2a872ef40e5d1cd6aee01 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/algebra/ring/prod.lean | 894e8bc5fa37e9f20cd4c6783568a240b665af97 | [
"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 | 9,788 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Chris Hughes, Mario Carneiro, Yury Kudryashov
-/
import algebra.group.prod
import algebra.ring.basic
import algebra.ring.equiv
/-!
# Semiring, ring etc structures on ... |
e7498fbe92ba232e848c3c63d4a6291cea5829da | 4727251e0cd73359b15b664c3170e5d754078599 | /src/ring_theory/hahn_series.lean | 12ff6706e3b274702beca48b17d1cb9fbbafb549 | [
"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 | 62,189 | lean | /-
Copyright (c) 2021 Aaron Anderson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson
-/
import order.well_founded_set
import algebra.big_operators.finprod
import ring_theory.valuation.basic
import algebra.module.pi
import ring_theory.power_series.basic
i... |
1b859dd6e80dd3a6935fc9d0b6962b492f15081c | fe84e287c662151bb313504482b218a503b972f3 | /src/combinatorics/simplicial.lean | 336dfa149df474cb059ec13807acc9ddb398916a | [] | 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,326 | lean | /-
Copyright (c) 2019 Neil Strickland. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Neil Strickland
-/
import data.nat.choose data.fintype.basic
import data.fin_extra
import tactic.squeeze tactic.linarith
namespace simplicial
namespace infinite
def δ (i j : ℕ) ... |
920d7005cbbf025fa2700f81ce1273d3e0712fa8 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/analysis/inner_product_space/conformal_linear_map.lean | a62d2e97b02e06a49dc834f58bd1133500474fc6 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 1,940 | lean | /-
Copyright (c) 2021 Yourong Zang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yourong Zang
-/
import analysis.normed_space.conformal_linear_map
import analysis.inner_product_space.basic
/-!
# Conformal maps between inner product spaces
> THIS FILE IS SYNCHRONIZE... |
a2a4d3ecb1c127b827db8b8fd35cbcb40a704d96 | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/algebra/ordered_ring.lean | 700ee2c9b41947fcf598bc784796b1652e5fe825 | [
"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 | 42,991 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Mario Carneiro
-/
import algebra.ordered_group
set_option default_priority 100 -- see Note [default priority]
set_option old_structure_cmd true
unive... |
2bc598015e94aa63f59ca4d13a3cbd0182cd6d8f | f5f7e6fae601a5fe3cac7cc3ed353ed781d62419 | /src/tactic/chain.lean | 8fd723ca1ee55dbdb284cd7a631568cfc78c4a6d | [
"Apache-2.0"
] | permissive | EdAyers/mathlib | 9ecfb2f14bd6caad748b64c9c131befbff0fb4e0 | ca5d4c1f16f9c451cf7170b10105d0051db79e1b | refs/heads/master | 1,626,189,395,845 | 1,555,284,396,000 | 1,555,284,396,000 | 144,004,030 | 0 | 0 | Apache-2.0 | 1,533,727,664,000 | 1,533,727,663,000 | null | UTF-8 | Lean | false | false | 4,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, Mario Carneiro
import tactic
import data.option.defs
open interactive
namespace tactic
/-
This file defines a `chain` tactic, which takes a list of tactics, a... |
2ecc685c2a4404b20ad5edd6d14e49290e2e2b6f | 618003631150032a5676f229d13a079ac875ff77 | /src/category_theory/concrete_category/basic.lean | 08712e5005b3d3dfc6949dc0a5a3d4f8affd1d28 | [
"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,584 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Johannes Hölzl, Reid Barton, Sean Leather, Yury Kudryashov
-/
import category_theory.types
import category_theory.full_subcategory
/-!
# Concrete categories
A concret... |
66385136e110e7f05d17a6edda62537a2d32819a | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /tests/lean/match3.lean | 142973ad80e3058d00ce64e69ee82d287543a039 | [
"Apache-2.0"
] | permissive | williamdemeo/lean4 | 72161c58fe65c3ad955d6a3050bb7d37c04c0d54 | 6d00fcf1d6d873e195f9220c668ef9c58e9c4a35 | refs/heads/master | 1,678,305,356,877 | 1,614,708,995,000 | 1,614,708,995,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,013 | lean |
def f (x : Nat) : Nat :=
match x with
| 30 => 31
| y+1 => y
| 0 => 10
#eval f 20
#eval f 0
#eval f 30
universes u
theorem ex1 {α : Sort u} {a b : α} (h : a ≅ b) : a = b :=
match α, a, b, h with
| _, _, _, HEq.refl _ => rfl
theorem ex2 {α : Sort u} {a b : α} (h : a ≅ b) : a = b :=
match a, b, h with
| _, _, HEq... |
d173425c9b0ce359f804c5f674d326f77097b77e | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/topology/sober.lean | 853321809143afcd189c954cf1d87775d3b9beb9 | [
"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 | 9,292 | lean | /-
Copyright (c) 2021 Andrew Yang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Andrew Yang
-/
import topology.separation
/-!
# Sober spaces
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding PR to mathlib4.
A quasi-sober... |
646cdf426d435e3aa6416646f87bb93bb9a54518 | 9028d228ac200bbefe3a711342514dd4e4458bff | /src/topology/extend_from_subset.lean | 2fcc91129e6de6079b4b15a29bdac3965759b1aa | [
"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 | 4,120 | lean | /-
Copyright (c) 2020 Anatole Dedecker. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Anatole Dedecker
-/
import topology.separation
/-!
# Extending a function from a subset
The main definition of this file is `extend_from A f` where `f : X → Y`
and ... |
6baa879e62073523d1542c80310149c90d9eecff | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /src/Lean/Server.lean | 89fc2abaff78c0ea85c0c5cc4602f71aa25263ff | [
"Apache-2.0"
] | permissive | williamdemeo/lean4 | 72161c58fe65c3ad955d6a3050bb7d37c04c0d54 | 6d00fcf1d6d873e195f9220c668ef9c58e9c4a35 | refs/heads/master | 1,678,305,356,877 | 1,614,708,995,000 | 1,614,708,995,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 342 | lean | /-
Copyright (c) 2020 Marc Huisinga. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Marc Huisinga, Wojciech Nawrocki
-/
import Lean.Server.Utils
import Lean.Server.AsyncList
import Lean.Server.Snapshots
import Lean.Server.FileSource
import Lean.Server.Watchdog
import ... |
4ecf3150064d9d8de60ab5467896b7318b9e3993 | 785b41b0993f39cbfa9b02fe0940ce3f2f51a57d | /conf/n1.lean | db60fac3142696f63832702dd0f33df01db23f8c | [
"MIT"
] | permissive | loso3000/OpenWrt-DIY-1 | 75b0d70314d703203508218a29acefc3b914d32d | 5858be81ee44199908cbaa1a752b17505c9834e8 | refs/heads/main | 1,690,532,461,283 | 1,631,008,241,000 | 1,631,008,241,000 | 354,817,508 | 1 | 0 | MIT | 1,617,623,493,000 | 1,617,623,492,000 | null | UTF-8 | Lean | false | false | 12,561 | lean | # Build Firmware:
CONFIG_TARGET_armvirt=y
CONFIG_TARGET_armvirt_64=y
CONFIG_TARGET_armvirt_64_Default=y
CONFIG_aarch64=y
CONFIG_ARCH="aarch64"
# 不压缩efi 不用ntfs分区
# CONFIG_TARGET_IMAGES_GZIP is not set
# CONFIG_VMDK_IMAGES is not set
# CONFIG_PACKAGE_kmod-fs-ntfs is not set
# ipv6
CONFIG_PACKAGE_ipv6helper... |
18b613fe625f316cbf014f1f7228b960e6e00d75 | 3f7026ea8bef0825ca0339a275c03b911baef64d | /src/category_theory/limits/shapes/finite_limits.lean | dc0d211d896e630d010918e5014b6c6763cbd522 | [
"Apache-2.0"
] | permissive | rspencer01/mathlib | b1e3afa5c121362ef0881012cc116513ab09f18c | c7d36292c6b9234dc40143c16288932ae38fdc12 | refs/heads/master | 1,595,010,346,708 | 1,567,511,503,000 | 1,567,511,503,000 | 206,071,681 | 0 | 0 | Apache-2.0 | 1,567,513,643,000 | 1,567,513,643,000 | null | UTF-8 | Lean | false | false | 1,050 | 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 category_theory.limits.shapes.products
import category_theory.discrete_category
import data.fintype
universes v u
open category_theory
namespace category_the... |
0e09c1b8c6d9ba42edbdad39004063dfd72c143b | 2a70b774d16dbdf5a533432ee0ebab6838df0948 | /_target/deps/mathlib/src/ring_theory/ideal/operations.lean | 78b9afacfea79afe3222397a64bbe3ad87e9fb9d | [
"Apache-2.0"
] | permissive | hjvromen/lewis | 40b035973df7c77ebf927afab7878c76d05ff758 | 105b675f73630f028ad5d890897a51b3c1146fb0 | refs/heads/master | 1,677,944,636,343 | 1,676,555,301,000 | 1,676,555,301,000 | 327,553,599 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 55,882 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import data.nat.choose.sum
import data.equiv.ring
import algebra.algebra.operations
import ring_theory.ideal.basic
/-!
# More operations on modules and ideals
-/
universes u v ... |
2641e91811fffe79896df5df7516eff4bda47a08 | e9078bde91465351e1b354b353c9f9d8b8a9c8c2 | /prop_trunc2.hlean | 9921222841a6ebb43d95b3f7eccf3a7de252dc80 | [
"Apache-2.0"
] | permissive | EgbertRijke/leansnippets | 09fb7a9813477471532fbdd50c99be8d8fe3e6c4 | 1d9a7059784c92c0281fcc7ce66ac7b3619c8661 | refs/heads/master | 1,610,743,957,626 | 1,442,532,603,000 | 1,442,532,603,000 | 41,563,379 | 0 | 0 | null | 1,440,787,514,000 | 1,440,787,514,000 | null | UTF-8 | Lean | false | false | 1,780 | hlean | -- more things related to the propositional truncation file
import .propositional_truncation cubical.squareover
open one_step_tr equiv eq sigma
definition one_step_tr_up (A B : Type)
: (one_step_tr A → B) ≃ Σ(f : A → B), Π(x y : A), f x = f y :=
begin
fapply equiv.MK,
{ intro f, fconstructor, intro a, exact f ... |
3e46598b023a13b3d5ac17fb2545b026fd48250b | 367134ba5a65885e863bdc4507601606690974c1 | /src/topology/algebra/infinite_sum.lean | d0bb0ed1712a08e42604a85061994f3b5877a434 | [
"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 | 48,318 | 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.big_operators.intervals
import topology.instances.real
import topology.algebra.module
import data.indicator_function
import data.equiv.encodable.lattic... |
7f5385ff068db078854375957c2469e7d76931a6 | 206422fb9edabf63def0ed2aa3f489150fb09ccb | /src/order/filter/ultrafilter.lean | e2ffe57bf5c4abe1e84497ee0aa28ddc12b3abe0 | [
"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 | 12,343 | 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, Jeremy Avigad, Yury Kudryashov
-/
import order.filter.cofinite
/-!
# Ultrafilters
An ultrafilter is a minimal (maximal in the set order) proper filter.
In this file w... |
135b85ffc1ce1339090ca5d29ff9b17cb6d3bc5b | e0b0b1648286e442507eb62344760d5cd8d13f2d | /tests/lean/have.lean | fc8331080c6d5da7bb8676396876b9593c341397 | [
"Apache-2.0"
] | permissive | MULXCODE/lean4 | 743ed389e05e26e09c6a11d24607ad5a697db39b | 4675817a9e89824eca37192364cd47a4027c6437 | refs/heads/master | 1,682,231,879,857 | 1,620,423,501,000 | 1,620,423,501,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 106 | lean | example : False :=
have False from _
example : 5 = 3 :=
have t : True := _
have f : 5 = 6 := _
f
|
7c6fe732ad4149d9a6f3d3cacf4e3640724f0e9a | eecbdfcd97327701a240f05d64290a19a45d198a | /meta-prog/lecture.lean | 925635485945224bcb0672216f0f75352461d0e4 | [] | no_license | johoelzl/hanoifabs | d5ca27df51f9bccfb0152f03b480e9e1228a4b14 | 4235c6bc5d664897bbf5dde04e2237e4b20c9170 | refs/heads/master | 1,584,514,375,379 | 1,528,258,129,000 | 1,528,258,129,000 | 134,419,383 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 6,058 | lean | /- Meta programming in Lean -/
/-
The central type to represent the logical content is `expr`, together with `name` and `level`.
`expr` are expressions (e.g. terms, types & proofs)
`name` used to reference constants & local hypothesis, etc
pretty printed names, name spaces names, internal unique names
`level` expr... |
6c47d7777d28a918a194f8437d770e512b8cb47b | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /stage0/src/Lean/Compiler/LCNF/PhaseExt.lean | 2e612900a2b8f44b2892f790a7872b907660adbc | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | tobiasgrosser/lean4 | ce0fd9cca0feba1100656679bf41f0bffdbabb71 | ebdbdc10436a4d9d6b66acf78aae7a23f5bd073f | refs/heads/master | 1,673,103,412,948 | 1,664,930,501,000 | 1,664,930,501,000 | 186,870,185 | 0 | 0 | Apache-2.0 | 1,665,129,237,000 | 1,557,939,901,000 | Lean | UTF-8 | Lean | false | false | 2,906 | 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.Compiler.LCNF.PassManager
namespace Lean.Compiler.LCNF
abbrev BaseExtState := PHashMap Name Decl
private abbrev declLt (a b : Decl) :=
Name... |
da050e98882d36c1ea6ce08182284e53a8ba7e0f | 35b83be3126daae10419b573c55e1fed009d3ae8 | /_target/deps/mathlib/data/padics/padic_norm.lean | c239ce6a1c568cada84aff048e389f42f1feb12a | [] | no_license | AHassan1024/Lean_Playground | ccb25b72029d199c0d23d002db2d32a9f2689ebc | a00b004c3a2eb9e3e863c361aa2b115260472414 | refs/heads/master | 1,586,221,905,125 | 1,544,951,310,000 | 1,544,951,310,000 | 157,934,290 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 20,004 | lean | /-
Copyright (c) 2018 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
Define the p-adic valuation on ℤ and ℚ, and the p-adic norm on ℚ
-/
import data.rat data.int.gcd algebra.field_power
import tactic.wlog tactic.ring
universe u
open ... |
8e601aa7ee08385edd0878720c0f3fe0a874aa71 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/ring_theory/ideal/local_ring.lean | 1cd68f3c33f375d4b0205e3a0a58f09f6205b144 | [
"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 | 12,733 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Chris Hughes, Mario Carneiro
-/
import algebra.algebra.basic
import algebra.category.Ring.basic
import ring_theory.ideal.operations
/-!
# Local rings
Define local rings as co... |
84482c3da04870f865279036f3994039da868511 | d29d82a0af640c937e499f6be79fc552eae0aa13 | /src/order/bounded_lattice.lean | 7c943f3308059e94582d2abed480f1cac3ba4aff | [
"Apache-2.0"
] | permissive | AbdulMajeedkhurasani/mathlib | 835f8a5c5cf3075b250b3737172043ab4fa1edf6 | 79bc7323b164aebd000524ebafd198eb0e17f956 | refs/heads/master | 1,688,003,895,660 | 1,627,788,521,000 | 1,627,788,521,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 46,970 | 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 order.lattice
import data.option.basic
import tactic.pi_instances
import logic.nontrivial
/-!
# ⊤ and ⊥, bounded lattices and variants
This file defines top ... |
dfdb7b94935229645f75a14cffe1a587a15c35a9 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tests/lean/run/498.lean | 79b336c4834834a0d8473016b6acc8f9e512c760 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | cipher1024/lean4 | 6e1f98bb58e7a92b28f5364eb38a14c8d0aae393 | 69114d3b50806264ef35b57394391c3e738a9822 | refs/heads/master | 1,642,227,983,603 | 1,642,011,696,000 | 1,642,011,696,000 | 228,607,691 | 0 | 0 | Apache-2.0 | 1,576,584,269,000 | 1,576,584,268,000 | null | UTF-8 | Lean | false | false | 2,880 | lean | structure ParamType where
/-- Name of the type, used when displaying the help. -/
name : String
/-- Function to check whether a value conforms to the type. -/
isValid : String → Bool
structure Flag where
/-- Designates `x` in `-x`. -/
shortName? : Option String := none
/-- Designates `x` in `--x`. -/... |
7f69f461f7eed061ad5864a8457d8f7601d92e28 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/measure_theory/function/l2_space.lean | b3a7ca2d8f3b50aae4490a338389e66db9ecebf3 | [
"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 | 10,968 | lean | /-
Copyright (c) 2021 Rémy Degenne. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Rémy Degenne
-/
import analysis.inner_product_space.basic
import measure_theory.integral.set_integral
/-! # `L^2` space
If `E` is an inner product space over `𝕜` (`ℝ` or `ℂ`), then `L... |
eeb1d3c4e0af2c28fed2a2b28ec6d52f5a9ff246 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/back1b.lean | 630eb56062f427faabbe22daa6f0c11395ccaa5f | [
"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 | 4,029 | lean | /- In this example, we demonstrate how to add tracing to
the tactic implemented in the file back.lean.
We also use quotations to build terms. -/
open list expr tactic
universe variable u
/- We change the implicit arguments of in_tail and in_head.
The goal is to allow us to create in_tail and in_head applicat... |
32e1cd48d26e8f9418ca7a7207f5a84d3af7f6d8 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/extra/dir_option.lean | 36b26da3df8f2f3ae7fa353a80c2667d0563493e | [
"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 | 155 | lean | -- Test for --dir option, to be able to execute this file, we must provide --dir=<path-to-nat-lib> in the command line
import .div
open nat
check nat.div
|
455fd3fd9f4c7bfbe63884d3b5a1d1b37f839ccc | 592ee40978ac7604005a4e0d35bbc4b467389241 | /Library/generated/mathscheme-lean/Empty.lean | 93c77df60d3f9a6739fac0cd548629d87b2cc166 | [] | no_license | ysharoda/Deriving-Definitions | 3e149e6641fae440badd35ac110a0bd705a49ad2 | dfecb27572022de3d4aa702cae8db19957523a59 | refs/heads/master | 1,679,127,857,700 | 1,615,939,007,000 | 1,615,939,007,000 | 229,785,731 | 4 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 204 | lean | import init.data.nat.basic
import init.data.fin.basic
import data.vector
import .Prelude
open Staged
open nat
open fin
open vector
section Empty
structure Empty : Type
open Empty
end Empty |
93e078efa1f78cf226f31d4625eef82ee20a1f32 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/meta1.lean | 3fccf819aa2703e48c59c6748d273f40ce4a93d3 | [
"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 | 93 | lean | definition bla (a : nat) := a
meta definition foo (a : nat) := bla a
meta constant A : nat
|
bff5e3db38cb186e7ba3b6b7ac27d6f424eea990 | 5ae26df177f810c5006841e9c73dc56e01b978d7 | /src/algebra/CommRing/adjunctions.lean | 4dcab34fec2064b44b17d9cda600bdd04695cf09 | [
"Apache-2.0"
] | permissive | ChrisHughes24/mathlib | 98322577c460bc6b1fe5c21f42ce33ad1c3e5558 | a2a867e827c2a6702beb9efc2b9282bd801d5f9a | refs/heads/master | 1,583,848,251,477 | 1,565,164,247,000 | 1,565,164,247,000 | 129,409,993 | 0 | 1 | Apache-2.0 | 1,565,164,817,000 | 1,523,628,059,000 | Lean | UTF-8 | Lean | false | false | 1,544 | lean | /- Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Johannes Hölzl
Multivariable polynomials on a type is the left adjoint of the
forgetful functor from commutative rings to types.
-/
import algebra.CommRing.basic
impo... |
710f8ed390d8dd21f59e938ca96070f1e94eb72f | 592ee40978ac7604005a4e0d35bbc4b467389241 | /Library/generated/mathscheme-lean/Inverse.lean | 00bf4a3719d47338f7bb7075ee25b9d48cd3ec62 | [] | no_license | ysharoda/Deriving-Definitions | 3e149e6641fae440badd35ac110a0bd705a49ad2 | dfecb27572022de3d4aa702cae8db19957523a59 | refs/heads/master | 1,679,127,857,700 | 1,615,939,007,000 | 1,615,939,007,000 | 229,785,731 | 4 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,573 | lean | import init.data.nat.basic
import init.data.fin.basic
import data.vector
import .Prelude
open Staged
open nat
open fin
open vector
section Inverse
structure Inverse (A : Type) : Type :=
(inv : (A → A))
(e : A)
(op : (A → (A → A)))
(leftInverse_inv_op_e : (∀ {x : A} , (op x (inv x)) = ... |
50365c78dd920959f0755d926709856f29a08420 | 129628888508a22919f176e3ba2033c3b52fa859 | /src/splitting_theorem.lean | ba2867a3e547a8b33e0965451574ceb425133004 | [
"Apache-2.0"
] | permissive | ImperialCollegeLondon/P11-Galois-Theory | 1aa35b6aa71c08aec6da3296ba404bf246db8df3 | ced2caa52300feb633316b3120c40ca957c8e8ff | refs/heads/master | 1,671,253,848,362 | 1,600,080,687,000 | 1,600,080,687,000 | 160,926,153 | 4 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 618 | lean | import field_theory.splitting_field ring_theory.polynomial
import data.polynomial
universes u
variables {α : Type u} [field α]
def adjoin_all_roots (f : polynomial α) : Type u :=
sorry
variables (β : Type u) (f : polynomial α)
variables [field β]
variables [algebra α β]
def is_splitting_field (f : polynomial α)... |
1d5665e01b42925cead6761d6d0143a4d3b686a4 | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/set_theory/ordinal_notation.lean | 23ce1050779168e7c5391d5b8b91e8c8a7be5c5d | [
"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 | 35,738 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
Ordinal notations (constructive ordinal arithmetic for ordinals < ε₀).
-/
import set_theory.ordinal data.pnat
open ordinal
local notation `ω` := omega.{0}
/-- Recursiv... |
34bfed8d98bee905a7eb6b877960544ba59f8995 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /stage0/src/Init/Lean/Parser/Tactic.lean | e817d726e1acdda863a0fbdfe223119be45565b8 | [
"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 | 3,253 | 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, Sebastian Ullrich
-/
prelude
import Init.Lean.Parser.Term
namespace Lean
namespace Parser
namespace Tactic
def underscoreFn : ParserFn :=
fun c s =>
let s... |
50b2600888c2e5cf40e632d6e1b2733087171a9a | 618003631150032a5676f229d13a079ac875ff77 | /src/analysis/normed_space/real_inner_product.lean | b3fa9eed02e8601416649f4bf4ff6c81507efe1c | [
"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 | 24,612 | lean | /-
Copyright (c) 2019 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou
-/
import algebra.quadratic_discriminant
import analysis.special_functions.pow
import tactic.monotonicity
/-!
# Inner Product Space
This file defines real inner product... |
73851eb8a4383f291fcfe519c0d21f5a2890be0b | 0c1546a496eccfb56620165cad015f88d56190c5 | /library/init/meta/mk_has_sizeof_instance.lean | 0acbf28b857f0a44f7e2a68edf998635b5cc4fc5 | [
"Apache-2.0"
] | permissive | Solertis/lean | 491e0939957486f664498fbfb02546e042699958 | 84188c5aa1673fdf37a082b2de8562dddf53df3f | refs/heads/master | 1,610,174,257,606 | 1,486,263,620,000 | 1,486,263,620,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,223 | 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
Helper tactic for constructing has_sizeof instance.
-/
prelude
import init.meta.rec_util init.meta.constructor_tactic
namespace tactic
open expr environment ... |
74c5c025a8e545e40a21b8e6916a4cea1990570a | d436468d80b739ba7e06843c4d0d2070e43448e5 | /src/computability/primrec.lean | d0df374ff836c94cd48798fcb5e58c25c5056066 | [
"Apache-2.0"
] | permissive | roro47/mathlib | 761fdc002aef92f77818f3fef06bf6ec6fc1a28e | 80aa7d52537571a2ca62a3fdf71c9533a09422cf | refs/heads/master | 1,599,656,410,625 | 1,573,649,488,000 | 1,573,649,488,000 | 221,452,951 | 0 | 0 | Apache-2.0 | 1,573,647,693,000 | 1,573,647,692,000 | null | UTF-8 | Lean | false | false | 50,091 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
The primitive recursive functions are the least collection of functions
nat → nat which are closed under projections (using the mkpair
pairing function), composition, ze... |
88e523cadc38724a5320a720c6df2c11bcb4bd37 | febba19712b2aefe4d6c7fb0230b8d7e272c98c4 | /src/playground.lean | d7795d545b89522d9d20fec05e0eec481dc6e204 | [] | no_license | hcheval/formalized-proof-mining | e6eb980feb644ae269f43d9af93ac584b7a47a17 | 216cc73fccd84900a1ba7eaae5f73732496d6afe | refs/heads/master | 1,689,621,410,792 | 1,629,912,272,000 | 1,629,912,272,000 | 399,855,572 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,581 | lean | -- import system.io
import tactic
-- import data.equiv.basic
#print proof_irrel
def f (p q : Prop) : p ∨ q → ℕ
| (or.inl _) := 0
| (or.inr _) := 1
def f (x : Π {n : ℕ}, n < 0) : ℕ := sorry
def g (x : Π {n : ℕ}, n < 0) : ℕ := f x
-- example (α β γ δ ε: Type*) [unique β] [unique γ] [unique δ] [unique ε]
-- :... |
6d6aa84eaf5edef5d895de6a53962bc2ea96af63 | b00eb947a9c4141624aa8919e94ce6dcd249ed70 | /src/Init/Prelude.lean | df7de2544d06e45984c245141c3db661c7b24151 | [
"Apache-2.0"
] | permissive | gebner/lean4-old | a4129a041af2d4d12afb3a8d4deedabde727719b | ee51cdfaf63ee313c914d83264f91f414a0e3b6e | refs/heads/master | 1,683,628,606,745 | 1,622,651,300,000 | 1,622,654,405,000 | 142,608,821 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 74,885 | 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
-/
prelude
universes u v w
@[inline] def id {α : Sort u} (a : α) : α := a
/- `idRhs` is an auxiliary declaration used to implement "smart unfolding". It is ... |
312c5ae666fd7c6b310e0760ed839f44d57ebc97 | a726f88081e44db9edfd14d32cfe9c4393ee56a4 | /world_experiments/world9/level6.lean | 4267c949c7bcf3fd6b86538a4b7918984482e123 | [] | no_license | b-mehta/natural_number_game | 80451bf10277adc89a55dbe8581692c36d822462 | 9faf799d0ab48ecbc89b3d70babb65ba64beee3b | refs/heads/master | 1,598,525,389,186 | 1,573,516,674,000 | 1,573,516,674,000 | 217,339,684 | 0 | 0 | null | 1,571,933,100,000 | 1,571,933,099,000 | null | UTF-8 | Lean | false | false | 2,031 | lean | import game.world5.level4 -- hide
import game.world2.level14
namespace mynat -- hide
/-
# World 5 : Inequality world
## Level 6 : `le_antisymm`
In this level, it would be helpful if you knew about how to create extra
hypotheses in the middle of a proof.
Say you have a hypothesis `h : a + b = a`
and you remember b... |
b603644f19a2b85f50460b7b65c0fa2471406a64 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /archive/imo/imo1988_q6.lean | 2ad4c9166d71893f69008987c1dac0094cde055a | [
"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,811 | 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.rat.basic
import tactic.linarith
import tactic.omega
/-!
# IMO1988 Q6 and constant descent Vieta jumping
Question 6 of IMO1988 is somewhat (in)famous. ... |
bd54583cecc534e974145007085926c176120cb4 | 2a2864136cf8f2871e86f5fd14e624e3daa8fd24 | /Monads/Maybe.lean | 3e44e343ee5f22b2f9a911471397e6592dc1258e | [
"MIT"
] | permissive | hargoniX/lean-monads | d054ac71a351b7c86f318a477977cc166117b8ec | 2e87ca7ddf394641ea1b16bcbd8c384026d68e2f | refs/heads/main | 1,693,530,528,286 | 1,633,100,386,000 | 1,633,100,386,000 | 412,509,769 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,353 | lean | import Monads.Functor
import Monads.Applicative
import Monads.Monad
namespace Monads
inductive Maybe (α : Type u) where
| none : Maybe α
| some : α → Maybe α
deriving Repr
namespace Maybe
section Functor
def map {α β : Type u} : (α → β) → Maybe α → Maybe β
| f, none => none
| f, (so... |
ae8a405395c3a17714a5fc5915ec10bf6c7bd363 | 217bb195841a8be2d1b4edd2084d6b69ccd62f50 | /library/init/data/string/basic.lean | 70b6d1e3ec5fcc18c86ed437b0d50f4cbb2ff913 | [
"Apache-2.0"
] | permissive | frank-lesser/lean4 | 717f56c9bacd5bf3a67542d2f5cea721d4743a30 | 79e2abe33f73162f773ea731265e456dbfe822f9 | refs/heads/master | 1,589,741,267,933 | 1,556,424,200,000 | 1,556,424,281,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 14,446 | lean | /-
Copyright (c) 2016 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.list.basic init.data.char.basic init.data.option.basic
universes u
structure String :=
(data : List Char)
abbrev String.Pos := Nat... |
14706bc448bdd10807a25fe02976d86c57403fa3 | e9dbaaae490bc072444e3021634bf73664003760 | /src/Problems/2003/IMO_2003_P4.lean | 2d4ba40ad064b71d3997fe5b1ec53da22046ee39 | [
"Apache-2.0"
] | permissive | liaofei1128/geometry | 566d8bfe095ce0c0113d36df90635306c60e975b | 3dd128e4eec8008764bb94e18b932f9ffd66e6b3 | refs/heads/master | 1,678,996,510,399 | 1,581,454,543,000 | 1,583,337,839,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 359 | lean | import Geo.Geo.Core
namespace Geo
open Angle Line Quadrilateral
open Seg (cong)
def IMO_2003_P4 : Prop :=
∀ (A B C D : Point),
cyclic ⟨A, B, C, D⟩ →
let P := foot D ⟨A, B⟩;
let Q := foot D ⟨B, C⟩;
let R := foot D ⟨C, A⟩;
allIntersect [bisector ⟨A, B, C⟩, bisector ⟨C, D, A⟩, Line.mk A C] ↔ cong ⟨R, P⟩ ⟨R, Q⟩
end Geo... |
1626e0cc768e4a910f258b5bd79ccff6c416f30e | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/category_theory/monad/algebra.lean | 198f5f83f93e2422db0bde1c4217bfa1610ee61e | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 12,970 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Bhavik Mehta
-/
import category_theory.monad.basic
import category_theory.adjunction.basic
import category_theory.functor.epi_mono
/-!
# Eilenberg-Moore (co)algebras f... |
f419364a0568b41e8a8ff4f7670e5a21967a5a3d | 64874bd1010548c7f5a6e3e8902efa63baaff785 | /tests/lean/run/vars_anywhere.lean | fd48344aed21054fc2c533c14a14aca3b0751387 | [
"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 | 135 | lean | variable {A : Type}
definition id (a : A) := a
check @id
inductive list :=
nil : list,
cons : A → list → list
check @list.cons
|
32d6a73d067b76a5a48c71298c8afca8d5cf4105 | 6fca17f8d5025f89be1b2d9d15c9e0c4b4900cbf | /src/game/world3/level7.lean | 9ef8ec18f40a9a2c8999ec22361a19f80a30a52a | [
"Apache-2.0"
] | permissive | arolihas/natural_number_game | 4f0c93feefec93b8824b2b96adff8b702b8b43ce | 8e4f7b4b42888a3b77429f90cce16292bd288138 | refs/heads/master | 1,621,872,426,808 | 1,586,270,467,000 | 1,586,270,467,000 | 253,648,466 | 0 | 0 | null | 1,586,219,694,000 | 1,586,219,694,000 | null | UTF-8 | Lean | false | false | 1,743 | lean | import game.world3.level6 -- hide
namespace mynat -- hide
/-
# Multiplication World
## Level 7: `add_mul`
We proved `mul_add` already, but because we don't have commutativity yet
we also need to prove `add_mul`. We have a bunch of tools now, so this won't
be too hard. You know what -- you can do this one by inductio... |
6b636c8dc3726890d101b9bce05df22e896c1f47 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /stage0/src/Lean/Hygiene.lean | 6b6f6176e1d3477368e92db0000aac0f7b545933 | [
"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 | 4,601 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
-/
import Lean.Data.Name
import Lean.Data.Options
import Lean.Data.Format
namespace Lean
/-! Remark: `MonadQuotation` class is part of the `Init` package and ... |
8418879d852ebfd59b15409240de03677beccaaa | 3dc4623269159d02a444fe898d33e8c7e7e9461b | /.github/workflows/geo/src/sub.lean | ebeaa9c893c1c721e62e4b4f711fcb400763afb4 | [] | no_license | Or7ando/lean | cc003e6c41048eae7c34aa6bada51c9e9add9e66 | d41169cf4e416a0d42092fb6bdc14131cee9dd15 | refs/heads/master | 1,650,600,589,722 | 1,587,262,906,000 | 1,587,262,906,000 | 255,387,160 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,930 | lean | /-
Copyright (c) 2020 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta
-/
import pullbacks
import comma
import category_theory.opposites
universes u v
namespace category_theory
open category_theory.limits
variables {C : Type u} [𝒞 : catego... |
759e1da6eef09c5e4f0650c15644220cdccdd123 | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/algebra/field_power.lean | 03d315b83cc32a33e2cb1497a625ed91fe7fb72b | [
"Apache-2.0"
] | permissive | vaibhavkarve/mathlib | a574aaf68c0a431a47fa82ce0637f0f769826bfe | 17f8340912468f49bdc30acdb9a9fa02eeb0473a | refs/heads/master | 1,621,263,802,637 | 1,585,399,588,000 | 1,585,399,588,000 | 250,833,447 | 0 | 0 | Apache-2.0 | 1,585,410,341,000 | 1,585,410,341,000 | null | UTF-8 | Lean | false | false | 8,565 | lean | /-
Copyright (c) 2018 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
Integer power operation on fields.
-/
import algebra.group_power algebra.ordered_field
import tactic.wlog tactic.linarith
universe u
section field_power
open int n... |
7e768cbcf6964fb3047088e8a5a32776850a6b6e | 2a70b774d16dbdf5a533432ee0ebab6838df0948 | /_target/deps/mathlib/src/set_theory/ordinal_arithmetic.lean | 8d9e6d59ba629e8fadd850ea68f039d135b3e2ff | [
"Apache-2.0"
] | permissive | hjvromen/lewis | 40b035973df7c77ebf927afab7878c76d05ff758 | 105b675f73630f028ad5d890897a51b3c1146fb0 | refs/heads/master | 1,677,944,636,343 | 1,676,555,301,000 | 1,676,555,301,000 | 327,553,599 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 70,305 | 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
-/
import set_theory.ordinal
/-!
# Ordinal arithmetic
Ordinals have an addition (corresponding to disjoint union) that turns them into an additive
monoid, and a multipl... |
d082b86270dcb10f499f0326fed1fb8ae177648c | 75db7e3219bba2fbf41bf5b905f34fcb3c6ca3f2 | /library/init/reserved_notation.lean | 8a744c2dd4c047d044eb8e08836fdc933b724abc | [
"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 | 7,324 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Jeremy Avigad, Floris van Doorn
-/
prelude
import init.datatypes
notation `assume` binders `,` r:(scoped f, f) := r
notation `take` binders `,` r:(scoped f... |
6a7f03cdbb368d1ce2bc85679b9a75951d3a1e81 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/measure_theory/ae_eq_fun.lean | 91b5c509674741e77a7e44913c5d177db47db9d6 | [
"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 | 21,525 | lean | /-
Copyright (c) 2019 Johannes Hölzl, Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Zhouhang Zhou
-/
import measure_theory.integration
import order.filter.germ
/-!
# Almost everywhere equal functions
Two measurable functions are treat... |
8d47a733456c4145d1df3e571fc6e31f96106b8f | 853df553b1d6ca524e3f0a79aedd32dde5d27ec3 | /src/geometry/manifold/basic_smooth_bundle.lean | 539f1c409dcc8c7b3ea69ae7cc60a71fc50eac23 | [
"Apache-2.0"
] | permissive | DanielFabian/mathlib | efc3a50b5dde303c59eeb6353ef4c35a345d7112 | f520d07eba0c852e96fe26da71d85bf6d40fcc2a | refs/heads/master | 1,668,739,922,971 | 1,595,201,756,000 | 1,595,201,756,000 | 279,469,476 | 0 | 0 | null | 1,594,696,604,000 | 1,594,696,604,000 | null | UTF-8 | Lean | false | false | 31,727 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import topology.topological_fiber_bundle
import geometry.manifold.smooth_manifold_with_corners
/-!
# Basic smooth bundles
In general, a smooth bundle is a bund... |
362cc13d35f55ceccf21cebb2c7d4d896aefa77c | d450724ba99f5b50b57d244eb41fef9f6789db81 | /src/mywork/Homework/hw8.lean | e7c041db012cab7262fdb72dccf66158d5705785 | [] | no_license | jakekauff/CS2120F21 | 4f009adeb4ce4a148442b562196d66cc6c04530c | e69529ec6f5d47a554291c4241a3d8ec4fe8f5ad | refs/heads/main | 1,693,841,880,030 | 1,637,604,848,000 | 1,637,604,848,000 | 399,946,698 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,992 | lean | /-
BACK TO PROPERTIES OF RELATIONS
-/
/-
So now let's revisit once again our funny example of
transitivity: { (0,1), (2,3) }. There are no cases
here where we have both (x,y) and (y,z) as pairs in
this relation, so there are no cases to consider.
When there are no cases to consider, the conclusion
holds in all cases... |
9a7607ca73c11267d86b5313bf4b341294c5c71e | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/topology/semicontinuous.lean | a00f7b288c64ecf389f3689790da9b79b08dde7c | [
"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 | 46,977 | 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 algebra.indicator_function
import topology.continuous_on
import topology.instances.ennreal
/-!
# Semicontinuous maps
> THIS FILE IS SYNCHRONIZED WITH M... |
5da78bf0640ce8de938a63232ad6471dd64db508 | 4bcaca5dc83d49803f72b7b5920b75b6e7d9de2d | /stage0/src/Init/NotationExtra.lean | be65fb66045e0ded8be1b82f1a6bc5612a68f7ca | [
"Apache-2.0"
] | permissive | subfish-zhou/leanprover-zh_CN.github.io | 30b9fba9bd790720bd95764e61ae796697d2f603 | 8b2985d4a3d458ceda9361ac454c28168d920d3f | refs/heads/master | 1,689,709,967,820 | 1,632,503,056,000 | 1,632,503,056,000 | 409,962,097 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,329 | 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
Extra notation that depends on Init/Meta
-/
prelude
import Init.Meta
import Init.Data.Array.Subarray
import Init.Data.ToString
namespace Lean
syntax "Macro.t... |
74d1b3b9f473ae8b955a4eda573ed97100b026c2 | 8bd887b7243091dc205ed42901ce4c1fa0e257b0 | /meta_data.lean | 479a71bb2380d51995b00ce19e9d18cb68df8614 | [
"CC-BY-4.0"
] | permissive | digama0/formalabstracts | 353a85fb89b5b07b7a93033065181649699fc75d | 5cef757c0bc0b1b29a4f83ed6c95905846dd060b | refs/heads/master | 1,611,534,127,871 | 1,500,365,932,000 | 1,500,366,034,000 | 97,342,948 | 0 | 0 | null | 1,500,153,646,000 | 1,500,153,645,000 | null | UTF-8 | Lean | false | false | 5,340 | lean | /- Each fabstract contains a list of results. The following type lists the
various kinds of results. You may read the values as follows:
* `Proof p` -- the paper contains the proof `p`
* `Construction c` -- the paper contains the construction `c`
* `Conjecture C` -- the paper contains the conjecture `C`
... |
51217e934b6a0d5568aa07c32c892052218521cf | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/585.lean | 0513887db298d68d92c47fe054a5b14899296318 | [
"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 | 186 | lean | import data.finset.basic
open finset
check ∅ -- o.k.
check λs t, subset s t -- o.k.
check λs t, s ⊆ t -- fixed
infix `⊆` := subset
check λs t, s ⊆ t
|
5322c66ceb6fa3b6564a57c2970d07bff772bd51 | 74a02dffce22907d2b61b8e226f1d9aa8384c7c0 | /Cli/Example.lean | b41decb70bf25ff8ef19258145422f954a042261 | [
"MIT"
] | permissive | mhuisi/lean4-cli-docker-test | 7e0566c7397746701162e2e22fbad38afcf1e9c4 | 6b3881eaa22596f6f430654f61fc03719ee18c62 | refs/heads/main | 1,680,104,973,886 | 1,616,975,353,000 | 1,616,975,353,000 | 352,411,347 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,021 | lean | import Cli
open Cli
def doNothing (p : Parsed) : IO UInt32 :=
return 0
def runExampleCmd (p : Parsed) : IO UInt32 := do
let input : String := p.positionalArg! "input" |>.as! String
let outputs : Array String := p.variableArgsAs! String
IO.println <| "Input: " ++ input
IO.println <| "Outputs: " ++ t... |
9a304c97ac08ec7ba069f10022bb7cdd03053265 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /script/reformat.lean | 403abd752a5666450393d8870e8ef778f2f14b3b | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | cipher1024/lean4 | 6e1f98bb58e7a92b28f5364eb38a14c8d0aae393 | 69114d3b50806264ef35b57394391c3e738a9822 | refs/heads/master | 1,642,227,983,603 | 1,642,011,696,000 | 1,642,011,696,000 | 228,607,691 | 0 | 0 | Apache-2.0 | 1,576,584,269,000 | 1,576,584,268,000 | null | UTF-8 | Lean | false | false | 2,878 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner
-/
import Lean
open Lean Elab PrettyPrinter
partial def getCommands (cmds : Syntax) : StateT (Array Syntax) Id Unit := do
if cmds.getKind == nullKind || cmds.ge... |
7bd04b74e0380fd8daa156de834b4f0810948e68 | dc06cc9775d64d571bf4778459ec6fde1f344116 | /src/category_theory/monad/default.lean | 31a825e9d3a84fd96e2333c625f5e4b72a114b16 | [
"Apache-2.0"
] | permissive | mgubi/mathlib | 8c1ea39035776ad52cf189a7af8cc0eee7dea373 | 7c09ed5eec8434176fbc493e0115555ccc4c8f99 | refs/heads/master | 1,642,222,572,514 | 1,563,782,424,000 | 1,563,782,424,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 36 | lean | import category_theory.monad.limits
|
7b15e5258dc6e2c9d76ca60e2e1bcf72404cde01 | 3dc4623269159d02a444fe898d33e8c7e7e9461b | /.github/workflows/project_1_a_decrire/foncteur/foncteur_affine_line/AGL_1.lean | 5c0476dca53056ae9c7b5737d2e212be7fec9eb7 | [] | no_license | Or7ando/lean | cc003e6c41048eae7c34aa6bada51c9e9add9e66 | d41169cf4e416a0d42092fb6bdc14131cee9dd15 | refs/heads/master | 1,650,600,589,722 | 1,587,262,906,000 | 1,587,262,906,000 | 255,387,160 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,334 | lean | import algebra.category.CommRing.basic
import algebra.ring
/--
## This is the groupe AGL_1(R) : x ↦ ax + b invertible i.e with a inveritible ! The goal is to make
## into a groupe for composition !
-/
structure AGL_1 ( R : Type) [comm_ring R] := mk {} ::
(a b : R)
(y : R)
(certif : a * y = 1)
namespace AGL_1
se... |
2ecc540930638c7fe731118b44955282340c0d1d | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/analysis/ODE/gronwall.lean | 6281e5225fe3ce1381ccb36a55f821bbd3878e6b | [
"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 | 13,199 | 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 analysis.calculus.mean_value analysis.complex.exponential
/-!
# Grönwall's inequality
The main technical result of this file is the Grönwall-like inequalit... |
e14e0a87bf467664141d2da6a585193fc0641de0 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/algebra/floor.lean | 449dd97697c49f0e4a4de65968792a63a531ca13 | [
"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 | 14,361 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Kevin Kappelmann
-/
import tactic.linarith
import tactic.abel
import algebra.ordered_group
import data.set.intervals.basic
/-!
# Floor and ceil
## Summary
We define ... |
748dbba3b8b125348cccb200856b2e9fa5b9ff7f | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/data/sym/basic.lean | 71fc50ce5818d55b1d7bf639cc3c185ebbbf7fe1 | [
"Apache-2.0"
] | permissive | AntoineChambert-Loir/mathlib | 64aabb896129885f12296a799818061bc90da1ff | 07be904260ab6e36a5769680b6012f03a4727134 | refs/heads/master | 1,693,187,631,771 | 1,636,719,886,000 | 1,636,719,886,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,658 | lean | /-
Copyright (c) 2020 Kyle Miller All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kyle Miller
-/
import data.multiset.basic
import data.vector.basic
/-!
# Symmetric powers
This file defines symmetric powers of a type. The nth symmetric power
consists of homogeneous ... |
7c147d178c6ccc416e1d12e0905f1042f51d60a2 | 947b78d97130d56365ae2ec264df196ce769371a | /stage0/src/Lean/Data/LOption.lean | c7efffad0e2445d66e26538c3a32aac9b7be931b | [
"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,051 | 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
-/
universes u
namespace Lean
inductive LOption (α : Type u)
| none : LOption
| some : α → LOption
| undef : LOption
namespace LOption
variables {α : Type... |
74d259a59bbcac0e079e83031074d52da9b4c122 | bb31430994044506fa42fd667e2d556327e18dfe | /src/algebra/order/ring/canonical.lean | 9727b9fcf4a59ebc5d5bc0beabb77dd085614610 | [
"Apache-2.0"
] | permissive | sgouezel/mathlib | 0cb4e5335a2ba189fa7af96d83a377f83270e503 | 00638177efd1b2534fc5269363ebf42a7871df9a | refs/heads/master | 1,674,527,483,042 | 1,673,665,568,000 | 1,673,665,568,000 | 119,598,202 | 0 | 0 | null | 1,517,348,647,000 | 1,517,348,646,000 | null | UTF-8 | Lean | false | false | 4,877 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Mario Carneiro
-/
import algebra.order.ring.defs
import algebra.order.sub.canonical
import group_theory.group_action.defs
/-!
# Canoncially ordered ri... |
09f595c97e3fd55ed846d8ce6a9963320636ab94 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/rquote.lean | 0338276e58b43be8ed7ff4727de96f68c5c905ba | [
"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 | 348 | lean | --
namespace foo
constant f : nat → nat
constant g : nat → nat
end foo
namespace boo
constant f : nat → nat
end boo
open foo boo
#check ``f
#check ``g
open int
#check ``has_add.add
#check ``nat_abs
#check `f
#check `foo.f
namespace bla
section
parameter A : Type
definition ID : A → A := λ x, x
#check... |
0dc23e138bfc5b590b60fab275a5f0a6775b6127 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/auto_eq_congr_extra_args.lean | ccfd031c29247e565e44a8d242d9ebb49031fa88 | [
"Apache-2.0"
] | permissive | leanprover-community/lean | 12b87f69d92e614daea8bcc9d4de9a9ace089d0e | cce7990ea86a78bdb383e38ed7f9b5ba93c60ce0 | refs/heads/master | 1,687,508,156,644 | 1,684,951,104,000 | 1,684,951,104,000 | 169,960,991 | 457 | 107 | Apache-2.0 | 1,686,744,372,000 | 1,549,790,268,000 | C++ | UTF-8 | Lean | false | false | 1,121 | lean | open tactic
constant my_ite (c : Prop) {A : Type*} (t : A) : A
@[simp] lemma my_ite_true {A : Type*} (t : A) : @my_ite true A t = t := sorry
def my_true_def : Prop := true
@[simp] lemma m_true_def_true : my_true_def = true := rfl
constant my_true : Prop
@[simp] lemma m_true_true : my_true = true := sorry
example (n... |
631fa812a6fb39ee9f518ed52fb8249c445a4c4f | 17d3c61bf162bf88be633867ed4cb201378a8769 | /library/init/meta/converter.lean | e298b46ead12eb541b006ac07225f3accc406141 | [
"Apache-2.0"
] | permissive | u20024804/lean | 11def01468fb4796fb0da76015855adceac7e311 | d315e424ff17faf6fe096a0a1407b70193009726 | refs/heads/master | 1,611,388,567,561 | 1,485,836,506,000 | 1,485,836,625,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,018 | 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
Converter monad for building simplifiers.
-/
prelude
import init.meta.tactic init.meta.simp_tactic
import init.meta.congr_lemma init.meta.match_tactic
open ta... |
42912004b6e35ff840c6e16dcaa3ca14810f5d4f | cf39355caa609c0f33405126beee2739aa3cb77e | /library/init/data/fin/basic.lean | 8f8f752cf692bda98982bd01609e8f230a441fe7 | [
"Apache-2.0"
] | permissive | leanprover-community/lean | 12b87f69d92e614daea8bcc9d4de9a9ace089d0e | cce7990ea86a78bdb383e38ed7f9b5ba93c60ce0 | refs/heads/master | 1,687,508,156,644 | 1,684,951,104,000 | 1,684,951,104,000 | 169,960,991 | 457 | 107 | Apache-2.0 | 1,686,744,372,000 | 1,549,790,268,000 | C++ | UTF-8 | Lean | false | false | 1,501 | lean | /-
Copyright (c) 2016 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
open nat
/-- `fin n` is the subtype of `ℕ` consisting of natural numbers strictly smaller than `n`. -/
structure fin (n :... |
6b420c83a2778c5caa31fe01dfae439f4f591fec | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /library/init/timeit.lean | 0d44b5674b49cf9af1001cf5e0f5bb1bbd697e1b | [
"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 | 331 | lean | -- Copyright (c) 2016 Microsoft Corporation. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Author: Leonardo de Moura
prelude
import init.string
/- This function has a native implementation that tracks time. -/
definition timeit {A : Type} (s : string) (f : unit → A) : A... |
228537e3d56bbf42bffb332999b786ffa96e762d | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /stage0/src/Lean/Elab/Tactic/Injection.lean | 5e60eb6a052f69ae98343f0d74e6ce9422c2fae2 | [
"Apache-2.0"
] | permissive | williamdemeo/lean4 | 72161c58fe65c3ad955d6a3050bb7d37c04c0d54 | 6d00fcf1d6d873e195f9220c668ef9c58e9c4a35 | refs/heads/master | 1,678,305,356,877 | 1,614,708,995,000 | 1,614,708,995,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,193 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Meta.Tactic.Injection
import Lean.Elab.Tactic.ElabTerm
namespace Lean.Elab.Tactic
-- optional (" with " >> many1 ident')
private def getInjecti... |
151e8f71ad4bd1677a4ba0e18adb3388245e33f0 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/topology/local_at_target.lean | 5c258bb4eddc3834dc7f0579e14c2f09cd50537d | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 5,931 | lean | /-
Copyright (c) 2022 Andrew Yang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Andrew Yang
-/
import topology.sets.opens
/-!
# Properties of maps that are local at the target.
We show that the following properties of continuous maps are local at the target :
- `in... |
173ba08254448935fb7bb5776da0fce6a1aaff19 | 367134ba5a65885e863bdc4507601606690974c1 | /src/tactic/nth_rewrite/default.lean | 6f5059d923ac0f72365844673d13cb931c8d2c9d | [
"Apache-2.0"
] | permissive | kodyvajjha/mathlib | 9bead00e90f68269a313f45f5561766cfd8d5cad | b98af5dd79e13a38d84438b850a2e8858ec21284 | refs/heads/master | 1,624,350,366,310 | 1,615,563,062,000 | 1,615,563,062,000 | 162,666,963 | 0 | 0 | Apache-2.0 | 1,545,367,651,000 | 1,545,367,651,000 | null | UTF-8 | Lean | false | false | 5,112 | lean | /-
Copyright (c) 2018 Keeley Hoek. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Keeley Hoek, Scott Morrison
-/
import tactic.nth_rewrite.congr
/-!
# Advanced rewriting tactics
This file provides three interactive tactics
that give the user more con... |
c948280007d2da7801b0fa8fa1f2c2f9fd31481f | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/tactic/rcases.lean | 07a6c8707d507719cfa77203cc15f072b440ba99 | [
"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 | 42,782 | 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`... |
de0bedc58eb3b93547f9696cdcf4d1fa1d71f362 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/algebra/gcd_monoid/multiset.lean | d382c69c799aab8d6600287c3181317019f4a645 | [
"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 | 5,102 | lean | /-
Copyright (c) 2020 Aaron Anderson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson
-/
import data.multiset.lattice
import algebra.gcd_monoid
/-!
# GCD and LCM operations on multisets
## Main definitions
- `multiset.gcd` - the greatest common denomin... |
6edb6385f8a6481f8de627ef6909121c8a7cb11a | ce89339993655da64b6ccb555c837ce6c10f9ef4 | /bluejam/topprover/09.lean | aba917685ec3fe6dc32465fd97be4f81e40a7455 | [] | 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 | 107 | lean | example : ∀ (l : list ℕ), list.append l (0 :: list.nil) ≠ list.nil :=
by intros; induction l; simp *
|
d7a82e11e1a95265b2cb5d77c034a7fa9fee1bfb | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/category_theory/preadditive/projective.lean | ae125a48878db396d28d4053a6be48ec3cb3f83f | [
"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 | 8,243 | lean | /-
Copyright (c) 2020 Markus Himmel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel, Scott Morrison
-/
import algebra.homology.exact
import category_theory.types
import category_theory.limits.shapes.biproducts
import category_theory.preadditive.yoneda
imp... |
7487e32c2cd0e421e3d45d6a2e176206ce292f18 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/topology/algebra/with_zero_topology.lean | 640c276bf477923e5815a19257c121bee6b077a9 | [
"Apache-2.0"
] | permissive | AntoineChambert-Loir/mathlib | 64aabb896129885f12296a799818061bc90da1ff | 07be904260ab6e36a5769680b6012f03a4727134 | refs/heads/master | 1,693,187,631,771 | 1,636,719,886,000 | 1,636,719,886,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 12,006 | lean | /-
Copyright (c) 2021 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot
-/
import topology.algebra.ordered.basic
import algebra.order.with_zero
/-!
# The topology on linearly ordered commutative groups with zero
Let `Γ₀` be a linearly ord... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.