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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1e80eb131512ab4e06cb2f24ff34e2ada6265854 | 947b78d97130d56365ae2ec264df196ce769371a | /tests/compiler/t2.lean | f40523bb4501e910475e1495f0b19160e02ba318 | [
"Apache-2.0"
] | permissive | shyamalschandra/lean4 | 27044812be8698f0c79147615b1d5090b9f4b037 | 6e7a883b21eaf62831e8111b251dc9b18f40e604 | refs/heads/master | 1,671,417,126,371 | 1,601,859,995,000 | 1,601,860,020,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,904 | lean | /- Benchmark for new code generator -/
inductive Expr
| Val : Int → Expr
| Var : String → Expr
| Add : Expr → Expr → Expr
| Mul : Expr → Expr → Expr
| Pow : Expr → Expr → Expr
| Ln : Expr → Expr
open Expr
partial def pown : Int → Int → Int
| a, 0 => 1
| a, 1 => a
| a, n =>
let b := pown a (n / 2);
b * b * (if n ... |
5ae1b0df031ac4316ea022d5e681f0ca19323bd3 | 2db1ce6c94a38d8841bb6750a4f6bdc89543179b | /lean/love01_definitions_and_lemma_statements_exercise_sheet.lean | e37fe4ba83d1031087bedb3ff224b6ce32de4bb8 | [] | no_license | robertylewis/logical_verification_2019 | 4ab72673234c7d74c21cf2e185714d96e09f633d | 7c5f1c90f6e5a0b221a02c8fa4e36c0c66393036 | refs/heads/master | 1,647,940,325,589 | 1,576,503,096,000 | 1,576,503,096,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,944 | lean | /- LoVe Exercise 1: Definitions and Lemma Statements -/
/- Replace the placeholders (e.g., `:= sorry`) with your solutions. -/
import .love01_definitions_and_lemma_statements_demo
namespace LoVe
/- Question 1: Fibonacci Numbers -/
/- 1.1. Define the function `fib` that computes the Fibonacci numbers. -/
def fib ... |
4ee45a80a07f98ea99849a8725cf242f397c3b15 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/number_theory/number_field.lean | 7d73c1a9b9b9fcafa4c6321eb75621e915c73a1c | [
"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 | 9,783 | lean | /-
Copyright (c) 2021 Ashvni Narayanan. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Ashvni Narayanan, Anne Baanen
-/
import ring_theory.dedekind_domain.integral_closure
import algebra.char_p.algebra
/-!
# Number fields
This file defines a number field, the ring of... |
c1d82c230a8c9b462a7da50362fb4e09abe69789 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/analysis/inner_product_space/lax_milgram.lean | 15c7b647b2708c8ad942b8e79e8d419ad08356aa | [
"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,623 | lean | /-
Copyright (c) 2022 Daniel Roca González. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Daniel Roca González
-/
import analysis.inner_product_space.projection
import analysis.inner_product_space.dual
import analysis.normed_space.banach
import analysis.normed_space.o... |
2e0deda68f3f90a9927f34de3c4d733f5a1f417e | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/data/int/cast.lean | 9ce2fa63608f501d28f3e03f8f2ad09bc39a5d33 | [
"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 | 11,632 | 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 data.int.basic
import data.nat.cast
/-!
# Cast of integers
This file defines the *canonical* homomorphism from the integers into a type `α` with `0`,
`1`, `+... |
de912b8f7458e591e0dcdbdb37792836bb1d9e45 | f20db13587f4dd28a4b1fbd31953afd491691fa0 | /library/init/meta/interaction_monad.lean | 14c22188692812d558e91e324920bdde8f46a4e6 | [
"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 | 4,433 | 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, Sebastian Ullrich
-/
prelude
import init.function init.data.option.basic init.util
import init.category.combinators init.category.monad init.category.alternat... |
433aca5807910429e4ee3734ced53d2e176e5ce9 | efa51dd2edbbbbd6c34bd0ce436415eb405832e7 | /20170116_POPL/backchain/back_trace.lean | 71bd0527a4db723c645efc5021660d0e7df06ab4 | [
"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 | 4,001 | lean | /- In this example, we demonstrate how to add tracing to
the tactic implemented in the file back.lean.
We also use quotations to build terms. -/
open list expr tactic
universe variable u
/- We change the implicit arguments of in_tail and in_head.
The goal is to allow us to create in_tail and in_head applica... |
364ddeccdad0eb5ea0d10e7c289e3a2c36bf7ed4 | 94096349332b0a0e223a22a3917c8f253cd39235 | /src/game/world4/level6.lean | 04c305cf141f9bb4205a7e35d24563e47d4a82b5 | [] | no_license | robertylewis/natural_number_game | 26156e10ef7b45248549915cc4d1ab3d8c3afc85 | b210c05cd627242f791db1ee3f365ee7829674c9 | refs/heads/master | 1,598,964,725,038 | 1,572,602,236,000 | 1,572,602,236,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 750 | lean | import game.world4.level5 -- hide
namespace mynat -- hide
/-
# World 4 : Power World
## Level 6: `mul_pow`
You might find `mul_right_comm` useful in this one. This is proved
in 3-13, but it should be in the basic world. When the big reordering
comes in v1.1 this will be in the right place.
Remember `rw mul_right_c... |
44b0ebdf50721f2bdab0bab35921051b63012257 | 7c4610454cf55b49f0c3cdaeb6b856eb3249cb2d | /src/set_lemmas.lean | 211d17588b9316be2eb6d726b7bf283cdad152ec | [] | no_license | 101damnations/fg_over_pid | 097be43e11c3680a3fd4b6de2265de393cf4d4ef | a1a587c455a54a802f6ff61b07bb033701e451a7 | refs/heads/master | 1,669,708,904,636 | 1,597,259,770,000 | 1,597,259,770,000 | 287,097,363 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 13,655 | lean | import data.set.basic data.set.lattice data.finset ring_theory.principal_ideal_domain
variables {R : Type*} {M : Type*} [integral_domain R]
[is_principal_ideal_ring R] [add_comm_group M] [module R M] {A : submodule R M}
open_locale classical
theorem not_mem_diff_singleton {α : Type*} {s : set α} {x : α} : x ∉ s \ {x... |
26a4c1df6e8eefe86910c7bb3820d45b31f4676b | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/data/nat/sqrt.lean | 424f926b10e5bcac3648dd0bab07dc8f07d1cd45 | [
"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 | 9,608 | 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, Johannes Hölzl, Mario Carneiro
-/
import data.int.basic
/-!
# Square root of natural numbers
This file defines an efficient binary implementation of the squ... |
af9691e2f9d19bbac1917047425191795a06adae | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/data/pnat/basic.lean | 9b3eae7fb90af7f98828519ecd1332100e1e9ca0 | [
"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 | 15,091 | 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 algebra.group_power.basic
import data.nat.basic
/-!
# The positive natural numbers
This file defines the type `ℕ+` or `pnat`, the sub... |
d6d97309a1f273d2c4d351b8e50431a5be8da52a | 82b86ba2ae0d5aed0f01f49c46db5afec0eb2bd7 | /stage0/src/Lean/ParserCompiler/Attribute.lean | d9c05073edb381f172eb040b04d4f1bd8c96f8ef | [
"Apache-2.0"
] | permissive | banksonian/lean4 | 3a2e6b0f1eb63aa56ff95b8d07b2f851072d54dc | 78da6b3aa2840693eea354a41e89fc5b212a5011 | refs/heads/master | 1,673,703,624,165 | 1,605,123,551,000 | 1,605,123,551,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,164 | lean | /-
Copyright (c) 2020 Sebastian Ullrich. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Sebastian Ullrich
-/
import Lean.Attributes
import Lean.Compiler.InitAttr
import Lean.ToExpr
namespace Lean
namespace ParserCompiler
structure CombinatorAttrib... |
3f73909a3a4b38c90161206a6d4638bc460d655d | 271e26e338b0c14544a889c31c30b39c989f2e0f | /src/Init/Lean/Util/Trace.lean | f08ed718c56a2c9ccd766d10904a01b061409a45 | [
"Apache-2.0"
] | permissive | dgorokho/lean4 | 805f99b0b60c545b64ac34ab8237a8504f89d7d4 | e949a052bad59b1c7b54a82d24d516a656487d8a | refs/heads/master | 1,607,061,363,851 | 1,578,006,086,000 | 1,578,006,086,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,240 | lean | /-
Copyright (c) 2018 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich, Leonardo de Moura
-/
prelude
import Init.Lean.Util.Message
universe u
namespace Lean
class MonadTracer (m : Type → Type u) :=
(traceCtx {α} : Name → m α → m... |
c1ebc0b697714a3ce7a0d1b9a1a40c15c312ea38 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/analysis/locally_convex/balanced_core_hull.lean | 7d363ef2594ed655fbf324d6de7bede17194267d | [
"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 | 9,631 | lean | /-
Copyright (c) 2022 Moritz Doll. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Moritz Doll
-/
import analysis.locally_convex.basic
/-!
# Balanced Core and Balanced Hull
## Main definitions
* `balanced_core`: The largest balanced subset of a set `s`.
* `balanced_h... |
95f5142528e2ca8b42a073ad13b1ae0d3d628d00 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/group_theory/group_action/units.lean | 6f2510b3c19bcf10d2b8b3b85fa74da24b193055 | [
"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 | 4,543 | 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... |
c2ff610c6a281aaf9b6ae62424c018c3a41ea3af | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/testing/slim_check/sampleable.lean | e107d38b314f0dac9294a1aea11c9e8b8d6a259d | [
"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 | 21,708 | lean | /-
Copyright (c) 2020 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Simon Hudon
-/
import data.lazy_list.basic
import data.tree
import tactic.linarith
import testing.slim_check.gen
/-!
# `sampleable` Class
This class permits the creation samples of a ... |
b252a08a959105c6743b2b80df3ab7b48aaf723c | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch2/ex0906.lean | 6a290b4c7a1193cb8f749e9a91b74d554987d014 | [] | 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 | 183 | lean | universe u
section
variable {α : Type u}
variable x : α
def ident := x
end
variables α β : Type u
variables (a : α) (b : β)
#check ident
#check ident a
#check ident b
|
02e58594cd599f219615cfe85936ac2dced2b659 | bb31430994044506fa42fd667e2d556327e18dfe | /src/topology/metric_space/equicontinuity.lean | f0b61162702b80a6741aa94a12ce3f90c161a30a | [
"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 | 5,846 | lean | /-
Copyright (c) 2022 Anatole Dedecker. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anatole Dedecker
-/
import topology.metric_space.basic
import topology.uniform_space.equicontinuity
/-!
# Equicontinuity in metric spaces
This files contains various facts about (u... |
6f4cab40d4db100be56f77cd6afee7bcded4c867 | cf798a5faaa43a993adcc42d1a99d5eab647e00b | /Hoare.lean | 1bb79e08c98e70294f831784fbcb316e8f7ac47c | [] | no_license | myuon/lean-software-foundations | dbbcd37e3552b58c6e139370b16b25c69a42799b | a1a08810f2664493c920742c2d66a3131fb3ae75 | refs/heads/master | 1,610,261,785,986 | 1,459,922,839,000 | 1,459,922,839,000 | 50,269,716 | 4 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 8,420 | lean | import Imp
open eq.ops nat bool
open Idn Idn.ident Idn.aexp Idn.bexp Idn.com Idn.ceval
definition Assertion := states → Prop
-- Exercise: 1 star, optional (assertions)
definition as1 : Assertion := λst, st X = 3
definition as2 : Assertion := λst, st X ≤ st Y
definition as3 : Assertion := λst, st X = 3 ∨ st X ≤ st Y
d... |
a403b6aed5e96e07823d6a787b4169c3da78fe40 | a2ee6a66690e8da666951cac0c243d42db11f9f3 | /src/linear_algebra/dual.lean | f653c7b75c1db73f2feac93cec46e63d7ba5e706 | [
"Apache-2.0"
] | permissive | shyamalschandra/mathlib | 6d414d7c334bf383e764336843f065bd14c44273 | ca679acad147870b2c5087d90fe3550f107dea49 | refs/heads/master | 1,671,730,354,335 | 1,601,883,576,000 | 1,601,883,576,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 12,472 | lean | /-
Copyright (c) 2019 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Fabian Glöckle
-/
import linear_algebra.finite_dimensional
import tactic.apply_fun
noncomputable theory
/-!
# Dual vector spaces
The dual space of an R-module M is th... |
97d1784a803711304ef8645bf08e7cbc9061d990 | 4b846d8dabdc64e7ea03552bad8f7fa74763fc67 | /library/init/meta/relation_tactics.lean | 3e70cbbd2e1e5a44c0d9c16b62e189d88e85c1eb | [
"Apache-2.0"
] | permissive | pacchiano/lean | 9324b33f3ac3b5c5647285160f9f6ea8d0d767dc | fdadada3a970377a6df8afcd629a6f2eab6e84e8 | refs/heads/master | 1,611,357,380,399 | 1,489,870,101,000 | 1,489,870,101,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,855 | 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.function
namespace tactic
open expr
private meta def relation_tactic (md : transparency) (op_for : environment → name... |
6b9f719c6031eda47b29b5f8973eec007cc108fe | 9c1ad797ec8a5eddb37d34806c543602d9a6bf70 | /monoidal_categories/braided_monoidal_functor.lean | c985ef46db51a4d73ef3ee977745e3b5c9516807 | [] | no_license | timjb/lean-category-theory | 816eefc3a0582c22c05f4ee1c57ed04e57c0982f | 12916cce261d08bb8740bc85e0175b75fb2a60f4 | refs/heads/master | 1,611,078,926,765 | 1,492,080,000,000 | 1,492,080,000,000 | 88,348,246 | 0 | 0 | null | 1,492,262,499,000 | 1,492,262,498,000 | null | UTF-8 | Lean | false | false | 364 | 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 .braided_monoidal_category
namespace tqft.categories.braided_monoidal_functor
open tqft.categories.braided_monoidal_category
-- PROJECT
... |
7fb608d761bb23bc21462437938741c921c69903 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/computability/reduce.lean | 513b16f0280b172bea05f4e397edd3411d181e88 | [
"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 | 18,447 | lean | /-
Copyright (c) 2019 Minchao Wu. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Minchao Wu, Mario Carneiro
-/
import computability.halting
/-!
# Strong reducibility and degrees.
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a correspo... |
608b92821dcd646e01256aeefccf9b2c50896060 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/topology/metric_space/basic.lean | 65becce68297df4ca469f4e1c08c28aa4076f2f4 | [
"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 | 76,816 | lean | /-
Copyright (c) 2015, 2017 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Metric spaces.
Authors: Jeremy Avigad, Robert Y. Lewis, Johannes Hölzl, Mario Carneiro, Sébastien Gouëzel
Many definitions and theorems expected on metric spaces are already introduced o... |
3b2be42a058fee1595b838c66bddbe394282ff8b | 6094e25ea0b7699e642463b48e51b2ead6ddc23f | /library/algebra/order.lean | 33cd557dcf7a560d6cb09983785a3740d96ff195 | [
"Apache-2.0"
] | permissive | gbaz/lean | a7835c4e3006fbbb079e8f8ffe18aacc45adebfb | a501c308be3acaa50a2c0610ce2e0d71becf8032 | refs/heads/master | 1,611,198,791,433 | 1,451,339,111,000 | 1,451,339,111,000 | 48,713,797 | 0 | 0 | null | 1,451,338,939,000 | 1,451,338,939,000 | null | UTF-8 | Lean | false | false | 16,585 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad
Weak orders "≤", strict orders "<", and structures that include both.
-/
import logic.eq logic.connectives algebra.binary algebra.priority
open eq eq.ops
variable {A : Ty... |
1c0da44f1c28ccbaf656f4ba6cd9b0e06f2f4f59 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/tactic/dec_trivial.lean | c7561930b6953f434cef520eee3d0f90b351c610 | [] | 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 | 930 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.tactic.interactive
import Mathlib.PostPort
namespace Mathlib
/-!
# `dec_trivial` tactic
... |
cbc3a7bbab7580c0fa7b63dab8b44c8fe5c34116 | dd4e652c749fea9ac77e404005cb3470e5f75469 | /src/missing_mathlib/set_theory/cardinal.lean | 736cbacef0693264a85a0917cdc80d00dd53ba8d | [] | no_license | skbaek/cvx | e32822ad5943541539966a37dee162b0a5495f55 | c50c790c9116f9fac8dfe742903a62bdd7292c15 | refs/heads/master | 1,623,803,010,339 | 1,618,058,958,000 | 1,618,058,958,000 | 176,293,135 | 3 | 2 | null | null | null | null | UTF-8 | Lean | false | false | 888 | lean | import set_theory.cardinal
open function lattice set
local attribute [instance] classical.prop_decidable
universes u v w x
variables {α β : Type u}
namespace cardinal
lemma mk_zero_iff_empty_set (s : set α) : cardinal.mk s = 0 ↔ s = ∅ :=
not_iff_not.1 (ne_zero_iff_nonempty.trans coe_nonempty_iff_ne_empty)
lemma na... |
4179ca6b5dbfbf43d414f2b3f436240809020c55 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/run/record8.lean | 1c7798abd7cba1054ae4e0c033a4bfa3471dc1f0 | [
"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 | 43 | lean | record point :=
(x y : nat)
check point.x
|
747a056ff8f0f8dcc4690f9290877123f7bef595 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/combinatorics/composition.lean | dea3e3e37fddba547163a1e7663c144bb550a45f | [
"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 | 36,445 | lean | /-
Copyright (c) 2020 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import data.fintype.card
import data.finset.sort
import algebra.big_operators.order
/-!
# Compositions
A composition of a natural number `n` is a decompositio... |
dd7eaaf90a994c47e21e6f57ccfa9890c42208cb | 7c2dd01406c42053207061adb11703dc7ce0b5e5 | /src/solutions/08_limits_negation.lean | bbe601650fd268a8c9e2f16befa61466b3127cd4 | [
"Apache-2.0"
] | permissive | leanprover-community/tutorials | 50ec79564cbf2ad1afd1ac43d8ee3c592c2883a8 | 79a6872a755c4ae0c2aca57e1adfdac38b1d8bb1 | refs/heads/master | 1,687,466,144,386 | 1,672,061,276,000 | 1,672,061,276,000 | 189,169,918 | 186 | 81 | Apache-2.0 | 1,686,350,300,000 | 1,559,113,678,000 | Lean | UTF-8 | Lean | false | false | 5,079 | 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... |
1967fb1c6ea71f42e35a9cba8d335fbf35396d94 | f1b175e38ffc5cc1c7c5551a72d0dbaf70786f83 | /data/list/basic.lean | 51ef8a6e9ce9e3bf1030c4c0510001383a0f6e6f | [
"Apache-2.0"
] | permissive | mjendrusch/mathlib | df3ae884dd5ce38c7edf452bcbfd3baf4e3a6214 | 5c209edb7eb616a26f64efe3500f2b1ba95b8d55 | refs/heads/master | 1,585,663,284,800 | 1,539,062,055,000 | 1,539,062,055,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 177,985 | lean | /-
Copyright (c) 2014 Parikshit Khanna. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Parikshit Khanna, Jeremy Avigad, Leonardo de Moura, Floris van Doorn, Mario Carneiro
Basic properties of lists.
-/
import
tactic.interactive tactic.mk_iff_of_inductive_prop tactic... |
923f2a824ca2631fa46e805d599300a92b1fa053 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/algebra/group/with_one.lean | dd29e4aaa1a97cebb3f3913f794f87fb4153d11a | [
"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,587 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Johan Commelin
-/
import algebra.ring.basic
import data.equiv.basic
/-!
# Adjoining a zero/one to semigroups and related algebraic structures
This file contains diffe... |
f7484f3e7a1eaad799792ddead3209b1056a8b62 | 4fa161becb8ce7378a709f5992a594764699e268 | /src/analysis/calculus/local_extr.lean | 7c5918e8c0c9f97d503b9c3618b218bb69953cc5 | [
"Apache-2.0"
] | permissive | laughinggas/mathlib | e4aa4565ae34e46e834434284cb26bd9d67bc373 | 86dcd5cda7a5017c8b3c8876c89a510a19d49aad | refs/heads/master | 1,669,496,232,688 | 1,592,831,995,000 | 1,592,831,995,000 | 274,155,979 | 0 | 0 | Apache-2.0 | 1,592,835,190,000 | 1,592,835,189,000 | null | UTF-8 | Lean | false | false | 14,855 | 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 topology.local_extr
import analysis.calculus.deriv
/-!
# Local extrema of smooth functions
## Main definitions
In a real normed space `E` we define `pos_t... |
bc36532e8845d8314c7351897d3011c3fe371df0 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/compiler/uint_fold.lean | 848d236c36a7c357606b8394dda47d46a06f006d | [
"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 | 559 | lean |
@[noinline] def h (x : Nat) : UInt32 :=
UInt32.ofNat x
def f (x y : UInt32) : UInt32 :=
let a1 : UInt32 := 128 * 100 - 100;
let v : Nat := 10 + x.toNat;
let a2 : UInt32 := x + a1;
let a3 : UInt32 := 10;
y + a2 + h v + a3
partial def g (x : UInt32) (y : UInt32) : UInt32 :=
if x = 0 then y else g (x-1) (y+2)
def foo... |
8fc5f878b2a77de9c2a3cab63f9f0bd7978ccf79 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/data/vector/basic.lean | fbf668184a87fd2ac2a6f5d8d2977121284e6bd0 | [
"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,549 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.vector
import data.list.nodup
import data.list.of_fn
import control.applicative
import meta.univs
/-!
# Additional theorems and definitions about the `vec... |
99681d9cad4d3cbd8889c9c7a652e83e7e890c20 | f3be49eddff7edf577d3d3666e314d995f7a6357 | /TBA/Exercises/Exercise5.lean | 556ad97a8abc510d83fc9660dabaab675363649e | [] | no_license | IPDSnelting/tba-2021 | 8b930bcd2f4aae44a2ddc86e72b77f84e6d46e82 | b6390e55b768423d3266969e81d19290129c5914 | refs/heads/master | 1,686,754,693,583 | 1,625,135,602,000 | 1,625,136,365,000 | 355,124,341 | 50 | 7 | null | 1,625,133,762,000 | 1,617,699,824,000 | Lean | UTF-8 | Lean | false | false | 4,894 | lean | namespace TBA
-- Let's work with some inductive types other than `Nat`!
-- Here is our very own definition of `List`:
inductive List (α : Type) where
| nil : List α
| cons (head : α) (tail : List α) : List α
notation (priority := high) "[" "]" => List.nil -- `[]`
infixr:67 (priority := high) " :: " => List.c... |
dbb28737cddfb3a1cef074ec40d2ebd121ccb99a | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/1942.lean | f4ae5893a6b439899e5132af34474de231d86baa | [
"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 | 183 | lean | open tactic
meta def c : tactic unit :=
do l ← local_context,
try_lst (l.map (λ h, cases h >> skip))
structure X (U : Type) :=
(f : U → U)
(w : ∀ u : U, f u = u . c)
|
86d4b9f6bb8800a6be2c04f9c1cfda0fb66551d4 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/group_theory/quotient_group_auto.lean | 8fad574ae630cedcec97de2c37a57c6dffc1eb18 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,378 | lean | /-
Copyright (c) 2018 Kevin Buzzard and Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Buzzard, Patrick Massot.
This file is to a certain extent based on `quotient_module.lean` by Johannes Hölzl.
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.... |
d889b5965911e1d36ffec9aa95d4d5e2f10b14b4 | 2c096fdfecf64e46ea7bc6ce5521f142b5926864 | /src/Init/Data/List/Control.lean | 9a6f52219bc824c91f7be32b49ac3b3ab806281e | [
"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,640 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
prelude
import Init.Control.Basic
import Init.Data.List.Basic
namespace List
universe u v w u₁ u₂
/-!
Remark: we can define `mapM`, `mapM₂` and `forM` usin... |
f2a3d98d40de7a7db729b0ee62f264bf18bba253 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/linear_algebra/matrix/symmetric.lean | 6d37f21ced05bb9564d5b5089fba171cae06ea8c | [
"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 | 4,128 | lean | /-
Copyright (c) 2021 Lu-Ming Zhang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Lu-Ming Zhang
-/
import data.matrix.block
/-!
# Symmetric matrices
This file contains the definition and basic results about symmetric matrices.
## Main definition
* `matrix.is_sym... |
b3627339d015c2a4ce89107ff8756a8ace3e0046 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/topology/metric_space/completion.lean | 1045b5d7de514890d19d05635218b9ba7ab6a369 | [
"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,218 | 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.uniform_space.completion
import topology.metric_space.isometry
import topology.instances.real
/-!
# The completion of a metric space
> THIS FI... |
420e29a62532acc8c07bc9f8d7087d2302994e24 | a721fe7446524f18ba361625fc01033d9c8b7a78 | /elaborate/mul_pow.stripped.lean | ca816ff6e777ef2afda626fca3badcf0ace7548a | [] | no_license | Sterrs/leaning | 8fd80d1f0a6117a220bb2e57ece639b9a63deadc | 3901cc953694b33adda86cb88ca30ba99594db31 | refs/heads/master | 1,627,023,822,744 | 1,616,515,221,000 | 1,616,515,221,000 | 245,512,190 | 2 | 0 | null | 1,616,429,050,000 | 1,583,527,118,000 | Lean | UTF-8 | Lean | false | false | 16,043 | lean | λ (m n k : mynat), mynat.rec (eq.rec true.intro (eq.rec (eq.refl (succ zero = succ zero)) (eq.rec (eq.refl (succ zero = succ zero)) (propext {mp := λ (hl : succ zero = succ zero), true.intro, mpr := λ (hr : true), eq.refl (succ zero)})))) (λ (k_n : mynat) (k_ih : pow (mul m n) k_n = mul (pow m k_n) (pow n k_n)), eq.rec... |
cd95e2a1538ce0d8570f97a6a1d142a306198c37 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/analysis/complex/isometry.lean | a3d2094d43a8603c53ff1bb5de6ad8badeb67400 | [
"Apache-2.0"
] | permissive | AntoineChambert-Loir/mathlib | 64aabb896129885f12296a799818061bc90da1ff | 07be904260ab6e36a5769680b6012f03a4727134 | refs/heads/master | 1,693,187,631,771 | 1,636,719,886,000 | 1,636,719,886,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,066 | lean | /-
Copyright (c) 2021 François Sunatori. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: François Sunatori
-/
import analysis.complex.circle
/-!
# Isometries of the Complex Plane
The lemma `linear_isometry_complex` states the classification of isometries in the comple... |
c0c9984715267c24ad856c5aa75eb513affd7119 | 5d166a16ae129621cb54ca9dde86c275d7d2b483 | /tests/lean/unify_tac1.lean | e0fefcba33cfb05cd68227350ab69531db6e2285 | [
"Apache-2.0"
] | permissive | jcarlson23/lean | b00098763291397e0ac76b37a2dd96bc013bd247 | 8de88701247f54d325edd46c0eed57aeacb64baf | refs/heads/master | 1,611,571,813,719 | 1,497,020,963,000 | 1,497,021,515,000 | 93,882,536 | 1 | 0 | null | 1,497,029,896,000 | 1,497,029,896,000 | null | UTF-8 | Lean | false | false | 576 | lean | open tactic
example (A : Type) (a : A) (p : A → Prop) (H : p a) : ∃ x, p x :=
by do
constructor,
tgt ← target,
t ← get_local `H >>= infer_type,
unify tgt t, -- Succeeds unifying p a =?= p ?m_1
assumption
example (A : Type) (a : A) (p : A → Prop) (H : p a) : ∃ x, p x :=
by do
constructor,
tgt ← target,... |
b99ade85bd6984fed5d5ce5f6c2b34dc86a0ff95 | bb31430994044506fa42fd667e2d556327e18dfe | /src/measure_theory/covering/differentiation.lean | 1f9abd2f96386bd180e7f1a124e14437ad6a7bf3 | [
"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 | 51,374 | lean | /-
Copyright (c) 2021 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 measure_theory.covering.vitali_family
import measure_theory.measure.regular
import measure_theory.function.ae_measurable_order
import measure_theory.inte... |
c777e8e8fe83e74a37ce74a5cec101249dc7ba3c | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/linear_algebra/basic.lean | 2551d8e2d03a83d4506ae679275341c96d2ac6e2 | [
"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 | 104,208 | 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, Kevin Buzzard, Yury Kudryashov
-/
import algebra.big_operators.pi
import algebra.module.pi
import algebra.module.prod
import algebra.module.submodule
im... |
dfc30fb23449df329c81317224f20c5df470d76d | 37a833c924892ee3ecb911484775a6d6ebb8984d | /src/category_theory/presheaves/map.lean | e363eef9f8107d9499c656a4bc86d2276d2032de | [] | no_license | silky/lean-category-theory | 28126e80564a1f99e9c322d86b3f7d750da0afa1 | 0f029a2364975f56ac727d31d867a18c95c22fd8 | refs/heads/master | 1,589,555,811,646 | 1,554,673,665,000 | 1,554,673,665,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,549 | lean | import category_theory.presheaves
import category_theory.tactics.obviously
open category_theory
open category_theory.examples
universes u v
open category_theory.presheaves
open topological_space
namespace category_theory
/- `Presheaf` is a 2-functor CAT ⥤₂ CAT, but we're not going to prove all of that yet. -/
att... |
1d800ba8c212b661dc0d50993f2ec88de7ca3dc6 | ec62863c729b7eedee77b86d974f2c529fa79d25 | /20/b.lean | 8aeb010090d6d5d05ef7bcce34734a3a1f7c08d9 | [] | no_license | rwbarton/advent-of-lean-4 | 2ac9b17ba708f66051e3d8cd694b0249bc433b65 | 417c7e2718253ba7148c0279fcb251b6fc291477 | refs/heads/main | 1,675,917,092,057 | 1,609,864,581,000 | 1,609,864,581,000 | 317,700,289 | 24 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,444 | lean | import Std.Data.HashMap
open Std
@[reducible] def Bits := UInt32
structure OrientedPiece where
-- bits read from left to right or top to bottom in big-endian order
left : Bits
right : Bits
top : Bits
bottom : Bits
payload : Array (Array Bool)
instance : ToString OrientedPiece where
toString p := s!"{p... |
41f32a8bb48efc0b64ca8f650b852b1f9b59a4a5 | 302b541ac2e998a523ae04da7673fd0932ded126 | /tests/playground/test.lean | e06160209db799c94bd1ead70f4dce02f4f781db | [] | no_license | mattweingarten/lambdapure | 4aeff69e8e3b8e78ea3c0a2b9b61770ef5a689b1 | f920a4ad78e6b1e3651f30bf8445c9105dfa03a8 | refs/heads/master | 1,680,665,168,790 | 1,618,420,180,000 | 1,618,420,180,000 | 310,816,264 | 2 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 106 | lean | set_option trace.compiler.ir.init true
def higherorder(f:Nat -> Nat ->Nat) (x:Nat) (y:Nat) : Nat:= f x x
|
680d9044d186e0af33efd2e0452bda2bac5cb3cd | f20db13587f4dd28a4b1fbd31953afd491691fa0 | /library/data/dlist.lean | c67e947ab5ba8c64d1f122c6b08acd43d86951d1 | [
"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 | 4,466 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
universes u
/--
A difference list is a function that, given a list, returns the original
contents of the difference list prepended to the given list.
This s... |
e91dc05c7a0309027d8037589c91d5cd2dca7ef7 | 206422fb9edabf63def0ed2aa3f489150fb09ccb | /src/data/fintype/basic.lean | 710efc313cf074a5662ef87e617aa6fbfdc29979 | [
"Apache-2.0"
] | permissive | hamdysalah1/mathlib | b915f86b2503feeae268de369f1b16932321f097 | 95454452f6b3569bf967d35aab8d852b1ddf8017 | refs/heads/master | 1,677,154,116,545 | 1,611,797,994,000 | 1,611,797,994,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 54,304 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
Finite types.
-/
import tactic.wlog
import data.finset.powerset
import data.finset.lattice
import data.finset.pi
import data.array.lemmas
import order.well_founded
impor... |
6ea7e86b9ee61a8b5620ba4cfd5991d9f5901223 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/algebraic_geometry/Gamma_Spec_adjunction.lean | 3ff87e25fc365fd0223a4fdc1d2cba9d12668bea | [
"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 | 16,150 | lean | /-
Copyright (c) 2021 Junyan Xu. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Junyan Xu
-/
import algebraic_geometry.Scheme
import category_theory.adjunction.limits
import category_theory.adjunction.reflective
/-!
# Adjunction between `Γ` and `Spec`
We define the a... |
1f8fcc9516a765d230bcc4af48b127271af66824 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/data/list/lex.lean | 516c7d3b7fc0c2b66854914c7dbc6843a18f28b8 | [
"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 | 5,810 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import order.rel_classes
/-!
# Lexicographic ordering of lists.
The lexicographic order on `list α` is defined by `L < M` iff
* `[] < (a :: L)` for any `a` and `L`,... |
121e40c8ff7304e1b94543ed66e39ec2a103afa1 | acc85b4be2c618b11fc7cb3005521ae6858a8d07 | /data/set/prod.lean | 624db10dca39851b8ddf526e2ffc34fe64c822a0 | [
"Apache-2.0"
] | permissive | linpingchuan/mathlib | d49990b236574df2a45d9919ba43c923f693d341 | 5ad8020f67eb13896a41cc7691d072c9331b1f76 | refs/heads/master | 1,626,019,377,808 | 1,508,048,784,000 | 1,508,048,784,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,463 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Johannes Hölzl
-/
import data.set.lattice data.prod
universes u v w x
variables {α : Type u} {β : Type v} {γ : Type w} {δ : Type x}
variables {s s₁ s₂ : set α} {t t₁ t₂ : set β}
namesp... |
152e09f9fb68665a9d2ff1f4a29bf90a9968c0ad | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /src/ring_theory/polynomial/rational_root.lean | 640751f03fbac0dbce656fafa4435fab8028608a | [
"Apache-2.0"
] | permissive | dexmagic/mathlib | ff48eefc56e2412429b31d4fddd41a976eb287ce | 7a5d15a955a92a90e1d398b2281916b9c41270b2 | refs/heads/master | 1,693,481,322,046 | 1,633,360,193,000 | 1,633,360,193,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,008 | lean | /-
Copyright (c) 2020 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen
-/
import ring_theory.integrally_closed
import ring_theory.polynomial.scale_roots
/-!
# Rational root theorem and integral root theorem
This file contains the rational root... |
4cbe3696b655284406da0ef56336a8ad1b5c4e79 | 432d948a4d3d242fdfb44b81c9e1b1baacd58617 | /src/data/finset/basic.lean | 92f7640bbd75c7771f097bdeb50d201f760461d0 | [
"Apache-2.0"
] | permissive | JLimperg/aesop3 | 306cc6570c556568897ed2e508c8869667252e8a | a4a116f650cc7403428e72bd2e2c4cda300fe03f | refs/heads/master | 1,682,884,916,368 | 1,620,320,033,000 | 1,620,320,033,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 120,182 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Jeremy Avigad, Minchao Wu, Mario Carneiro
-/
import data.multiset.finset_ops
import tactic.monotonicity
import tactic.apply
import tactic.nth_rewrite
/-!
# F... |
2fb00fa2ffdf53735b48ebf143ee8fcb5c6bc446 | 037dba89703a79cd4a4aec5e959818147f97635d | /src/2020/logic/solutions.lean | 77e3d6906e596e39ea5eb2ee902417e02db55db2 | [] | no_license | ImperialCollegeLondon/M40001_lean | 3a6a09298da395ab51bc220a535035d45bbe919b | 62a76fa92654c855af2b2fc2bef8e60acd16ccec | refs/heads/master | 1,666,750,403,259 | 1,665,771,117,000 | 1,665,771,117,000 | 209,141,835 | 115 | 12 | null | 1,640,270,596,000 | 1,568,749,174,000 | Lean | UTF-8 | Lean | false | false | 14,489 | lean | /-
Copyright (c) 2020 Kevin Buzzard. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author : Kevin Buzzard
-/
import tactic
/-!
# Logic
A Lean companion to the "Logic" part of the intro module.
We develop the basic theory of the five symbols
→, ¬, ∧, ↔, ∨
(in that order)
#... |
c35a15b693cefedee3b9371b4eb37cdd4b959a7a | b5d813b41740060da28e55b77c69760b7c52760d | /lean_stuff_6.lean | c006a123b7bb2e145da6d47244c3ac79dfdb10df | [] | no_license | ImperialCollegeLondon/SF-solns-zak | 4e85518c5cd4093b995a7593eee8295887e8727e | 7edc4424938e01a6ef4bb518fa8ec1757a2226b1 | refs/heads/master | 1,584,849,829,155 | 1,533,216,269,000 | 1,533,216,269,000 | 139,470,368 | 3 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,453 | lean | #print notation ::
#print notation [
-- = append (rev a) b
definition rev_append {α : Type} : list α → list α → list α
| [] a := a
| (x::L₁) L₂ := rev_append L₁ (x::L₂)
definition tr_rev {α : Type} (l : list α) : list α :=
rev_append l []
def rev {α : Type} : list α → list α
| [] := []
| (n::L) := append (rev L) ... |
82374f442f11b6e54089b3531bbe025c43d13f1c | 5fbbd711f9bfc21ee168f46a4be146603ece8835 | /lean/natural_number_game/power/1.lean | 7ee72c9f5eba04224d87997678735630a6432c2d | [
"LicenseRef-scancode-warranty-disclaimer"
] | no_license | goedel-gang/maths | 22596f71e3fde9c088e59931f128a3b5efb73a2c | a20a6f6a8ce800427afd595c598a5ad43da1408d | refs/heads/master | 1,623,055,941,960 | 1,621,599,441,000 | 1,621,599,441,000 | 169,335,840 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 75 | lean | lemma zero_pow_zero : (0 : mynat) ^ (0 : mynat) = 1 :=
rwa pow_zero,
end
|
0efc0be29106e27dc1939e3259fdce23d19e906f | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/polynomial/basic.lean | 09b1dd24f7c12693975cdcd446f653093b291c7b | [
"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,226 | 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.monoid_algebra.basic
import data.finset.sort
/-!
# Theory of univariate polynomials
> THIS FILE IS SYNCHR... |
85762a57b5e6951e09766bd1f0ce680e296eceb8 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/tactic/cancel_denoms.lean | 3a8f20d3c9272276310af986b104b291447850ad | [
"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,289 | lean | /-
Copyright (c) 2020 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
-/
import data.rat.meta_defs
import tactic.norm_num
import data.tree
import meta.expr
/-!
# A tactic for canceling numeric denominators
This file defines tactics th... |
fcfe13e860ec0edf227b1ea95ac7b522d8d367d6 | e898bfefd5cb60a60220830c5eba68cab8d02c79 | /uexp/src/uexp/rules/aggregateGroupingSetsProjectMerge.lean | c90ef248a0f8c287f9f63263d592c61e0072abc8 | [
"BSD-2-Clause"
] | permissive | kkpapa/Cosette | 9ed09e2dc4c1ecdef815c30b5501f64a7383a2ce | fda8fdbbf0de6c1be9b4104b87bbb06cede46329 | refs/heads/master | 1,584,573,128,049 | 1,526,370,422,000 | 1,526,370,422,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,202 | lean | import ..extra_constants
import ..sql
import ..u_semiring
import ..cosette_tactics
import ..TDP
open SQL
open Proj
open Pred
open Expr
theorem rule :
forall (Γ scm_s : Schema)
(rel_r : relation scm_s)
(s_a : Column datatypes.int scm_s)
(s_b : Column datatypes.int scm_s)
... |
aeff21044267d34bbbec044f1557a910b327221c | c777c32c8e484e195053731103c5e52af26a25d1 | /src/analysis/calculus/uniform_limits_deriv.lean | cf8881f0e5a3ebd2700066fd7048c5b102008ef2 | [
"Apache-2.0"
] | permissive | kbuzzard/mathlib | 2ff9e85dfe2a46f4b291927f983afec17e946eb8 | 58537299e922f9c77df76cb613910914a479c1f7 | refs/heads/master | 1,685,313,702,744 | 1,683,974,212,000 | 1,683,974,212,000 | 128,185,277 | 1 | 0 | null | 1,522,920,600,000 | 1,522,920,600,000 | null | UTF-8 | Lean | false | false | 30,129 | lean | /-
Copyright (c) 2022 Kevin H. Wilson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin H. Wilson
-/
import analysis.calculus.mean_value
import analysis.normed_space.is_R_or_C
import order.filter.curry
/-!
# Swapping limits and derivatives via uniform convergence
... |
1288a757df7e41e71a8d8f3ad92d559eb2f31a9d | 94e33a31faa76775069b071adea97e86e218a8ee | /src/analysis/convex/specific_functions.lean | 1c2e1b8b27ae602343452652197db595ef6d020b | [
"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 | 11,560 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov, Sébastien Gouëzel
-/
import analysis.calculus.mean_value
import analysis.special_functions.pow_deriv
import analysis.special_functions.sqrt
/-!
# Collection of conve... |
d68039c7b27565fab08c46ec4ffdcbf275d9bc22 | 42610cc2e5db9c90269470365e6056df0122eaa0 | /hott/algebra/homotopy_group.hlean | 62567143aef7f31782fc45d0426dbadcdcc4122f | [
"Apache-2.0"
] | permissive | tomsib2001/lean | 2ab59bfaebd24a62109f800dcf4a7139ebd73858 | eb639a7d53fb40175bea5c8da86b51d14bb91f76 | refs/heads/master | 1,586,128,387,740 | 1,468,968,950,000 | 1,468,968,950,000 | 61,027,234 | 0 | 0 | null | 1,465,813,585,000 | 1,465,813,585,000 | null | UTF-8 | Lean | false | false | 11,294 | 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
homotopy groups of a pointed space
-/
import .trunc_group types.trunc .group_theory
open nat eq pointed trunc is_trunc algebra group function equiv unit is_equiv
... |
fc5f14464a12cc0eabd21bf9760e63f8309444ed | a46d86797f98e604c71128429409acba8288c1f8 | /algebra/lattice/dcpo.lean | 5bafa0897bf45ad9fab2be26fb3e679976e6d361 | [] | no_license | tizmd/lean-abstract-interpretation | 655213d76e84e093910bb6378796cdb4e1ae3565 | ad69622adc082e7009f12b17568662a599779260 | refs/heads/master | 1,610,518,429,734 | 1,498,128,216,000 | 1,498,128,216,000 | 94,891,623 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 22,579 | lean | import algebra.lattice.basic algebra.lattice.bounded_lattice algebra.lattice.complete_lattice
import data.set
universes u v w
open lattice
set_option old_structure_cmd true
set_option eqn_compiler.zeta true
variables {α : Type u} {β : Type v}{γ : Type w}
private lemma exists_add_of_le : ∀ {m n : ℕ}, m ≤ n → ∃ k, n... |
8fe0078e721eb25af409100f1b8db1a7c771df63 | 9c1ad797ec8a5eddb37d34806c543602d9a6bf70 | /examples/semigroups/monoidal_category_of_semigroups.lean | 2c0842aaed5b2215697b2fd4a794b39be2a023c1 | [] | no_license | timjb/lean-category-theory | 816eefc3a0582c22c05f4ee1c57ed04e57c0982f | 12916cce261d08bb8740bc85e0175b75fb2a60f4 | refs/heads/master | 1,611,078,926,765 | 1,492,080,000,000 | 1,492,080,000,000 | 88,348,246 | 0 | 0 | null | 1,492,262,499,000 | 1,492,262,498,000 | null | UTF-8 | Lean | false | false | 4,857 | 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 ...monoidal_categories.braided_monoidal_category
import .semigroups
open tqft.categories.natural_transformation
namespace tqft.categories... |
21ec0f9549b0930bdc6bc194c713d18fa8297999 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/logic/basic.lean | 7cafe15c710c11d7e78af2d660a12d457b8905eb | [
"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 | 67,098 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura
-/
import tactic.doc_commands
import tactic.reserved_notation
/-!
# Basic logic properties
This file is one of the earliest imports in mathlib.
## Im... |
4046d14918e8f591d2f635229915362220aab925 | 8a46bc8e4113e5343eb8ed7d4ca597d355939e98 | /src/libk/extras.lean | a5164677e86e74c83dfa2af1fd2f23f08973cf2e | [] | no_license | khoek/libk | 69e938f9b94537f6dc0c80e174a6a580db41e706 | 461caf0b2915dd612a5e9f4ad7f6b627506d4ec0 | refs/heads/master | 1,585,385,231,232 | 1,537,786,244,000 | 1,537,786,793,000 | 147,989,099 | 0 | 1 | null | 1,556,189,953,000 | 1,536,462,801,000 | Lean | UTF-8 | Lean | false | false | 864 | lean | import system.io
-- Supress "xxx is noncomputable" errors when running on vanilla lean
noncomputable theory
-- Boilerplate for implementing extra IO functions
class vm_extra_io (m : Type → Type → Type) [monad_io m] :=
(nop : io unit)
(greet : io unit)
@[instance] constant vm_extra_io_impl : vm_extra_io io_core
na... |
c9ce6951f317a4ad300cac3d0af9efae01c7bfcf | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/local_attribute.lean | 77724b80e16771eddcf774f48beb18ecec938c5d | [
"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 | 239 | lean |
local attribute [instance, priority 0] classical.prop_decidable
open tactic
run_cmd do
(p,_) ← has_attribute `instance ``nat.has_add,
guard p,
(p,_) ← has_attribute `instance ``classical.prop_decidable,
guard (¬ p),
skip
|
81796c9db1bb3fad366414617113c9577fbbe2cd | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch2/ex0502.lean | 40da132316f279d1b50b1c76bce683c2a2532394 | [] | 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 | 88 | lean | #check let y := 2 + 2, z := y + y in z * z
#reduce let y := 2 + 2, z := y + y in z * z
|
44a1c725d2cfe0da3f533adcb2be023a702403ff | ac1c2a2f522b0fdf854095ba00f882ca849669e7 | /library/init/meta/interactive.lean | 259ed46060694773939a9ae89631a0c13b097d33 | [
"Apache-2.0"
] | permissive | abliss/lean | b8b336abc8d50dbb0726dcff9dd16793c23bfbe1 | fb24cc99573c153f97a1951ee94bbbdda300b6be | refs/heads/master | 1,611,536,584,520 | 1,497,811,981,000 | 1,497,811,981,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 31,214 | 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.rewrite_tactic init.meta.simp_tactic
import init.meta.smt.congruence_closure init.category.combinators
import init... |
42d9295dc61d21e894ffd20e2648e8803aba5865 | 1abd1ed12aa68b375cdef28959f39531c6e95b84 | /src/analysis/convex/specific_functions.lean | c281e0383dbc488dad93667aef14d1b6dc974b48 | [
"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 | 6,314 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov, Sébastien Gouëzel
-/
import analysis.calculus.mean_value
import analysis.special_functions.pow
/-!
# Collection of convex functions
In this file we prove that the f... |
b4f13b191ef1b2f0ae51eac0897594fdeb2e126b | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/lean/run/simp4.lean | 60528b6c4d89294686201babdf422760b3301c4c | [
"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 | 1,530 | lean | opaque f : Nat → Nat
opaque q : Nat → Prop
opaque r : Nat → Prop
@[simp] axiom ax1 (p : Prop) : (p ∧ True) ↔ p
@[simp] axiom ax2 (x : Nat) : q (f x)
@[simp] axiom ax3 (x : Nat) : ¬ r (f x)
@[simp] axiom ax4 (p : Prop) : (p ∨ False) ↔ p
theorem ex1 (x : Nat) (h : q x) : q x ∧ q (f x) := by
simp [h]
theorem ex2 (x :... |
d8d970a8a13d8891fee2882fa0fc76810d4d5b4d | 83bd63fd58ebbb33f769cbf6d6a67463ba1bc637 | /src/day_1/logic.lean | 3c9ec74f31978e8552fab82c9b430a16227e3021 | [] | no_license | Wornbard/mbl_lean_workshop | 6ebdafebac74f1b1148f67a528242a3687af17e1 | 6b68ce25fdc49043fd5ab409de8e4a2987def22e | refs/heads/main | 1,690,205,591,845 | 1,630,953,271,000 | 1,630,953,271,000 | 403,417,180 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,943 | lean | -- We import all of Lean's standard tactics
import tactic
/-
Since it's the easiest thing to start with, we first develop basic logic.
# The logical symbols that Lean understands :
* `→` ("implies" -- type with `\l`)
* `¬` ("not" -- type with `\not` or `\n`)
* `∧` ("and" -- type with `\and` or `\an`)
* `↔` ("... |
d0aa128766f8d85f413414c3dff7708356a3c50e | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/analysis/special_functions/polynomials.lean | 0abc9d849485c8d25346f5cd5dcaac83613dc9e3 | [
"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 | 10,720 | lean | /-
Copyright (c) 2020 Anatole Dedecker. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anatole Dedecker, Devon Tuma
-/
import analysis.asymptotics.asymptotic_equivalent
import analysis.asymptotics.specific_asymptotics
import data.polynomial.ring_division
/-!
# Limits ... |
9234e3f020b4ed2897e215fd26bd1019feba3a8e | ebbdcbd7ddc89a9ef7c3b397b301d5f5272a918f | /qp/p1_categories/c3_wtypes/s3_algebras.lean | a01473e458a1cc9970fd031846ccbc422413af46 | [] | no_license | intoverflow/qvr | 34b9ef23604738381ca20b7d622fd0399d88f2dd | 0cfcd33fe4bf8d93851a00cec5bfd21e77105d74 | refs/heads/master | 1,616,591,570,371 | 1,492,575,772,000 | 1,492,575,772,000 | 80,061,627 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 15,424 | lean | /- -----------------------------------------------------------------------
Algebras for endofunctors.
----------------------------------------------------------------------- -/
import ..c1_basic
import ..c2_limits
namespace qp
open stdaux
universe variables ℓobj ℓhom
/- ------------------------------------------... |
3a24ea2a924b3a84ff5e4eacb9889fdc6c10e427 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/linear_algebra/affine_space/midpoint.lean | 686bc7ebb701a4b471cec07e0c9d1e50d235c252 | [
"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,250 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import algebra.invertible
import linear_algebra.affine_space.affine_equiv
/-!
# Midpoint of a segment
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to ... |
8fd39d36ab55276d44ea8d2b577183fa3d7d1fd2 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/set_theory/schroeder_bernstein.lean | 7876a21c50dbf2165a69125ad3e8bf68f1c0c332 | [
"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,357 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro
-/
import order.fixed_points
import order.zorn
/-!
# Schröder-Bernstein theorem, well-ordering of cardinals
This file proves the Schröder-Bernstein the... |
8a33de3030f6f4a14a0298cdfeb11fe28f4d5e0f | 42c01158c2730cc6ac3e058c1339c18cb90366e2 | /xenalib/real_experiments.lean | 51f4b87e6122d9fa3f55b70739aba7abb29e1f34 | [] | no_license | ChrisHughes24/xena | c80d94355d0c2ae8deddda9d01e6d31bc21c30ae | 337a0d7c9f0e255e08d6d0a383e303c080c6ec0c | refs/heads/master | 1,631,059,898,392 | 1,511,200,551,000 | 1,511,200,551,000 | 111,468,589 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,643 | lean | /- Fake real numbers.
There are technical difficulties in accessing real numbers
in the online version of Lean. Anyone who is using Lean online but
wants real numbers can just cut and paste the below code.
This gives us a class "real", which is a fake version of the
real numbers. See if you can spot any differences!
-/... |
69e917e4d4c3a84fb5a13ddfc7996f7fd78724ed | 46125763b4dbf50619e8846a1371029346f4c3db | /src/ring_theory/subring.lean | 28c3e802f2b5ced06306ac8d6ceb6e5c2a9dd8db | [
"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 | 8,469 | 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 group_theory.subgroup
import algebra.ring
universes u v
open group
variables {R : Type u} [ring R]
section prio
set_option default_priority 100 -- see Not... |
e8a4c3cac2386b215212b9d5356e555ae3693b88 | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/analysis/seminorm.lean | 22e4f47aa01a47837d9773e022dd2a29e188f355 | [
"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,109 | lean | /-
Copyright (c) 2019 Jean Lo. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean Lo
-/
import algebra.pointwise
import analysis.normed_space.basic
/-!
# Seminorms and Local Convexity
This file introduces the following notions, defined for a vector space
over a nor... |
3b3559e50b2882fe8247db26b4c46a17c3ee7fa0 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Util/PPExt.lean | e1db2eb736873fb8dbb5261531bb8d153e22ee97 | [
"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,183 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
import Lean.Environment
import Lean.MetavarContext
import Lean.Data.OpenDecl
import Lean.Elab.InfoTree.Types
namespace Lean
register_builtin_option pp.raw :... |
de86ccf8c65c6ea2af28fb65c672c670e54845fd | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/topology/bases.lean | 5a6f8d17a0fe2eb09a3bae0e65f182d3305aa638 | [
"Apache-2.0"
] | permissive | ilitzroth/mathlib | ea647e67f1fdfd19a0f7bdc5504e8acec6180011 | 5254ef14e3465f6504306132fe3ba9cec9ffff16 | refs/heads/master | 1,680,086,661,182 | 1,617,715,647,000 | 1,617,715,647,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 17,407 | 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
Bases of topologies. Countability axioms.
-/
import topology.continuous_on
open set filter classical
open_locale topological_space filter
noncomputable... |
5f55fc7032c9fac53789d6f040b2e899c1b9f7ff | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/logic/relation.lean | d781ed1551577c139cc85d5a1b303fd201998952 | [
"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 | 16,447 | 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
Transitive reflexive as well as reflexive closure of relations.
-/
import tactic.basic
variables {α : Type*} {β : Type*} {γ : Type*} {δ : Type*}
section ne_imp
varia... |
f4afcc59066ea3297162093dc767e7451b4b3fb2 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/run/eq2.lean | e56c577337fa989f68daf73e657c8b6d69c00e7c | [
"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 | 181 | lean | definition symm {A : Type} : Π {a b : A}, a = b → b = a
| a .(a) rfl := rfl
definition trans {A : Type} : Π {a b c : A}, a = b → b = c → a = c
| a .(a) .(a) rfl rfl := rfl
|
910034c1873d633902298be4a4fa40cb54773682 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/noncomputable_modifier.lean | 641b11332d6ee26e11608718a04ede451dc68fe4 | [
"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 | 792 | lean | import init.meta.interactive
open tactic lean lean.parser interactive
meta def describe_it : noncomputable_modifier → string
| noncomputable_modifier.computable := "computable"
| noncomputable_modifier.noncomputable := "noncomputable"
| noncomputable_modifier.force_noncomputable := "force_noncomputable"
@[user_comma... |
a5ea348580cbe0fca028271296fb2d11890bc470 | 75bd9c50a345718d735a7533c007cf45f9da9a83 | /src/data/polynomial/degree/trailing_degree.lean | dc3f4a991120905f0bc1832f4c15619d0d59b1a9 | [
"Apache-2.0"
] | permissive | jtbarker/mathlib | a1a3b1ddc16179826260578410746756ef18032c | 392d3e376b44265ef2dedbd92231d3177acc1fd0 | refs/heads/master | 1,671,246,411,096 | 1,600,801,712,000 | 1,600,801,712,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 11,848 | lean | import tactic
import data.polynomial.degree.basic
noncomputable theory
local attribute [instance, priority 100] classical.prop_decidable
open function polynomial finsupp finset
open_locale big_operators
namespace polynomial
universes u v
variables {R : Type u} {S : Type v} {a b : R} {n m : ℕ}
section semiring
varia... |
8a199825d331a78fb51be87ab7497856153be21c | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/order/filter/germ.lean | a8c3dc0809254c38f9cc3e65ea7ead3806ff1b2b | [
"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 | 21,466 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov, Abhimanyu Pallavi Sudhir
-/
import order.filter.basic
import algebra.module.pi
/-!
# Germ of a function at a filter
The germ of a function `f : α → β` at a fi... |
a5fbbaad4bce27cdabcd139de87ed2c13d6e57f0 | 7b02c598aa57070b4cf4fbfe2416d0479220187f | /algebra/left_module.hlean | 0de50d359c53ee6476232be3bc8303286983ae3a | [
"Apache-2.0"
] | permissive | jdchristensen/Spectral | 50d4f0ddaea1484d215ef74be951da6549de221d | 6ded2b94d7ae07c4098d96a68f80a9cd3d433eb8 | refs/heads/master | 1,611,555,010,649 | 1,496,724,191,000 | 1,496,724,191,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 17,583 | hlean | /-
Copyright (c) 2015 Nathaniel Thomas. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nathaniel Thomas, Jeremy Avigad, Floris van Doorn
Modules prod vector spaces over a ring.
(We use "left_module," which is more precise, because "module" is a keyword.)
-/
import al... |
02e23ec7d6a054e180164d4b876a3e0c6325ff02 | 6b2a480f27775cba4f3ae191b1c1387a29de586e | /group_rep_2/linear_algebra/caracteristic_polynomial.lean | 56eba497bd888db9bd4451e84eb94a9d87592218 | [] | no_license | Or7ando/group_representation | a681de2e19d1930a1e1be573d6735a2f0b8356cb | 9b576984f17764ebf26c8caa2a542d248f1b50d2 | refs/heads/master | 1,662,413,107,324 | 1,590,302,389,000 | 1,590,302,389,000 | 258,130,829 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 7,170 | lean | import data.complex.basic
import linear_algebra.basic
import linear_algebra.determinant
import analysis.complex.polynomial
import data.polynomial
import linear_algebra.tools_for_carac_poly
open finset
universes u v w w'
variables
{R : Type u}[nonzero_comm_ring R]
{A : Type v} [fintype A][decidable... |
2fe2940b6e6e4dfd146576ab9247181a894b69a4 | 649957717d58c43b5d8d200da34bf374293fe739 | /src/category_theory/const.lean | 94821b17d99f18b7c5aead7789d070cc25666312 | [
"Apache-2.0"
] | permissive | Vtec234/mathlib | b50c7b21edea438df7497e5ed6a45f61527f0370 | fb1848bbbfce46152f58e219dc0712f3289d2b20 | refs/heads/master | 1,592,463,095,113 | 1,562,737,749,000 | 1,562,737,749,000 | 196,202,858 | 0 | 0 | Apache-2.0 | 1,562,762,338,000 | 1,562,762,337,000 | null | UTF-8 | Lean | false | false | 2,516 | lean | -- Copyright (c) 2018 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Scott Morrison
import category_theory.functor_category
import category_theory.opposites
universes v₁ v₂ v₃ u₁ u₂ u₃ -- declare the `v`'s first; see `category_theory.category` f... |
31dc80b651bb5c60bb55b1c274719676797c5f1a | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/measure_theory/lebesgue_measure.lean | d239af9f8510de2182a19d8c6bd9f34a3efded13 | [
"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 | 11,513 | 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
Lebesgue measure on the real line
-/
import measure_theory.measure_space measure_theory.borel_space
noncomputable theory
open classical set lattice filter
open nnreal (... |
022876e6a299bb28ab9768ea3cbfd00c512ab662 | 9dd3f3912f7321eb58ee9aa8f21778ad6221f87c | /tests/lean/field_access.lean | f5f4767037ec69daefb641b2f9b34c25560cfb7b | [
"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 | 533 | lean | check list.map
variable l : list nat
check l~>1 -- Error l is not a structure
check (1, 2)~>5 -- Error insufficient fields
example (l : list nat) : list nat :=
l~>forr (λ x, x + 1) -- Error there is no list.forr
example (A : Type) (a : A) : A :=
a~>symm -- Error type of 'a' is not a constant application
example (... |
a53cc61574c8599dc214db0f12937d5dc75fce54 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/measure_theory/outer_measure.lean | e43e6d9bb30d261eed4fffdadb644fb8b3b399cf | [
"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 | 61,218 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro
-/
import analysis.specific_limits
import measure_theory.pi_system
import data.matrix.notation
import topology.algebra.infinite_sum
/-!
# Outer Measures... |
f4d7e1390ee2546f22fded3f959734a65a1d3185 | 7cdf3413c097e5d36492d12cdd07030eb991d394 | /world_experiments/world8/level11.lean | 2af32d8c6bd5bfdebacbc35affbface95117346b | [] | no_license | alreadydone/natural_number_game | 3135b9385a9f43e74cfbf79513fc37e69b99e0b3 | 1a39e693df4f4e871eb449890d3c7715a25c2ec9 | refs/heads/master | 1,599,387,390,105 | 1,573,200,587,000 | 1,573,200,691,000 | 220,397,084 | 0 | 0 | null | 1,573,192,734,000 | 1,573,192,733,000 | null | UTF-8 | Lean | false | false | 690 | lean | import game.world3.level10 -- hide
import game.world2.level11 -- random import -- succ ne zero -- hide
import game.world2.level13 -- add_left_eq_zero -- hide
namespace mynat -- hide
/-
# Multiplication World
## Level 11: `mul_eq_zero_iff`
Now you have `eq_zero_or_eq_zero_of_mul_eq_zero` this is pretty straightforwa... |
075cfe06c1877c5a4b7eaa778295ecd6452ccdc8 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/blast_meta_bug.lean | 8d2ff385ec7922141862173a8a250d028407591d | [
"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 | 207 | lean | constants {A : Type.{1}} (P : A → Prop) (Q : A → Prop)
definition H [forward] : ∀ a, (: P a :) → Exists Q := sorry
set_option blast.strategy "ematch"
example (a : A) : P a → Exists Q :=
by blast
|
3888890a16ff5ce3daebf643016d7d0e77708b1b | 5d166a16ae129621cb54ca9dde86c275d7d2b483 | /library/init/data/ordering.lean | 7c681c6f0dafba104bac20fc26101f38966fe844 | [
"Apache-2.0"
] | permissive | jcarlson23/lean | b00098763291397e0ac76b37a2dd96bc013bd247 | 8de88701247f54d325edd46c0eed57aeacb64baf | refs/heads/master | 1,611,571,813,719 | 1,497,020,963,000 | 1,497,021,515,000 | 93,882,536 | 1 | 0 | null | 1,497,029,896,000 | 1,497,029,896,000 | null | UTF-8 | Lean | false | false | 2,058 | 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.to_string init.data.prod init.data.sum.basic
inductive ordering
| lt | eq | gt
namespace ordering
def swap : ordering → orderin... |
6004c7b57f0df5e3fc93c4db0b5d579d60f3a04c | a537b538f2bea3181e24409d8a52590603d1ddd9 | /test/rewrite_search_discovery_2.lean | af9b58e9248d9a0e48f1f90b0214efc68776a74e | [] | no_license | rwbarton/lean-tidy | 6134813ded72b275d19d4d32514dba80c21708e3 | fe1125d32adb60decda7a77d0f679614ba9f6fbb | refs/heads/master | 1,585,549,718,705 | 1,538,120,619,000 | 1,538,120,624,000 | 150,864,330 | 0 | 0 | null | 1,538,225,790,000 | 1,538,225,790,000 | null | UTF-8 | Lean | false | false | 1,016 | lean | import tidy.rewrite_search
open tidy.rewrite_search.discovery
open tidy.rewrite_search.tracer
namespace tidy.rewrite_search.testing
local attribute [instance] classical.prop_decidable
example {A B C : Prop} : ((B → C) → (¬(A → C) ∧ ¬(A ∨ B))) = (B ∧ ¬C) :=
by rewrite_search_using [] {suggest := []}
end tidy.... |
1a87575d590e1c63bcde0fc8283e5009fd1f627c | b7f22e51856f4989b970961f794f1c435f9b8f78 | /library/theories/analysis/complex_norm.lean | 236cc21a1459b740cbd77c7c3c88780296cc5d45 | [
"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 | 3,199 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad
Instantiate the complex numbers as a normed space, by temporarily making it an inner product space
over the reals.
-/
import theories.analysis.inner_product data.complex
o... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.