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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
6c865b3dc00426d8a6ed150389e6bf6cbc170770 | 947b78d97130d56365ae2ec264df196ce769371a | /tests/lean/run/getline_crash.lean | 454899b9955869078289e4ba9724fba1b64821fc | [
"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,277 | lean | new_frontend
def tstGetLine (str : String) : IO Unit := do
let path := "tmp_file";
IO.FS.withFile path IO.FS.Mode.write $ λ (h : IO.FS.Handle) =>
h.putStrLn str;
IO.FS.withFile path IO.FS.Mode.read $ λ (h : IO.FS.Handle) => do
let str' ← h.getLine;
IO.println str.length;
IO.println str'.length;
IO.print str'... |
44c5075001bc3dca73b98846a835bf0ba0521733 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/data/list/range.lean | 643e56218e07c426202f96737646c2f54042c243 | [
"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 | 10,536 | 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... |
fb3b3abea9ec24628a73e3551705cc9cbdbe71c2 | 4fa161becb8ce7378a709f5992a594764699e268 | /src/algebra/pointwise.lean | 103fb681d190e37d5f6d5d1edca2ec94256fc0e7 | [
"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 | 12,340 | 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 algebra.module
/-!
# Pointwise addition, multiplication, and scalar multiplication of sets.
This file defines `pointwise_mul`: for a type `α` with multiplic... |
c32de6229686ea4e6377f0e3d435e7f044b1f09d | 94e33a31faa76775069b071adea97e86e218a8ee | /src/data/finset/lattice.lean | 24f8a6368f2905e81aeb7035510b23a9901660dd | [
"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 | 57,606 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.finset.fold
import data.finset.option
import data.finset.prod
import data.multiset.lattice
import order.complete_lattice
/-!
# Lattice operations on fins... |
cf13f371cd901bdbc79bc5c39bf77c7dc925fc0e | 37683ecbb27d7c2037bfd9ad7e06d662f460a005 | /higher_groups.hlean | 1c959b6fd6f2faa2c9e8835c32e8a456a072e5d8 | [
"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 | 18,272 | hlean | /-
Copyright (c) 2015 Ulrik Buchholtz, Egbert Rijke and Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Ulrik Buchholtz, Egbert Rijke, Floris van Doorn
Formalization of the higher groups paper
-/
import .homotopy.EM
open eq is_conn pointed is_trunc t... |
6d4b44347bb8e076f42236ad0874f61d0d28dbd6 | 968e2f50b755d3048175f176376eff7139e9df70 | /examples/pred_logic/unnamed_215.lean | 8982a91cc75685109ee8ab5472d51b878dd59c02 | [] | no_license | gihanmarasingha/mth1001_sphinx | 190a003269ba5e54717b448302a27ca26e31d491 | 05126586cbf5786e521be1ea2ef5b4ba3c44e74a | refs/heads/master | 1,672,913,933,677 | 1,604,516,583,000 | 1,604,516,583,000 | 309,245,750 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 276 | lean | variable U : Type* -- Declare a type, `U`.
variable x : U -- Declare a term `x`, of type `U`.
variable P : U → Prop -- Declare a predicate `P` on `U`.
#check P x -- `P x` has type `Prop`
#check P -- `P` has type `U → Prop` |
882fc39031c96e8976d80707c484f7931264478a | 4950bf76e5ae40ba9f8491647d0b6f228ddce173 | /src/topology/separation.lean | 618219f0d5346e3f386140d83a91e4d6b4d003f6 | [
"Apache-2.0"
] | permissive | ntzwq/mathlib | ca50b21079b0a7c6781c34b62199a396dd00cee2 | 36eec1a98f22df82eaccd354a758ef8576af2a7f | refs/heads/master | 1,675,193,391,478 | 1,607,822,996,000 | 1,607,822,996,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 26,251 | 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
Separation properties of topological spaces.
-/
import topology.subset_properties
open set filter
open_locale topological_space filter
local attribute ... |
22141be3f5dbb44fca80679e82b82da94c597929 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/algebra/group/type_tags.lean | 17589bd42bc3ba786fda72a914d6220355defe8c | [
"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 | 8,180 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import algebra.group.hom
import data.equiv.basic
/-!
# Type tags that turn additive structures into multiplicative, and vice versa
We define two type tags:
* `addit... |
da067b668c019c42980ed22da259cadb0daededd | f5f7e6fae601a5fe3cac7cc3ed353ed781d62419 | /src/tactic/wlog.lean | cefb82122b4ab5268dbc5af6dedd13d4a22d2bf4 | [
"Apache-2.0"
] | permissive | EdAyers/mathlib | 9ecfb2f14bd6caad748b64c9c131befbff0fb4e0 | ca5d4c1f16f9c451cf7170b10105d0051db79e1b | refs/heads/master | 1,626,189,395,845 | 1,555,284,396,000 | 1,555,284,396,000 | 144,004,030 | 0 | 0 | Apache-2.0 | 1,533,727,664,000 | 1,533,727,663,000 | null | UTF-8 | Lean | false | false | 9,321 | 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
Without loss of generality tactic.
-/
import tactic.basic tactic.interactive data.list.perm
open expr tactic lean lean.parser
local postfix `?`:9001 := optional
local... |
828c6efa0333c91b0019512132afb2dad0634ef0 | c3f2fcd060adfa2ca29f924839d2d925e8f2c685 | /tests/lean/run/forest_height.lean | 2ce6df0428346cf5367106c31fc8000b60e66547 | [
"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 | 4,286 | lean | import data.nat.basic data.sum data.sigma data.bool
open nat sigma
inductive tree (A : Type) : Type :=
| node : A → forest A → tree A
with forest : Type :=
| nil : forest A
| cons : tree A → forest A → forest A
namespace manual
check tree.rec_on
definition tree.height {A : Type} (t : tree A) : nat :=
tree.rec_on t
... |
abd6ebfe5e7cb8deb12d78182b264b53af9ef818 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/category_theory/limits/shapes/multiequalizer.lean | b094fe7be5d54bb9cc51895b36ee778a2f401455 | [
"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 | 26,276 | lean | /-
Copyright (c) 2021 Adam Topaz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Adam Topaz
-/
import category_theory.limits.shapes.products
import category_theory.limits.shapes.equalizers
import category_theory.limits.cone_category
import category_theory.adjunction
/... |
012d22a972c40dca771fdf51a5800e0fdef390cd | bc3bab676131ea3e06edb46172d92cf30b89311d | /tutorial 3.lean | 3550cb97194a0a1ad4e5fe64a312368266a033e5 | [] | no_license | enharsha/hello-world | fc13031788876fdab33d28c0834370896e85f356 | ef81d688af1aed47ffadf6662b80db5d9eba587d | refs/heads/master | 1,597,391,078,827 | 1,575,926,406,000 | 1,575,926,406,000 | 215,125,509 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,987 | lean | variables (α:Type) (p q :α → Prop)
/-Question-/
example: (∀x, p x ∧ q x) ↔ (∀ x, p x) ∧ (∀ x, q x) :=
iff.intro
(assume h: (∀ x,p x ∧ q x), and.intro (assume h1 : α, (h h1).left) (assume h2 : α, (h h2).right))
(assume h: (∀ x, p x) ∧ (∀ x, q x), assume h1 : α, and.intro (h.left h1) (h.right h1))
example: (∀ x, ... |
b8cff5200f00c7f71e194ca3a23d4ea798995f24 | 22e97a5d648fc451e25a06c668dc03ac7ed7bc25 | /src/algebra/category/CommRing/adjunctions.lean | 94b73b4de8994734ea5865f559982b36c929e791 | [
"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 | 1,580 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Johannes Hölzl
-/
import algebra.category.CommRing.basic
import data.mv_polynomial
/-!
Multivariable polynomials on a type is the left adjoint of the
forgetful functor... |
42e3b53fcc06a7b9883d0ce9bef52d08b18a804b | c3f2fcd060adfa2ca29f924839d2d925e8f2c685 | /tests/lean/open_tst.lean | bcf4f8ab65940483e4b656005a16be67b8b5ab91 | [
"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 | 836 | lean | context
open [notations] [coercions] nat
check 1 + 2
check add -- Error aliases were not created
end
context
open [declarations] [notations] nat
variable a : nat
check a + a
check add a a
check a + 1 -- Error coercion from num to nat was not loaded
end
context
open - [classes] nat
variable a : nat... |
88d092d5c87f4dede4ecccdc9fa01e726d7236ba | 2a70b774d16dbdf5a533432ee0ebab6838df0948 | /_target/deps/mathlib/src/representation_theory/maschke.lean | 3392e60864210be339a2eea7a5b469c4f55c86db | [
"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,837 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Scott Morrison
-/
import algebra.monoid_algebra
import algebra.invertible
import algebra.char_p.basic
import linear_algebra.basis
/-!
# Maschke's theorem
We prove Maschke's theorem fo... |
990b8d162d4aa0006a0b6793049e153d983a52a3 | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch3/ex0320.lean | ff5e921ebe9f400cba5796ccc4634324dcfbdb23 | [] | no_license | Ailrun/Theorem_Proving_in_Lean | ae6a23f3c54d62d401314d6a771e8ff8b4132db2 | 2eb1b5caf93c6a5a555c79e9097cf2ba5a66cf68 | refs/heads/master | 1,609,838,270,467 | 1,586,846,743,000 | 1,586,846,743,000 | 240,967,761 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 185 | lean | variables p q : Prop
theorem and_swap : p ∧ q ↔ q ∧ p :=
⟨λ h, ⟨h.right, h.left⟩, λ h, ⟨h.right, h.left⟩⟩
example (h : p ∧ q) : q ∧ p := (and_swap p q).mp h
|
0b89dfb515b4a28dfecc061dde619a7f9d504cc5 | 86d27503307c38df1c2f623003db02428c647dc6 | /tests/lean/run/check_constants.lean | 3bc4b8824e697a6955a9552a25a90fc5821b02ca | [
"Apache-2.0"
] | permissive | david-christiansen/lean | ec01bce37268b3e442272832ea955c48a8b92a92 | 89136339ff8c551a2313b22e92d38c1d76d33606 | refs/heads/master | 1,594,457,625,583 | 1,497,312,913,000 | 1,497,325,368,000 | 94,268,567 | 0 | 0 | null | 1,497,397,719,000 | 1,497,397,719,000 | null | UTF-8 | Lean | false | false | 14,863 | lean | -- DO NOT EDIT, automatically generated file, generator scripts/gen_constants_cpp.py
import smt system.io
open tactic
meta def script_check_id (n : name) : tactic unit :=
do env ← get_env, (env^.get n >> return ()) <|> (guard $ env^.is_namespace n) <|> (attribute.get_instances n >> return ()) <|> fail ("identifier '" +... |
4c2d7a4489284eaf8dc5574a27d175520b6bbd70 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/category_theory/monoidal/natural_transformation.lean | c889dc10ddf1b78aa8c1ce2462cb28bd29328f33 | [
"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 | 5,016 | 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.functor
import category_theory.full_subcategory
/-!
# Monoidal natural transformations
Natural transformations between (lax) monoida... |
fe62907bf0920adc4a567d10430570f5966d3650 | 3f7026ea8bef0825ca0339a275c03b911baef64d | /src/tactic/linarith.lean | 2654191f0f7e363a1e594143f0ad6c26974a4bde | [
"Apache-2.0"
] | permissive | rspencer01/mathlib | b1e3afa5c121362ef0881012cc116513ab09f18c | c7d36292c6b9234dc40143c16288932ae38fdc12 | refs/heads/master | 1,595,010,346,708 | 1,567,511,503,000 | 1,567,511,503,000 | 206,071,681 | 0 | 0 | Apache-2.0 | 1,567,513,643,000 | 1,567,513,643,000 | null | UTF-8 | Lean | false | false | 33,040 | lean | /-
Copyright (c) 2018 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Robert Y. Lewis
-/
import tactic.ring data.nat.gcd data.list.basic meta.rb_map data.tree
/-!
A tactic for discharging linear arithmetic goals using Fourier-Motzkin elimination.
`li... |
3fba86443443854dc0ba3a67fc85a428f48541f4 | 8e31b9e0d8cec76b5aa1e60a240bbd557d01047c | /scratch/tobig_polyhedral.lean | 0896fea8031be7f59c3e3e0ce292b6516a1be00c | [] | no_license | ChrisHughes24/LP | 7bdd62cb648461c67246457f3ddcb9518226dd49 | e3ed64c2d1f642696104584e74ae7226d8e916de | refs/heads/master | 1,685,642,642,858 | 1,578,070,602,000 | 1,578,070,602,000 | 195,268,102 | 4 | 3 | null | 1,569,229,518,000 | 1,562,255,287,000 | Lean | UTF-8 | Lean | false | false | 2,455 | lean | import data.matrix
import data.rat
import data.set data.set.enumerate data.set.finite data.finset
variables {α : Type} {n m l s t : Type} [fintype n] [fintype m] [fintype s] [fintype t]
variables {n1 n2 : nat}
section matrix
def le [partial_order α] (M N : matrix n m α) :=
∀i:n, ∀j:m, M i j ≤ N i j
instance [parti... |
b4a74dce13c7768a5765e86b21437f3527bb9133 | 12b755d17b2fc1d2a08d39a11658674c4dc6c2c3 | /src/week03.lean | f76c3bb6f7a3721b1e09a06b4b0d74b488dfb4f2 | [] | no_license | UVM-M52/lean-hdthomas | a0066caf3bddd8fc8075016257a63a4d80a8fb33 | 1d399a5bb22544831ff466b2fe4cec38832b8ba6 | refs/heads/master | 1,609,092,927,189 | 1,580,748,817,000 | 1,580,748,817,000 | 238,001,939 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,357 | lean | -- Math 52: Week 3
definition is_even (n : ℤ) := ∃ (k : ℤ), n = 2 * k
definition is_odd (n : ℤ) := ∃ (k : ℤ), n = 2 * k + 1
-- Lakins 1.2.4: For every integer n, 4*n+7 is odd.
theorem L124 : ∀ (n : ℤ), is_odd (4*n+7) :=
begin
intro n,
unfold is_odd,
existsi (2*n+3:ℤ),
symmetry,
calc 2*(2*n+3) + 1
= (2*(2*n) + 2*3) +... |
3d91a0f24b9c2e5753067631cd42d72035dc29d7 | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /stage0/src/Lean/Elab/PreDefinition/Main.lean | ae3b3b57744708e251ea3709b404f30557ca3931 | [
"Apache-2.0"
] | permissive | collares/lean4 | 861a9269c4592bce49b71059e232ff0bfe4594cc | 52a4f535d853a2c7c7eea5fee8a4fa04c682c1ee | refs/heads/master | 1,691,419,031,324 | 1,618,678,138,000 | 1,618,678,138,000 | 358,989,750 | 0 | 0 | Apache-2.0 | 1,618,696,333,000 | 1,618,696,333,000 | null | UTF-8 | Lean | false | false | 3,248 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Elab.PreDefinition.Basic
import Lean.Elab.PreDefinition.Structural
import Lean.Elab.PreDefinition.WF
namespace Lean.Elab
open Meta
open Term
pr... |
21c0eaec27785bdb6776b739b16e0e7f412ed947 | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/order/complete_boolean_algebra.lean | 4d93048d410a72747b22899358de6a24e5e12295 | [
"Apache-2.0"
] | permissive | agjftucker/mathlib | d634cd0d5256b6325e3c55bb7fb2403548371707 | 87fe50de17b00af533f72a102d0adefe4a2285e8 | refs/heads/master | 1,625,378,131,941 | 1,599,166,526,000 | 1,599,166,526,000 | 160,748,509 | 0 | 0 | Apache-2.0 | 1,544,141,789,000 | 1,544,141,789,000 | null | UTF-8 | Lean | false | false | 4,669 | 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
Theory of complete Boolean algebras.
-/
import order.complete_lattice
set_option old_structure_cmd true
universes u v w
variables {α : Type u} {β : Type v} {ι : Sort ... |
36de08a393196c33f5ee40032c26e4148b0fab90 | 271e26e338b0c14544a889c31c30b39c989f2e0f | /src/Init/Lean/Elab/BuiltinNotation.lean | 0bf81a2c30a4a646f34cd43d4f55a0ce98f4f205 | [
"Apache-2.0"
] | permissive | dgorokho/lean4 | 805f99b0b60c545b64ac34ab8237a8504f89d7d4 | e949a052bad59b1c7b54a82d24d516a656487d8a | refs/heads/master | 1,607,061,363,851 | 1,578,006,086,000 | 1,578,006,086,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,978 | 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.Lean.Elab.Term
namespace Lean
namespace Elab
namespace Term
@[builtinTermElab dollar] def elabDollar : TermElab :=
adaptExpander $ fun... |
6b361e7c69976e55a245018843dbe9e223f5b79b | 0d19caa7d4fa8370c14061de04a835cb13b84e87 | /06-formalizacija-dokazov/vaje.lean | f212a61c8a4569b059d57b10d9264d09c3644378 | [] | no_license | natasataskov/teorija-programskih-jezikov | dfc285ce4980f9e24e745677a69f39c5d20bd512 | 82022713f0f5d946b1e59e51d69ab15d518eb07a | refs/heads/master | 1,599,537,599,218 | 1,575,240,132,000 | 1,575,240,132,000 | 221,009,337 | 0 | 0 | null | 1,573,485,567,000 | 1,573,485,566,000 | null | UTF-8 | Lean | false | false | 1,406 | lean | namespace hidden
universe u
-------------------------------------------------------------------------------
inductive list (A:Type) : Type
| Nil {} : list -- Brez {} moramo konstruktorju Nil vedno podati tip A
| Cons : A -> list -> list -- Cons tip A ugotovi iz tipa prvega elementa
namespace list
-- Dopolnite definic... |
948f58baacefd56db7a1bb6c83a20ab8ff3ee546 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/linear_algebra/matrix/block.lean | a471f4d867a113248a7fc4e567020bae9e73c574 | [
"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 | 9,847 | lean | /-
Copyright (c) 2019 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Patrick Massot, Casper Putz, Anne Baanen
-/
import linear_algebra.matrix.determinant
import tactic.fin_cases
/-!
# Block matrices and their determinant
This file defi... |
02170ed6d81d6716c54076678be016a618c0734e | 63abd62053d479eae5abf4951554e1064a4c45b4 | /test/congr.lean | d107bad15782fd6e8b1889cb8c6ce47de14e1063 | [
"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 | 1,993 | lean | import algebra.group.defs
import data.subtype
import tactic.congr
section congr
open tactic.interactive
example (c : Prop → Prop → Prop → Prop) (x x' y z z' : Prop)
(h₀ : x ↔ x')
(h₁ : z ↔ z') :
c x y z ↔ c x' y z' :=
begin
congr',
{ guard_target x = x', ext, assumption },
{ guard_target z = z', ext, assu... |
e94b4216f869acad41cbfb7f4c2a86671c1e822d | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/epi_mono.lean | f59c4b5666a9c23997286f87bc91b9817c829d37 | [] | 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 | 7,591 | lean | /-
Copyright (c) 2019 Reid Barton. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Reid Barton, Scott Morrison
Facts about epimorphisms and monomorphisms.
The definitions of `epi` and `mono` are in `category_theory.category`,
since they are used by some lemmas for `is... |
1ab4674e8d6a266c142b603d5fe2a3c990281d4c | a8c03ed21a1bd6fc45901943b79dd6574ea3f0c2 | /clause.lean | 26fcff3c885911308f7dd049ea31933585cfa073 | [] | no_license | gebner/resolution.lean | 716c355fbb5204e5c4d0c5a7f3f3cc825892a2bf | c6fafe06fba1cfad73db68f2aa474b29fe892a2b | refs/heads/master | 1,601,111,444,528 | 1,475,256,701,000 | 1,475,256,701,000 | 67,711,151 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,626 | lean | import init.meta.tactic utils
open expr list tactic monad decidable
meta structure clause :=
(num_quants : ℕ)
(num_lits : ℕ)
(proof : expr)
(type : expr)
namespace clause
private meta def tactic_format (c : clause) : tactic format := do
prf_fmt : format ← pp (proof c),
type_fmt ← pp (type c),
return $ prf_fmt ++ to_... |
2f45b5debac1be352924ebaec83f758ece812dd2 | b70031c8e2c5337b91d7e70f1e0c5f528f7b0e77 | /src/algebra/group_with_zero/power.lean | 4c398f6d19668b758976ea66dc0291216dedf286 | [
"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 | 9,292 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import algebra.group_power
/-!
# Powers of elements of groups with an adjoined zero element
In this file we define integer power functions for groups with an adjoin... |
ee460d8cea647d2703b48ac544eb73e87492cf42 | 54d7e71c3616d331b2ec3845d31deb08f3ff1dea | /tests/lean/pp_zero_bug.lean | 66ecd1b97e5319d65abab79dd82e653bf1740d0f | [
"Apache-2.0"
] | permissive | pachugupta/lean | 6f3305c4292288311cc4ab4550060b17d49ffb1d | 0d02136a09ac4cf27b5c88361750e38e1f485a1a | refs/heads/master | 1,611,110,653,606 | 1,493,130,117,000 | 1,493,167,649,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 30 | lean | #check @zero
#check @zero nat
|
173b29c785809195bd8dc2ddd108bd2f485e29c1 | d29d82a0af640c937e499f6be79fc552eae0aa13 | /src/algebra/lie/submodule.lean | 57d897cdc5bd16704c1c56c067c8ff4be8dba0e1 | [
"Apache-2.0"
] | permissive | AbdulMajeedkhurasani/mathlib | 835f8a5c5cf3075b250b3737172043ab4fa1edf6 | 79bc7323b164aebd000524ebafd198eb0e17f956 | refs/heads/master | 1,688,003,895,660 | 1,627,788,521,000 | 1,627,788,521,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 33,228 | lean | /-
Copyright (c) 2021 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import algebra.lie.subalgebra
import ring_theory.noetherian
/-!
# Lie submodules of a Lie algebra
In this file we define Lie submodules and Lie ideals, we construct the l... |
ee2fcb24502b45300ff7dc598493346dd253ae80 | 037dba89703a79cd4a4aec5e959818147f97635d | /src/2021/sets/sheet2.lean | 713be5519dcaa03b97e30536fd4436c49c70d557 | [] | no_license | ImperialCollegeLondon/M40001_lean | 3a6a09298da395ab51bc220a535035d45bbe919b | 62a76fa92654c855af2b2fc2bef8e60acd16ccec | refs/heads/master | 1,666,750,403,259 | 1,665,771,117,000 | 1,665,771,117,000 | 209,141,835 | 115 | 12 | null | 1,640,270,596,000 | 1,568,749,174,000 | Lean | UTF-8 | Lean | false | false | 1,985 | lean | /-
Copyright (c) 2021 Kevin Buzzard. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author : Kevin Buzzard
-/
import tactic -- imports all the Lean tactics
/-!
# Sets in Lean, example sheet 2 : the empty set and the "universal set".
We know what the empty subset of `X` is, ... |
9a759bbb960ec19d945bebe43b412d98d42cc981 | 3dd1b66af77106badae6edb1c4dea91a146ead30 | /tests/lean/run/trick.lean | 20bac83ef91436ea99b3d6ed252bcfd6222bd1a4 | [
"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 | 804 | lean | import standard
using num
definition proj1 (x : num) (y : num) := x
definition One := 1
(*
local num = Const({"num", "num"})
local m = mk_metavar("m", num)
local proj1 = Const("proj1")
local zero = Const({"num", "zero"})
local one = Const("One")
local t1 = proj1(m, one)
local t2 = proj1(m, zero)
funct... |
d2113d868d74d7dffde29c15b7dd72e58dedb8d4 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/tactic/linarith/verification.lean | 8f6e0b1e5010c632a25de2c0adeb2713b8c03423 | [
"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 | 7,220 | lean | /-
Copyright (c) 2020 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
-/
import tactic.linarith.elimination
import tactic.linarith.parsing
/-!
# Deriving a proof of false
`linarith` uses an untrusted oracle to produce a certificate of... |
3e4bdfcce98180436a16fd1dfd95a9389025bfe1 | ebf7140a9ea507409ff4c994124fa36e79b4ae35 | /src/solutions/friday/manifolds.lean | d07e3239b0e30f89236743e13b6cac9cebe42f9d | [] | no_license | fundou/lftcm2020 | 3e88d58a92755ea5dd49f19c36239c35286ecf5e | 99d11bf3bcd71ffeaef0250caa08ecc46e69b55b | refs/heads/master | 1,685,610,799,304 | 1,624,070,416,000 | 1,624,070,416,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 42,341 | lean | import ...for_mathlib.manifolds
noncomputable theory
open_locale manifold classical big_operators
open set
universe u
/-!
## Reminder on updating the exercises
These instructions are now available at:
https://leanprover-community.github.io/lftcm2020/exercises.html
To get a new copy of the exercises,
run the foll... |
1a3abd681ec4260b535446ce2f00f6127b4be6dd | 432d948a4d3d242fdfb44b81c9e1b1baacd58617 | /src/category_theory/products/basic.lean | fc089dc6a3c3868fbc304f952af4c976ab5e83f7 | [
"Apache-2.0"
] | permissive | JLimperg/aesop3 | 306cc6570c556568897ed2e508c8869667252e8a | a4a116f650cc7403428e72bd2e2c4cda300fe03f | refs/heads/master | 1,682,884,916,368 | 1,620,320,033,000 | 1,620,320,033,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,444 | 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
-/
import category_theory.eq_to_hom
/-!
# Cartesian products of categories
We define the category instance on `C × D` when `C` and `D` are categories.
... |
8e9dd38c4198f80b8f170328064bf14618922de7 | a9fe717b93ccfa4b2e64faeb24f96dfefb390240 | /nat.lean | 5c22ecf3713ef9002a3c34866dc7762f7cdf1d19 | [] | 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 | 651 | lean | import data.nat.basic
namespace nat
lemma lt_iff_add_one_le {m n : ℕ} :
m < n ↔ m + 1 ≤ n := by rw succ_le_iff
lemma add_lt_add_of_le_of_le_of_lt_or_lt {a b c d : nat} :
a ≤ b → c ≤ d → (a < b ∨ c < d) → a + c < b + d :=
begin
intros h1 h2 h3, cases h3,
apply add_lt_add_of_lt_of_le; assumption,
apply add... |
8a40388ba9db0e4c0a6c104f5a4f0c0230419ac3 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/string/defs.lean | ea5351bf282e7c06c733d95e7aed43da6cfc606d | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 2,141 | lean | /-
Copyright (c) 2019 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon, Keeley Hoek, Floris van Doorn
-/
import data.list.defs
/-!
# Definitions for `string`
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corres... |
d30f2f7523e5ea6de81ca9833d12c87f19c90c4d | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/data/zmod/basic.lean | 9fc67e9146b9bfce273dc21b708ab3fcbe780b75 | [
"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 | 28,289 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import data.int.modeq
import algebra.char_p.basic
import data.nat.totient
import ring_theory.ideal.operations
/-!
# Integers mod `n`
Definition of the integers mod n, ... |
55c6cfe57d44613cc4dbe4d0ae2de601765b613a | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/group_theory/nilpotent.lean | 82ccce8fd1bb60e79d3b596007b418dac80c2628 | [
"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 | 30,124 | lean | /-
Copyright (c) 2021 Kevin Buzzard. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Buzzard, Ines Wright, Joachim Breitner
-/
import group_theory.general_commutator
import group_theory.quotient_group
import group_theory.solvable
import group_theory.p_group
/-!
... |
cd34199e70fa219fe9243db3fe511d1a493e2c3d | cf39355caa609c0f33405126beee2739aa3cb77e | /library/init/control/lawful.lean | 2fb3c372b3f24b90214d2f554d53085f2744e9aa | [
"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 | 11,185 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
-/
prelude
import init.control.monad init.meta.interactive
import init.control.state init.control.except init.control.reader init.control.option
universes u v
... |
404786814e3f650c43cbb94cf81baecab4ddf4e9 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/list/pairwise.lean | 860d991cc13661bed634227bbf9ce823a730abdf | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,400 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.list.basic
import Mathlib.PostPort
universes u v
namespace Mathlib
namespace list
... |
7523a8b8e4132e09a7497853c43be7838ae14e7c | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /10_Structures_and_Records.org.12.lean | 7c412b2c4f4a10920cfd29cff1eefb6fcace69d1 | [] | 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 | 328 | lean | import standard
open nat
structure point (A : Type) :=
mk :: (x : A) (y : A)
definition p1 : point nat := {| point, x := 10, y := 20 |}
definition p2 : point nat := {| point, x := 1, p1 |}
definition p3 : point nat := {| point, y := 1, p1 |}
example : point.y p1 = point.y p2 :=
rfl
example : point.x p1 = point.x p3... |
0a6ab7e3178f860fec62e6de00a3069964cfea79 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebra/lie/free.lean | 0bb0e5c04bd27683aaaed77dbc2a18e284499012 | [
"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 | 10,920 | lean | /-
Copyright (c) 2021 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import algebra.lie.of_associative
import algebra.lie.non_unital_non_assoc_algebra
import algebra.lie.universal_enveloping
import algebra.free_non_unital_non_assoc_algebra
... |
a974fe8b02f2a41b08c05da72e7e44a71798e751 | 64874bd1010548c7f5a6e3e8902efa63baaff785 | /tests/lean/run/uni.lean | 1011cf4622487bbed68e6c03bcf6dd9d267357b8 | [
"Apache-2.0"
] | permissive | tjiaqi/lean | 4634d729795c164664d10d093f3545287c76628f | d0ce4cf62f4246b0600c07e074d86e51f2195e30 | refs/heads/master | 1,622,323,796,480 | 1,422,643,069,000 | 1,422,643,069,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,343 | lean | import logic
namespace experiment
inductive nat : Type :=
zero : nat,
succ : nat → nat
check @nat.rec
(*
local env = get_env()
local nat_rec = Const({"nat", "rec"}, {1})
local nat = Const("nat")
local n = Local("n", nat)
local C = Fun(n, Prop)
local p = Local("p", Prop)
local ff = Const... |
5640b59f711c576c0a684d76fabc4b41a5148bf9 | 432d948a4d3d242fdfb44b81c9e1b1baacd58617 | /src/linear_algebra/matrix.lean | 515f936df921cac186496e7356036d63ba2104be | [
"Apache-2.0"
] | permissive | JLimperg/aesop3 | 306cc6570c556568897ed2e508c8869667252e8a | a4a116f650cc7403428e72bd2e2c4cda300fe03f | refs/heads/master | 1,682,884,916,368 | 1,620,320,033,000 | 1,620,320,033,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 60,715 | lean | /-
Copyright (c) 2019 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Patrick Massot, Casper Putz
-/
import linear_algebra.finite_dimensional
import linear_algebra.nonsingular_inverse
import linear_algebra.multilinear
import linear_algebr... |
6fdaa8a412d22807f8660c698b8796cc7983522e | 737dc4b96c97368cb66b925eeea3ab633ec3d702 | /stage0/src/Lean/Elab/MutualDef.lean | d4f857d3847ccf04083c187e126d3f8ffd5c9140 | [
"Apache-2.0"
] | permissive | Bioye97/lean4 | 1ace34638efd9913dc5991443777b01a08983289 | bc3900cbb9adda83eed7e6affeaade7cfd07716d | refs/heads/master | 1,690,589,820,211 | 1,631,051,000,000 | 1,631,067,598,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 32,856 | 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.Parser.Term
import Lean.Meta.Closure
import Lean.Meta.Check
import Lean.Elab.Command
import Lean.Elab.DefView
import Lean.Elab.PreDefinition
imp... |
f89430e635d7a8f996a4616d64b6c7e66dd1452a | 5e3548e65f2c037cb94cd5524c90c623fbd6d46a | /src_icannos_totilas/reduction/cpge_reduction_007_c.lean | d27e176313e8bc099899d1a77ce2a8999fccbba5 | [] | 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 | 454 | lean | import algebra.module.basic
import algebra.module.linear_map
import linear_algebra.basic
import linear_algebra.prod
import linear_algebra.projection
import order.bounded_lattice
theorem cpge_reduction_7_c (R : Type*) (M : Type*)
[semiring R] [add_comm_group M] [module R M]
(u : linear_map R M M):
u^3 + u = 0 ->... |
36d35d5130662b3840a9fd29209d290b2f2c05b8 | c1a29ca460720df88ab68dc42d9a1a02e029d505 | /examples/logic/unnamed_444.lean | ee3c870a983c2f4ff125731e118e665144272ed0 | [] | no_license | agusakov/mathematics_in_lean | acb5b3d659e4522ae4b4836ea550527f03f6546c | 2539562e4d91c858c73dbecb5b282ce1a7d38b6d | refs/heads/master | 1,665,963,365,241 | 1,592,080,022,000 | 1,592,080,022,000 | 272,078,062 | 0 | 0 | null | 1,592,078,772,000 | 1,592,078,772,000 | null | UTF-8 | Lean | false | false | 240 | lean | variables {α : Type*} (r s t : set α)
example : s ⊆ s :=
by { intros x xs, exact xs }
example : s ⊆ s := λ x xs, xs
example : r ⊆ s → s ⊆ t → r ⊆ t :=
begin
sorry
end
example : r ⊆ s → s ⊆ t → r ⊆ t :=
sorry |
b62c6f8b5e3983d1506bbc4430c6f454eecbf424 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/topology/metric_space/gluing.lean | 8d6ae28faf350dc0adbd617f9328a2d7aae7696b | [
"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 | 23,855 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Gluing metric spaces
Authors: Sébastien Gouëzel
-/
import topology.metric_space.isometry
import topology.metric_space.premetric_space
/-!
# Metric space gluing
Gluing two metric spaces alo... |
feb7151379baba86de55cd4d4044f51ca7e58298 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/measure_theory/integral/layercake.lean | beeef7164966addf02dbbb322a3f2ac85009ad0c | [
"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 | 11,808 | lean | /-
Copyright (c) 2022 Kalle Kytölä. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kalle Kytölä
-/
import measure_theory.integral.interval_integral
import analysis.special_functions.integrals
/-!
# The layer cake formula / Cavalieri's principle / tail probability form... |
1cd949b71e7fffe979500df06c9f0fdd5a957f08 | 853df553b1d6ca524e3f0a79aedd32dde5d27ec3 | /src/ring_theory/polynomial/basic.lean | 218f31584df1a5958aaae674c6233380fea7f734 | [
"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,776 | lean | /-
Copyright (c) 2019 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
Ring-theoretic supplement of data.polynomial.
Main result: Hilbert basis theorem, that if a ring is noetherian then so is its polynomial ring.
-/
import algebra.char_p
import da... |
8b00cf1a4e96cd9fcaff710e0ec39a90eb3254cf | 94e33a31faa76775069b071adea97e86e218a8ee | /src/analysis/normed_space/multilinear.lean | 6c75986eeba0e3e2e399802506a1a906a5e43a3b | [
"Apache-2.0"
] | permissive | urkud/mathlib | eab80095e1b9f1513bfb7f25b4fa82fa4fd02989 | 6379d39e6b5b279df9715f8011369a301b634e41 | refs/heads/master | 1,658,425,342,662 | 1,658,078,703,000 | 1,658,078,703,000 | 186,910,338 | 0 | 0 | Apache-2.0 | 1,568,512,083,000 | 1,557,958,709,000 | Lean | UTF-8 | Lean | false | false | 72,231 | lean | /-
Copyright (c) 2020 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import analysis.normed_space.operator_norm
import topology.algebra.module.multilinear
/-!
# Operator norm on the space of continuous multilinear maps
When `f`... |
86f04f7ac31e7d3932e2694484656e652345b09a | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/term_app.lean | 7306622db6d4f296e78b80c693fdcd86391e1e93 | [
"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 | 314 | lean | inductive term
| const : string → term
| app : string → list term → term
mutual def num_consts, num_consts_lst
with num_consts : term → nat
| (term.const n) := 1
| (term.app n ts) := num_consts_lst ts
with num_consts_lst : list term → nat
| [] := 0
| (t::ts) := num_consts t + num_consts_lst ts
|
055699d74564ca808b46bfde30d3b7b8e5c810bf | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/compatibleTypesEtaIssue.lean | bc19cb9d347c7e36ab217f4070ce0e27e6fbad13 | [
"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,673 | lean | namespace MWE
universe u v w
inductive Id {A : Type u} : A → A → Type u
| refl {a : A} : Id a a
attribute [eliminator] Id.casesOn
infix:50 (priority := high) " = " => Id
def contr (A : Type u) := Σ (a : A), ∀ b, a = b
def singl {A : Type u} (a : A) :=
Σ b, a = b
def Corr (A : Type u) (B : Type v) :=
Σ (R : A → B... |
19ad68455b23826272e51abf72be2e50987439c1 | 75db7e3219bba2fbf41bf5b905f34fcb3c6ca3f2 | /hott/init/num.hlean | 57c6e740193e722b12fbcb8f31f3eba1ebf8eab8 | [
"Apache-2.0"
] | permissive | jroesch/lean | 30ef0860fa905d35b9ad6f76de1a4f65c9af6871 | 3de4ec1a6ce9a960feb2a48eeea8b53246fa34f2 | refs/heads/master | 1,586,090,835,348 | 1,455,142,203,000 | 1,455,142,277,000 | 51,536,958 | 1 | 0 | null | 1,455,215,811,000 | 1,455,215,811,000 | null | UTF-8 | Lean | false | false | 2,049 | hlean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.bool
open bool algebra
namespace pos_num
protected definition mul (a b : pos_num) : pos_num :=
pos_num.rec_on a
b
(λn r, bi... |
5106f7b4969fbdaf8d596a12393841f7046eb91b | f5f7e6fae601a5fe3cac7cc3ed353ed781d62419 | /src/field_theory/finite.lean | 4770195b137b4297b815df73b537a5d6eafa1c26 | [
"Apache-2.0"
] | permissive | EdAyers/mathlib | 9ecfb2f14bd6caad748b64c9c131befbff0fb4e0 | ca5d4c1f16f9c451cf7170b10105d0051db79e1b | refs/heads/master | 1,626,189,395,845 | 1,555,284,396,000 | 1,555,284,396,000 | 144,004,030 | 0 | 0 | Apache-2.0 | 1,533,727,664,000 | 1,533,727,663,000 | null | UTF-8 | Lean | false | false | 3,584 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import group_theory.order_of_element data.nat.totient data.polynomial data.equiv.algebra
universes u v
variables {α : Type u} {β : Type v}
open function finset polynomi... |
99aeaae531ccd210c353c127de2744f710e93137 | 1a61aba1b67cddccce19532a9596efe44be4285f | /library/data/int/gcd.lean | 502c00bb09eb056926b9d5b9af74838907395f1a | [
"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 | 14,581 | 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
Definitions and properties of gcd, lcm, and coprime.
-/
import .div data.nat.gcd
open eq.ops
namespace int
/- gcd -/
definition gcd (a b : ℤ) : ℤ :=... |
29b0e7c4687bb9bd6baa2edce94a9abe1f284de6 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/algebra/category/Group/images_auto.lean | 106c31d2a58c71f38292be9f5e73a83849bd2eb3 | [] | 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 | 3,510 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.algebra.category.Group.abelian
import Mathlib.category_theory.limits.shapes.images
import M... |
f6b97d1a79b131cf5b7a7dec964449b899ddd4bf | 969dbdfed67fda40a6f5a2b4f8c4a3c7dc01e0fb | /src/algebra/ring/basic.lean | 125223110df3190d00cad2bb73502f7e90f9c07e | [
"Apache-2.0"
] | permissive | SAAluthwela/mathlib | 62044349d72dd63983a8500214736aa7779634d3 | 83a4b8b990907291421de54a78988c024dc8a552 | refs/heads/master | 1,679,433,873,417 | 1,615,998,031,000 | 1,615,998,031,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 42,972 | 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, Floris van Doorn, Amelia Livingston, Yury Kudryashov,
Neil Strickland
-/
import algebra.divisibility
import data.set.basic
/-!
# Properties and homomo... |
0fc6b9a74729b4f91f61a304e4ffaf75db4383ad | 36938939954e91f23dec66a02728db08a7acfcf9 | /lean/deps/galois_stdlib/src/galois/category/reader.lean | 11501c2761beb0efd846aa264aa65d4d984881d2 | [
"Apache-2.0"
] | permissive | 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 | 210 | lean | namespace reader_t
instance is_monad_state {s : Type _} {m : Type _ → Type _} {ρ: Type _} [monad_state s m]
: monad_state s (reader_t ρ m) :=
{ lift := λ_ f, ⟨λr, monad_state.lift f⟩
}
end reader_t
|
5681bb2b8738b4b4b5cde88da90286507371e5d8 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/data/rat/cast.lean | 05870c23d9625c95555d655ae6d8796703f3613d | [
"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,316 | lean | /-
Copyright (c) 2019 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro
-/
import data.rat.order
import data.int.char_zero
/-!
# Casts for Rational Numbers
## Summary
We define the canonical injection from ℚ into an arbitr... |
5639fa72aa032cd02ce8c898474e41d1c9de4cac | c1cc0e0109964c513d82364865617b077fbbca41 | /src/cosets.lean | 00214e8707e1aa9280fe56fefa299980c7d3e695 | [] | no_license | loganrjmurphy/lean-algebra | 314f12a28459d8734200207b4304ce036b0c886d | 474ac0c2714b7c0ad544a90c0d0807b92a0da227 | refs/heads/master | 1,675,055,520,716 | 1,607,564,600,000 | 1,607,564,600,000 | 316,637,587 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,746 | lean | import definitions subgroups basic
namespace Algebra
namespace coset
variables {G : Type} [group G] {K : subgroup G}
{a b g h: G}
def left_coset (g : G) (H : subgroup G) : set G :=
{g' | ∃ h ∈ H, g + h = g'}
def right_coset (g : G) (H : subgroup G) : set G :=
{g' | ∃ h ∈ H, h + g = g'}
def in_left_coset {g... |
38914e9c23685b924e4779d2ff7092e54e123916 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/bench/rbmap_library.lean | daea811fb3e93a1779e528aef1177b961b9327fe | [
"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 | 384 | lean | import Lean.Data.RBMap
open Lean
abbrev Tree : Type := RBMap Nat Bool compare
def mkMapAux : Nat → Tree → Tree
| 0, m => m
| n+1, m => mkMapAux n (m.insert n (n % 10 = 0))
def mkMap (n : Nat) :=
mkMapAux n {}
def main (xs : List String) : IO Unit :=
let m := mkMap xs.head!.toNat!
let v := m.fold (fun _... |
2728a9a956270e0cf9aba43af014fcae79ac7bdd | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/measure_theory/constructions/polish.lean | 9558e512508585bc2921f7ac9b0777f1fe3fa444 | [
"Apache-2.0"
] | permissive | ramonfmir/mathlib | c5dc8b33155473fab97c38bd3aa6723dc289beaa | 14c52e990c17f5a00c0cc9e09847af16fabbed25 | refs/heads/master | 1,661,979,343,526 | 1,660,830,384,000 | 1,660,830,384,000 | 182,072,989 | 0 | 0 | null | 1,555,585,876,000 | 1,555,585,876,000 | null | UTF-8 | Lean | false | false | 34,620 | 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 topology.metric_space.polish
import measure_theory.constructions.borel_space
/-!
# The Borel sigma-algebra on Polish spaces
We discuss several results ... |
0c9c258778583a6332cbba2b22e816ed9172194f | 798dd332c1ad790518589a09bc82459fb12e5156 | /logic/basic.lean | dde642f1337ad75b654a86037454b2fca9aaae6a | [
"Apache-2.0"
] | permissive | tobiasgrosser/mathlib | b040b7eb42d5942206149371cf92c61404de3c31 | 120635628368ec261e031cefc6d30e0304088b03 | refs/heads/master | 1,644,803,442,937 | 1,536,663,752,000 | 1,536,663,907,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 24,024 | 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
Theorems that require decidability hypotheses are in the namespace "decidable".
Classical versions are in the namespace "classical".
Note: in the pres... |
0f2355cd65f653f9fcadae5cbe92e4990c776e2f | ea5678cc400c34ff95b661fa26d15024e27ea8cd | /uncountable_real.lean | 53016db4b78aae2af8a325d3235fab0cefc37a75 | [] | 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 | 4,020 | lean | import topology.separation topology.subset_properties tactic.push_neg data.real.basic
import analysis.complex.exponential
open function set finset
local attribute [instance] classical.dec
noncomputable theory
def set_nat_to_seq (s : set ℕ) (n : ℕ) : ℝ := if n ∈ s then (3⁻¹)^n else 0
--#print cauchy_seq
lemma is_cau_... |
037cb2a5ab1e65ea85800714c48bdb516c1fa19b | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/algebra/big_operators/intervals.lean | 8aede9d22b545ffef0ca090021167fe40beea4c3 | [
"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 | 5,792 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
-/
import algebra.big_operators.basic
import data.finset.intervals
/-!
# Results about big operators over intervals
We prove results about big operators over interva... |
cd2cc208ab7becdd7ac51c322ca3a7b932c54f41 | 11e28114d9553ecd984ac4819661ffce3068bafe | /src/examples/archemedian.lean | 8bddedb8396713d39253849936d884c7b910c21e | [
"MIT"
] | permissive | EdAyers/lean-subtask | 9a26eb81f0c8576effed4ca94342ae1281445c59 | 04ac5a6c3bc3bfd190af4d6dcce444ddc8914e4b | refs/heads/master | 1,586,516,665,621 | 1,558,701,948,000 | 1,558,701,948,000 | 160,983,035 | 4 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 624 | lean | /- Author: E.W.Ayers © 2019 -/
import ..equate
import algebra.archimedean
open robot
universe u
variables {R : Type u} [linear_ordered_ring R] [floor_ring R] {x : R}
attribute [equate] int.cast_neg
attribute [equate] floor_coe
attribute [equate] floor_add_int
attribute [equate] floor_sub_int
@[equate] lemma ciel_def... |
780207153d85861256bb1e143cfd769ce73360de | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/lake/Lake/Load/Main.lean | 4b84884f58263ddd58df32e609332be773ce2bac | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 8,795 | lean | /-
Copyright (c) 2022 Mac Malone. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mac Malone, Gabriel Ebner
-/
import Lake.Util.EStateT
import Lake.Util.StoreInsts
import Lake.Config.Workspace
import Lake.Build.Topological
import Lake.Build.Module
import Lake.Build.Pack... |
660db0aa73bc1c94ba27f1e75f9b437547a317e4 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/compiler/strictAndOr.lean | 441523d94915719c19add700472e1e3a7642529f | [
"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 | 311 | lean | def main : IO Unit :=
IO.println (strictOr false false) *>
IO.println (strictOr false true) *>
IO.println (strictOr true false) *>
IO.println (strictOr true true) *>
IO.println (strictAnd false false) *>
IO.println (strictAnd false true) *>
IO.println (strictAnd true false) *>
IO.println (strictAnd true true)
|
21c87755d11623c6d2cd696db7a29a4b2d67452e | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/ring_theory/dedekind_domain.lean | d5eefb454de05d2f88ddbde3e5827f9f60023dd8 | [] | 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,717 | lean | /-
Copyright (c) 2020 Kenji Nakagawa. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenji Nakagawa, Anne Baanen, Filippo A. E. Nuccio
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.ring_theory.discrete_valuation_ring
import Mathlib.ring_... |
efbe9b330424f71582fc267cc5113d55375eb756 | 78630e908e9624a892e24ebdd21260720d29cf55 | /src/logic_propositional/prop_10.lean | 53306a7ce6eac9599400ac13c93de28fa8eb603c | [
"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 | 357 | lean | namespace prop_10
variables A B : Prop
theorem prop_10 : ¬ (A ∨ ¬ B) ∨ (¬ A ∧ ¬ B) → ¬ A :=
assume h1: ¬ (A ∨ ¬ B) ∨ (¬ A ∧ ¬ B),
assume h2: A,
show false, from or.elim h1
(assume h3: ¬(A ∨ ¬B),
h3 (or.inl h2))
(assume h4: ¬A ∧ ¬B,
have h5: ¬ A, from and.left h4,
h5 h2)
-- end namespace
end pr... |
a208f9fca0bf3c280fbfca8c801b03a8e8d4c07e | 64874bd1010548c7f5a6e3e8902efa63baaff785 | /tests/lean/run/eq7.lean | a98f7999172f29a179ff556c61e1ffe2aee26321 | [
"Apache-2.0"
] | permissive | tjiaqi/lean | 4634d729795c164664d10d093f3545287c76628f | d0ce4cf62f4246b0600c07e074d86e51f2195e30 | refs/heads/master | 1,622,323,796,480 | 1,422,643,069,000 | 1,422,643,069,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 425 | lean | import data.vector
open nat vector
definition diag {A : Type} : Π {n}, vector (vector A n) n → vector A n,
diag nil := nil,
diag ((a :: va) :: vs) := a :: diag (map tail vs)
theorem diag_nil (A : Type) : diag (@nil (vector A 0)) = nil :=
rfl
theorem diag_succ {A : Type} {n : nat} (a : A) (va : vector A... |
4e87aeab8a58f03db393eac542ef445fe31118a1 | 1789ef53372ad44b5ce5db2341556f91c8c31395 | /Mermin_Peres.lean | ddf6cab89fddde1ed622fc89216bc221518ed45a | [] | no_license | iceplant/Mermin_Peres | d0a0f4c9f27111b3fee4e0ab5119ef1eafc59dc2 | d7ea59b5767157420b0fae9dfc09f22ad2826564 | refs/heads/master | 1,609,583,206,767 | 1,582,220,678,000 | 1,582,220,678,000 | 239,577,114 | 1 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 9,523 | lean | -- import init.data.nat.basic
-- import init.algebra.ring
-- import init.algebra.norm_num
import tactic
import data.nat.parity
import data.finset
import data.fintype
import algebra.big_operators
import data.real.basic
set_option class.instance_max_depth 15000000
#eval 2
open_locale classical
--open_local matrix
... |
67f1d74795daa647e129ae12bb04dc52b04e4ef0 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/category_theory/groupoid/basic.lean | 1cf1a3bb07e881bf5f1b7cc14077b96c2ed0b12b | [
"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 | 999 | lean | /-
Copyright (c) 2022 Rémi Bottinelli. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Rémi Bottinelli
-/
import category_theory.groupoid
import combinatorics.quiver.basic
/-!
This file defines a few basic properties of groupoids.
-/
namespace category_theory
namespa... |
06b5a2625d22cd9caab39cd7ea81eb34862946d6 | 8711b4976859218c98ea2129103249d693a4178b | /src/modal_logic/basic.lean | d42d5fded96d5104b201f18cbcf6875e90472abd | [] | no_license | kendfrey/modal_logic | e2433c122ff7012aa743739283ceaa3451e41e79 | c07b5524de478cb57d796d0617b28990c7c77770 | refs/heads/master | 1,679,147,393,521 | 1,615,255,686,000 | 1,615,255,686,000 | 345,164,286 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 81 | lean | import modal_logic.classes
import modal_logic.axioms
import modal_logic.universal |
b40652a3437f6e7e19a518c294dd41c388d2b17b | d8f6c47921aa2f4f02b5272d2ed9c99f396d3858 | /lean/src/bv/helper.lean | 34f0f9928a59338d90a8b1e65e3f7791c8384a5a | [] | no_license | hongyunnchen/jitterbug | cc94e01483cdb36f9007ab978f174e5df9a65fd2 | eb5d50ef17f78c430f9033ff18472972b3588aee | refs/heads/master | 1,670,909,198,044 | 1,599,154,934,000 | 1,599,154,934,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 684 | lean | import data.int.modeq
import tactic.basic
import tactic.linarith.frontend
import tactic.ring_exp
namespace bv.helper
open nat
lemma pow2_succ (n : ℕ) : 2^(succ n) = 2 * 2^n :=
by simp [nat.pow_succ, mul_comm]
lemma pow2_pos (n : ℕ) : 2^n > 0 :=
pos_pow_of_pos _ two_pos
@[simp]
lemma bit_div_two (b : bool) (n : ℕ) :... |
786eb9895f358f70e9b2cc893065469511effc6b | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /stage0/src/Lean/Elab/Exception.lean | 6ff84fc4da29c0464fa47b9f9dfd5743c2b3ef94 | [
"Apache-2.0"
] | permissive | collares/lean4 | 861a9269c4592bce49b71059e232ff0bfe4594cc | 52a4f535d853a2c7c7eea5fee8a4fa04c682c1ee | refs/heads/master | 1,691,419,031,324 | 1,618,678,138,000 | 1,618,678,138,000 | 358,989,750 | 0 | 0 | Apache-2.0 | 1,618,696,333,000 | 1,618,696,333,000 | null | UTF-8 | Lean | false | false | 2,525 | 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.InternalExceptionId
import Lean.Meta.Basic
namespace Lean.Elab
builtin_initialize postponeExceptionId : InternalExceptionId ← registerInternal... |
03bd8c1fe6462f400e76ca9f3b461cb51ba0bc9a | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/data/real/ennreal.lean | 54c7a694c0c88f5202357c5e9e1f761901f8fa3d | [
"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 | 53,220 | 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, Yury Kudryashov
-/
import data.real.nnreal
import data.set.intervals
/-!
# Extended non-negative reals
We define `ennreal := with_no ℝ≥0` to be the type of extended no... |
0ebcad25b30d87f61ccdc7e180553ffa6064eb5f | a4673261e60b025e2c8c825dfa4ab9108246c32e | /stage0/src/Lean/Compiler/IR/EmitC.lean | 57e6f80dd91fd45d0e2dd37ffe0f964f10e22bae | [
"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 | 25,084 | 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.Runtime
import Lean.Compiler.NameMangling
import Lean.Compiler.ExportAttr
import Lean.Compiler.InitAttr
import Lean.Compiler.IR.CompilerM
import... |
4da76f61a513358a5960a2bf279efa89367b15c5 | ee8cdbabf07f77e7be63a449b8483ce308d37218 | /lean/src/valid/mathd-numbertheory-198.lean | a23583b5940ebaa49351951a41b68f10d78c63ec | [
"MIT",
"Apache-2.0"
] | permissive | zeta1999/miniF2F | 6d66c75d1c18152e224d07d5eed57624f731d4b7 | c1ba9629559c5273c92ec226894baa0c1ce27861 | refs/heads/main | 1,681,897,460,642 | 1,620,646,361,000 | 1,620,646,361,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 245 | lean | /-
Copyright (c) 2021 OpenAI. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kunhao Zheng
-/
import data.nat.basic
import data.real.basic
example : ( 5 ^ 2005 ) % 100 = 25 :=
begin
sorry
end
|
b4b27d98ac694af4d6ff7a8750eb7f102ff799dc | 137c667471a40116a7afd7261f030b30180468c2 | /src/topology/metric_space/gromov_hausdorff_realized.lean | 20417005f6676f08b8cd288abae7685f6373a7df | [
"Apache-2.0"
] | permissive | bragadeesh153/mathlib | 46bf814cfb1eecb34b5d1549b9117dc60f657792 | b577bb2cd1f96eb47031878256856020b76f73cd | refs/heads/master | 1,687,435,188,334 | 1,626,384,207,000 | 1,626,384,207,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 27,479 | 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.metric_space.gluing
import topology.metric_space.hausdorff_distance
import topology.continuous_function.bounded
/-!
# The Gromov-Hausdorff dist... |
480d3811ba87fa6e5a9d0d59a05af4a6d2f3896e | 6fca17f8d5025f89be1b2d9d15c9e0c4b4900cbf | /src/game/world6/level4.lean | dd33a86bc0f7fcff0af39de3d435a318ae569565 | [
"Apache-2.0"
] | permissive | arolihas/natural_number_game | 4f0c93feefec93b8824b2b96adff8b702b8b43ce | 8e4f7b4b42888a3b77429f90cce16292bd288138 | refs/heads/master | 1,621,872,426,808 | 1,586,270,467,000 | 1,586,270,467,000 | 253,648,466 | 0 | 0 | null | 1,586,219,694,000 | 1,586,219,694,000 | null | UTF-8 | Lean | false | false | 1,237 | lean | /-
# Proposition world.
## Level 4: `apply`.
Let's do the same level again:
We are given a proof $p$ of $P$ and our goal is to find a proof of $U$, or
in other words to find a path through the maze that links $P$ to ... |
80d8ae45e55b3cf353792673d37dad7a3c280d7e | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/category_theory/sites/limits.lean | 50ff8db9774df22a45d9290efb9e59d02d6341a7 | [
"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 | 8,045 | lean | /-
Copyright (c) 2021 Adam Topaz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Adam Topaz
-/
import category_theory.limits.creates
import category_theory.sites.sheafification
/-!
# Limits and colimits of sheaves
## Limits
We prove that the forgetful functor from ... |
8859024c3daf7b25ebeb2f2e465adc6033f7ca8c | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/meta/decl_cmds_auto.lean | 70f4a11ebc96dc114a133cfbcfd7599086134418 | [] | 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 | 300 | 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.tactic
import Mathlib.Lean3Lib.init.meta.rb_map
namespace Mathlib
end Mathlib |
41abc8936b04fd322b438a3ee239f00ae1b016d4 | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /tests/lean/run/group4.lean | 3a0856e03b2f945256995552e55fae2d7802bf73 | [
"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 | 4,066 | 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
-- algebra.group
-- =============
-- Various structures with 1, *, inv, including groups.
import logic.eq
import data.unit data.sigma data.prod... |
5a042d74d6a282cffe02b3c4e6255d8e56883c53 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/shadow.lean | 06ad2b7328af015ffc77b0f7be47205305148c4f | [
"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 | 639 | lean | import Lean
theorem ex1 {α} (x : α) (h : x = x) (x : α) : x = x :=
h
set_option pp.sanitizeNames false in
theorem ex2 {α} (x : α) (h : x = x) (x : α) : x = x :=
h -- this error is confusing because we have disabled `pp.sanitizeNames`
def foo1 {α} [Inhabited α] (inst inst : α) : {β δ : Type} → α → β → δ → α × β × δ... |
0600e25b3ed5e6ed6035b5f600d2fe79ce8bd418 | 1b8f093752ba748c5ca0083afef2959aaa7dace5 | /src/category_theory/examples/groups/universal.lean | 710fd7efe14359afe3eac8944c97e6ca33a29585 | [] | no_license | khoek/lean-category-theory | 7ec4cda9cc64a5a4ffeb84712ac7d020dbbba386 | 63dcb598e9270a3e8b56d1769eb4f825a177cd95 | refs/heads/master | 1,585,251,725,759 | 1,539,344,445,000 | 1,539,344,445,000 | 145,281,070 | 0 | 0 | null | 1,534,662,376,000 | 1,534,662,376,000 | null | UTF-8 | Lean | false | false | 4,953 | 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.examples.groups
import category_theory.universal.strongly_concrete
import category_theory.limits
namespace category_theory.examples.groups... |
1bb3ed3af176d38cbdb5a86007ba9ab24a927524 | 6df8d5ae3acf20ad0d7f0247d2cee1957ef96df1 | /HW/hw8_intro_proofs.lean | a95f5a32c892d069880e42f579a794c3e08b96e7 | [] | no_license | derekjohnsonva/CS2102 | 8ed45daa6658e6121bac0f6691eac6147d08246d | b3f507d4be824a2511838a1054d04fc9aef3304c | refs/heads/master | 1,648,529,162,527 | 1,578,851,859,000 | 1,578,851,859,000 | 233,433,207 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,495 | lean | /-
CS 2102 F19, Homework #8, Predicate Logic & Proofs.
-/
namespace hw8
/-
#1. Equality and proofs of equality.
-/
/-
A. [10 points] Fill in the blank.
When we say that the binary equality relation,
=, on objects of any type, α, is reflexive, we
mean that for any value, a, of type, α, _______.
ANSWER:
a = a
-/
... |
ddce061dbce6103ada3324e5a751f07b33407c91 | 3aad12fe82645d2d3173fbedc2e5c2ba945a4d75 | /src/category/liftable.lean | 1d6c47384aa825d60cecc49edbe81ef5ce976268 | [] | no_license | seanpm2001/LeanProver-Community_MathLIB-Nursery | 4f88d539cb18d73a94af983092896b851e6640b5 | 0479b31fa5b4d39f41e89b8584c9f5bf5271e8ec | refs/heads/master | 1,688,730,786,645 | 1,572,070,026,000 | 1,572,070,026,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,526 | lean |
import data.equiv.basic
import tactic
universes u₀ v₀ u₁ v₁ v₂ w w₀ w₁
class liftable (α : Type u₀) (β : (Type v₀)) :=
(lift {} : α ≃ β)
-- instance {α} : liftable α (ulift α) :=
-- ⟨ equiv.ulift.symm ⟩
instance ulift.liftable.ulift {α : Type w} : liftable (ulift.{u₀} α) (ulift.{u₁} α) :=
⟨ equiv.trans equiv.u... |
203aa8a46237f34f1e46b0ec954c8324dc0cba64 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/class5.lean | 187fe022ec2b749f01a24294c23eb5716176fdbe | [
"Apache-2.0"
] | permissive | soonhokong/lean | cb8aa01055ffe2af0fb99a16b4cda8463b882cd1 | 38607e3eb57f57f77c0ac114ad169e9e4262e24f | refs/heads/master | 1,611,187,284,081 | 1,450,766,737,000 | 1,476,122,547,000 | 11,513,992 | 2 | 0 | null | 1,401,763,102,000 | 1,374,182,235,000 | C++ | UTF-8 | Lean | false | false | 1,357 | lean | import logic
namespace experiment
namespace algebra
inductive mul_struct [class] (A : Type) : Type :=
mk : (A → A → A) → mul_struct A
definition mul {A : Type} [s : mul_struct A] (a b : A)
:= mul_struct.rec (λ f, f) s a b
infixl `*` := mul
end algebra
open algebra
namespace nat
inductive nat : Type :=
... |
a3956651e1d0dfd38047b605ce1b1d9ae783f592 | 38ee9024fb5974f555fb578fcf5a5a7b71e669b5 | /test/SolveByElim.lean | ed8f30beb5692f9538fc26c4e934ed49a9446890 | [
"Apache-2.0"
] | permissive | denayd/mathlib4 | 750e0dcd106554640a1ac701e51517501a574715 | 7f40a5c514066801ab3c6d431e9f405baa9b9c58 | refs/heads/master | 1,693,743,991,894 | 1,636,618,048,000 | 1,636,618,048,000 | 373,926,241 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 673 | lean | /-
Copyright (c) 2021 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Scott Morrison
-/
import Mathlib.Tactic.SolveByElim
def test1 (h : Nat) : Nat := by solveByElim
def test2 {α β : Type} (f : α → β) (a : α) : β := by solveByElim
def test3 {α β : Type} ... |
aba6911be95aeaac639dc9e16802d777fd8f7e11 | 07c6143268cfb72beccd1cc35735d424ebcb187b | /src/analysis/complex/exponential.lean | 0d3f55a17ba9e64cd085e7c509899054708c5451 | [
"Apache-2.0"
] | permissive | khoek/mathlib | bc49a842910af13a3c372748310e86467d1dc766 | aa55f8b50354b3e11ba64792dcb06cccb2d8ee28 | refs/heads/master | 1,588,232,063,837 | 1,587,304,803,000 | 1,587,304,803,000 | 176,688,517 | 0 | 0 | Apache-2.0 | 1,553,070,585,000 | 1,553,070,585,000 | null | UTF-8 | Lean | false | false | 103,853 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Abhimanyu Pallavi Sudhir, Jean Lo, Calle Sönne
-/
import tactic.linarith data.complex.exponential analysis.specific_limits
group_theory.quotient_group analysis.comple... |
662af1a18106179618f7588c559f1c7f9ab21ea1 | 32025d5c2d6e33ad3b6dd8a3c91e1e838066a7f7 | /tests/lean/run/foldConsts.lean | a7bf01e7d445b624f05c9ac16e0ce019c24740df | [
"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 | 274 | lean | import Lean
open Lean
def mkTerm : Nat → Expr
| 0 => mkApp (mkConst `a) (mkConst `b)
| n+1 => mkApp (mkTerm n) (mkTerm n)
def collectConsts (e : Expr) : List Name :=
e.foldConsts [] List.cons
def tst1 : IO Unit :=
IO.println $ collectConsts (mkTerm 1000)
#eval tst1
|
789e8cd1fddf1e3986d35edd5b4b98befee9ff25 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/group_theory/free_abelian_group_finsupp.lean | 0bbc42f979be511d558d73d611bc6c62b31a53d0 | [
"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,994 | lean | /-
Copyright (c) 2021 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import group_theory.free_abelian_group
import group_theory.is_free_group
import data.finsupp.basic
import data.equiv.module
import linear_algebra.dimension
/-!
# Is... |
c007a8c67a432a02cfda5bba609ee4a89b7a1b90 | 8e6cad62ec62c6c348e5faaa3c3f2079012bdd69 | /src/topology/separation.lean | 9906a1bdfeff8fbdec2a59d4e11b373bb916ce3a | [
"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 | 42,633 | 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
Separation properties of topological spaces.
-/
import topology.subset_properties
import topology.connected
open set filter
open_locale topological_spa... |
c68a864b7d3898136e069d332c62a327e20f7f1a | 3dc4623269159d02a444fe898d33e8c7e7e9461b | /.github/workflows/project_1_a_decrire/lean-scheme-submission/src/spectrum_of_a_ring/structure_presheaf_stalks.lean | a12eb932f407db8d672d4386ca1566d3e736e2a0 | [] | no_license | Or7ando/lean | cc003e6c41048eae7c34aa6bada51c9e9add9e66 | d41169cf4e416a0d42092fb6bdc14131cee9dd15 | refs/heads/master | 1,650,600,589,722 | 1,587,262,906,000 | 1,587,262,906,000 | 255,387,160 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,703 | lean | /-
The stalks of the structure presheaf on the basis are local rings.
-/
import ring_theory.ideals
import ring_theory.localization
import to_mathlib.localization.local_rings
import to_mathlib.localization.localization_alt
import sheaves.stalk_of_rings_on_standard_basis
import spectrum_of_a_ring.structure_presheaf
im... |
418db3c569d0c2b055248ad8ea03e5d31a5ca5d8 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/category_theory/monad/products.lean | fea2f76ee96801adbaba4e7a5dfd724c6e1916ef | [
"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 | 3,984 | 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.over
import category_theory.monad.algebra
import category_theory.limits.shapes.binary_products
/-!
# Algebras for the coproduct monad
The functor... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.