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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
d827a0f9065011fd2ce5d4b8d83fc0002bede449 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/full_subcategory.lean | 10aa724aaaceff9315b5319a6fbe09e23f483d37 | [] | 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 | 4,400 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Reid Barton
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.category_theory.fully_faithful
import Mathlib.PostPort
universes v u₁ u₂ u_1 ... |
876d07761b9d9ca16202d199d73bf4a3ba759cee | 491068d2ad28831e7dade8d6dff871c3e49d9431 | /tests/lean/run/fib_wrec.lean | dd6e6c78fe716657528c63c5ced624f68e8f24cc | [
"Apache-2.0"
] | permissive | davidmueller13/lean | 65a3ed141b4088cd0a268e4de80eb6778b21a0e9 | c626e2e3c6f3771e07c32e82ee5b9e030de5b050 | refs/heads/master | 1,611,278,313,401 | 1,444,021,177,000 | 1,444,021,177,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 911 | lean | import data.nat
open nat eq.ops
definition fib.F (n : nat) : (Π (m : nat), m < n → nat) → nat :=
nat.cases_on n
(λ (f : Π (m : nat), m < zero → nat), succ zero)
(λ (n₁ : nat), nat.cases_on n₁
(λ (f : Π (m : nat), m < (succ zero) → nat), succ zero)
(λ (n₂ : nat) (f : Π (m : nat), m < (succ (succ n₂)) → nat)... |
d79f7b549dc3b799d1ceb1d98c0651137103f03e | 36c7a18fd72e5b57229bd8ba36493daf536a19ce | /tests/lean/simplifier18.lean | 41ba4bc2101f0dd84fd35a4c1ebc218f891853c0 | [
"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 | 1,154 | lean | -- Basic fusion
import algebra.simplifier
open algebra
universe l
constants (T : Type.{l}) (s : algebra.comm_ring T)
constants (x1 x2 x3 x4 : T) (f g : T → T)
attribute s [instance]
set_option simplify.max_steps 50000
set_option simplify.fuse true
#simplify eq simplifier.som 0 x1 * x2
#simplify eq simplifier.som 0 x1... |
ceeea008d35e455a4e7075921b2efc92267da8e3 | 76df16d6c3760cb415f1294caee997cc4736e09b | /lean/src/interp/tactic.lean | 85a103ce3cbc349ec2c82aad84b90085be6a0b11 | [
"MIT"
] | permissive | uw-unsat/leanette-popl22-artifact | 70409d9cbd8921d794d27b7992bf1d9a4087e9fe | 80fea2519e61b45a283fbf7903acdf6d5528dbe7 | refs/heads/master | 1,681,592,449,670 | 1,637,037,431,000 | 1,637,037,431,000 | 414,331,908 | 6 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 395 | lean | import ..tactic.all
open tactic.interactive
setup_tactic_parser
@[interactive] meta def cases_on_interp
(h : parse ident)
(_x : parse (parser.tk ":"))
(e : parse types.texpr)
(ids : parse $ (tk ":" *> ident_*)?) : tactic unit :=
do
tactic.interactive.cases_all h _x e [],
case [([`none], none)] `[contrad... |
f68d46352a87d7aed7a470d7d8818f1ca66782d8 | b70031c8e2c5337b91d7e70f1e0c5f528f7b0e77 | /src/order/filter/at_top_bot.lean | 710ceb2750de9580a95bba1e8b0fbd2eb17d44de | [
"Apache-2.0"
] | permissive | molodiuc/mathlib | cae2ba3ef1601c1f42ca0b625c79b061b63fef5b | 98ebe5a6739fbe254f9ee9d401882d4388f91035 | refs/heads/master | 1,674,237,127,059 | 1,606,353,533,000 | 1,606,353,533,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 45,100 | 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, Patrick Massot
-/
import order.filter.bases
import data.finset.preimage
/-!
# `at_top` and `at_bot` filters on preorded sets, monoids a... |
6961a13e2069abfcee2eca85b8af8a94ba274391 | 2a70b774d16dbdf5a533432ee0ebab6838df0948 | /_target/deps/mathlib/src/data/nat/parity.lean | 919c1d6b0f5029bdb88518143075015fc5501efa | [
"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 | 5,954 | lean | /-
Copyright (c) 2019 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
The `even` and `odd` predicates on the natural numbers.
-/
import data.nat.modeq
namespace nat
@[simp] theorem mod_two_ne_one {n : ℕ} : ¬ n % 2 = 1 ↔ n % 2 = 0 :=
by ca... |
e1e01461974a5a889e3edf184d2529f92cdcd271 | 1a2aed113dcb5f1c07ae98040953fba5e6563624 | /leantest.lean | 3a2edd44936f1da5486dcffd91d9fc37f383a07e | [] | no_license | kevindoran/lean | 61d9fb90363b04587624036136482b29e3c16ebd | 77e755095a31e3a214010eb48a61e48d65dfdec9 | refs/heads/master | 1,670,372,072,769 | 1,598,920,365,000 | 1,598,920,365,000 | 264,824,992 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 11 | lean | #eval 1 + 1 |
6695075000981e65ac827c83082847ad5a72c9bd | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/geometry/manifold/instances/real.lean | 213d98cd67860ef1fb09620f4e11712669638f4f | [
"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,628 | 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 geometry.manifold.algebra.smooth_functions
import linear_algebra.finite_dimensional
import analysis.inner_product_space.pi_L2
/-!
# Constructing example... |
f5b4a66eca22b0a8dc3fc83528737809f9b5ce62 | 32025d5c2d6e33ad3b6dd8a3c91e1e838066a7f7 | /tests/lean/precissues.lean | 4cc4bbc3e67a1825e8a6722ae64adaaa3bfc8fe1 | [
"Apache-2.0"
] | permissive | walterhu1015/lean4 | b2c71b688975177402758924eaa513475ed6ce72 | 2214d81e84646a905d0b20b032c89caf89c737ad | refs/heads/master | 1,671,342,096,906 | 1,599,695,985,000 | 1,599,695,985,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 575 | lean | new_frontend
#check id fun x => x -- should work
#check 0
def f (x : Nat) (g : Nat → Nat) := g x
#check f 1 fun x => x -- should fail
#check 0
#check f 1 (fun x => x)
#check id have True from ⟨⟩; this -- should fail
#check 1
#check id (have True from ⟨⟩; this)
#check 0 = have Nat from 1; this
#check 0 = let x... |
2906d8e6173df33d85243f96b95653be128c22d6 | 36c7a18fd72e5b57229bd8ba36493daf536a19ce | /tests/lean/hott/inj_tac.hlean | 5e776fa7651298a6e9365b8d9644d7d430312cd1 | [
"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 | 1,010 | hlean | open nat
inductive vector (A : Type) : nat → Type :=
| nil {} : vector A zero
| cons : Π {n}, A → vector A n → vector A (succ n)
open vector
notation a :: b := cons a b
notation `[` l:(foldr `,` (h t, cons h t) nil `]`) := l
example (a b : nat) : succ a = succ b → a + 2 = b + 2 :=
begin
intro H,
injection H,
... |
abeb9930af683f9d8c6839a6bcec792280db33d5 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/field_theory/finite/basic.lean | f8fcb73237bdbcc178be4e45423cd3aafd5f2430 | [
"Apache-2.0"
] | permissive | Lix0120/mathlib | 0020745240315ed0e517cbf32e738d8f9811dd80 | e14c37827456fc6707f31b4d1d16f1f3a3205e91 | refs/heads/master | 1,673,102,855,024 | 1,604,151,044,000 | 1,604,151,044,000 | 308,930,245 | 0 | 0 | Apache-2.0 | 1,604,164,710,000 | 1,604,163,547,000 | null | UTF-8 | Lean | false | false | 12,407 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Joey van Langen, Casper Putz
-/
import tactic.apply_fun
import data.equiv.ring
import data.zmod.basic
import linear_algebra.basis
import ring_theory.integral_domain
import ... |
fe82f5cca29c1973a7134f92bf0bcf861fa80c46 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/elab6.lean | 74e361575bfc4a5840bf7e1c2b16c9329fdda4bf | [
"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 | 296 | lean | constant R : nat → nat → Prop
constant H : transitive R
set_option pp.all true
constant F : ∀ {A : Type*} ⦃a : A⦄ {b : A} (c : A) ⦃e : A⦄, A → A → A
#check H
#check F
#check F tt
#check F tt tt
#check F tt tt tt
#check H
#check F
#check F tt
#check F tt tt
#check F tt tt tt
|
5bc39be9bc905c6e5ea708f16e73af31ff8ec503 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/blast_vector_test.lean | 6ce58bdb8bf2626e64c40c6370c02db9aa149ce6 | [
"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 | 3,437 | lean | import data.nat
open nat
lemma addl_eq_add [simp] (n m : nat) : (:n ⊕ m:) = n + m :=
!add_eq_addl
-- Casting notation
notation `⟨`:max a `⟩`:0 := cast (by inst_simp) a
inductive vector (A : Type) : nat → Type :=
| nil {} : vector A zero
| cons : Π {n}, A → vector A n → vector A (succ n)
namespace vector
notation... |
0762cbec4081b75aff691fd0471d163e57ca73f8 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/category_theory/limits/shapes/wide_equalizers.lean | 4befef2d48735988dd963493d73145a5e14aad67 | [
"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 | 27,893 | lean | /-
Copyright (c) 2021 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta
-/
import category_theory.limits.has_limits
import category_theory.limits.shapes.equalizers
/-!
# Wide equalizers and wide coequalizers
This file defines wide (co)equalize... |
dea6f128d54ac8fbf32f4a18125eb1ac220181ee | 39ef80a23ca45a679ce3047fabd002248e3ee410 | /src/tuto_lib.lean | 7109c63167db4107744e5b428809f81274f7403d | [
"MIT"
] | permissive | sanjitdp/lean-projects | 5baa4d97f38b0d5af41e4960dc69ecc7c65a1e4c | 05b9a58e8bda3baebd4269536db39815a73cb123 | refs/heads/main | 1,690,059,014,811 | 1,630,696,075,000 | 1,630,696,075,000 | 399,831,128 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 6,774 | lean | import analysis.specific_limits
import data.int.parity
import topology.sequences
attribute [instance] classical.prop_decidable
/-
Lemmas from that file were hidden in my course, or restating things which
were proved without name in previous files.
-/
notation `|`x`|` := abs x
-- The mathlib version is unusable bec... |
0ffe984c20b7449dbff3119380b02bc0666600ee | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/analysis/normed_space/linear_isometry.lean | 7e87a92a9ae3767b789a8da418097f2f64635e33 | [
"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 | 38,061 | lean | /-
Copyright (c) 2021 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov, Frédéric Dupuis, Heather Macbeth
-/
import analysis.normed.group.basic
import topology.algebra.module.basic
import linear_algebra.basis
/-!
# (Semi-)linear isometrie... |
406de00ab78ae59543ff95d802528adb9f27756c | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/category_theory/preadditive/opposite.lean | 0be0768deac16710c54de4a56bb51cc85170381c | [
"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 | 910 | lean | /-
Copyright (c) 2021 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.preadditive
import data.equiv.transfer_instance
/-!
# If `C` is preadditive, `Cᵒᵖ` has a natural preadditive structure.
-/
open opposite
na... |
aea3e1dc74bbe1e1b56d75e86e79d5c0552c44d0 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/combinatorics/simple_graph.lean | 080b79bc883e99c775241cdfcff97c8472e81ffb | [
"Apache-2.0"
] | permissive | lacker/mathlib | f2439c743c4f8eb413ec589430c82d0f73b2d539 | ddf7563ac69d42cfa4a1bfe41db1fed521bd795f | refs/heads/master | 1,671,948,326,773 | 1,601,479,268,000 | 1,601,479,268,000 | 298,686,743 | 0 | 0 | Apache-2.0 | 1,601,070,794,000 | 1,601,070,794,000 | null | UTF-8 | Lean | false | false | 6,317 | lean | /-
Copyright (c) 2020 Aaron Anderson, Jalex Stark, Kyle Miller. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Aaron Anderson, Jalex Stark, Kyle Miller.
-/
import data.fintype.basic
import data.sym2
/-!
# Simple graphs
This module defines simple graphs on a vertex type... |
3e2515b4e3cc91ca662c1170a7ac17d06bf2b7bf | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/lake/test/globs/lakefile.lean | 3b06bb167f3a149e824a0dbdcfc8136509dca0f6 | [
"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 | 111 | lean | import Lake
open Lake DSL
package test
@[default_target]
lean_lib Test {
globs := #[.submodules "Test"]
}
|
a545aa16005982b17b7d215a46d3539ef366f879 | 83bd3c3824dd952c0fef702bace6c34c78226af8 | /library/init/meta/interactive.lean | 72fcff3f1355373cf16e027d8d66385ebb02ebdc | [
"Apache-2.0"
] | permissive | heruix/lean | cb0767295dc8cdfa2892601f04d3954606e81e03 | 39270fd46f49fecb30649f5ec527da7bbd4cdb13 | refs/heads/master | 1,611,580,745,403 | 1,519,814,958,000 | 1,519,843,130,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 68,157 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.meta.tactic init.meta.rewrite_tactic init.meta.simp_tactic
import init.meta.smt.congruence_closure init.category.combinators
import init... |
4e4d81cb85646553aa4efa3b9dece5c63722dc77 | 9b9a16fa2cb737daee6b2785474678b6fa91d6d4 | /src/data/analysis/topology.lean | e324fcc8984f7fb1e44db53ddde77f023e89fc9d | [
"Apache-2.0"
] | permissive | johoelzl/mathlib | 253f46daa30b644d011e8e119025b01ad69735c4 | 592e3c7a2dfbd5826919b4605559d35d4d75938f | refs/heads/master | 1,625,657,216,488 | 1,551,374,946,000 | 1,551,374,946,000 | 98,915,829 | 0 | 0 | Apache-2.0 | 1,522,917,267,000 | 1,501,524,499,000 | Lean | UTF-8 | Lean | false | false | 8,420 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
Computational realization of topological spaces (experimental).
-/
import topology.basic data.analysis.filter
open set
open filter (hiding realizer)
/-- A `ctop α σ` i... |
c4c466d97de136b53ae32030bd0bff51a67d95f4 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/multiset/sections_auto.lean | 82197d61854d084a1cc938cac065f904c9d91aef | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,937 | lean | /-
Copyright (c) 2018 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Johannes Hölzl
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.multiset.basic
import Mathlib.PostPort
universes u_1
namespace Mathlib
/-!
# Sectio... |
30e7add10e71a424677c0f1af48cde4c323a7757 | 1dd482be3f611941db7801003235dc84147ec60a | /src/order/conditionally_complete_lattice.lean | bf2d0df64bdee988e2a5747efd5fda6fe759e030 | [
"Apache-2.0"
] | permissive | sanderdahmen/mathlib | 479039302bd66434bb5672c2a4cecf8d69981458 | 8f0eae75cd2d8b7a083cf935666fcce4565df076 | refs/heads/master | 1,587,491,322,775 | 1,549,672,060,000 | 1,549,672,060,000 | 169,748,224 | 0 | 0 | Apache-2.0 | 1,549,636,694,000 | 1,549,636,694,000 | null | UTF-8 | Lean | false | false | 33,507 | lean | /-
Copyright (c) 2018 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
Adapted from the corresponding theory for complete lattices.
Theory of conditionally complete lattices.
A conditionally complete lattice is a lattice in which ev... |
8695b8e558ffe68ca59eda234cc9d4707e0117ce | 8e6cad62ec62c6c348e5faaa3c3f2079012bdd69 | /src/data/set/basic.lean | 5fb79055a119ebe523a4c168bb828766d94ec10c | [
"Apache-2.0"
] | permissive | benjamindavidson/mathlib | 8cc81c865aa8e7cf4462245f58d35ae9a56b150d | fad44b9f670670d87c8e25ff9cdf63af87ad731e | refs/heads/master | 1,679,545,578,362 | 1,615,343,014,000 | 1,615,343,014,000 | 312,926,983 | 0 | 0 | Apache-2.0 | 1,615,360,301,000 | 1,605,399,418,000 | Lean | UTF-8 | Lean | false | false | 101,781 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura
-/
import logic.unique
import order.boolean_algebra
/-!
# Basic properties of sets
Sets in Lean are homogeneous; all their elements have the same type... |
02c828674dd425aba85c39a23e37c7e3c4f05b99 | 9028d228ac200bbefe3a711342514dd4e4458bff | /src/algebra/ordered_ring.lean | 0ea3197d43f794cd01aa80554c79210149cc97f2 | [
"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 | 42,882 | 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 old_structure_cmd true
universe u
variable {α : Type u}
/-- An `ordered_semiring α` is a s... |
512a5254405f9d9503a4c5fb5068d9211290f59d | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/data/set/lattice.lean | c1af1f9a67f31e4909c0884dcdda9574fd27fbc9 | [
"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 | 61,281 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Johannes Hölzl, Mario Carneiro
-/
import data.nat.basic
import order.complete_boolean_algebra
import order.directed
import order.galois_connection
/-!... |
bf6b7c210d6cf9af493b00239b0e24a4edd02bce | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/control/equiv_functor.lean | c170678acb5e44a93a54e02b9c0c510d89ae1538 | [
"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 | 3,317 | 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 category_theory.category.basic
import data.equiv.functor
/-!
# Functions functorial with respect to equivalences
An `equiv_functor` is a function from `Type ... |
41ccc1d7e0b76ead81d7eff0e6b7658a569327d4 | 041929c569a4eeeafb4efdddab8a644f6df383c5 | /src/mazes/gcd_maze/level2077.lean | 75d88310fd928ba344f967668ab44a8b611c3aac | [] | no_license | kbuzzard/xena-maze-game | 30ffbe956762dd6603e74efd823d375649e037c3 | 098454dd6acc4c06beccf52b6547bf4cd99cc581 | refs/heads/master | 1,670,840,300,174 | 1,598,554,198,000 | 1,598,554,198,000 | 290,856,036 | 4 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 625 | lean | -- import the definition of the gcd maze
import mazes.gcd_maze.definition
import data.int.gcd
open maze direction
/-
# Bezout's Theorem Example maze.
You are in a maze of integers, all distinct.
You can go north, south east or west.
North adds 20 to your integer, South subtracts 20.
East adds 77 to your integer, ... |
01f1277b87e7b9af91d77c354fb32886dc86aa10 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /stage0/src/Init/Util.lean | 8a8bb7c0941500eefe54031340ed60fc0171f79e | [
"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,672 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import Init.Data.String.Basic
import Init.Data.ToString.Basic
universe u v
/- debugging helper functions -/
@[neverExtract, extern "lean_dbg_trace"... |
29146c6e73ff9c14b6dbd34ca2b2f03b71658db4 | 3984ab8555ab1e1084e22ef652544acdfc231f27 | /src/v0.1/helpers.lean | 8dc9cdd8a3640a3334b55e06d6eeaa4ae141594a | [] | no_license | mrakgr/CFR-in-Lean | a35c7a478795cc794cc0caff3199cf28c8ee5448 | 720a3260297bcc158e08833d38964450dcaad2eb | refs/heads/master | 1,598,515,917,940 | 1,572,612,355,000 | 1,572,612,355,000 | 217,296,108 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,321 | lean | import data.rat
private def array.init.template {α : Type*} (f : nat -> α)
: ∀ (up down : nat) (ar : array down α), array (down + up + 1) α
| 0 down ar := ar.push_back (f down)
| (up + 1) down ar :=
by {
have : down + (up + 1) + 1 = down + 1 + up + 1, by ring,
rw this,
from array.ini... |
4cbc39f6368d6a2242154bdbc6ddd4edb0dc0800 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/lean/run/meta1.lean | dc805be8f190a17d6c7c263e7b339f7d47b73a1e | [
"Apache-2.0"
] | permissive | mhuisi/lean4 | 28d35a4febc2e251c7f05492e13f3b05d6f9b7af | dda44bc47f3e5d024508060dac2bcb59fd12e4c0 | refs/heads/master | 1,621,225,489,283 | 1,585,142,689,000 | 1,585,142,689,000 | 250,590,438 | 0 | 2 | Apache-2.0 | 1,602,443,220,000 | 1,585,327,814,000 | C | UTF-8 | Lean | false | false | 5,423 | lean | import Init.Lean.Meta
open Lean
open Lean.Meta
def tstInferType (mods : List Name) (e : Expr) : IO Unit :=
do env ← importModules $ mods.map $ fun m => {module := m};
match inferType e { currRecDepth := 0, maxRecDepth := 100000 } { env := env } with
| EStateM.Result.ok type s => IO.println (toString e ++ " : "... |
fdaf95be0e77788a228fca1667827813a56d3e10 | 0003047346476c031128723dfd16fe273c6bc605 | /src/topology/constructions.lean | b9c2057ad68bf87a77c1a7074937f053386c63fb | [
"Apache-2.0"
] | permissive | ChandanKSingh/mathlib | d2bf4724ccc670bf24915c12c475748281d3fb73 | d60d1616958787ccb9842dc943534f90ea0bab64 | refs/heads/master | 1,588,238,823,679 | 1,552,867,469,000 | 1,552,867,469,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 44,423 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro, Patrick Massot
Constructions of new topological spaces from old ones: product, sum, subtype, quotient, list, vector
-/
import topology.maps topology.su... |
37066c39bb3c9eeb1f296c12beb94732a4deb4b9 | f1a12d4db0f46eee317d703e3336d33950a2fe7e | /common/ldq.lean | 2eb64e6183196bc1508c7a40a21ef89e8cb9dcad | [
"Apache-2.0"
] | permissive | avigad/qelim | bce89b79c717b7649860d41a41a37e37c982624f | b7d22864f1f0a2d21adad0f4fb3fc7ba665f8e60 | refs/heads/master | 1,584,548,938,232 | 1,526,773,708,000 | 1,526,773,708,000 | 134,967,693 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 12,698 | lean | import .nnf .dnf
variables {α β : Type}
open atom_type list
lemma exp_I_list_conj [atom_type α β] (xs : list β) : ∀ (ps : list (fm α)),
I (list_conj ps) xs = list.all_true (list.map (λ p, I p xs) ps)
| [] :=
begin
apply @eq.trans _ _ true, refl,
apply eq.symm, rewrite eq_true,
apply list.all_true_... |
2c4cd2924ac10430f41a5663fde2972211e2bd42 | 37683ecbb27d7c2037bfd9ad7e06d662f460a005 | /homotopy/smash.hlean | bd03efc6d8b6e78d0d0774a274899826d8466a32 | [
"Apache-2.0"
] | permissive | GRSEB9S/Spectral-1 | b2443b09cae7aac1247b1f88c846c532ac802b8e | dd14277e0bfc6270a488eb3b9ec231484065b9d8 | refs/heads/master | 1,631,315,269,407 | 1,522,048,315,000 | 1,522,799,803,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 57,207 | hlean | -- Authors: Floris van Doorn
import homotopy.smash types.pointed2 .pushout homotopy.red_susp ..pointed
open bool pointed eq equiv is_equiv sum bool prod unit circle cofiber prod.ops wedge is_trunc
function red_susp unit
/- To prove: Σ(X × Y) ≃ ΣX ∨ ΣY ∨ Σ(X ∧ Y) (notation means suspension, wedge, smash) -/
... |
434c33e3beca81403ec97bbb3776a51c008152b5 | fddcf4b659baa121761c71be606b3f74b86fa695 | /Formalization/regExp.lean | 1c2879a13b2a92518addc0a8a4c3de17fd2d74c2 | [] | no_license | swarnpriya/Lean | 4218df9392f396cd7e5e745de35a917536ebd2bb | a0a9978fd058041eb1a09aec0e2dd7d19a7436a7 | refs/heads/master | 1,595,831,634,399 | 1,568,673,127,000 | 1,568,673,127,000 | 208,903,604 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 136 | lean | /- global declaration where Sigma is a Type. These
variable remain in scope until the end of the file. -/
variable (Sigma : Type)
|
ae05e4654c0401c02afa04c0766328404fdc7e15 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/sum_auto.lean | 01fc48a4c62f3c289406aca06683179dffed1e05 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 11,515 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Yury G. Kudryashov
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.logic.function.basic
import Mathlib.PostPort
universes u_1 u_2 u v w x... |
26564c41b72534fc0d60aea17091947947a3d702 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/data/mv_polynomial/variables.lean | 264a053a6869c083bd5e4f6eb2d37ea53b56a5b8 | [
"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 | 24,362 | 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, Johan Commelin, Mario Carneiro
-/
import algebra.big_operators.order
import data.mv_polynomial.monad
import data.set.pairwise
/-!
# Degrees and variables of polynomial... |
21783eddbb0044d70126c00bbbf62008070adc10 | 367134ba5a65885e863bdc4507601606690974c1 | /src/category_theory/monoidal/limits.lean | f5075904033ee5c8e9c257e0ccd07221c8baeda3 | [
"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,846 | 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 category_theory.monoidal.functorial
import category_theory.monoidal.functor_category
import category_theory.limits.limits
/-!
# `lim : (J ⥤ C) ⥤ C` is lax mon... |
04799680a19de07d006e1ada0b0c04176cc6e3f1 | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/analysis/convex/integral.lean | d132f6859851e8cdc02e4e9b20867332b94fc14b | [
"Apache-2.0"
] | permissive | hikari0108/mathlib | b7ea2b7350497ab1a0b87a09d093ecc025a50dfa | a9e7d333b0cfd45f13a20f7b96b7d52e19fa2901 | refs/heads/master | 1,690,483,608,260 | 1,631,541,580,000 | 1,631,541,580,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,741 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov
-/
import analysis.convex.combination
import measure_theory.integral.set_integral
/-!
# Jensen's inequality for integrals
In this file we prove four theorems:
... |
cd92c62d90899f642e9232a74334acd7b9b55aa5 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/analysis/normed_space/riesz_lemma.lean | d34b2a536b3fc9c3d4ed6bbd41bd65804c370591 | [
"Apache-2.0"
] | permissive | gebner/mathlib | eab0150cc4f79ec45d2016a8c21750244a2e7ff0 | cc6a6edc397c55118df62831e23bfbd6e6c6b4ab | refs/heads/master | 1,625,574,853,976 | 1,586,712,827,000 | 1,586,712,827,000 | 99,101,412 | 1 | 0 | Apache-2.0 | 1,586,716,389,000 | 1,501,667,958,000 | Lean | UTF-8 | Lean | false | false | 2,365 | lean | /-
Copyright (c) 2019 Jean Lo. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean Lo
-/
import analysis.normed_space.basic
import topology.metric_space.hausdorff_distance
/-!
# Riesz's lemma
Riesz's lemma, stated for a normed space over a normed field: for any
clos... |
75dbf758002923a415eec4a7fdb5ff82401c95b2 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /library/init/meta/format.lean | 153bb1bf1bab70fb9c611b0eae5341fa4114655e | [
"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 | 5,729 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.meta.options
universe variables u v
inductive format.color
| red | green | orange | blue | pink | cyan | grey
meta_constant format : ... |
504166db8da6d0e7e10cc8454e8f2f1337ff1bc0 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebra/category/GroupWithZero.lean | 78d5646203052ac558d3bba79b94a9b642e07e80 | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 2,038 | lean | /-
Copyright (c) 2022 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies
-/
import algebra.category.Group.basic
import category_theory.category.Bipointed
/-!
# The category of groups with zero
This file defines `GroupWithZero`, the category of ... |
ae915fc08f48a349237a2f3fa765b7640899b9e6 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/1182.lean | bf91d9167b8735d7c0c700a63b1c0a6ba042451e | [
"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,343 | lean | example: ¬ n + 1 = n := λ h => nomatch h
inductive Term (L: Nat → Type) (n : Nat) : Nat → Type _
| var (k: Fin n) : Term L n 0
| func (f: L l) : Term L n l
| app (t: Term L n (l + 1)) (s: Term L n 0): Term L n l
namespace Term
inductive SubTermOf: Term L n l₁ ... |
3c8074297a45d4a7a9fea4bfe857931b0dbf1afe | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/algebra/iterate_hom.lean | 97d0b549e167028693151ff0a8ac989b078fc9ba | [
"Apache-2.0"
] | permissive | ilitzroth/mathlib | ea647e67f1fdfd19a0f7bdc5504e8acec6180011 | 5254ef14e3465f6504306132fe3ba9cec9ffff16 | refs/heads/master | 1,680,086,661,182 | 1,617,715,647,000 | 1,617,715,647,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,842 | 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 algebra.group_power
import logic.function.iterate
import group_theory.perm.basic
/-!
# Iterates of monoid and ring homomorphisms
Iterate of a monoid/ring ... |
dadfeaa546d86119753e0b1fe8263a689124cf68 | 367134ba5a65885e863bdc4507601606690974c1 | /src/ring_theory/power_series/basic.lean | e131014d1148b17a7724ac603e55ddf7213b9568 | [
"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 | 64,398 | lean | /-
Copyright (c) 2019 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Kenny Lau
-/
import data.mv_polynomial
import linear_algebra.std_basis
import ring_theory.ideal.operations
import ring_theory.multiplicity
import ring_theory.algebra_to... |
13088fe3bacf806a51d1850bf892a89797de9411 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/group_theory/schur_zassenhaus.lean | ddc8d4688c836dfbff03b60750215c88a89e7b71 | [
"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 | 14,709 | 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.sylow
import group_theory.transfer
/-!
# The Schur-Zassenhaus Theorem
In this file we prove the Schur-Zassenhaus theorem.
## Main results
-... |
c84cb01420c3d9b1c7c7ccc84b58f80ef5de3bd0 | 79cc757e5e5b09c7a522f717a6c490d321d36469 | /src/instructor/lectures/lecture_8.lean | d3c11a94de16c450d1b99394754769a7eb81836f | [] | no_license | LukeMathe/cs2120f21 | 534c3b8868dcfdea98a9d22513180c8a062794c6 | d51940b174569a8782e62ae027b108b5f099a9aa | refs/heads/main | 1,693,418,664,935 | 1,634,585,653,000 | 1,634,585,653,000 | 403,762,076 | 0 | 0 | null | 1,630,963,485,000 | 1,630,963,485,000 | null | UTF-8 | Lean | false | false | 4,441 | lean | /-
The or connective, ∨, in predicate logic
join any two propositions, P, Q, into a
larger proposition, P ∨ Q. This proposition
is judged as true if either (or both) P, Q
are true.
-/
/-
Introduction rules (two of them).
There are two ways to prove a proposition,
(P ∨ Q): with a proof of P, or with a proof
of Q. Eith... |
b851ab8a989bc4bcabafc56ab185bfd8a2aed7d4 | a9fe717b93ccfa4b2e64faeb24f96dfefb390240 | /tactic.lean | 35a536ac1e4a55646bf25d26002ed87ec8daead8 | [] | no_license | skbaek/omega | ab1f4a6daadfc8c855f14c39d9459ab841527141 | 715e384ed14e8eb177a326700066e7c98269e078 | refs/heads/master | 1,588,000,876,352 | 1,552,645,917,000 | 1,552,645,917,000 | 174,442,914 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 251 | lean | open tactic
meta def revert_cond (t : expr → tactic bool) (x : expr) : tactic unit :=
mcond (t x) (revert x >> skip) skip
meta def revert_cond_all (t : expr → tactic bool) : tactic unit :=
do hs ← local_context, mmap (revert_cond t) hs, skip
|
ca1e17c51852789b0115e4f066504a4a91c08d33 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/run/smt_ematch3.lean | 6c19ec3c8a2d5fcc6517d3f69397654fa2d5e4e4 | [
"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 | 1,544 | lean | namespace Ex
open nat
notation `⟦`:max a `⟧`:0 := cast (by simp) a
inductive vector (α : Type) : nat → Type
| nil {} : vector 0
| cons : Π {n}, α → vector n → vector (succ n)
namespace vector
local attribute [simp] add_succ succ_add add_comm
variable {α : Type}
def app : Π {n m : nat}, vector α n → vector α m → v... |
48e1111ccf7f583cf06cb9b62240c909a96910ce | 6dacdff2020860f2468bb8dacf344e6b043d6a78 | /cap/src/demo_functions.lean | ac3ba80e06a0c940735f63aac13cfc5c3e6626ae | [] | no_license | alexjbest/talks | 514ca57af312a14cf68c30efa1c7228294edc190 | 84976b4329ea768c754da72cc15d5ce29332466d | refs/heads/master | 1,686,993,465,308 | 1,686,315,975,000 | 1,686,315,975,000 | 16,347,963 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 631 | lean | import data.nat.basic
def f (n : ℕ) : ℕ := n + 1
def --- we are making a new definition
F --- the thing we are defining is called F
(n : ℕ) --- it has argument (input) a natural number called n
: ℕ --- the output type is a natural number
:= --- define the left hand side to be the right side
n + 1 ... |
9a4c3d76e3c25c4312a53619b7391e4fdf3c6429 | 02005f45e00c7ecf2c8ca5db60251bd1e9c860b5 | /src/linear_algebra/prod.lean | aa50b4766cea185fb5e35166c8f0dc0fb3a22b72 | [
"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 | 15,099 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro, Kevin Buzzard, Yury Kudryashov, Eric Wieser
-/
import linear_algebra.basic
/-! ### Products of semimodules
This file defines constructors for linear m... |
dce8cda8111d388ffdcf7c2078264d26f1234b7e | 0845ae2ca02071debcfd4ac24be871236c01784f | /tests/bench/unionfind.lean | 446aa6ab69fa79d2bd33e7023501d46568bcd6d0 | [
"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 | 4,382 | lean | def StateT' (m : Type → Type) (σ : Type) (α : Type) := σ → m (α × σ)
namespace StateT'
variables {m : Type → Type} [Monad m] {σ : Type} {α β : Type}
@[inline] protected def pure (a : α) : StateT' m σ α := fun s => pure (a, s)
@[inline] protected def bind (x : StateT' m σ α) (f : α → StateT' m σ β) : StateT' m σ β := fu... |
57980b72ce63ee7fdb14124414bfbb8438ba542e | 4f643cce24b2d005aeeb5004c2316a8d6cc7f3b1 | /src/for_mathlib/equiv.lean | e8820c3b94666cb49613ee899b4c73fe1db3a862 | [] | no_license | rwbarton/lean-omin | da209ed061d64db65a8f7f71f198064986f30eb9 | fd733c6d95ef6f4743aae97de5e15df79877c00e | refs/heads/master | 1,674,408,673,325 | 1,607,343,535,000 | 1,607,343,535,000 | 285,150,399 | 9 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 412 | lean | import tactic.equiv_rw
import data.equiv.basic
variables {α β : Sort*}
lemma equiv.exists_congr_left' {p : α → Prop} (f : α ≃ β) :
(∃x, p x) ↔ (∃y, p (f.symm y)) :=
⟨λ ⟨x, h⟩, ⟨f x, by rwa f.symm_apply_apply⟩, λ ⟨y, h⟩, ⟨f.symm y, h⟩⟩
lemma equiv.exists_congr_left {p : β → Prop} (f : α ≃ β) :
(∃x, p (f x)) ↔ (∃y... |
c71f8f081748e9a9d9b1e20542cd9084439ec8e7 | 618003631150032a5676f229d13a079ac875ff77 | /test/lint_coe_to_fun.lean | 0d1fede7a0557de27d0aa7a8b7683f633cb3d045 | [
"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 | 783 | lean | import tactic.lint
-- see Note [function coercion]
structure equiv (α β : Sort*) :=
(to_fun : α → β)
(inv_fun : β → α)
instance {α β} : has_coe_to_fun (equiv α β) :=
⟨λ _, α → β, equiv.to_fun⟩
structure sparkling_equiv (α β) extends equiv α β
instance {α β} : has_coe (sparkling_equiv α β) (equiv α β) :=
⟨sparkling... |
00569edf73a7cf789af4d7af1cc13d44f18a3872 | 0c1546a496eccfb56620165cad015f88d56190c5 | /tests/lean/run/smt_tests.lean | 1247ff3e4d4f24d8c6c7ea97db11e73b789731e1 | [
"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 | 1,570 | lean | attribute [pre_smt] add_zero zero_add mul_one one_mul
constant p : nat → nat → Prop
constants a b : nat
constant h : p (a + 1 * b + 0) (a + b)
open tactic smt_tactic
def ex : p (a + b) (a + b) :=
begin [smt]
do {
h ← to_expr `(h),
t ← infer_type h,
(new_t, he) ← preprocess t, -- use smt_tactic pr... |
556d8fdd9a7956b809bd060d7036729b8eb4ccc7 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/compiler/closure_bug8.lean | eb80aa24f4aade5f7188e8bbd48d520d55bafdbb | [
"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 | 503 | lean | def f (x : Nat) : Nat × (Nat → String) :=
let x1 := x + 1;
let x2 := x + 2;
let x3 := x + 3;
let x4 := x + 4;
let x5 := x + 5;
let x6 := x + 6;
let x7 := x + 7;
let x8 := x + 8;
let x9 := x + 9;
let x10 := x + 10;
let x11 := x + 11;
let x12 := x + 12;
let x13 := x + 13;
let x14 := x + 14;
let x15 := x + 15;
let x16 := ... |
54b8da74cae2e41dc1bb990e5c93986ef1bb5e59 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/interactive/1265.lean | 6cc27159a416b8fc873315ea36c95f9d70a09a29 | [
"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 | 262 | lean | example (id : Lean.Syntax.Ident) : Lean.Name := id.
--^ textDocument/completion
example (id : Lean.TSyntax `ident) : Lean.Name := id.
--^ textDocument/completion
|
839125e3a69763395d1b104096e5022c0fb5d2d0 | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/lua11.lean | 3c913a025c1816c1db1ef2a6ba940d835c8c2ae0 | [
"Apache-2.0"
] | permissive | codyroux/lean0.1 | 1ce92751d664aacff0529e139083304a7bbc8a71 | 0dc6fb974aa85ed6f305a2f4b10a53a44ee5f0ef | refs/heads/master | 1,610,830,535,062 | 1,402,150,480,000 | 1,402,150,480,000 | 19,588,851 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,181 | lean | import Int.
(*
local env = get_environment()
local o1 = env:find_object(name("Int", "add"))
print(o1:get_value())
assert(is_kernel_object(o1))
assert(o1)
assert(o1:is_builtin())
assert(o1:keyword() == "builtin")
assert(o1:get_name() == name("Int", "add"))
local o2 = env:find_object("xyz31213")
assert(not o... |
e5166c30092ad1c7085e617a656baba6e89a606a | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/combinatorics/composition.lean | a4ae06eecc2a8b405ebc782c50f57fd904dba3b8 | [
"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 | 34,370 | lean | /-
Copyright (c) 2020 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import data.fintype.card
import data.finset.sort
import tactic.omega
/-!
# Compositions
A composition of an integer `n` is a decomposition `n = i₀ + ... + i_{... |
b76a86deaa0ad52b23459dc893eb286724d46466 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/order/rel_classes.lean | 7043bfe43d5fba1f5a37c0e9a2c84b04a9c31429 | [
"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 | 17,362 | lean | /-
Copyright (c) 2020 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Mario Carneiro, Yury G. Kudryashov
-/
import data.set.basic
/-!
# Unbundled relation classes
In this file we prove some properties of `is_*` classes defined in `init.al... |
5a0dc0ebae74b9bab385b89b409dd4b644c976e6 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/linear_algebra/dimension.lean | 0cbb22c2e9ce9eea5e88f1b81ac2145618b9708c | [
"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 | 53,076 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Johannes Hölzl, Sander Dahmen, Scott Morrison
-/
import linear_algebra.dfinsupp
import linear_algebra.invariant_basis_number
import linear_algebra.isomorphisms
import l... |
d43569cd7199d7ba9c1ce6330159fc0a3780b50e | 5ae26df177f810c5006841e9c73dc56e01b978d7 | /src/data/option/basic.lean | 5a5ff536f25813e116f996a58dd5fdfae1f07f7e | [
"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 | 5,843 | 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 logic.basic data.bool data.option.defs tactic.basic
namespace option
variables {α : Type*} {β : Type*} {γ : Type*}
@[simp] theorem get_mem : ∀ {o : option α}... |
bfca7dfc9bbbd9204f7666be625923e0f86465f8 | 6ae186a0c6ab366b39397ec9250541c9d5aeb023 | /src/category_theory/full_subcategory_2.lean | b75d5b6d4fd19868ba91d1775fda92a9250101fc | [] | no_license | ThanhPhamPhuong/lean-category-theory | 0d5c4fe1137866b4fe29ec2753d99aa0d0667881 | 968a29fe7c0b20e10d8a27e120aca8ddc184e1ea | refs/heads/master | 1,587,206,682,489 | 1,544,045,056,000 | 1,544,045,056,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,558 | lean | -- -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- -- Released under Apache 2.0 license as described in the file LICENSE.
-- -- Authors: Scott Morrison
-- import category_theory.functor
-- import category_theory.embedding
-- import category_theory.tactics.obviously
-- namespace category_theory
-- univ... |
397d146b98a24f66611200ec766f01ececaf79e0 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/interactive/editCompletion.lean | cafa9b2d176229ef0324fb73850517aca472c24f | [
"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 | 136 | lean | structure Foo where
foo : Nat
example (f : Foo) : f
--^ insert: .
--^ textDocument/completion
|
d70866b696c9cd3ce78c824149cad8c32984c68a | 94e33a31faa76775069b071adea97e86e218a8ee | /src/linear_algebra/matrix/determinant.lean | bf35e7d5bf4abd503acffea9d919bcba289156bd | [
"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 | 31,700 | 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, Tim Baanen
-/
import data.matrix.pequiv
import data.matrix.block
import data.fintype.card
import group_theory.perm.fin
import group_theory.perm.sign
import algebra.... |
fa474a189e4fd707cd20e9c1988d4c53aa09a135 | 92b50235facfbc08dfe7f334827d47281471333b | /library/algebra/group.lean | 9e68e68b9b0319efc31075eada8d84c8fae630fd | [
"Apache-2.0"
] | permissive | htzh/lean | 24f6ed7510ab637379ec31af406d12584d31792c | d70c79f4e30aafecdfc4a60b5d3512199200ab6e | refs/heads/master | 1,607,677,731,270 | 1,437,089,952,000 | 1,437,089,952,000 | 37,078,816 | 0 | 0 | null | 1,433,780,956,000 | 1,433,780,955,000 | null | UTF-8 | Lean | false | false | 20,246 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura
Various multiplicative and additive structures. Partially modeled on Isabelle's library.
-/
import logic.eq data.unit data.sigma data.prod
import alge... |
7a6ffb6bf39e6749fbd0b6587f8e495e15de50d5 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/tactic/omega/default.lean | 418121987f964a9714803aadc92a326e7063f4c4 | [] | 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 | 137 | lean | import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.tactic.omega.main
import Mathlib.PostPort
namespace Mathlib
|
aec465b7139242ef97f895abbb1a6d1c4a391d9a | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Meta/Tactic/Apply.lean | 06dfdaa85815589470c4cff84bad17092b33b824 | [
"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 | 9,758 | 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.Util.FindMVar
import Lean.Meta.SynthInstance
import Lean.Meta.CollectMVars
import Lean.Meta.Tactic.Util
namespace Lean.Meta
/-- Controls which ... |
4e355b45244bf00f859aca468bfe10a5d4f8bf32 | ea5678cc400c34ff95b661fa26d15024e27ea8cd | /exponential.lean | 3f983f1bbc8ea9ccda8eac31f487b19779cb270c | [] | no_license | ChrisHughes24/leanstuff | dca0b5349c3ed893e8792ffbd98cbcadaff20411 | 9efa85f72efaccd1d540385952a6acc18fce8687 | refs/heads/master | 1,654,883,241,759 | 1,652,873,885,000 | 1,652,873,885,000 | 134,599,537 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,907 | lean | import data.real.basic tactic.norm_num data.nat.basic data.complex algebra.big_operators data.set.finite tactic.ring
open real nat
noncomputable theory
local attribute [instance, priority 0] classical.prop_decidable
universe u
lemma pow_inv' {α : Type u} [discrete_field α] (a : α) (n : ℕ) : (monoid.pow a n)⁻¹ = monoid... |
00891b14c1b0d9f24b4467c1a49cf53ae6da4f7d | e8d53a7b78545d183a23dd7bd921bc7ff312989f | /types/pi.hlean | cdf1aa77dabbab61f8b0aeb84be21c8dcb01dd38 | [] | no_license | Sumit0730/Impredicative | 857007626592440a27cf4440aa9a226d0ede7f3e | a75cb9989a684133d31d4889a746ee4fa7b66cea | refs/heads/master | 1,631,994,804,745 | 1,531,980,761,000 | 1,531,980,761,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 14,252 | hlean | /-
Copyright (c) 2014-15 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 pi-types (dependent function spaces)
-/
import types.sigma arity cubical.square
open eq equiv is_equiv funext sigm... |
687cb96ca7b7064b65d0da353ced1b82307e6955 | 1437b3495ef9020d5413178aa33c0a625f15f15f | /category_theory/isomorphism.lean | 03afce39886a3bf613ef623ab5a926209532c803 | [
"Apache-2.0"
] | permissive | jean002/mathlib | c66bbb2d9fdc9c03ae07f869acac7ddbfce67a30 | dc6c38a765799c99c4d9c8d5207d9e6c9e0e2cfd | refs/heads/master | 1,587,027,806,375 | 1,547,306,358,000 | 1,547,306,358,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,423 | lean | -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Tim Baumann, Stephen Morgan, Scott Morrison
import category_theory.functor
universes v u -- declare the `v`'s first; see `category_theory.category` for an explanation
namespac... |
b5ea61113fc5f238ddaf2d4c71e986a3bb9e95ff | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/number_theory/bernoulli.lean | a7d637fb0507a3b75006c4eb10c167327791dca2 | [
"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 | 16,962 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Kevin Buzzard
-/
import data.rat
import data.fintype.card
import algebra.big_operators.nat_antidiagonal
import ring_theory.power_series.well_known
/-!
# Bernoulli numb... |
6a08920d6e2f3fc44391cd04c80414ca1a8f234b | 9176e85d4f4a2f67a3b138db972c120216e6a384 | /src/set.lean | f98284add4212460c677df37ba81b9e1c88a9258 | [] | no_license | JasonKYi/funWithLean4 | 397c97bc6a2af6eb10a4d14fd6982086166170d7 | c00cff02380e83253cc5c9f36e25b1a4e445ef09 | refs/heads/main | 1,677,044,878,763 | 1,610,147,748,000 | 1,610,147,748,000 | 328,010,812 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,948 | lean | theorem impNot {p q : Prop} : p → ¬ q ↔ ¬ (p ∧ q) :=
⟨ λ hpq h => hpq h.1 h.2, λ h hp hq => h <| And.intro hp hq ⟩
theorem Exists.impNot {p q : α → Prop} : (∃ x, p x → ¬ q x) ↔ ∃ x, ¬ (p x ∧ q x) := by
apply Iff.intro
intro h
cases h with | intro x hx =>
{ exact ⟨ x, λ hs => hx hs.1 hs.2 ⟩ }
intro h
... |
61c857a35399b8a6ae70fb7c89f43941d6ad7c7d | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/fin_enum.lean | d8119788da8e065c8f1771a6e1a7413ca2807e41 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 8,925 | lean | /-
Copyright (c) 2019 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
-/
import control.monad.basic
import data.fintype.basic
import data.list.prod_sigma
/-!
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corres... |
417c963f30d361af50bc8133ffbf8b36950f3043 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/red.lean | 3db428b718fdda0ed3d7c8b167e66888612889d6 | [
"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 | 432 | lean | constant g : nat → nat
definition f := g
example : f = g := rfl
attribute f [irreducible]
example : f = g := rfl -- Error
example (a : nat) (H : a = g a) : f a = a :=
eq.subst H rfl -- Error
attribute f [semireducible]
example (a : nat) (H : a = g a) : f a = a :=
eq.subst H rfl -- Error
example : f = g := rfl
... |
3935af57a306bcf6e13915d7f409c5fcd4e205da | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/algebra/category/Module/limits.lean | 18105eeb1f51b244b55d5f10e0787d4d39498b54 | [
"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 | 6,881 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import algebra.category.Module.basic
import algebra.category.Group.limits
import algebra.direct_limit
/-!
# The category of R-modules has all limits
Further, these ... |
2e7b081c5eb5e5f6c1a2c5c88c719b8b5c48d2c4 | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /hott/types/pi.hlean | 040d60f4e5471e5dedd40c49fb968ce44bc3b66c | [
"Apache-2.0"
] | permissive | chubbymaggie/lean | 0d06ae25f9dd396306fb02190e89422ea94afd7b | d2c7b5c31928c98f545b16420d37842c43b4ae9a | refs/heads/master | 1,611,313,622,901 | 1,430,266,839,000 | 1,430,267,083,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,396 | hlean | /-
Copyright (c) 2014 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: types.pi
Author: Floris van Doorn
Ported from Coq HoTT
Theorems about pi-types (dependent function spaces)
-/
import types.sigma
open eq equiv is_equiv funext
namespace pi
vari... |
316888c7efde29d5fc4dacb38ab4af3aba37e77c | bd30db067473b7b7ccac89486f0faf854379c3f8 | /mm_validity.lean | 9a6e1c6e8dabc83a5485c4e58affcb91fe892906 | [] | no_license | danieljmchugh/lean_arm_memory_model | e661a986f933d4868928062cb47e9d88f0316c7d | bf53a6c1509d22127f990b030d6f3ab57266dc92 | refs/heads/main | 1,687,711,084,222 | 1,626,487,537,000 | 1,626,487,537,000 | 386,810,582 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 848 | lean | -- Armv8 memory model: Ordering constraints
import mm_dependencies
/- ######################## Internal requirements ######################## -/
-- note, acyclic takes tc of the union
def internal_visibility_requirement (co : event → event → Prop) (p : program) : Prop :=
acyclic (λ e₁ e₂, e₁ ∈ p ∧ e₂ ∈ p ∧ coherenc... |
fe02db8afeae772f90cd8a872e269070dc750dc0 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /library/data/tuple.lean | 471c20b11f361194f1c29635afc695d9523ce177 | [
"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 | 13,004 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
Tuples are lists of a fixed size.
It is implemented as a subtype.
-/
import logic data.list data.fin
open nat list subtype function
definition tuple [reducibl... |
26ede10831f13eca72d40dd4067e9c6b8caa25ee | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/control/applicative_auto.lean | 82436d16eac4f59987340de872324611e4064ae8 | [] | 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 | 4,338 | lean | /-
Copyright (c) 2017 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Simon Hudon
Instances for identity and composition functors
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.control.functor
import Mathlib.algebra.group.basi... |
d1a27122096509bc536e6bdb509abb533f8a98f3 | 7da5ceac20aaab989eeb795a4be9639982e7b35a | /src/category_theory/limits/shapes/binary_products.lean | a8dbf6edbf57df1445851df8c94522f201529a65 | [
"MIT"
] | permissive | formalabstracts/formalabstracts | 46c2f1b3a172e62ca6ffeb46fbbdf1705718af49 | b0173da1af45421239d44492eeecd54bf65ee0f6 | refs/heads/master | 1,606,896,370,374 | 1,572,988,776,000 | 1,572,988,776,000 | 96,763,004 | 165 | 28 | null | 1,555,709,319,000 | 1,499,680,948,000 | Lean | UTF-8 | Lean | false | false | 1,201 | lean | -- Copyright (c) 2018 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Scott Morrison
import ...basic .products
universes v u
open category_theory
namespace category_theory.limits
@[derive decidable_eq] inductive two : Type v
| left | right
de... |
6ca539cf1d6acf2597673070c1e94049fef6c973 | ad0c7d243dc1bd563419e2767ed42fb323d7beea | /algebra/ordered_ring.lean | 03f7ccadb1c50f90b0f197daf0e02fd4994b542a | [
"Apache-2.0"
] | permissive | sebzim4500/mathlib | e0b5a63b1655f910dee30badf09bd7e191d3cf30 | 6997cafbd3a7325af5cb318561768c316ceb7757 | refs/heads/master | 1,585,549,958,618 | 1,538,221,723,000 | 1,538,221,723,000 | 150,869,076 | 0 | 0 | Apache-2.0 | 1,538,229,323,000 | 1,538,229,323,000 | null | UTF-8 | Lean | false | false | 14,062 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import order.basic algebra.order algebra.ordered_group algebra.ring
universe u
variable {α : Type u}
-- TODO: this is necessary additionally to mul_nonneg otherwise... |
c93e780d2d05bbb32761821168fa4c7e8bb27ea9 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/data/mv_polynomial/variables.lean | 0fc34df2659bcfa4f339d2f699111bcbd60e1175 | [
"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 | 22,469 | 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, Johan Commelin, Mario Carneiro
-/
import data.mv_polynomial.monad
import data.set.disjointed
/-!
# Degrees and variables of polynomials
This file establishes many re... |
f9320709ad155f7191ee258d048dbf1980a4937d | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/topology/category/Compactum.lean | a8ccb4e1c1a513e9ac7e3968ea64266697e292ab | [
"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,503 | lean | /-
Copyright (c) 2020 Adam Topaz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Adam Topaz
-/
import category_theory.monad.types
import category_theory.monad.limits
import category_theory.equivalence
import topology.category.CompHaus
import data.set.constructions
/-... |
1d8862717d49592b44f21114511737ee5eb5fd44 | 592f865bb4e2e537ae3552cb83c32fb99c8d4c68 | /src/Lemma4.lean | a01d2d9ee6deffda693bd5a93c7dc10695df70d4 | [] | no_license | BassemSafieldeen/Entropy_and_reversible_catalysis | 250dbb9446690ab89d89a6a512c8f888e09e8596 | 5dd6ee062f61e26bbcf254477e3e24aa3fc489af | refs/heads/master | 1,678,747,213,156 | 1,615,540,586,000 | 1,615,540,586,000 | 322,216,014 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,052 | lean | import to_mathlib_maybe.Hilbert_space
import entropy
import state
import Lemma3
notation `D(`ρ`,`σ`)` := 1/2 * ∥ρ - σ∥₁
notation ρ`^⊗`n := tpow ρ n
variables {ℋ : Type} [complex_hilbert_space ℋ]
{ρ ρ' : module.End ℂ ℋ} [quantum_state ρ]
[H(ρ) ≤ H(ρ')]
def dephasing_channel_in_eigenbasis (ρ : module.End ℂ ℋ) [quantu... |
9e1baac500a2a5ea90a11a60b3bfac84f6798c6a | ea5678cc400c34ff95b661fa26d15024e27ea8cd | /islanders_decidable.lean | 26070fa1b34aa37106771f319230ed1d2ab39629 | [] | no_license | ChrisHughes24/leanstuff | dca0b5349c3ed893e8792ffbd98cbcadaff20411 | 9efa85f72efaccd1d540385952a6acc18fce8687 | refs/heads/master | 1,654,883,241,759 | 1,652,873,885,000 | 1,652,873,885,000 | 134,599,537 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,215 | lean | import data.nat.prime data.finset
open nat
def island_rules : ℕ → ℕ → (ℕ → Prop)
| 0 b B := (B = b ∨ B = b - 1) ∧ B > 0
| (d + 1) b B := island_rules d b B ∧
((∀ C, island_rules d b C → C = b) ↔ ∀ C, island_rules d B C → C = B)
def island_rules2 : ℕ → ℕ → finset ℕ
| 0 b := ({b - 1, b} : finset ℕ).filter (>... |
97e1d362722deb809eeaa5b56bfb69c13faaa6b8 | 1a61aba1b67cddccce19532a9596efe44be4285f | /library/init/prod.lean | b2b0d2039eeaa5ad36d46c9b68c188b92b3acf06 | [
"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 | 3,677 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura, Jeremy Avigad
-/
prelude
import init.num init.wf
definition pair := @prod.mk
notation A × B := prod A B
-- notation for n-ary tuples
notation `(` h `,` t:(fol... |
7d2e2d987a118b6c19501c067ea0a4b5ad7f5569 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/injectionBug.lean | ff3e6d653748aff307c17ea32a53f30e40721996 | [
"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 | 632 | lean | inductive Vec (α : Type u) : Nat → Type u
| nil : Vec α 0
| cons : α → {n : Nat} → Vec α n → Vec α (n+1)
deriving DecidableEq
inductive Test (α : Type)
| mk (n : Nat) (xs : Vec α n)
def test [DecidableEq α] (x y : Test α) : Decidable (x = y) :=
match x, y with
| Test.mk n xs, Test.mk m ys => by
cases... |
2e881be358371438780937c44221fc70fd1ec0f6 | 0003047346476c031128723dfd16fe273c6bc605 | /src/data/finset.lean | 78530ae937eb0a2f87124d37417fe33115af7fcc | [
"Apache-2.0"
] | permissive | ChandanKSingh/mathlib | d2bf4724ccc670bf24915c12c475748281d3fb73 | d60d1616958787ccb9842dc943534f90ea0bab64 | refs/heads/master | 1,588,238,823,679 | 1,552,867,469,000 | 1,552,867,469,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 80,902 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura, Jeremy Avigad, Minchao Wu, Mario Carneiro
Finite sets.
-/
import logic.embedding order.boolean_algebra algebra.order_functions
data.multiset data.sigma.basi... |
60b18081e63f55961dd4f8a3f8e803869ce9bdf7 | 675b8263050a5d74b89ceab381ac81ce70535688 | /test/linarith.lean | 4cbf181ad5401e53bf78ca5c9b9f8cee87bb73f1 | [
"Apache-2.0"
] | permissive | vozor/mathlib | 5921f55235ff60c05f4a48a90d616ea167068adf | f7e728ad8a6ebf90291df2a4d2f9255a6576b529 | refs/heads/master | 1,675,607,702,231 | 1,609,023,279,000 | 1,609,023,279,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,402 | lean | import tactic.linarith
import algebra.field_power
example {α : Type} (_inst : Π (a : Prop), decidable a)
[linear_ordered_field α]
{a b c : α}
(ha : a < 0)
(hb : ¬b = 0)
(hc' : c = 0)
(h : (1 - a) * (b * b) ≤ 0)
(hc : 0 ≤ 0)
(this : -(a * -b * -b + b * -b + 0) = (1 - a) * (b * b))
(h : (1 - a) * (b * ... |
af1c5e2139b44c4c6f23c5f17506b157650ff59b | 853df553b1d6ca524e3f0a79aedd32dde5d27ec3 | /src/tactic/interactive.lean | 1135cccb78d13453e0b156b7afd7ca91009f29e9 | [
"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 | 43,521 | lean |
/-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Simon Hudon, Sebastien Gouezel, Scott Morrison
-/
import tactic.lint
open lean
open lean.parser
local postfix `?`:9001 := optional
local postfix *:9001 := many
name... |
cce52b2919e622635a3bbb0f4029d1cd871af0f3 | 78630e908e9624a892e24ebdd21260720d29cf55 | /src/logic_propositional/prop_01.lean | 47c546d18ba4928b6815af669645554a9b9d9d76 | [
"CC0-1.0"
] | permissive | tomasz-lisowski/lean-logic-examples | 84e612466776be0a16c23a0439ff8ef6114ddbe1 | 2b2ccd467b49c3989bf6c92ec0358a8d6ee68c5d | refs/heads/master | 1,683,334,199,431 | 1,621,938,305,000 | 1,621,938,305,000 | 365,041,573 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 256 | lean | namespace prop_01
variables A B : Prop
theorem prop_1 : A ∧ (A → B) → B :=
assume h1 : A ∧ (A → B),
show B, from
(have h2: A → B, from and.right h1,
have h3: A, from and.left h1,
show B, from h2 h3)
-- end namespace
end prop_01 |
8b57e6333982204cd5d9984eaab2928abd394c25 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/algebra/group/basic.lean | 98a60c28a86c370a9ddcf3c8483e76bd47f2f967 | [
"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 | 18,489 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Simon Hudon, Mario Carneiro
-/
import algebra.group.defs
import logic.function.basic
/-!
# Basic lemmas about semigroups, monoids, and groups
This f... |
4fe6403b58309eb71558e72bd6b80b6fa4c234f0 | 367134ba5a65885e863bdc4507601606690974c1 | /src/data/fintype/card.lean | 1b482b2b465f31ce66186a794aad01309576684b | [
"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 | 16,986 | 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.fintype.basic
import algebra.big_operators.ring
/-!
Results about "big operations" over a `fintype`, and consequent
results about cardinalities of certain... |
159d4f35049ea2960363be9d88c60786b9c3fed2 | 91b8df3b248df89472cc0b753fbe2bac750aefea | /experiments/lean/src/ddl/ctx.lean | 4187cfa8c5ab3bda67685c4bc8d4cfcc40874c62 | [
"Apache-2.0",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | yeslogic/fathom | eabe5c4112d3b4d5ec9096a57bb502254ddbdf15 | 3960a9466150d392c2cb103c5cb5fcffa0200814 | refs/heads/main | 1,685,349,769,736 | 1,675,998,621,000 | 1,675,998,621,000 | 28,993,871 | 214 | 11 | Apache-2.0 | 1,694,044,276,000 | 1,420,764,938,000 | Rust | UTF-8 | Lean | false | false | 371 | lean | import ddl.binder
namespace ddl
def ctx (ℓ : Type) : Type :=
list (binder ℓ)
namespace ctx
variables {ℓ : Type}
def lookup (n : ℕ) (Γ : ctx ℓ) : option (binder ℓ) :=
list.nth Γ n
def lookup_le (n : ℕ) (Γ : ctx ℓ) : n < Γ.length → binder ℓ :=
assume is_le,
list.nth_le Γ n ... |
d97ffa338d4b0d0866d972eb0710d0002da7c218 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebra/continued_fractions/computation/approximations.lean | 3dda5bacdabcc463dbd7e508ee39c9f314e0ba93 | [
"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,783 | lean | /-
Copyright (c) 2020 Kevin Kappelmann. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Kappelmann
-/
import algebra.continued_fractions.computation.correctness_terminating
import data.nat.fib
import tactic.solve_by_elim
/-!
# Approximations for Continued Fraction... |
71bfcbf7acb5e42201f57d1371c1b5d646f4baf1 | 00de0c30dd1b090ed139f65c82ea6deb48c3f4c2 | /src/tactic/norm_num.lean | 23cddbc0b6f31b0bd3a1e33a8069ebb639f83f44 | [
"Apache-2.0"
] | permissive | paulvanwamelen/mathlib | 4b9c5c19eec71b475f3dd515cd8785f1c8515f26 | 79e296bdc9f83b9447dc1b81730d36f63a99f72d | refs/heads/master | 1,667,766,172,625 | 1,590,239,595,000 | 1,590,239,595,000 | 266,392,625 | 0 | 0 | Apache-2.0 | 1,590,257,277,000 | 1,590,257,277,000 | null | UTF-8 | Lean | false | false | 61,513 | lean | /-
Copyright (c) 2017 Simon Hudon All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon, Mario Carneiro
-/
import data.rat.cast
import data.rat.meta_defs
import tactic.doc_commands
/-!
# `norm_num`
Evaluating arithmetic expressions including *, +, -, ^, ≤
-/
un... |
b1f5695c7823f385f366dd1e3609a57bd3f3b939 | 5e3548e65f2c037cb94cd5524c90c623fbd6d46a | /src_icannos_totilas/topologie-espaces-normés/cpge_ten_02b.lean | 4f91d3a5c25cc126447a869f17b9ccf52b440f64 | [] | no_license | ahayat16/lean_exos | d4f08c30adb601a06511a71b5ffb4d22d12ef77f | 682f2552d5b04a8c8eb9e4ab15f875a91b03845c | refs/heads/main | 1,693,101,073,585 | 1,636,479,336,000 | 1,636,479,336,000 | 415,000,441 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 718 | lean | import data.set.basic
import topology.basic
import algebra.module.basic
import algebra.module.submodule
import analysis.normed_space.basic
-- On désigne par p1 et p2 les applications coordonnées de R 2 définies par pi (x1 , x2 ) = xi.
-- (a) Soit O un ouvert de R 2 , montrer que p 1 (O) et p 2 (O) sont des ouvert... |
a4093d63eb843eae7d87c60061aa8c0e7b5978bc | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/geometry/manifold/basic_smooth_bundle.lean | e5f88b8fcec64b263936bd218d89bf3a812134cc | [
"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 | 31,531 | 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 bun... |
fb57c17de06bf66064ec9c7e099a26444f67af99 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/analysis/normed_space/finite_dimension_auto.lean | 42df61884eb32ed5a54b719c3b86a8cc9e1bac19 | [] | 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 | 8,216 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.analysis.normed_space.operator_norm
import Mathlib.analysis.normed_space.add_torsor
i... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.