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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
caa4d8b849ac2e23e3b6cb815dd8944a31b67292 | fc086f79b20cf002d6f34b023749998408e94fbf | /src/tidy/its.lean | 98695ca16cedae6b1e462efb71b4905d29c287d5 | [] | no_license | semorrison/lean-tidy | f039460136b898fb282f75efedd92f2d5c5d90f8 | 6c1d46de6cff05e1c2c4c9692af812bca3e13b6c | refs/heads/master | 1,624,461,332,392 | 1,559,655,744,000 | 1,559,655,744,000 | 96,569,994 | 9 | 4 | null | 1,538,287,895,000 | 1,499,455,306,000 | Lean | UTF-8 | Lean | false | false | 573 | 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 .transport
namespace tactic
meta def its { α : Type } (e : expr) (discharger : tactic α) : tactic α := (`[refine (transport %%e _)] <|> `[refine ... |
11096752a2e143db3241ae2a8e54cfa78b63a0d4 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/order/smul.lean | 9082ac44abeca2f8021976f01bf8dd3651b2dab3 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 12,397 | lean | /-
Copyright (c) 2020 Frédéric Dupuis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frédéric Dupuis
-/
import algebra.module.pi
import algebra.module.prod
import algebra.order.monoid.prod
import algebra.order.pi
import data.set.pointwise.smul
import tactic.positivity... |
4e6144089d14b2f30e3af24c3f8e55e7c43fae47 | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/field_theory/primitive_element.lean | d6c725ac59e495b4d2df7ebbbcbabc1f6da2e776 | [
"Apache-2.0"
] | permissive | abentkamp/mathlib | d9a75d291ec09f4637b0f30cc3880ffb07549ee5 | 5360e476391508e092b5a1e5210bd0ed22dc0755 | refs/heads/master | 1,682,382,954,948 | 1,622,106,077,000 | 1,622,106,077,000 | 149,285,665 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,806 | lean | /-
Copyright (c) 2020 Thomas Browning, Patrick Lutz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Thomas Browning, Patrick Lutz
-/
import field_theory.adjoin
import field_theory.separable
/-!
# Primitive Element Theorem
In this file we prove the primitive element ... |
5afe07db80d29dc106e84c459f529fba6110627c | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/category_theory/core.lean | b917712a3cd5a2daeab289229d5591d85858b1e9 | [
"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 | 1,613 | lean | /-
Copyright (c) 2019 Scott Morrison All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.groupoid
import category_theory.whiskering
namespace category_theory
universes v₁ v₂ u₁ u₂ -- declare the `v`'s first; see `category_theory.c... |
916f66226e72b47149228211dad95f0de129cda4 | da23b545e1653cafd4ab88b3a42b9115a0b1355f | /test/timing.lean | 8677f7be54a07f856ffa9beca66a14235c9247bc | [] | 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 | 277 | 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 tidy.timing
open tactic
private lemma f : 1 = 1 :=
begin
(time_tactic skip) >>= trace,
simp
end
|
a42e2e497a8cbf2319d24ddd7b009a7b2dc470fe | 1fd908b06e3f9c1252cb2285ada1102623a67f72 | /init/trunc.lean | 2054abc39009dc68ba710ad5f10a58facbc0f69d | [
"Apache-2.0"
] | permissive | avigad/hott3 | 609a002849182721e7c7ae536d9f1e2956d6d4d3 | f64750cd2de7a81e87d4828246d1369d59f16f43 | refs/heads/master | 1,629,027,243,322 | 1,510,946,717,000 | 1,510,946,717,000 | 103,570,461 | 0 | 0 | null | 1,505,415,620,000 | 1,505,415,620,000 | null | UTF-8 | Lean | false | false | 13,184 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Floris van Doorn
Definition of is_trunc (n-truncatedness)
Ported from Coq HoTT.
-/
import .equiv .pathover .logic
universes u v l
hott_theory
namespace hott
... |
904f19309e535a3cbca7c055dd3c5bb46bb7372c | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/data/equiv/ring.lean | a2209bb1441ac2878ba17093c90d12a3664693ba | [
"Apache-2.0"
] | permissive | jjgarzella/mathlib | 96a345378c4e0bf26cf604aed84f90329e4896a2 | 395d8716c3ad03747059d482090e2bb97db612c8 | refs/heads/master | 1,686,480,124,379 | 1,625,163,323,000 | 1,625,163,323,000 | 281,190,421 | 2 | 0 | Apache-2.0 | 1,595,268,170,000 | 1,595,268,169,000 | null | UTF-8 | Lean | false | false | 14,209 | lean | /-
Copyright (c) 2018 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Callum Sutton, Yury Kudryashov
-/
import data.equiv.mul_add
import algebra.field
import algebra.opposites
/-!
# (Semi)ring equivs
In this file we define extension of ... |
b175b894e7e7a46756e87405f58a50ad1c3e8942 | e0b0b1648286e442507eb62344760d5cd8d13f2d | /stage0/src/Lean/Server/InfoUtils.lean | ffc97d88d5d17d40681511a09b953383165f4354 | [
"Apache-2.0"
] | permissive | MULXCODE/lean4 | 743ed389e05e26e09c6a11d24607ad5a697db39b | 4675817a9e89824eca37192364cd47a4027c6437 | refs/heads/master | 1,682,231,879,857 | 1,620,423,501,000 | 1,620,423,501,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,240 | lean | /-
Copyright (c) 2021 Wojciech Nawrocki. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Wojciech Nawrocki
-/
import Lean.DocString
import Lean.Elab.InfoTree
import Lean.Util.Sorry
namespace Lean.Elab
/--
For every branch, find the deepest node in that branch match... |
8245c99e2c18259a494074e49f912dd1232adb70 | 2de8c1580f92bb6c28b60135f589fe9d0513faba | /src/finsupp.lean | 94775e3b8c1d31e3b835673b18b5313d597a1a95 | [] | no_license | FCL-lean/verification | 44a52e40ab78b18654b8d61bb55c2c912a40d2f4 | be02c698c0ca78b18762e3fe7749cdc72a55d197 | refs/heads/master | 1,585,960,207,309 | 1,560,259,990,000 | 1,560,259,990,000 | 155,650,137 | 0 | 0 | null | 1,541,039,704,000 | 1,541,038,972,000 | Lean | UTF-8 | Lean | false | false | 6,372 | lean | import data.finsupp
namespace finsupp
section basic
variables {α : Type*} {β : Type*} [has_zero β]
lemma support_ne_empty [decidable_eq β] (f : α →₀ β) : f.support ≠ ∅ ↔ f ≠ 0 := by finish
lemma coe_f : Π (f : α →₀ β) (a : α), f a = f.to_fun a := λ f a, rfl
lemma coe_f' : Π (f : α →₀ β) (a : α), f.to_fun a ... |
459ba95d694299fc482c992b734ea71de3873be0 | 6094e25ea0b7699e642463b48e51b2ead6ddc23f | /library/theories/combinatorics/choose.lean | c0c6c221f00720742e443ecdd4d4345d95fd6b58 | [
"Apache-2.0"
] | permissive | gbaz/lean | a7835c4e3006fbbb079e8f8ffe18aacc45adebfb | a501c308be3acaa50a2c0610ce2e0d71becf8032 | refs/heads/master | 1,611,198,791,433 | 1,451,339,111,000 | 1,451,339,111,000 | 48,713,797 | 0 | 0 | null | 1,451,338,939,000 | 1,451,338,939,000 | null | UTF-8 | Lean | false | false | 8,530 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad
Binomial coefficients, "n choose k".
-/
import data.nat.div data.nat.fact data.finset
open decidable
namespace nat
/- choose -/
definition choose : ℕ → ℕ → ℕ
| 0 0 ... |
3ffcee3952055c01eeeea1bde6c32e086d05dfe8 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebraic_topology/dold_kan/functor_n.lean | 2f0888cc7c0d4d084198fa4ccf78efd1ffbcc2aa | [
"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 | 2,418 | lean | /-
Copyright (c) 2022 Joël Riou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Joël Riou
-/
import algebraic_topology.dold_kan.p_infty
/-!
# Construction of functors N for the Dold-Kan correspondence
TODO (@joelriou) continue adding the various files referenced be... |
6229c4eb8edc470ad9f1ad2343fd74f2d88a44ec | 4727251e0cd73359b15b664c3170e5d754078599 | /src/group_theory/exponent.lean | 7dbc8923e5e68695c27527abdd3df4086a0411d1 | [
"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 | 11,478 | lean | /-
Copyright (c) 2021 Julian Kuelshammer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Julian Kuelshammer
-/
import group_theory.order_of_element
import algebra.punit_instances
import algebra.gcd_monoid.finset
import tactic.by_contra
import number_theory.padics.padic... |
2f446b30217901e56a2957f0312dd09d327f6847 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/number_theory/bernoulli.lean | 6e204582ab37a1d42ed1e081aa2b8c872439dd77 | [
"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,962 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Kevin Buzzard
-/
import algebra.big_operators.nat_antidiagonal
import algebra.geom_sum
import data.fintype.big_operators
import ring_theory.power_series.well_known
impo... |
aecef38d83f22037d5d34fa4e24bbfe72d3c9679 | e38e95b38a38a99ecfa1255822e78e4b26f65bb0 | /src/certigrad/id.lean | 965b41e7e258f4684c9fa72fdc2ea7f44e8a44e2 | [
"Apache-2.0"
] | permissive | ColaDrill/certigrad | fefb1be3670adccd3bed2f3faf57507f156fd501 | fe288251f623ac7152e5ce555f1cd9d3a20203c2 | refs/heads/master | 1,593,297,324,250 | 1,499,903,753,000 | 1,499,903,753,000 | 97,075,797 | 1 | 0 | null | 1,499,916,210,000 | 1,499,916,210,000 | null | UTF-8 | Lean | false | false | 1,861 | lean | /-
Copyright (c) 2017 Daniel Selsam. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Daniel Selsam
Identifiers.
-/
import .util .label
namespace certigrad
inductive ID : Type
| str : label → ID
| nat : ℕ → ID
namespace ID
instance : decidable_eq ID := by tactic.mk_d... |
7ffc5ce007f1b3cbf178099fe28a8abc2dc495fe | 4727251e0cd73359b15b664c3170e5d754078599 | /src/topology/uniform_space/uniform_convergence.lean | 2ebb87eab295cda0fa5e7fb0f0ea111f92763f67 | [
"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 | 27,860 | 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 topology.uniform_space.basic
/-!
# Uniform convergence
A sequence of functions `Fₙ` (with values in a metric space) converges uniformly on a set `s` to... |
0a3ea17d538469ede84057ca369f4ab110afc308 | 4727251e0cd73359b15b664c3170e5d754078599 | /archive/miu_language/decision_nec.lean | bce4122c11fbee04f014db180fecc0a528908355 | [
"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 | 6,695 | lean | /-
Copyright (c) 2020 Gihan Marasingha. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gihan Marasingha
-/
import .basic
import data.nat.modeq
import tactic.ring
/-!
# Decision procedure: necessary condition
We introduce a condition `decstr` and show that if a string... |
d75c707fbedb9756e90b695777649d27af585191 | 022547453607c6244552158ff25ab3bf17361760 | /src/set_theory/cardinal.lean | af04193df05cd541b218b2b9cc0f61dd72425596 | [
"Apache-2.0"
] | permissive | 1293045656/mathlib | 5f81741a7c1ff1873440ec680b3680bfb6b7b048 | 4709e61525a60189733e72a50e564c58d534bed8 | refs/heads/master | 1,687,010,200,553 | 1,626,245,646,000 | 1,626,245,646,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 52,314 | 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, Floris van Doorn
-/
import data.set.countable
import set_theory.schroeder_bernstein
import data.fintype.card
import data.nat.enat
/-!
# Cardinal Number... |
7ef89749e92b4f4c27c7359ac1ba55f05c134e4e | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/order/well_founded.lean | f280f44dd31545ac4d09dd69eca41bbe9674bc49 | [
"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 | 6,168 | lean | /-
Copyright (c) 2020 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Mario Carneiro
-/
import data.set.basic
/-!
# Well-founded relations
A relation is well-founded if it can be used for induction: for each `x`, `(∀ y, r y x → P y) → P x... |
f3af456ded548e08629583afd4d1c54b6ee5fefe | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/topology/bases.lean | 6b7a51cd349a832868f109e6a55ec5ed0c4cf8a1 | [
"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 | 25,623 | 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.continuous_on
import topology.constructions
/-!
# Bases of topologies. Countability axioms.
A topological basis on a topological sp... |
2b0981a1525fe12d2e30f5f5f1974eee035bd6de | 7b02c598aa57070b4cf4fbfe2416d0479220187f | /algebra/subgroup.hlean | dac59c265d389cbb7d66331547c798cfd0f9e773 | [
"Apache-2.0"
] | permissive | jdchristensen/Spectral | 50d4f0ddaea1484d215ef74be951da6549de221d | 6ded2b94d7ae07c4098d96a68f80a9cd3d433eb8 | refs/heads/master | 1,611,555,010,649 | 1,496,724,191,000 | 1,496,724,191,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 19,843 | hlean | /-
Copyright (c) 2015 Egbert Rijke. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Egbert Rijke
Basic concepts of group theory
-/
import algebra.group_theory ..move_to_lib
open eq algebra is_trunc sigma sigma.ops prod trunc
namespace group
/- #... |
2056ed02c384c7e9e419d7f9cedd9bc92af5979c | ff5230333a701471f46c57e8c115a073ebaaa448 | /tests/lean/run/auto_param_in_structures.lean | d069655f4cddc6fe4b5a2ca6244bb85f83ac7c1e | [
"Apache-2.0"
] | permissive | stanford-cs242/lean | f81721d2b5d00bc175f2e58c57b710d465e6c858 | 7bd861261f4a37326dcf8d7a17f1f1f330e4548c | refs/heads/master | 1,600,957,431,849 | 1,576,465,093,000 | 1,576,465,093,000 | 225,779,423 | 0 | 3 | Apache-2.0 | 1,575,433,936,000 | 1,575,433,935,000 | null | UTF-8 | Lean | false | false | 453 | lean | namespace test
open tactic
meta def my_tac : tactic unit := abstract (intros >> `[simp])
local attribute [simp] add_assoc mul_assoc
structure monoid (α : Type) :=
(op : α → α → α)
(assoc : ∀ a b c, op (op a b) c = op a (op b c) . my_tac)
def m1 : monoid nat :=
monoid.mk (+)
def m2 : monoid nat :=
monoid.mk (*)
... |
4480b2882d328034733cdb73c1a1b6f5da748f32 | 92b50235facfbc08dfe7f334827d47281471333b | /library/data/nat/bquant.lean | 0e95f27e62aeb6ab497e8fb14ee2ffc0b3aa9470 | [
"Apache-2.0"
] | permissive | htzh/lean | 24f6ed7510ab637379ec31af406d12584d31792c | d70c79f4e30aafecdfc4a60b5d3512199200ab6e | refs/heads/master | 1,607,677,731,270 | 1,437,089,952,000 | 1,437,089,952,000 | 37,078,816 | 0 | 0 | null | 1,433,780,956,000 | 1,433,780,955,000 | null | UTF-8 | Lean | false | false | 5,745 | 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
Show that "bounded" quantifiers: (∃x, x < n ∧ P x) and (∀x, x < n → P x)
are decidable when P is decidable.
This module allow us to write if-then-else express... |
7f95c35af601dc661e8b7da7c7125010a47359fa | 5e3548e65f2c037cb94cd5524c90c623fbd6d46a | /src_icannos_totilas/reduction/cpge_reduction_007_b.lean | 7eee9784f536c2482378d2273531d3315eed84af | [] | 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 | 381 | 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_b (R : Type*) (M : Type*)
[semiring R] [add_comm_group M] [module R M]
(u : linear_map R M M):
u^3 + u = 0 -> ... |
7896af7baa5c9ac8ab8dc1515e2fae3cba96db59 | ae1e94c332e17c7dc7051ce976d5a9eebe7ab8a5 | /tests/lean/doSeqRightIssue.lean | 90352028ee868ece4aa0882a884e256cadbbcd59 | [
"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 | 304 | lean | --
set_option autoBoundImplicitLocal false
universes u
variables {α : Type u}
variables {β : α → Type v}
theorem ex {p₁ p₂ : Sigma (fun a => β a)} (h₁ : p₁.1 = p₂.1) (h : p₁.2 ≅ p₂.2) : p₁ = p₂ :=
match p₁, p₂, h₁, h with
| ⟨_, _⟩, ⟨_, _⟩, rfl, HEq.refl _ => rfl
|
6e5a3524882b0ea7af36257763c81e2d240d7378 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/interactive/plainGoal.lean | 2b6c78aed3c06a9a20ceae8dc22b130458a988e5 | [
"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,059 | lean | example : α → α := by
--^ $/lean/plainGoal
--^ $/lean/plainGoal
intro a
--^ $/lean/plainGoal
--^ $/lean/plainGoal
--v $/lean/plainGoal
focus
apply a
example : α → α := by
--^ $/lean/plainGoal
example : 0 + n = n := by
induction n with
| zero => simp... |
f7251314ba88cfe5036dc64e8c02b0f2497ddc53 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/tactic/show_term.lean | ef50c9fd2d96d4cd8bc691c614b06f108296832a | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 1,288 | 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 tactic.core
open tactic
namespace tactic.interactive
/--
`show_term { tac }` runs the tactic `tac`,
and then prints the term that was constructed.
This is ... |
7990e623dac48c6093eb837b07786dfba97734dc | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/algebra/direct_limit.lean | d5dc8dab0451d809afc68a0c271870924361ebbf | [
"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 | 25,202 | 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... |
e467d900d334af296b4b7a585984efb17f14f651 | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /src/data/multiset/basic.lean | d0a2ec304be57377e7badb12447db3ebe58999fe | [
"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 | 82,931 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
-/
import data.list.perm
import algebra.group_power
/-!
# Multisets
These are implemented as the quotient of a list by permutations.
-/
open list subtype nat
v... |
9b0d5513b908a1670bd3633a8fe761433a6739ea | 7c4610454cf55b49f0c3cdaeb6b856eb3249cb2d | /src/new_file.lean | e481b6ce89ab60902fad9a14ccea30642ef550d2 | [] | no_license | 101damnations/fg_over_pid | 097be43e11c3680a3fd4b6de2265de393cf4d4ef | a1a587c455a54a802f6ff61b07bb033701e451a7 | refs/heads/master | 1,669,708,904,636 | 1,597,259,770,000 | 1,597,259,770,000 | 287,097,363 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 12,896 | lean | import ring_theory.principal_ideal_domain data.equiv.basic set_lemmas
variables {M : Type*} {R : Type*}
[integral_domain R] [is_principal_ideal_ring R] [add_comm_group M]
[module R M] {A : submodule R M}
{α : Type*} {β : Type*} {γ : Type*} [add_comm_group α] [add_comm_group β]
open_locale classical
open finset
lemma... |
cb86d3090bb478a4eedeccb31b757900795d24a7 | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/topology/metric_space/baire.lean | 985bae02dbfc0d8d3149d4e5bd24dcfe406cc3e8 | [
"Apache-2.0"
] | permissive | hikari0108/mathlib | b7ea2b7350497ab1a0b87a09d093ecc025a50dfa | a9e7d333b0cfd45f13a20f7b96b7d52e19fa2901 | refs/heads/master | 1,690,483,608,260 | 1,631,541,580,000 | 1,631,541,580,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 13,850 | 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 analysis.specific_limits
import order.filter.countable_Inter
import topology.G_delta
/-!
# Baire theorem
In a complete metric space, a countable inters... |
19d4ddcdd7a636088152e254e8ef35195a3c7939 | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /stage0/src/Lean/Meta/Tactic/Assert.lean | 5b6196f6f0adbfd584672e858ab42eededc6b503 | [
"Apache-2.0"
] | permissive | williamdemeo/lean4 | 72161c58fe65c3ad955d6a3050bb7d37c04c0d54 | 6d00fcf1d6d873e195f9220c668ef9c58e9c4a35 | refs/heads/master | 1,678,305,356,877 | 1,614,708,995,000 | 1,614,708,995,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,069 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Meta.Tactic.Util
import Lean.Meta.Tactic.FVarSubst
import Lean.Meta.Tactic.Intro
import Lean.Meta.Tactic.Revert
namespace Lean.Meta
/--
Conv... |
cfad5651689ba359bdf65159c6c86e72b5b4fe51 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebraic_geometry/morphisms/quasi_separated.lean | 33569b42b09e2f2ea87ac35e4a9e604886f9a8a8 | [
"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 | 23,381 | lean | /-
Copyright (c) 2022 Andrew Yang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Andrew Yang
-/
import algebraic_geometry.morphisms.quasi_compact
import topology.quasi_separated
/-!
# Quasi-separated morphisms
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes... |
47dd20482624f8aa03d03ce999fe6a476ba92c22 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/parent_struct_inst.lean | 248106b70821583c7c54f29ddd113ebfe8741c98 | [
"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 | 130 | lean | open nat
class A := (n : ℕ)
definition f [A] := A.n
structure B extends A :=
(Hf : f = 0)
example : B := ⟨⟨0⟩, rfl⟩
|
ebb6fff331de9c494cdb7769031ac4d13fe6d4bc | aa5a655c05e5359a70646b7154e7cac59f0b4132 | /tests/lean/run/unihint.lean | 4603fe8b4e565b86dceac9fc72e54f75ad35bc75 | [
"Apache-2.0"
] | permissive | lambdaxymox/lean4 | ae943c960a42247e06eff25c35338268d07454cb | 278d47c77270664ef29715faab467feac8a0f446 | refs/heads/master | 1,677,891,867,340 | 1,612,500,005,000 | 1,612,500,005,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 857 | lean | structure S where
carrier : Type
mul : carrier → carrier → carrier
def Nat.S : S where
carrier := Nat
mul := (· * ·)
def Int.S : S where
carrier := Int
mul := (· * ·)
unif_hint (s : S) where
s =?= Nat.S ⊢ s.carrier =?= Nat
unif_hint (s : S) where
s =?= Int.S ⊢ s.carrier =?= Int
def mul {s : S} (a b... |
7a853f91d521af22c1b87dd2f8bac3b6f290977c | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/category_theory/limits/shapes/images.lean | 3f70fce38b1893ff8e41fce2f4b7b5be95ca5189 | [
"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 | 14,520 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Markus Himmel
-/
import category_theory.limits.shapes.equalizers
import category_theory.comma
/-!
# Categorical images
We define the categorical image of `f` as a fac... |
b823c1d85ae6eeb7a2b8bfb4c1f383d17af07894 | a7602958ab456501ff85db8cf5553f7bcab201d7 | /Notes/Theorem_Proving_in_Lean/Chapter4/4.1.lean | 4c18e2fc112fa89f8d1e1030f59d9e3b02821a92 | [] | no_license | enlauren/math-logic | 081e2e737c8afb28dbb337968df95ead47321ba0 | 086b6935543d1841f1db92d0e49add1124054c37 | refs/heads/master | 1,594,506,621,950 | 1,558,634,976,000 | 1,558,634,976,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 821 | lean | -- 4 Quantifiers and Equality
-- 4.1 The Universal Quantifier
variable α: Type
variables p q: α → Prop
-- ∀ Introduction. To prove ∀ A x, we need to:
-- 1. Assume an arbitrary |x|
-- 2. Prove A x
example: (∀ x: α, p x ∧ q x) → ∀ y: α, p y :=
assume h1: (∀ x: α, p x ∧ q x),
show ∀ y: α, p y, from
assume y:... |
504e8951af74ac9619ad7e95a35735092b45658a | 3d2a7f1582fe5bae4d0bdc2fe86e997521239a65 | /spatial-reasoning/spatial-reasoning-problem-02.lean | 3a57c0e941ac971d689bcd437723defc4cbb0877 | [] | no_license | own-pt/common-sense-lean | e4fa643ae010459de3d1bf673be7cbc7062563c9 | f672210aecb4172f5bae265e43e6867397e13b1c | refs/heads/master | 1,622,065,660,261 | 1,589,487,533,000 | 1,589,487,533,000 | 254,167,782 | 3 | 2 | null | 1,589,487,535,000 | 1,586,370,214,000 | Lean | UTF-8 | Lean | false | false | 894 | lean | /- Spatial Reasoning Problem 02 -/
/- It can be found at: SpatialQs.txt -/
/- (2) If x is on the right of y, and z is on the left of y, then x is on the right of z -/
constant U : Type
constants X Y Z : U
constants Right Left : U
constant ins : U → U → Prop
constant located : U → U → Prop
constant subclass : U → U →... |
63276104dcf3b638d46ab95b89ec92d8c7d25be3 | f3be49eddff7edf577d3d3666e314d995f7a6357 | /TBA/Exercises/Exercise4.lean | 6616e9273923c76c9f886e35b28c90a744f13985 | [] | no_license | IPDSnelting/tba-2021 | 8b930bcd2f4aae44a2ddc86e72b77f84e6d46e82 | b6390e55b768423d3266969e81d19290129c5914 | refs/heads/master | 1,686,754,693,583 | 1,625,135,602,000 | 1,625,136,365,000 | 355,124,341 | 50 | 7 | null | 1,625,133,762,000 | 1,617,699,824,000 | Lean | UTF-8 | Lean | false | false | 2,855 | lean | /- TACTICS -/
namespace TBA
-- definitions from last week
-- NOTE: We renamed it from `Nat'` for consistency. The new namespace makes sure we don't use the
-- standard library `Nat`.
inductive Nat : Type
| zero : Nat
| succ (n : Nat) : Nat
open Nat
def add (m n : Nat) : Nat :=
match n with
| zero => m
|... |
dad51b5dbee9ae7f14c9d33a91a058b1d4d27360 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /test/lint_simp_nf.lean | bb4bc16e149cc8e335eb0ce3540f3ba39356db12 | [
"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 | 925 | lean | import tactic.lint
def f : ℕ → ℕ := default _
def c : ℕ := default _
def d : ℕ := default _
@[simp] lemma c_eq_d : c = d := rfl
-- The following lemma never applies when using simp, because c is first rewritten to d
@[simp] lemma f_c : f c = 0 := rfl
example : f c = 0 :=
begin
simp,
guard_target f d = 0, -- doe... |
efbe1c92bd8b8e450dfa017d50f6ca51639cd133 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /stage0/src/Std/ShareCommon.lean | ecd9318d9e487d368567c7bafe92bfa5423dea8c | [
"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 | 6,364 | 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 Std.Data.HashSet
import Std.Data.HashMap
import Std.Data.PersistentHashMap
import Std.Data.PersistentHashSet
namespace Std
universe u v
namespace Sh... |
8bb220b0b06c3a4c42b8d795c5d39b6386e816c0 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/analysis/special_functions/gamma.lean | 9ed8844250991a267e7b4f25c056184355499ca0 | [
"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 | 24,116 | lean | /-
Copyright (c) 2022 David Loeffler. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Loeffler
-/
import measure_theory.integral.exp_decay
import analysis.calculus.parametric_integral
/-!
# The Gamma function
This file defines the `Γ` function (of a real or comp... |
91096a99e00b379ff228110d251db7870616bee9 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/algebraic_geometry/properties.lean | af4ca9a50fdcca122e840e0318fb588ba6abca9e | [
"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 | 14,221 | lean | /-
Copyright (c) 2021 Andrew Yang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Andrew Yang
-/
import algebraic_geometry.AffineScheme
import ring_theory.nilpotent
import topology.sheaves.sheaf_condition.sites
import category_theory.limits.constructions.binary_product... |
6581be717051cdd04ef67ee639ed2b5b20e4dcbd | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Data/Lsp.lean | a7d643b3cf397f6f7254f355f422c040f4c9ce0b | [
"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 | 604 | lean | /-
Copyright (c) 2020 Marc Huisinga. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Marc Huisinga, Wojciech Nawrocki
-/
import Lean.Data.Lsp.Basic
import Lean.Data.Lsp.Capabilities
import Lean.Data.Lsp.Client
import Lean.Data.Lsp.Communication
import Lean.Data.Lsp.Dia... |
ac832f29383f3ddfe4debf05fe96e77623a7e80b | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/computability/halting.lean | fa561dbcb600127478d76495a278e7206b305dc6 | [
"Apache-2.0"
] | permissive | lacker/mathlib | f2439c743c4f8eb413ec589430c82d0f73b2d539 | ddf7563ac69d42cfa4a1bfe41db1fed521bd795f | refs/heads/master | 1,671,948,326,773 | 1,601,479,268,000 | 1,601,479,268,000 | 298,686,743 | 0 | 0 | Apache-2.0 | 1,601,070,794,000 | 1,601,070,794,000 | null | UTF-8 | Lean | false | false | 13,435 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
-/
import computability.partrec_code
/-!
# Computability theory and the halting problem
A universal partial recursive function, Rice's theorem, and the halting problem.... |
13d8c68232f61191a15172212fcb9fa7d5de65aa | 618003631150032a5676f229d13a079ac875ff77 | /src/control/functor.lean | 37fe4a0c7c314c72b64929425917754dfca68fc6 | [
"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 | 5,357 | lean | /-
Copyright (c) 2017 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Simon Hudon
Standard identity and composition functors
-/
import tactic.ext
import tactic.lint
attribute [functor_norm] seq_assoc pure_seq_eq_map map_pure seq_map_assoc map_seq
universe... |
986944e1c7f601fcde82a7a3b068e4c05c6075e8 | ea5678cc400c34ff95b661fa26d15024e27ea8cd | /game.lean | ca9d290f3da47bfedfb27c654a3ad4bf9bb3f11e | [] | 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 | 9,770 | lean | import data.finset tactic.find data.fintype data.nat.basic data.pnat
universes u v
local infix ` ≺ ` :50 := has_well_founded.r
open well_founded
lemma acc.rec_3 {α : Sort u} [hw : has_well_founded α] {C : α → Sort v}
(f : Π x, (∀ y, y ≺ x → acc (≺) y) → (Π y, y ≺ x → C y) → C x) (a : α) :
@acc.rec α (≺) C f a (ap... |
d45dc2306dcaf6d86ad27d79c5886132694f4f37 | a4673261e60b025e2c8c825dfa4ab9108246c32e | /tests/lean/run/tacticExtOverlap.lean | 279cb08e414d49ae7fe3b34e825f1c230b915780 | [
"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 | 552 | lean | open Lean
syntax [myintro] "intros" sepBy(ident, ",") : tactic
macro_rules [myintro]
| `(tactic| intros $x*) => pure $ Syntax.node `Lean.Parser.Tactic.intros #[Syntax.atom {} "intros", mkNullNode x.getSepElems]
theorem tst1 {p q : Prop} : p → q → p :=
by {
intros h1, h2;
assumption
}
theorem tst2 {p q : Prop} :... |
93bd9262e5e2e1910ae9048cfe439eb45596ba19 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/structure_patterns.lean | e3ce38f15790cd52021a4ab41ce4da3a27e3659c | [
"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 | 369 | lean | meta def mk_c := `[exact 1]
structure foo (α : Type) :=
(a : α)
(b : α := a)
(c : α . mk_c)
example : foo ℕ → ℕ | {a := a} := a
example : foo ℕ → ℕ | {foo . a := a} := a
example : foo ℕ → ℕ | {a := nat.succ n} := n
example : foo ℕ → ℕ | {..} := 0
example : foo ℕ → ℕ | {b:=b, ..} := b
example : foo ℕ → ℕ | {..f} := 0 ... |
1482dff69806a09e1c28788310c184e0c8515599 | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/data/nat/prime.lean | 1f9253be00877391cb3b75f2592707b004e50233 | [
"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 | 23,279 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Jeremy Avigad, Mario Carneiro
-/
import data.nat.sqrt
import data.nat.gcd
import algebra.group_power
import tactic.wlog
/-!
# Prime numbers
This file deals... |
2478169585c1a335800edea563c2761afc63d0aa | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/measure_theory/group.lean | 665be5817e00dacb94b148480bec155b34d7adcf | [
"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 | 9,468 | 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
-/
import measure_theory.integration
import measure_theory.regular
/-!
# Measures on Groups
We develop some properties of measures on (topological) groups
* We de... |
11f74e6814ddbe3b5711913119d43e5ee2ccffb3 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/computability/turing_machine.lean | d423edb60d60f68170bd86cdf331f4f035304c88 | [
"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 | 109,861 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
-/
import algebra.order
import data.fintype.basic
import data.pfun
import tactic.apply_fun
import logic.function.iterate
/-!
# Turing machines
This file defines a seque... |
d9d844dfb7ec661a010233b1bde266464784d846 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/tools/debugger/default_auto.lean | 14375260c489baba99d0e0bcaba3a08ff5706af6 | [] | 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 | 342 | 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.default
import Mathlib.Lean3Lib.tools.debugger.util
import Mathlib.Lean3Lib.tools.debugger.cli
namespac... |
6191255392aab30ef909e1131425c25cbe348753 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/nat/modeq.lean | 191b5263764b50db67d4b6565934635f06493a9f | [] | 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 | 9,529 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.int.gcd
import Mathlib.tactic.abel
import Mathlib.data.list.rotate
import Mathlib.Post... |
3d720d55aa3090841f2a3fc5bd86d7ede950124d | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/data/set/basic.lean | 8f04815748733be426ee9a66718b83245c9f473e | [
"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 | 66,318 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura
-/
import tactic.basic tactic.finish data.subtype logic.unique data.prod
/-!
# Basic properties of sets
Sets in Lean are homogeneous; all their elem... |
9050edd685be4ca9e085f5be51c09187286bfcb1 | bae21755a4a03bbe0a5c22e258db8633407711ad | /library/init/meta/vm.lean | c4072cdfb994c0b32a0f0a15f4a021125794eb23 | [
"Apache-2.0"
] | permissive | nor-code/lean | f437357a8f85db0f06f186fa50fcb1bc75f6b122 | aa306af3d7c47de3c7937c98d3aa919eb8da6f34 | refs/heads/master | 1,662,613,329,886 | 1,586,696,014,000 | 1,586,696,014,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,959 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.meta.tactic init.category.option
import init.meta.mk_dec_eq_instance
meta constant vm_obj : Type
@[derive decidable_eq]
inductive vm_o... |
4ed1e9fe233f2c3ba845004bd27af3db5dedf20e | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/measure_theory/borel_space.lean | 26d0b9e1989f42c5a9c44225a42ebe751ab4d0be | [
"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 | 61,029 | 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, Yury Kudryashov
-/
import measure_theory.ae_measurable_sequence
import analysis.complex.basic
import analysis.normed_space.finite_dimension
import topology.G_delta
impo... |
a74406fb0aa32ec22711a62003563bd68be0aa89 | fc086f79b20cf002d6f34b023749998408e94fbf | /src/tidy/luxembourg_chain.lean | 2a98afcef13981ed81eee18281f018d2d38da9f1 | [] | no_license | semorrison/lean-tidy | f039460136b898fb282f75efedd92f2d5c5d90f8 | 6c1d46de6cff05e1c2c4c9692af812bca3e13b6c | refs/heads/master | 1,624,461,332,392 | 1,559,655,744,000 | 1,559,655,744,000 | 96,569,994 | 9 | 4 | null | 1,538,287,895,000 | 1,499,455,306,000 | Lean | UTF-8 | Lean | false | false | 1,066 | lean | import tactic.basic
open tactic
variables {α : Type} [has_to_format α]
meta def luxembourg_chain_aux (tac : tactic α) : ℕ → tactic (list (ℕ × α))
| b := do (done >> return []) <|>
(do a ← tac,
c ← luxembourg_chain_aux 0,
return ((b, a) :: c)) <|>
(do n ← num_go... |
af60b374e29955fb6c5c4c4552683e0dd3b740a2 | d29d82a0af640c937e499f6be79fc552eae0aa13 | /src/ring_theory/polynomial/gauss_lemma.lean | 0ea245cb4b29ad2f40a13caa79b301507260c34a | [
"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 | 7,918 | lean | /-
Copyright (c) 2020 Aaron Anderson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson
-/
import ring_theory.int.basic
import ring_theory.localization
/-!
# Gauss's Lemma
Gauss's Lemma is one of a few results pertaining to irreducibility of primitive pol... |
22af5dab3a316ead15539ac8fc8408d34008a215 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/james1.lean | bd24e0da9657166d6aff17e9820fcce89b3b3b90 | [
"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,014 | lean | inductive LazyList (α : Type u)
| nil : LazyList α
| cons (hd : α) (tl : LazyList α) : LazyList α
| delayed (t : Thunk (LazyList α)) : LazyList α
namespace LazyList
def force : LazyList α → Option (α × LazyList α)
| delayed as => force as.get
| nil => none
| cons a as => some (a,as)
def length : LazyList α →... |
2a9d0834c63bfcb9a2e5278dc5acf4fcc03ce6e0 | 3dd1b66af77106badae6edb1c4dea91a146ead30 | /tests/lean/run/local_using.lean | aff457790cedde8947e572c152f202c95de6c6ad | [
"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 | 434 | lean | variable N : Type.{1}
precedence `+`:65
namespace foo
variable a : N
variable f : N → N → N
infix + := f
end
namespace bla
variable b : N
variable f : N → N → N
infix + := f
end
variable g : N → N → N
using foo
using bla
print raw a + b -- + is overloaded, it creates a choice
print raw #foo a + b -- +... |
ec0f7500dac267683ec50cc66d9aab55bd2457b1 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/data/rat/meta_defs.lean | 95e284b978c6da737df96ee5c2de907c6202ccd3 | [
"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 | 4,151 | lean | /-
Copyright (c) 2019 Robert Y. Lewis . All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Robert Y. Lewis
-/
import data.rat.basic
/-!
# Meta operations on ℚ
This file defines functions for dealing with rational numbers as expressions.
They are not defined earlier in t... |
51fa2140252ea1e75ee44a587ad809849a58e27d | 47c6e122a73eb61594f0426d74d9c1897ac5668e | /src/left_cosets.lean | 9239de989352868bead8f4b0817bd7db37866cea | [] | no_license | ineswright/Lean-Sylow | 19ec5d964be8a66e25e227621fbac79c88a83ddf | 74b99544ab1ca96dc28fbe152125f565763a893b | refs/heads/main | 1,688,108,643,799 | 1,627,664,383,000 | 1,627,664,383,000 | 382,315,172 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,186 | lean | import group_theory.group_action
import tactic
universes u v w
variables {G : Type u} {α : Type v} {β : Type w} [group G]
open_locale coset
abbreviation left_cosets (L : subgroup G) : Type* :=
{ S : set G // ∃ g : G, g *l L = S }
namespace left_cosets
variables {L : subgroup G}
@[simps] def smul (g : G) (s : lef... |
28ac4b9a155889821a0351b28692fefb4a8f7a9d | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/field_theory/tower.lean | 82c05a6e30a9ba6e681bad0715d3e103183a6f4d | [
"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 | 3,099 | lean | /-
Copyright (c) 2020 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import ring_theory.algebra_tower
import linear_algebra.finite_dimensional
/-!
# Tower of field extensions
In this file we prove the tower law for arbitrary extensions and fi... |
e96169c2ae49760a26d9934060e67edab54d6fb2 | 12dabd587ce2621d9a4eff9f16e354d02e206c8e | /world07/level10.lean | af8f7cb00a2e2794c3465bf4ce1920d74e223ded | [] | no_license | abdelq/natural-number-game | a1b5b8f1d52625a7addcefc97c966d3f06a48263 | bbddadc6d2e78ece2e9acd40fa7702ecc2db75c2 | refs/heads/master | 1,668,606,478,691 | 1,594,175,058,000 | 1,594,175,058,000 | 278,673,209 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 211 | lean | import tactic.tauto
local attribute [instance, priority 10] classical.prop_decidable
lemma contrapositive2 (P Q : Prop) : (¬ Q → ¬ P) → (P → Q) :=
begin
by_cases p : P; by_cases q : Q,
repeat {cc},
end
|
d5abd79cfbd4876b636eca01544319ab8188a6e1 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/tactic/congr.lean | 89c3ba90069b742a8d45b3c84b405d3c1d474407 | [
"Apache-2.0"
] | permissive | jjgarzella/mathlib | 96a345378c4e0bf26cf604aed84f90329e4896a2 | 395d8716c3ad03747059d482090e2bb97db612c8 | refs/heads/master | 1,686,480,124,379 | 1,625,163,323,000 | 1,625,163,323,000 | 281,190,421 | 2 | 0 | Apache-2.0 | 1,595,268,170,000 | 1,595,268,169,000 | null | UTF-8 | Lean | false | false | 8,487 | 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
-/
import tactic.lint
import tactic.ext
/-!
# Congruence and related tactics
This file contains the tactic `congr'`, which is an extension of `congr`, and various ... |
37b4cd41edf581814725e460c86d9fd8bcc220e5 | abd85493667895c57a7507870867b28124b3998f | /src/data/equiv/list.lean | f14bb7b1bf1e92fe1894e193c46735939b6965b6 | [
"Apache-2.0"
] | permissive | pechersky/mathlib | d56eef16bddb0bfc8bc552b05b7270aff5944393 | f1df14c2214ee114c9738e733efd5de174deb95d | refs/heads/master | 1,666,714,392,571 | 1,591,747,567,000 | 1,591,747,567,000 | 270,557,274 | 0 | 0 | Apache-2.0 | 1,591,597,975,000 | 1,591,597,974,000 | null | UTF-8 | Lean | false | false | 10,298 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
Additional equiv and encodable instances for lists, finsets, and fintypes.
-/
import data.equiv.denumerable
open nat list
namespace encodable
variables {α : Type*}
se... |
bd2f2ba50f62500f8d4e6105a8730988970125ee | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/impbug2.lean | b47c81e00d73cd85cb1c0528f6106f9c05a4a1f2 | [
"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 | 759 | lean | prelude
-- category
definition Prop := Type.{0}
constant eq {A : Type} : A → A → Prop
infix `=`:50 := eq
inductive category (ob : Type) (mor : ob → ob → Type) : Type :=
mk : Π (id : Π (A : ob), mor A A),
(Π (A B : ob) (f : mor A A), id A = f) → category ob mor
definition id (ob : Type) (mor : ob → ob → Type) (C... |
ba34e241143d9a75e700f61d822f294d974a788b | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /05_Interacting_with_Lean.org.16.lean | fb18ddb569f6fe2809e8a6da88b997903f288d41 | [] | 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 | 161 | lean | /- page 72 -/
import standard
import data.nat
open nat
abbreviation double (x : ℕ) : ℕ := x + x
theorem foo (x : ℕ) : double x = x + x := rfl
check foo
|
c49477144b6766cf7c79ce4bafe5fb002e98abd1 | 01ae0d022f2e2fefdaaa898938c1ac1fbce3b3ab | /categories/products/default.lean | f10fe79a751f6b89cd049fc7377194e70cb4e1f5 | [] | no_license | PatrickMassot/lean-category-theory | 0f56a83464396a253c28a42dece16c93baf8ad74 | ef239978e91f2e1c3b8e88b6e9c64c155dc56c99 | refs/heads/master | 1,629,739,187,316 | 1,512,422,659,000 | 1,512,422,659,000 | 113,098,786 | 0 | 0 | null | 1,512,424,022,000 | 1,512,424,022,000 | null | UTF-8 | Lean | false | false | 2,898 | 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 ..functor_categories
open categories
open categories.functor
open categories.natural_transformation
open categories.functor_categories
nam... |
ffcd5c84fde4864fb5cd0a24ded5ecf40b96519d | 626e312b5c1cb2d88fca108f5933076012633192 | /src/ring_theory/subsemiring.lean | a2adb6316d31a663bf692c592e8f19656d43e79e | [
"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 | 33,334 | lean | /-
Copyright (c) 2020 Yury Kudryashov All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import algebra.ring.prod
import group_theory.submonoid
import group_theory.submonoid.center
import data.equiv.ring
/-!
# Bundled subsemirings
We define bundled su... |
ed13b77d03cb20ca07d096df92f8c62b467e238f | ff5230333a701471f46c57e8c115a073ebaaa448 | /library/init/meta/rb_map.lean | bef0e227e3d7770abb5737d538a9224b2e51882b | [
"Apache-2.0"
] | permissive | stanford-cs242/lean | f81721d2b5d00bc175f2e58c57b710d465e6c858 | 7bd861261f4a37326dcf8d7a17f1f1f330e4548c | refs/heads/master | 1,600,957,431,849 | 1,576,465,093,000 | 1,576,465,093,000 | 225,779,423 | 0 | 3 | Apache-2.0 | 1,575,433,936,000 | 1,575,433,935,000 | null | UTF-8 | Lean | false | false | 7,806 | 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, Jeremy Avigad
-/
prelude
import init.data.ordering.basic init.function init.meta.name init.meta.format init.category.monad
open format
private meta def form... |
cbffd390ac682d7ba3d5102eaf7fe2bf711c9da2 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/ring_theory/principal_ideal_domain.lean | 8cab4d18a0ea0b34cb5f349c1f0228fd45003e4a | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,994 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Chris Hughes, Morenikeji Neri
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.ring_theory.noetherian
import Mathlib.ring_theory.unique_factorization_domain
i... |
6380e4f25a967a68c449c5861e4e92d63cc8d85a | cc62cd292c1acc80a10b1c645915b70d2cdee661 | /src/category_theory/universe_lifting.lean | b3949f5a555505484ba2786bd0fbbaeff64fc438 | [] | no_license | RitaAhmadi/lean-category-theory | 4afb881c4b387ee2c8ce706c454fbf9db8897a29 | a27b4ae5eac978e9188d2e867c3d11d9a5b87a9e | refs/heads/master | 1,651,786,183,402 | 1,565,604,314,000 | 1,565,604,314,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 510 | lean | -- Copyright (c) 2018 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Scott Morrison
import category_theory.equivalence
import tidy.backwards_reasoning
import category_theory.tactics.obviously
namespace category_theory
universes u₁
variable (C ... |
32d2b8d222d6f15e41fa343395e912c373d95b43 | 4e0c49ab645d61b5c3e486a1b460db14552914ae | /tests/lean/json.lean | 2fee70de2552365b2c46abf40d531bc83f9e3f15 | [
"Apache-2.0"
] | permissive | saik2121/lean | 0c733955a9a33270a86d17f4139054c8bd09cff5 | 13007ebb4de63859d9866c19f6e753bbf1852f41 | refs/heads/master | 1,676,215,937,507 | 1,609,762,908,000 | 1,609,762,908,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,539 | lean | #eval to_string $ json.parse $ "[0.7]"
run_cmd tactic.success_if_fail $ json.parse "spurgles"
meta def ball : list bool → bool :=
λ xs, xs.foldl band tt
meta instance : decidable_eq native.float := by apply_instance
meta def json.compare : Π (x y : json), bool
| (json.of_string s) (json.of_string s') := s = s'
| (js... |
b394424b63a9cf9343a9043c8ca37b7be0c59b61 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/tactic/with_local_reducibility.lean | d9d57016ba006a31a43d68f0735caae75fc5ca12 | [
"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,337 | lean | /-
Copyright (c) 2020 Reid Barton. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Reid Barton
-/
import tactic.core
/-!
# `with_local_reducibility`
Run a tactic in an environment with a temporarily modified reducibility attribute
for a specified declaration.
-/
nam... |
2bf719b57566ffa947bbde53f27dcb62405ca10c | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/tactic/induction.lean | 4b5ad14938103bd3bc4b5feb4797e21952d5bc87 | [
"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 | 55,089 | lean | /-
Copyright (c) 2020 Jannis Limperg. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jannis Limperg
-/
import tactic.clear
import tactic.dependencies
import tactic.fresh_names
import tactic.generalizes
import tactic.has_variable_names
import tactic.unify_equations
/-... |
9ae2527e0f3b812976e3abaed4c931a4d7826e71 | bb31430994044506fa42fd667e2d556327e18dfe | /src/topology/sheaves/stalks.lean | 772a1e0c892c77f2bc06dd534731435162463709 | [
"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,694 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Justus Springer
-/
import topology.category.Top.open_nhds
import topology.sheaves.presheaf
import topology.sheaves.sheaf_condition.unique_gluing
import category_theory.... |
0327bf02c4cc5c58135e93027c1e7663f9ddeb49 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /stage0/src/Lean/Data/Xml/Basic.lean | 3f9d4fb507bf1377d7f306e2e944edfd25455f87 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | EdAyers/lean4 | 57ac632d6b0789cb91fab2170e8c9e40441221bd | 37ba0df5841bde51dbc2329da81ac23d4f6a4de4 | refs/heads/master | 1,676,463,245,298 | 1,660,619,433,000 | 1,660,619,433,000 | 183,433,437 | 1 | 0 | Apache-2.0 | 1,657,612,672,000 | 1,556,196,574,000 | Lean | UTF-8 | Lean | false | false | 999 | lean |
/-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Dany Fabian
-/
import Std.Data.RBMap
namespace Lean
namespace Xml
def Attributes := Std.RBMap String String compare
instance : ToString Attributes := ⟨λ as => as.fold (λ s n v... |
a6e8b1ade7eb1a1d8c24177cc0fe4d12820dcf18 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/set_theory/cardinal_ordinal.lean | f46f9417a47f8c0d6ecd551d81f107ca246868b5 | [
"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 | 35,423 | 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 set_theory.ordinal_arithmetic
import tactic.omega
/-!
# Cardinals and ordinals
Relationships between cardinals and ordinals, properties of ca... |
e090a997d64727dcfea2e6ddf18a613a227fbe1c | 4bcaca5dc83d49803f72b7b5920b75b6e7d9de2d | /stage0/src/Lean/CoreM.lean | 3300748f22c0ffb62b46a7d88f610f6a21427a9e | [
"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 | 6,305 | 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.RecDepth
import Lean.Util.Trace
import Lean.Data.Options
import Lean.Environment
import Lean.Exception
import Lean.InternalExceptionId
impo... |
b738ba1327eb394160682a5d43a84f5ee09eb35c | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/model_theory/satisfiability.lean | 11d17f341a5f316707cb1ddcbe5e0194cc37fef0 | [
"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 | 28,166 | lean | /-
Copyright (c) 2021 Aaron Anderson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson
-/
import model_theory.ultraproducts
import model_theory.bundled
import model_theory.skolem
/-!
# First-Order Satisfiability
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.... |
5a8132bbd971b851f33e754e5ce8bdd0b8751cd4 | 22e97a5d648fc451e25a06c668dc03ac7ed7bc25 | /src/linear_algebra/tensor_product.lean | a95024d5b3789c548d095de9c916567ef3edae5d | [
"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 | 17,590 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Mario Carneiro
Tensor product of modules over commutative rings.
-/
import group_theory.free_abelian_group
import linear_algebra.direct_sum_module
variables {R : Type*} [comm_... |
9f40b17292a1d539053b1322c1c4f4b0bce0ef69 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/analysis/normed_space/operator_norm.lean | da0bde9095a21b2779871c5a0b88d6de865b5bef | [
"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 | 73,153 | lean | /-
Copyright (c) 2019 Jan-David Salchow. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jan-David Salchow, Sébastien Gouëzel, Jean Lo
-/
import algebra.algebra.tower
import analysis.normed_space.linear_isometry
import analysis.normed_space.riesz_lemma
/-!
# Operator n... |
335ae4f067af12a5ffa3c692c0c8af324d10d12b | 491068d2ad28831e7dade8d6dff871c3e49d9431 | /tests/lean/run/rat_coe.lean | 8f269965a8194b27679d35e3fd73ef81c021de5d | [
"Apache-2.0"
] | permissive | davidmueller13/lean | 65a3ed141b4088cd0a268e4de80eb6778b21a0e9 | c626e2e3c6f3771e07c32e82ee5b9e030de5b050 | refs/heads/master | 1,611,278,313,401 | 1,444,021,177,000 | 1,444,021,177,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 208 | lean | import data.rat
open rat
attribute rat.of_int [coercion]
check (0 : ℚ)
check (rat.of_int 0 : ℚ)
constant f : ℚ → Prop
variable a : nat
check f 0
check f a
set_option pp.coercions true
check f a
|
dff1042a0e6f8e7faf093cf69900f5800d6a7116 | 4e0c49ab645d61b5c3e486a1b460db14552914ae | /library/init/meta/converter/interactive.lean | 35e6c87579c5827eaed327b1d95ac6f22207d8ef | [
"Apache-2.0"
] | permissive | saik2121/lean | 0c733955a9a33270a86d17f4139054c8bd09cff5 | 13007ebb4de63859d9866c19f6e753bbf1852f41 | refs/heads/master | 1,676,215,937,507 | 1,609,762,908,000 | 1,609,762,908,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,874 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
Converter monad for building simplifiers.
-/
prelude
import init.meta.interactive
import init.meta.converter.conv
namespace conv
meta def save_info (p : pos)... |
e3b47ec404b515ff72be1cc1a2d327b77b438fca | 947b78d97130d56365ae2ec264df196ce769371a | /stage0/src/Lean/Meta/CollectMVars.lean | 1a3ace1d5a5c8964e8000520d0dee5ed2b88849f | [
"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,096 | 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.CollectMVars
import Lean.Meta.Basic
namespace Lean
namespace Meta
/--
Collect unassigned metavariables occuring in the given expression... |
4a59168246be66016100ce9d7bf56df54ac01c9b | 8930e38ac0fae2e5e55c28d0577a8e44e2639a6d | /analysis/measure_theory/outer_measure.lean | a3b0f1507ca30338ad1cb8826f172dd4a404ecd2 | [
"Apache-2.0"
] | permissive | SG4316/mathlib | 3d64035d02a97f8556ad9ff249a81a0a51a3321a | a7846022507b531a8ab53b8af8a91953fceafd3a | refs/heads/master | 1,584,869,960,527 | 1,530,718,645,000 | 1,530,724,110,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 18,396 | 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
Outer measures -- overapproximations of measures
-/
import data.set order.galois_connection algebra.big_operators
analysis.ennreal analysis.limits
analys... |
57f85984b67d5a5ed8d4db6dd00f618998788670 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/1825.lean | 954494646c22fd36b8804b1faa84b4a176a0ddfe | [
"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 | 139 | lean | theorem boom : -2147483648 + 2147483648 = 0 := by rfl
theorem boom' : -2147483648 + 2147483648 = -18446744069414584320 := by native_decide
|
9ecdebee71d5f22cfe1aea35cc89e75db2aebe8d | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /tests/lean/run/Reparen.lean | cc093d0848f1216cbc6567ed59ce94bfe17e7ef1 | [
"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,126 | lean | /-! Reprint file after removing all parentheses and then passing it through the parenthesizer -/
import Lean.Parser
open Lean
open Std.Format open Std
def unparenAux (parens body : Syntax) : Syntax :=
match parens.getHeadInfo, body.getHeadInfo, body.getTailInfo, parens.getTailInfo with
| SourceInfo.original lead _ _,... |
494e412b96fb0802bc8f2564eecd299e9ab91573 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/measure_theory/measure/mutually_singular.lean | a0744f3019349d50c9b054215590e6c1227bb692 | [
"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 | 4,196 | lean | /-
Copyright (c) 2021 Kexing Ying. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kexing Ying, Yury Kudryashov
-/
import measure_theory.measure.measure_space
/-! # Mutually singular measures
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file requir... |
07c9a0aa043b0695daedc615e08fa74951df311c | 922aabadca677ef935a2394c546f8ec097ee04a8 | /src/law_of_excluded_middle.lean | 6503aaeda5816e63c47c7d4dea722f5924ea9d9b | [
"MIT"
] | permissive | apurvanakade/uwo2021-CUMC | 14afe4201c54cf42e2bdbc640a5e5e15aec720ba | 0be9402011feda35e510725449686c0af3c3761e | refs/heads/master | 1,688,802,880,363 | 1,629,752,690,000 | 1,629,752,690,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,061 | lean | import tactic
open_locale classical
-- tells Lean to allow the law of excluded middle
variables P Q R : Prop
/--------------------------------------------------------------------------
``push_neg``
Simplifies negations in the target, if possible.
If ``hp : P`` is a hypothesis, then
``push_neg at hp,`` simply... |
859d1a58c58730f29fbe0fdcc0937e5aeb7e9cf1 | ac89c256db07448984849346288e0eeffe8b20d0 | /stage0/src/Lean/Data/Name.lean | cc07f71133f1920ff4dd2d5a3e31223e5ae4560d | [
"Apache-2.0"
] | permissive | chepinzhang/lean4 | 002cc667f35417a418f0ebc9cb4a44559bb0ccac | 24fe2875c68549b5481f07c57eab4ad4a0ae5305 | refs/heads/master | 1,688,942,838,326 | 1,628,801,942,000 | 1,628,801,995,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,824 | lean | /-
Copyright (c) 2018 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
import Std.Data.HashSet
import Std.Data.RBMap
import Std.Data.RBTree
import Lean.Data.SSet
namespace Lean
instance : Coe String Name := ⟨Name.mkSimple⟩
nam... |
a3c7369a1d30ef586fb9050036a35c861f236fde | 4e3bf8e2b29061457a887ac8889e88fa5aa0e34c | /lean/love03_structured_proofs_and_proof_terms_homework_sheet.lean | 3cdcecd3f08babe503aeab7360dcc23986e80ac0 | [] | no_license | mukeshtiwari/logical_verification_2019 | 9f964c067a71f65eb8884743273fbeef99e6503d | 16f62717f55ed5b7b87e03ae0134791a9bef9b9a | refs/heads/master | 1,619,158,844,208 | 1,585,139,500,000 | 1,585,139,500,000 | 249,906,380 | 0 | 0 | null | 1,585,118,728,000 | 1,585,118,727,000 | null | UTF-8 | Lean | false | false | 1,471 | lean | /- LoVe Homework 3: Structured Proofs and Proof Terms -/
import .love02_tactical_proofs_exercise_sheet
namespace LoVe
/- Question 1: Logical Connectives and Quantifiers -/
/- 1.1. Supply a structured proof of the distributivity of `∀` over `∧`. -/
#check forall_and
lemma forall_and₂ {α : Type} (p q : α → Prop) :... |
1e69f0df1c571234ef9c15cd7215b562c2c01677 | 80746c6dba6a866de5431094bf9f8f841b043d77 | /src/order/conditionally_complete_lattice.lean | fa3c201ed2d8691ff23fab4ab672f65e09d88abc | [
"Apache-2.0"
] | permissive | leanprover-fork/mathlib-backup | 8b5c95c535b148fca858f7e8db75a76252e32987 | 0eb9db6a1a8a605f0cf9e33873d0450f9f0ae9b0 | refs/heads/master | 1,585,156,056,139 | 1,548,864,430,000 | 1,548,864,438,000 | 143,964,213 | 0 | 0 | Apache-2.0 | 1,550,795,966,000 | 1,533,705,322,000 | Lean | UTF-8 | Lean | false | false | 33,053 | lean | /-
Copyright (c) 2018 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
Adapted from the corresponding theory for complete lattices.
Theory of conditionally complete lattices.
A conditionally complete lattice is a lattice in which ev... |
9773bc70b3f0d3584a397e40770dec706f2ceb49 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/algebra/star/unitary.lean | 5a373ab6f5b6388a3ca9846286c06ef0e474279c | [
"Apache-2.0"
] | permissive | jcommelin/mathlib | d8456447c36c176e14d96d9e76f39841f69d2d9b | ee8279351a2e434c2852345c51b728d22af5a156 | refs/heads/master | 1,664,782,136,488 | 1,663,638,983,000 | 1,663,638,983,000 | 132,563,656 | 0 | 0 | Apache-2.0 | 1,663,599,929,000 | 1,525,760,539,000 | Lean | UTF-8 | Lean | false | false | 5,130 | lean | /-
Copyright (c) 2022 Frédéric Dupuis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Shing Tak Lam, Frédéric Dupuis
-/
import algebra.star.basic
import group_theory.submonoid.membership
/-!
# Unitary elements of a star monoid
This file defines `unitary R`, where `R`... |
34c220635d31ba6509ee5a939f7d561f5679802f | 5e3548e65f2c037cb94cd5524c90c623fbd6d46a | /src_icannos_totilas/groupes/cpge_groupe_1.lean | 8bbc00f67c0e063cb890f3193290a792e63edbce | [] | 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 | 288 | lean | import algebra.group.basic
import data.real.basic
variables [group {y : ℝ | y ≠ 0}]
def f (n: ℕ ) (x : {y : ℝ | y ≠ 0} ) : ℝ := x
theorem cpge_groupe_1 (n : ℕ ) :
exists g : {y : ℝ | y ≠ 0} →* {y : ℝ | y ≠ 0}, forall x: {y : ℝ | y ≠ 0}, f n x = g x := sorry
|
8bcb33ee5884ab4f48d517488ee69fb698d8a7ab | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/finset/pi_auto.lean | 176fad523d1e2fedd4c5b6db132b5f58d5414231 | [] | 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,682 | lean | /-
Copyright (c) 2018 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Johannes Hölzl
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.finset.basic
import Mathlib.data.multiset.pi
import Mathlib.PostPort
universes u_1 u_2... |
ac74978c3653419f28522b4b49d348be6411a8a2 | 49bd2218ae088932d847f9030c8dbff1c5607bb7 | /src/topology/algebra/ordered.lean | 07e990cfbecb06f5646920defef7aadd9ff16776 | [
"Apache-2.0"
] | permissive | FredericLeRoux/mathlib | e8f696421dd3e4edc8c7edb3369421c8463d7bac | 3645bf8fb426757e0a20af110d1fdded281d286e | refs/heads/master | 1,607,062,870,732 | 1,578,513,186,000 | 1,578,513,186,000 | 231,653,181 | 0 | 0 | Apache-2.0 | 1,578,080,327,000 | 1,578,080,326,000 | null | UTF-8 | Lean | false | false | 71,049 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro, Yury Kudryashov
-/
import tactic.tfae
import order.liminf_limsup
import data.set.intervals
import topology.algebra.group
import topology.constructions
... |
c20978e9355635dd9cd6e49f79437f647486704e | bb31430994044506fa42fd667e2d556327e18dfe | /src/measure_theory/measure/lebesgue.lean | b69c07450b49aee01154e9bce298307d951f42d5 | [
"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 | 29,893 | 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, Sébastien Gouëzel, Yury Kudryashov
-/
import dynamics.ergodic.measure_preserving
import linear_algebra.determinant
import linear_algebra.matrix.diagonal
import linear_a... |
e47bf3d39138949a7f46efb8de9e42730278a6e9 | 675b8263050a5d74b89ceab381ac81ce70535688 | /src/measure_theory/measure_space.lean | 4a603869185e211b3a457035afcbb93e1492c6bd | [
"Apache-2.0"
] | permissive | vozor/mathlib | 5921f55235ff60c05f4a48a90d616ea167068adf | f7e728ad8a6ebf90291df2a4d2f9255a6576b529 | refs/heads/master | 1,675,607,702,231 | 1,609,023,279,000 | 1,609,023,279,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 84,371 | 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 measure_theory.outer_measure
import order.filter.countable_Inter
import data.set.accumulate
/-!
# Measure spaces
Given a measurable space `α`... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.