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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
bfeb49b4105c1c57b1c25744c3c95e389a3a6229 | 4fa118f6209450d4e8d058790e2967337811b2b5 | /src/for_mathlib/topological_groups.lean | 4e66766839f45473ff5d96e4c4be5a246d770666 | [
"Apache-2.0"
] | permissive | leanprover-community/lean-perfectoid-spaces | 16ab697a220ed3669bf76311daa8c466382207f7 | 95a6520ce578b30a80b4c36e36ab2d559a842690 | refs/heads/master | 1,639,557,829,139 | 1,638,797,866,000 | 1,638,797,866,000 | 135,769,296 | 96 | 10 | Apache-2.0 | 1,638,797,866,000 | 1,527,892,754,000 | Lean | UTF-8 | Lean | false | false | 27,200 | lean | import tactic.abel
import topology.algebra.group
import topology.algebra.uniform_ring
import ring_theory.subring
import for_mathlib.topology
import for_mathlib.filter
import for_mathlib.data.set.basic
import algebra.pointwise
/-
open filter function
universe u
class filter_at_one (α : Type u) [group α] :=
(F : fil... |
f994d488fd9d7edcd4e49e59d81896597f3c7343 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/category_theory/elements.lean | f515d3525b58aa2d9edb7d3e2e85d3ae2d3d70b3 | [
"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,153 | 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.equivalence
import category_theory.comma
import category_theory.punit
import category_theory.eq_to_hom
import category_theory.groupoid
/-!
# T... |
8d8f95f91ef48dcf6b183e2e2a699f3e8bd2687c | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/data/equiv/mul_add.lean | 25ea39458ebdc0ee4dda69e6eb7bf804fab7cec1 | [
"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 | 14,076 | 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.basic
import deprecated.group
/-!
# Multiplicative and additive equivs
In this file we define two extensions of `e... |
07e4ff0abee24229ba4868e0fe329598af6efb50 | 969dbdfed67fda40a6f5a2b4f8c4a3c7dc01e0fb | /src/category_theory/monoidal/Mon_.lean | 537b26003102beb3825530a9f4cfc7a2e79686df | [
"Apache-2.0"
] | permissive | SAAluthwela/mathlib | 62044349d72dd63983a8500214736aa7779634d3 | 83a4b8b990907291421de54a78988c024dc8a552 | refs/heads/master | 1,679,433,873,417 | 1,615,998,031,000 | 1,615,998,031,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,393 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.monoidal.discrete
import category_theory.monoidal.unitors
import category_theory.limits.shapes.terminal
import algebra.punit_instances
/-!
# T... |
29f3308aa9d2e0d0c6846ccf662c552c9fc72c27 | 9028d228ac200bbefe3a711342514dd4e4458bff | /src/data/set/lattice.lean | 315a157cabf6d48e528157c95a08a78ee1ce52ec | [
"Apache-2.0"
] | permissive | mcncm/mathlib | 8d25099344d9d2bee62822cb9ed43aa3e09fa05e | fde3d78cadeec5ef827b16ae55664ef115e66f57 | refs/heads/master | 1,672,743,316,277 | 1,602,618,514,000 | 1,602,618,514,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 47,693 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Johannes Hölzl, Mario Carneiro
-- QUESTION: can make the first argument in ∀ x ∈ a, ... implicit?
-/
import order.complete_boolean_algebra
import data... |
bea681ecfcc1602ff457a3b168f4e14af8130756 | 680b0d1592ce164979dab866b232f6fa743f2cc8 | /library/data/finset/basic.lean | 853c9218f1e01bfef1b2e60e3ce9ed50e241dc5e | [
"Apache-2.0"
] | permissive | syohex/lean | 657428ab520f8277fc18cf04bea2ad200dbae782 | 081ad1212b686780f3ff8a6d0e5f8a1d29a7d8bc | refs/heads/master | 1,611,274,838,635 | 1,452,668,188,000 | 1,452,668,188,000 | 49,562,028 | 0 | 0 | null | 1,452,675,604,000 | 1,452,675,602,000 | null | UTF-8 | Lean | false | false | 28,342 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura, Jeremy Avigad
Finite sets.
-/
import data.fintype.basic data.nat data.list.perm algebra.binary
open nat quot list subtype binary function eq.ops
open [decl] p... |
c5121482ed0892522ff10208b87240a664a6af09 | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /src/Lean/PrettyPrinter/Formatter.lean | b34f57a8577821401cd2c08a390ffed138134a00 | [
"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 | 21,684 | lean | /-
Copyright (c) 2020 Sebastian Ullrich. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
-/
/-!
The formatter turns a `Syntax` tree into a `Format` object, inserting both mandatory whitespace (to separate adjacent
tokens) as well as "pretty" optional ... |
5e64f98f3590b726372ccb851b8bed0ed0b6cb0f | 75db7e3219bba2fbf41bf5b905f34fcb3c6ca3f2 | /library/theories/measure_theory/sigma_algebra.lean | ab5e6175182634f372247defa1b519363d80d3f8 | [
"Apache-2.0"
] | permissive | jroesch/lean | 30ef0860fa905d35b9ad6f76de1a4f65c9af6871 | 3de4ec1a6ce9a960feb2a48eeea8b53246fa34f2 | refs/heads/master | 1,586,090,835,348 | 1,455,142,203,000 | 1,455,142,277,000 | 51,536,958 | 1 | 0 | null | 1,455,215,811,000 | 1,455,215,811,000 | null | UTF-8 | Lean | false | false | 9,368 | lean | /-
Copyright (c) 2016 Jacob Gross. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jacob Gross, Jeremy Avigad
Sigma algebras.
-/
import data.set data.nat theories.topology.basic
open eq.ops set nat
structure sigma_algebra [class] (X : Type) :=
(sets : set (set X))
... |
e50be2b246eaf52990d19d80cdcf5f4386ee1207 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/lean/run/update.lean | 289591478d79510e716602757393ffaf113dbd1f | [
"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 | 1,142 | lean | import Init.Lean.Expr
open Lean
def main : IO Unit :=
do let f := mkConst `f [];
let x := mkConst `x [];
let y := mkConst `y [];
let t1 := mkApp f x;
let t2 := t1.updateApp! f y;
let t3 := t1.updateApp! f x;
let t4 := mkProj `Prod 1 x;
let t5 := t4.updateProj! y;
let t6 := t4.update... |
b064bcf9adf22b9332552debf37d7f52c916d7b1 | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/data/padics/padic_norm.lean | bc0e10d962f27185fcdaab77e259495b8a8f16db | [
"Apache-2.0"
] | permissive | fpvandoorn/mathlib | b21ab4068db079cbb8590b58fda9cc4bc1f35df4 | b3433a51ea8bc07c4159c1073838fc0ee9b8f227 | refs/heads/master | 1,624,791,089,608 | 1,556,715,231,000 | 1,556,715,231,000 | 165,722,980 | 5 | 0 | Apache-2.0 | 1,552,657,455,000 | 1,547,494,646,000 | Lean | UTF-8 | Lean | false | false | 13,600 | 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
Define the p-adic valuation on ℤ and ℚ, and the p-adic norm on ℚ
-/
import data.rat algebra.gcd_domain algebra.field_power
import ring_theory.multiplicity tactic.rin... |
4867a8c8b67fb371193954274d63feb4bf1ed711 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/measure_theory/pi_system.lean | efaaa9aa0f3cb1f99487a8c216523007e42c4a9f | [
"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 | 21,366 | lean | /-
Copyright (c) 2021 Martin Zinkevich. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Martin Zinkevich
-/
import logic.encodable.lattice
import measure_theory.measurable_space_def
/-!
# Induction principles for measurable sets, related to π-systems an... |
1d3b61001bf4aadacbaf305fb97d66cb186e7949 | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/data/pnat/basic.lean | acb7f1c8bc0328098b061722bb5dede8d14f7484 | [
"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 | 14,766 | 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.nat.basic
/-!
# The positive natural numbers
This file defines the type `ℕ+` or `pnat`, the subtype of natural numbers that are ... |
f164e8982996d045b759bd932c6edd32f18e542c | 0b3933727d99a2f351f5dbe6e24716bb786a6649 | /src/qtt/context.lean | 08e5a46c5eda041135f62d6afec8792d910ae4d1 | [] | no_license | Vtec234/lean-sesh | 1e770858215279f65aba92b4782b483ab4f09353 | d11d7bb0599406e27d3a4d26242aec13d639ecf7 | refs/heads/master | 1,587,497,515,696 | 1,558,362,223,000 | 1,558,362,223,000 | 169,809,439 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,043 | lean | /- Introduces typing contexts, which are lists of assumptions with associated
multiplicities from an arbitrary semiring. -/
import tactic.ring
import tactic.abel
import algebra
import metastuff
/- In the QTT paper, this would be a "pre-precontext". -/
@[reducible]
def precontext (τ: Type) := list τ
/- In the QT... |
b26f2ead172bd8f37bddf2d9f0b6e084a521890a | c3de33d4701e6113627153fe1103b255e752ed7d | /data/set/basic.lean | ce1d06dcf1f6c2d8bc9cd6b9fcc52b80ec099744 | [] | no_license | jroesch/library_dev | 77d2b246ff47ab05d55cb9706a37d3de97038388 | 4faa0a45c6aa7eee6e661113c2072b8840bff79b | refs/heads/master | 1,611,281,606,352 | 1,495,661,644,000 | 1,495,661,644,000 | 92,340,430 | 0 | 0 | null | 1,495,663,344,000 | 1,495,663,344,000 | null | UTF-8 | Lean | false | false | 36,290 | 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
-- TODO: in emacs mode, change "\sub" to regular subset, use "\ssub" for strict,
similarly for "\sup"
-- QUESTION: can make the first argument... |
17286d49cf72bf8ca7b4d283f7de612112b9b4e8 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /stage0/src/Lean/Parser/Extra.lean | 85a33bd3a6d9165826bdf60c97ac2d418f40f053 | [
"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 | 9,610 | 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, Sebastian Ullrich
-/
import Lean.Parser.Extension
-- necessary for auto-generation
import Lean.PrettyPrinter.Parenthesizer
import Lean.PrettyPrinter.Formatter... |
f2b132555dfaa631259cf24eed3a17d61e8c530c | 4727251e0cd73359b15b664c3170e5d754078599 | /src/data/nat/factorization.lean | 89dc6eea890078d2291106f1c18e953190453f28 | [
"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 | 22,705 | lean | /-
Copyright (c) 2021 Stuart Presnell. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Stuart Presnell
-/
import data.nat.prime
import data.finsupp.multiset
import algebra.big_operators.finsupp
import tactic.linarith
import tactic.interval_cases
/-!
# Prime factorizati... |
2641fc6995697f61ff45aa2c220a284291d3e1db | aac33c518959cd0633fdc254edbbf27b2f581c31 | /src/algebra/group_power.lean | 616afc7125c076068f600d89a19e0a3520013aa8 | [
"Apache-2.0"
] | permissive | digama0/mathlib-ITP2019 | 992c4f9ac02260fca4a14860813c3ecbd5ca1ae6 | 5cbd0362e04e671ef5db1284870592af6950197c | refs/heads/master | 1,588,517,123,478 | 1,554,081,078,000 | 1,554,081,078,000 | 178,686,466 | 2 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 26,993 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Robert Y. Lewis
The power operation on monoids and groups. We separate this from group, because it depends on
nat, which in turn depends on other parts of algebra.
We h... |
f3e3aef5759f44cff9f949d92df8692e796c8092 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/measure_theory/decomposition/unsigned_hahn.lean | 7c41df895fa794abfedb6dc32f8ab0faf1d564cf | [
"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 | 8,590 | lean | /-
Copyright (c) 2019 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
-/
import measure_theory.measure.measure_space
/-!
# Unsigned Hahn decomposition theorem
This file proves the unsigned version of the Hahn decomposition theorem.
## M... |
fbd1dee56784e42611476b7f0c5d94c862c2529d | ae1e94c332e17c7dc7051ce976d5a9eebe7ab8a5 | /stage0/src/Lean/Compiler/IR/EmitUtil.lean | 35abafa9ff3bdaf5ff822a7b8d285ac97642e19e | [
"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 | 3,219 | 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.Compiler.InitAttr
import Lean.Compiler.IR.CompilerM
/- Helper functions for backend code generators -/
namespace Lean.IR
/- Return true iff `b... |
1686162508f7b83c8ca425f0d4d73e4249f0cd7e | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/linear_algebra/matrix/spectrum.lean | 1482feb2422010c65c15cecfdb7acbc39d3c3b05 | [
"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,667 | lean | /-
Copyright (c) 2022 Alexander Bentkamp. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Alexander Bentkamp
-/
import analysis.inner_product_space.spectrum
import linear_algebra.matrix.hermitian
/-! # Spectral theory of hermitian matrices
This file proves the spectra... |
27bfd16fdb2352d2d3373c46e4de270e1a0c9d4e | a4673261e60b025e2c8c825dfa4ab9108246c32e | /stage0/src/Init/System/IO.lean | f40b4cfef762d4a89360c10d410ffbb1ec05ea2a | [
"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 | 18,354 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Luke Nelson, Jared Roesch, Leonardo de Moura, Sebastian Ullrich
-/
prelude
import Init.Control.EState
import Init.Control.Reader
import Init.Data.String
import Init.Data.ByteArr... |
8f7dee0b5790902594287bc3b6d038ec1db1454e | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/ring_theory/coprime/lemmas.lean | 375ddc602451205b1b504504499d94027eb8e565 | [
"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 | 4,413 | lean | /-
Copyright (c) 2020 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Ken Lee, Chris Hughes
-/
import algebra.big_operators.basic
import data.fintype.basic
import data.int.gcd
import data.set.pairwise
import ring_theory.coprime.basic
/-!
# Additio... |
68c033c4888ae6f14bb68b61baa6be074fd8b853 | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /tests/lean/hott/433.hlean | 63a2fbfe1eb521d9a1d15cd43024f87884b0189a | [
"Apache-2.0"
] | permissive | chubbymaggie/lean | 0d06ae25f9dd396306fb02190e89422ea94afd7b | d2c7b5c31928c98f545b16420d37842c43b4ae9a | refs/heads/master | 1,611,313,622,901 | 1,430,266,839,000 | 1,430,267,083,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,854 | hlean | /-
Copyright (c) 2014 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Floris van Doorn
Ported from Coq HoTT
Theorems about pi-types (dependent function spaces)
-/
import types.sigma
open eq equiv is_equiv funext
namespace pi
universe variables l k
... |
cfc1e890163fa26a5421b8a17e9c63308058920f | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/lean/defaultInstance.lean | ea026696afafdf0964bff1b2cd6d37cf4c3d3462 | [
"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 | 397 | lean | class Foo (α β : Type) :=
(f : α → β)
export Foo (f)
@[defaultInstance]
instance : Foo Nat Nat := {
f := id
}
@[defaultInstance]
instance : Foo String String := {
f := id
}
def g (x : Nat) := f x -- works
def h (x : String) := f x -- works
def r (x : Bool) := f x -- error
def r [Foo Bool Nat] (x : Bool) :=... |
c0647b770a18a4e4e52664b5e67782f554c6e019 | 6fca17f8d5025f89be1b2d9d15c9e0c4b4900cbf | /src/game/world6/level6.lean | a15c88c2df64161e5c878b76df72dc8054be2619 | [
"Apache-2.0"
] | permissive | arolihas/natural_number_game | 4f0c93feefec93b8824b2b96adff8b702b8b43ce | 8e4f7b4b42888a3b77429f90cce16292bd288138 | refs/heads/master | 1,621,872,426,808 | 1,586,270,467,000 | 1,586,270,467,000 | 253,648,466 | 0 | 0 | null | 1,586,219,694,000 | 1,586,219,694,000 | null | UTF-8 | Lean | false | false | 1,250 | lean | /-
# Proposition world.
## Level 6: `(P → (Q → R)) → ((P → Q) → (P → R))`.
You can solve this level completely just using `intro`, `apply` and `exact`,
but if you want to argue forwards instead of backwards then don't forget
that you can do things like `have j : Q → R := f p` if `f : P → (Q → R)`
and `p : P`. I reco... |
a5e910d8f868842660e8f1fc92346ee9f5ddb2db | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/prv.lean | d56bb67311e68e9c0b8c93b0e52ebe0df8c83495 | [
"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 | 60 | lean |
private def x := 10
#check _root_.x
#check x
#eval x + 1
|
1c2c62fad1df3c989039ff78b7ced0eadf642885 | 097294e9b80f0d9893ac160b9c7219aa135b51b9 | /instructor/predicate_logic/proofs.lean | 4cc16f9bc58160e3d35e89ec852b3f2fe2d433d9 | [] | no_license | AbigailCastro17/CS2102-Discrete-Math | cf296251be9418ce90206f5e66bde9163e21abf9 | d741e4d2d6a9b2e0c8380e51706218b8f608cee4 | refs/heads/main | 1,682,891,087,358 | 1,621,401,341,000 | 1,621,401,341,000 | 368,749,959 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 13,464 | lean | /-
Today we will see in that proofs can be understood as formal
objects in their own right.
We will start to make our way through the valid rules of
inference from our unit on propositional logic. We will
emphasize that they are rules for combining and deriving
Boolean truth values. In predicate logic, by contrast, w... |
f162cfcd1dc64f6a613a9a67e3d0b9de724f9c5b | 1abd1ed12aa68b375cdef28959f39531c6e95b84 | /src/geometry/manifold/charted_space.lean | 94d87217f91d0532c043dc324b73d5bb43bc9a09 | [
"Apache-2.0"
] | permissive | jumpy4/mathlib | d3829e75173012833e9f15ac16e481e17596de0f | af36f1a35f279f0e5b3c2a77647c6bf2cfd51a13 | refs/heads/master | 1,693,508,842,818 | 1,636,203,271,000 | 1,636,203,271,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 48,253 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import topology.local_homeomorph
/-!
# Charted spaces
A smooth manifold is a topological space `M` locally modelled on a euclidean space (or a euclidean
half-... |
c5907528940a779b1025a2762bab4a5e517784c8 | 5ae26df177f810c5006841e9c73dc56e01b978d7 | /src/data/set/lattice.lean | 6e2467ff683917930be21e9b9e3c78f740a59f20 | [
"Apache-2.0"
] | permissive | ChrisHughes24/mathlib | 98322577c460bc6b1fe5c21f42ce33ad1c3e5558 | a2a867e827c2a6702beb9efc2b9282bd801d5f9a | refs/heads/master | 1,583,848,251,477 | 1,565,164,247,000 | 1,565,164,247,000 | 129,409,993 | 0 | 1 | Apache-2.0 | 1,565,164,817,000 | 1,523,628,059,000 | Lean | UTF-8 | Lean | false | false | 34,329 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors Jeremy Avigad, Leonardo de Moura, Johannes Hölzl, Mario Carneiro
-- QUESTION: can make the first argument in ∀ x ∈ a, ... implicit?
-/
import logic.basic data.set.basic data.equiv.basic... |
1d810d64c86aa65665a8276c6911c8436ce56c54 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/ExprLens.lean | 8008fbc27ef4dbb80d9588324cef15fc6cae4fbe | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 2,844 | lean | import Lean.Meta.ExprLens
import Lean.Meta.ExprTraverse
import Lean
open Lean Meta Elab Term SubExpr
def Lean.LocalContext.subtract (Γ Δ : LocalContext) : Array Expr :=
-- have Δ = Γ ++ E
let Δ := Δ.getFVars
let Γ := Γ.getFVars
let E := Δ[:(Δ.size - Γ.size)]
E.toArray
def ExprTraversal := ∀{M : _} [Monad M... |
831c01ea79c4bb7ebfccfa661fcde757fd07144c | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/order/countable_dense_linear_order_auto.lean | bfdd54bd4524ab83526baf3ae44990f83f8fd417 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,029 | lean | /-
Copyright (c) 2020 David Wärn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Wärn
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.order.ideal
import Mathlib.data.finset.default
import Mathlib.PostPort
universes u_1 u_2
namespa... |
32a469683c8e25b1afcf8c678b1c1c1b967d349b | f3a5af2927397cf346ec0e24312bfff077f00425 | /src/game/world8/level5.lean | 5a0a50f6242e63cdc552a0f79a45af8dfa9ab4a6 | [
"Apache-2.0"
] | permissive | ImperialCollegeLondon/natural_number_game | 05c39e1586408cfb563d1a12e1085a90726ab655 | f29b6c2884299fc63fdfc81ae5d7daaa3219f9fd | refs/heads/master | 1,688,570,964,990 | 1,636,908,242,000 | 1,636,908,242,000 | 195,403,790 | 277 | 84 | Apache-2.0 | 1,694,547,955,000 | 1,562,328,792,000 | Lean | UTF-8 | Lean | false | false | 955 | lean | import mynat.definition -- hide
import mynat.add -- hide
import game.world8.level4 -- hide
namespace mynat -- hide
/-
# Advanced Addition World
## Level 5: `add_right_cancel`
The theorem `add_right_cancel` is the theorem that you can cancel on the right
when you're doing addition -- if `a + t = b + t` then `a = b`.... |
1cf925af3dc79c063948575ad9d3ded20872d4e5 | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/algebra/algebra/tower.lean | 5af7f1511e257cd2dc2e595f08243330903743d5 | [
"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 | 11,688 | 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 algebra.algebra.subalgebra
/-!
# Towers of algebras
In this file we prove basic facts about towers of algebra.
An algebra tower A/S/R is expressed by having instance... |
a277f2bbeff6f5406f3ebea70ad2d2ed7aa3d042 | b815abf92ce063fe0d1fabf5b42da483552aa3e8 | /library/data/nat.lean | 10843b8c66ad3db3a4ebb633b01803ee31173309 | [
"Apache-2.0"
] | permissive | yodalee/lean | a368d842df12c63e9f79414ed7bbee805b9001ef | 317989bf9ef6ae1dec7488c2363dbfcdc16e0756 | refs/heads/master | 1,610,551,176,860 | 1,481,430,138,000 | 1,481,646,441,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,449 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad
This is a minimal port of functions from the lean2 library.
-/
import algebra.order
namespace nat
/- sub theorems -/
theorem sub_add_cancel : Π{n i : ℕ}, i ... |
c2e40cb1d484674e9ea4b00a9fb7c933317037a3 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/model_theory/basic.lean | b9381bcfcd2e63434a717dc5866c1f26de8dd32d | [
"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 | 29,192 | lean | /-
Copyright (c) 2021 Aaron Anderson, Jesse Michael Han, Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson, Jesse Michael Han, Floris van Doorn
-/
import data.fin.vec_notation
import set_theory.cardinal.basic
/-!
# Basics on First-Order ... |
57a05a59551611f3580c0c6b8b099186d0297ec4 | 38ee9024fb5974f555fb578fcf5a5a7b71e669b5 | /Mathlib/Tactic/SolveByElim.lean | f0823455c8d1bb2b926bf104ea493f714c8547bc | [
"Apache-2.0"
] | permissive | denayd/mathlib4 | 750e0dcd106554640a1ac701e51517501a574715 | 7f40a5c514066801ab3c6d431e9f405baa9b9c58 | refs/heads/master | 1,693,743,991,894 | 1,636,618,048,000 | 1,636,618,048,000 | 373,926,241 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,266 | lean | /-
Copyright (c) 2021 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Scott Morrison
-/
import Lean.Meta.Tactic.Apply
import Lean.Elab.Tactic.Basic
import Mathlib.Tactic.Core
import Mathlib.Lean.LocalContext
/-!
A primitive replacement for Lean3's `solve... |
1bd0ad286396f46e295510cc8be1c99b701b3a67 | 4727251e0cd73359b15b664c3170e5d754078599 | /test/to_additive.lean | 7ab9e3acb9eab7b2332295acc9ca5ebc9fe91921 | [
"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,648 | lean | import algebra.group.to_additive
import algebra.group.units
import tactic
-- work in a namespace so that it doesn't matter if names clash
namespace test
@[to_additive bar0]
def foo0 {α} [has_mul α] [has_one α] (x y : α) : α := x * y * 1
class {u v} my_has_pow (α : Type u) (β : Type v) :=
(pow : α → β → α)
class my_h... |
da5d8d969435e1fe1e8f7379e11842d056107c73 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/data/set/prod.lean | c310575f9625606bfd8d0878c16dbe1633b19174 | [
"Apache-2.0"
] | permissive | ramonfmir/mathlib | c5dc8b33155473fab97c38bd3aa6723dc289beaa | 14c52e990c17f5a00c0cc9e09847af16fabbed25 | refs/heads/master | 1,661,979,343,526 | 1,660,830,384,000 | 1,660,830,384,000 | 182,072,989 | 0 | 0 | null | 1,555,585,876,000 | 1,555,585,876,000 | null | UTF-8 | Lean | false | false | 21,424 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Johannes Hölzl, Patrick Massot
-/
import data.set.basic
/-!
# Sets in product and pi types
This file defines the product of sets in `α × β` and in `Π i, α i` along wi... |
c2a319fa5827c584f328c8c11640e709e4f07a3a | 957a80ea22c5abb4f4670b250d55534d9db99108 | /library/init/data/string/lemmas.lean | 7fc873f890a7916e5cb9fa76b42c9a6b696191aa | [
"Apache-2.0"
] | permissive | GaloisInc/lean | aa1e64d604051e602fcf4610061314b9a37ab8cd | f1ec117a24459b59c6ff9e56a1d09d9e9e60a6c0 | refs/heads/master | 1,592,202,909,807 | 1,504,624,387,000 | 1,504,624,387,000 | 75,319,626 | 2 | 1 | Apache-2.0 | 1,539,290,164,000 | 1,480,616,104,000 | C++ | UTF-8 | Lean | false | false | 975 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
prelude
import init.meta
namespace string
lemma empty_ne_str (c : char) (s : string) : empty ≠ str s c :=
begin cases s, unfold str empty, intro h, injectio... |
23cf39675d6dcf9cbfcf2b2e17a4d842e154acde | 853df553b1d6ca524e3f0a79aedd32dde5d27ec3 | /src/category_theory/limits/shapes/kernels.lean | 5afe8172d30412a8cd6d1b9bf8ec2da732a03db4 | [
"Apache-2.0"
] | permissive | DanielFabian/mathlib | efc3a50b5dde303c59eeb6353ef4c35a345d7112 | f520d07eba0c852e96fe26da71d85bf6d40fcc2a | refs/heads/master | 1,668,739,922,971 | 1,595,201,756,000 | 1,595,201,756,000 | 279,469,476 | 0 | 0 | null | 1,594,696,604,000 | 1,594,696,604,000 | null | UTF-8 | Lean | false | false | 16,434 | 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.zero
/-!
# Kernels and cokernels
In a category with zero morphisms, the kernel of a morphism `f : X ⟶ Y` is the ... |
e5535bc0752648a8f306049eacc45a8b6a803b81 | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /src/Lean/Elab/Binders.lean | d6546dc059b0d3eea51c9566e94f3c9980b5d74d | [
"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 | 32,518 | 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.Elab.Quotation.Precheck
import Lean.Elab.Term
import Lean.Elab.BindersUtil
import Lean.Elab.AuxDiscr
namespace Lean.Elab.Term
open Meta
open Le... |
1fef34869a0128d0b26ba3c5cdc581e5461a5b91 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/ring_theory/polynomial/vieta.lean | 515c63599829edf4da0f80a065877224ce793388 | [
"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 | 4,507 | lean | /-
Copyright (c) 2020 Hanting Zhang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hanting Zhang
-/
import ring_theory.polynomial.basic
import ring_theory.polynomial.symmetric
/-!
# Vieta's Formula
The main result is `vieta.prod_X_add_C_eq_sum_esymm`, which shows th... |
6ee437bd8874e29b695e692eb7d70d51e52542bf | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/category_theory/limits/shapes/split_coequalizer.lean | a22d5a4f5797132df37086a544b8036309fc74f9 | [
"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 | 5,508 | 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.shapes.equalizers
/-!
# Split coequalizers
We define what it means for a triple of morphisms `f g : X ⟶ Y`, `π : Y ⟶ Z` to be a split
coeq... |
b4948022f720eed02d8acabc85678f25ad14ac1f | 2b0e277371df7056b343785ee43e0917e5844dac | /src/random_variable.lean | 9032238d416688083fc101436e8925087ffcf397 | [] | no_license | kodyvajjha/lean-crm | f3795ddff12bbc04dc08f6b6e4708698929c1af1 | f6cbb0061e4521632d26a1ab23fbdfe231e4c18a | refs/heads/master | 1,587,882,457,792 | 1,553,563,945,000 | 1,553,563,945,000 | 173,365,069 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,833 | lean | /-
Copyright (c) 2018 Koundinya Vajjha. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Koundinya Vajjha
A formalization of properties of random variables.
-/
import .probability_theory tactic.tidy
import order.filter
import measure_theory.lebesgue_measure measure_the... |
8ac43dd7228261cc74213b9a4f6b75ccd32c17cc | 4a3109c7bb55b7ea698278061cbb921b8db93b7f | /mm0-lean/x86/bits.lean | 27b35b97e8cd802cb2ec1eb2856b630ec96c1131 | [
"CC0-1.0"
] | permissive | LongJohnCoder/mm0 | d233200cd7baae9c521cacfbbe162b2ff3bd993f | 0c556a21af92d552e859fd42794f57398c3964cf | refs/heads/master | 1,600,930,472,594 | 1,574,627,400,000 | 1,574,627,400,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,936 | lean | -- import data.bitvec
import data.vector
@[reducible] def bitvec (n : ℕ) := vector bool n
namespace bitvec
open vector nat
-- Create a zero bitvector
@[reducible] protected def zero (n : ℕ) : bitvec n := repeat ff n
-- Create a bitvector with the constant one.
@[reducible] protected def one : Π (n : ℕ), bitvec n
| ... |
6e2829ee5e63d167fa2da5ccd8ab220873ed0eee | 94e33a31faa76775069b071adea97e86e218a8ee | /src/measure_theory/function/simple_func_dense.lean | 0eb08843732262507119ef3b3d643d4489ac1e63 | [
"Apache-2.0"
] | permissive | urkud/mathlib | eab80095e1b9f1513bfb7f25b4fa82fa4fd02989 | 6379d39e6b5b279df9715f8011369a301b634e41 | refs/heads/master | 1,658,425,342,662 | 1,658,078,703,000 | 1,658,078,703,000 | 186,910,338 | 0 | 0 | Apache-2.0 | 1,568,512,083,000 | 1,557,958,709,000 | Lean | UTF-8 | Lean | false | false | 7,471 | lean | /-
Copyright (c) 2019 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou, Yury Kudryashov, Heather Macbeth
-/
import measure_theory.integral.mean_inequalities
import topology.continuous_function.compact
import topology.metric_space.metrizable
... |
8491f65320955751fa8a44c87fe9abd493a6e689 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/hash_map.lean | 1c105b600c3927d2c716001af7002add85a1cb2f | [
"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 | 29,668 | 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, Mario Carneiro
-/
import data.array.lemmas
import data.list.join
import data.list.range
import data.list.nodup
import data.pnat.defs
/-!
# Hash maps
> THIS ... |
95f8e5677b6b7fee68fc3198a0d272c9cf27907f | 94e33a31faa76775069b071adea97e86e218a8ee | /src/combinatorics/simple_graph/basic.lean | 6787d54c52f1f4b3838d7e1316cc5b70ac336cdd | [
"Apache-2.0"
] | permissive | urkud/mathlib | eab80095e1b9f1513bfb7f25b4fa82fa4fd02989 | 6379d39e6b5b279df9715f8011369a301b634e41 | refs/heads/master | 1,658,425,342,662 | 1,658,078,703,000 | 1,658,078,703,000 | 186,910,338 | 0 | 0 | Apache-2.0 | 1,568,512,083,000 | 1,557,958,709,000 | Lean | UTF-8 | Lean | false | false | 46,806 | lean | /-
Copyright (c) 2020 Aaron Anderson, Jalex Stark, Kyle Miller. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson, Jalex Stark, Kyle Miller, Alena Gusakov, Hunter Monroe
-/
import data.rel
import data.set.finite
import data.sym.sym2
/-!
# Simple graphs
Th... |
cdc9c420ab032c6ff7198edf4bef8394e1914245 | e0b0b1648286e442507eb62344760d5cd8d13f2d | /src/Lean/Meta/Basic.lean | 0d853f6271f5bde5339c9f44a73962ae8eeafb89 | [
"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 | 46,812 | 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.Data.LOption
import Lean.Environment
import Lean.Class
import Lean.ReducibilityAttrs
import Lean.Util.Trace
import Lean.Util.RecDepth
import Lea... |
b65f987039059369ca8423bc74d5b1cf1284aea8 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/data/list/default.lean | 7dd7b256ebaaf44ed478824e1c629501228b4e87 | [] | 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 | 394 | 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.data.list.basic
import Mathlib.Lean3Lib.init.data.list.instances
import Mathlib.Lean3Lib.init.data.list.... |
cefbf592f05ee26f5d95d8f257c48a7510d96d7b | e09201d437062e1f95e6e5360aab0c9f947901aa | /src/automata/epsnfa_append.lean | f8de42344d543450ede159e8fa6b5e5c3a35895f | [] | no_license | VArtem/lean-regular-languages | 34f4b093f28ef2f09ba7e684e642a0f97c901560 | e877243188253d0ac17ccf0ae2da7bf608686ff0 | refs/heads/master | 1,683,590,111,306 | 1,622,307,234,000 | 1,622,307,234,000 | 284,232,653 | 7 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,519 | lean | import data.set.basic
import data.set.finite
import data.finset.basic
import automata.epsnfa
import languages.basic
open set epsnfa languages
namespace epsnfa.append
variables {S Q Q1 Q2 : Type} [fintype S] [fintype Q1] [fintype Q2] [decidable_eq Q1] [decidable_eq Q2]
def epsnfa_append (e1 : epsNFA S Q1) (e2 : epsN... |
5e9ecb00e76f14737814260730bbf805d30a31de | 17d3c61bf162bf88be633867ed4cb201378a8769 | /tests/lean/run/simple.lean | eb5d28a0da5d195ad48d1bde75d3ff032a3aba50 | [
"Apache-2.0"
] | permissive | u20024804/lean | 11def01468fb4796fb0da76015855adceac7e311 | d315e424ff17faf6fe096a0a1407b70193009726 | refs/heads/master | 1,611,388,567,561 | 1,485,836,506,000 | 1,485,836,625,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 572 | lean | prelude
definition Prop : Sort.{1} := Sort.{0}
section
parameter A : Sort*
definition Eq (a b : A) : Prop
:= ∀P : A → Prop, P a → P b
theorem subst (P : A → Prop) (a b : A) (H1 : Eq a b) (H2 : P a) : P b
:= H1 P H2
theorem refl (a : A) : Eq a a
:= λ (P : A → Prop) (H : P a), H
theorem symm (a b : A)... |
48378a2f92570fb5e54bca3aa67b58b7916d86f9 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/algebra/group_with_zero/default.lean | abee44fdd8a44647688061e5a4d8f49b6b8e6722 | [] | 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 | 149 | lean | import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.algebra.group_with_zero.basic
import Mathlib.PostPort
namespace Mathlib
|
d18f256071da85b47b4e508c14d1ed65c8e4c962 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/data/complex/cardinality.lean | ca811fe49ad881e9f2c66f8d18a84ff0b61ffbb6 | [
"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 | 942 | 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 data.complex.basic
import data.real.cardinality
/-!
# The cardinality of the complex numbers
This file shows that the complex number... |
a1be5ebf7ef1aa663daefbd9ac373ad6e65d883f | ec5a7ae10c533e1b1f4b0bc7713e91ecf829a3eb | /ijcar16/examples/cc24.lean | 59b07449115206e2974dd25d7d5d463b0013d3ca | [
"MIT"
] | permissive | leanprover/leanprover.github.io | cf248934af7c7e9aeff17cf8df3c12c5e7e73f1a | 071a20d2e059a2c3733e004c681d3949cac3c07a | refs/heads/master | 1,692,621,047,417 | 1,691,396,994,000 | 1,691,396,994,000 | 19,366,263 | 18 | 27 | MIT | 1,693,989,071,000 | 1,399,006,345,000 | Lean | UTF-8 | Lean | false | false | 910 | lean | /-
Example/test file for the congruence closure procedure described in the paper:
"Congruence Closure for Intensional Type Theory"
Daniel Selsam and Leonardo de Moura
The tactic `by blast` has been configured in this file to use just
the congruence closure procedure using the command
set_option blast.strategy... |
70576d7d1fadc08a195e8a276c7afea6caeffe6c | 6df8d5ae3acf20ad0d7f0247d2cee1957ef96df1 | /ExamPractice/quiz1-prep.lean | f5450fa6a67109c92554632f1ea2b28f926e0e4b | [] | no_license | derekjohnsonva/CS2102 | 8ed45daa6658e6121bac0f6691eac6147d08246d | b3f507d4be824a2511838a1054d04fc9aef3304c | refs/heads/master | 1,648,529,162,527 | 1,578,851,859,000 | 1,578,851,859,000 | 233,433,207 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,061 | lean | /-
In lean we represent: (1) propositions as
types and (2) predicates as parameterized
propositions.
A parameterized type gives rise to a whole
family of proposition, once for each value
of each parameter.
We can think of one-parameter predicates
as specifying *properties* of objects. As
an example, as ... |
a21d72f07d4572fd7b3448761b3bc1018abc979b | 367134ba5a65885e863bdc4507601606690974c1 | /src/ring_theory/power_series/well_known.lean | a0dea7b020bd986716bff435560bfc34df9c1de6 | [
"Apache-2.0"
] | permissive | kodyvajjha/mathlib | 9bead00e90f68269a313f45f5561766cfd8d5cad | b98af5dd79e13a38d84438b850a2e8858ec21284 | refs/heads/master | 1,624,350,366,310 | 1,615,563,062,000 | 1,615,563,062,000 | 162,666,963 | 0 | 0 | Apache-2.0 | 1,545,367,651,000 | 1,545,367,651,000 | null | UTF-8 | Lean | false | false | 4,957 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Yury G. Kudryashov
-/
import ring_theory.power_series.basic
import data.nat.parity
import algebra.big_operators.nat_antidiagonal
/-!
# Definition of well-known power series
In thi... |
c862f6b55b0a890ef7af35cc600b1b4c1a70367e | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/combinatorics/derangements/basic.lean | 11dc621284ac57bdfe3596dd9f9947187f4351a4 | [
"Apache-2.0"
] | permissive | waynemunro/mathlib | e3fd4ff49f4cb43d4a8ded59d17be407bc5ee552 | 065a70810b5480d584033f7bbf8e0409480c2118 | refs/heads/master | 1,693,417,182,397 | 1,634,644,781,000 | 1,634,644,781,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,346 | lean | /-
Copyright (c) 2021 Henry Swanson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Henry Swanson
-/
import data.equiv.basic
import data.equiv.option
import dynamics.fixed_points.basic
import group_theory.perm.option
/-!
# Derangements on types
In this file we define... |
206179225bae44c964d5289d503338cbcb5e29ef | 9b9a16fa2cb737daee6b2785474678b6fa91d6d4 | /src/category_theory/types.lean | 7783a583e134694702d12785b504c0b5e7f7fea7 | [
"Apache-2.0"
] | permissive | johoelzl/mathlib | 253f46daa30b644d011e8e119025b01ad69735c4 | 592e3c7a2dfbd5826919b4605559d35d4d75938f | refs/heads/master | 1,625,657,216,488 | 1,551,374,946,000 | 1,551,374,946,000 | 98,915,829 | 0 | 0 | Apache-2.0 | 1,522,917,267,000 | 1,501,524,499,000 | Lean | UTF-8 | Lean | false | false | 3,110 | 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, Johannes Hölzl
import category_theory.functor_category
import category_theory.fully_faithful
namespace category_theory
universes v v' w u u' --... |
6108c745de2388451156acf26f5a2b3c2bfc8dcd | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /hott/logic.hlean | ad53a46b4e4daac1e93daa0f8525b07c554bc3d9 | [
"Apache-2.0"
] | permissive | soonhokong/lean-osx | 4a954262c780e404c1369d6c06516161d07fcb40 | 3670278342d2f4faa49d95b46d86642d7875b47c | refs/heads/master | 1,611,410,334,552 | 1,474,425,686,000 | 1,474,425,686,000 | 12,043,103 | 5 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 670 | hlean | /-
Copyright (c) Jakob von Raumer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jakob von Raumer
Logic lemmas we don't want/need in the prelude.
-/
import types.pi
open eq is_trunc decidable
theorem dif_pos {c : Type} [H : decidable c] [P : is_prop c] (Hc : c)
{... |
57d61a3a82a3e5d62eac865d01185f1a56dfc05d | 54deab7025df5d2df4573383df7e1e5497b7a2c2 | /data/set/finite.lean | d449d8d3abf0fb68f4b4537f90479263330ed213 | [
"Apache-2.0"
] | permissive | HGldJ1966/mathlib | f8daac93a5b4ae805cfb0ecebac21a9ce9469009 | c5c5b504b918a6c5e91e372ee29ed754b0513e85 | refs/heads/master | 1,611,340,395,683 | 1,503,040,489,000 | 1,503,040,489,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,526 | 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
Finite sets -- assuming a classical logic.
-/
import data.set.lattice data.nat.basic
noncomputable theory
universes u v w
variables {α : Type u} {β : Type v} {ι : Sort... |
177d0d328991dd3d1e3a9a2ac9e7ad8ee57e98e2 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/playground/patch.lean | 9a648bc9ba53e7959d91313330026d0a50c6e848 | [
"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 | 893 | lean | import init.lean.parser
import init.lean.parser.transform
open Lean
open Lean.Parser
def fixEqnSyntax (stx : Syntax) : Syntax :=
stx.rewriteBottomUp $ fun stx =>
stx.ifNodeKind `Lean.Parser.Term.equation3
(fun stx =>
let args := stx.getArgs;
let args := args.modify 1 $ fun patterns =>
let ... |
c9e4cfdfb894d3415f078ca68a550ebbb37f8628 | 680b0d1592ce164979dab866b232f6fa743f2cc8 | /hott/homotopy/circle.hlean | ab562546c7d77f33b6a3837e13bcd769ed6f3657 | [
"Apache-2.0"
] | permissive | syohex/lean | 657428ab520f8277fc18cf04bea2ad200dbae782 | 081ad1212b686780f3ff8a6d0e5f8a1d29a7d8bc | refs/heads/master | 1,611,274,838,635 | 1,452,668,188,000 | 1,452,668,188,000 | 49,562,028 | 0 | 0 | null | 1,452,675,604,000 | 1,452,675,602,000 | null | UTF-8 | Lean | false | false | 9,840 | hlean | /-
Copyright (c) 2015 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
Declaration of the circle
-/
import .sphere
import types.bool types.int.hott types.equiv
import algebra.homotopy_group algebra.hott
open eq susp bool sphere_index... |
9d924be81f7ce1bf4c453ae1391d9a74d58a7e7b | 969dbdfed67fda40a6f5a2b4f8c4a3c7dc01e0fb | /src/algebra/category/CommRing/basic.lean | ab4d4fb74305a0b327ffaa5adfbd6ce29bb196cd | [
"Apache-2.0"
] | permissive | SAAluthwela/mathlib | 62044349d72dd63983a8500214736aa7779634d3 | 83a4b8b990907291421de54a78988c024dc8a552 | refs/heads/master | 1,679,433,873,417 | 1,615,998,031,000 | 1,615,998,031,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,360 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Johannes Hölzl, Yury Kudryashov
-/
import algebra.category.Group.basic
import data.equiv.ring
/-!
# Category instances for semiring, ring, comm_semiring, and comm_ring... |
6484b40e7d04cccb04eebc823a1b7ecc2eb9b82b | 618003631150032a5676f229d13a079ac875ff77 | /src/category_theory/adjunction/limits.lean | ba744f9c1766ec87ad1c8718f9153cf07c0a4227 | [
"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 | 8,525 | lean | /-
Copyright (c) 2019 Reid Barton. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Reid Barton, Johan Commelin
-/
import category_theory.adjunction.basic
import category_theory.limits.creates
open opposite
namespace category_theory.adjunction
open category_theory
open... |
bfd65a20afc997e62e3df732b91ebab4af54594a | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/data/fin_enum.lean | fb5aac3f9226826d633f5969850452407be39f3c | [
"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,872 | lean | /-
Copyright (c) 2019 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
-/
import control.monad.basic
import data.fintype.basic
import data.list.prod_sigma
/-!
Type class for finitely enumerable types. The property is stronger
than `fintype` in t... |
2919121ccf336cf05a3a0954aa3a290b61a946ff | 4e3bf8e2b29061457a887ac8889e88fa5aa0e34c | /lean/love06_monads_exercise_solution.lean | fe5034a13743511bf88adc817762d962e723fe72 | [] | 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 | 7,157 | lean | /- LoVe Exercise 6: Monads -/
import .love06_monads_demo
namespace LoVe
/- Question 1: A State Monad with Failure -/
open LoVe.lawful_monad
/- We introduce a richer notion of lawful monad that provides an `orelse`
operator `<|>` satisfying some laws, given below. `emp` denotes failure.
`x <|> y` tries `x` first, ... |
dac8462d83482f0c7bb4d5c2f49eedd34ee2c631 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /test/qpf.lean | 3a5e5ff42bd16ecd8b8ae89cd96050dfb502b0ef | [
"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 | 6,205 | lean | import data.qpf.univariate.basic
import control.bifunctor
universes u
variables {F : Type u → Type u} [functor F]
namespace qpf
section box
variables (F)
/-- apply a functor to a set of values. taken from
[Basil Fürer, Andreas Lochbihler, Joshua Schneider, Dmitriy Traytel *Quotients of Bounded Natural Functors*][f... |
4d329d72b9596fe9c0c015008782e7b18dbb7580 | 6fca17f8d5025f89be1b2d9d15c9e0c4b4900cbf | /src/game/world5/level7.lean | a9068d63a3346083d8235cc2e5e80c0f16ea26aa | [
"Apache-2.0"
] | permissive | arolihas/natural_number_game | 4f0c93feefec93b8824b2b96adff8b702b8b43ce | 8e4f7b4b42888a3b77429f90cce16292bd288138 | refs/heads/master | 1,621,872,426,808 | 1,586,270,467,000 | 1,586,270,467,000 | 253,648,466 | 0 | 0 | null | 1,586,219,694,000 | 1,586,219,694,000 | null | UTF-8 | Lean | false | false | 791 | lean | /-
# Function world.
## Level 7: `(P → Q) → ((Q → F) → (P → F))`
Have you noticed that, in stark contrast to earlier worlds,
we are not amassing a large collection of useful theorems?
We really are just constructing abstract levels with sets and
functions, and then solving them and never using the results
ever aga... |
af0dcdbdc4e78eb008bcf79277ec8ec1a0480def | 968e2f50b755d3048175f176376eff7139e9df70 | /examples/prop_logic_theory/unnamed_1132.lean | a165f7467f583050c32e4adfabd773b0934e9c30 | [] | no_license | gihanmarasingha/mth1001_sphinx | 190a003269ba5e54717b448302a27ca26e31d491 | 05126586cbf5786e521be1ea2ef5b4ba3c44e74a | refs/heads/master | 1,672,913,933,677 | 1,604,516,583,000 | 1,604,516,583,000 | 309,245,750 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 291 | lean | variables p q r s t u : Prop
theorem and_assoc1 : (p ∧ q) ∧ r → p ∧ (q ∧ r) :=
λ h, ⟨h.1.1, h.1.2, h.2⟩
theorem and_of_and : p ∧ q → q ∧ p :=
λ h, ⟨h.2, h.1⟩
-- BEGIN
theorem and_assoc2 : s ∧ (t ∧ u) → (s ∧ t) ∧ u :=
begin
intro h,
sorry,
end
-- END |
1314991a4b931bfeefb424e8718834c17da5eeee | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/analysis/seminorm.lean | a9352fe084f2b7dabd376f0034c944032cfc9137 | [
"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 | 25,066 | lean | /-
Copyright (c) 2019 Jean Lo. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean Lo, Bhavik Mehta, Yaël Dillies
-/
import analysis.convex.function
import analysis.normed_space.ordered
import data.real.pointwise
import data.set.intervals
/-!
# Seminorms and Local Con... |
de770ba655761cbf066db212b008ab9b21ca0a41 | 0845ae2ca02071debcfd4ac24be871236c01784f | /library/init/control/lift.lean | 22ae392579054235a86aa0d0d8bb52cf85efd77a | [
"Apache-2.0"
] | permissive | GaloisInc/lean4 | 74c267eb0e900bfaa23df8de86039483ecbd60b7 | 228ddd5fdcd98dd4e9c009f425284e86917938aa | refs/heads/master | 1,643,131,356,301 | 1,562,715,572,000 | 1,562,715,572,000 | 192,390,898 | 0 | 0 | null | 1,560,792,750,000 | 1,560,792,749,000 | null | UTF-8 | Lean | false | false | 4,564 | lean | /-
Copyright (c) 2016 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner, Sebastian Ullrich
Classy functions for lifting monadic actions of different shapes.
This theory is roughly modeled after the Haskell 'layers' package https://hackage.ha... |
ed83bf8e612087566dfb7b54ec087eab752786d9 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/topology/algebra/uniform_ring.lean | 1973e3a5a24f070ab7b47c77abb2080db39e8fe4 | [
"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 | 8,522 | lean | /-
Copyright (c) 2018 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Johannes Hölzl
-/
import topology.algebra.group_completion
import topology.algebra.ring
/-!
# Completion of topological rings:
This files endows the completion of a t... |
255ee8f87b95b63df784b65669d68ec474945f8a | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/kernel_fin_rfl.lean | a43c7e014e2eb5d64e1bb78e3686bb04cb7ddc9a | [
"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 | 184 | lean | example : (1 : fin 2) = (3 : fin 2) := rfl
example : (3/2 : fin 2) = (0 : fin 2) := rfl
example : (1 + 1 + 1 * 1 : fin 2) = (1 : fin 2) := rfl
example : fin.succ 0 = (1 : fin 2) := rfl |
c94cf44feecbb38f732556ca4a11d984d60ff699 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/category_theory/preadditive/schur.lean | e37533d9f1990742ea61ef2e9274965942d8108e | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 7,935 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel, Scott Morrison
-/
import algebra.group.ext
import category_theory.simple
import category_theory.linear
import category_theory.endomorphism
import algebra.algebra.spectru... |
c755b42e82f4f2aba0abf57a3474274e02366c99 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/analysis/special_functions/gaussian.lean | 870e4675fdd233deb2a74c96160c4631ba47b99f | [
"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 | 10,599 | lean | /-
Copyright (c) 2022 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import analysis.special_functions.gamma
import analysis.special_functions.polar_coord
/-!
# Gaussian integral
We prove the formula `∫ x, exp (-b * x^2) = sqrt... |
644a2065dfc004314afc58d28f650b58ea5f21ef | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/data/padics/padic_norm.lean | 1a2e5fadf97e40f18b8cc4b8149f683e5e11e698 | [
"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 | 24,087 | 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 algebra.gcd_domain
import algebra.field_power
import ring_theory.multiplicity
import data.real.cau_seq
import tactic.ring_exp
import tactic.basic
/-!
# p-ad... |
2b2a9119808de11b3fa0e8875b9c5c640d32b8f7 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/fin/tuple/basic.lean | e9509b715fdcad38f567f72278127eea687d7f55 | [
"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 | 34,845 | lean | /-
Copyright (c) 2019 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Yury Kudryashov, Sébastien Gouëzel, Chris Hughes
-/
import data.fin.basic
import data.pi.lex
import data.set.intervals.basic
/-!
# Operation on tuples
> THIS FILE... |
72742ed7b38cf53c621c573317af0d206318818e | 94e33a31faa76775069b071adea97e86e218a8ee | /src/algebra/hom/ring.lean | 5836a68f5f82fe4ed0a9c0ce583ce2110eceec40 | [
"Apache-2.0"
] | permissive | urkud/mathlib | eab80095e1b9f1513bfb7f25b4fa82fa4fd02989 | 6379d39e6b5b279df9715f8011369a301b634e41 | refs/heads/master | 1,658,425,342,662 | 1,658,078,703,000 | 1,658,078,703,000 | 186,910,338 | 0 | 0 | Apache-2.0 | 1,568,512,083,000 | 1,557,958,709,000 | Lean | UTF-8 | Lean | false | false | 21,675 | lean | /-
Copyright (c) 2019 Amelia Livingston. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Amelia Livingston, Jireh Loreaux
-/
import algebra.ring.basic
/-!
# Homomorphisms of semirings and rings
This file defines bundled homomorphisms of (non-unital) semirings and ring... |
9731258495d5e15b10a5356d269e0f38fd27198e | b70031c8e2c5337b91d7e70f1e0c5f528f7b0e77 | /src/ring_theory/polynomial/basic.lean | 6a7ae4581d2ddb01e9651e0ce9063911a0e1d4da | [
"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 | 31,651 | lean | /-
Copyright (c) 2019 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
# Ring-theoretic supplement of data.polynomial.
## Main results
* `mv_polynomial.integral_domain`:
If a ring is an integral domain, then so is its polynomial ring over finitel... |
db66be77d3944b1ca37b9174261357419453c966 | 437dc96105f48409c3981d46fb48e57c9ac3a3e4 | /src/tactic/core.lean | 41a97ecf6f1948b7bdb84e498eda40c394c0dbbc | [
"Apache-2.0"
] | permissive | dan-c-k/mathlib | 08efec79bd7481ee6da9cc44c24a653bff4fbe0d | 96efc220f6225bc7a5ed8349900391a33a38cc56 | refs/heads/master | 1,658,082,847,093 | 1,589,013,201,000 | 1,589,013,201,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 82,980 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Simon Hudon, Scott Morrison, Keeley Hoek
-/
import data.dlist.basic
import control.basic
import meta.expr
import meta.rb_map
import data.bool
import tactic.lean_core_do... |
2a1027d590377c1e7c83022cee2fdd165f6a97e0 | 618003631150032a5676f229d13a079ac875ff77 | /src/data/fin.lean | 501d5022220f52828eaf8a15a1eeec19cfb03d9c | [
"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 | 29,891 | lean | /-
Copyright (c) 2017 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis, Keeley Hoek
-/
import data.nat.cast
/-!
# The finite type with `n` elements
`fin n` is the type whose elements are natural numbers smaller than `n`.
This file expand... |
a8fb855d9eafe68d0c2d19f2d56c498d68ef7522 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/combinatorics/quiver/covering.lean | 18c98970d2cfde27223dc1b914d733d9864b3e57 | [
"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 | 11,039 | lean | /-
Copyright (c) 2022 Antoine Labelle, Rémi Bottinelli. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Antoine Labelle, Rémi Bottinelli
-/
import combinatorics.quiver.cast
import combinatorics.quiver.symmetric
import data.sigma.basic
import logic.equiv.basic
/-!
# Cov... |
6140fcbfec5c6e8be9af429c2782b37adde81c6b | efa51dd2edbbbbd6c34bd0ce436415eb405832e7 | /20161026_ICTAC_Tutorial/ex0.lean | 94081909e9ef89c961425781e235507946c697ca | [
"Apache-2.0"
] | permissive | leanprover/presentations | dd031a05bcb12c8855676c77e52ed84246bd889a | 3ce2d132d299409f1de269fa8e95afa1333d644e | refs/heads/master | 1,688,703,388,796 | 1,686,838,383,000 | 1,687,465,742,000 | 29,750,158 | 12 | 9 | Apache-2.0 | 1,540,211,670,000 | 1,422,042,683,000 | Lean | UTF-8 | Lean | false | false | 915 | lean | /- Goals:
- If you can program, then you can also prove
* If you like to build things (programs, castles in minecraft, etc),
you will like it.
* I meet all the time with amazing kids that know how to program,
but don't know how to prove.
- Definitions are important
* sqrt(-4)*sqrt(-9) -6 a... |
3b14af9475fa057460e74833e5ff5862785319da | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Meta/Check.lean | 925a3de957769eec127546fd177c9fbffa714b9e | [
"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 | 7,228 | 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.InferType
/-!
This is not the Kernel type checker, but an auxiliary method for checking
whether terms produced by tactics and `isDefEq` ar... |
bf3bf6532720bdc32659fa46b429c103209899c1 | 1abd1ed12aa68b375cdef28959f39531c6e95b84 | /src/ring_theory/euclidean_domain.lean | 718cd36254491ef8610705470c6065df73bd67ce | [
"Apache-2.0"
] | permissive | jumpy4/mathlib | d3829e75173012833e9f15ac16e481e17596de0f | af36f1a35f279f0e5b3c2a77647c6bf2cfd51a13 | refs/heads/master | 1,693,508,842,818 | 1,636,203,271,000 | 1,636,203,271,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,537 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Chris Hughes
-/
import ring_theory.coprime.basic
import ring_theory.ideal.basic
/-!
# Lemmas about Euclidean domains
Various about Euclidean domains are proved; all o... |
eea09c3c2e7ad9e761954064cb256c0486cc886a | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/algebra/category/Group/basic.lean | 6f991d9d9be72d5d07a9c9a1734d52e290911d8e | [
"Apache-2.0"
] | permissive | Lix0120/mathlib | 0020745240315ed0e517cbf32e738d8f9811dd80 | e14c37827456fc6707f31b4d1d16f1f3a3205e91 | refs/heads/master | 1,673,102,855,024 | 1,604,151,044,000 | 1,604,151,044,000 | 308,930,245 | 0 | 0 | Apache-2.0 | 1,604,164,710,000 | 1,604,163,547,000 | null | UTF-8 | Lean | false | false | 9,440 | lean | /-
Copyright (c) 2018 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import algebra.category.Mon.basic
import category_theory.endomorphism
/-!
# Category instances for group, add_group, comm_group, and add_comm_group.
We introduce th... |
514763e2117e8b7e3617e9c511d96d290cc22861 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/logic/equiv/local_equiv.lean | b4f82a730592d0d8b791efad5e8c766526df39ac | [
"Apache-2.0"
] | permissive | urkud/mathlib | eab80095e1b9f1513bfb7f25b4fa82fa4fd02989 | 6379d39e6b5b279df9715f8011369a301b634e41 | refs/heads/master | 1,658,425,342,662 | 1,658,078,703,000 | 1,658,078,703,000 | 186,910,338 | 0 | 0 | Apache-2.0 | 1,568,512,083,000 | 1,557,958,709,000 | Lean | UTF-8 | Lean | false | false | 35,402 | 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 data.set.function
import logic.equiv.basic
/-!
# Local equivalences
This files defines equivalences between subsets of given types.
An element `e` of `... |
43e3dd56c588e92c0c46adb3750bf2f8b5a22119 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/data/pnat/xgcd.lean | 427eb4dc8946f60d6f7aefa049b5682a5eb2ef05 | [
"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,369 | lean | /-
Copyright (c) 2019 Neil Strickland. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Neil Strickland
This file sets up a version of the Euclidean algorithm that works
only with natural numbers. Given a, b > 0, it computes the unique
system (w, x, y, z, d) such that ... |
0d3d7b18332ad05847fb2b4b664f18421a1133ec | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/tactic/ext.lean | 59b9c68e4c7dbe181a265af9d746daa1806e936a | [
"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 | 20,012 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon, Jesse Michael Han
-/
import tactic.rcases
import data.sum
import logic.function.basic
universes u₁ u₂
open interactive interactive.types
section ext
open lean.parser nat ta... |
d865468027fdcddb31fb628a72336e64fa0f6cda | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/data/pnat/basic.lean | c44d35d73d8930480949fd977b18b88946bde2af | [
"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 | 13,123 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro, Neil Strickland
-/
import tactic.basic
import data.nat.basic data.nat.prime algebra.group_power
/-- `ℕ+` is the type of positive natural numbers. It is defined ... |
d8820b79ba7fb8da2d5023340e286ddf48d02e5a | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/category_theory/linear/functor_category.lean | cace39f145bce5ead9cf42f91c04bdad53b50671 | [
"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 | 1,668 | lean | /-
Copyright (c) 2022 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.preadditive.functor_category
import category_theory.linear.basic
/-!
# Linear structure on functor categories
If `C` and `D` are categories a... |
2d89fa15dea5f5ac2e089c14d5e44b336f68693a | ad0c7d243dc1bd563419e2767ed42fb323d7beea | /data/real/ennreal.lean | 8686f835121e3ec1960ae811dd5c3c8d86356ef5 | [
"Apache-2.0"
] | permissive | sebzim4500/mathlib | e0b5a63b1655f910dee30badf09bd7e191d3cf30 | 6997cafbd3a7325af5cb318561768c316ceb7757 | refs/heads/master | 1,585,549,958,618 | 1,538,221,723,000 | 1,538,221,723,000 | 150,869,076 | 0 | 0 | Apache-2.0 | 1,538,229,323,000 | 1,538,229,323,000 | null | UTF-8 | Lean | false | false | 14,790 | 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
Extended non-negative reals
-/
import data.real.nnreal order.bounds
noncomputable theory
open classical set lattice
local attribute [instance] prop_decidable
variables ... |
291a213d80deb76672b237ba7865081e29ec8cf3 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/data/equiv/basic.lean | 51779993c34399608879e8909fad6439aa7eb06e | [
"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 | 51,588 | 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, Mario Carneiro
In the standard library we cannot assume the univalence axiom.
We say two types are equivalent if they are isomorphic.
Two equivalent types h... |
8b0d2ec4980dcc8f5b4a5b474feedc666be5be29 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/nat_bug4.lean | d4c13a6c6bc455b013b839d0db028be7f7f6a43c | [
"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 | 496 | lean |
namespace experiment
inductive nat : Type
| zero : nat
| succ : nat → nat
namespace nat
definition add (x y : nat) : nat := nat.rec x (λn r, succ r) y
infixl (name := add) `+` := add
definition mul (n m : nat) : nat := nat.rec zero (fun m x, x + n) m
infixl (name := mul) `*` := mul
axiom mul_succ_right (n m : nat) : ... |
fa1073668c632cb944c97a4f4da7db8e61a68c3f | 7565ffb53cc64430691ce89265da0f944ee43051 | /hott/types/fiber.hlean | 0cf58c3405a70de8bd02a52d8aaf2c5c30e3aa17 | [
"Apache-2.0"
] | permissive | EgbertRijke/lean2 | cacddba3d150f8b38688e044960a208bf851f90e | 519dcee739fbca5a4ab77d66db7652097b4604cd | refs/heads/master | 1,606,936,954,854 | 1,498,836,083,000 | 1,498,910,882,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 14,705 | hlean | /-
Copyright (c) 2015 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Mike Shulman
Ported from Coq HoTT
Theorems about fibers
-/
import .sigma .eq .pi cubical.squareover .pointed .eq
open equiv sigma sigma.ops eq pi pointed
structu... |
35d3b12a59a5fb141783c4fc311d435e5ae671ec | ae1e94c332e17c7dc7051ce976d5a9eebe7ab8a5 | /stage0/src/Lean/Elab/Tactic/ElabTerm.lean | f6080f6dfe0e85d1ca82054034c62d952b685699 | [
"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 | 5,370 | 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.CollectMVars
import Lean.Meta.Tactic.Apply
import Lean.Meta.Tactic.Constructor
import Lean.Meta.Tactic.Assert
import Lean.Elab.Tactic.Basic... |
5bf1e5525ee4ba529b03b1008174454b806bc58b | 7f15a2b0775be8a2fcb4936c6b0f127f683c4666 | /library/init/core.lean | 7cf3b1ce38d8b4746469b253eba913821b2f763c | [
"Apache-2.0"
] | permissive | mwillsey/lean | 0b90b5016a3158490d7c9cf8b836e8fe7bb3df81 | 8621be63353b299b0da9106f4e7c8ca5e271941d | refs/heads/master | 1,630,587,469,685 | 1,514,924,859,000 | 1,514,925,180,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 17,309 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
notation, basic datatypes and type classes
-/
prelude
notation `Prop` := Sort 0
notation f ` $ `:1 a:0 := f a
/- Logical operations and relations -/
reserv... |
34b0eb109a3e85bbf0659c543b72cc79b23f7681 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/trace_call_stack_segfault.lean | a8eae4e5b64ca82cdf4f847173f1db780d630329 | [
"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 | 38 | lean | open tactic
run_cmd trace_call_stack
|
f5d40e2fa4013264f391beb11da6e18d1fc2ba65 | 367134ba5a65885e863bdc4507601606690974c1 | /src/category_theory/monoidal/types.lean | 13c86c41d67f384f35d893d245d1f9e0a38edaf3 | [
"Apache-2.0"
] | permissive | kodyvajjha/mathlib | 9bead00e90f68269a313f45f5561766cfd8d5cad | b98af5dd79e13a38d84438b850a2e8858ec21284 | refs/heads/master | 1,624,350,366,310 | 1,615,563,062,000 | 1,615,563,062,000 | 162,666,963 | 0 | 0 | Apache-2.0 | 1,545,367,651,000 | 1,545,367,651,000 | null | UTF-8 | Lean | false | false | 2,124 | lean | /-
Copyright (c) 2018 Michael Jendrusch. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Michael Jendrusch, Scott Morrison
-/
import category_theory.monoidal.of_chosen_finite_products
import category_theory.limits.shapes.finite_products
import category_theory.limits.sha... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.