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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
bb621dbc58cd8bc8b71af7f81c5bfa99f426d86b | 22c48ae6a9e6627f926537035c9a55dde9138135 | /src/game/intro.lean | 79536120cfeb5e77c1e1a72f4edc06f799ada0c9 | [
"Apache-2.0"
] | permissive | stanescuUW/rational-number-game | f23826b857266728588c5caf5880aa1fa7f09230 | 7504b764f7d95e3655a41cd131bd36234d23b1fc | refs/heads/master | 1,669,987,436,451 | 1,597,963,810,000 | 1,597,963,810,000 | 289,119,348 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 1,641 | lean | /-
# The Rational Number Game, version 0.1beta
## By Dan Stanescu
# What is this game?
Welcome to the rational number game -- a game to help undergraduates learn analysis through Lean,
a formal proof verification system. The game explores some basic facts about the rationals,
starting with the fact that the square... |
12bfb36775184b43f02d01a77703633502aff0b5 | ae1e94c332e17c7dc7051ce976d5a9eebe7ab8a5 | /tests/bench/rbmap3.lean | ea3fbaae9cfbe47c3ce6e0dc885cf601a8b7a7c9 | [
"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 | 8,997 | lean | prelude
import init.core init.system.io init.data.ordering
universes u v w
inductive Rbcolor
| red | black
inductive Rbnode (α : Type u) (β : α → Type v)
| leaf {} : Rbnode
| Node (c : Rbcolor) (lchild : Rbnode) (key : α) (val : β key) (rchild ... |
dea69f37a3f81200a073196b07a76c166f8053c3 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/tactic/converter/apply_congr_auto.lean | 3a0c7339d7a826638c658cf917123b434c46d840 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,452 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Lucas Allen, Scott Morrison
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.tactic.interactive
import Mathlib.tactic.converter.interactive
import Mathlib.... |
a8da04dd1334bdfdbf4f62a9d25f45a341b83e85 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/tactic/lint/frontend.lean | 6c844152f169bab667602cc09732def96b35e232 | [
"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,630 | lean | /-
Copyright (c) 2020 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Robert Y. Lewis, Gabriel Ebner
-/
import tactic.lint.basic
/-!
# Linter frontend and commands
This file defines the linter commands which spot common mistakes in ... |
903f28955bd57aebb18966d4313a3ca02b62aeeb | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/algebra/ordered_group.lean | 0be71159cd07a9d4d3523b17512b458069898c32 | [
"Apache-2.0"
] | permissive | vaibhavkarve/mathlib | a574aaf68c0a431a47fa82ce0637f0f769826bfe | 17f8340912468f49bdc30acdb9a9fa02eeb0473a | refs/heads/master | 1,621,263,802,637 | 1,585,399,588,000 | 1,585,399,588,000 | 250,833,447 | 0 | 0 | Apache-2.0 | 1,585,410,341,000 | 1,585,410,341,000 | null | UTF-8 | Lean | false | false | 28,109 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Johannes Hölzl
Ordered monoids and groups.
-/
import algebra.group.units algebra.group.with_one algebra.group.type_tags
import order.bounded_lattice tactic.basic
univ... |
b3792e88cb752190527963fea1e988252548c4a7 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/tactic/lint/type_classes.lean | 6a0ed508acd37a00c40feb4cd52413ee49451a95 | [
"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 | 18,032 | lean | /-
Copyright (c) 2020 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Robert Y. Lewis, Gabriel Ebner
-/
import tactic.lint.basic
/-!
# Linters about type classes
This file defines several linters checking the correct usage of type c... |
fa6f11f4f69cc57d1d5727c9f3a9b2304e366371 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /library/algebra/ordered_ring.lean | 761d3c4cb7a60a2599da94e1ee47f55e65962347 | [
"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 | 29,386 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
Here an "ordered_ring" is partially ordered ring, which is ordered with respect to both a weak
order and an associated strict order. Our numeric structures (int, rat, and... |
7bccd865742322fe4c94f8ed915e8ea98c49328c | 94e33a31faa76775069b071adea97e86e218a8ee | /src/data/sum/order.lean | d4480d93a0e80dfff56f00b80d00870a85f57b40 | [
"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 | 22,596 | lean | /-
Copyright (c) 2021 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies
-/
import order.hom.basic
/-!
# Orders on a sum type
This file defines the disjoint sum and the linear (aka lexicographic) sum of two orders and provides
relation instance... |
a1914dd7d9f87a569797cfd370065e2db4dac296 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/analysis/convex/topology.lean | c8248ad88ad8928b0251e01d2ff4ff72883823c6 | [
"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 | 16,543 | 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 Kudryashov
-/
import analysis.convex.combination
import analysis.convex.strict
import topology.path_connected
import topology.algebra.affine
import topology.a... |
ed3b4912ed130086f5857564747c0fcf30970d96 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/analysis/complex/circle.lean | 5e5c94ccdf85709780b95ec773ce33d51abf6bd5 | [
"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 | 4,908 | lean | /-
Copyright (c) 2021 Heather Macbeth. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Heather Macbeth
-/
import analysis.special_functions.exp
import topology.continuous_function.basic
/-!
# The circle
This file defines `circle` to be the metric sphere (`metric.spher... |
93ae41eced3dab42350626100456826e0fce22de | 63abd62053d479eae5abf4951554e1064a4c45b4 | /test/norm_cast.lean | b27b07eae174fe2f2bb3746422948839884f7127 | [
"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 | 4,182 | lean | /-
Tests for norm_cast
-/
import tactic.norm_cast
import data.complex.basic -- ℕ, ℤ, ℚ, ℝ, ℂ
import data.real.ennreal
constants (an bn cn dn : ℕ) (az bz cz dz : ℤ) (aq bq cq dq : ℚ)
constants (ar br cr dr : ℝ) (ac bc cc dc : ℂ)
example : (an : ℤ) = bn → an = bn := by {intro h, exact_mod_cast h}
example : an = bn → (... |
dd9172d6e2c7dc60c0948f3f001253fd43d7d514 | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/data/quot.lean | 8d39c0779b04902c7a56b4e131d1bb9749b7988e | [
"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 | 21,108 | 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 logic.relator
/-!
# Quotient types
This module extends the core library's treatment of quotient types (`init.data.quot`).
## Tags
quotient
-/
variables {α... |
643ca2d4f08609cea7234e2766bccb585fb69506 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/topology/urysohns_lemma.lean | fee103e9d2dd19c869cb1a706e8e8375196e94e2 | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 12,652 | 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 analysis.normed_space.add_torsor
import linear_algebra.affine_space.ordered
import topology.continuous_function.basic
/-!
# Urysohn's lemma
In this f... |
04a0e7652a50d9c5c0e93d0c1ff66318e1bbf0a4 | 2c41ae31b2b771ad5646ad880201393f5269a7f0 | /Lean/Qualities/Cost.lean | 583d5d167dab3581f21b7c2dda24e4768310ccd5 | [] | no_license | kevinsullivan/Boehm | 926f25bc6f1a8b6bd47d333d936fdfc278228312 | 55208395bff20d48a598b7fa33a4d55a2447a9cf | refs/heads/master | 1,586,127,134,302 | 1,488,252,326,000 | 1,488,252,326,000 | 32,836,930 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 524 | lean | -- Cost
/-
[Cost] is parameterized by an instance of type [SystemType], and it's a sub-attribute to [Efficient].
-/
import SystemModel.System
inductive Cost (sys_type: SystemType): Prop
| intro : (exists cost: sys_type ^.Contexts -> sys_type ^.Phases -> sys_type ^.Stakeholders -> @SystemInstance sys_type ->... |
c1e9fb2df4c5d344a872d8e0d5940da70b9dff7f | 367134ba5a65885e863bdc4507601606690974c1 | /src/data/equiv/encodable/lattice.lean | 144ce4e0a69290c47980137a42eec8792e8bbf0b | [
"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,942 | lean | /-
Copyright (c) 2020 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Floris van Doorn
-/
import data.equiv.encodable.basic
import data.finset.basic
import data.set.disjointed
/-!
# Lattice operations on encodable types
Lemmas about lattice and set ope... |
a5d2b8533c04a89dd28b017b99b92afb1ede5805 | 1136b4d61007050cc632ede270de45a662f8dba4 | /tests/lean/run/check_constants.lean | 9c3a8ce7be33ae9261dabe1154f40112e413994c | [
"Apache-2.0"
] | permissive | zk744750315/lean | 7fe895f16cc0ef1869238a01cae903bbd623b4a9 | c17e5b913b2db687ab38f53285326b9dbb2b1b6e | refs/heads/master | 1,618,208,425,413 | 1,521,520,544,000 | 1,521,520,936,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 14,359 | 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 '" +... |
848ac16cb1dad7f833d5c7b16c01bb4dc552bc17 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/group_theory/coset.lean | 63dd0d429a8e555228765a401db1c84f5fbe132c | [
"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 | 23,289 | lean | /-
Copyright (c) 2018 Mitchell Rowett. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mitchell Rowett, Scott Morrison
-/
import algebra.quotient
import group_theory.group_action.basic
import tactic.group
/-!
# Cosets
This file develops the basic theory of left and r... |
c4970275cf1e9efc3095831c3f824634f0ba7a67 | bb31430994044506fa42fd667e2d556327e18dfe | /src/data/nat/prime.lean | 57775b325ca8a66dcb3500e20c8c05d2b66c819c | [
"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 | 26,916 | 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 algebra.associated
import algebra.parity
import data.int.dvd.basic
import data.int.units
import data.nat.factorial.ba... |
362b65343bcdc6a1d7944c626478fdd89bec4d69 | 30b012bb72d640ec30c8fdd4c45fdfa67beb012c | /analysis/measure_theory/integration.lean | 9b3e1a0dc5c14afb2487c599b3b39b2aadce5d49 | [
"Apache-2.0"
] | permissive | kckennylau/mathlib | 21fb810b701b10d6606d9002a4004f7672262e83 | 47b3477e20ffb5a06588dd3abb01fe0fe3205646 | refs/heads/master | 1,634,976,409,281 | 1,542,042,832,000 | 1,542,319,733,000 | 109,560,458 | 0 | 0 | Apache-2.0 | 1,542,369,208,000 | 1,509,867,494,000 | Lean | UTF-8 | Lean | false | false | 29,136 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Johannes Hölzl
Lebesgue integral on `ennreal`.
We define simple functions and show that each Borel measurable function on `ennreal` can be
approximated by a sequence ... |
59c453e3b60ce9d18e2f74e835d22b2147f912e8 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/group_theory/free_group.lean | 08b1a4186c42581c8b9931c8268e48dc3b1d4264 | [
"Apache-2.0"
] | permissive | dupuisf/mathlib | 62de4ec6544bf3b79086afd27b6529acfaf2c1bb | 8582b06b0a5d06c33ee07d0bdf7c646cae22cf36 | refs/heads/master | 1,669,494,854,016 | 1,595,692,409,000 | 1,595,692,409,000 | 272,046,630 | 0 | 0 | Apache-2.0 | 1,592,066,143,000 | 1,592,066,142,000 | null | UTF-8 | Lean | false | false | 30,910 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
Free groups as a quotient over the reduction relation `a * x * x⁻¹ * b = a * b`.
First we introduce the one step reduction relation
`free_group.red.step`: w * x * x⁻¹ * v ~... |
addf5a7fa190cda3dcefc2e3da48afa0f044e130 | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /src/category_theory/preadditive/biproducts.lean | f414182f78e8b4db50c4dfd7ae08f7c576413827 | [
"Apache-2.0"
] | permissive | kmill/mathlib | ea5a007b67ae4e9e18dd50d31d8aa60f650425ee | 1a419a9fea7b959317eddd556e1bb9639f4dcc05 | refs/heads/master | 1,668,578,197,719 | 1,593,629,163,000 | 1,593,629,163,000 | 276,482,939 | 0 | 0 | null | 1,593,637,960,000 | 1,593,637,959,000 | null | UTF-8 | Lean | false | false | 11,601 | 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.limits.shapes.biproducts
import category_theory.preadditive
import tactic.abel
/-!
# Basic facts about morphisms between biproducts in preaddi... |
5c3b544d1aaa93549adf4c060e7a865efc54c383 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /stage0/src/Lean/Elab/PreDefinition/MkInhabitant.lean | 42f7e38014b1d1443e9945d8002ef444cec0f955 | [
"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,437 | 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.AppBuilder
namespace Lean.Elab
open Meta
private def mkInhabitant? (type : Expr) : MetaM (Option Expr) := do
try
pure $ some (← mkAr... |
12aa98927d6c93f2d0d311d43de0fb98d019f890 | 38bf3fd2bb651ab70511408fcf70e2029e2ba310 | /src/algebra/module.lean | 6bf0741958dcd47ce58b1aa3b2efa7cc1583be83 | [
"Apache-2.0"
] | permissive | JaredCorduan/mathlib | 130392594844f15dad65a9308c242551bae6cd2e | d5de80376088954d592a59326c14404f538050a1 | refs/heads/master | 1,595,862,206,333 | 1,570,816,457,000 | 1,570,816,457,000 | 209,134,499 | 0 | 0 | Apache-2.0 | 1,568,746,811,000 | 1,568,746,811,000 | null | UTF-8 | Lean | false | false | 15,490 | lean | /-
Copyright (c) 2015 Nathaniel Thomas. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nathaniel Thomas, Jeremy Avigad, Johannes Hölzl, Mario Carneiro
Modules over a ring.
## Implemetation notes
Throughout the `linear_map` section implicit `{}` brackets are often u... |
1aad4ec2fbf8a0069adc5d81839184e1cbfe3300 | 4fa118f6209450d4e8d058790e2967337811b2b5 | /src/sheaves/sheaf_of_rings.lean | acab23414355813f0b320946a799b41efe79dad4 | [
"Apache-2.0"
] | permissive | leanprover-community/lean-perfectoid-spaces | 16ab697a220ed3669bf76311daa8c466382207f7 | 95a6520ce578b30a80b4c36e36ab2d559a842690 | refs/heads/master | 1,639,557,829,139 | 1,638,797,866,000 | 1,638,797,866,000 | 135,769,296 | 96 | 10 | Apache-2.0 | 1,638,797,866,000 | 1,527,892,754,000 | Lean | UTF-8 | Lean | false | false | 988 | lean | /-
Sheaf of rings.
https://stacks.math.columbia.edu/tag/0071
Author: Ramon Fernandez Mir
-/
import sheaves.sheaf
import sheaves.presheaf_of_rings
universes u
-- A sheaf of rings is essentially a sheaf of types because we assume that the
-- category of commutative rings has limits (proved later). This is tag ... |
807d11c36e9c3b4b5b609e198e8d8522fe6cd519 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/geometry/euclidean/monge_point.lean | f53ccdd8a0b24f811dd0991ee7e0127d9e2b07db | [] | 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 | 25,520 | lean | /-
Copyright (c) 2020 Joseph Myers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Joseph Myers.
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.geometry.euclidean.circumcenter
import Mathlib.PostPort
universes u_1 u_2
namespace Mathlib
... |
bb8d7eaf372de3f6451f6318cd7d357443a32a0d | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/data/dlist/basic.lean | 80ad4f332badcc9acf41ae9bb31b3ccd853bf78b | [
"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 | 388 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
-/
import data.dlist
/-- Concatenates a list of difference lists to form a single
difference list. Similar to `list.join`. -/
def dlist.join {α : Type*} : list (dlist α) → d... |
9d1a43bf71c134368850b7bd361d00115c3daa17 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/topology/sheaves/forget_auto.lean | fe5400e9542bf77e162bc83f6dbbd86fd60c2c7d | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,488 | 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.topology.sheaves.sheaf
import Mathlib.category_theory.limits.preserves.shapes.products
impo... |
3e3cb877fd07982dc50567cd7e1c13b7f9eb3371 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/playground/smap.lean | 40f511657eb556530b0ab38b33c27d1f7b8e046e | [
"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 | 657 | lean | import init.lean.smap
abbrev Map : Type := Lean.SMap Nat Bool (λ a b, a < b)
@[extern "lean_smap_foreach_test"]
constant foreachTest : Map → Nat := default _
def test1 (n₁ n₂ : Nat) : IO Unit :=
let m : Map := {} in
let m := n₁.fold (λ i (m : Map), m.insert i (i % 2 == 0)) m in
let m := m.switch in
let m := n₂.fold ... |
1d1ef8edde98d72f4e668b96ea56aa5939da34a2 | c39706ea6783f804f4403b8f001320a502de6f5a | /fabstract/Green_B_and_Tao_T_ArithmeticProgressionsInPrimes/fabstract.lean | ecfbcce0ff1672cb1422f388f4857139a30024d4 | [
"CC-BY-4.0"
] | permissive | semorrison/formalabstracts | bb888dc605e789f4ef1d83635f3b8b9540dd0157 | e547f5939875ac6677b01ec6086d40992fa92629 | refs/heads/master | 1,609,531,064,153 | 1,501,856,066,000 | 1,501,856,066,000 | 98,728,403 | 0 | 0 | null | 1,501,327,991,000 | 1,501,327,991,000 | null | UTF-8 | Lean | false | false | 824 | lean | import meta_data
namespace Green_B_and_Tao_T_ArithmeticProgressionsInPrimes
def prime (n : nat) : Prop := n > 1 ∧ (∀ m < n, (m = 0) ∨ (m = 1) ∨ (n % m ≠ 0))
-- A statement of Green & Tao's theorem about arithmetic progressions in primes
axiom arithmetic_progressions_in_primes :
∀ n k : nat, ∃ m ≥ n, ∃ r ≥ 1, ∀ i < k... |
9a4f12d093b49b198625c43aa27f2c96e2f28d15 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/lake/Lake/Util/OptionIO.lean | e1ba2d74baf1496706ee6358d428b806ea75334e | [
"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,625 | lean | /-
Copyright (c) 2021 Mac Malone. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mac Malone
-/
namespace Lake
/-- Conceptually identical to `OptionT BaseIO`, but practically more efficient. -/
def OptionIO := EIO PUnit
instance : Monad OptionIO := inferInstanceAs (Mo... |
88b9f484c7d15be14e33af40e8b5987e45d190c4 | 2fbe653e4bc441efde5e5d250566e65538709888 | /src/data/set/lattice.lean | 05f6fdb541b9ab74fc8a15720dc02393e2f37f37 | [
"Apache-2.0"
] | permissive | aceg00/mathlib | 5e15e79a8af87ff7eb8c17e2629c442ef24e746b | 8786ea6d6d46d6969ac9a869eb818bf100802882 | refs/heads/master | 1,649,202,698,930 | 1,580,924,783,000 | 1,580,924,783,000 | 149,197,272 | 0 | 0 | Apache-2.0 | 1,537,224,208,000 | 1,537,224,207,000 | null | UTF-8 | Lean | false | false | 34,849 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Johannes Hölzl, Mario Carneiro
-- QUESTION: can make the first argument in ∀ x ∈ a, ... implicit?
-/
import logic.basic data.set.basic data.equiv.basi... |
e592d5f210460c931d2e94c2b1e090701c6426ee | b074a51e20fdb737b2d4c635dd292fc54685e010 | /src/data/padics/padic_norm.lean | ca4423a0ba30b88b5e6ba5fceb6b4150e7a5baf9 | [
"Apache-2.0"
] | permissive | minchaowu/mathlib | 2daf6ffdb5a56eeca403e894af88bcaaf65aec5e | 879da1cf04c2baa9eaa7bd2472100bc0335e5c73 | refs/heads/master | 1,609,628,676,768 | 1,564,310,105,000 | 1,564,310,105,000 | 99,461,307 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 16,925 | lean | /-
Copyright (c) 2018 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
-/
import data.rat.basic algebra.gcd_domain algebra.field_power
import ring_theory.multiplicity tactic.ring
import data.real.cau_seq
import tactic.norm_cast
/-!
# p-... |
b87396b1d22d47664877ea2e7a82b8d40514fba5 | 82e44445c70db0f03e30d7be725775f122d72f3e | /archive/100-theorems-list/16_abel_ruffini.lean | 0e79ae86ab76a97094c7387d561bc40b5b7fc4fa | [
"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 | 7,900 | 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 field_theory.abel_ruffini
import analysis.calculus.local_extr
/-!
Construction of an algebraic number that is not solvable by radicals.
The main ingredients... |
ff38b04ec7ed63d9bc6731c8cb7f4a854e27715f | ddf69e0b8ad10bfd251aa1fb492bd92f064768ec | /src/linear_algebra/eigenspace.lean | eb157806a8756d2da107adaf232a908d4f52ae13 | [
"Apache-2.0"
] | permissive | MaboroshiChan/mathlib | db1c1982df384a2604b19a5e1f5c6464c7c76de1 | 7f74e6b35f6bac86b9218250e83441ac3e17264c | refs/heads/master | 1,671,993,587,476 | 1,601,911,102,000 | 1,601,911,102,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 24,117 | lean | /-
Copyright (c) 2020 Alexander Bentkamp. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Alexander Bentkamp.
-/
import field_theory.algebraic_closure
import linear_algebra.finsupp
import linear_algebra.matrix
/-!
# Eigenvectors and eigenvalues
This file defines eigen... |
8572a53e92acceb4867d6b06036aaaa457a1a7b9 | d1bbf1801b3dcb214451d48214589f511061da63 | /src/order/complete_lattice.lean | 96234676af8027c0bfe85e54843e4dc75f15555e | [
"Apache-2.0"
] | permissive | cheraghchi/mathlib | 5c366f8c4f8e66973b60c37881889da8390cab86 | f29d1c3038422168fbbdb2526abf7c0ff13e86db | refs/heads/master | 1,676,577,831,283 | 1,610,894,638,000 | 1,610,894,638,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 39,794 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
-/
import order.bounds
/-!
# Theory of complete lattices
## Main definitions
* `Sup` and `Inf` are the supremum and the infimum of a set;
* `supr (f : ι → α)` and `in... |
ffb0ccb137d73e62e953e69201a92e0e57cc2969 | f1b175e38ffc5cc1c7c5551a72d0dbaf70786f83 | /data/set/finite.lean | a4e7708e3a2c74e89e6ada102c8e9096a0d95d9f | [
"Apache-2.0"
] | permissive | mjendrusch/mathlib | df3ae884dd5ce38c7edf452bcbfd3baf4e3a6214 | 5c209edb7eb616a26f64efe3500f2b1ba95b8d55 | refs/heads/master | 1,585,663,284,800 | 1,539,062,055,000 | 1,539,062,055,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 13,250 | 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
Finite sets.
-/
import data.set.lattice data.nat.basic logic.function
data.fintype
open set lattice function
universes u v w
variables {α : Typ... |
f57afe6f7696db0fbad7c34be85fc5189a7ee412 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/over3.lean | 8267330e9c876db64c13fc4dc15a58ac59aadbff | [
"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 | 197 | lean | constant foo.f {A B : Type} : (A → B) → (B → A)
constant bla.f {A : Type} : (A → nat) → (A → nat)
open foo bla
noncomputable example : nat → bool :=
f (λ b, bool.cases_on b 0 1)
|
fa87dc36dba6f44dcdbbd6ea0d8ddfc554007659 | 0bf99ea6e10a791d50ee4597247799c17b488264 | /src/Test.lean | e2ea959e523ced3dc069dbae01b6f4675ff1efdc | [] | no_license | laughinggas/DVR | 746a40ead219988f295979010322f5950938e914 | 2bd99457817d3bb4d62d30ee2f2c0b4f9083ef76 | refs/heads/master | 1,669,799,663,699 | 1,595,844,424,000 | 1,595,844,424,000 | 275,800,206 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 21,029 | lean | import ring_theory.ideals
import ring_theory.principal_ideal_domain
import ring_theory.localization
import tactic
import order.bounded_lattice
import algebra.field_power
import order.conditionally_complete_lattice
universe u
class discrete_valuation_ring (R : Type u) [integral_domain R] [is_principal_ideal_ri... |
5b595f11f2e7ef8835baf6d874b2bc47c425dd51 | e61a235b8468b03aee0120bf26ec615c045005d2 | /src/Init/Lean/Elab/Declaration.lean | 85c9e2e2403963c0fcb907d150e8d8938c55a70c | [
"Apache-2.0"
] | permissive | SCKelemen/lean4 | 140dc63a80539f7c61c8e43e1c174d8500ec3230 | e10507e6615ddbef73d67b0b6c7f1e4cecdd82bc | refs/heads/master | 1,660,973,595,917 | 1,590,278,033,000 | 1,590,278,033,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,358 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Sebastian Ullrich
-/
prelude
import Init.Lean.Util.CollectLevelParams
import Init.Lean.Elab.Definition
namespace Lean
namespace Elab
namespace Command
def e... |
3f07ef23e6c438eedd4155a7f09135ee37a70b39 | 5ae26df177f810c5006841e9c73dc56e01b978d7 | /src/set_theory/cardinal.lean | 7444a5db91d8d2786be45b1c33918e8d02828ce8 | [
"Apache-2.0"
] | permissive | ChrisHughes24/mathlib | 98322577c460bc6b1fe5c21f42ce33ad1c3e5558 | a2a867e827c2a6702beb9efc2b9282bd801d5f9a | refs/heads/master | 1,583,848,251,477 | 1,565,164,247,000 | 1,565,164,247,000 | 129,409,993 | 0 | 1 | Apache-2.0 | 1,565,164,817,000 | 1,523,628,059,000 | Lean | UTF-8 | Lean | false | false | 42,086 | 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 data.set.countable data.quot logic.function set_theory.schroeder_bernstein
/-!
# Cardinal Numbers
We define cardinal numbers as a quotient of... |
a6509240aa015bfbd71985762d4963cca0e2cfea | 4727251e0cd73359b15b664c3170e5d754078599 | /src/analysis/normed_space/star/spectrum.lean | 4575aad083a64d81a851daacdffc65cec8bcb506 | [
"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 | 5,154 | lean | /-
Copyright (c) 2022 Jireh Loreaux. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jireh Loreaux
-/
import analysis.normed_space.star.basic
import analysis.normed_space.spectrum
import algebra.star.module
import analysis.normed_space.star.exponential
/-! # Spectral p... |
bb838a93757d6b0c6db8810c844dd1666f861cc3 | 56af0912bd25910f5caae91d6dd0603b0c032989 | /kb_solutions/of_real.lean | df663d53ade7cd06fa3c9f3f0d49c8de8f131ad9 | [
"Apache-2.0"
] | permissive | isabella232/complex-number-game | ae36e0b1df9761d9df07049ca29c91ae44dbdc2d | 3d767f14041f9002e435bed3a3527fdd297c166d | refs/heads/master | 1,679,305,953,116 | 1,606,397,567,000 | 1,606,397,567,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,747 | lean | import complex.kb_solutions.norm_sq
/-! # Coercion
This file sets up the coercion from the reals to the complexes, sending `r` to `⟨r, 0⟩`.
Mathematically it is relatively straightforward.
-/
namespace complex
/-- The canonical map from ℝ to ℂ. -/
def of_real (r : ℝ) : ℂ := ⟨r, 0⟩
/-- The coercion from ℝ to ℂ se... |
53c25f4fa6279172c3f222dcc6970d8010794944 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/isDefEqCheckAssignmentBug.lean | bc13c13b8e29bf7c34c977ddffb2cfd94cb4e95b | [
"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 | 838 | lean | import Lean
open Lean
open Lean.Meta
def f (x : Type) := x
def tst : MetaM Unit := do
let m1 ← mkFreshExprMVar none
withLocalDeclD `x m1 fun x => do
trace[Meta.debug] "{x} : {← inferType x}"
trace[Meta.debug] "{m1} : {← inferType m1}"
let m2 ← mkFreshExprMVar (mkSort levelOne)
let t ← mkAppM ``f... |
e75643faad74096213d3b7552e9f0720e9481140 | b7fc5b86b12212bea5542eb2c9d9f0988fd78697 | /src/exercises_sources/tuesday/numbers.lean | b07e0f4e6cacd8c949120be3bf0ed161719cb2d0 | [] | no_license | stjordanis/lftcm2020 | 3b16591aec853c8546d9c8b69c0bf3f5f3956fee | 1f3485e4dafdc587b451ec5144a1d8d3ec9b411e | refs/heads/master | 1,675,958,865,413 | 1,609,901,722,000 | 1,609,901,722,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,265 | lean | import tactic
import data.real.basic
import data.padics
import data.int.gcd
/-!
## Exercises about numbers and casts
-/
/-!
## First exercises
These first examples are just to get you comfortable with
`norm_num`, `norm_cast`, and friends.
-/
example : 12345 < 67890 :=
begin
sorry
end
example {α : Type} [lin... |
f822f9ee99d63bfbaac42473664fc532d6fb7ece | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/combinatorics/set_family/compression/down.lean | 2445f2eb75c105d9adf14fed1ae4b7041fde04b9 | [
"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 | 7,693 | 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 data.finset.card
/-!
# Down-compressions
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding PR to mathlib4.
This file... |
62718852eb60db3b510cc9b94bf8528cac303d46 | 50b3917f95cf9fe84639812ea0461b38f8f0dbe1 | /Examples/sheaf_on_opens_total_glueing.lean | c775f30e6eea4083966aa59cad476e636ac36365 | [] | no_license | roro47/xena | 6389bcd7dcf395656a2c85cfc90a4366e9b825bb | 237910190de38d6ff43694ffe3a9b68f79363e6c | refs/heads/master | 1,598,570,061,948 | 1,570,052,567,000 | 1,570,052,567,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 21,166 | lean | import order.lattice -- for lattice.semilattice_inf
import order.bounds -- for is_lub
import algebra.ring -- for is_ring_hom
import topology.opens -- only for the conjecture that i need precisely opens α
--import sheaves.sheaf
-- import sheaves.covering.covering
-- import sheaves.presheaf
import data.equiv.basic
im... |
a4d1ba63b11c773f4d7798ec738c89de5b66033a | 94e33a31faa76775069b071adea97e86e218a8ee | /src/algebra/support.lean | edff54bb49ddb32b4b7db670a3dc4a8bda3f58ab | [
"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 | 12,389 | 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 order.conditionally_complete_lattice
import algebra.big_operators.basic
import algebra.group.prod
import algebra.group.pi
import algebra.module.pi
/-!
# Sup... |
5d699680d23aa046f3f527762a764637bd1acbbf | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/matrix/dmatrix.lean | dacbb08124504f54133e1afaccc04630edbd9ab6 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 5,446 | lean | /-
Copyright (c) 2021 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import data.fintype.basic
/-!
# Matrices
-/
universes u u' v w z
/-- `dmatrix m n` is the type of dependently typed matrices
whose rows are indexed by the fintype `... |
412e76850ce258019f2de0a259f0687cada381bf | 2f8bf12144551bc7d8087a6320990c4621741f3d | /library/init/lean/elaborator.lean | fa0281abb5b815f1e27c98af3e858b1218a983ef | [
"Apache-2.0"
] | permissive | jesse-michael-han/lean4 | eb63a12960e69823749edceb4f23fd33fa2253ce | fa16920a6a7700cabc567aa629ce4ae2478a2f40 | refs/heads/master | 1,589,935,810,594 | 1,557,177,860,000 | 1,557,177,860,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 42,017 | lean | /-
Copyright (c) 2018 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Sebastian Ullrich
Elaborator for the Lean language: takes commands and produces side effects
-/
prelude
import init.lean.parser.module
import init.lean.expander
import init.lean... |
f7c3ad0f416e87b8f3319d44c6d949372a3a0d68 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/1745.lean | 853896cd7517dd6dc4868630ce021f24674a0e2b | [
"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 | 29 | lean | def foo: list nat := [ 1,2, ] |
9600da4828d95892a5e2b8e21ba05e4470e3935c | 367134ba5a65885e863bdc4507601606690974c1 | /src/data/pnat/prime.lean | df6f0675dac73da2ff221fab54d2246cd1409fb8 | [
"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 | 7,471 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro, Neil Strickland
-/
import data.nat.prime
import data.pnat.basic
/-!
# Primality and GCD on pnat
This file extends the theory of `ℕ+` with `gcd`, `lcm` and `prim... |
2cbfb251a29625d0be0cd7578e1eeb4d64adfbc1 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/linear_algebra/quadratic_form/prod.lean | ff99ce8080efc64ef13d182b1c27ef1ed5d95fb4 | [
"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 | 7,979 | 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.quadratic_form.basic
/-! # Quadratic form on product and pi types
## Main definitions
* `quadratic_form.prod Q₁ Q₂`: the quadratic form constructed... |
c46b7e67c061c836a2e9096a92dbe21b92b75d7f | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/data/polynomial/degree/basic.lean | 42798a9feed68edd241d03d7a5fe39e0c6d1732b | [
"Apache-2.0"
] | permissive | dupuisf/mathlib | 62de4ec6544bf3b79086afd27b6529acfaf2c1bb | 8582b06b0a5d06c33ee07d0bdf7c646cae22cf36 | refs/heads/master | 1,669,494,854,016 | 1,595,692,409,000 | 1,595,692,409,000 | 272,046,630 | 0 | 0 | Apache-2.0 | 1,592,066,143,000 | 1,592,066,142,000 | null | UTF-8 | Lean | false | false | 31,223 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Johannes Hölzl, Scott Morrison, Jens Wagemaker
-/
import data.polynomial.coeff
/-!
# Theory of univariate polynomials
The definitions include
`degree`, `monic`, `leading_... |
b95c4badd880cd93c0c679d1834010a7f0d2bf15 | 271e26e338b0c14544a889c31c30b39c989f2e0f | /src/Init/Lean/Elab/TermApp.lean | 08b9dfc1e283183501d05d34419fc18f16a05ad6 | [
"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 | 18,899 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import Init.Lean.Elab.Term
namespace Lean
namespace Elab
namespace Term
/--
Auxiliary inductive datatype for combining unelaborated syntax
and ... |
3691e49b28eb05ef337cc000478d2bfa41f5627c | a19a4fce1e5677f4d20cbfdf60c04b6386ab8210 | /library/init/wf.lean | 979e586e841f8afe1c47f550d8db6fca9ba8a4f9 | [
"Apache-2.0"
] | permissive | nthomas103/lean | 9c341a316e7d9faa00546462f90a8aa402e17eac | 04eaf184a92606a56e54d0d6c8d59437557263fc | refs/heads/master | 1,586,061,106,806 | 1,454,640,115,000 | 1,454,641,279,000 | 51,127,143 | 0 | 0 | null | 1,454,648,683,000 | 1,454,648,683,000 | null | UTF-8 | Lean | false | false | 4,386 | 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
-/
prelude
import init.relation init.tactic
inductive acc {A : Type} (R : A → A → Prop) : A → Prop :=
intro : ∀x, (∀ y, R y x → acc R y) → acc R x
namespace a... |
c3517769f873eedb52493cf7b12156fc8200d62a | 63abd62053d479eae5abf4951554e1064a4c45b4 | /test/lint.lean | e05d72363a1c5e4fc2d57365daa2fb79fc13cf95 | [
"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 | 4,343 | lean | import tactic.lint
import algebra.ring.basic
def foo1 (n m : ℕ) : ℕ := n + 1
def foo2 (n m : ℕ) : m = m := by refl
lemma foo3 (n m : ℕ) : ℕ := n - m
lemma foo.foo (n m : ℕ) : n ≥ n := le_refl n
instance bar.bar : has_add ℕ := by apply_instance -- we don't check the name of instances
lemma foo.bar (ε > 0) : ε = ε := r... |
6f4a24d0bf8731ef15a6172098b7992d6d03b570 | 05b503addd423dd68145d68b8cde5cd595d74365 | /src/topology/order.lean | db9c7e2f6cefb8e43d2db0f962ba6b46916c50c3 | [
"Apache-2.0"
] | permissive | aestriplex/mathlib | 77513ff2b176d74a3bec114f33b519069788811d | e2fa8b2b1b732d7c25119229e3cdfba8370cb00f | refs/heads/master | 1,621,969,960,692 | 1,586,279,279,000 | 1,586,279,279,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 27,676 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro
-/
import topology.basic
/-!
# Ordering on topologies and (co)induced topologies
Topologies on a fixed type `α` are ordered, by reverse inclusion.
That... |
c180476937493605f5e3153416c7c8ffa1dc5460 | 5e3548e65f2c037cb94cd5524c90c623fbd6d46a | /src_icannos_totilas/anneaux/cpge_anneaux_8.lean | 330b119f78ab18f02765d8c20d33459da382b6cd | [] | 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 | 153 | lean | import data.real.basic
import data.complex.basic
theorem cpge_anneaux_8 (f : ring_hom ℂ ℂ) : (∀ x : ℂ, f x = x) ∨ (f = complex.conj) := sorry
|
cf0e624e06c0bb5a90e424185b36eaa3b761826c | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Elab/Attributes.lean | 4bb6f0247f10df3aa8daa0e5cb0f68638ae7abf8 | [
"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 | 3,121 | 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.Elab.Util
namespace Lean.Elab
structure Attribute where
kind : AttributeKind := AttributeKind.global
name : Name
stx... |
bb3a1d969e1b4444da2f8bbcf58ab004e758a8e8 | 4950bf76e5ae40ba9f8491647d0b6f228ddce173 | /src/order/bounded_lattice.lean | 49be897f7a4c14a7159d7485fd4270374d4db08b | [
"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 | 41,686 | 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
Defines bounded lattice type class hierarchy.
Includes the Prop and fun instances.
-/
import order.lattice
import data.option.basic
import tactic.pi_instances
set_opt... |
883713e489562c663433a5a9987703d522558a7e | 4bcaca5dc83d49803f72b7b5920b75b6e7d9de2d | /src/Lean/Environment.lean | e87f555bbb8592ef0e7e8d8ceb2c9a9dcb851afb | [
"Apache-2.0"
] | permissive | subfish-zhou/leanprover-zh_CN.github.io | 30b9fba9bd790720bd95764e61ae796697d2f603 | 8b2985d4a3d458ceda9361ac454c28168d920d3f | refs/heads/master | 1,689,709,967,820 | 1,632,503,056,000 | 1,632,503,056,000 | 409,962,097 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 34,938 | 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 Lean.ImportingFlag
import Lean.Data.SMap
import Lean.Declaration
import Lean.LocalContext
import Lean.Util.Path
import Lean.U... |
1deca8db6ef486267a537e3108de37b7bd06ff90 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/category_theory/adjunction/default.lean | 857a80d17b1b63edf7833522aaaf6f9ac5624058 | [
"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 | 85 | lean | import category_theory.adjunction.limits
import category_theory.adjunction.opposites
|
42e1bdd37a3fdac0bf5c2cbf58ef90503b394372 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/group_theory/semidirect_product.lean | 202d83c4d5323c2c9868b3c3ef8443141724a18c | [
"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 | 9,065 | lean | /-
Copyright (c) 2020 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import data.equiv.mul_add
import logic.function.basic
import group_theory.subgroup
/-!
# Semidirect product
This file defines semidirect products of groups, and the can... |
47e5adfb1782ff1d201b50f33a2ed5929a860b57 | a4673261e60b025e2c8c825dfa4ab9108246c32e | /src/Lean/Data/Json/Basic.lean | 19f0a5001babe854e58aad099a7ff31c36d10c2d | [
"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 | 4,737 | lean | /-
Copyright (c) 2019 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner, Marc Huisinga
-/
import Std.Data.RBTree
namespace Lean
-- mantissa * 10^-exponent
structure JsonNumber :=
(mantissa : Int) (exponent : Nat)
protected def JsonNumber.... |
45abb74f66e7ab558eaffac63e203dd491351e4a | 206422fb9edabf63def0ed2aa3f489150fb09ccb | /src/algebra/archimedean.lean | 87750a75073b56cb4568e461aafe6f46a8ecd22c | [
"Apache-2.0"
] | permissive | hamdysalah1/mathlib | b915f86b2503feeae268de369f1b16932321f097 | 95454452f6b3569bf967d35aab8d852b1ddf8017 | refs/heads/master | 1,677,154,116,545 | 1,611,797,994,000 | 1,611,797,994,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 12,902 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
Archimedean groups and fields.
-/
import algebra.field_power
import data.rat
variables {α : Type*}
/-- An ordered additive commutative monoid is called `archimedean` ... |
6cab65e604412cf20afd2affce2402c830450c55 | f083c4ed5d443659f3ed9b43b1ca5bb037ddeb58 | /algebra/archimedean.lean | 6d037a1d01d271ea1ff4980b7970a88afb723580 | [
"Apache-2.0"
] | permissive | semorrison/mathlib | 1be6f11086e0d24180fec4b9696d3ec58b439d10 | 20b4143976dad48e664c4847b75a85237dca0a89 | refs/heads/master | 1,583,799,212,170 | 1,535,634,130,000 | 1,535,730,505,000 | 129,076,205 | 0 | 0 | Apache-2.0 | 1,551,697,998,000 | 1,523,442,265,000 | Lean | UTF-8 | Lean | false | false | 9,204 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
Archimedean groups and fields.
-/
import algebra.group_power data.rat data.int.order
local infix ` • ` := add_monoid.smul
variables {α : Type*}
class floor_ring (α) ... |
9e385cf38e46eff2a79a1caf1523b819f741c174 | d450724ba99f5b50b57d244eb41fef9f6789db81 | /src/instructor/lectures/lecture_18.lean | 5165a365cb9dd59d897b5f296194cd73b064eb68 | [] | no_license | jakekauff/CS2120F21 | 4f009adeb4ce4a148442b562196d66cc6c04530c | e69529ec6f5d47a554291c4241a3d8ec4fe8f5ad | refs/heads/main | 1,693,841,880,030 | 1,637,604,848,000 | 1,637,604,848,000 | 399,946,698 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,528 | lean | import data.set
/-
Up to now we have mostly used our
intuition to understand operations
on, and special values (empty and
complete) of sets. Now, to prepare
to state and prove theorems about
sets, we will see how to formalize
these ideas in predicate logic. We
isolate our own definitions in a
namespace so as not to c... |
41c2d1948d8d179c96e43d64fe72641064317083 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/wildcardAlt.lean | 1b47d2ffbd03d966f7ddb659aae9a877e882a22a | [
"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 | 507 | lean | inductive Foo where
| c1 (x : Nat) | c2 | c3 | c4
def bla : Foo → Nat
| .c1 x => x + 1
| _ => 2
example (x : Foo) : bla x > 0 := by
cases x with
| _ => decide -- Error
| c1 => decide
example (x : Foo) : bla x > 0 := by
induction x with
| _ => decide -- Error
| c1 => decide
example (x : Foo) ... |
e721497487462b0f5e2f8b7532449a676b930ed2 | 76df16d6c3760cb415f1294caee997cc4736e09b | /lean/src/tactic/focus_case.lean | 868906c60efda17691f6f899caa80f4b2f233e5c | [
"MIT"
] | permissive | uw-unsat/leanette-popl22-artifact | 70409d9cbd8921d794d27b7992bf1d9a4087e9fe | 80fea2519e61b45a283fbf7903acdf6d5528dbe7 | refs/heads/master | 1,681,592,449,670 | 1,637,037,431,000 | 1,637,037,431,000 | 414,331,908 | 6 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 3,240 | lean | import tactic.basic
open tactic.interactive
open tactic.interactive.case_tag.match_result
setup_tactic_parser
-- The case tactic is taken from https://github.com/leanprover-community/lean/pull/508
private meta def goals_with_matching_tag (ns : list name) :
tactic (list (expr × case_tag) × list (expr × case_tag)) ... |
17d17170d8cdce9069359ee8b8d5a0adc471c472 | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /13_More_Tactics.org.8.lean | bc386f52b0d355710df19d53e7af6ec077cbb312 | [] | 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 | 196 | lean | import standard
variables (A : Type) (a b c d : A)
example (H₁ : a = b) (H₂ : c = b) (H₃ : c = d) : a = d :=
by transitivity b; assumption; transitivity c; symmetry; assumption; assumption
|
47c9772c4d32dafb8321ffb5df2c13c43ade5999 | 2eab05920d6eeb06665e1a6df77b3157354316ad | /src/measure_theory/integral/set_integral.lean | 7c3e25aee859a9731e350add1a99dc9138e3906c | [
"Apache-2.0"
] | permissive | ayush1801/mathlib | 78949b9f789f488148142221606bf15c02b960d2 | ce164e28f262acbb3de6281b3b03660a9f744e3c | refs/heads/master | 1,692,886,907,941 | 1,635,270,866,000 | 1,635,270,866,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 44,879 | lean | /-
Copyright (c) 2020 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou, Yury Kudryashov
-/
import measure_theory.integral.integrable_on
import measure_theory.integral.bochner
import order.filter.indicator_function
/-!
# Set integral
In this... |
e350d72ecad9fff9f56b2bfc43f68c59b86c122d | 7da5ceac20aaab989eeb795a4be9639982e7b35a | /src/tactic/depends.lean | 3e0ed12e4cf3a02cfab9145b44a99d1f8a70257c | [
"MIT"
] | permissive | formalabstracts/formalabstracts | 46c2f1b3a172e62ca6ffeb46fbbdf1705718af49 | b0173da1af45421239d44492eeecd54bf65ee0f6 | refs/heads/master | 1,606,896,370,374 | 1,572,988,776,000 | 1,572,988,776,000 | 96,763,004 | 165 | 28 | null | 1,555,709,319,000 | 1,499,680,948,000 | Lean | UTF-8 | Lean | false | false | 3,984 | lean | /-
Copyright (c) 2019 Koundinya Vajjha. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Koundinya Vajjha
A meta def called `#depends` which gives the names of all the theorems (the statement of) a given definition/theorem depends on.
-/
import data.pfun
open tactic e... |
6ca77d302289d32ff4246c8f6d97a8d8818d521d | ac2987d8c7832fb4a87edb6bee26141facbb6fa0 | /Mathlib/Tactic/Spread.lean | 8d07aa335169055ae5588bba40f661539552763d | [
"Apache-2.0"
] | permissive | AurelienSaue/mathlib4 | 52204b9bd9d207c922fe0cf3397166728bb6c2e2 | 84271fe0875bafdaa88ac41f1b5a7c18151bd0d5 | refs/heads/master | 1,689,156,096,545 | 1,629,378,840,000 | 1,629,378,840,000 | 389,648,603 | 0 | 0 | Apache-2.0 | 1,627,307,284,000 | 1,627,307,284,000 | null | UTF-8 | Lean | false | false | 1,119 | lean | /-
Copyright (c) 2021 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Gabriel Ebner
-/
import Lean
open Lean Parser.Term Macro
/-
This adds support for structure instance spread syntax.
```lean
instance : Foo α where
__ := instSomething -- include fie... |
d056fc26c8c99720b132d0aefdf6d7a591d7b62c | da23b545e1653cafd4ab88b3a42b9115a0b1355f | /examples/quotient_group.lean | cbdecf1284ddda117ec934412e2c251a26eb5416 | [] | no_license | minchaowu/lean-tidy | 137f5058896e0e81dae84bf8d02b74101d21677a | 2d4c52d66cf07c59f8746e405ba861b4fa0e3835 | refs/heads/master | 1,585,283,406,120 | 1,535,094,033,000 | 1,535,094,033,000 | 145,945,792 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,176 | lean | import group_theory.coset data.equiv data.quot
import tidy.tidy
open set function
section quotient_group
variable {α : Type*}
-- Some instances allowing us to use quotient notation
local attribute [instance] left_rel normal_subgroup.to_is_subgroup
-- We now prove two lemmas about elements in normal subgroups. I ha... |
ad853f1718bb6dc7d638afcde0d5faa73a1f24c8 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /test/random.lean | 756e5e3c062c84871038db3398b0bf973e0f50e0 | [
"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,348 | lean | import control.random
import data.nat.prime
import data.zmod.basic
/-- fermat's primality test -/
def primality_test (p : ℕ) : rand bool :=
if h : 2 ≤ p-1 then do
n ← rand.random_r 2 (p-1) h,
-- we do arithmetic with `zmod n` so that modulo and multiplication are interleaved
return $ (n : zmod p)^(p-1) = 1
else ... |
b98b21c53815a6c7d8f067cc22a4a733070abdad | 618003631150032a5676f229d13a079ac875ff77 | /test/linarith.lean | 8b5dc8a3ad9d18e20838549e9ca133dff4d6582b | [
"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 | 4,553 | lean | import tactic.linarith
example (e b c a v0 v1 : ℚ) (h1 : v0 = 5*a) (h2 : v1 = 3*b) (h3 : v0 + v1 + c = 10) :
v0 + 5 + (v1 - 3) + (c - 2) = 10 :=
by linarith
example (ε : ℚ) (h1 : ε > 0) : ε / 2 + ε / 3 + ε / 7 < ε :=
by linarith
example (x y z : ℚ) (h1 : 2*x < 3*y) (h2 : -4*x + z/2 < 0)
(h3 : 12*y - z < ... |
5d03ddf65f3189bcbc9e25d04e2e30ef2f3b0fed | 6b45072eb2b3db3ecaace2a7a0241ce81f815787 | /data/nat/bquant.lean | c8147612911a8e8d28b9d79f6e20b20fd5bc8393 | [] | no_license | avigad/library_dev | 27b47257382667b5eb7e6476c4f5b0d685dd3ddc | 9d8ac7c7798ca550874e90fed585caad030bbfac | refs/heads/master | 1,610,452,468,791 | 1,500,712,839,000 | 1,500,713,478,000 | 69,311,142 | 1 | 0 | null | 1,474,942,903,000 | 1,474,942,902,000 | null | UTF-8 | Lean | false | false | 2,375 | lean | import .sub
open nat
def ball (n : nat) (P : nat → Prop) := ∀ k : ℕ, k < n → P k
def ball' (n : nat) (P : Π (k : ℕ) (p : k < n), Prop) := Π (k : ℕ) (p : k < n), P k p
theorem ball_zero (P : nat → Prop) : ball 0 P :=
λ x Hlt, absurd Hlt (not_lt_zero _)
theorem ball_zero' (P : Π (k : ℕ) (p : k < 0), Prop) : ... |
5f549359995791b41b24647f6deb4eaf0e6032eb | 7282d49021d38dacd06c4ce45a48d09627687fe0 | /tests/lean/using_bug1.lean | 0005259190304dc9276748650d4cf72b45fd0062 | [
"Apache-2.0"
] | permissive | steveluc/lean | 5a0b4431acefaf77f15b25bbb49294c2449923ad | 92ba4e8b2d040a799eda7deb8d2a7cdd3e69c496 | refs/heads/master | 1,611,332,256,930 | 1,391,013,244,000 | 1,391,013,244,000 | 16,361,079 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 408 | lean | variables a b c d : Nat
axiom H : a + (b + c) = a + (b + d)
set_option pp::implicit true
using Nat
check add_succr a
theorem mul_zerol2 (a : Nat) : 0 * a = 0
:= induction_on a
(have 0 * 0 = 0 : trivial)
(λ (n : Nat) (iH : 0 * n = 0),
calc 0 * (n + 1) = (0 * n) + 0 : mul_succr 0 n
... |
f4605de39349bd069507f679f3617c5836087bc7 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /archive/imo/imo1969_q1.lean | d2298fa22500b1c4df66989cad9f992e03d1e2b1 | [
"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 | 2,193 | lean | /-
Copyright (c) 2020 Kevin Lacker. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Lacker
-/
import tactic.linarith
import tactic.norm_cast
import tactic.ring
open int
open nat
/-!
# IMO 1969 Q1
Prove that there are infinitely many natural numbers $a$ with th... |
51c4a973c3db549295810ba4903e030f55f1641e | 22e97a5d648fc451e25a06c668dc03ac7ed7bc25 | /src/data/erased.lean | 5e83d8ec3cd9e8bbc4bcce6fcec03b614c1f295e | [
"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 | 2,123 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
A type for VM-erased data.
-/
import data.equiv.basic
/-- `erased α` is the same as `α`, except that the elements
of `erased α` are erased in the VM in the same way a... |
da50c42580f9f4174fd9b1cc012d7d786de591ba | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/class7.lean | ef5a4ee385457197461f8ef3c4be0f2000ff2f41 | [
"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 | 467 | lean | import logic
open tactic
inductive inh [class] (A : Type) : Type :=
intro : A -> inh A
theorem inh_bool [instance] : inh Prop
:= inh.intro true
set_option trace.class_instances true
theorem inh_fun [instance] {A B : Type} [H : inh B] : inh (A → B)
:= inh.rec (λ b, inh.intro (λ a : A, b)) H
theorem tst {A B : Type}... |
18b170ad208123e6410c0d42a9ce14723555fa73 | 3268ab3a126f0fef71459fbf170dc38efe5d0506 | /algebra/direct_sum.hlean | d0b56de99822a2546a6ce363aacce7bb6a4d76bd | [
"Apache-2.0"
] | permissive | soraismus/Spectral | f043fed1a4e02ddfeba531769b2980eb817471f4 | 32512bf47db3a1b932856e7ed7c7830b1fc07ef0 | refs/heads/master | 1,585,628,705,579 | 1,538,609,948,000 | 1,538,609,974,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,612 | hlean | /-
Copyright (c) 2015 Floris van Doorn, Egbert Rijke, Favonia. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Egbert Rijke, Favonia
Constructions with groups
-/
import .quotient_group .free_abelian_group .product_group
open eq is_equiv algebra is_t... |
67de9912abbfdf4c7c3696d3d73238e8d7d21c84 | 4fa161becb8ce7378a709f5992a594764699e268 | /src/order/order_iso.lean | b3251450357693aac9aac33ab114abf249f0296b | [
"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 | 16,218 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import logic.embedding
import data.nat.basic
import logic.function.iterate
import order.rel_classes
open function
universes u v w
variables {α : Type*} {β : Type*} ... |
5639834cd83c2e1f4ca9cbef757fb0377c7ecefd | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/algebra/floor.lean | 932b5070b00d9907dbfd0ff936c73061f56f8fe6 | [
"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 | 9,808 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Kevin Kappelmann
-/
import data.int.basic
import tactic.linarith tactic.abel
/-!
# Floor and Ceil
## Summary
We define `floor`, `ceil`, and `nat_ceil` functions on li... |
3e8dd38307d1367228eae18bb799236a4a10d936 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/playground/parser1.lean | 4e6cf5d650668cd2347a5c1622059a0913c22aca | [
"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,046 | lean | import init.lean.parser.parser
open Lean
open Lean.Parser
namespace Foo
@[builtinTestParser] def pairParser :=
parser! "(" >> numLit >> "," >> ident >> ")"
@[builtinTestParser] def pairsParser :=
parser! "{" >> sepBy1 testParser "," >> "}"
@[builtinTestParser] def functionParser :=
parser! "fun" >> ident >> "," >> ... |
e7a5a8aeb939679e7c62fce54f505c58ac7951e1 | 6b02ce66658141f3e0aa3dfa88cd30bbbb24d17b | /src/Lean/Elab/Match.lean | 39affaa00ad4aaadb311f6d32cde6863f8730d5d | [
"Apache-2.0"
] | permissive | pbrinkmeier/lean4 | d31991fd64095e64490cb7157bcc6803f9c48af4 | 32fd82efc2eaf1232299e930ec16624b370eac39 | refs/heads/master | 1,681,364,001,662 | 1,618,425,427,000 | 1,618,425,427,000 | 358,314,562 | 0 | 0 | Apache-2.0 | 1,618,504,558,000 | 1,618,501,999,000 | null | UTF-8 | Lean | false | false | 48,802 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Util.CollectFVars
import Lean.Meta.Match.MatchPatternAttr
import Lean.Meta.Match.Match
import Lean.Meta.SortLocalDecls
import Lean.Elab.Syntheti... |
142a9b8f079ee5a9975cf63c001e640200ae8466 | 626e312b5c1cb2d88fca108f5933076012633192 | /src/linear_algebra/matrix/nonsingular_inverse.lean | 77025e6278d1ab88c65820d2746c20457fd74189 | [
"Apache-2.0"
] | permissive | Bioye97/mathlib | 9db2f9ee54418d29dd06996279ba9dc874fd6beb | 782a20a27ee83b523f801ff34efb1a9557085019 | refs/heads/master | 1,690,305,956,488 | 1,631,067,774,000 | 1,631,067,774,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 27,267 | 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.associated
import algebra.regular.smul
import linear_algebra.matrix.determinant
import tactic.linarith
import tactic.ring_exp
/-!
# Nonsingular... |
55ac8cf3ddb88e02d28696e1d8c74f079db23ad3 | 2a70b774d16dbdf5a533432ee0ebab6838df0948 | /_target/deps/mathlib/src/algebra/module/basic.lean | 3b45ac125715f81954ee7c3356f55b68a4205828 | [
"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 | 19,820 | lean | /-
Copyright (c) 2015 Nathaniel Thomas. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nathaniel Thomas, Jeremy Avigad, Johannes Hölzl, Mario Carneiro
-/
import algebra.big_operators.basic
import algebra.group.hom
import algebra.ring.basic
import data.rat.cast
import g... |
6b32b10f3a64e101b72d0fb3b97c5c320359d29d | 46125763b4dbf50619e8846a1371029346f4c3db | /src/tactic/linarith.lean | 2595e49ad106841d9250bdc70e94e7dc4e6de343 | [
"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 | 33,083 | 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.defs meta.rb_map data.tree
/-!
A tactic for discharging linear arithmetic goals using Fourier-Motzkin elimination.
`lin... |
41296e06bcd604561945380c3533219e764d08b1 | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /stage0/src/Init/Util.lean | 7b0e3ce3fdcceda2e2424effd69c55dcae46bc61 | [
"Apache-2.0"
] | permissive | WojciechKarpiel/lean4 | 7f89706b8e3c1f942b83a2c91a3a00b05da0e65b | f6e1314fa08293dea66a329e05b6c196a0189163 | refs/heads/master | 1,686,633,402,214 | 1,625,821,189,000 | 1,625,821,258,000 | 384,640,886 | 0 | 0 | Apache-2.0 | 1,625,903,617,000 | 1,625,903,026,000 | null | UTF-8 | Lean | false | false | 2,666 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import Init.Data.String.Basic
import Init.Data.ToString.Basic
universe u v
/- debugging helper functions -/
@[neverExtract, extern "lean_dbg_trace"... |
aa47a50f13c0867ef790b564da9d03ece8e6dacc | a4673261e60b025e2c8c825dfa4ab9108246c32e | /stage0/src/Init/Data/String/Basic.lean | ab7f3d2ff740eb6ff272b914eaf4f5e8b0e43f65 | [
"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 | 15,873 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
prelude
import Init.Data.List.Basic
import Init.Data.Char.Basic
import Init.Data.Option.Basic
universes u
/-- A byte position in a `String`. Internally, `St... |
52a160c7da7c2ed086664b9f9dafe99d7e0e49b0 | eb9357a70318e50e095b58730bebfe0cffee457f | /lean/love04_functional_programming_demo.lean | ae84a5b50eb046a44c78d2e144a9f9176127f6a0 | [] | no_license | Vierkantor/logical_verification_2021 | 7485dd916953131d501760f023d5b30fbb74d36a | 9500b9c194e22a9ab4067321cfed7a1f445afcfc | refs/heads/main | 1,692,560,845,086 | 1,624,721,275,000 | 1,624,721,275,000 | 416,354,079 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 12,660 | lean | import .lovelib
/-! # LoVe Demo 4: Functional Programming
We take a closer look at the basics of typed functional programming: inductive
types, proofs by induction, recursive functions, pattern matching, structures
(records), and type classes. -/
set_option pp.beta true
set_option pp.generalized_field_notation fal... |
3af71fa752bd70c66965d34bbd7d9c83cfa484b1 | 86f6f4f8d827a196a32bfc646234b73328aeb306 | /examples/logic/unnamed_1891.lean | 5526596290ba0eeab74f41c02c7ee875c3b85a93 | [] | no_license | jamescheuk91/mathematics_in_lean | 09f1f87d2b0dce53464ff0cbe592c568ff59cf5e | 4452499264e2975bca2f42565c0925506ba5dda3 | refs/heads/master | 1,679,716,410,967 | 1,613,957,947,000 | 1,613,957,947,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 163 | lean | import data.real.basic
variable {y : ℝ}
-- BEGIN
example (h : y > 0) : y > 0 ∨ y < -1 :=
or.inl h
example (h : y < -1) : y > 0 ∨ y < -1 :=
or.inr h
-- END |
ff9156e46738da4b37cfbcae87c2e6e1e96e0718 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/group_theory/congruence.lean | 0ab9d20514fa25f8cece613db1ad2a868a771940 | [
"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 | 42,284 | lean | /-
Copyright (c) 2019 Amelia Livingston. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Amelia Livingston
-/
import group_theory.submonoid
import data.setoid
import algebra.pi_instances
/-!
# Congruence relations
This file defines congruence relations: equivalence r... |
456c608310dc34fd3b5f0bc628096d3da1bbbe59 | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /08_Building_Theories_and_Proofs.org.39.lean | 068d8b8c6e1febe7e49ee035a04e77085f6d0b67 | [] | 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 | 103 | lean | import standard
import data.list
open list (renaming induction_on → induction_on)
check induction_on
|
d23658e049fb15104c545cf867038d440139d87c | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/data/polynomial/ring_division.lean | 03a2bee16f93216651554828302116a6d99f4c47 | [
"Apache-2.0"
] | permissive | waynemunro/mathlib | e3fd4ff49f4cb43d4a8ded59d17be407bc5ee552 | 065a70810b5480d584033f7bbf8e0409480c2118 | refs/heads/master | 1,693,417,182,397 | 1,634,644,781,000 | 1,634,644,781,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 28,703 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Johannes Hölzl, Scott Morrison, Jens Wagemaker, Johan Commelin
-/
import data.polynomial.algebra_map
import data.polynomial.degree.lemmas
import data.polynomial.div
/-!
# ... |
37b4953a7d1efebe20305af07dd1ecf29b7f4191 | 367134ba5a65885e863bdc4507601606690974c1 | /docs/tutorial/category_theory/intro.lean | 458709a47fe84617c52d50fd1b4f3cbf9f706f9f | [
"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 | 9,298 | lean | import category_theory.functor_category -- this transitively imports
-- category_theory.category
-- category_theory.functor
-- category_theory.natural_transformation
/-!
# An introduction to category theory in Lean
This is an introduction to the basic usage of category theory (in the mathematical sense) in Lean.
We c... |
7e397816eba485384ed50297aa7d965198e15ba3 | e8159fb1a58abf09f7d75106ba3aa6c1c504c038 | /theorem-proving-in-lean/3.7.2.lean | 07d35c48f452744dc40e869a152d5687a8ea2311 | [] | no_license | ndcroos/lean-snippets | cbf53e777a72964b6875a8c98bdd7eb02e74e246 | b66736347cd80a4143e43397f359dbdf9cbcd491 | refs/heads/master | 1,584,160,922,314 | 1,525,542,053,000 | 1,525,542,053,000 | 131,447,243 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 58 | lean | /-
Prove ¬(p ↔ ¬p) without using classical logic.
-/
|
f706081afe587c884d96718c63b05c42b0e97ced | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/Format.lean | 399f45c63baeb18ea11d75ab5140b7eee8449a67 | [
"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 | 584 | lean | open Lean
open Std
open Std.Format
def eval (w : Nat) (f : Format) : IO Unit := do
IO.println $ f.pretty w
-- hard line breaks should re-evaluate flattening behavior within group
#eval eval 5 $ fill (text "a" ++ line ++ text "b\nlooooooooong" ++ line ++ text "c") ++ line ++ text "d"
-- basic `fill` test
#eval eval 2... |
525feb392ad967204fdac97a912714f82813a320 | 4fa161becb8ce7378a709f5992a594764699e268 | /src/algebra/direct_limit.lean | 1cff3faa6059cf5501fa7635efbda82ae146703b | [
"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 | 25,240 | lean | /-
Copyright (c) 2019 Kenny Lau, Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Chris Hughes
Direct limit of modules, abelian groups, rings, and fields.
See Atiyah-Macdonald PP.32-33, Matsumura PP.269-270
Generalizes the notion of "union", o... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.