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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
17f704ae313587001a9b9ab0beb54dd72323c092 | ae9f8bf05de0928a4374adc7d6b36af3411d3400 | /src/formal_ml/convex_optimization.lean | 6abc2663937a1a3d54a598fcbedd3b3b95d53e2f | [
"Apache-2.0"
] | permissive | NeoTim/formal-ml | bc42cf6beba9cd2ed56c1cd054ab4eb5402ed445 | c9cbad2837104160a9832a29245471468748bb8d | refs/heads/master | 1,671,549,160,900 | 1,601,362,989,000 | 1,601,362,989,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,788 | lean | /-
Copyright 2020 Google LLC
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
di... |
54601019ac59be61dfebe27f622da1e651f86f09 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/topology/subset_properties.lean | 4a642f95dfc9ec1d219ecf748aacd4c6d79361e3 | [
"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 | 80,325 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro, Yury Kudryashov
-/
import order.filter.pi
import topology.bases
import data.finset.order
import data.set.accumulate
import tactic.tfae
import topology.b... |
4e2ca9ede3b22634e94e192fa83cba844499b7b1 | 12dabd587ce2621d9a4eff9f16e354d02e206c8e | /world10/level01.lean | 9260643346170a525e04387b79452435bfdb30f7 | [] | no_license | abdelq/natural-number-game | a1b5b8f1d52625a7addcefc97c966d3f06a48263 | bbddadc6d2e78ece2e9acd40fa7702ecc2db75c2 | refs/heads/master | 1,668,606,478,691 | 1,594,175,058,000 | 1,594,175,058,000 | 278,673,209 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 127 | lean | import mynat.le
lemma one_add_le_self (x : mynat) : x ≤ 1 + x :=
begin
rw le_iff_exists_add,
use 1,
exact add_comm 1 x,
end
|
91bbc3e43aae5dd0ef9d97bdf7048eeedf89575c | e967488e2008f07b0aa7b6b18d4398d02c7460e2 | /src/game/intro.lean | eaacd58e62be63961dbd93db36a81fc74f1637dd | [] | no_license | thyrgle/real-number-game | 5c53eefaa815051f3d70ca5782e41d2adb76fd6e | a420eecef62209b729c910c2170d1dd27b74bc9f | refs/heads/master | 1,606,405,407,612 | 1,574,956,743,000 | 1,574,956,743,000 | 229,126,103 | 0 | 0 | null | 1,576,784,273,000 | 1,576,784,272,000 | null | UTF-8 | Lean | false | false | 1,797 | lean | /-
# The Real Number Game, version 1.0beta
## By Kevin Buzzard
# What is this game?
Welcome to the real number game -- a game to help undergraduates learn analysis through Lean,
a formal proof verification system. Starting from the real numbers with its usual structure,
we develop the theory of bounds, least upper ... |
0547c07499ebca056a529fb0511149cddf5ca23c | b73bd2854495d87ad5ce4f247cfcd6faa7e71c7e | /src/game/world3/level8.lean | 9b8d72b81b60283324c7f4a8c9b920fd21834d83 | [] | no_license | agusakov/category-theory-game | 20db0b26270e0c95a3d5605498570273d72f731d | 652dd7e90ae706643b2a597e2c938403653e167d | refs/heads/master | 1,669,201,216,310 | 1,595,740,057,000 | 1,595,740,057,000 | 280,895,295 | 12 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 763 | lean | import category_theory.category.default
universes v u -- The order in this declaration matters: v often needs to be explicitly specified while u often can be omitted
namespace category_theory
variables (C : Type u) [category.{v} C]
--rewrite this
/-
# Category world
## Level 7: Composition of monomorphisms
Now ... |
fa5e8cd23fe7c45a85524196c57de0fbadfe5f31 | 827124860511172deb7ee955917c49b2bccd1b3c | /data/containers/rbtree/default.lean | b1c053ca6bc50346d9b32eda50effea75503c79e | [] | no_license | joehendrix/lean-containers | afec24c7de19c935774738ff3a0415362894956c | ef6ff0533eada75f18922039f8312badf12e6124 | refs/heads/master | 1,624,853,911,199 | 1,505,890,599,000 | 1,505,890,599,000 | 103,489,962 | 1 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 13 | lean | import .basic |
1ade2d24ed27c8c499d7e1dcab4e90debdd5c3e1 | 66a6486e19b71391cc438afee5f081a4257564ec | /algebra/direct_sum.hlean | db33e938a87c9dccac00d478af400ada6d6a36f0 | [
"Apache-2.0"
] | permissive | spiceghello/Spectral | c8ccd1e32d4b6a9132ccee20fcba44b477cd0331 | 20023aa3de27c22ab9f9b4a177f5a1efdec2b19f | refs/heads/master | 1,611,263,374,078 | 1,523,349,717,000 | 1,523,349,717,000 | 92,312,239 | 0 | 0 | null | 1,495,642,470,000 | 1,495,642,470,000 | null | UTF-8 | Lean | false | false | 8,624 | hlean | /-
Copyright (c) 2015 Floris van Doorn, Egbert Rijke, Favonia. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Egbert Rijke, Favonia
Constructions with groups
-/
import .quotient_group .free_abelian_group .product_group
open eq is_equiv algebra is_t... |
ab654c7d56d5704116b2e794893d445f15a2fcba | 5df84495ec6c281df6d26411cc20aac5c941e745 | /src/formal_ml/independent_events.lean | 7713a35bacea19c0d52a335c6e5804c72e06cedd | [
"Apache-2.0"
] | permissive | eric-wieser/formal-ml | e278df5a8df78aa3947bc8376650419e1b2b0a14 | 630011d19fdd9539c8d6493a69fe70af5d193590 | refs/heads/master | 1,681,491,589,256 | 1,612,642,743,000 | 1,612,642,743,000 | 360,114,136 | 0 | 0 | Apache-2.0 | 1,618,998,189,000 | 1,618,998,188,000 | null | UTF-8 | Lean | false | false | 18,117 | lean | /-
Copyright 2020 Google LLC
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
di... |
a50fbba2c7f661545afa91b3c6ee5beb8280adb5 | f3849be5d845a1cb97680f0bbbe03b85518312f0 | /library/init/meta/smt/congruence_closure.lean | 5e03494dedd64a10f66809976a7d029eccaddbc0 | [
"Apache-2.0"
] | permissive | bjoeris/lean | 0ed95125d762b17bfcb54dad1f9721f953f92eeb | 4e496b78d5e73545fa4f9a807155113d8e6b0561 | refs/heads/master | 1,611,251,218,281 | 1,495,337,658,000 | 1,495,337,658,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,372 | 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.set_get_option_tactics
structure cc_config :=
/- If tt, congruence closure will treat implicit instance arguments... |
7820e822438bc799008a0dd6383040a750a11c07 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/doc_string3.lean | 0789671623fb0405ee5135429a619c5486ac4172 | [
"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 | 299 | lean | /-!
Documentation header for test module
-/
/-- Documentation for x -/
def x := 10
namespace foo
/-!
Another block of documentation
for this example.
-/
/-- Documentation for y -/
def y := 20
end foo
/-!
Documentation footer
testing
-/
open tactic
run_cmd module_doc_strings >>= trace
|
202f1072335ff316656f9f1ff946723195a4d127 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/pkg/frontend/Frontend.lean | 211aebc82b5cdf00f15d83729df84f53fb39c543 | [
"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 | 79 | lean | import Frontend.RegisterOption
import Frontend.Import1
import Frontend.Import2
|
e5ef673cb03189f4e003dece2cffb62fcf532a10 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/category_theory/limits/shapes/kernel_pair.lean | d4a5048b72e99aadd6a72b1ebc3ff6af5ead4a11 | [
"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,401 | 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
import category_theory.limits.shapes.pullbacks
import category_theory.limits.shapes.regular_mono
/-!
# Kernel pairs
This... |
2b1e9f7839635cc9c6aefbec1807ccc3c10e2bdf | c9e78e68dc955b2325401aec3a6d3240cd8b83f4 | /src/pumpold.lean | b74f98067303769d6498422571c198e5d2ff77a6 | [] | no_license | loganrjmurphy/lean-strategies | 4b8dd54771bb421c929a8bcb93a528ce6c1a70f1 | 832ea28077701b977b4fc59ed9a8ce6911654e59 | refs/heads/master | 1,682,732,168,860 | 1,621,444,295,000 | 1,621,444,295,000 | 278,458,841 | 3 | 0 | null | 1,613,755,728,000 | 1,594,324,763,000 | Lean | UTF-8 | Lean | false | false | 4,967 | lean | import justification common_meta property_catalogue.LTL
import pump1
open interactive S A
variable {α : Type}
set_option pp.structure_instances_qualifier true
def local_input_name : string := "pump1_input_1"
def local_strat_name : string := "pump1_strat_1"
def local_prf_name : string := "pump1_prf_1"
def preamble... |
6afe41ca48924150e5769220390b9304e059e28b | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/category_theory/natural_transformation.lean | 2b9405dee4f9eb10d28e18928d2a88c99d0e2d49 | [
"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 | 2,782 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Tim Baumann, Stephen Morgan, Scott Morrison, Floris van Doorn
Defines natural transformations between functors.
Introduces notations
`τ.app X` for the components of natural transfo... |
95c5413ce5afe255fc6eb9df22db1c9d101c6661 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/unification_hints1.lean | 6e4ce71ba03f27ddda70e232c74184abc0dd1587 | [
"Apache-2.0"
] | permissive | soonhokong/lean | cb8aa01055ffe2af0fb99a16b4cda8463b882cd1 | 38607e3eb57f57f77c0ac114ad169e9e4262e24f | refs/heads/master | 1,611,187,284,081 | 1,450,766,737,000 | 1,476,122,547,000 | 11,513,992 | 2 | 0 | null | 1,401,763,102,000 | 1,374,182,235,000 | C++ | UTF-8 | Lean | false | false | 1,652 | lean | import data.list data.nat
open list nat
structure unification_constraint := {A : Type} (lhs : A) (rhs : A)
structure unification_hint := (pattern : unification_constraint) (constraints : list unification_constraint)
namespace toy
constants (A : Type.{1}) (f h : A → A) (x y z : A)
definition g [irreducible] (x y : A) ... |
5ef2542c128205dac5d3176eae606b9d10c5b663 | 947b78d97130d56365ae2ec264df196ce769371a | /stage0/src/Lean/Server/Snapshots.lean | c6e875d1f489adc3bd5f0ae800a5a3147308538b | [
"Apache-2.0"
] | permissive | shyamalschandra/lean4 | 27044812be8698f0c79147615b1d5090b9f4b037 | 6e7a883b21eaf62831e8111b251dc9b18f40e604 | refs/heads/master | 1,671,417,126,371 | 1,601,859,995,000 | 1,601,860,020,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,331 | lean | /-
Copyright (c) 2020 Wojciech Nawrocki. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Wojciech Nawrocki
-/
import Init.System.IO
import Lean.Elab.Import
import Lean.Elab.Command
/-! One can think of this module as being a partial reimplementation
of Lean.Elab.Fron... |
b269e2d94f0488de797cb0308a38e6fc52f0d73b | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/algebra/monoid_algebra/basic.lean | 9c3fb1b94437408b741395d67270a2a262f4769e | [
"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 | 58,641 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Yury G. Kudryashov, Scott Morrison
-/
import algebra.big_operators.finsupp
import linear_algebra.finsupp
import algebra.non_unital_alg_hom
/-!
# Monoid algebras
When ... |
58fa5bb8e88dd3d04f7b0d5e1709793edb61f6b0 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/field_theory/adjoin.lean | 24cc89792d68f277ea926484a0e15cc231485f9b | [
"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 | 46,289 | lean | /-
Copyright (c) 2020 Thomas Browning, Patrick Lutz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Thomas Browning, Patrick Lutz
-/
import field_theory.intermediate_field
import field_theory.separable
import field_theory.splitting_field.is_splitting_field
import ring... |
9d6d994e09997f1b9fb9ceb3a703034bea4890f5 | 2a2864136cf8f2871e86f5fd14e624e3daa8fd24 | /Monads/Functor.lean | 382a7fb4c31d101f6c3ec5fc5226c7b4436e4782 | [
"MIT"
] | permissive | hargoniX/lean-monads | d054ac71a351b7c86f318a477977cc166117b8ec | 2e87ca7ddf394641ea1b16bcbd8c384026d68e2f | refs/heads/main | 1,693,530,528,286 | 1,633,100,386,000 | 1,633,100,386,000 | 412,509,769 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,069 | lean | namespace Monads
/- Functors capture the notion of a regular computation being executed
on values that are within another type.
This type usually captures either the notion of a container, such
as a list, or a context for a computation, such as receiving data
from IO.-/
class Functor (f : Type u... |
80245ffc16fa859c6c7cb5b06b12c2aa13219a76 | e0f9ba56b7fedc16ef8697f6caeef5898b435143 | /src/data/int/gcd.lean | bf25fdddb0cc0445b947153c1f237c942827250d | [
"Apache-2.0"
] | permissive | anrddh/mathlib | 6a374da53c7e3a35cb0298b0cd67824efef362b4 | a4266a01d2dcb10de19369307c986d038c7bb6a6 | refs/heads/master | 1,656,710,827,909 | 1,589,560,456,000 | 1,589,560,456,000 | 264,271,800 | 0 | 0 | Apache-2.0 | 1,589,568,062,000 | 1,589,568,061,000 | null | UTF-8 | Lean | false | false | 5,134 | lean | /-
Copyright (c) 2018 Guy Leroy. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sangwoo Jo (aka Jason), Guy Leroy, Johannes Hölzl, Mario Carneiro
-/
import data.nat.prime
/-!
# Extended GCD and divisibility over ℤ
## Main definitions
* Given `x y : ℕ`, `xgcd x y` com... |
489f2ac0f853896cd1fb7a958cd2282e58c5e559 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/rel_tac1.lean | c562fd82e3e4a9bc67de1ce4dc826b8e80323581 | [
"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 | 409 | lean | open tactic
example (a b : nat) : a = a :=
by reflexivity
example (a : nat) (b : bool) : a == b → b == a :=
by do intros, symmetry, trace_state, assumption
#print "-----------"
example (a : nat) (b : bool) (c : string) : a == b → b == c → a == c :=
by do
intro_lst [`H1, `H2],
transitivity,
trace_state,
get_... |
35ed89357c89af340eae816643e3b5be841cdec5 | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/algebra/category/Module/subobject.lean | ddc4a791fc6a28d424509626333205c7923ce8cc | [
"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 | 2,164 | lean | /-
Copyright (c) 2021 Markus Himmel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel
-/
import algebra.category.Module.basic
import category_theory.subobject.well_powered
/-!
# Subobjects in the category of `R`-modules
We construct an explicit order isom... |
ee4af3a1ebbf225f3353c7b02e14b2ab023f7c42 | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/topology/metric_space/gromov_hausdorff_realized.lean | 6ee112e853d03aa674ac2193df690723b0b254fb | [
"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 | 26,581 | 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
Construction of a good coupling between nonempty compact metric spaces, minimizing
their Hausdorff distance. This construction is instrumental to study the Gromov... |
a048782e21876010eb96ff400eb42cfc1d4c9709 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/topology/dense_embedding.lean | af0d11c6b63c5476aceec07b111949786938e677 | [
"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 | 15,657 | lean | /-
Copyright (c) 2019 Reid Barton. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro, Patrick Massot
-/
import topology.separation
import topology.bases
/-!
# Dense embeddings
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to thi... |
1729d73e81e8f5d00098efa06f8b663346aba9ff | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/not_bug1.lean | ca36c686e6db943376c49acdda2cb5340f721ef2 | [
"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 | 368 | lean | import logic
open bool
constant list : Type.{1}
constant nil : list
constant cons : bool → list → list
infixr `::` := cons
notation `[` l:(foldr `,` (h t, cons h t) nil `]`) := l
check []
check [tt]
check [tt, ff]
check [tt, ff, ff]
check tt :: ff :: [tt, ff, ff]
check tt :: []
constants a b c : bool
check a :: b :... |
bc3bc161ac9e12df21ae5604b43f6a2c7c3d4967 | 0845ae2ca02071debcfd4ac24be871236c01784f | /library/init/control/monadfail.lean | dbd74d0bfd5ed88fbe344f2c6fbe9e3a4271a078 | [
"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 | 594 | 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
-/
prelude
import init.control.lift init.data.string.basic
universes u v
class MonadFail (m : Type u → Type v) :=
(fail {} : ∀ {a}, String → m a)
def matchF... |
16c388e445487fef0a8cdd36258bcc10dd720be1 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /archive/100-theorems-list/70_perfect_numbers.lean | bed8801c9aa47abfe986591b6f00f7d74e45f204 | [
"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,927 | lean | /-
Copyright (c) 2020 Aaron Anderson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson
-/
import number_theory.arithmetic_function
import number_theory.lucas_lehmer
import algebra.geom_sum
import ring_theory.multiplicity
/-!
# Perfect Numbers
This file ... |
fee7a56cb05df99c310308fc515af2d67941cb21 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/ring_theory/non_unital_subsemiring/basic.lean | 2368f132629a98aabb619edd25485b26b5ba624d | [
"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 | 34,150 | lean | /-
Copyright (c) 2022 Jireh Loreaux All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jireh Loreaux
-/
import algebra.ring.equiv
import algebra.ring.prod
import data.set.finite
import group_theory.submonoid.membership
import group_theory.subsemigroup.membership
import gr... |
9f2dedb69eab014be2adcbc551b3a052fc10ad86 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /library/init/native/config.lean | ab22bea2495b4cd11e0af01606fe7b87b2cfb16f | [
"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 | 294 | lean | /-
Copyright (c) 2016 Jared Roesch. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jared Roesch
-/
prelude
import init.data.bool.basic
namespace native
-- eventually expose all the options here
structure config :=
(debug : bool)
end native
|
8cf5409dbf7c368b72c589a7771c2831af9106b3 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/lean/run/offsetIssue.lean | 7bbc89a73d919ba0dce8f7364ea50d4292253465 | [
"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 | 438 | lean | def BV (n : Nat) := { a : Array Bool // a.size = n }
axiom foo {n m : Nat} (a : BV n) (b : BV m) : BV (n - m)
def test (x1 : BV 30002) (x2 : BV 30001) (y1 : BV 60004) (y2 : BV 60003) : Prop :=
foo x1 x2 = without_expected_type foo y1 y2
@[elabWithoutExpectedType]
axiom foo2 {n m : Nat} (a : BV n) (b : BV m) : BV (... |
8774dc630b196e41af7e0ebcd6976d6112b682de | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/mul_zero.lean | a6c4e71a472e973b7b5d84e2568b397ec74ba73b | [
"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 | 89 | lean | import data.nat
open nat
example (x : ℕ) : 0 = x * 0 :=
calc 0 = x * 0 : nat.mul_zero
|
679521cc902b19286a7f285ffcb4cf22c4d4bf1c | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/data/list/chain.lean | 286d204d5765653492fe5564bea3f26e740e3205 | [
"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 | 10,578 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Kenny Lau, Yury Kudryashov
-/
import data.list.pairwise
import logic.relation
universes u v
open nat
variables {α : Type u} {β : Type v}
namespace list
/- chain re... |
34d1c29f1e034595f0dd879ba869b7d2b059d57f | 367134ba5a65885e863bdc4507601606690974c1 | /src/topology/extend_from_subset.lean | 6854109e48afbaba0044ee34103694393b1317ac | [
"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,044 | lean | /-
Copyright (c) 2020 Anatole Dedecker. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Anatole Dedecker
-/
import topology.separation
/-!
# Extending a function from a subset
The main definition of this file is `extend_from A f` where `f : X → Y`
and ... |
32d08798f20b02551e4de4a80e5c582296cce838 | f3a5af2927397cf346ec0e24312bfff077f00425 | /src/game/world2/level4.lean | 3102493a5197d321a6ad2386bbfc80f3e94de66e | [
"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 | 902 | lean | import mynat.definition -- hide
import mynat.add -- hide
import game.world2.level3 -- hide
namespace mynat -- hide
/-
# Addition World
## Level 4: `add_comm` (boss level)
[boss battle music]
Look in Theorem statements -> Addition world to see the proofs you have.
These should be enough.
-/
/- Lemma
On the set of ... |
5383d3c02c96dbe575e03a71c570f2175fbd4d64 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tmp/new-frontend/parser/term.lean | a92f69cbccb4e6382cd75a90c387e50a18d81076 | [
"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 | 14,106 | lean | /-
Copyright (c) 2018 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Sebastian Ullrich
Term-Level parsers
-/
prelude
import init.lean.parser.level init.lean.parser.notation
import init.lean.expr
namespace Lean
namespace Parser
open Combinators P... |
ee371463ea204cfc3dc2c82ee36629f4d95d97ef | 4727251e0cd73359b15b664c3170e5d754078599 | /src/model_theory/semantics.lean | 494106eacdb121089e3bdf5b80308fec2f9b910e | [
"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 | 31,764 | 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.finset.basic
import model_theory.syntax
/-!
# Basics on First-Order Semantics
T... |
af4a6d6de3f7f3a863d76012b2cc626e7de1bfb6 | bb31430994044506fa42fd667e2d556327e18dfe | /src/topology/inseparable.lean | 48f4bc2623521f2cd0a0fe9731a9b4493e3f00cb | [
"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 | 20,028 | lean | /-
Copyright (c) 2021 Andrew Yang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Andrew Yang, Yury G. Kudryashov
-/
import topology.continuous_on
import data.setoid.basic
import tactic.tfae
/-!
# Inseparable points in a topological space
In this file we define
* `s... |
9c7f0c808e6aa5d79b07fae6464ff0e2d9c12fed | 3b880d8d9f5be25fbdaadb8860a1e6beac8e52a5 | /20170116_POPL/assoc/flat_assoc_trace.lean | 737c02d6d6f0fbfc48636da76b8ae908b4f868b3 | [
"Apache-2.0"
] | permissive | gebner/presentations | 29ea49abd3feb88e0a36d24ace38fbf5a3b939ad | 3b2149d19d6429c193965454d919e1b4eb1a44d8 | refs/heads/master | 1,609,598,807,163 | 1,484,466,986,000 | 1,484,466,986,000 | 78,720,148 | 0 | 0 | null | 1,484,206,190,000 | 1,484,206,190,000 | null | UTF-8 | Lean | false | false | 4,038 | lean | /-
In this file, we add tracing capabilities to
the flattening tactics we have defined at flat_assoc.lean.
-/
import data.set
open tactic expr
/- The command `declare_trace` add a new trace.flat_assoc option to Lean -/
declare_trace flat_assoc
/--
Return `some (a, b)` iff `e` is of the form `(op a b)`
-/
meta def is_... |
b81f49b351d6431c82de876aa0adc1bf7a0dc16e | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/topology/sheaves/sheaf_condition/equalizer_products.lean | eb5b673ba8e0d617026ddda033d8110b82b3d868 | [
"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 | 15,686 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.limits.shapes.equalizers
import category_theory.limits.shapes.products
import topology.sheaves.sheaf_condition.pairwise_intersections
/-!
# Th... |
e43e377383ef4af1caae377c015b7e8ebd279470 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/group_theory/perm/cycles.lean | 6b7b9326005fa3917eef7ae54b7d4d3036b0a59f | [] | 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,011 | lean | /-
Copyright (c) 2019 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.group_theory.perm.sign
import Mathlib.PostPort
universes u_2 u_1
namespace Mathlib
/-!
# Cy... |
79fc841c5f2372e968716395e70a718ffe5cdabb | ce89339993655da64b6ccb555c837ce6c10f9ef4 | /bluejam/chap3_exercise.lean | 90225f16d5dcedb2d0c7e96224d4e5bcd28e0438 | [] | no_license | zeptometer/LearnLean | ef32dc36a22119f18d843f548d0bb42f907bff5d | bb84d5dbe521127ba134d4dbf9559b294a80b9f7 | refs/heads/master | 1,625,710,824,322 | 1,601,382,570,000 | 1,601,382,570,000 | 195,228,870 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,225 | lean | open classical
variables p q r s : Prop
-- commutativity of ∧ and ∨
example : p ∧ q ↔ q ∧ p :=
iff.intro
(assume h: p ∧ q, show q ∧ p, from and.intro h.right h.left)
(assume h: q ∧ p, show p ∧ q, from and.intro h.right h.left)
lemma swap_or: p ∨ q → q ∨ p :=
assume hpq: p ∨ q,
show q ... |
ed024da843bd6dbe23a77592796e9b853c8bce04 | e0e64c424bf126977aef10e58324934782979062 | /src/wk2/notes/groups2.lean | 2a2eeeb0abca5ed82ff78ac9129974277094971a | [] | no_license | jamesa9283/LiaLeanTutor | 34e9e133a4f7dd415f02c14c4a62351bb9fd8c21 | c7ac1400f26eb2992f5f1ee0aaafb54b74665072 | refs/heads/master | 1,686,146,337,422 | 1,625,227,392,000 | 1,625,227,392,000 | 373,130,175 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,342 | lean | import ring_theory.unique_factorization_domain ring_theory.int.basic number_theory.divisors algebra.squarefree
section squarefree
variables {R : Type*}
/-- An element of a monoid is squarefree if the only squares that
divide it are the squares of units. -/
def squarefree' [monoid R] (r : R) : Prop := ∀ x : R, x * ... |
808fbb44d9fbfb9712890292fb9e9b86a53c9421 | 4b846d8dabdc64e7ea03552bad8f7fa74763fc67 | /library/init/meta/mk_dec_eq_instance.lean | d5f746d474fe8341faf660e3c95b768a3069a13f | [
"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 | 5,350 | 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
Helper tactic for showing that a type has decidable equality.
-/
prelude
import init.meta.contradiction_tactic init.meta.constructor_tactic
import init.meta.i... |
f1110a1bdf19dd26691dc1fa62a6c9b0573129ce | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch5/ex0405.lean | be015fd1255c219130478e2467218697eb7be48c | [] | 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 | 99 | lean | example (n : ℕ) : n + 1 = nat.succ n :=
begin
show nat.succ n = nat.succ n,
reflexivity,
end
|
d6753ec4e316a7ac9d7502a04a39a7c492c6c70f | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /tests/lean/run/class_bug1.lean | 6f41d9debcc8f50bf319195fc23ab6f30b7bfc87 | [
"Apache-2.0"
] | permissive | codyroux/lean | 7f8dff750722c5382bdd0a9a9275dc4bb2c58dd3 | 0cca265db19f7296531e339192e9b9bae4a31f8b | refs/heads/master | 1,610,909,964,159 | 1,407,084,399,000 | 1,416,857,075,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 943 | lean | import logic
inductive category (ob : Type) (mor : ob → ob → Type) : Type :=
mk : Π (comp : Π⦃A B C : ob⦄, mor B C → mor A B → mor A C)
(id : Π {A : ob}, mor A A),
(Π {A B C D : ob} {f : mor A B} {g : mor B C} {h : mor C D},
comp h (comp g f) = comp (comp h g) f) →
(Π {A B... |
80e2f13b6c4ad7d44ce056f92dbd059844fae958 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/control/uliftable.lean | beec5018a276ec9c93e4337162a82c7e886c48a8 | [
"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,577 | lean | /-
Copyright (c) 2020 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 control.monad.cont
import control.monad.writer
import data.equiv.basic
import tactic.interactive
/-!
# Universe lifting for type families... |
a3beffa7711b679e1ddf634c6a69f56ee92f6e6f | 5e3548e65f2c037cb94cd5524c90c623fbd6d46a | /src_icannos_totilas/topologie-espaces-normés/cpge_ten_12.lean | d7321b9cfa2427103d46690ebf35e6575a19bb57 | [] | no_license | ahayat16/lean_exos | d4f08c30adb601a06511a71b5ffb4d22d12ef77f | 682f2552d5b04a8c8eb9e4ab15f875a91b03845c | refs/heads/main | 1,693,101,073,585 | 1,636,479,336,000 | 1,636,479,336,000 | 415,000,441 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 612 | lean | import data.set.basic
import topology.basic
import algebra.module.basic
import algebra.module.submodule
import order.complete_lattice
import analysis.normed_space.basic
import linear_algebra.finite_dimensional
-- Soient E un espace vectoriel normé, F un sous-espace fermé de E et G un
-- sous-espace vectoriel de d... |
6d2933fb85ef38e7a2921a349397f2c76541a7aa | 6305b69bc7636a761e1a1947508bb5ebad93cb7e | /library/init/data/list/basic.lean | 73b196c50000b617934a564d40aa8e2f95cdfa91 | [
"Apache-2.0"
] | permissive | HGldJ1966/lean | e7f0068f8a69fde3593b77d8a44609ae446d7738 | 049d940167c419cd5935d12b459c0695d8615ae9 | refs/heads/master | 1,611,340,395,700 | 1,503,103,829,000 | 1,503,103,829,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,548 | 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.logic init.data.nat.basic init.data.bool.basic
open decidable list
universes u v w
instance (α : Type u) : inhabited (list α) :=
⟨list.... |
0c0ea6eca51eb8c83aa8bb1c3ef08b2c9aedb467 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /src/Lean/Elab/Arg.lean | 08d1d8273c0e5aa383c450e7a026e5008c1430fa | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | cipher1024/lean4 | 6e1f98bb58e7a92b28f5364eb38a14c8d0aae393 | 69114d3b50806264ef35b57394391c3e738a9822 | refs/heads/master | 1,642,227,983,603 | 1,642,011,696,000 | 1,642,011,696,000 | 228,607,691 | 0 | 0 | Apache-2.0 | 1,576,584,269,000 | 1,576,584,268,000 | null | UTF-8 | Lean | false | false | 2,174 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Elab.Term
namespace Lean.Elab.Term
/--
Auxiliary inductive datatype for combining unelaborated syntax
and already elaborated expressions. ... |
963e38ba81b985da1e37263c57806b9a32d10291 | 5a5e1bb8063d7934afac91f30aa17c715821040b | /lean3SOS/src/float/sqrt.lean | e5a4c85968ff5c6edb84a80c9b568eeb70ebcb37 | [] | no_license | ramonfmir/leanSOS | 1883392d73710db5c6e291a2abd03a6c5b44a42b | 14b50713dc887f6d408b7b2bce1f8af5bb619958 | refs/heads/main | 1,683,348,826,105 | 1,622,056,982,000 | 1,622,056,982,000 | 341,232,766 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,202 | lean | import data.int.sqrt
import data.int.parity
import data.rat.sqrt
import float.basic
namespace float_raw
def sqrt (f : float_raw) : float_raw :=
if (even f.e)
then ⟨int.sqrt f.m, f.e / 2⟩
else ⟨int.sqrt (f.m * 2), (f.e - 1) / 2⟩
end float_raw
namespace float
-- lemmas
lemma to_rat.num_neg_exp (f : float_raw) (h... |
6940807e8dfe49d95c6bee4e1699bdf5844a0ad3 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/order/partition/finpartition.lean | 820ff9b7ed432d38ea0cf01fd9a978830c4b7081 | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 18,573 | lean | /-
Copyright (c) 2022 Yaël Dillies, Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies, Bhavik Mehta
-/
import algebra.big_operators.basic
import order.atoms
import order.locally_finite
import order.sup_indep
/-!
# Finite partitions
In this fil... |
4e65d2bffbec469953fca569c10e5b3498cf9668 | efa51dd2edbbbbd6c34bd0ce436415eb405832e7 | /20161026_ICTAC_Tutorial/ex30.lean | 8ea5f7d507d6179059c1cf51bc54997b765fdc56 | [
"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 | 389 | lean | theorem t1 (p q : Prop) : p → q → p :=
λ (hp : p) (hq : q), hp
variables p q r s : Prop
check t1 p q -- p → q → p
check t1 r s -- r → s → r
check t1 (r → s) (s → r) -- (r → s) → (s → r) → r → s
variable h : r → s
check t1 (r → s) (s → r) h -- (s → r) → r → s
premise h' : r → s
chec... |
d67ff6bf779ac8892edeba959b72a91863f5afd7 | 859855170b866e395d328ebb28c4e060aa5559e8 | /src/solutions/05_sequence_limits.lean | c613fb9b7223083a37211c5c945d36b08128fe3c | [
"Apache-2.0"
] | permissive | bradheintz/tutorials | 1be40c9e97a484441f268ea8504c3d74534162cf | 02f15b400478de7278f4baa08935befd0f3986ef | refs/heads/master | 1,688,028,802,367 | 1,627,863,284,000 | 1,627,863,284,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,635 | lean | import data.real.basic
import algebra.group.pi
import tuto_lib
notation `|`x`|` := abs x
/-
In this file we manipulate the elementary definition of limits of
sequences of real numbers.
mathlib has a much more general definition of limits, but here
we want to practice using the logical operators and relations
covered... |
6feac587f22d43d94a20fa703d8592c798263ff0 | 46125763b4dbf50619e8846a1371029346f4c3db | /src/topology/algebra/uniform_ring.lean | 727bf82e1678274f27f8be9383c460d3725ba3ca | [
"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 | 7,494 | 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
Theory of topological rings with uniform structure.
-/
import topology.algebra.group_completion topology.algebra.ring
open classical set lattice filte... |
3018d9ffd46950f999430fa9f7b714b4fe6ff480 | 4fa161becb8ce7378a709f5992a594764699e268 | /src/measure_theory/borel_space.lean | 8c259c91cac66fc5c7e338ff985b48256b50724e | [
"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 | 29,418 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Yury Kudryashov
-/
import measure_theory.measurable_space
import topology.instances.ennreal
import analysis.normed_space.basic
/-!
# Borel (measurable) space
## Main ... |
92432cb2beeef7f6e9bbeb15dd1cb9f907a8524b | acc85b4be2c618b11fc7cb3005521ae6858a8d07 | /tactic/finish.lean | f5867bb2c4986754b3215ecf8d63241185b92ed1 | [
"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 | 15,468 | lean | /-
Copyright (c) 2017 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
These tactics do straightforward things: they call the simplifier, split conjunctive assumptions,
eliminate existential quantifiers on the left, and look for contradictio... |
de88a1a4372dde72ad29a2822ebbc91213811e76 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/eliminatorImplicitTargets.lean | 83548111f87d3a521a862da020dd1b2859c485be | [
"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 | 494 | lean | inductive Equality {α : Type u} : α → α → Type u
| refl {a : α} : Equality a a
open Equality
@[eliminator]
def ind {α : Type u} (motive : ∀ (a b : α) (p : Equality a b), Sort v)
{a : α} (πrefl : motive a a refl) {b : α} (p : Equality a b) : motive a b p :=
@Equality.casesOn α a (λ b p => motive a a refl → motive a ... |
e06095d6d05e78bd509b275509b5e414b326d2a4 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/category_theory/abelian/injective.lean | bf89fc5c7b7ca7ca941902ff093d051649a7a61c | [
"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 | 1,503 | lean | /-
Copyright (c) 2022 Jakob von Raumer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jakob von Raumer
-/
import category_theory.abelian.exact
import category_theory.preadditive.injective
import category_theory.preadditive.yoneda.limits
import category_theory.preaddi... |
96fc0cadc11fdd8ff58b37c45bc18635f3f3b1cd | 737dc4b96c97368cb66b925eeea3ab633ec3d702 | /src/Lean/Elab/Tactic/Conv.lean | 637998311ecf7588121b0e94d7dadf68734149e2 | [
"Apache-2.0"
] | permissive | Bioye97/lean4 | 1ace34638efd9913dc5991443777b01a08983289 | bc3900cbb9adda83eed7e6affeaade7cfd07716d | refs/heads/master | 1,690,589,820,211 | 1,631,051,000,000 | 1,631,067,598,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 378 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Elab.Tactic.Conv.Basic
import Lean.Elab.Tactic.Conv.Congr
import Lean.Elab.Tactic.Conv.Rewrite
import Lean.Elab.Tactic.Conv.Change
import Lean.E... |
26109c0588cd69ecdd289b7ec96c5d7eab47b1a8 | 91b8df3b248df89472cc0b753fbe2bac750aefea | /experiments/lean/src/ddl/host/formation.lean | 5e669dbacc528bef3e369545818c05becc1c9936 | [
"Apache-2.0",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | yeslogic/fathom | eabe5c4112d3b4d5ec9096a57bb502254ddbdf15 | 3960a9466150d392c2cb103c5cb5fcffa0200814 | refs/heads/main | 1,685,349,769,736 | 1,675,998,621,000 | 1,675,998,621,000 | 28,993,871 | 214 | 11 | Apache-2.0 | 1,694,044,276,000 | 1,420,764,938,000 | Rust | UTF-8 | Lean | false | false | 1,303 | lean | import ddl.host.typing
namespace ddl.host
open ddl
open ddl.host
namespace type
variables {ℓ : Type} [decidable_eq ℓ]
inductive struct : type ℓ → Prop
| nil {} : struct struct_nil
| cons {l t₁ t₂} : struct (struct_cons l t₁ t₂)
inductive union : type ℓ → Prop
| nil {} : union ... |
5e4a139690248d306354f635553c2ac3360e57e8 | 618003631150032a5676f229d13a079ac875ff77 | /src/tactic/omega/nat/main.lean | 06d462e48775e6430d3575d982f69e41f6e9b574 | [
"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,998 | lean | /- Copyright (c) 2019 Seul Baek. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Seul Baek
Main procedure for linear natural number arithmetic. -/
import tactic.omega.prove_unsats
import tactic.omega.nat.dnf
import tactic.omega.nat.neg_elim
import tactic.omega.nat.sub_e... |
f6b67b89d353ff152b623e2bf82c70554af5635a | 037dba89703a79cd4a4aec5e959818147f97635d | /src/2020/problem_sheets/sheet1.lean | e2154fbd7855b8286fed0681aee23b14b1225a7d | [] | 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 | 3,048 | lean | /- Math40001 : Introduction to university mathematics.
Problem Sheet 1, October 2020.
This is a Lean file. It can be read with the Lean theorem prover.
You can work on this file online at the following URL:
or you can install Lean and its maths library following the
instructions at
https://leanprover-community.git... |
d3e01666fc0cb2c3f5eb7714192469b6dd7b6d7b | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/category_theory/natural_isomorphism.lean | 2c2098d562bf9936f1a41a7b880921ffd5d65467 | [
"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 | 5,438 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Tim Baumann, Stephen Morgan, Scott Morrison, Floris van Doorn
-/
import category_theory.functor_category
import category_theory.isomorphism
open category_theory
universes v₁ v₂ v₃ v₄... |
d9ce57387b0e6dbabf13c2a038ed57c78fc81b21 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/ring_theory/discrete_valuation_ring/tfae.lean | bae86b2c29902dea1f2c1855efec835b9f0deef6 | [
"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 | 11,403 | lean | /-
Copyright (c) 2022 Andrew Yang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Andrew Yang
-/
import ring_theory.ideal.cotangent
import ring_theory.dedekind_domain.basic
import ring_theory.valuation.valuation_ring
import ring_theory.nakayama
/-!
# Equivalent condi... |
3d7fddf53f50d908adaf5ce8b1423dc27a6d045b | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/server/init_exit_worker.lean | 1032ffc90873156edaae71ea31b5d7fa37ec0c3c | [
"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 | 446 | lean | import Lean.Data.Lsp
open IO Lean Lsp
def main : IO Unit := do
Ipc.runWith (←IO.appPath) #["--worker"] do
let hIn ← Ipc.stdin
hIn.write (←FS.readBinFile "init_vscode_1_47_2.log")
hIn.flush
hIn.write (←FS.readBinFile "open_empty.log")
hIn.flush
let diags ← Ipc.collectDiagnostics 1 "file:///em... |
4e18716c2d1b6783ded533f33f301e96a760df3b | 30b012bb72d640ec30c8fdd4c45fdfa67beb012c | /tactic/alias.lean | c487c439f9e98e58e8332338ae47cc04ee5c7754 | [
"Apache-2.0"
] | permissive | kckennylau/mathlib | 21fb810b701b10d6606d9002a4004f7672262e83 | 47b3477e20ffb5a06588dd3abb01fe0fe3205646 | refs/heads/master | 1,634,976,409,281 | 1,542,042,832,000 | 1,542,319,733,000 | 109,560,458 | 0 | 0 | Apache-2.0 | 1,542,369,208,000 | 1,509,867,494,000 | Lean | UTF-8 | Lean | false | false | 4,414 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
This file defines an alias command, which can be used to create copies
of a theorem or definition with different names.
Syntax:
/ -- doc string - /
alias my_theorem ←... |
37d2e7dc112fa68bfa902c8f99fb2d400685d8a6 | df7bb3acd9623e489e95e85d0bc55590ab0bc393 | /lean/love09_hoare_logic_exercise_sheet.lean | 19a5979845bf618e424a2a2457d00d1b38bf55bd | [] | no_license | MaschavanderMarel/logical_verification_2020 | a41c210b9237c56cb35f6cd399e3ac2fe42e775d | 7d562ef174cc6578ca6013f74db336480470b708 | refs/heads/master | 1,692,144,223,196 | 1,634,661,675,000 | 1,634,661,675,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,982 | lean | import .love09_hoare_logic_demo
/- # LoVe Exercise 9: Hoare Logic -/
set_option pp.beta true
set_option pp.generalized_field_notation false
namespace LoVe
/- ## Question 1: Program Verification
The following WHILE program is intended to compute the Gaussian sum up to `n`,
leaving the result in `r`. -/
def GAUS... |
2c52b94b7e0855f4e5597c66fef646e5bca7ee6d | 02005f45e00c7ecf2c8ca5db60251bd1e9c860b5 | /src/order/basic.lean | c76161715b015f75a28923e23568c8f0d3d4c63b | [
"Apache-2.0"
] | permissive | anthony2698/mathlib | 03cd69fe5c280b0916f6df2d07c614c8e1efe890 | 407615e05814e98b24b2ff322b14e8e3eb5e5d67 | refs/heads/master | 1,678,792,774,873 | 1,614,371,563,000 | 1,614,371,563,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 23,946 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Mario Carneiro
-/
import data.subtype
import data.prod
open function
/-!
# Basic definitions about `≤` and `<`
## Definitions
### Predicates on functions
- `monotone... |
929cc606269eecfaa8846b19ce63e08af2c085dc | 367134ba5a65885e863bdc4507601606690974c1 | /src/linear_algebra/finsupp.lean | 3eddf5eb1660ac7d5cf4ed7f8892ef4940b51ced | [
"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 | 26,096 | lean | /-
Copyright (c) 2019 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Johannes Hölzl
-/
import data.finsupp.basic
import linear_algebra.basic
/-!
# Properties of the semimodule `α →₀ M`
Given an `R`-semimodule `M`, the `R`-semimodule structure on `α →₀ ... |
3c1305199376fa19f75d0fa0141092639889340a | 995658a556256a6694fe5c98b91f7f6f6c11bb77 | /src/basic.lean | ab1608cef250b3fb1bd7cba2d51e0b2d452f07c5 | [
"MIT"
] | permissive | bhgomes/lean-riemann-hypothesis | d803047f27ea21f03414bbfb59395608ed0bc05f | c36b744a2dc4a7a50c7de770096bd9a051f42ab9 | refs/heads/master | 1,678,533,614,591 | 1,614,755,910,000 | 1,614,755,910,000 | 275,204,877 | 16 | 3 | null | null | null | null | UTF-8 | Lean | false | false | 37,083 | lean | /- ------------------------------------------------------------------------- -|
| @project: riemann_hypothesis |
| @file: basic.lean |
| @authors: Brandon H. Gomes, Alex Kontorovich |
... |
6d0730509f5b69ed499c8e56ce1e3fd1220e4bdb | ff5230333a701471f46c57e8c115a073ebaaa448 | /library/init/wf.lean | cbcb0468509498baea5e76b7fcc48af7a0f30c75 | [
"Apache-2.0"
] | permissive | stanford-cs242/lean | f81721d2b5d00bc175f2e58c57b710d465e6c858 | 7bd861261f4a37326dcf8d7a17f1f1f330e4548c | refs/heads/master | 1,600,957,431,849 | 1,576,465,093,000 | 1,576,465,093,000 | 225,779,423 | 0 | 3 | Apache-2.0 | 1,575,433,936,000 | 1,575,433,935,000 | null | UTF-8 | Lean | false | false | 7,351 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
prelude
import init.data.nat.basic init.data.prod
universes u v
inductive acc {α : Sort u} (r : α → α → Prop) : α → Prop
| intro (x : α) (h : ∀ y, r y x → ... |
fae8f244cc187c490b8d89ede10956a4dab545e1 | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/data/multiset/antidiagonal.lean | ce060a90e14e17ee07028247fb507c3f273e8bcd | [
"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 | 2,987 | 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.multiset.powerset
/-!
# The antidiagonal on a multiset.
The antidiagonal of a multiset `s` consists of all pairs `(t₁, t₂)`
such that `t₁ + t₂ = s`. The... |
536829aeee6f1fe840e0937fb9951d9fdd59c25e | ddf69e0b8ad10bfd251aa1fb492bd92f064768ec | /src/measure_theory/measurable_space.lean | d8b122e6c95b5e396830f1178ddaa01051cd1709 | [
"Apache-2.0"
] | permissive | MaboroshiChan/mathlib | db1c1982df384a2604b19a5e1f5c6464c7c76de1 | 7f74e6b35f6bac86b9218250e83441ac3e17264c | refs/heads/master | 1,671,993,587,476 | 1,601,911,102,000 | 1,601,911,102,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 54,182 | 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 data.set.disjointed
import data.set.countable
import data.indicator_function
import data.equiv.encodable.lattice
import order.filter.basic
/-!... |
dc1bbde24b68910ad1e9f606c84a7c987b9e0ade | 94e33a31faa76775069b071adea97e86e218a8ee | /test/matrix.lean | 44cc83a135b9b7c0510c808c8420b56db30d8fdc | [
"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,003 | lean | import data.matrix.notation
import linear_algebra.matrix.determinant
import group_theory.perm.fin
import tactic.norm_swap
variables {α β : Type} [semiring α] [ring β]
namespace matrix
open_locale matrix
/-! Test that the dimensions are inferred correctly, even for empty matrices -/
section dimensions
set_option pp... |
22b2f9367e7fbac231e6e60beaf4cf95deb15adc | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/algebra/associated.lean | f2abcb4255a80f5e01d745850e5bcb6d0f21aeb3 | [
"Apache-2.0"
] | permissive | troyjlee/mathlib | e18d4b8026e32062ab9e89bc3b003a5d1cfec3f5 | 45e7eb8447555247246e3fe91c87066506c14875 | refs/heads/master | 1,689,248,035,046 | 1,629,470,528,000 | 1,629,470,528,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 28,809 | 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, Jens Wagemaker
-/
import data.multiset.basic
import algebra.divisibility
import algebra.invertible
/-!
# Associated, prime, and irreducible elements.
-/
variables {α ... |
d5d80708536ea4ae7c383c69edd7c276a69d72fc | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /src/group_theory/perm/cycles.lean | f6eff1556b4e92c590933aeeb999a3c48b97c6d6 | [
"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 | 58,426 | lean | /-
Copyright (c) 2019 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import data.nat.parity
import data.equiv.fintype
import group_theory.perm.sign
import data.finset.noncomm_prod
/-!
# Cyclic permutations
## Main definitions
In the foll... |
dff6902ea59f5582add661e1624edc9dd574f055 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /counterexamples/cyclotomic_105.lean | 9499e39f118ac2bee738e8167b9612de79e858f0 | [
"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 | 3,857 | lean | /-
Copyright (c) 2021 Riccardo Brasca. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Riccardo Brasca
-/
import ring_theory.polynomial.cyclotomic.basic
/-!
# Not all coefficients of cyclotomic polynomials are -1, 0, or 1
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> ... |
228febbdb14867909f084723fe975e52311fbd22 | ad0c7d243dc1bd563419e2767ed42fb323d7beea | /algebra/module.lean | 61cad55e90b170243643398fa1408888242c10a3 | [
"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 | 12,065 | lean | /-
Copyright (c) 2015 Nathaniel Thomas. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nathaniel Thomas, Jeremy Avigad, Johannes Hölzl
Modules over a ring.
-/
import algebra.ring algebra.big_operators data.set.lattice
open function
universes u v w x
variables {α : T... |
8797714f2b81214b72e1fbbaf006711475448792 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/playground/usizeBug.lean | d97c66de8b488a3897d6a173a62a0a2a994152e4 | [
"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 | 136 | lean | structure S :=
(n : Nat)
(u : USize)
@[noinline] def f (u : USize) : S :=
{ n := 0, u := u }
def main : IO Unit :=
IO.println (f 2).u
|
054febfbf63eb3f46fb9e1d72f36184e565b82e5 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/category_theory/limits/fubini.lean | d646586ed4111b9a8b12a8f4e0e1844b2cf513cb | [
"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,993 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.limits.has_limits
import category_theory.products.basic
import category_theory.currying
/-!
# A Fubini theorem for categorical limits
We prov... |
9aa53cde9f35680122f0998409e0769c833a14c8 | 27a31d06bcfc7c5d379fd04a08a9f5ed3f5302d4 | /stage0/src/Lean/Server/FileWorker.lean | aa8bb94641dc7a1e5d58d6d0c5ee29e7375609c1 | [
"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 | joehendrix/lean4 | 0d1486945f7ca9fe225070374338f4f7e74bab03 | 1221bdd3c7d5395baa451ce8fdd2c2f8a00cbc8f | refs/heads/master | 1,640,573,727,861 | 1,639,662,710,000 | 1,639,665,515,000 | 198,893,504 | 0 | 0 | Apache-2.0 | 1,564,084,645,000 | 1,564,084,644,000 | null | UTF-8 | Lean | false | false | 21,395 | lean | /-
Copyright (c) 2020 Marc Huisinga. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Marc Huisinga, Wojciech Nawrocki
-/
import Init.System.IO
import Std.Data.RBMap
import Lean.Environment
import Lean.Data.Lsp
import Lean.Data.Json.FromToJson
import Lean.Util.Paths
... |
c8bdc4430d6266af247a1fff7d0b039680a757fd | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/over_notation.lean | 9bba96e9d70c5e6fffb649567fd63b4bb7438613 | [
"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 | 364 | lean | constant f : nat → nat → nat
constant g : string → string → string
infix ` & `:60 := f
infix ` & `:60 := g
set_option pp.notation false
check 0 & 1
check "a" & "b"
check tt & ff
notation `[[`:max l:(foldr `, ` (h t, f h t) 0 `]]`:0) := l
notation `[[`:max l:(foldr `, ` (h t, g h t) "" `]]`:0) := l
check [[ (1:nat)... |
5cefbd1eba0a6ac57a9e0ee9a5467576207f4ddc | 64874bd1010548c7f5a6e3e8902efa63baaff785 | /hott/algebra/precategory/functor.hlean | 1617b901f97b69c3e6f26760702da671de41daa7 | [
"Apache-2.0"
] | permissive | tjiaqi/lean | 4634d729795c164664d10d093f3545287c76628f | d0ce4cf62f4246b0600c07e074d86e51f2195e30 | refs/heads/master | 1,622,323,796,480 | 1,422,643,069,000 | 1,422,643,069,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,955 | hlean | -- Copyright (c) 2014 Floris van Doorn. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Floris van Doorn, Jakob von Raumer
import .basic types.pi
open function precategory eq prod equiv is_equiv sigma sigma.ops truncation
open pi
structure functor (C D : Precat... |
865ea13d612d93fa0c6ba73434d7e5d6acb9bc91 | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/data/nat/totient.lean | de46894cf28f51a22b3cf213b723eed4dfa60298 | [
"Apache-2.0"
] | permissive | rmitta/mathlib | 8d90aee30b4db2b013e01f62c33f297d7e64a43d | 883d974b608845bad30ae19e27e33c285200bf84 | refs/heads/master | 1,585,776,832,544 | 1,576,874,096,000 | 1,576,874,096,000 | 153,663,165 | 0 | 2 | Apache-2.0 | 1,544,806,490,000 | 1,539,884,365,000 | Lean | UTF-8 | Lean | false | false | 3,595 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import algebra.big_operators data.nat.gcd
open finset
namespace nat
def totient (n : ℕ) : ℕ := ((range n).filter (nat.coprime n)).card
localized "notation `φ` := nat.... |
624f16b94f6d69a66b84a7268532430988d32041 | 02005f45e00c7ecf2c8ca5db60251bd1e9c860b5 | /src/data/mv_polynomial/comm_ring.lean | b737acc26dff0f2e7fc968d35ebdad7c3b9475ae | [
"Apache-2.0"
] | permissive | anthony2698/mathlib | 03cd69fe5c280b0916f6df2d07c614c8e1efe890 | 407615e05814e98b24b2ff322b14e8e3eb5e5d67 | refs/heads/master | 1,678,792,774,873 | 1,614,371,563,000 | 1,614,371,563,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,022 | 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, Johan Commelin, Mario Carneiro
-/
import data.mv_polynomial.variables
/-!
# Multivariate polynomials over a ring
Many results about polynomials hold when the coeffic... |
d18872be1739b8dc876958253c224a8a0511e72a | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/data/list/count.lean | b4479638e6b4737d1f9215ecc35fb5a74bcfbd6d | [
"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 | 8,736 | 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
-/
import data.list.big_operators
/-!
# Counting in lists
This file proves basic properties of ... |
94bd38f1f36055486249e5f74ed939762d0aeaff | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/playground/task_test.lean | 636ce43bc335c110ad0866bcd10e364c2664aeb4 | [
"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 | 515 | lean | def g (x : Nat) : Nat :=
dbgTrace ("g: " ++ toString x) $ fun _ =>
x + 1
def f1 (x : Nat) : Nat :=
dbgSleep 1000 $ fun _ =>
dbgTrace ("f1: " ++ toString x) $ fun _ =>
g (x + 1)
def f2 (x : Nat) : Nat :=
dbgSleep 100 $ fun _ =>
dbgTrace ("f2: " ++ toString x) $ fun _ =>
g x
def main (xs : List String) : IO UIn... |
6316936b4bcc59d532ea3605c8ed358ad9a9ef8b | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/data/list/basic.lean | 1dca88a4290fc695896376d60e94d2a90d835f11 | [
"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 | 159,631 | 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
-/
import data.nat.basic
/-!
# Basic properties of lists
-/
open function nat (hiding one_pos)
... |
b961790939f735cec85aca9539816971cd12ce80 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /stage0/src/Lean/ParserCompiler.lean | 5a5440d80351c3d2aceb27a152efabb3ff486e0c | [
"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 | 7,557 | lean | /-
Copyright (c) 2020 Sebastian Ullrich. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
-/
import Lean.Util.ReplaceExpr
import Lean.Meta.Basic
import Lean.Meta.ReduceEval
import Lean.Meta.WHNF
import Lean.ParserCompiler.Attribute
import Lean.Parser.Ex... |
82475e7cf8d4bad15b86c3611467c7d7b44cf4ba | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/analysis/ODE/gronwall.lean | f603ab7b77d7e0d83c37c2aa66ebcc20d4426dab | [
"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 | 13,229 | 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 analysis.calculus.mean_value
import analysis.special_functions.exp_log
/-!
# Grönwall's inequality
The main technical result of this file is the Grönwall-l... |
296a9e08d5c76501ae0731297203d30093a44187 | 95dcf8dea2baf2b4b0a60d438f27c35ae3dd3990 | /src/algebra/punit_instances.lean | 1478559f48a3e7cd8fcac69895cf8b6ac06afa25 | [
"Apache-2.0"
] | permissive | uniformity1/mathlib | 829341bad9dfa6d6be9adaacb8086a8a492e85a4 | dd0e9bd8f2e5ec267f68e72336f6973311909105 | refs/heads/master | 1,588,592,015,670 | 1,554,219,842,000 | 1,554,219,842,000 | 179,110,702 | 0 | 0 | Apache-2.0 | 1,554,220,076,000 | 1,554,220,076,000 | null | UTF-8 | Lean | false | false | 3,469 | lean | /-
Copyright (c) 2019 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
Instances on punit.
-/
import order.basic
import algebra.module algebra.group
universes u
open lattice
namespace punit
variables (x y : punit.{u+1}) (s : set punit.{u+1})
in... |
a224ff6ecc6e57110e34d48241efd8a83cc7a369 | 367134ba5a65885e863bdc4507601606690974c1 | /src/measure_theory/bochner_integration.lean | 4dc767c6dce3accfcdbee2890903bfb5734a2eae | [
"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 | 67,825 | 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, Sébastien Gouëzel
-/
import measure_theory.simple_func_dense
import analysis.normed_space.bounded_linear_maps
import measure_theory.l1_space
import topol... |
ca09401d18160ba1f54e4694ed891aaa5d55e299 | 43390109ab88557e6090f3245c47479c123ee500 | /src/Euclid_old/Euclids_Props.lean | 06410d529de15ca644147fc22bc425c8afe7afd6 | [
"Apache-2.0"
] | permissive | Ja1941/xena-UROP-2018 | 41f0956519f94d56b8bf6834a8d39473f4923200 | b111fb87f343cf79eca3b886f99ee15c1dd9884b | refs/heads/master | 1,662,355,955,139 | 1,590,577,325,000 | 1,590,577,325,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,194 | lean | import Euclid.axioms
open Euclidean_plane
variables {point : Type} [Euclidean_plane point]
theorem prop1 (a b : point) : ∃ c, eqd a b a c → eqd a b b c := sorry
theorem prop2 (a b c : point) : ∃ d, eqd a d b c := sorry
theorem prop3 (a b c d : point) (h : ¬eqd a b c d) : (∃ x, B a x b → eqd a x c d) ∨ (∃ x, B c x d → ... |
3fd26710ebbe256832bb969399027306ca3003b1 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/back3.lean | 25f7a44daf90aeca18d690f6cec48d6e290da669 | [
"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 | 1,277 | lean | /- Lean has a backward chaining tactic that can be configured using
attributes. -/
open list tactic
universe variable u
lemma in_tail {α : Type u} {a : α} (b : α) {l : list α} : a ∈ l → a ∈ b::l := mem_cons_of_mem _
lemma in_head {α : Type u} (a : α) (l : list α) : a ∈ a::l := me... |
59fa7d3a877f67fb249dda30d5dcf9b9b81990c9 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /src/Lean/Log.lean | 55793e7c535b946103a3f1f78187c3014442a1bc | [
"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 | 4,383 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Util.Sorry
namespace Lean
/--
The `MonadLog` interface for logging error messages.
-/
class MonadLog (m : Type → Type) extends MonadFileMap m ... |
17672359f98050f515751db149165e353397b6e3 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/lake/Lake/Util/EquipT.lean | 918161b74ec6747e366ad211eba463706b7c744b | [
"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,915 | lean | /-
Copyright (c) 2022 Mac Malone. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mac Malone
-/
namespace Lake
/--
A monad transformer that equips a monad with a value.
This is a generalization of `ReaderT` where the value is not
necessarily directly readable through t... |
3d5ec7b9657e86e44e0f4f7abd9b004ffda1fb6c | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/algebra/ordered_group.lean | 04250eaa45ae4bec3a6a679505e5495c2b75c7b9 | [
"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 | 45,727 | 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, Mario Carneiro, Johannes Hölzl
-/
import algebra.ordered_monoid
import order.order_dual
/-!
# Ordered groups
This file develops the basics of ordered... |
c72837e3d8beb298d4c36bff7017ba5ba309417c | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/order/succ_pred/relation.lean | 31eacfbe6c891deafe91d83a62f22a222d714a88 | [
"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 | 6,786 | lean | /-
Copyright (c) 2022 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
-/
import order.succ_pred.basic
/-!
# Relations on types with a `succ_order`
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresp... |
2d3d6b2451cd5a13d7b65e383b0672087945e85d | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /stage0/src/Lean/Util/FindExpr.lean | ef36cd64c96c617f2d2e0e811221f9d8b3218c23 | [
"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 | 3,734 | 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.Expr
namespace Lean
namespace Expr
namespace FindImpl
abbrev cacheSize : USize := 8192
structure State where
keys : Array Expr -- Remark: ... |
fcab812d33e9da79d744caedad7f6307a7675430 | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /tests/lean/calc1.lean | 28a3986f803d4eb0350bd9e340ea8539a4579f34 | [
"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 | 1,570 | lean | prelude constant A : Type.{1}
definition bool : Type.{1} := Type.{0}
constant eq : A → A → bool
infixl `=`:50 := eq
axiom subst (P : A → bool) (a b : A) (H1 : a = b) (H2 : P a) : P b
axiom eq_trans (a b c : A) (H1 : a = b) (H2 : b = c) : a = c
axiom eq_refl (a : A) : a = a
constant le : A → A → bool
infixl `≤`:50 := le... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.