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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0cfffafdaf49446fbb6bdff4fa73838134f92dbc | 2d787ac9a5ab28a7d164cd13cee8a3cdc1e4680a | /src/my_exercises/08_limits_negation.lean | fbd0a7832e9bdf2483cc89196b46e7e7970dfd6d | [
"Apache-2.0"
] | permissive | paulzfm/lean3-tutorials | 8c113ec2c9494d401c8a877f094db93e5a631fd6 | f41baf1c62c251976ec8dd9ccae9e85ec4c4d336 | refs/heads/master | 1,679,267,488,532 | 1,614,782,461,000 | 1,614,782,461,000 | 344,157,026 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,914 | lean | import tuto_lib
section
/-
The first part of this file makes sure you can negate quantified statements
in your head without the help of `push_neg`.
You need to complete the statement and then use the `check_me` tactic
to check your answer. This tactic exists only for those exercises,
it mostly calls `push_neg` and t... |
77f218be136f4234f6f0469c25f58f5e44d58208 | 947b78d97130d56365ae2ec264df196ce769371a | /stage0/src/Lean/Meta/Tactic/Intro.lean | 2ec8f277e48da62f743ed78073e6d9ccce547c80 | [
"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 | 4,579 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Meta.Tactic.Util
namespace Lean
namespace Meta
@[specialize]
private partial def introNImpAux {σ} (mvarId : MVarId) (mkName : LocalContext → N... |
5d285f8f1136293d3ca6270b02959d87ea922594 | f09e92753b1d3d2eb3ce2cfb5288a7f5d1d4bd89 | /src/Spa.lean | 7ff3785bfefcfbde09639dca8dd13a824b4843c9 | [
"Apache-2.0"
] | permissive | PatrickMassot/lean-perfectoid-spaces | 7f63c581db26461b5a92d968e7563247e96a5597 | 5f70b2020b3c6d508431192b18457fa988afa50d | refs/heads/master | 1,625,797,721,782 | 1,547,308,357,000 | 1,547,309,364,000 | 136,658,414 | 0 | 1 | Apache-2.0 | 1,528,486,100,000 | 1,528,486,100,000 | null | UTF-8 | Lean | false | false | 10,463 | lean | import ring_theory.localization
import ring_theory.subring
import continuous_valuations
import Huber_pair
universes u₁ u₂ u₃
local attribute [instance] classical.prop_decidable
open set function Spv
-- Wedhorn def 7.23.
definition Spa (A : Huber_pair) : set (Spv A) :=
{v | (v ∈ Cont A) ∧ ∀ r, r ∈ A⁺ → v r ≤ 1}
le... |
a9a66ca6780365a2b2bf46dee9d47e970e98f7bf | a4673261e60b025e2c8c825dfa4ab9108246c32e | /tests/lean/run/choiceMacroRules.lean | 80708bc6562d98e146cc00d20aac3fab2df8f667 | [
"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 | 526 | lean |
syntax:65 [myAdd1] term "+++" term:65 : term
syntax:65 [myAdd2] term "+++" term:65 : term
macro_rules [myAdd1]
| `($a +++ $b) => `($a + $b)
macro_rules [myAdd2]
| `($a +++ $b) => `($a ++ $b)
#check (1:Nat) +++ 3
theorem tst1 : ((1:Nat) +++ 3) = 1 + 3 :=
rfl
#check fun (x : Nat) => if x +++ 3 = x then x else x + ... |
0cc9ea93260fc347765b81dbfdcf4c04949bb70e | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/category_theory/opposites.lean | 42c7c63b12c80bb9ccf0708ed029c2987f34f727 | [
"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 | 8,499 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Stephen Morgan, Scott Morrison
-/
import category_theory.types
import category_theory.natural_isomorphism
import data.opposite
universes v₁ v₂ u₁ u₂ -- declare the `v`'s first; see `c... |
beaf729be6e8fc63119d5eff9fcbf50ca07c43c1 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/pnat/basic.lean | 6afff1bc11ed06f71871c71ab7cc5be802766631 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 11,532 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Neil Strickland
-/
import data.pnat.defs
import data.nat.bits
import data.nat.order.basic
import data.set.basic
import algebra.group_with_zero.divisibility
impor... |
aad48a60d68326b4c11ca28f4f58b67254f38a83 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebraic_geometry/projective_spectrum/topology.lean | 68e82cd8de7e5a98f9a9c834c82a4e39f3eea8e5 | [
"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 | 18,947 | lean | /-
Copyright (c) 2020 Jujian Zhang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jujian Zhang, Johan Commelin
-/
import topology.category.Top
import ring_theory.graded_algebra.homogeneous_ideal
/-!
# Projective spectrum of a graded ring
The projective spectrum of ... |
7fbbdd6f762f5df6196f8f08e22561389f55e3ff | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /test/unify_equations.lean | f6f777a399da02782313e2bc58db50ccee64708d | [
"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,470 | 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.unify_equations
-- An example which exercises the injectivity, substitution and heterogeneous
-- downgrading rules.
example (P : ∀ n, fin n → Prop) (n... |
69c106a565850a7ffd796517ad2ed33f73491eae | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/tactic/wlog.lean | f009ffa2887a6dfaa359ca824fe6d798d1d741d5 | [
"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,115 | lean | /-
Copyright (c) 2018 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
Without loss of generality tactic.
-/
import data.list.perm
open expr tactic lean lean.parser
local postfix `?`:9001 := optional
local postfix *:9001 := many
namespa... |
e1c4aca3132647504aa52be4e8b50f0592227867 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/ring_theory/subring.lean | d95757a88bcb0fcae257d11147c3fd229c0f7df4 | [
"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 | 30,702 | lean | /-
Copyright (c) 2020 Ashvni Narayanan. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors : Ashvni Narayanan
-/
import deprecated.subring
import group_theory.subgroup
import ring_theory.subsemiring
/-!
# Subrings
Let `R` be a ring. This file defines the "bundled" subrin... |
8fe0d756240d921dfcc51d54aec68070ccebef65 | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /06_Inductive_Types.org.11.lean | 243782345d6df74a9ae44e6082ddcc7ed5d6c0e1 | [] | 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 | 187 | lean | /- page 80 -/
import standard
import data.bool
open bool
namespace hide
-- BEGIN
definition band (b1 b2 : bool) : bool :=
bool.cases_on b1
ff
(bool.cases_on b2 ff tt)
-- END
end hide
|
d646f444efa39b62181b1f8e5fe058e47cc0869c | 2a70b774d16dbdf5a533432ee0ebab6838df0948 | /_target/deps/mathlib/src/algebra/category/Group/limits.lean | c9bdcd874a034449d62b5f4bca99f62f61ff7879 | [
"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 | 9,747 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import algebra.category.Mon.limits
import algebra.category.Group.preadditive
import category_theory.over
import category_theory.limits.concrete_category
import catego... |
ab2685e306270787998a4991287095a3357da507 | 2fbe653e4bc441efde5e5d250566e65538709888 | /src/topology/uniform_space/basic.lean | 98a2bfc629713fc460d0f1bb78909c5920892f3e | [
"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 | 42,046 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro, Patrick Massot
Theory of uniform spaces.
Uniform spaces are a generalization of metric spaces and topological groups. Many concepts directly
generaliz... |
9b9b59fb4252f21eb7adbbfac7b96ab56b4e99ab | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/topology/algebra/polynomial.lean | 3c9f217178406614c311a39fc8f278f8d878616b | [
"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 | 5,221 | 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 analysis.normed_space.basic
import data.polynomial.algebra_map
import data.polynomial.inductions
/-!
# Polynomials and limits
In this file we prove the fol... |
59fba140a6692c9dc3bc8d008b28a306d07834b3 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/measure_theory/measure/ae_disjoint.lean | 6b272e35de93b9cee3e7ea86385b6ab1aeb0a7a0 | [
"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,877 | lean | /-
Copyright (c) 2022 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import measure_theory.measure.measure_space_def
/-!
# Almost everywhere disjoint sets
We say that sets `s` and `t` are `μ`-a.e. disjoint (see `measure_theory.ae_d... |
f73245db6cbe2e70e35393c68f20c4af06c10e34 | bd12a817ba941113eb7fdb7ddf0979d9ed9386a0 | /src/category_theory/products/default.lean | 0524c99bcd590e8fcd159801037628eba90930de | [
"Apache-2.0"
] | permissive | flypitch/mathlib | 563d9c3356c2885eb6cefaa704d8d86b89b74b15 | 70cd00bc20ad304f2ac0886b2291b44261787607 | refs/heads/master | 1,590,167,818,658 | 1,557,762,121,000 | 1,557,762,121,000 | 186,450,076 | 0 | 0 | Apache-2.0 | 1,557,762,289,000 | 1,557,762,288,000 | null | UTF-8 | Lean | false | false | 5,873 | lean | -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Stephen Morgan, Scott Morrison
import category_theory.functor_category
import category_theory.isomorphism
import tactic.interactive
namespace category_theory
universes v₁ v₂ v... |
047ccf4809c2b1bff1e5963574715d4ecc19e8c7 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/category_theory/natural_transformation.lean | f79814846df4d5a0d0bc0804de24a93e4ac27607 | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 3,553 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Tim Baumann, Stephen Morgan, Scott Morrison, Floris van Doorn
-/
import category_theory.functor
/-!
# Natural transformations
Defines natural transformations between functors.
A nat... |
b5cef1d065db03a13231c40e0e85387ce5b04887 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/550.lean | bb286c9bad2ae9f3915dd7d9e5a5f8356d8c1f00 | [
"Apache-2.0"
] | permissive | soonhokong/lean | cb8aa01055ffe2af0fb99a16b4cda8463b882cd1 | 38607e3eb57f57f77c0ac114ad169e9e4262e24f | refs/heads/master | 1,611,187,284,081 | 1,450,766,737,000 | 1,476,122,547,000 | 11,513,992 | 2 | 0 | null | 1,401,763,102,000 | 1,374,182,235,000 | C++ | UTF-8 | Lean | false | false | 1,174 | lean | --
open function
structure bijection (A : Type) :=
(func finv : A → A)
(linv : finv ∘ func = id)
(rinv : func ∘ finv = id)
attribute bijection.func [coercion]
namespace bijection
variable {A : Type}
definition comp (f g : bijection A) : bijection A :=
bijection.mk
(f ∘ g)
(finv g ∘ finv f)
(by re... |
d4cf6478936975ae20040561b616445f5a4e46a6 | 9dd3f3912f7321eb58ee9aa8f21778ad6221f87c | /tests/lean/minimize_errors.lean | d32b313c2b02d9790986a4dc526c3109f57f55a2 | [
"Apache-2.0"
] | permissive | bre7k30/lean | de893411bcfa7b3c5572e61b9e1c52951b310aa4 | 5a924699d076dab1bd5af23a8f910b433e598d7a | refs/heads/master | 1,610,900,145,817 | 1,488,006,845,000 | 1,488,006,845,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 161 | lean | def f : nat → nat → nat :=
λ a, a
check f
def g : nat → nat → nat :=
f
check g
print g
def h : nat → nat → nat
| x y := g x y + f y x
print h
|
ffc0578b19e6403fcfa42effdb35bc8949698b2e | 618003631150032a5676f229d13a079ac875ff77 | /src/data/subtype.lean | 1b932fff7f78fb49594123b2aacc3759edd2ff08 | [
"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,670 | 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
-/
import tactic.lint
-- Lean complains if this section is turned into a namespace
open function
section subtype
variables {α : Sort*} {p : α → Prop}
@[simp] theorem su... |
625f3bf10f0e718ca6b4f824c07754d036d26a76 | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch3/ex0501.lean | 368072f57e94100030dd15d89e82da40ece8bbf5 | [] | no_license | Ailrun/Theorem_Proving_in_Lean | ae6a23f3c54d62d401314d6a771e8ff8b4132db2 | 2eb1b5caf93c6a5a555c79e9097cf2ba5a66cf68 | refs/heads/master | 1,609,838,270,467 | 1,586,846,743,000 | 1,586,846,743,000 | 240,967,761 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 47 | lean | open classical
variable p : Prop
#check em p
|
c90629cb69d61d9f888b6c8a0cdd82044bc8c913 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /stage0/src/Init/Lean/Data/Trie.lean | 0a7d3755b3c64d026264f7330f06d23ea6694a31 | [
"Apache-2.0"
] | permissive | mhuisi/lean4 | 28d35a4febc2e251c7f05492e13f3b05d6f9b7af | dda44bc47f3e5d024508060dac2bcb59fd12e4c0 | refs/heads/master | 1,621,225,489,283 | 1,585,142,689,000 | 1,585,142,689,000 | 250,590,438 | 0 | 2 | Apache-2.0 | 1,602,443,220,000 | 1,585,327,814,000 | C | UTF-8 | Lean | false | false | 2,882 | lean | /-
Copyright (c) 2018 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Sebastian Ullrich, Leonardo de Moura
Trie for tokenizing the Lean language
-/
prelude
import Init.Data.RBMap
import Init.Lean.Data.Format
namespace Lean
namespace Parser
induc... |
a53e0803c660c6af2c6f3369bfb4d546d19aa662 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/list/indexes.lean | f8264c39876d8ff7c3a9a40974e8611c5c4d6206 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 8,124 | 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 data.list.of_fn
import data.list.range
/-!
# Lemmas about list.*_with_index functions.
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file ... |
7851f8dc8ab72a0df234a60a692f3bd888690edb | 30b012bb72d640ec30c8fdd4c45fdfa67beb012c | /category_theory/products.lean | 90b3be060c67c50c245364760495a98d8cb1337c | [
"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 | 4,892 | lean | -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Stephen Morgan, Scott Morrison
import category_theory.functor_category
import category_theory.isomorphism
import tactic.interactive
namespace category_theory
universes u₁ v₁ u... |
e575b851b9db8343f53e4eb039857285b9bd5110 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/data/nat/choose/bounds.lean | 7ecb3999ac693dc647de8ebde1c28354d063bcc8 | [
"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 | 1,264 | 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, Eric Rodriguez
-/
import data.nat.choose.basic
import data.nat.cast
import algebra.group_power.lemmas
/-!
# Inequalities for binomial coefficients
This file proves expon... |
6ffee68f8e407b4d9656879e8f851239f593f121 | 1fbca480c1574e809ae95a3eda58188ff42a5e41 | /src/util/data/sigma.lean | ce54f3cd69341fc874987c7f59d1a2d12590358f | [] | no_license | unitb/lean-lib | 560eea0acf02b1fd4bcaac9986d3d7f1a4290e7e | 439b80e606b4ebe4909a08b1d77f4f5c0ee3dee9 | refs/heads/master | 1,610,706,025,400 | 1,570,144,245,000 | 1,570,144,245,000 | 99,579,229 | 5 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 383 | lean |
universe variables u v
variables {α : Type u} {β : α → Type v}
variables {x y : sigma β}
variables H : x.1 = y.1
variables H' : x.1 = y.1 → x.2 == y.2
include H H'
lemma sigma.ext : x = y :=
begin
cases x with x₀ x₁,
cases y with y₀ y₁,
have H'' := H' H, clear H',
unfold sigma.fst at H,
unfold sigma.snd... |
0f3adfd0d9fca6984751083996c68ec36faa048c | 744d2f2ae1c950e037b080a0e29c8c49ca9b35e5 | /racket/lib/lemmas.lean | 52b2a2d387cf55d9bd068c256a0fab593707a0b5 | [] | no_license | uw-unsat/bpf-jit-verif | 5a6b18ce04ab291eca921dfeb4e5de9950f9b9fb | 7b15b8f30643509eb3b058cc6ca9060b5bad3bd3 | refs/heads/master | 1,601,284,957,342 | 1,583,173,155,000 | 1,583,173,155,000 | 226,746,308 | 10 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 17,026 | lean | -- Theorems for axiomatization:
-- bvmul_comm, bvmulhu_comm, bvmul_decomp
--
-- The theorems prove that both bvmul and bvmulhu are commutative,
-- and that 64-bit bvmul can be decomposed into 32-bit operations.
-- They are used by spec.rkt to replace bitvector primitives with
-- uninterpreted functions.
--
-- One can c... |
98152c68a31b1bfab20461a7185990bdfa63a408 | b70031c8e2c5337b91d7e70f1e0c5f528f7b0e77 | /src/data/real/hyperreal.lean | ada957e500c45da9afc93a78090fc367fd93260f | [
"Apache-2.0"
] | permissive | molodiuc/mathlib | cae2ba3ef1601c1f42ca0b625c79b061b63fef5b | 98ebe5a6739fbe254f9ee9d401882d4388f91035 | refs/heads/master | 1,674,237,127,059 | 1,606,353,533,000 | 1,606,353,533,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 37,046 | lean | /-
Copyright (c) 2019 Abhimanyu Pallavi Sudhir. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Abhimanyu Pallavi Sudhir
-/
import order.filter.filter_product
import analysis.specific_limits
/-!
# Construction of the hyperreal numbers as an ultraproduct of real sequenc... |
6447e47e813ac570113c2995d9af968cc48516d1 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/analysis/calculus/inverse.lean | d34387ee425680c6f57f6a2c96eba1506ade897d | [
"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 | 32,285 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov, Heather Macbeth, Sébastien Gouëzel
-/
import analysis.calculus.times_cont_diff
import analysis.normed_space.banach
import topology.local_homeomorph
import topology.me... |
aae9e458ab022e7d3c5479da77eec2a5f6bdd6f2 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/noncompSection.lean | b7f121e2f4babc0b3a66c3a7b3941eb25299a3cb | [
"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 | 477 | lean | noncomputable section
theorem ex : ∃ x : Nat, x > 0 :=
⟨1, by decide⟩
def a : Nat := Classical.choose ex
def b : Nat := 0
abbrev c : Nat := Classical.choose ex
abbrev d : Nat := 1
instance e : Inhabited Nat :=
⟨a⟩
instance f : Inhabited Nat :=
⟨b⟩
#eval b + d + f.default
section Foo
def g : Nat := Classic... |
17046baf9b9f215e5ae253d1178540b46e4022bd | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/field_theory/primitive_element.lean | 243145268a41175c969f3a37d084b7844c4eb067 | [
"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 | 9,062 | 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.is_alg_closed.basic
import field_theory.separable
/-!
# Primitive Element Theorem
In t... |
8dde70b6ac099057ef4aeffa1b52305841307f81 | e38e95b38a38a99ecfa1255822e78e4b26f65bb0 | /src/certigrad/run_utils.lean | 7102a10df2554122903d82579a224d419ac057df | [
"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 | 6,393 | lean | /-
Copyright (c) 2017 Daniel Selsam. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Daniel Selsam
Utilities for optimizing over stochastic computation graphs.
-/
import system.io system.time .tensor .tvec .optim .compute_grad .graph
namespace certigrad
open io
namesp... |
5fd07baa6f6f62ff8d7d805ad4d166753a87374f | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/control/except.lean | 004ab976824362bfe71185638c746ac1242b668c | [] | 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 | 5,625 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jared Roesch, Sebastian Ullrich
The except monad transformer.
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.control.alternative
import Mathlib.Lean3Lib.init.control.li... |
00a80363c0a22977889dc37206d7e4f2e64ade65 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/order/pilex.lean | aa44fa40efd679af831cc38618da2a8cfa13cf40 | [
"Apache-2.0"
] | permissive | lacker/mathlib | f2439c743c4f8eb413ec589430c82d0f73b2d539 | ddf7563ac69d42cfa4a1bfe41db1fed521bd795f | refs/heads/master | 1,671,948,326,773 | 1,601,479,268,000 | 1,601,479,268,000 | 298,686,743 | 0 | 0 | Apache-2.0 | 1,601,070,794,000 | 1,601,070,794,000 | null | UTF-8 | Lean | false | false | 4,104 | lean | /-
Copyright (c) 2019 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import algebra.group.pi
import order.rel_classes
import algebra.order_functions
variables {ι : Type*} {β : ι → Type*} (r : ι → ι → Prop)
(s : Π {i}, β i → β i → Prop)
... |
9e119d497aa30dcf75b91e4b55df5d3a47b0a705 | d436468d80b739ba7e06843c4d0d2070e43448e5 | /src/category/traversable/basic.lean | 3c8e76e11e32d3bbec4d7d231fc7d73eff670231 | [
"Apache-2.0"
] | permissive | roro47/mathlib | 761fdc002aef92f77818f3fef06bf6ec6fc1a28e | 80aa7d52537571a2ca62a3fdf71c9533a09422cf | refs/heads/master | 1,599,656,410,625 | 1,573,649,488,000 | 1,573,649,488,000 | 221,452,951 | 0 | 0 | Apache-2.0 | 1,573,647,693,000 | 1,573,647,692,000 | null | UTF-8 | Lean | false | false | 5,610 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Simon Hudon
-/
import tactic.cache
import category.applicative
/-!
# Traversable type class
Type classes for traversing collections. The concepts and laws are taken from
http://hackage.... |
f2df4607d45bd99824fbbfd5c6c1b25d1b168b70 | 86f6f4f8d827a196a32bfc646234b73328aeb306 | /examples/logic/unnamed_798.lean | 5e16a094b9ce07a62c1a3d79860eb9a83e620d96 | [] | 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 | 611 | lean | import data.real.basic
def fn_ub (f : ℝ → ℝ) (a : ℝ) : Prop := ∀ x, f x ≤ a
def fn_lb (f : ℝ → ℝ) (a : ℝ) : Prop := ∀ x, a ≤ f x
def fn_has_ub (f : ℝ → ℝ) := ∃ a, fn_ub f a
def fn_has_lb (f : ℝ → ℝ) := ∃ a, fn_lb f a
variables {f g : ℝ → ℝ}
theorem fn_ub_add {f g : ℝ → ℝ} {a b : ℝ}
(hfa : fn_ub f a) (hgb : fn_u... |
b4c69654f6685fa9a021d4918538fe2f655f606e | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/category_theory/limits/shapes/finite_products.lean | 27c9184bf1faa98da1727415756d4462d452e27c | [
"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 | 2,508 | 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.limits.shapes.finite_limits
import category_theory.limits.shapes.binary_products
import category_theory.limits.shapes.terminal
universes v u
... |
1e81fa9b0ba253ded750f5ac5c63872a30cbd02a | 618003631150032a5676f229d13a079ac875ff77 | /src/analysis/special_functions/exp_log.lean | f64d81f62e5a9aa53bfe45e05ab5a317aa7ff117 | [
"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 | 21,728 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Abhimanyu Pallavi Sudhir, Jean Lo, Calle Sönne
-/
import data.complex.exponential
import analysis.complex.basic
import analysis.calculus.mean_value
/-!
# Complex and real... |
ec8b8cc41e9bd6aeefc074b706b88f2fb652e027 | 46125763b4dbf50619e8846a1371029346f4c3db | /src/analysis/specific_limits.lean | d1d2b47159a0794331d808e0c444bbd91d499e0d | [
"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 | 19,795 | 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
A collection of specific limit computations.
-/
import analysis.normed_space.basic algebra.geom_sum
import topology.instances.ennreal
noncomputable theory
open_locale ... |
bf8e08c32fdea3cc98ae6549d4c8d6fa27f526a8 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/group_theory/group_action/units.lean | 4601235dc869f0f9cead1beee62c3c6227a1aedb | [
"Apache-2.0"
] | permissive | AntoineChambert-Loir/mathlib | 64aabb896129885f12296a799818061bc90da1ff | 07be904260ab6e36a5769680b6012f03a4727134 | refs/heads/master | 1,693,187,631,771 | 1,636,719,886,000 | 1,636,719,886,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,028 | 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 group_theory.group_action.defs
/-! # Group actions on and by `units M`
This file provides the action of a unit on a type `α`, `has_scalar (units M) α`, in the pres... |
24ee5631ac74f42c46c3721f0fbd2e50e642136f | 626e312b5c1cb2d88fca108f5933076012633192 | /src/number_theory/primes_congruent_one.lean | 2bb4dc0da0d4b501fd5b09ae37c61ecb88e5c091 | [
"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 | 3,674 | lean | /-
Copyright (c) 2020 Riccardo Brasca. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Riccardo Brasca
-/
import ring_theory.polynomial.cyclotomic
import topology.algebra.polynomial
import field_theory.finite.basic
/-!
# Primes congruent to one
We prove that, for any... |
ccbd169b8efd82f2255b0dca5b3db07abb50df30 | 3f7026ea8bef0825ca0339a275c03b911baef64d | /src/data/padics/padic_numbers.lean | b54b50cc5acc0541e806b5bc04e03de1a45e4b0b | [
"Apache-2.0"
] | permissive | rspencer01/mathlib | b1e3afa5c121362ef0881012cc116513ab09f18c | c7d36292c6b9234dc40143c16288932ae38fdc12 | refs/heads/master | 1,595,010,346,708 | 1,567,511,503,000 | 1,567,511,503,000 | 206,071,681 | 0 | 0 | Apache-2.0 | 1,567,513,643,000 | 1,567,513,643,000 | null | UTF-8 | Lean | false | false | 32,575 | 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.real.cau_seq_completion topology.metric_space.cau_seq_filter
import data.padics.padic_norm algebra.archimedean analysis.normed_space.basic
import tact... |
4d022a01423d0a6238da74d9a02111b0d243dd3e | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /library/logic/identities.lean | 799fcb96cbe12ba6bce050b52ea71d9ea11d0370 | [
"Apache-2.0"
] | permissive | chubbymaggie/lean | 0d06ae25f9dd396306fb02190e89422ea94afd7b | d2c7b5c31928c98f545b16420d37842c43b4ae9a | refs/heads/master | 1,611,313,622,901 | 1,430,266,839,000 | 1,430,267,083,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,170 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: logic.identities
Authors: Jeremy Avigad, Leonardo de Moura
Useful logical identities. Since we are not using propositional extensionality, some of the
calculations use the type... |
416064f8f55a51703c404d21b7e4fccad5b4c3a0 | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/data/polynomial/identities.lean | 53ccf1007b7d62c62ee6fd36b1cfafd6246ad25c | [
"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 | 3,324 | 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.derivative
import tactic.ring_exp
/-!
# Theory of univariate polynomials
The main def is `binom_e... |
671fc68a510e3fb2d64ad52ead80882c518b51d7 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/argNameAtPlaceholderError.lean | 6c849548461c7a1a88758883112621d9d6826ad3 | [
"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 | 117 | lean | import Lean
open Lean
open Lean.Elab
open Lean.Elab.Term
def f (stx : Syntax) : TermElabM Expr :=
elabTerm _ _ _
|
8eb190920dd8a71d89f9b6741603e75c1b7221eb | 947b78d97130d56365ae2ec264df196ce769371a | /stage0/src/Lean/Util/Profile.lean | a5e4964cc19965f493101c5e72d3cb9c2a727f7b | [
"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 | 573 | lean | /-
Copyright (c) 2019 Sebastian Ullrich. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Sebastian Ullrich
-/
import Lean.Data.Position
namespace Lean
/-- Print and accumulate run time of `act` when Option `profiler` is set to `true`. -/
@[extern 5 "lean_lean_profileit... |
6320c2022f02c965d708eb2cc7c9a65b7e18a93e | 22e97a5d648fc451e25a06c668dc03ac7ed7bc25 | /src/algebra/direct_limit.lean | 7793159f124fed3a80052650d9b3fe8a36e5db79 | [
"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 | 25,256 | 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... |
94f033e9c7eefb408c8be34c6c0f68003c975edd | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/algebra/divisibility.lean | e00d6e6785ddddf6c41c207c922e52407c6e5ff9 | [
"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 | 8,926 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Floris van Doorn, Amelia Livingston, Yury Kudryashov,
Neil Strickland, Aaron Anderson
-/
import algebra.group_with_zero.basic
/-!
# Divisibility
Thi... |
195f2b8281d89b1890882a69b91d586ce00e602c | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/691.lean | d3dbbb7825860b8d97ef1eae3d13799f2edee78a | [
"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 | 203 | lean | theorem foo : Type₁ := unit
example : foo = unit :=
by unfold foo
example : foo = unit :=
by unfold [foo]
example : foo = unit :=
by rewrite [↑foo]
example : foo = unit :=
by rewrite [↑[foo] ]
|
4da3a22dcbf2b790388011ee5ff9e72cea0e86b9 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/data/int/order.lean | 7b0f9c1211b894e85a088da24e1e74799f1a6fbf | [
"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 | 2,962 | lean | /-
Copyright (c) 2021 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
-/
import order.conditionally_complete_lattice
import data.int.least_greatest
/-!
## `ℤ` forms a conditionally complete linear order
The integers form a conditiona... |
1e59361298884b0637e8f7390a1ce4e9435bbc11 | 76df16d6c3760cb415f1294caee997cc4736e09b | /lean/src/tactic/all.lean | 5f551722a6cc1a9efd9c02f9dbc2063a36517e7f | [
"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 | 88 | lean | import .focus_case
import .cases_all
import .with_cases
import .anon_case
import .contra |
858871455a78d0338c1a05437f7d47958b25bb3f | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/data/finset/slice.lean | 7f780f844b2b4b9e5909f495eaf185abd8248a79 | [
"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,277 | lean | /-
Copyright (c) 2021 Bhavik Mehta, Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta, Alena Gusakov, Yaël Dillies
-/
import algebra.big_operators.basic
import data.nat.interval
import order.antichain
/-!
# `r`-sets and slice
This file defines... |
b82103d2437d2f68dbb78b63abb1835d618c8277 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/order/bounded.lean | b3b74598b5b9ba4401b6c3d9f61fdec362aa35fb | [
"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 | 13,552 | lean | /-
Copyright (c) 2022 Violeta Hernández Palacios. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Violeta Hernández Palacios
-/
import order.min_max
import order.rel_classes
import data.set.intervals.basic
/-!
# Bounded and unbounded sets
We prove miscellaneous lemmas... |
0212b905ed1c96d6a668d844888d0c6d586f7e39 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /src/Std/Data/RBTree.lean | 042668213e5cfde8674ce3a3028f50e09c60c456 | [
"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 | 3,658 | 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
-/
import Std.Data.RBMap
namespace Std
universe u v w
def RBTree (α : Type u) (cmp : α → α → Ordering) : Type u :=
RBMap α Unit cmp
instance : Inhabited (R... |
0fa57b889ffd350c9229a0a36900da7e230f12ce | 3dd1b66af77106badae6edb1c4dea91a146ead30 | /library/standard/sum.lean | b61e2f4ac0e0d281a9f47e1fa52ff472188377fd | [
"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 | 429 | lean | -- Copyright (c) 2014 Microsoft Corporation. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Author: Leonardo de Moura
import logic
namespace sum
inductive sum (A : Type) (B : Type) : Type :=
| inl : A → sum A B
| inr : B → sum A B
infixr `+`:25 := sum
theorem induction... |
756ae71bfae035f130bc055c7e6bf9dc85952c58 | e07b1aca72e83a272dd59d24c6e0fa246034d774 | /src/surreal/cardinal/basic.lean | f2c1520470c08371fe4dcfcecbc9947b9633cf8f | [] | no_license | pedrominicz/learn | 637a343bd4f8669d76819ac660a2d2d3e0958710 | b79b802a9846c86c21d4b6f3e17af36e7382f0ef | refs/heads/master | 1,671,746,990,402 | 1,670,778,113,000 | 1,670,778,113,000 | 265,735,177 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 56,599 | lean | import data.nat.enat data.set.countable
import logic.small
import order.conditionally_complete_lattice order.succ_pred.basic
import set_theory.cardinal.schroeder_bernstein
universes u v w
variables {α β : Type u}
instance cardinal.is_equivalent : setoid (Type u) :=
{ r := λ α β, nonempty (α ≃ β),
iseqv := ⟨
λ ... |
62a306f68215948cfddf4b5f37652799f9db6524 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/223.lean | c44647b8a98f5dec0bbb097a84ee01079c847671 | [
"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 | 359 | lean | universe u v
inductive Imf {α : Type u} {β : Type v} (f : α → β) : β → Type (max u v)
| mk : (a : α) → Imf f (f a)
def h {α β} {f : α → β} : {b : β} → Imf f b → α
| _, Imf.mk a => a
#print h
infix:50 " ≅ " => HEq
theorem ex : ∀ {α β : Sort u} (h : α = β) (a : α), cast h a ≅ a
| α, _, rfl, a => HEq.refl a
#print ... |
189b191d4246fca7b1b1970a139b650ac2ed5a6a | 4727251e0cd73359b15b664c3170e5d754078599 | /src/ring_theory/valuation/basic.lean | e966286baa593f29b4f77ccd8ddc90c8c1da7d5f | [
"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,850 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Buzzard, Johan Commelin, Patrick Massot
-/
import algebra.order.with_zero
import algebra.punit_instances
import ring_theory.ideal.operations
/-!
# The basics of valuation theo... |
c3d2f27cee475e544fbc4c1265f7c4a64dfbf530 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/tactic/lint/type_classes_auto.lean | f0358411b90b05e9080a7419133b9aaaa0e926c3 | [] | 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,496 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.tactic.lint.basic
import Mathlib.PostPort
namespace Ma... |
aea8732d3d0c89e31abec8d117a34a0c6efa306e | 5756a081670ba9c1d1d3fca7bd47cb4e31beae66 | /Mathport/Syntax/Translate/Tactic/Mathlib/Interactive.lean | cc9feae1a255100d88629a08b9d1557e9fe15261 | [
"Apache-2.0"
] | permissive | leanprover-community/mathport | 2c9bdc8292168febf59799efdc5451dbf0450d4a | 13051f68064f7638970d39a8fecaede68ffbf9e1 | refs/heads/master | 1,693,841,364,079 | 1,693,813,111,000 | 1,693,813,111,000 | 379,357,010 | 27 | 10 | Apache-2.0 | 1,691,309,132,000 | 1,624,384,521,000 | Lean | UTF-8 | Lean | false | false | 9,596 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import Mathport.Syntax.Translate.Tactic.Basic
import Mathport.Syntax.Translate.Tactic.Lean3
open Lean
namespace Mathport.Translate.Tactic
open AST3 Mathport.... |
865b4841c144ab459e88e666e7e7f0676d080de0 | cb1829c15cd3d28210f93507f96dfb1f56ec0128 | /theorem_proving/08-induction_and_recursion.lean | 5b5061c6db3fd2607b0427b8ec6aa57e4f002dfc | [] | no_license | williamdemeo/LEAN_wjd | 69f9f76e35092b89e4479a320be2fa3c18aed6fe | 13826c75c06ef435166a26a72e76fe984c15bad7 | refs/heads/master | 1,609,516,630,137 | 1,518,123,893,000 | 1,518,123,893,000 | 97,740,278 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,327 | lean | -- 8. Induction and Recursion
#print "==========================================="
#print "Section 8.1. Pattern Matching"
#print " "
namespace Sec_8_1
end Sec_8_1
#print "==========================================="
#print "Section 8.2. Wildcards and Overlapping Patterns"
#print " "
namespace Sec_8_2
end Sec_8_... |
01070dc2447ff8505d9c6453f75503dbef5f5d7e | 4727251e0cd73359b15b664c3170e5d754078599 | /src/analysis/normed_space/matrix_exponential.lean | 9426abbcf06086cc1617ee43c1f0e3aad1fcf86f | [
"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 | 9,035 | lean | /-
Copyright (c) 2022 Eric Wieser. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Eric Wieser
-/
import analysis.normed_space.exponential
import analysis.matrix
import linear_algebra.matrix.zpow
import topology.uniform_space.matrix
/-!
# Lemmas about the matrix expon... |
174ae604c52f78a4a46231f5b801e252bc21ba76 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/tactic/alias.lean | abc686de5d6b4b5c24d91eefff245ecfe16ae089 | [] | 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 | 846 | 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.Lean3Lib.data.buffer.parser
import Mathlib.tactic.core
import Mathlib.PostPort
namespace M... |
7ad0c88701078dc8f76a7221fa9333e35a0d33c8 | 9dd3f3912f7321eb58ee9aa8f21778ad6221f87c | /library/init/meta/simp_tactic.lean | f82cab4d7687832d2aa1adc3bbfb11cf034ea3d7 | [
"Apache-2.0"
] | permissive | bre7k30/lean | de893411bcfa7b3c5572e61b9e1c52951b310aa4 | 5a924699d076dab1bd5af23a8f910b433e598d7a | refs/heads/master | 1,610,900,145,817 | 1,488,006,845,000 | 1,488,006,845,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 18,046 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.meta.tactic init.meta.attribute init.meta.constructor_tactic
import init.meta.relation_tactics init.meta.occurrences init.meta.quote
op... |
bc2fdb32bc2c678e937e06f6aa25562e5fa99a3c | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /tests/lean/run/PPTopDownAnalyze.lean | d7a001c02d6bbf3d04edb2477cc1988d55c77f03 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | tobiasgrosser/lean4 | ce0fd9cca0feba1100656679bf41f0bffdbabb71 | ebdbdc10436a4d9d6b66acf78aae7a23f5bd073f | refs/heads/master | 1,673,103,412,948 | 1,664,930,501,000 | 1,664,930,501,000 | 186,870,185 | 0 | 0 | Apache-2.0 | 1,665,129,237,000 | 1,557,939,901,000 | Lean | UTF-8 | Lean | false | false | 13,640 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Daniel Selsam
-/
import Lean
open Lean Lean.Meta Lean.Elab Lean.Elab.Term Lean.Elab.Command
open Lean.PrettyPrinter
def checkDelab (e : Expr) (tgt? : Option Term) (name? : Opt... |
aafd34db415607e450056b55fa801e8562d1bed4 | 33340b3a23ca62ef3c8a7f6a2d4e14c07c6d3354 | /lia/bval.lean | fa9fa77d0d3de52edbaf2e92e35fa8facdc31daa | [] | no_license | lclem/cooper | 79554e72ced343c64fed24b2d892d24bf9447dfe | 812afc6b158821f2e7dac9c91d3b6123c7a19faf | refs/heads/master | 1,607,554,257,488 | 1,578,694,133,000 | 1,578,694,133,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 967 | lean | import .qfree
def bval : formula → bool
| ⊤' := tt
| ⊥' := ff
| (A' a) := a.eval []
| (p ∧' q) := bval p && bval q
| (p ∨' q) := bval p || bval q
| (¬' p) := bnot (bval p)
| (∃' p) := ff
lemma bval_not {p} :
bval (¬' p) = bnot (bval p) := rfl
lemma bnot_eq_tt_iff_ne_tt {b : bool} :
bnot b = tt ↔ ¬ (b = tt) :... |
b78096e7d6dac339952d13422d2f5e3418be8680 | b074a51e20fdb737b2d4c635dd292fc54685e010 | /src/category_theory/adjunction/fully_faithful.lean | baca12b07806d2520175abf0a0fb12d67e88cb93 | [
"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 | 2,273 | 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.adjunction.basic
import category_theory.yoneda
open category_theory
namespace category_theory
universes v₁ v₂ u₁ u₂
open category
open o... |
31773bc5df35fcaf353772e4d45d63398a8f1002 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/measure_theory/l1_space.lean | 7f76436ba61465f9b431aba8e7e45060d3bd69ce | [
"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 | 29,485 | lean | /-
Copyright (c) 2019 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou
-/
import measure_theory.ae_eq_fun
/-!
# Integrable functions and `L¹` space
In the first part of this file, the predicate `integrable` is defined and basic properties o... |
b8a854baeea94f204f8a2445a48f069f30c3c6bb | 4727251e0cd73359b15b664c3170e5d754078599 | /src/data/finset/pairwise.lean | e88d00420d3124eca27ed7debd044bf7821020b5 | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 2,172 | 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 data.finset.lattice
/-!
# Relations holding pairwise on finite sets
In this file we prove a few results about the interaction of `set.pairwise_disjoint` and `fin... |
e1f568917719007d687a18ad57b625cb3d6922bd | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/ring_theory/jacobson_ideal.lean | d93f2eed2a9ab499eb97ef7a0b8f0dadab55e8e5 | [
"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,415 | lean | /-
Copyright (c) 2020 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Devon Tuma
-/
import ring_theory.ideal.operations
import ring_theory.polynomial.basic
/-!
# Jacobson radical
The Jacobson radical of a ring `R` is defined to be the intersecti... |
98211fa7f057cc782b23ea75b218615b50d5cb54 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/confuse_ind.lean | cad894350cda141b7abedb4560c7b6e30ae1fe1e | [
"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 | 244 | lean | import logic data.prod data.unit
definition mk_arrow (A : Type) (B : Type) :=
A → A → B
inductive confuse (A : Type) :=
| leaf1 : confuse A
| leaf2 : num → confuse A
| node : mk_arrow A (confuse A) → confuse A
check confuse.cases_on
|
8061a10c829c0d9f9910749f6bb4c8f8d585a918 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/order/filter/bases.lean | f950acea0e7f454a1e9a422ad1b1a549585d4a6f | [
"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 | 8,845 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Yury Kudryashov
-/
import order.filter.basic
/-! # Filter bases
In this file we define `filter.has_basis l p s`, where `l` is a filter on `α`, `p` is a predicate
on some index set `... |
69b10f1b9313761ecce0bfb97b83871e9869ef77 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /stage0/src/Lean/Elab/Util.lean | 20574beda3bd8f9a112fb9de77d01163c9bbf98a | [
"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 | 10,543 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Util.Trace
import Lean.Parser.Syntax
import Lean.Parser.Extension
import Lean.KeyedDeclsAttribute
import Lean.Elab.Exception
import Lean.Elab.In... |
ff14900098cd6a9ee9d9b40cdc2ff5a56ee0f661 | 947b78d97130d56365ae2ec264df196ce769371a | /tests/bench/unionfind.lean | cfc91e9225a6c54ae93a1b129bce73f565b3f46e | [
"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 | 4,373 | lean | def StateT' (m : Type → Type) (σ : Type) (α : Type) := σ → m (α × σ)
namespace StateT'
variables {m : Type → Type} [Monad m] {σ : Type} {α β : Type}
@[inline] protected def pure (a : α) : StateT' m σ α := fun s => pure (a, s)
@[inline] protected def bind (x : StateT' m σ α) (f : α → StateT' m σ β) : StateT' m σ β := fu... |
5fedfe3ca1f53ebd3e16c152fd8024ddc786f233 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/topology/sequences.lean | 41d1001cec61351a57c3d0eb6b1fe7b1b791ce5d | [
"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 | 18,869 | lean | /-
Copyright (c) 2018 Jan-David Salchow. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jan-David Salchow, Patrick Massot
-/
import topology.bases
import topology.subset_properties
import topology.metric_space.basic
/-!
# Sequences in topological spaces
In this file ... |
b9a540f9f5c7be5fade9c87090ea73c81089d05d | c9ba4946202cfd1e2586e71960dfed00503dcdf4 | /src/meta_k/default_symbols.lean | 3c0fc1c39d9e45b2c0cfa4789e2c370b67e9f48f | [] | no_license | ammkrn/learning_semantics_of_k | f55f669b369e32ef8407c16521b21ac5c106dc4d | c1487b538e1decc0f1fd389cd36bc36d2da012ab | refs/heads/master | 1,588,081,593,954 | 1,552,449,093,000 | 1,552,449,093,000 | 175,315,800 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,957 | lean | import .meta_sort
import .meta_symbol
def k_list : #SymbolList :=
[
#symbol "#nilCharList" [%Char] [] %CharList,
#symbol "#consCharList" [%Char] [%CharList, %Char] %CharList,
#symbol "#epsilon" [%Char] [%CharList, %Char] %CharList,
#symbol "#appendKCharList" [%Char] [%CharList, %CharList] %CharList,
... |
6393508ddec0d2ae379bbba7a5269fe52da68dc5 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/geometry/euclidean/angle/unoriented/right_angle.lean | 21e7df7841621def937ec3773a0006d9f7a099e5 | [
"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 | 26,764 | lean | /-
Copyright (c) 2020 Joseph Myers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Joseph Myers
-/
import analysis.special_functions.trigonometric.arctan
import geometry.euclidean.angle.unoriented.affine
/-!
# Right-angled triangles
This file proves basic geometrical... |
58853e6adaa58e1d20186c9d9958cf7ffacea385 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/analysis/calculus/tangent_cone.lean | cfdc15a72bf7ef0f6a2b51bb70342a43a57bed66 | [
"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 | 20,174 | 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.convex.topology
import analysis.normed_space.basic
import analysis.specific_limits.basic
/-!
# Tangent cone
In this file, we define two predic... |
f31ea06d6ff8c3eb4abfaf595915ecdc328e637a | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/order/bounds.lean | 7ae8ac7438aef11233b1931a91a9d27fc23a814f | [
"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 | 29,159 | 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 data.set.intervals.basic
import algebra.ordered_group
/-!
# Upper / lower bounds
In this file we define:
* `upper_bounds`, `lower_bounds` :... |
ef4adcd531a6b6ca2f2e1f0cd223eb35f2695194 | ff691356469bf5f2bf3e4f1bdd8ad19630e71465 | /cayley-dickson.hlean | addf184b4b91a397d0b984ed2e32ae443390b74e | [
"Apache-2.0"
] | permissive | EgbertRijke/K-theory | 45952adb052bd51646474c07fdd9ee5c9f9d5f7f | e1be97216092617f6c97f0e6534ad42241b01899 | refs/heads/master | 1,610,298,649,146 | 1,447,810,070,000 | 1,447,810,070,000 | 46,100,234 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,904 | hlean | /-
Copyright (c) 2015 Ulrik Buchholtz and Egbert Rijke. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Ulrik Buchholtz, Egbert Rijke
Cayley-Dickson construction on the level of spheres.
-/
import algebra.group homotopy.join cubical.square
open eq
-- TODO: move all ... |
3a148715d229d1918f5bc8bc83d6bb3d11eface0 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/group_theory/specific_groups/dihedral.lean | 8f396d7436b4cf7fbb1e23c696cbe912adb0726f | [
"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 | 5,879 | lean | /-
Copyright (c) 2020 Shing Tak Lam. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Shing Tak Lam
-/
import data.fintype.card
import data.zmod.basic
import group_theory.exponent
import data.int.parity
/-!
# Dihedral Groups
We define the dihedral groups `dihedral_grou... |
5663061b35f623093a6e8f46892db6ed36eabcb2 | f20db13587f4dd28a4b1fbd31953afd491691fa0 | /library/init/data/basic.lean | fb480735f52f2eb3cd390acf58651c38cfafd9ea | [
"Apache-2.0"
] | permissive | AHartNtkn/lean | 9a971edfc6857c63edcbf96bea6841b9a84cf916 | 0d83a74b26541421fc1aa33044c35b03759710ed | refs/heads/master | 1,620,592,591,236 | 1,516,749,881,000 | 1,516,749,881,000 | 118,697,288 | 1 | 0 | null | 1,516,759,470,000 | 1,516,759,470,000 | null | UTF-8 | Lean | false | false | 597 | 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.data.setoid init.data.quot init.data.bool.basic init.data.unit
import init.data.nat.basic init.data.prod init.data.sum.basic
import init... |
5eaf731ace0ce749807eaaf753526968665d66fb | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/inferForallTypeLCNF.lean | f2cf58879d0d9790ec6b72a48e67c928c14a734e | [
"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 | 106 | lean | import Lean
variable {U V}
def f : (U → V) → (U → U) := sorry
#eval Lean.Compiler.compile #[``f]
|
a3e12d0594b5113b7e77536f15630b1a825dd324 | 3dc4623269159d02a444fe898d33e8c7e7e9461b | /.github/workflows/geo/src/creates.lean | cb5bf57f2cbe467226324cc9a5990723e117414a | [] | no_license | Or7ando/lean | cc003e6c41048eae7c34aa6bada51c9e9add9e66 | d41169cf4e416a0d42092fb6bdc14131cee9dd15 | refs/heads/master | 1,650,600,589,722 | 1,587,262,906,000 | 1,587,262,906,000 | 255,387,160 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,219 | lean | /-
Copyright (c) 2020 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta
-/
import category_theory.limits.limits
import category_theory.limits.preserves
open category_theory category_theory.limits
namespace category_theory
universes v u₁ u₂ u₃... |
1843de7a757398aba2d98dc0763061f7bc254ace | 97f752b44fd85ec3f635078a2dd125ddae7a82b6 | /library/algebra/ring_power.lean | c50d7b895dce1a24df0a9a6f2a6f7db1f39a514f | [
"Apache-2.0"
] | permissive | tectronics/lean | ab977ba6be0fcd46047ddbb3c8e16e7c26710701 | f38af35e0616f89c6e9d7e3eb1d48e47ee666efe | refs/heads/master | 1,532,358,526,384 | 1,456,276,623,000 | 1,456,276,623,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,292 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad
Properties of the power operation in various structures, including ordered rings and fields.
-/
import .group_power .ordered_field
open nat
variable {A : Type}
section s... |
00c024d4678dfe9a91c5f64257e1cc1222f85c0f | 453dcd7c0d1ef170b0843a81d7d8caedc9741dce | /analysis/limits.lean | 04e2f38e2835842c3ac85b33591e196c1ab836bd | [
"Apache-2.0"
] | permissive | amswerdlow/mathlib | 9af77a1f08486d8fa059448ae2d97795bd12ec0c | 27f96e30b9c9bf518341705c99d641c38638dfd0 | refs/heads/master | 1,585,200,953,598 | 1,534,275,532,000 | 1,534,275,532,000 | 144,564,700 | 0 | 0 | null | 1,534,156,197,000 | 1,534,156,197,000 | null | UTF-8 | Lean | false | false | 9,770 | 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
A collection of limit properties.
-/
import algebra.big_operators algebra.group_power tactic.norm_num
analysis.real analysis.topology.infinite_sum
noncomputable theor... |
2e1835bdbe15c4b77c5b327d0f7688d9e89fd9a0 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/topology/sheaves/forget.lean | 3bafd8544aaaa9d5aeb0fb10c653532758e4c53f | [
"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 | 8,022 | 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.preserves.shapes.products
import topology.sheaves.sheaf
/-!
# Checking the sheaf condition on the underlying presheaf of types.
If `G ... |
b7212dcec1c0e1dcd2e4e65487aead378576bcbe | c3f2fcd060adfa2ca29f924839d2d925e8f2c685 | /tests/lean/run/record2.lean | 7636e65f6bcbef4796eb6b0ac17ed3956a2749e9 | [
"Apache-2.0"
] | permissive | respu/lean | 6582d19a2f2838a28ecd2b3c6f81c32d07b5341d | 8c76419c60b63d0d9f7bc04ebb0b99812d0ec654 | refs/heads/master | 1,610,882,451,231 | 1,427,747,084,000 | 1,427,747,429,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 283 | lean | import logic data.unit
set_option pp.universes true
context
parameter (A : Type)
context
parameter (B : Type)
structure point :=
mk :: (x : A) (y : B)
check point
check point.mk
check point.x
end
check point
check point.mk
check point.x
end
|
47de476e08a52f6b6dc929daf33ea9e7eff5f480 | 4bcaca5dc83d49803f72b7b5920b75b6e7d9de2d | /src/Lean/Elab/Tactic/Simp.lean | 280f5eb017b4c8615e79b2c4d5c4ab33df3314bc | [
"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 | 10,158 | 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.Simp
import Lean.Meta.Tactic.Replace
import Lean.Elab.BuiltinNotation
import Lean.Elab.Tactic.Basic
import Lean.Elab.Tactic.ElabTerm... |
d85c21ee11dfd2cd6a9642ad11e43d0c0770bcea | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/module/linear_map.lean | 96457fd912eb800c7a3f8f1021a94052ca06a1e4 | [
"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 | 37,991 | lean | /-
Copyright (c) 2020 Anne Baanen. 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, Anne Baanen,
Frédéric Dupuis, Heather Macbeth
-/
import algebra.hom.group_action
import algebra.module.pi
import algebra... |
779e91f29b4ec1d797d9d5c49ead0961ee544ecf | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/ring_theory/power_series/basic.lean | 683aaf683c40523e9f8461a4286caf2653145395 | [
"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 | 76,119 | lean | /-
Copyright (c) 2019 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Kenny Lau
-/
import algebra.big_operators.nat_antidiagonal
import data.finsupp.interval
import data.mv_polynomial.basic
import data.polynomial.algebra_map
import data.p... |
667a5eef04a45e74786ba801b40a9393816bfe82 | ba4794a0deca1d2aaa68914cd285d77880907b5c | /src/game/world3/level5.lean | c14ea10eceb3b03c94915f66d01ee1216f027e5d | [
"Apache-2.0"
] | permissive | ChrisHughes24/natural_number_game | c7c00aa1f6a95004286fd456ed13cf6e113159ce | 9d09925424da9f6275e6cfe427c8bcf12bb0944f | refs/heads/master | 1,600,715,773,528 | 1,573,910,462,000 | 1,573,910,462,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,101 | lean | import game.world3.level4 -- hide
import mynat.mul -- hide
namespace mynat -- hide
/-
# Multiplication World
## Level 5: `mul_assoc`
We now have enough to prove that multiplication is associative.
## Random tactic hints
1) Did you know you can do `repeat {rw mul_succ}`?
2) Did you know you can do `rwa [hd, mul_a... |
c021ac60e506c95d4bdbd721065e4bf45685b2b9 | 2c096fdfecf64e46ea7bc6ce5521f142b5926864 | /src/Lean/Server/Snapshots.lean | 474692c36d5786077420bee7442c87a1a2ce9031 | [
"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 | Kha/lean4 | 1005785d2c8797ae266a303968848e5f6ce2fe87 | b99e11346948023cd6c29d248cd8f3e3fb3474cf | refs/heads/master | 1,693,355,498,027 | 1,669,080,461,000 | 1,669,113,138,000 | 184,748,176 | 0 | 0 | Apache-2.0 | 1,665,995,520,000 | 1,556,884,930,000 | Lean | UTF-8 | Lean | false | false | 7,549 | lean | /-
Copyright (c) 2020 Wojciech Nawrocki. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Wojciech Nawrocki
-/
import Init.System.IO
import Lean.Elab.Import
import Lean.Elab.Command
import Lean.Widget.InteractiveDiagnostic
/-! One can think of this module as being a ... |
c043298c19aa9734fbc31ade97d117ac755b4b77 | 5ec8f5218a7c8e87dd0d70dc6b715b36d61a8d61 | /globalenvs.lean | a4caea0b7bd91132755bdd59b14d65ad26638b13 | [] | no_license | mbrodersen/kremlin | f9f2f9dd77b9744fe0ffd5f70d9fa0f1f8bd8cec | d4665929ce9012e93a0b05fc7063b96256bab86f | refs/heads/master | 1,624,057,268,130 | 1,496,957,084,000 | 1,496,957,084,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 32,670 | lean |
/- Global environments are a component of the dynamic semantics of
all languages involved in the compiler. A global environment
maps symbol names (names of functions and of global variables)
to the corresponding memory addresses. It also maps memory addresses
of functions to the corresponding function descri... |
2bd2b7da6c51f09719292f4c846bbc88e11625d9 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /src/Lean/Util/Recognizers.lean | 346d9c52049f62ea5ee3aa440b4d568984bcd42e | [
"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 | 3,969 | 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.Environment
namespace Lean
namespace Expr
@[inline] def const? (e : Expr) : Option (Name × List Level) :=
match e with
| Expr.const n us =... |
30d3209f001ac81b4431bf037ef4a5fedcf3d5e4 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/ring_theory/matrix_algebra.lean | ca2d5e863b7a91c42853e5eca9085cc6a8fcd39c | [] | 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,999 | 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.ring_theory.tensor_product
import Mathlib.PostPort
universes u v w
namespace Mathlib
/-... |
928d70125e46c1e66ae963acac2b07423ffc5084 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Meta/Match/CaseArraySizes.lean | 3d9832d7f44c346f0844d617c5a21fdefec18214 | [
"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,728 | 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.Assert
import Lean.Meta.Match.CaseValues
namespace Lean.Meta
structure CaseArraySizesSubgoal where
mvarId : MVarId
elems : Ar... |
11063c6b601ffc55a94b7ce63988824d041fa847 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/measure_theory/integral/set_integral.lean | a6ed1044d17f86ba3f9c66eebf5a943ec8cf637e | [
"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 | 51,395 | 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
import topology.metric_space... |
1d72fbe113a548853d4aa6f790e3f7b98d8befab | bb31430994044506fa42fd667e2d556327e18dfe | /src/data/polynomial/algebra_map.lean | cd83ab6081dc163a579fc1349c7ec0ebe87dfb17 | [
"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 | 13,567 | 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 algebra.algebra.pi
import ring_theory.adjoin.basic
import data.polynomial.eval
/-!
# Theory of univariate polynomi... |
0e8cbbd2c21c02531afd72a235438455d3798005 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/category_theory/category/Cat.lean | a537b08bbf14c8066f183024f15059a09798e505 | [
"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 | 1,371 | lean | /-
Copyright (c) 2019 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import category_theory.concrete_category
/-!
# Category of categories
This file contains definition of category `Cat` of all categories. In
this category object... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.