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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
ddeceaae08676ee36209203b00371e435bfe06e8 | ed27983dd289b3bcad416f0b1927105d6ef19db8 | /src/inClassNotes/type_library/typeUniverses.lean | fe93f6b5192f59639ff27be6918d289e0fe30482 | [] | no_license | liuxin-James/complogic-s21 | 0d55b76dbe25024473d31d98b5b83655c365f811 | 13e03e0114626643b44015c654151fb651603486 | refs/heads/master | 1,681,109,264,463 | 1,618,848,261,000 | 1,618,848,261,000 | 337,599,491 | 0 | 0 | null | 1,613,141,619,000 | 1,612,925,555,000 | null | UTF-8 | Lean | false | false | 3,019 | lean | /-
Lean's type hierarchy
-/
namespace hidden1
universe u
structure box (α : Type u) : Type u :=
(val : α)
def b3 : box nat := box.mk 3
#check b3
def nope : box Type := box.mk nat
#check nope
/-
Every term has a type.
Types are terms, too.
The type of 3 is ℕ.
ℕ is a type, so it has a type.
The type of ℕ (#check... |
d5c7d8f5f99d860f240e702256d6372b1f359bfc | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/1869.lean | 16153196f597f73842a4d5f3bdab43191050785b | [
"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 | 547 | lean | universe v u u'
class CategoryStruct (C : Type u) :=
(Hom : C → C → Type v)
(id : ∀ X, Hom X X)
(comp : ∀ {X Y Z : C}, Hom X Y → Hom Y Z → Hom X Z)
class Category (C : Type u) extends CategoryStruct.{v} C :=
(comp_id : ∀ {X Y : C} (f : Hom X Y), comp f (id Y) = f)
open CategoryStruct
open Category
attribute... |
59ba1b8f305073944898ed4bc9a5908e175a4dbb | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/set_theory/schroeder_bernstein.lean | 52f837b608bbadd31398fd68897635e7a71693eb | [
"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 | 5,359 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro
-/
import order.fixed_points
import order.zorn
/-!
# Schröder-Bernstein theorem, well-ordering of cardinals
This file proves the Schröder-Bernstein the... |
4e51f8dcea93e86703512a7f220713a3b97561a7 | ccb7cdf8ebc2d015a000e8e7904952a36b910425 | /src/program.lean | 81425b210f6f58de0d78f81eb5e3999aebb4bff3 | [] | no_license | cipher1024/lean-pl | f7258bda55606b75e3e39deaf7ce8928ed177d66 | 829680605ac17e91038d793c0188e9614353ca25 | refs/heads/master | 1,592,558,951,987 | 1,565,043,356,000 | 1,565,043,531,000 | 196,661,367 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,995 | lean |
import heap.lemmas heap.tactic misc prop
import data.nat.basic
universes u
namespace separation
open memory finmap
variables (value : Type)
@[reducible]
def ST (α : Type) := state_t (heap value) set α
open state_t
variables {value} {α : Type}
include value
local notation `ST` := ST value
def read (p : ptr) : ST ... |
ddc5f96ec99fac7836e4fee9105e35dd9f1f8950 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/inst_error.lean | 5cdbb7209f779decdd1244ba4dfe5b51df12cd9e | [
"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 | 75 | lean | #check λ (A : Type) (a : A) (b c : _), if a = b ∧ a = c then tt else ff
|
0c007ea64755ad78f86645fa74fbc248c34b40ba | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/playground/task_test2.lean | 3d0a8aa9ca17adac64fe854348076f98836317df | [
"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 | 451 | lean | def run1 (i : Nat) (n : Nat) (xs : List Nat) : Nat :=
n.repeat (fun r =>
dbgTrace (">> [" ++ toString i ++ "] " ++ toString r) $ fun _ =>
xs.foldl (fun a b => a + b) r)
0
def main (xs : List String) : IO UInt32 :=
let ys := (List.replicate xs.head.toNat 1);
let ts : List (Task Nat) := (List.iota 10).map (fun i => ... |
cab97e89cf294c2337021073373f34ccfb076bcc | 947b78d97130d56365ae2ec264df196ce769371a | /stage0/src/Lean/Elab/Tactic/Rewrite.lean | af3c8dc6c7df90b443be53a17e64d892dba9b857 | [
"Apache-2.0"
] | permissive | shyamalschandra/lean4 | 27044812be8698f0c79147615b1d5090b9f4b037 | 6e7a883b21eaf62831e8111b251dc9b18f40e604 | refs/heads/master | 1,671,417,126,371 | 1,601,859,995,000 | 1,601,860,020,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,857 | 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.Rewrite
import Lean.Meta.Tactic.Replace
import Lean.Elab.Tactic.Basic
import Lean.Elab.Tactic.ElabTerm
import Lean.Elab.Tactic.Locat... |
15c5feffee9cbc9fb337db8e62d9907423bb959d | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/ring_theory/witt_vector/compare.lean | ce660859a459955842823e0df2fc310027a7e7d7 | [
"Apache-2.0"
] | permissive | abentkamp/mathlib | d9a75d291ec09f4637b0f30cc3880ffb07549ee5 | 5360e476391508e092b5a1e5210bd0ed22dc0755 | refs/heads/master | 1,682,382,954,948 | 1,622,106,077,000 | 1,622,106,077,000 | 149,285,665 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,288 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Robert Y. Lewis
-/
import ring_theory.witt_vector.truncated
import ring_theory.witt_vector.identities
import data.padics.ring_homs
/-!
# Comparison isomorphism betwe... |
6c9b8ae1ae1ff319906a3dadb5693e93225f8bad | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/linear_algebra/direct_sum_module.lean | 84bcb9777947b2a5b3025e566b3619460daa9023 | [
"Apache-2.0"
] | permissive | stjordanis/mathlib | 51e286d19140e3788ef2c470bc7b953e4991f0c9 | 2568d41bca08f5d6bf39d915434c8447e21f42ee | refs/heads/master | 1,631,748,053,501 | 1,627,938,886,000 | 1,627,938,886,000 | 228,728,358 | 0 | 0 | Apache-2.0 | 1,576,630,588,000 | 1,576,630,587,000 | null | UTF-8 | Lean | false | false | 6,454 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
Direct sum of modules over commutative rings, indexed by a discrete type.
-/
import algebra.direct_sum
import linear_algebra.dfinsupp
/-!
# Direct sum of modules over commutativ... |
694d5a4a2b7085bc0c5ec2417e6318c9ef9578af | c391c9c325aa6efef8b2b66f2de9b317e9d07740 | /src/w_pullback.lean | 1c46c0c851afb52354e65fbe1c1b39df8cfdbf5e | [
"MIT"
] | permissive | goodlyrottenapple/lean-internal-cats | 96592a87f0c8cc03b2592c55098fdee86a25d1cf | fa9df99c2e852598b521b7b3ed8df3e4cb4853b6 | refs/heads/master | 1,601,182,654,282 | 1,578,409,845,000 | 1,578,409,845,000 | 226,436,434 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,768 | lean | import category_theory.category
import category_theory.limits.limits
import category_theory.limits.shapes
open category_theory
open category_theory.limits
universes v u -- declare the `v`'s first; see `category_theory.category` for an explanation
local attribute [tidy] tactic.case_bash
@[derive decidable_eq] induc... |
3bb8b7d01b2035b9a72965e7e3d7dbcdd93e5227 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/meta/pexpr.lean | 81d2435f59604d4a84128b2880ec88cbe3a979ba | [] | 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 | 459 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.meta.expr
namespace Mathlib
/-- Quoted expressions. They can be converted into expressions by using ... |
abe36e8849d4ada8c2e099c3d9a9dc6a6feeb556 | 36938939954e91f23dec66a02728db08a7acfcf9 | /lean4/deps/llvm-tablegen-support/lean/DecodeX86.lean | da756df2e9cc97c0c249308d036c2c48a9ecb608 | [] | no_license | pnwamk/reopt-vcg | f8b56dd0279392a5e1c6aee721be8138e6b558d3 | c9f9f185fbefc25c36c4b506bbc85fd1a03c3b6d | refs/heads/master | 1,631,145,017,772 | 1,593,549,019,000 | 1,593,549,143,000 | 254,191,418 | 0 | 0 | null | 1,586,377,077,000 | 1,586,377,077,000 | null | UTF-8 | Lean | false | false | 9,641 | lean |
namespace decodex86
@[reducible]
def regN := String
structure register :=
(top : regN)
(reg : regN)
(width : Nat)
(offset : Nat)
def register_to_String : register -> String := fun r =>
String.intercalate " " ["(", "R", r.top, r.reg, repr r.width, repr r.offset, ")"]
instance register_has_repr : HasRepr r... |
3845fb8670a78f7bdbf7cce4027fedf373ff9e83 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/topology/sheaves/sheaf_condition/equalizer_products.lean | 11330154d7819bd0ddd974acd1d9609558f2db57 | [
"Apache-2.0"
] | permissive | jjgarzella/mathlib | 96a345378c4e0bf26cf604aed84f90329e4896a2 | 395d8716c3ad03747059d482090e2bb97db612c8 | refs/heads/master | 1,686,480,124,379 | 1,625,163,323,000 | 1,625,163,323,000 | 281,190,421 | 2 | 0 | Apache-2.0 | 1,595,268,170,000 | 1,595,268,169,000 | null | UTF-8 | Lean | false | false | 8,587 | 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 topology.sheaves.presheaf
import category_theory.limits.punit
import category_theory.limits.shapes.products
import category_theory.limits.shapes.equalizers
imp... |
909e963eafbce45435c35f261cd11096bff41d0c | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/elab8.lean | e5df8dc17ee05ac7c244b5af1a39421e96574026 | [
"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 | 176 | lean | definition D1 (A : (Type U)) (B : Nat → (Type U)) := true
definition D2 (A : (Type U)) (B : A → (Type U)) := true
definition D3 (A : (Type U)) (B : A → (Type U)) := false |
d5b64cd1cd6c0234e50ea1ac8137d5258726b61b | 22e97a5d648fc451e25a06c668dc03ac7ed7bc25 | /src/data/setoid.lean | a4ccdc597808e64b6bd61ed3d0b0dfd900d9304a | [
"Apache-2.0"
] | permissive | keeferrowan/mathlib | f2818da875dbc7780830d09bd4c526b0764a4e50 | aad2dfc40e8e6a7e258287a7c1580318e865817e | refs/heads/master | 1,661,736,426,952 | 1,590,438,032,000 | 1,590,438,032,000 | 266,892,663 | 0 | 0 | Apache-2.0 | 1,590,445,835,000 | 1,590,445,835,000 | null | UTF-8 | Lean | false | false | 24,447 | lean | /-
Copyright (c) 2019 Amelia Livingston. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Amelia Livingston, Bryan Gin-ge Chen
-/
import data.set.lattice
/-!
# Equivalence relations
The first section of the file defines the complete lattice of equivalence relations
on ... |
c19e93d7ecb3f654dc2c110a1953b9e15bdf9c71 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/combinatorics/configuration.lean | fdbb9de545df6a6782878040deff357e911c4410 | [
"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 | 23,190 | 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 algebra.big_operators.order
import combinatorics.hall.basic
import data.fintype.big_operators
import set_theory.cardinal.finite
/-!
# Configurations of Poin... |
ce7b0f333f64625dc5d916d163f14aa857cdfe89 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/dsimp_test.lean | d6ba271070e3a5f6d6fc8d46b2b9224840ee229a | [
"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,622 | lean | def f : nat → nat
| 0 := 10
| (n+1) := 20 + n
open list tactic
local attribute [-simp] map head
example (a b c : nat) : head (map f [1, 2, 3]) = 20 :=
begin
dsimp [map],
guard_target head [f 1, f 2, f 3] = 20,
dsimp [f],
guard_target head [20 + 0, 20 + 1, 20 + 2] = 20,
dsimp [head],
guard_target 20 ... |
c8664b2bf26f02829854ababb480b35084f4178c | 290f65d8de0088e3098f612884d54e5b714d7862 | /src/affine_algebraic_set/intersection.lean | 4005c48acb736c045d36603cfa2ee1317bcf7b34 | [
"Apache-2.0"
] | permissive | auhlmann/M4P33 | ec775fd53610427b35f59ef84d469c30511de24e | dc2586aa3a8e0d916fc0795df592a996c89c85bb | refs/heads/master | 1,607,862,664,432 | 1,579,796,968,000 | 1,579,796,968,000 | 234,415,945 | 0 | 0 | Apache-2.0 | 1,579,210,321,000 | 1,579,210,320,000 | null | UTF-8 | Lean | false | false | 1,951 | lean | /-
The intersection of algebraic sets is an algebraic set.
Kevin Buzzard
-/
import affine_algebraic_set.basic -- the basic theory of affine algebraic sets.
/-
# The intersection of (any number of) affine algebraic sets is affine.
Let k be a field and let n be a natural number. We prove the following
theorem in this... |
38562e161ed55c19b3a82b69e9070c18ce60e3f2 | d0f9af2b0ace5ce352570d61b09019c8ef4a3b96 | /notes/2020.03.05-notes.lean | 9320ba4dbdd9ea72e65c322afcf330811eb12922 | [] | no_license | jngo13/Discrete-Mathematics | 8671540ef2da7c75915d32332dd20c02f001474e | bf674a866e61f60e6e6d128df85fa73819091787 | refs/heads/master | 1,675,615,657,924 | 1,609,142,011,000 | 1,609,142,011,000 | 267,190,341 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,646 | lean | /-
Suppose we want to compute a boolean value, with the
result, true (tt), if all of the strings in a lisst of
strings has even length, and false (ff) otherwise. To
build this function, it'd be nice to have two helper
functions: len : string → ℕ , that computes the length
of a given string, and one, ev, that decides... |
646edb1440904e256a70a025d18584ac25c4280b | fe84e287c662151bb313504482b218a503b972f3 | /src/combinatorics/matching.lean | b557e88c8d8899cddb944b89f42202758862efcc | [] | 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 | 14,700 | lean | /-
Copyright (c) 2019 Neil Strickland. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Neil Strickland
This is about matching problems. We have two sets `A` and `B`,
and a relation between them (formalised as `E : finset (A × B)`).
Everything is assumed to be finite a... |
f1c0c0529a85dd8f0b077a3f504e35ef2a986343 | 82b86ba2ae0d5aed0f01f49c46db5afec0eb2bd7 | /tests/lean/run/forBodyResultTypeIssue.lean | ca3436ac655862dd58c0d11db2f80cab2a819a9e | [
"Apache-2.0"
] | permissive | banksonian/lean4 | 3a2e6b0f1eb63aa56ff95b8d07b2f851072d54dc | 78da6b3aa2840693eea354a41e89fc5b212a5011 | refs/heads/master | 1,673,703,624,165 | 1,605,123,551,000 | 1,605,123,551,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 738 | lean |
abbrev M := ExceptT String $ StateT Nat Id
def f (xs : List Nat) : M Unit := do
for x in xs do
if x == 0 then
throw "contains zero"
#eval f [1, 2, 3] $.run' 0
#eval f [1, 0, 3] $.run' 0
theorem ex1 : f [1, 2, 3] $.run' 0 = Except.ok () :=
rfl
theorem ex2 : f [1, 0, 3] $.run' 0 = Except.error "contains zero"... |
6db86354e627daf0db5fdf416d41d191303da360 | 022547453607c6244552158ff25ab3bf17361760 | /src/data/real/nnreal.lean | f99ce1f843de84af1f75f2ec98dda3efe51ab0ca | [
"Apache-2.0"
] | permissive | 1293045656/mathlib | 5f81741a7c1ff1873440ec680b3680bfb6b7b048 | 4709e61525a60189733e72a50e564c58d534bed8 | refs/heads/master | 1,687,010,200,553 | 1,626,245,646,000 | 1,626,245,646,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 32,486 | lean | /-
Copyright (c) 2018 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import algebra.linear_ordered_comm_group_with_zero
import algebra.big_operators.ring
import data.real.basic
import algebra.indicator_function
import algebra.algebra.b... |
b44861deb226a7792dd955563ebf60949b91ccfb | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/data/equiv/ring.lean | 3fd2136a9c45e93933297e0c6570cc658219821d | [
"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 | 16,091 | lean | /-
Copyright (c) 2018 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Callum Sutton, Yury Kudryashov
-/
import data.equiv.mul_add
import algebra.field.basic
import algebra.ring.opposite
import algebra.big_operators.basic
/-!
# (Semi)ring... |
5ed1d675e74bf5b34da025979ae71852791c6f5e | 46125763b4dbf50619e8846a1371029346f4c3db | /src/group_theory/quotient_group.lean | b1541cee41fb07435017d3fabe2df4de4616a13c | [
"Apache-2.0"
] | permissive | thjread/mathlib | a9d97612cedc2c3101060737233df15abcdb9eb1 | 7cffe2520a5518bba19227a107078d83fa725ddc | refs/heads/master | 1,615,637,696,376 | 1,583,953,063,000 | 1,583,953,063,000 | 246,680,271 | 0 | 0 | Apache-2.0 | 1,583,960,875,000 | 1,583,960,875,000 | null | UTF-8 | Lean | false | false | 7,163 | lean | /-
Copyright (c) 2018 Kevin Buzzard and Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Buzzard, Patrick Massot.
This file is to a certain extent based on `quotient_module.lean` by Johannes Hölzl.
-/
import group_theory.coset
universes u v
names... |
a34bc389a1701d6fd69412f3ef52e68732974a6c | ba4794a0deca1d2aaa68914cd285d77880907b5c | /src/my_solutions/world1_addition.lean | 9721df9c76856f99e982cb16da5be323ec36ea5b | [
"Apache-2.0"
] | permissive | ChrisHughes24/natural_number_game | c7c00aa1f6a95004286fd456ed13cf6e113159ce | 9d09925424da9f6275e6cfe427c8bcf12bb0944f | refs/heads/master | 1,600,715,773,528 | 1,573,910,462,000 | 1,573,910,462,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,668 | lean | import mynat.definition -- Imports the natural numbers.
/- Here's what you get from the import:
1) The following data:
* a type called `mynat`
* a term `0 : mynat`, interpreted as the number zero.
* a function `succ : mynat → mynat`, with `succ n` interpreted as "the number after n".
* Usual numerical notatio... |
c0b72cd42b6eed81fdf625210e2c2fc5c9b0467d | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/util_auto.lean | 1fa070720a55e796ef88e07afc9c3afc431e4fcc | [] | 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,013 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.meta.format
universes u
namespace Mathlib
/-- This function has a native implementation that tracks ... |
f4d66e69a0d5f8992235def841f7e0daaf4e79d8 | 92bfaf170880e47d55bf51d5a782fffd76db2f5f | /melting_point/equiv.lean | 7aee5e461a73aea11eeb94fb9065027076ead883 | [] | no_license | forked-from-1kasper/melting_point | d33403e1985d876a2c7c06859962cc0c37570189 | e5ea4a0917de086b7e5b122e8d5aa90d2761d147 | refs/heads/master | 1,624,785,375,577 | 1,618,305,367,000 | 1,618,305,367,000 | 222,729,018 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 634 | lean | universes u v
variables {α : Type u} {β : Type v}
def homotopy {α : Type u} {β : Type v} (f g : α → β) :=
Π x, f x = g x
infix ` ~ ` := homotopy
def linv (f : α → β) := ∃ g, g ∘ f ~ id
def rinv (f : α → β) := ∃ g, f ∘ g ~ id
def biinv (f : α → β) := rinv f ∧ linv f
def injection (f : α → β) :=
∀ x y, f x = f y → x =... |
63754362092c380fd505495a43d3c7670eea13b0 | 1f6fe2f89976b14a4567ab298c35792b21f2e50b | /pointed.hlean | 554e2c328a538e1013672a2a53cc12e3b585cdcb | [
"Apache-2.0"
] | permissive | jonas-frey/Spectral | e5c1c2f7bcac26aa55f7b1e041a81272a146198d | 72d521091525a4bc9a31cac859840efe9461cf66 | refs/heads/master | 1,610,235,743,345 | 1,505,417,795,000 | 1,505,417,795,000 | 102,653,342 | 0 | 0 | null | 1,504,728,483,000 | 1,504,728,483,000 | null | UTF-8 | Lean | false | false | 11,599 | hlean | /- equalities between pointed homotopies and other facts about pointed types/functions/homotopies -/
-- Author: Floris van Doorn
import types.pointed2 .move_to_lib
open pointed eq equiv function is_equiv unit is_trunc trunc nat algebra sigma group lift option
namespace pointed
-- /- the pointed type of (unpointe... |
ffda279e8c58a230698cff2d22df288884bf34e2 | fecda8e6b848337561d6467a1e30cf23176d6ad0 | /src/data/nat/prime.lean | 45e18bfcc4514d7e41ecd638b8f83a41db2ea507 | [
"Apache-2.0"
] | permissive | spolu/mathlib | bacf18c3d2a561d00ecdc9413187729dd1f705ed | 480c92cdfe1cf3c2d083abded87e82162e8814f4 | refs/heads/master | 1,671,684,094,325 | 1,600,736,045,000 | 1,600,736,045,000 | 297,564,749 | 1 | 0 | null | 1,600,758,368,000 | 1,600,758,367,000 | null | UTF-8 | Lean | false | false | 23,312 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Jeremy Avigad, Mario Carneiro
-/
import data.nat.sqrt
import data.nat.gcd
import algebra.group_power
import tactic.wlog
/-!
# Prime numbers
This file deals... |
d1d532cb2aaccfbb40b157cd9a1403fc9cda5506 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/algebra/category/Mon/basic.lean | 696381ac6473acd5321a8e77c9f6c4e17adac940 | [
"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 | 7,293 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.concrete_category
import algebra.group.hom
import data.equiv.mul_add
import algebra.punit_instances
/-!
# Category instances for monoid, add_... |
587e169b21460642d1133d15583e3bfd7d9e5b9c | 592ee40978ac7604005a4e0d35bbc4b467389241 | /Library/generated/mathscheme-lean/InvolutivePointedMagmaSig.lean | 033c0255dae4dd0f3516908ff7c1987535016514 | [] | 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 | 9,683 | 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 InvolutivePointedMagmaSig
structure InvolutivePointedMagmaSig (A : Type) : Type :=
(prim : (A → A))
(e : A)
(op : (A → (A → A)))
open InvolutivePoi... |
8a685879ca018fc7e50371502d88425103298e51 | 41ebf3cb010344adfa84907b3304db00e02db0a6 | /uexp/src/uexp/rules/relationalAlgebra.lean | 60c0acf65bf34480dd41ee6113b52531d2aaac86 | [
"BSD-2-Clause"
] | permissive | ReinierKoops/Cosette | e061b2ba58b26f4eddf4cd052dcf7abd16dfe8fb | eb8dadd06ee05fe7b6b99de431dd7c4faef5cb29 | refs/heads/master | 1,686,483,953,198 | 1,624,293,498,000 | 1,624,293,498,000 | 378,997,885 | 0 | 0 | BSD-2-Clause | 1,624,293,485,000 | 1,624,293,484,000 | null | UTF-8 | Lean | false | false | 2,887 | lean | import ..u_semiring
import ..sql
import ..tactics
import ..meta.ucongr
import ..meta.TDP
set_option profiler true
open Expr
open Proj
open Pred
open SQL
lemma commutativeSelect:
forall Γ s a slct0 slct1,
denoteSQL ((SELECT * FROM1 (SELECT * FROM1 a WHERE slct1) WHERE slct0): SQL Γ s) =
denoteSQL ((SELECT * ... |
a4d21443ed14cb933acc1668179da89f31d43c92 | 5fbbd711f9bfc21ee168f46a4be146603ece8835 | /lean/natural_number_game/advanced_proposition/04.lean | 31f6325e9298d08d8b580bf23161075a7b050613 | [
"LicenseRef-scancode-warranty-disclaimer"
] | no_license | goedel-gang/maths | 22596f71e3fde9c088e59931f128a3b5efb73a2c | a20a6f6a8ce800427afd595c598a5ad43da1408d | refs/heads/master | 1,623,055,941,960 | 1,621,599,441,000 | 1,621,599,441,000 | 169,335,840 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 222 | lean | lemma iff_trans (P Q R : Prop) : (P ↔ Q) → (Q ↔ R) → (P ↔ R) :=
begin
-- could do with cc
intros h g,
cases h with hpq hqp,
cases g with gqr grq,
split,
cc, -- instead of "intro, exact ..."
cc,
end
|
24f1991b5c4d173ead50b0fcbcfc19abea8c3d23 | 495c02489c2d6a1db94dfdba71dd800d3cc67df2 | /migrated/list.lean | 2b1cf551b049da68592481c37760366f2ab13903 | [] | no_license | leodemoura/leanproved | e0fcbe4f4d72bf0dad9a962ed111b5975cf90712 | de56e0af159dd0c0421733289c76aa79c78a0191 | refs/heads/master | 1,606,822,676,898 | 1,435,711,541,000 | 1,435,711,541,000 | 36,675,856 | 0 | 0 | null | 1,433,178,724,000 | 1,433,178,724,000 | null | UTF-8 | Lean | false | false | 4,379 | lean | /-
Copyright (c) 2015 Haitao Zhang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author : Haitao Zhang
-/
import data
open list eq.ops
namespace migration
section basic
open function
lemma head_eq_of_cons_eq {A : Type} {h₁ h₂ : A} {t₁ t₂ : list A} :
(h₁::t₁) = (h₂:... |
66450f03a42284479ec36d089ef13dce7c34c581 | 80d0f8071ea62262937ab36f5887a61735adea09 | /src/certigrad/ops.lean | 99eaae57f1661a968c6220a0dda43111aa9bf675 | [
"Apache-2.0"
] | permissive | wudcscheme/certigrad | 94805fa6a61f993c69a824429a103c9613a65a48 | c9a06e93f1ec58196d6d3b8563b29868d916727f | refs/heads/master | 1,679,386,475,077 | 1,551,651,022,000 | 1,551,651,022,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 28,378 | lean | /-
Copyright (c) 2017 Daniel Selsam. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Daniel Selsam
Deterministic operators.
-/
import .tgrads .util .tcont .det
namespace certigrad
open T list
namespace ops
section tactic
open tactic
meta def idx_over : tactic unit :... |
161ecb122f9f95701c2dc81fa406d90a52ff3597 | 453dcd7c0d1ef170b0843a81d7d8caedc9741dce | /analysis/measure_theory/outer_measure.lean | f7c8a2405b42a0f7c23e7b01b4b715fd6c1e3334 | [
"Apache-2.0"
] | permissive | amswerdlow/mathlib | 9af77a1f08486d8fa059448ae2d97795bd12ec0c | 27f96e30b9c9bf518341705c99d641c38638dfd0 | refs/heads/master | 1,585,200,953,598 | 1,534,275,532,000 | 1,534,275,532,000 | 144,564,700 | 0 | 0 | null | 1,534,156,197,000 | 1,534,156,197,000 | null | UTF-8 | Lean | false | false | 18,529 | 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
Outer measures -- overapproximations of measures
-/
import order.galois_connection algebra.big_operators
analysis.ennreal analysis.limits
... |
701d91996e2df14085f123086bcdd68e27521ee2 | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/tactic/abel.lean | 5d6631b77ea9d79f7a3b608d4417a5662b94365d | [
"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 | 12,348 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
Evaluate expressions in the language of commutative monoids and groups.
-/
import algebra.group_power tactic.norm_num
namespace tactic
namespace abel
meta structure c... |
371acbe2667d59bdf31d8257336616cfa2b14cee | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/algebra/hom/freiman.lean | 367d5689379f4d34b9d62d7eb8245551f71f1e09 | [
"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 | 17,472 | 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.big_operators.multiset
import data.fun_like.basic
/-!
# Freiman homomorphisms
In this file, we define Freiman homomorphisms. A `n`-Freiman homomorphism o... |
6f3578c8c6376c1cd88382065b1d274918ba33e7 | 92b50235facfbc08dfe7f334827d47281471333b | /library/logic/axioms/examples/diaconescu.lean | 29f3164329c19e926afd151b0f697a7ff81c069a | [
"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 | 1,634 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
import logic.axioms.hilbert logic.eq
open eq.ops
/-
Diaconescu’s theorem: excluded middle follows from Hilbert's choice operator, function extensionality,
... |
a2bb0f1c91a60018c4c6199c1b2379a5559a990f | a4673261e60b025e2c8c825dfa4ab9108246c32e | /src/Lean/Data/SMap.lean | d6eebcdf270ce6bb000f4cab26c648dfbfd36c01 | [
"Apache-2.0"
] | permissive | jcommelin/lean4 | c02dec0cc32c4bccab009285475f265f17d73228 | 2909313475588cc20ac0436e55548a4502050d0a | refs/heads/master | 1,674,129,550,893 | 1,606,415,348,000 | 1,606,415,348,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,199 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Std.Data.HashMap
import Std.Data.PersistentHashMap
universes u v w w'
namespace Lean
open Std (HashMap PHashMap)
/- Staged map for implementing th... |
a2b24534ca456342b418b17683210a298ca8d956 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/assert_tac3.lean | 46caddb67b3c6c71d9c66ff347f7e29c7794c80e | [
"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 | 807 | lean | open tactic
definition tst2 (a : nat) : a = a :=
by do
assert `x (expr.const `nat []),
rotate 1,
trace_state,
a ← get_local `a,
mk_app `eq.refl [a] >>= exact,
a ← get_local `a,
exact a,
return ()
#print tst2
definition tst3 (a b : nat) : a = a :=
by do
define `x (expr.const `nat []),
ro... |
fe085587c6f7cf00e76f90ed75447067d3fae42c | e3b487086b7799a7f044a4ee72ad8f02b471d70a | /src/exercises_sources/friday/topology.lean | de30806697cf0ad01e4a1a86da9c22033f0544bf | [] | permissive | sanderdahmen/lftcm2020 | aa47df3d5f6ffd630a9cf7851a79755c85040e2c | 47a894daf266fc45f3b72148a8161666dd56616e | refs/heads/master | 1,668,751,789,893 | 1,594,587,961,000 | 1,594,587,961,000 | 279,150,369 | 0 | 0 | MIT | 1,594,589,049,000 | 1,594,589,048,000 | null | UTF-8 | Lean | false | false | 12,124 | lean | import topology.metric_space.basic
open_locale classical filter topological_space
namespace lftcm
open filter set
/-!
# Filters
## Definition of filters
-/
def principal {α : Type*} (s : set α) : filter α :=
{ sets := {t | s ⊆ t},
univ_sets := begin
sorry
end,
sets_of_superset := begin
sorry
end,
... |
28fa83eee39771b53bd71259477ba070ee1591fb | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/lean/run/simp1.lean | 559bf93981bc02cf438b46681faf11824c0dd97f | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | EdAyers/lean4 | 57ac632d6b0789cb91fab2170e8c9e40441221bd | 37ba0df5841bde51dbc2329da81ac23d4f6a4de4 | refs/heads/master | 1,676,463,245,298 | 1,660,619,433,000 | 1,660,619,433,000 | 183,433,437 | 1 | 0 | Apache-2.0 | 1,657,612,672,000 | 1,556,196,574,000 | Lean | UTF-8 | Lean | false | false | 1,304 | lean | import Lean
@[simp] theorem ex1 (x : Nat) : 2 * x = x + x :=
sorry
@[simp] theorem ex2 (xs : List α) : xs ++ [] = xs :=
sorry
@[simp] theorem ex3 (xs ys zs : List α) : (xs ++ ys) ++ zs = xs ++ (ys ++ zs) :=
sorry
@[simp] theorem ex5 (p : Prop) : p ∨ True :=
sorry
@[simp] theorem ex4 (xs : List α) : ¬(x :: ... |
bd90e05dc814e2ce63e0dadbf09797c902485413 | ae1e94c332e17c7dc7051ce976d5a9eebe7ab8a5 | /src/Lean/Elab/Command.lean | 19557f8b345d89b9295c4a8556b3dd511425fb68 | [
"Apache-2.0"
] | permissive | dupuisf/lean4 | d082d13b01243e1de29ae680eefb476961221eef | 6a39c65bd28eb0e28c3870188f348c8914502718 | refs/heads/master | 1,676,948,755,391 | 1,610,665,114,000 | 1,610,665,114,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 27,522 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Parser.Command
import Lean.ResolveName
import Lean.Meta.Reduce
import Lean.Elab.Log
import Lean.Elab.Term
import Lean.Elab.Binders
import Lean.E... |
29fa7fdb2ea680bde5df2705e173ae9c34c7fd62 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/topology/algebra/ring.lean | b3608423d4f969e15a6a370ff06f687da5656642 | [
"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 | 4,285 | lean | /-
Copyright (c) 2018 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Johannes Hölzl
Theory of topological rings.
-/
import topology.algebra.group
import ring_theory.ideal.basic
open classical set filter topological_space
open_locale cl... |
2ffb043d650db48f55f6e689f246dc902415d21e | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/set_theory/cardinal.lean | f9e744c9900ad4eae4d8917ccd5802d8289f48cf | [] | 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 | 33,939 | 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, Mario Carneiro
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.set.countable
import Mathlib.set_theory.schroeder_bernstein
import Math... |
7fa960cd263d13f5abd4a1ab8c48d4c5a940263b | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/lean/run/funext.lean | beaf5310a06343261261a1f5927ecf6be6461be7 | [
"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 | 807 | lean | theorem ex1 : (fun y => y + 0) = (fun x => 0 + x) := by
funext x
simp
theorem ex2 : (fun y x => y + x + 0) = (fun x y => y + x) := by
funext x y
rw [Nat.add_zero, Nat.add_comm]
theorem ex3 : (fun (x : Nat × Nat) => x.1 + x.2) = (fun (x : Nat × Nat) => x.2 + x.1) := by
funext (a, b)
show a + b = b + a
rw... |
16426eceab5e708cb568604d4e6eaee18be4f3bd | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /test/with_local_reducibility.lean | 3d71ae56e8c4d917b1fdffb71a3ed2244ff3230f | [
"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,887 | lean | import tactic.with_local_reducibility
namespace test
open tactic
open tactic.decl_reducibility
meta def guard_decl_reducibility (n : name) (r : decl_reducibility) :=
do x ← get_decl_reducibility n,
guard (x = r)
-- Test declarations
@[irreducible] def wlr_irred : ℕ := 1
def wlr_semired : ℕ := 2
@[reducible] def... |
162ac4c542361b7084535a51a04ff652d0fe7a03 | 6065973b1fa7bbacba932011c9e2f32bf7bdd6c1 | /src/data/finset/sort.lean | da82621505146d68c25df67afd5222566b9720e6 | [
"Apache-2.0"
] | permissive | khmacdonald/mathlib | 90a0fa2222369fa69ed2fbfb841b74d2bdfd66cb | 3669cb35c578441812ad30fd967d21a94b6f387e | refs/heads/master | 1,675,863,801,090 | 1,609,761,876,000 | 1,609,761,876,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,215 | 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.finset.lattice
import data.multiset.sort
import data.list.nodup_equiv_fin
/-!
# Construct a sorted list from a finset.
-/
namespace finset
open multiset... |
d2aed312d742bdf4af98b186be3d0492025024e8 | 367134ba5a65885e863bdc4507601606690974c1 | /src/linear_algebra/free_algebra.lean | f06a57ce703511683cb8401bfb94b9fd92160903 | [
"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 | 1,062 | lean | /-
Copyright (c) 2021 Eric Wieser. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Eric Wieser
-/
import linear_algebra.basis
import algebra.free_algebra
import linear_algebra.finsupp_vector_space
/-!
# Linear algebra properties of `free_algebra R X`
This file provides... |
65442051b7bec51d240494050136698d8f390941 | ff5230333a701471f46c57e8c115a073ebaaa448 | /tests/lean/run/1562.lean | 3a0f450bc0ff0b6cc73fd2be1642d2a0860975e3 | [
"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 | 496 | lean | meta constant term : Type
meta constant smt2.builder.int_const : int -> term
meta constant smt2_state : Type
@[reducible] meta def smt2_m (α : Type) :=
state_t smt2_state tactic α
meta instance tactic_to_smt2_m (α : Type) : has_coe (tactic α) (smt2_m α) :=
⟨ fun tc, ⟨fun s, do res ← tc, return (res, s)⟩ ⟩
meta def ... |
a3712968acc5370bbc60fdcf764ee5e9e18bc38a | 3dd1b66af77106badae6edb1c4dea91a146ead30 | /tests/lean/run/coe1.lean | 948b9d23cf17517e6c3c1a4be5f0f66fec8dd3bb | [
"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 | 587 | lean | variable A : Type.{1}
variable B : Type.{1}
variable f : A → B
coercion f
variable g : B → B → B
variables a1 a2 a3 : A
variables b1 b2 b3 : B
check g a1 b1
set_option pp.coercion true
check g a1 b1
variable eq {A : Type} : A → A → Type.{0}
check eq a1 a2
check eq a1 b1
set_option pp.implicit true
check eq a1 b1
set_o... |
7316a74f66311e1d8097ed2392177c6c64a2c26a | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/match3.lean | ddfad75da5b04502348820c773d6ac2ab9c9e098 | [
"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 | 2,298 | 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
universe u
infix:50 " ≅ " => HEq
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, ... |
c9162cea97df27bdab7f272f78cff078486cd4ff | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/lean/run/ubscalar.lean | 2a8640f6a86989d3c9c6b4aff91eba72c6004edc | [
"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 | 315 | lean | structure Foo :=
(flag : Bool := false)
(x : UInt16 := 0)
(z : UInt32 := 0)
(w : UInt64 := 0)
(h : USize := 0)
(xs : List Nat := [])
set_option trace.compiler.ir.init true
def f (s : Foo) : Foo :=
{ x := s.x + 1, .. s }
def g (flag : Bool) : Foo :=
let s : Foo := { x := 10, flag := flag };
f s
|
fc7f744391f4502c4306bd413eacd6164bf18633 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/analysis/convex/topology.lean | 7e3a5faca2f4d355f2be4299ccf1494df05a80e0 | [] | 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 | 6,699 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Alexander Bentkamp, Yury Kudriashov
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.analysis.convex.basic
import Mathlib.analysis.normed_space.finite_dim... |
b5ed8308b7536e9ebb291a01b2f2e463404f629d | 69bc7d0780be17e452d542a93f9599488f1c0c8e | /9-12-2019.lean | 3647a3c14acdae93edf3ee1e235254ca0bbe265d | [] | no_license | joek13/cs2102-notes | b7352285b1d1184fae25594f89f5926d74e6d7b4 | 25bb18788641b20af9cf3c429afe1da9b2f5eafb | refs/heads/master | 1,673,461,162,867 | 1,575,561,090,000 | 1,575,561,090,000 | 207,573,549 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,573 | lean | /-
A proposition is a mathematical assertion, which may be true or false.
Terms make up a proposition in predicate logic.
Terms are references: they *refer* to a "referent."
In lean, terms are evaluated to yield values.
LEAN has four basic types of terms:
- literal terms
- identifiers
- lambda expressions (which are ... |
bc6d17d0c5074b333b060835db8cabfb6ac2d469 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/dynamics/minimal.lean | 329215c8d4aa246d9190731ae508b1e6a38da7d3 | [
"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 | 3,964 | lean | /-
Copyright (c) 2021 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov
-/
import topology.algebra.mul_action
import group_theory.group_action.basic
/-!
# Minimal action of a group
In this file we define an action of a monoid `M` o... |
78681fe8855786964f2f7979954692b4636a43fd | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/bench/const_fold.lean | 801f7cf3e9d953240e69f9d67a4328d705cfff61 | [
"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 | 2,199 | lean | inductive Expr
| Var : Nat → Expr
| Val : Nat → Expr
| Add : Expr → Expr → Expr
| Mul : Expr → Expr → Expr
open Expr Nat
def mkExpr : Nat → Nat → Expr
| 0, v => if v = 0 then Var 1 else Val v
| n+1, v => Add (mkExpr n (v+1)) (mkExpr n (v-1))
def appendAdd : Expr → Expr → Expr
| Add e₁ e₂, e₃ => Add e₁ (appen... |
aa9fb660ae2c47ec6fc9d1504e3789501c0f4221 | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/arith3.lean | df8d471bc1e519cacb0cc5922c84fa95df35673a | [
"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 | 174 | lean | import Int.
eval 8 mod 3
eval 8 div 4
eval 7 div 3
eval 7 mod 3
print -8 mod 3
set_option lean::pp::notation false
print -8 mod 3
eval -8 mod 3
eval (-8 div 3)*3 + (-8 mod 3) |
736ca84f274f349d316cc7b8ee09b106a65fe057 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/data/list/range.lean | 5f1f44ab0c912cc90ddf9f07a5ec30e7b03f1f05 | [
"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 | 11,348 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Kenny Lau, Scott Morrison
-/
import data.list.chain
import data.list.nodup
import data.list.of_fn
import data.list.zip
/-!
# Ranges of naturals as lists
This file sho... |
1cdefd5bd4935a105fcc45275c052d3221c709e4 | 29cc89d6158dd3b90acbdbcab4d2c7eb9a7dbf0f | /3.3/33_lecture.lean | 7973201a428e6e736d43f85770d7648027d8808e | [] | no_license | KjellZijlemaker/Logical_Verification_VU | ced0ba95316a30e3c94ba8eebd58ea004fa6f53b | 4578b93bf1615466996157bb333c84122b201d99 | refs/heads/master | 1,585,966,086,108 | 1,549,187,704,000 | 1,549,187,704,000 | 155,690,284 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,813 | lean | /- Lecture 3.3: Programming Semantics — Denotational Semantics -/
import .x33_library
-- enables β-reduced output
set_option pp.beta true
/- Complete lattices -/
class complete_lattice (α : Type) extends partial_order α :=
(Inf : set α → α)
(Inf_le : ∀{s a}, a ∈ s → Inf s ≤ a)
(le_Inf : ∀{s a}, (∀a', a' ∈ s → a... |
c80be3542a4bd59eb343b371304267487ee89d2c | c777c32c8e484e195053731103c5e52af26a25d1 | /src/data/mv_polynomial/comm_ring.lean | a7ccd331d6314c171c8028f6072c62819877cce6 | [
"Apache-2.0"
] | permissive | kbuzzard/mathlib | 2ff9e85dfe2a46f4b291927f983afec17e946eb8 | 58537299e922f9c77df76cb613910914a479c1f7 | refs/heads/master | 1,685,313,702,744 | 1,683,974,212,000 | 1,683,974,212,000 | 128,185,277 | 1 | 0 | null | 1,522,920,600,000 | 1,522,920,600,000 | null | UTF-8 | Lean | false | false | 5,627 | 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.variables
/-!
# Multivariate polynomials over a ring
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any cha... |
881d0bf0806c77f0c4bb3c380e36251bfa5da321 | 4aca55eba10c989f0d58647d3c2f371e7da44355 | /src/circulant_matrix.lean | 57d83c580448d3ba26f37c730da7037ad426c252 | [] | no_license | eric-wieser/l534zhan-my_project | f9fc75fb5454405e1a2fa9b56cf96c355f6f2336 | febc91e76b7b00fe2517f258ca04d27b7f35fcf3 | refs/heads/master | 1,689,218,910,420 | 1,630,439,440,000 | 1,630,439,440,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,493 | lean | /-
Copyright (c) 2021 Lu-Ming Zhang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Lu-Ming Zhang.
-/
import symmetric_matrix
/-!
# Circulant matrices
This file contains the definition and basic results about circulant matrices.
## Main results
- `matr... |
471f7868e43a6b24864e3ae07ad6ad075026f555 | 32025d5c2d6e33ad3b6dd8a3c91e1e838066a7f7 | /stage0/src/Lean/Elab/Tactic/Basic.lean | f8642b8771a29de6a7ae52a2470b2731b7ec6ad3 | [
"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 | 16,054 | 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
-/
import Lean.Util.CollectMVars
import Lean.Meta.Tactic.Assumption
import Lean.Meta.Tactic.Intro
import Lean.Meta.Tactic.Clear
import Lean.... |
1b157b007c5560432c01483311714e926ab04b26 | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /library/standard/logic/connectives/eq.lean | 56bd90c9b65ab1f5078b73dec38c0d85f202a188 | [
"Apache-2.0"
] | permissive | codyroux/lean | 7f8dff750722c5382bdd0a9a9275dc4bb2c58dd3 | 0cca265db19f7296531e339192e9b9bae4a31f8b | refs/heads/master | 1,610,909,964,159 | 1,407,084,399,000 | 1,416,857,075,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,058 | 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
-------------------------------------... |
058c5c5dc22c8e1bc7fb98cae28f22c0f94241aa | 618003631150032a5676f229d13a079ac875ff77 | /src/analysis/convex/cone.lean | 05ecbb09fcb107ac37ee54b3f5acc0d1a14a111f | [
"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 | 18,783 | 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 linear_algebra.linear_pmap
import analysis.convex.basic
import order.zorn
/-!
# Convex cones
In a vector space `E` over `ℝ`, we define a convex cone as a su... |
5e9e2dd3baafeb545be55f5833ef7600af3f8076 | 853df553b1d6ca524e3f0a79aedd32dde5d27ec3 | /src/topology/algebra/uniform_group.lean | d58b4d85178c70a56627423f2a73713447ad1d0c | [
"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 | 19,590 | lean | /-
Copyright (c) 2018 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Johannes Hölzl
-/
import topology.uniform_space.uniform_embedding
import topology.uniform_space.complete_separated
import topology.algebra.group
import tactic.abel
/-!... |
29bf26dc156f080c0fbc9c3e266ec0273eda8de5 | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /stage0/src/Init/Data/Array/Basic.lean | 6a3d1da0a6a697d54b763f593283b2a7afc6c68a | [
"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 | 28,698 | lean | /-
Copyright (c) 2018 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import Init.WFTactics
import Init.Data.Nat.Basic
import Init.Data.Fin.Basic
import Init.Data.UInt
import Init.Data.Repr
import Init.Data.ToString.Ba... |
4ec02513a183354f3513a9a2d5de201d9768f21c | 82b86ba2ae0d5aed0f01f49c46db5afec0eb2bd7 | /stage0/src/Lean/Data/Options.lean | 4ff4039cfd7bd9099d792de9d078b58f41571f80 | [
"Apache-2.0"
] | permissive | banksonian/lean4 | 3a2e6b0f1eb63aa56ff95b8d07b2f851072d54dc | 78da6b3aa2840693eea354a41e89fc5b212a5011 | refs/heads/master | 1,673,703,624,165 | 1,605,123,551,000 | 1,605,123,551,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,869 | lean | /-
Copyright (c) 2018 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich and Leonardo de Moura
-/
import Lean.Data.KVMap
namespace Lean
def Options := KVMap
def Options.empty : Options := {}
instance : Inhabited Options := ⟨Opti... |
d238bcdc9ce3d66d17a6449f9192e57e92b8d392 | 367134ba5a65885e863bdc4507601606690974c1 | /src/linear_algebra/dfinsupp.lean | daf207fbfc84046e3b33ec31dd2cfeff8cff3ed2 | [
"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,002 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Johannes Hölzl, Kenny Lau
-/
import data.dfinsupp
import linear_algebra.basic
/-!
# Properties of the semimodule `Π₀ i, M i`
Given an indexed collection of `R`-semimodules `M i`, the `R`-s... |
0547fbbd60efce3adebd345f488ea77731405779 | 8eeb99d0fdf8125f5d39a0ce8631653f588ee817 | /src/topology/metric_space/emetric_space.lean | 9fd8384ae39ff845eaf8e459d4b318e1ee0bddee | [
"Apache-2.0"
] | permissive | jesse-michael-han/mathlib | a15c58378846011b003669354cbab7062b893cfe | fa6312e4dc971985e6b7708d99a5bc3062485c89 | refs/heads/master | 1,625,200,760,912 | 1,602,081,753,000 | 1,602,081,753,000 | 181,787,230 | 0 | 0 | null | 1,555,460,682,000 | 1,555,460,682,000 | null | UTF-8 | Lean | false | false | 39,563 | lean | /-
Copyright (c) 2015, 2017 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Robert Y. Lewis, Johannes Hölzl, Mario Carneiro, Sébastien Gouëzel
-/
import data.real.ennreal
import data.finset.intervals
import topology.uniform_space.uniform_em... |
8112267d477e34ab1c8a1644fe954e2d7487c236 | 46125763b4dbf50619e8846a1371029346f4c3db | /src/data/fin_enum.lean | e9c44fc7711e7c697d70a739d5b36e87f710102b | [
"Apache-2.0"
] | permissive | thjread/mathlib | a9d97612cedc2c3101060737233df15abcdb9eb1 | 7cffe2520a5518bba19227a107078d83fa725ddc | refs/heads/master | 1,615,637,696,376 | 1,583,953,063,000 | 1,583,953,063,000 | 246,680,271 | 0 | 0 | Apache-2.0 | 1,583,960,875,000 | 1,583,960,875,000 | null | UTF-8 | Lean | false | false | 8,993 | lean | /-
Copyright (c) 2019 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Simon Hudon
-/
import category.monad.basic
import data.list.basic
import data.equiv.basic
import data.finset
import data.fintype
/-!
Type class for finitely enumerable types. The prope... |
4f326624200658c702b649574a5d553ac7b9b4f1 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tmp/eqns/matchVal.lean | e4fdada066b79316e380d56b348b2aba7b8a33a2 | [
"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 | 1,791 | lean | universes v
/-
matcher for the following patterns
```
| "hello" => _
| "world" => _
| a => _
``` -/
def matchString (C : String → Sort v) (s : String)
(h₁ : Unit → C "hello")
(h₂ : Unit → C "world")
(h₃ : ∀ s, C s)
: C s :=
dite (s = "hello")
(fun h => @Eq.ndrec _ _ (fun x => C x) (h₁ ()) _ h.... |
4aaa53c8a032c86243d216be701e755feb604d8a | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/data/finset/nat_antidiagonal.lean | 70b7b9d913e78d5612358795a0b98b7bdeb09033 | [
"Apache-2.0"
] | permissive | troyjlee/mathlib | e18d4b8026e32062ab9e89bc3b003a5d1cfec3f5 | 45e7eb8447555247246e3fe91c87066506c14875 | refs/heads/master | 1,689,248,035,046 | 1,629,470,528,000 | 1,629,470,528,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,219 | 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.finset.basic
import data.multiset.nat_antidiagonal
/-!
# Antidiagonals in ℕ × ℕ as finsets
This file defines the antidiagonals of ℕ × ℕ as finsets: the ... |
afe2b15b8099d385c124f45785f63c991df2fe77 | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/order/filter/basic.lean | 9cf25164abf8616dacfd4dac788dc71385e1d332 | [
"Apache-2.0"
] | permissive | rmitta/mathlib | 8d90aee30b4db2b013e01f62c33f297d7e64a43d | 883d974b608845bad30ae19e27e33c285200bf84 | refs/heads/master | 1,585,776,832,544 | 1,576,874,096,000 | 1,576,874,096,000 | 153,663,165 | 0 | 2 | Apache-2.0 | 1,544,806,490,000 | 1,539,884,365,000 | Lean | UTF-8 | Lean | false | false | 88,750 | 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
Theory of filters on sets.
-/
import order.galois_connection order.zorn
import data.set.finite
open lattice set
universes u v w x y
open_locale classic... |
39a5c7b14a5333ce4df02ba934e7b20b444b37ea | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/have6.lean | cc7f4265cad6304f6880db8991cc3defdc871cae | [
"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 | 600 | lean | prelude
definition Prop : Type.{1} := Type.{0}
constant and : Prop → Prop → Prop
infixl `∧`:25 := and
constant and_intro : forall (a b : Prop), a → b → a ∧ b
constants a b c d : Prop
axiom Ha : a
axiom Hb : b
axiom Hc : c
#check
have a ∧ b, from and_intro a b Ha Hb,
have b ∧ a, from and_intro b a Hb Ha,
have H : ... |
b0c261b9baeed33a3c3e639102b75d3e867a6429 | c3f2fcd060adfa2ca29f924839d2d925e8f2c685 | /tests/lean/run/tactic27.lean | 560471864d94576ee6af918914c8f94f5e83cc87 | [
"Apache-2.0"
] | permissive | respu/lean | 6582d19a2f2838a28ecd2b3c6f81c32d07b5341d | 8c76419c60b63d0d9f7bc04ebb0b99812d0ec654 | refs/heads/master | 1,610,882,451,231 | 1,427,747,084,000 | 1,427,747,429,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 251 | lean | import logic
open tactic
definition my_tac := repeat ([ apply @and.intro
| apply @eq.refl
])
tactic_hint my_tac
theorem T1 {A : Type} {B : Type} (a : A) (b c : B) : a = a ∧ b = b ∧ c = c
|
8c396a6cec76bb9f89f1bc0ec15a42de28cd1337 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /library/theories/finite_group_theory/pgroup.lean | 9c502d5689ffd1cdbb17c5e5c2ded8abba1b0b28 | [
"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 | 15,454 | lean | /-
Copyright (c) 2015 Haitao Zhang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author : Haitao Zhang
-/
import theories.number_theory.primes data algebra.group algebra.group_power algebra.group_bigops
import .cyclic .finsubg .hom .perm .action
open nat fin list function su... |
91092b8b0276138071a1c6f3b6fe441244794775 | 4b846d8dabdc64e7ea03552bad8f7fa74763fc67 | /library/init/meta/comp_value_tactics.lean | cd98b98c35e627745a05d221274d288084de2a1a | [
"Apache-2.0"
] | permissive | pacchiano/lean | 9324b33f3ac3b5c5647285160f9f6ea8d0d767dc | fdadada3a970377a6df8afcd629a6f2eab6e84e8 | refs/heads/master | 1,611,357,380,399 | 1,489,870,101,000 | 1,489,870,101,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,046 | 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
meta constant mk_nat_val_ne_proof : expr → expr → option expr
meta constant mk_nat_val_lt_proof : expr → expr → option expr... |
06bfa37f920ca2bc481aa5fd78bcf08c42172b6d | 4fa161becb8ce7378a709f5992a594764699e268 | /src/data/equiv/denumerable.lean | cac3b0a0cfcdf4089a8d31e13c1e6ffcdcbfdcf2 | [
"Apache-2.0"
] | permissive | laughinggas/mathlib | e4aa4565ae34e46e834434284cb26bd9d67bc373 | 86dcd5cda7a5017c8b3c8876c89a510a19d49aad | refs/heads/master | 1,669,496,232,688 | 1,592,831,995,000 | 1,592,831,995,000 | 274,155,979 | 0 | 0 | Apache-2.0 | 1,592,835,190,000 | 1,592,835,189,000 | null | UTF-8 | Lean | false | false | 9,135 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
Denumerable (countably infinite) types, as a typeclass extending
encodable. This is used to provide explicit encode/decode functions
from nat, where the functions are kn... |
c204ce103f548a7da15a541e1f42881bccca688f | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/linear_algebra/matrix/nonsingular_inverse.lean | 36891b512e5d27757979b6026a88a2dd10a7b166 | [
"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 | 14,747 | lean | /-
Copyright (c) 2019 Tim Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Tim Baanen, Lu-Ming Zhang
-/
import algebra.regular.smul
import data.matrix.notation
import linear_algebra.matrix.polynomial
import linear_algebra.matrix.adjugate
/-!
# Nonsingular invers... |
1cb17690c54b3b787f3cc9553ebc743a6c2614fb | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/ring_theory/localization.lean | 7c86680940b26b766910c7a2ccd54617c746f33a | [
"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 | 69,494 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Mario Carneiro, Johan Commelin, Amelia Livingston
-/
import data.equiv.ring
import group_theory.monoid_localization
import ring_theory.ideal.operations
import ring_theory.algebr... |
919e66286efd98224df92c59c38f5d28f3a85ecf | 88892181780ff536a81e794003fe058062f06758 | /src/100_theorems/t060.lean | 2291fa3646dcd73d4817e558aa2a53e5cadc66e7 | [] | no_license | AtnNn/lean-sandbox | fe2c44280444e8bb8146ab8ac391c82b480c0a2e | 8c68afbdc09213173aef1be195da7a9a86060a97 | refs/heads/master | 1,623,004,395,876 | 1,579,969,507,000 | 1,579,969,507,000 | 146,666,368 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 239 | lean | import algebra.euclidean_domain
-- Bezout’s Theorem
universe u
open euclidean_domain
theorem t060 {α : Type u} [euclidean_domain α] [decidable_eq α]
: Π (a b : α), (gcd a b : α) = a * gcd_a a b + b * gcd_b a b
:= gcd_eq_gcd_ab
|
98c943720c722d16e714a501383e36d48f373341 | c8af905dcd8475f414868d303b2eb0e9d3eb32f9 | /src/data/cpi/semantics/with_normalise.lean | 2bd0ccb77df4b91d7c3007cc9888643eb59bf441 | [
"BSD-3-Clause"
] | permissive | continuouspi/lean-cpi | 81480a13842d67ff5f3698643210d8ed5dd08de4 | 443bf2cb236feadc45a01387099c236ab2b78237 | refs/heads/master | 1,650,307,316,582 | 1,587,033,364,000 | 1,587,033,364,000 | 207,499,661 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,584 | lean | import data.cpi.semantics.relation
namespace cpi
namespace normalise
open_locale normalise
variables {ℍ : Type} {ω : context}
/-- "Equivalence" of concretions, just defined as exact equality for now. -/
def concretion_setoid {b y Γ} : setoid (concretion ℍ ω b y Γ) := ⟨ eq, eq_equivalence ⟩
localized "attribute [in... |
2586bf62465b5a77db9f9f14ac3606cf53f87a6b | bb31430994044506fa42fd667e2d556327e18dfe | /src/analysis/bounded_variation.lean | bb435c8f434af6c62ff74b472e3ed21c7f3a411f | [
"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 | 40,886 | lean | /-
Copyright (c) 2022 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import measure_theory.measure.lebesgue
import analysis.calculus.monotone
import data.set.function
/-!
# Functions of bounded variation
We study functions of b... |
433785c988d78e10e3034026f2f4cb3cac260e55 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/som1.lean | 496fe0d2e7fe022e14f4337999764ce54e370692 | [
"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 | 409 | lean | open Nat.SOM
example : (x + y) * (x + y + 1) = x * (1 + y + x) + (y + 1 + x) * y :=
let ctx := [x, y]
let lhs : Expr := .mul (.add (.var 0) (.var 1)) (.add (.add (.var 0) (.var 1)) (.num 1))
let rhs : Expr := .add (.mul (.var 0) (.add (.add (.num 1) (.var 1)) (.var 0)))
(.mul (.add (.add ... |
09714a875344f4d0890d1eb65814dee220663ad5 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/regular/basic.lean | e71fcb96d2eba0a55c99e81c6e5607acee82a179 | [
"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 | 13,609 | lean | /-
Copyright (c) 2021 Damiano Testa. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Damiano Testa
-/
import algebra.group.commute
import algebra.order.monoid.lemmas
import algebra.group_with_zero.basic
/-!
# Regular elements
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.... |
197aa57d4489489f7404c02d1fa7effd645375b7 | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/measure_theory/function/lp_space.lean | 4debb965e9664523ad5230549e56c208b3bcd7a3 | [
"Apache-2.0"
] | permissive | troyjlee/mathlib | e18d4b8026e32062ab9e89bc3b003a5d1cfec3f5 | 45e7eb8447555247246e3fe91c87066506c14875 | refs/heads/master | 1,689,248,035,046 | 1,629,470,528,000 | 1,629,470,528,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 98,980 | lean | /-
Copyright (c) 2020 Rémy Degenne. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Rémy Degenne, Sébastien Gouëzel
-/
import analysis.normed_space.indicator_function
import analysis.normed_space.normed_group_hom
import measure_theory.function.ess_sup
import measure_the... |
040c43a2cd8cbb553564fcbda1d56b76bb7ef807 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/analysis/inner_product_space/projection.lean | 80d319de5fad26363f15ea58968154b374d59b26 | [
"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 | 60,724 | lean | /-
Copyright (c) 2019 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou, Frédéric Dupuis, Heather Macbeth
-/
import analysis.convex.basic
import analysis.inner_product_space.orthogonal
import analysis.inner_product_space.symmetric
import analy... |
97680b32722259bee0c47fe8a18071d9cbd635da | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/typeclass_metas_internal_goals1.lean | f1fc52b624ca314844c415d867c31a1290107c35 | [
"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 | 378 | lean |
class Foo (α : Type) : Type := (u : Unit := ())
class Bar (α : Type) : Type := (u : Unit := ())
class Top : Type := (u : Unit := ())
instance FooAll (α : Type) : Foo α := {u:=()}
instance BarNat : Bar Nat := {u:=()}
set_option synthInstance.checkSynthOrder false in
instance FooBarToTop (α : Type) [Foo α] [Bar α] : ... |
5e4eae23660b33f3d30c641ab442ef2189678d68 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /library/data/int/basic.lean | eb4cde1f5871feb68947f6d41a955b2afaf71375 | [
"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 | 23,538 | lean | /-
Copyright (c) 2014 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Jeremy Avigad
The integers, with addition, multiplication, and subtraction. The representation of the integers is
chosen to compute efficiently.
To faciliate prov... |
8d3cf2132c9144bf1971d38750bc60fe9422c032 | 853df553b1d6ca524e3f0a79aedd32dde5d27ec3 | /src/topology/algebra/module.lean | 6c4190d6342da9429e00cee2bf4a6674e850af44 | [
"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 | 38,746 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jan-David Salchow, Sébastien Gouëzel, Jean Lo, Yury Kudryashov
-/
import topology.algebra.ring
import topology.uniform_space.uniform_embedding
import ring_theory.algebra
import line... |
006d7a7a7b66957b927dbc3c5acc1a409f524dc0 | c062f1c97fdef9ac746f08754e7d766fd6789aa9 | /data/list/perm.lean | aea6b0c6428ca05a7cd3bed92c359e2747fe04e3 | [] | no_license | emberian/library_dev | 00c7a985b21bdebe912f4127a363f2874e1e7555 | f3abd7db0238edc18a397540e361a1da2f51503c | refs/heads/master | 1,624,153,474,804 | 1,490,147,180,000 | 1,490,147,180,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 49,576 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Jeremy Avigad
List permutations.
-/
import .basic .comb .set
-- TODO(Jeremy): Here is a common idiom: after simplifying, we have a goal 1 + t = nat.succ t
-... |
a5006b1cd41b13a209d073bb08644e9917a4f07b | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/302.lean | 2cc80770421ff0b8cd441f31d126b5229d588fb0 | [
"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 | 23 | lean | def f(y:m 0:=a-t):=f a
|
bf2edbf2be2047fefb935012d85e3601809498ee | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/data/list/perm.lean | 2218934d20cadb1c1d14d2db38d4e5ddc4f75ad3 | [
"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 | 47,772 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Jeremy Avigad, Mario Carneiro
-/
import data.list.bag_inter
import data.list.erase_dup
import data.list.zip
import logic.relation
import data.nat.factorial
/... |
552c99a743364235e3f18621f58450ff41febc5d | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /06_Inductive_Types.org.7.lean | e834639ffb9521019b0d5414ed366eab130d3054 | [] | no_license | cjmazey/lean-tutorial | ba559a49f82aa6c5848b9bf17b7389bf7f4ba645 | 381f61c9fcac56d01d959ae0fa6e376f2c4e3b34 | refs/heads/master | 1,610,286,098,832 | 1,447,124,923,000 | 1,447,124,923,000 | 43,082,433 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 935 | lean | /- page 79 -/
import standard
inductive weekday : Type :=
| sunday : weekday
| monday : weekday
| tuesday : weekday
| wednesday : weekday
| thursday : weekday
| friday : weekday
| saturday : weekday
namespace weekday
definition next (d : weekday) : weekday :=
weekday.cases_on d monday tuesday wednesday thursday frida... |
fb413aa4fd155f8b606484c83362bce0e68c8a08 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/1822.lean | 3187ad7208a28bed47b0b19b78e365af40333d48 | [
"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 | 211 | lean | class F (α : Sort _) extends Inhabited α
instance : F True where
default := trivial
def X (α β) [F α] : (α → β) → β :=
fun f => f default
def Y (α : Sort _) : (True → α) → α :=
X _ _
|
90c281c15a59ee2372338531bb3f936b59a634f2 | b9d8165d695e844c92d9d4cdcac7b5ab9efe09f7 | /src/topology/algebra/ordered.lean | fd16868d8fd7cf78c8ffdbe1a3686da89e2f29f0 | [
"Apache-2.0"
] | permissive | spapinistarkware/mathlib | e917d9c44bf85ef51db18e7a11615959f714efc5 | 0a9a1ff463a1f26e27d7c391eb7f6334f0d90383 | refs/heads/master | 1,606,808,129,547 | 1,577,478,369,000 | 1,577,478,369,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 64,026 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro, Yury Kudryashov
-/
import tactic.tfae
import order.liminf_limsup
import data.set.intervals
import topology.algebra.group
import topology.constructions
... |
185cd0387c33e9d2efc94ab772f64ee710e7a1a1 | 6772a11d96d69b3f90d6eeaf7f9accddf2a7691d | /tactics.lean | b4cc2430f75db38996d78c38ccf25352c6e0deb0 | [] | no_license | lbordowitz/lean-category-theory | 5397361f0f81037d65762da48de2c16ec85a5e4b | 8c59893e44af3804eba4dbc5f7fa5928ed2e0ae6 | refs/heads/master | 1,611,310,752,156 | 1,487,070,172,000 | 1,487,070,172,000 | 82,003,141 | 0 | 0 | null | 1,487,118,553,000 | 1,487,118,553,000 | null | UTF-8 | Lean | false | false | 2,035 | lean | -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Stephen Morgan, Scott Morrison
set_option pp.universes true
open smt_tactic
def pointwise_attribute : user_attribute := {
name := `pointwise,
descr := "A lemma that proves... |
3877a3ea104854043bc3a00c8a706a3a6c78a0f6 | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/elab4.lean | 54b12ee9598b0a70f2e702f234f47c4aeab46a48 | [
"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 | 500 | lean | variable C {A B : Type} (H : A = B) (a : A) : B
variable D {A A' : Type} {B : A -> Type} {B' : A' -> Type} (H : (forall x : A, B x) = (forall x : A', B' x)) : A = A'
variable R {A A' : Type} {B : A -> Type} {B' : A' -> Type} (H : (forall x : A, B x) = (forall x : A', B' x)) (a : A) :
(B a) = (B' (C (D H)... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.