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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
dc1fd0cc0cf0b255bbc48611905b801607268333 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebra/group_power/order.lean | aa2ab3534f216861cc1ea9cc528524c027f28529 | [
"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 | 15,237 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Robert Y. Lewis
-/
import algebra.order.ring
import algebra.group_power.basic
/-!
# Lemmas about the interaction of power operations with order
Note that some lemmas ar... |
f2d48e020717ec9e0764cd3054d7980168d55fd4 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/data/polynomial/ring_division.lean | dc316738a09c8e618aa30c0e8ac21723dafdd643 | [
"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 | 34,132 | 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, Johan Commelin
-/
import data.polynomial.algebra_map
import data.polynomial.degree.lemmas
import data.polynomial.div
import ... |
21c65eb296cca30699f61e997462a2239bb7bb8e | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/data/multiset/sum.lean | 40c4c9f4d18c1dab33ea79503c140dffebc3588f | [
"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 | 3,137 | lean | /-
Copyright (c) 2022 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies
-/
import data.multiset.nodup
/-!
# Disjoint sum of multisets
This file defines the disjoint sum of two multisets as `multiset (α ⊕ β)`. Beware not to confuse
with the `mu... |
1aa35c3262bfce068d280461eb0dc30278544b2c | c777c32c8e484e195053731103c5e52af26a25d1 | /src/category_theory/cofiltered_system.lean | 73df182bb6ee8a39d5d0e37f7a429ec827bf64bc | [
"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 | 15,911 | lean | /-
Copyright (c) 2022 Kyle Miller, Adam Topaz, Rémi Bottinelli, Junyan Xu. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kyle Miller, Adam Topaz, Rémi Bottinelli, Junyan Xu
-/
import category_theory.filtered
import data.set.finite
import topology.category.Top.limits.k... |
cad060213f1a5c81cd6f04e4550131d5cfdec66a | 4727251e0cd73359b15b664c3170e5d754078599 | /src/analysis/hofer.lean | 3b890a10cb59828eb04e8ac90b898ad25de376cb | [
"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,605 | lean | /-
Copyright (c) 2020 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot
-/
import analysis.specific_limits.basic
/-!
# Hofer's lemma
This is an elementary lemma about complete metric spaces. It is motivated by an
application to the bubblin... |
7c37de24c20fc6612084649a6d1a1afb00c2bd3b | a4673261e60b025e2c8c825dfa4ab9108246c32e | /src/Lean/ResolveName.lean | 49ccfa400205a313a025114253ebeb825c2b8211 | [
"Apache-2.0"
] | permissive | jcommelin/lean4 | c02dec0cc32c4bccab009285475f265f17d73228 | 2909313475588cc20ac0436e55548a4502050d0a | refs/heads/master | 1,674,129,550,893 | 1,606,415,348,000 | 1,606,415,348,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,962 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Sebastian Ullrich
-/
import Lean.Data.OpenDecl
import Lean.Hygiene
import Lean.Modifiers
import Lean.Exception
namespace Lean
/-!
We use aliases to impleme... |
5ec6c9c671ac0b9a82bfcb4d17cc201799bb0e74 | 94e33a31faa76775069b071adea97e86e218a8ee | /archive/imo/imo1998_q2.lean | 51a73ca85113b4b63f89a8ed698bb4afddd1c507 | [
"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 | 9,547 | lean | /-
Copyright (c) 2020 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import data.fintype.basic
import data.int.parity
import algebra.big_operators.order
import tactic.ring
import tactic.noncomm_ring
/-!
# IMO 1998 Q2
In a competition, there... |
23a919eee2abacdb7ed4122958c425e61c30d75d | 618003631150032a5676f229d13a079ac875ff77 | /src/topology/category/Top/opens.lean | 96630bf1f97f397b682d4afb98f73ae30ae4f048 | [
"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 | 3,866 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import topology.category.Top.basic
import category_theory.eq_to_hom
open category_theory
open topological_space
open opposite
universe u
namespace topological_spac... |
60d9081260903514087a4cda02f70c7543078ace | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /library/algebra/category/yoneda.lean | 7d1983b082e48bdb6d3f2549914a8d5e5a2c887a | [
"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 | 336 | lean | /-
Copyright (c) 2014 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: algebra.category.yoneda
Author: Floris van Doorn
-/
import .constructions
open eq eq.ops category functor category.ops prod
namespace yoneda
--representable functor
section
... |
925e672fe658ed5b0d6c5fcdb6a9b1a2422a585a | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Init/Data/Basic.lean | ea963f66b328a0c388a1efbfb395bc32544304eb | [
"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 | 448 | 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.Nat.Basic
import Init.Data.Fin.Basic
import Init.Data.List.Basic
import Init.Data.Char.Basic
import Init.Data.String.Basic
import I... |
471638588e3f98848c2c6f21cb857ae5cf608825 | 9028d228ac200bbefe3a711342514dd4e4458bff | /src/topology/uniform_space/cauchy.lean | 35b7e46332053c6a6361b535086364e1ecbb42c2 | [
"Apache-2.0"
] | permissive | mcncm/mathlib | 8d25099344d9d2bee62822cb9ed43aa3e09fa05e | fde3d78cadeec5ef827b16ae55664ef115e66f57 | refs/heads/master | 1,672,743,316,277 | 1,602,618,514,000 | 1,602,618,514,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 28,007 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro
-/
import topology.uniform_space.basic
import topology.bases
import data.set.intervals
/-!
# Theory of Cauchy filters in uniform spaces. Complete uniform... |
ae9256a94e8e349f6ad1c69eda3812ac0e6e91b5 | c45b34bfd44d8607a2e8762c926e3cfaa7436201 | /uexp/src/uexp/rules/removeSemiJoinRightWithFilter.lean | 31d50bf172a073aee33a305e65c338a698cff17c | [
"BSD-2-Clause"
] | permissive | Shamrock-Frost/Cosette | b477c442c07e45082348a145f19ebb35a7f29392 | 24cbc4adebf627f13f5eac878f04ffa20d1209af | refs/heads/master | 1,619,721,304,969 | 1,526,082,841,000 | 1,526,082,841,000 | 121,695,605 | 1 | 0 | null | 1,518,737,210,000 | 1,518,737,210,000 | null | UTF-8 | Lean | false | false | 1,745 | lean | import ..sql
import ..tactics
import ..u_semiring
import ..extra_constants
import ..ucongr
import ..TDP
set_option profiler true
open Expr
open Proj
open Pred
open SQL
open tree
notation `int` := datatypes.int
constant str_foo_: const int.
theorem rule:
forall ( Γ scm_dept scm_emp: Schema) (rel_dept: relation... |
ce685520bbdb377874df1a19f249cba3ad8d7117 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/combinatorics/simple_graph/hasse.lean | 937d1e815c11836c8805d619f8bb6f3e06999784 | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 2,462 | lean | /-
Copyright (c) 2022 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies
-/
import combinatorics.simple_graph.connectivity
import data.fin.succ_pred
import order.succ_pred.relation
/-!
# The Hasse diagram as a graph
This file defines the Hasse ... |
d926abd5d1ad0c12fad30c5d06691e400d7fdb60 | 2a70b774d16dbdf5a533432ee0ebab6838df0948 | /_target/deps/mathlib/src/topology/algebra/monoid.lean | 7c152b1988b2009ca4b10abcd86d0ae49f5a1119 | [
"Apache-2.0"
] | permissive | hjvromen/lewis | 40b035973df7c77ebf927afab7878c76d05ff758 | 105b675f73630f028ad5d890897a51b3c1146fb0 | refs/heads/master | 1,677,944,636,343 | 1,676,555,301,000 | 1,676,555,301,000 | 327,553,599 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,770 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro
-/
import topology.continuous_on
import group_theory.submonoid.basic
import algebra.group.prod
import algebra.pointwise
/-!
# Theory of topological mono... |
ebd414c7f3e42a9e3dbc2f02c4995c7b271c2dbe | 367134ba5a65885e863bdc4507601606690974c1 | /src/testing/slim_check/functions.lean | 25191f0761d5c45322dbce91226f84e335d23749 | [
"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 | 16,958 | lean | /-
Copyright (c) 2020 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Simon Hudon
-/
import data.list.sigma
import testing.slim_check.sampleable
import testing.slim_check.testable
import tactic.pretty_cases
/-!
## `slim_check`: generators for functions
Thi... |
6f201ffc8607944e7c92286c36610e4e01cd1a1f | 67190c9aacc0cac64fb4463d93e84c696a5be896 | /Lists of exercises/List 4/fol.lean | 9c7ae7ea526a3dd03b1a4a545cb0a811e5b2400f | [] | no_license | lucasresck/Discrete-Mathematics | ffbaf55943e7ce2c7bc50cef7e3ef66a0212f738 | 0a08081c5f393e5765259d3f1253c3a6dd043dac | refs/heads/master | 1,596,627,857,734 | 1,573,411,500,000 | 1,573,411,500,000 | 212,489,764 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,518 | lean | /-
(X) We agree with sharing this code with the classmates.
Alunos:
- Lucas Emanuel Resck Domingues
- Lucas Machado Moschen
Assume that we have a language with the following parameters: ∀,
intended to mean “for all things”; N, intended to mean “is a number”;
I , intended to mean “is interesting”; ; 'lt', intended ... |
570b7f5281e045743a7486e4c93c9a3772e1d58d | 22e97a5d648fc451e25a06c668dc03ac7ed7bc25 | /src/analysis/calculus/times_cont_diff.lean | 195226f7af9f9bd905f5ebd7751f7e8d2ccbf315 | [
"Apache-2.0"
] | permissive | keeferrowan/mathlib | f2818da875dbc7780830d09bd4c526b0764a4e50 | aad2dfc40e8e6a7e258287a7c1580318e865817e | refs/heads/master | 1,661,736,426,952 | 1,590,438,032,000 | 1,590,438,032,000 | 266,892,663 | 0 | 0 | Apache-2.0 | 1,590,445,835,000 | 1,590,445,835,000 | null | UTF-8 | Lean | false | false | 80,984 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import analysis.calculus.fderiv
/-!
# Higher differentiability
A function is `C^1` on a domain if it is differentiable there, and its derivative is continuous... |
8b275313bdfc828c719b2a16cee5ec1d33bbab2a | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/ring_theory/polynomial/homogeneous.lean | bbab5e81fb9e2c94f4bc4d1ca0d1ddca72ba9295 | [
"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 | 10,892 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Eric Wieser
-/
import algebra.direct_sum.internal
import algebra.graded_monoid
import data.fintype.card
import data.mv_polynomial.variables
/-!
# Homogeneous polynomi... |
44320438a1d5e90bed7de628cd6205b6c3c5cd8f | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/lean/server/edits.lean | a215e5d3e8b59dabf06d007db404a4d34ae358d6 | [
"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,311 | lean | import Lean.Data.Lsp
open IO Lean Lsp
def main : IO Unit := do
Ipc.runWith (←IO.appPath) #["--server"] do
let hIn ← Ipc.stdin
hIn.write (←FS.readBinFile "init_vscode_1_47_2.log")
hIn.flush
discard $ Ipc.readResponseAs 0 InitializeResult
Ipc.writeNotification ⟨"initialized", InitializedParams.mk⟩
... |
01785674e48b290634510f010e2e770d08536bf5 | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /tests/lean/envExtensionSealed.lean | 7899e4f1292de1b8bea3d9f06ab38a227dc23ee1 | [
"Apache-2.0"
] | permissive | collares/lean4 | 861a9269c4592bce49b71059e232ff0bfe4594cc | 52a4f535d853a2c7c7eea5fee8a4fa04c682c1ee | refs/heads/master | 1,691,419,031,324 | 1,618,678,138,000 | 1,618,678,138,000 | 358,989,750 | 0 | 0 | Apache-2.0 | 1,618,696,333,000 | 1,618,696,333,000 | null | UTF-8 | Lean | false | false | 245 | lean | import Lean
namespace Lean
def ex1 : CoreM Nat := do
let env ← getEnv
pure $ privateExt.getState env
#eval ex1
def ex2 : CoreM Nat := do
let env ← getEnv
pure $ { privateExt with idx := 3 }.getState env -- Error
-- #eval ex2
end Lean
|
9cd1f097d47bdb60bf606dc9b8309e0712aa6ddd | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /src/ring_theory/ideal/operations.lean | debc027c3e256155684171bc13b4b1f28ab40ff8 | [
"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 | 74,754 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import algebra.algebra.operations
import algebra.algebra.tower
import data.equiv.ring
import data.nat.choose.sum
import ring_theory.ideal.basic
import ring_theory.non_zero_divi... |
6922f4a922aa7d6859eb75c9f568fc22529bbe5d | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/data/nat/digits.lean | 45946615fe0b9d775411f98d7700a223ddd8d945 | [
"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 | 17,703 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Shing Tak Lam
-/
import data.int.modeq
import tactic.interval_cases
import tactic.linarith
/-!
# Digits of a natural number
This provides a basic API for extracting t... |
65c6d315d2a959dc50e3ec712d21ec16d9ed2774 | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/data/equiv/fin.lean | c50909704e3b744a62690c731ebef4cfca97c1d9 | [
"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 | 2,855 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Kenny Lau
Equivalences between finite numbers.
-/
import data.fin data.equiv.basic
variables {m n : ℕ}
def fin_zero_equiv : fin 0 ≃ empty :=
⟨fin_zero_elim, empty.elim, assume a, fin_zero... |
09cefd84248f67ed67931ceb2d1ab23667f29f61 | 64874bd1010548c7f5a6e3e8902efa63baaff785 | /tests/lean/run/finbug2.lean | a67f5c71b4c90fd5e43b94477ede419c6dea627a | [
"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 | 950 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: data.fin
Author: Leonardo de Moura
Finite ordinals.
-/
open nat
inductive fin : nat → Type :=
fz : Π n, fin (succ n),
fs : Π {n}, fin n → fin (succ n)
namespace fin
definit... |
10d8e1931ce32552ee7837e77dde631d15bed25a | 958488bc7f3c2044206e0358e56d7690b6ae696c | /lean/while/BExp.lean | e255876ab69e8be40108455c04800796dd88fc43 | [] | no_license | possientis/Prog | a08eec1c1b121c2fd6c70a8ae89e2fbef952adb4 | d4b3debc37610a88e0dac3ac5914903604fd1d1f | refs/heads/master | 1,692,263,717,723 | 1,691,757,179,000 | 1,691,757,179,000 | 40,361,602 | 3 | 0 | null | 1,679,896,438,000 | 1,438,953,859,000 | Coq | UTF-8 | Lean | false | false | 412 | lean | import Env
import AExp
-- Shallow embedding for boolean expressions
def BExp : Type := Env -> Prop
-- A variable 'x' is read by a shallowly embedded boolean expression 'b', if and
-- only if, there is a environment 's' and an integer 'n' such that evaluating b in
-- s after binding x to n, makes a difference
def BRe... |
608540167c08afe0d6c9a771c4662e951a8190bd | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/algebra/category/Group/epi_mono.lean | ca6fc836c22f519050f57143f3fbdd52b57ce35e | [
"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 | 12,730 | lean | /-
Copyright (c) 2022 Jujian Zhang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jujian Zhang
-/
import algebra.category.Group.equivalence_Group_AddGroup
import category_theory.epi_mono
import group_theory.quotient_group
/-!
# Monomorphisms and epimorphisms in `Grou... |
b11940275c54a53206409ec010f6066c4c7707e8 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/category_theory/punit.lean | 66d2ca4ed970e5539f38e4502c2f969f86172d8e | [
"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 | 757 | 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.const
universes v w u -- declare the `v`'s first; see `category_theory.category` for an explanation
namespace category_theory
instance punit... |
370ecc607a90736e28a79b307c5541ac28cec354 | 9b0cdc31ceef59f5fbd4e20acad77a7a59044088 | /src/solutions/03_forall_or.lean | 99f8460559996f9c31af7143312388c542f91bad | [
"Apache-2.0"
] | permissive | andrewparr/tutorials | 964ebb8b4eae2b658a946843f8f9fc5c69b79761 | 0fd6cefe7e62f0d4bfa12ebd115913f8ef4fbd62 | refs/heads/master | 1,687,573,595,883 | 1,626,653,659,000 | 1,626,653,659,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,254 | lean | import data.real.basic
import algebra.group.pi
set_option pp.beta true
/-
In this file, we'll learn about the ∀ quantifier, and the disjunction
operator ∨ (logical OR).
Let P be a predicate on a type X. This means for every mathematical
object x with type X, we get a mathematical statement P x.
In Lean, P x has ty... |
92579eb59e6f3c4980214cf3b8fc5922765cc492 | e16f547df783f1d9a7117fa3080541a01d6f1bc8 | /src/basic_cat.lean | a1d69b0865430ac0075ff771d0fefffe4d0b2b3b | [] | no_license | iamcxds/Galois | fd5070420eae1306bb5048b903ba40146fb7a472 | 8ad1c22b5efcf332bc77901e1f1c64c2667ec11f | refs/heads/master | 1,668,080,244,889 | 1,593,267,894,000 | 1,593,267,894,000 | 275,388,802 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,848 | lean |
import category_theory.functor_category
--import field_theory.splitting_field
--import field_theory.subfield
import algebra.field
import algebra.ring
--import ring_theory.algebra
--import ring_theory.algebraic
import category_theory.isomorphism
import algebra.group.hom
import data.set.basic
open category_theory
unive... |
b7eac82214d039ef66c2ecb7c2abc219cf5ff046 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/data/array/lemmas.lean | 8dc397ce65cfd7b32ce02b8ab873c6e07efffe26 | [
"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 | 9,454 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Mario Carneiro
-/
import category.traversable.equiv data.vector2
universes u w
namespace d_array
variables {n : ℕ} {α : fin n → Type u}
instance [∀ i, inha... |
1e29326dc77857e46c876a480a413ff58202d3e6 | 75db7e3219bba2fbf41bf5b905f34fcb3c6ca3f2 | /library/data/fintype/card.lean | 683895bab7a33a2f768d0aa7611483372f5594ec | [
"Apache-2.0"
] | permissive | jroesch/lean | 30ef0860fa905d35b9ad6f76de1a4f65c9af6871 | 3de4ec1a6ce9a960feb2a48eeea8b53246fa34f2 | refs/heads/master | 1,586,090,835,348 | 1,455,142,203,000 | 1,455,142,277,000 | 51,536,958 | 1 | 0 | null | 1,455,215,811,000 | 1,455,215,811,000 | null | UTF-8 | Lean | false | false | 2,043 | lean | /-
Copyright (c) 2015 Haitao Zhang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Haitao Zhang
Cardinality for finite types.
-/
import .basic data.list data.finset.card
open eq.ops nat function list finset
namespace fintype
definition card [reducible] (A : Type) [fi... |
912d6543a53819c26d313a02fc6934d372e1c09a | b3fced0f3ff82d577384fe81653e47df68bb2fa1 | /src/tactic/lint.lean | a643d13dbb9be7d9a6261a1d1430a682bfa15095 | [
"Apache-2.0"
] | permissive | ratmice/mathlib | 93b251ef5df08b6fd55074650ff47fdcc41a4c75 | 3a948a6a4cd5968d60e15ed914b1ad2f4423af8d | refs/heads/master | 1,599,240,104,318 | 1,572,981,183,000 | 1,572,981,183,000 | 219,830,178 | 0 | 0 | Apache-2.0 | 1,572,980,897,000 | 1,572,980,896,000 | null | UTF-8 | Lean | false | false | 21,550 | lean | /-
Copyright (c) 2019 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Robert Y. Lewis
-/
import tactic.core
/-!
# lint command
This file defines the following user commands to spot common mistakes in the code.
* `#lint`: check all dec... |
48c37072e42f55f2e5851811542f93688ad89f8b | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/order/zorn.lean | 90f7f6ed3ad149d312740921b07ce65df2940657 | [
"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,957 | 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
Zorn's lemmas.
Ported from Isabelle/HOL (written by Jacques D. Fleuriot, Tobias Nipkow, and Christian Sternagel).
-/
import data.set.lattice
noncomputable theory
univ... |
887f2cd71e65f7bc082402d581b98c2a5b510375 | 86f6f4f8d827a196a32bfc646234b73328aeb306 | /examples/logic/unnamed_2209.lean | a5f61a58f6426f3c7176ad6240f8a609094b1b0c | [] | no_license | jamescheuk91/mathematics_in_lean | 09f1f87d2b0dce53464ff0cbe592c568ff59cf5e | 4452499264e2975bca2f42565c0925506ba5dda3 | refs/heads/master | 1,679,716,410,967 | 1,613,957,947,000 | 1,613,957,947,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 131 | lean | import data.real.basic
-- BEGIN
example : (λ x y : ℝ, (x + y)^2) = (λ x y : ℝ, x^2 + 2*x*y + y^2) :=
by { ext, ring }
-- END |
dd3f12fd90b583d240a7b0d88d3f6a17ca58a596 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/analysis/normed_space/indicator_function.lean | 0214d2e6582ca22a7252bdb102f98521cd67b31e | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 1,353 | lean | /-
Copyright (c) 2020 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou, Yury Kudryashov
-/
import analysis.normed.group.basic
import algebra.indicator_function
/-!
# Indicator function and norm
This file contains a few simple lemmas about `... |
7066f6be5203a7dfd1234409ba894f16dbd8341d | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/order/category/DistLat.lean | c4633bbbe1434cc2a3138d8bb5429e2cd192b3fc | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 2,347 | lean | /-
Copyright (c) 2022 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies
-/
import order.category.Lat
/-!
# The category of distributive lattices
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding PR t... |
5b8946fd7ea67d3476f44b60f0174ebf9c239736 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/topology/homotopy/product.lean | 06b9d0449ed710671158ef7f04f4340bdc33dc19 | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 9,334 | lean | /-
Copyright (c) 2021 Praneeth Kolichala. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Praneeth Kolichala
-/
import topology.constructions
import topology.homotopy.path
/-!
# Product of homotopies
In this file, we introduce definitions for the product of
homotopies... |
92f61f07956374bcc749584712e25d6494c65d0c | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/data/fintype/intervals.lean | 201ef15f96ed2af3ea87a24fab7bc9dda27f84e8 | [
"Apache-2.0"
] | permissive | vaibhavkarve/mathlib | a574aaf68c0a431a47fa82ce0637f0f769826bfe | 17f8340912468f49bdc30acdb9a9fa02eeb0473a | refs/heads/master | 1,621,263,802,637 | 1,585,399,588,000 | 1,585,399,588,000 | 250,833,447 | 0 | 0 | Apache-2.0 | 1,585,410,341,000 | 1,585,410,341,000 | null | UTF-8 | Lean | false | false | 909 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import data.set.intervals
import data.set.finite
import data.fintype
import data.pnat.intervals
/-!
# fintype instances for intervals
We provide `fintype` instances... |
1aa290c7a8a55835ec22d4b06ab6b62c178a49cf | 618003631150032a5676f229d13a079ac875ff77 | /src/algebra/continued_fractions/computation/translations.lean | 15c55600d1b6c33d1268394398197e5ac4f72dbd | [
"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 | 10,500 | lean | /-
Copyright (c) 2020 Kevin Kappelmann. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Kappelmann
-/
import algebra.continued_fractions.computation.basic
import algebra.continued_fractions.translations
/-!
# Basic Translation Lemmas Between Structures Defined for... |
99e62162cacdf2d0c7c25e02f431f84544b9f8c3 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/coe_to_sort.lean | 463f2a3d83680ba63ea9382846d2ee0ec5678e71 | [
"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 | 253 | lean | universes u
structure pointed :=
(carrier : Type u) (point : carrier)
instance: has_coe_to_sort pointed.{u} (Type u) :=
⟨pointed.carrier⟩
example (p : pointed) := list p -- coercion works in argument position
example (p : pointed) : p := p.point
|
f81d2abbff4314911e78b0011598148d626ceec2 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/analysis/calculus/inverse.lean | de850dabe3232dfffc1222d43bdb898acf8406cc | [
"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 | 37,274 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov, Heather Macbeth, Sébastien Gouëzel
-/
import analysis.calculus.cont_diff
import analysis.normed_space.banach
/-!
# Inverse function theorem
In this file we prove th... |
7cd1ff02900231d5d54a3691b1d1e5367418c566 | fe25de614feb5587799621c41487aaee0d083b08 | /stage0/src/Lean/Compiler/ConstFolding.lean | 99c1d88f4622f443d1cc8545a8dc27343609e3ad | [
"Apache-2.0"
] | permissive | pollend/lean4 | e8469c2f5fb8779b773618c3267883cf21fb9fac | c913886938c4b3b83238a3f99673c6c5a9cec270 | refs/heads/master | 1,687,973,251,481 | 1,628,039,739,000 | 1,628,039,739,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,245 | 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.Expr
import Lean.Compiler.Util
/- Constant folding for primitives that have special runtime support. -/
namespace Lean.Compiler
abbrev BinFol... |
2dd07ed6ac2bdb5a0ed83ba985b7061181f95f8b | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/new_obtains2.lean | aa623c201b620abd6ac01089ee92b0c8451062b4 | [
"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 | 303 | lean | open sigma.ops
section
parameter A : Type
parameter C : A → Type
parameter P : ∀ a, C a → Prop
example
(x t : A)
(e : x = t)
(h₁ : C x)
(h₂ : P x h₁)
: unit :=
obtain (nh₁ : C t) (nh₂ : P t nh₁), from eq.rec_on e ⟨h₁, h₂⟩,
unit.star
end
|
603e1ef8ce74e414ddecf3602dacbdd5013f250b | 02005f45e00c7ecf2c8ca5db60251bd1e9c860b5 | /src/data/multiset/basic.lean | 68c8394de42a8e06814d7c8548ad7ba28c64c25f | [
"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 | 88,252 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
-/
import data.list.perm
import algebra.group_power
/-!
# Multisets
These are implemented as the quotient of a list by permutations.
## Notation
We define the ... |
15ec006049dc3b86021bedf7fb47ec18ff8eac59 | ac89c256db07448984849346288e0eeffe8b20d0 | /src/Init/Core.lean | b4f78e6b80c5d55a93d0a0fe89f67644912f0468 | [
"Apache-2.0"
] | permissive | chepinzhang/lean4 | 002cc667f35417a418f0ebc9cb4a44559bb0ccac | 24fe2875c68549b5481f07c57eab4ad4a0ae5305 | refs/heads/master | 1,688,942,838,326 | 1,628,801,942,000 | 1,628,801,995,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 35,110 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
notation, basic datatypes and type classes
-/
prelude
import Init.Prelude
import Init.SizeOf
universe u v w
def inline {α : Sort u} (a : α) : α := a
@[inli... |
a973501226a5bd2d50f9ae1e79ef34c8862b8bba | 159fed64bfae88f3b6a6166836d6278f953bcbf9 | /Structure/Generic/Axioms/CategoryTheory.lean | c08d7bfdd1430f40840b70e8789558bc6e6d8077 | [
"MIT"
] | permissive | SReichelt/lean4-experiments | 3e56830c8b2fbe3814eda071c48e3c8810d254a8 | ff55357a01a34a91bf670d712637480089085ee4 | refs/heads/main | 1,683,977,454,907 | 1,622,991,121,000 | 1,622,991,121,000 | 340,765,677 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,657 | lean | import Structure.Generic.Axioms.Universes
import Structure.Generic.Axioms.AbstractFunctors
import Structure.Generic.Axioms.AbstractEquivalences
import Structure.Generic.Axioms.GeneralizedProperties
import Structure.Generic.Axioms.InstanceEquivalences
open GeneralizedRelation
set_option autoBoundImplicitLocal false
... |
ca5eff603c6038aeb0ddab57534618a4a4f5621c | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/coesec.lean | d01e213d72ce1d815c2d08dd4389b9eaa3f81d96 | [
"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 | inductive func (A B : Type) :=
mk : (A → B) → func A B
section
variables {A B : Type}
definition to_function (F : func A B) : A → B :=
func.rec (λf, f) F
attribute to_function [coercion]
end
|
456e7867fdace7437e83544f6942f06241db1c18 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/lean/run/synth1.lean | 5a3b1bb39fb845b886f059ab5aa41e6c77a78eae | [
"Apache-2.0"
] | permissive | mhuisi/lean4 | 28d35a4febc2e251c7f05492e13f3b05d6f9b7af | dda44bc47f3e5d024508060dac2bcb59fd12e4c0 | refs/heads/master | 1,621,225,489,283 | 1,585,142,689,000 | 1,585,142,689,000 | 250,590,438 | 0 | 2 | Apache-2.0 | 1,602,443,220,000 | 1,585,327,814,000 | C | UTF-8 | Lean | false | false | 1,385 | lean | import Init.Lean.Meta
open Lean
open Lean.Meta
class HasCoerce (a b : Type) :=
(coerce : a → b)
def coerce {a b : Type} [HasCoerce a b] : a → b :=
@HasCoerce.coerce a b _
instance coerceTrans {a b c : Type} [HasCoerce b c] [HasCoerce a b] : HasCoerce a c :=
⟨fun x => coerce (coerce x : b)⟩
instance coerceBoolToProp... |
fcbaaa586c0d9db87901fce4690efe921e73832e | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/data/int/basic.lean | 7b73d2e812b09c569d876733ae46ba954b75c63c | [
"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 | 47,619 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
The integers, with addition, multiplication, and subtraction.
-/
import data.nat.basic
import algebra.order_functions
open nat
namespace int
instance : inhabited ℤ := ... |
0d74378636966af7472949fbaa47d31d8e05483e | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/geometry/euclidean/triangle.lean | de58f1b6cc0ff22ba3cb79c267cf4ed78f94a0c4 | [
"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 | 19,270 | lean | /-
Copyright (c) 2020 Joseph Myers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Joseph Myers, Manuel Candales
-/
import geometry.euclidean.basic
import tactic.interval_cases
/-!
# Triangles
This file proves basic geometrical results about distances and angles
in (... |
a9a25fc59c233df07689e2339509de4373ed6a70 | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /library/init/nat.lean | d01bce9545f8e399de99b9b53d9d15e6f20e71c2 | [
"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 | 10,273 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: init.nat
Authors: Floris van Doorn, Leonardo de Moura
-/
prelude
import init.wf init.tactic init.num
open eq.ops decidable
namespace nat
notation `ℕ` := nat
inductive lt ... |
70198f94bcf008c33f564eee598bd70788b7fefc | 5e3548e65f2c037cb94cd5524c90c623fbd6d46a | /src_icannos_totilas/topologie-espaces-normés/cpge_ten_04.lean | 33a436b0dc4ff35d1a8f43e4a9f1ecc3c961719d | [] | 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 | 483 | 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
-- Soient F une partie fermée non vide d'un espace normé E et x ∈ E . Montrer
-- d(x, F ) = 0 ⇐⇒ x ∈ F .
theorem exo {R E: Type*} [normed_field ... |
d2e8b58b3bfadd3361efeabf11eaf3f5c14370d0 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/category_theory/category/Cat.lean | 0264f8b2aae6b9d9a63a2b63a1185dce551f687b | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 3,587 | lean | /-
Copyright (c) 2019 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import category_theory.concrete_category.bundled
import category_theory.discrete_category
import category_theory.types
import category_theory.bicategory.strict
/-!... |
62338e86a99f9ed2b3efa63e99ca85cf27fd2b7b | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /doc/examples/NFM2022/nfm6.lean | dfeecbaacd0baf454abdd332c5bd8e5b076b85f3 | [
"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 | 352 | lean | /- Inductive Types -/
inductive Tree (β : Type v) where
| leaf
| node (left : Tree β) (key : Nat) (value : β) (right : Tree β)
deriving Repr
#eval Tree.node .leaf 10 true .leaf
-- Tree.node Tree.leaf 10 true Tree.leaf
inductive Vector (α : Type u) : Nat → Type u
| nil : Vector α 0
| cons : α → Vector α n →... |
0753164469c887cd12fffb5726752b27e41bd694 | 3c693e12637d1cf47effc09ab5e21700d1278e73 | /src/topology/top_space.lean | 6d2d1154d50d6d3bc1f7a73f5a6007d84e164d38 | [] | no_license | ImperialCollegeLondon/Example-Lean-Projects | e731664ae046980921a69ccfeb2286674080c5bb | 87b27ba616eaf03f3642000829a481a1932dd08e | refs/heads/master | 1,685,399,670,721 | 1,623,092,696,000 | 1,623,092,696,000 | 275,571,570 | 19 | 1 | null | 1,593,361,524,000 | 1,593,344,124,000 | Lean | UTF-8 | Lean | false | false | 2,204 | lean | -- topological spaces from first principles.
import tactic
open set
class topological_space (X : Type) :=
(is_open : set X → Prop)
(is_open_univ : is_open univ)
(is_open_inter : ∀ (U V : set X), is_open U → is_open V → is_open (U ∩ V))
(is_open_sUnion : ∀ (𝒞 : set (set X)), (∀U ∈ 𝒞, is_open U) → is_open ... |
14a9ced54547ab5238c05bbe522cc681d029301f | 7282d49021d38dacd06c4ce45a48d09627687fe0 | /tests/lean/univ2.lean | 1a67e40f894b4d34e4fbb4cbc4226a71031a7602 | [
"Apache-2.0"
] | permissive | steveluc/lean | 5a0b4431acefaf77f15b25bbb49294c2449923ad | 92ba4e8b2d040a799eda7deb8d2a7cdd3e69c496 | refs/heads/master | 1,611,332,256,930 | 1,391,013,244,000 | 1,391,013,244,000 | 16,361,079 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 216 | lean | universe M >= 1
universe U >= M + 1
universe Z >= max U+1 M+1
print environment 2
(*
local env = get_environment()
assert(env:get_universe_distance("Z", "U") == 1)
assert(env:get_universe_distance("Z", "M") == 2)
*)
|
fe3df34f2b435222f18aa86dc3c141e69cf51e22 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/algebra/continued_fractions/computation/approximation_corollaries.lean | df71b81f9db553f33eeccdff416c785b85edfa82 | [
"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 | 6,994 | lean | /-
Copyright (c) 2021 Kevin Kappelmann. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Kappelmann
-/
import algebra.continued_fractions.computation.approximations
import algebra.continued_fractions.convergents_equiv
import algebra.order.archimedean
import algebra... |
80f9349f512cac829b4a937b520a8ba5716d9594 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/limits/final.lean | f85798fef3d3f07efdc51e8f78f52d3516d7d850 | [
"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 | 21,099 | 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.punit
import category_theory.structured_arrow
import category_theory.is_connected
import category_theory.limits.yoneda
import category_theory.l... |
fa3b04e7ffb84022592916bf1775d26f09830b8b | 94e33a31faa76775069b071adea97e86e218a8ee | /test/measurability.lean | deede74ac58d0825a2233b894e69efb4f61d24f4 | [
"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 | 3,037 | lean | /-
Copyright (c) 2021 Rémy Degenne. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Rémy Degenne
-/
import measure_theory.tactic
import measure_theory.function.special_functions
open_locale big_operators ennreal
variables {α β : Type*} [measurable_space α] [measurable... |
c1e9cfbeed939de6068dd6661a5e62875f701619 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/data/int/default.lean | 398d9dd51133375d812ad1946562e1ac8a5c2a8b | [] | 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 | 393 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.data.int.basic
import Mathlib.Lean3Lib.init.data.int.order
import Mathlib.Lean3Lib.init.data.int.comp_le... |
756fd47b101ed59217fe5c88e7ad59b62443cb6e | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tmp/PreludeNew.lean | dff4ff49758eef2a18f596963545457d7017a507 | [
"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 | 58,154 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
notation, basic datatypes and type classes
-/
prelude
universes u v w
@[inline] def id {α : Sort u} (a : α) : α := a
abbrev Function.comp {α : Sort u} {β :... |
cf2bc3b01a034d4ece5259bbbe8508233801ccd3 | 6fca17f8d5025f89be1b2d9d15c9e0c4b4900cbf | /src/game/world8/level6.lean | 92faa4acc38d99b96799c73e4c244645e8ecbbef | [
"Apache-2.0"
] | permissive | arolihas/natural_number_game | 4f0c93feefec93b8824b2b96adff8b702b8b43ce | 8e4f7b4b42888a3b77429f90cce16292bd288138 | refs/heads/master | 1,621,872,426,808 | 1,586,270,467,000 | 1,586,270,467,000 | 253,648,466 | 0 | 0 | null | 1,586,219,694,000 | 1,586,219,694,000 | null | UTF-8 | Lean | false | false | 792 | lean | import game.world8.level5 -- hide
namespace mynat -- hide
/-
# Advanced Addition World
## Level 6: `add_left_cancel`
The theorem `add_left_cancel` is the theorem that you can cancel on the left
when you're doing addition -- if `t + a = t + b` then `a = b`.
There is a three-line proof which ends in `exact add_right... |
41fd0c784f0f201ca594763783c7f2b910657314 | 947b78d97130d56365ae2ec264df196ce769371a | /src/Init/Data/Array/QSort.lean | ad5295eb720ea7baf98f6b4b063aaad529222f03 | [
"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 | 1,903 | 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
-/
prelude
import Init.Data.Array.Basic
namespace Array
-- TODO: remove the [Inhabited α] parameters as soon as we have the tactic framework for automating pr... |
a24bd0220216356cd805637e602f24f1d11d5616 | d0f9af2b0ace5ce352570d61b09019c8ef4a3b96 | /notes/2020.01.30-notes.lean | f1fe7b77f9dc4d987fbb95929a689b05403bf828 | [] | no_license | jngo13/Discrete-Mathematics | 8671540ef2da7c75915d32332dd20c02f001474e | bf674a866e61f60e6e6d128df85fa73819091787 | refs/heads/master | 1,675,615,657,924 | 1,609,142,011,000 | 1,609,142,011,000 | 267,190,341 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,868 | lean | --Takes any nat and returns 0
#check (λ (n : nat), 0) --function takes n of type nat and returns 0
-- Takes and two nat and returns the same nat
#check (λ (n:nat), n)
-- Takes any two nat and returns (a+b)
#check (λ (a b :nat), a+b)
--Takes a, b, c type nat and returns ax^2 + bx + c
#check (λ (a b c x:nat), a*x^2+b*... |
d9e485350981afd62653cab277954326fb25a5b5 | d751a70f46ed26dc0111a87f5bbe83e5c6648904 | /Code/src/inst/reactor.lean | bfc455a71936258a707b6ecbcb139bbdf2696a7e | [] | no_license | marcusrossel/bachelors-thesis | 92cb12ae8436c10fbfab9bfe4929a0081e615b37 | d1ec2c2b5c3c6700a506f2e3cc93f1160e44b422 | refs/heads/main | 1,682,873,547,703 | 1,619,795,735,000 | 1,619,795,735,000 | 306,041,494 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 16,630 | lean | import inst.reaction
import tactic
open reactor
open reactor.ports
-- Cf. inst/primitives.lean
variables (υ : Type*) [decidable_eq υ]
@[ext]
structure reactor :=
(input : ports υ)
(output : ports υ)
(state : state_vars υ)
(priorities : finset ℕ)
(reactions : ℕ → reaction υ)
namespace reactor
variables ... |
be42ed1f2c79e63261f37d1a2295cf11a264e95e | 82b86ba2ae0d5aed0f01f49c46db5afec0eb2bd7 | /stage0/src/Init/System/ST.lean | 4ee82168f7a4d12e565203a8b99e76db437e8c95 | [
"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 | 4,394 | 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
-/
prelude
import Init.Classical
import Init.Control.EState
import Init.Control.Reader
def EST (ε : Type) (σ : Type) : Type → Type := EStateM ε σ
abbrev ST (σ... |
d86be39f5b059abe116849f5c29a54e38772240b | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/splitAtCode.lean | f38b01b2188e1ae3b7cc2e967202ffbada444c98 | [
"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 | 212 | lean | inductive Foo where
| ctor1 (s : Nat)
| ctor2 (s : String)
def test (x y : Foo) : Decidable (match (x, y) with
| (.ctor1 s₁, .ctor1 s₂) => ¬s₁ = s₂
| x => False) := by
split <;> infer_instance
|
9d8d3e05f55d339e3ee75b532013f8c0ceebea57 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/ring_theory/localization/localization_localization.lean | 901d2763d30a632fc187d7524219613d31b9e116 | [
"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 | 13,058 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Mario Carneiro, Johan Commelin, Amelia Livingston, Anne Baanen
-/
import ring_theory.localization.at_prime
import ring_theory.localization.basic
import ring_theory.localization.f... |
93d81d115f0c6d49dfe732b4d855ff23ef0b6f25 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/category_theory/limits/shapes/finite_products.lean | d4d7739c671f59a7323a20e32cff7d462671e7af | [
"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 | 2,672 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.limits.shapes.finite_limits
import category_theory.limits.shapes.binary_products
import category_theory.limits.shapes.terminal
/-!
# Categorie... |
865120688cfd53092c694ab25154ceab5d980ead | ad0c7d243dc1bd563419e2767ed42fb323d7beea | /data/padics/padic_rationals.lean | 5e478471c30932e439ee91c8bd2fd5305f36ea22 | [
"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 | 20,546 | lean | /-
Copyright (c) 2018 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
Define the p-adic numbers (rationals) ℚ_p as the completion of ℚ wrt the p-adic norm.
Show that the p-adic norm extends to ℚ_p, that ℚ is embedded in ℚ_p, and that ℚ_... |
1af07e8cf7687000e3d4bb83516c3dff8e66a8fa | 0845ae2ca02071debcfd4ac24be871236c01784f | /tests/compiler/expr.lean | da915526c00825608df8e903bd8fbbeeb6dc17c9 | [
"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 | 195 | lean | import init.lean.expr
open Lean
def main : IO UInt32 :=
let e := Expr.app (Expr.const `f []) (Expr.const `a []) in
IO.println e.dbgToString *>
IO.println ("hash: " ++ toString e.hash) *>
pure 0
|
deb08841e7a35a61aef16164ee3693611ae87473 | d53312f14e4be505a8abcc1969b73308b038f020 | /06-formalizacija-dokazov/vaje.lean | ef8f285712d709c8b30b5637f98dd70f6556946a | [] | no_license | lunar-starlight/teorija-programskih-jezikov | 18ccdfaa9200c10c2b1ec14624419532dd671d25 | bfdf69114a6b13b1ae5735e8749b543f722e5965 | refs/heads/master | 1,667,393,466,506 | 1,577,651,158,000 | 1,577,651,158,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,413 | lean | namespace hidden
universe u
-------------------------------------------------------------------------------
inductive list (A:Type) : Type
| Nil {} : list -- Brez {} moramo konstruktorju Nil vedno podati tip A
| Cons : A -> list -> list -- Cons tip A ugotovi iz tipa prvega elementa
namespace list
-- Dopolnite definic... |
26a6ba42e7511cb5931ba83b534e18214cc6a35f | cc4e32129597fc42f4ac133f6eef3dbfd3d16218 | /Analysis/Logic.lean | 63bba7bc33b8326c220719f30937532e4ea1ecbe | [] | no_license | JasonKYi/analysis_in_lean4 | 9791c76ab5f9408731acca075cf604ef4700b117 | 280d45bf2fc9c2f599b365a60a4b980bb2721c24 | refs/heads/main | 1,683,375,225,248 | 1,622,048,948,000 | 1,622,048,948,000 | 370,429,249 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,883 | lean | theorem impNot {p q : Prop} : p → ¬ q ↔ ¬ (p ∧ q) :=
⟨ λ hpq h => hpq h.1 h.2, λ h hp hq => h <| And.intro hp hq ⟩
theorem Exists.impNot {p q : α → Prop} : (∃ x, p x → ¬ q x) ↔ ∃ x, ¬ (p x ∧ q x) := by
apply Iff.intro
intro h
cases h with | intro x hx =>
{ exact ⟨ x, λ hs => hx hs.1 hs.2 ⟩ }
intro h
... |
ed9f20eb6eb3dfcf22ade1ad4bc28f2bf0a204da | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/control/functor.lean | d9bfdfd9ca1c7e49fa3364ac4abc2434007ec54e | [
"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,673 | lean | /-
Copyright (c) 2017 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
-/
import tactic.ext
import tactic.lint
/-!
# Functors
This module provides additional lemmas, definitions, and instances for `functor`s.
## Main definitions
* `const α` i... |
ad23f0e199a3751c498b60d0cd1dab758c74b7ca | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /tests/lean/run/array1.lean | c6544ffb80f84d53a33b0c3053cd68c878ab371f | [
"Apache-2.0"
] | permissive | williamdemeo/lean4 | 72161c58fe65c3ad955d6a3050bb7d37c04c0d54 | 6d00fcf1d6d873e195f9220c668ef9c58e9c4a35 | refs/heads/master | 1,678,305,356,877 | 1,614,708,995,000 | 1,614,708,995,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,257 | lean | #check @Array.mk
def v : Array Nat := Array.mk [1, 2, 3, 4]
def w : Array Nat :=
(mkArray 9 1).push 3
#check @Array.casesOn
def f : Fin w.size → Nat :=
w.get
def arraySum (a : Array Nat) : Nat :=
a.foldl Nat.add 0
#eval mkArray 4 1
#eval Array.map (fun x => x+10) v
#eval f ⟨1, sorry⟩
#eval f ⟨9, sorry⟩
#eval ((... |
2369c994a8839e326d9d406033ea5fb30e4325d9 | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/category_theory/functorial.lean | c2016e7ca6ae04aa61b50c478ad16631a4004365 | [
"Apache-2.0"
] | permissive | vaibhavkarve/mathlib | a574aaf68c0a431a47fa82ce0637f0f769826bfe | 17f8340912468f49bdc30acdb9a9fa02eeb0473a | refs/heads/master | 1,621,263,802,637 | 1,585,399,588,000 | 1,585,399,588,000 | 250,833,447 | 0 | 0 | Apache-2.0 | 1,585,410,341,000 | 1,585,410,341,000 | null | UTF-8 | Lean | false | false | 2,295 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.functor
/-!
# Unbundled functors, as a typeclass decorating the object-level function.
-/
namespace category_theory
universes v v₁ v₂ v₃ u ... |
83d12121e9d9330a46abff87152deb39b1d4906e | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/lake/Lake/Build/Common.lean | 21a7315bdebe1709096ee286976470fbb4620d4b | [
"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 | 4,977 | lean | /-
Copyright (c) 2021 Mac Malone. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mac Malone
-/
import Lake.Build.Monad
import Lake.Build.Actions
open System
namespace Lake
/-! # General Utilities -/
@[inline] def inputFile (path : FilePath) : SchedulerM (BuildJob Fi... |
6b0f6aecfccba0ff39891acfe2161cb2cbaa3a48 | a44280b79dc85615010e3fbda46abf82c6730fa3 | /tests/playground/task_test2.lean | a7ed482ef93367f8d8b9162d4d0933ec6e02c413 | [
"Apache-2.0"
] | permissive | kodyvajjha/lean4 | 8e1c613248b531d47367ca6e8d97ee1046645aa1 | c8a045d69fac152fd5e3a577f718615cecb9c53d | refs/heads/master | 1,589,684,450,102 | 1,555,200,447,000 | 1,556,139,945,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 429 | lean | def run1 (i : Nat) (n : Nat) (xs : List Nat) : Nat :=
n.repeat (λ _ r,
dbgTrace (">> [" ++ toString i ++ "] " ++ toString r) $ λ _,
xs.foldl (+) r)
0
def main (xs : List String) : IO UInt32 :=
let ys := (List.repeat 1 xs.head.toNat) in
let ts : List (Task Nat) := (List.iota 10).map (λ i, Task.mk $ λ _, run1 (i+1) ... |
74d0db72aaf3e560ad409249158a3751d5c995e5 | a4673261e60b025e2c8c825dfa4ab9108246c32e | /stage0/src/Std/Data/HashSet.lean | 16f03f7bcf5b173746ddbe3250c5b40bfebe83f2 | [
"Apache-2.0"
] | permissive | jcommelin/lean4 | c02dec0cc32c4bccab009285475f265f17d73228 | 2909313475588cc20ac0436e55548a4502050d0a | refs/heads/master | 1,674,129,550,893 | 1,606,415,348,000 | 1,606,415,348,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,065 | 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
-/
namespace Std
universes u v w
def HashSetBucket (α : Type u) :=
{ b : Array (List α) // b.size > 0 }
def HashSetBucket.update {α : Type u} (data : HashSe... |
b4f6f650f08bba83f673ee3283bb90a8553caaba | aa5a655c05e5359a70646b7154e7cac59f0b4132 | /src/Std/Data/PersistentHashMap.lean | aa377d1c2cfdc849d9a778abdd9466f1f2ace5e5 | [
"Apache-2.0"
] | permissive | lambdaxymox/lean4 | ae943c960a42247e06eff25c35338268d07454cb | 278d47c77270664ef29715faab467feac8a0f446 | refs/heads/master | 1,677,891,867,340 | 1,612,500,005,000 | 1,612,500,005,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 13,368 | 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
-/
namespace Std
universes u v w w'
namespace PersistentHashMap
inductive Entry (α : Type u) (β : Type v) (σ : Type w) where
| entry (key : α) (val : β) : ... |
6585c946502a9f1ed914bad77de80bae0365c3b8 | cf39355caa609c0f33405126beee2739aa3cb77e | /library/init/meta/float.lean | 697985e9f44e9559277f79ee9b170da72c1573a3 | [
"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 | 6,169 | lean | /- Authors: E.W.Ayers -/
prelude
import init.data
namespace native
meta constant float : Type
namespace float
-- fixed values based on the underlying C++ float implementation.
namespace specification
/-- The base. Either 2 or 10. -/
meta constant radix : nat
/-- The length of the mantissa. -/
meta con... |
7408abc7fa4d98ae0fec308909b5033896c58047 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/data/mv_polynomial/basic.lean | 605228dcf655e4cde7a0741097226f2f92e29334 | [
"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 | 37,210 | 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.polynomial.eval
import data.finsupp.antidiagonal
/-!
# Multivariate polynomials
This file defines polynomial rings over... |
8861869513dc3fec0b70601fb019250272a6d491 | 32025d5c2d6e33ad3b6dd8a3c91e1e838066a7f7 | /src/Init/Util.lean | ac5bc55663b7f2d56dce5424429f1b0a43ebea79 | [
"Apache-2.0"
] | permissive | walterhu1015/lean4 | b2c71b688975177402758924eaa513475ed6ce72 | 2214d81e84646a905d0b20b032c89caf89c737ad | refs/heads/master | 1,671,342,096,906 | 1,599,695,985,000 | 1,599,695,985,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,225 | 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
-/
prelude
import Init.Data.String.Basic
import Init.Data.ToString
universes u v
/- debugging helper functions -/
@[neverExtract, extern "lean_dbg_trace"]
def... |
7aeab257fb6b5893c34f0e44392d12f054af40d1 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /library/init/meta/expr.lean | 673b7d813242f7f634221b3319ee71f9eab4c519 | [
"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 | 5,665 | 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.level
inductive binder_info
| default | implicit | strict_implicit | inst_implicit | other
meta_constant macro_def : Type
/- Ref... |
d35c700e5c5aa939b991cf5938d262d2cbc48864 | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/data/finset/powerset.lean | 7a3a1962ee3134b1a96bd4cb3e18c1fa4a0021dc | [
"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 | 6,386 | 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.finset.lattice
/-!
# The powerset of a finset
-/
namespace finset
open multiset
variables {α : Type*}
/-! ### powerset -/
section powerset
/-- When `... |
0bae595d8f82b8f8da0b84bb9b7119cf74947fbc | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/probability_theory/stopping.lean | b681032ddf6cbb262d54034928ab853c077d425d | [
"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 | 18,615 | lean | /-
Copyright (c) 2021 Kexing Ying. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kexing Ying
-/
import measure_theory.constructions.borel_space
import measure_theory.function.l1_space
/-!
# Filtration and stopping time
This file defines some standard definition from... |
83ad0f9956bbbe84877c140c44ff310b4fc0882f | 11e28114d9553ecd984ac4819661ffce3068bafe | /src/rule_table.lean | 1f06b27066fd20986a701a562d0e63775f1e93ed | [
"MIT"
] | permissive | EdAyers/lean-subtask | 9a26eb81f0c8576effed4ca94342ae1281445c59 | 04ac5a6c3bc3bfd190af4d6dcce444ddc8914e4b | refs/heads/master | 1,586,516,665,621 | 1,558,701,948,000 | 1,558,701,948,000 | 160,983,035 | 4 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 7,777 | lean | /- Author: E.W.Ayers © 2019 -/
import .table .rule_app .expr_zipper
open tactic expr
namespace robot
/-- A __submatch__ is a rule `r` and a zipper on `r.lhs`.
They represent fragments of the LHS to match against some given term. -/
@[derive decidable_eq]
meta structure submatch :=
(r : rule) -- the original rule
(z :... |
462eff8bedaf071a258a9c0a029e09e6e6704f98 | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/category_theory/limits/opposites.lean | bf8da886991a3626c7b5a9497700947d0e7ddc66 | [
"Apache-2.0"
] | permissive | agjftucker/mathlib | d634cd0d5256b6325e3c55bb7fb2403548371707 | 87fe50de17b00af533f72a102d0adefe4a2285e8 | refs/heads/master | 1,625,378,131,941 | 1,599,166,526,000 | 1,599,166,526,000 | 160,748,509 | 0 | 0 | Apache-2.0 | 1,544,141,789,000 | 1,544,141,789,000 | null | UTF-8 | Lean | false | false | 4,525 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Floris van Doorn
-/
import category_theory.limits.shapes.products
import category_theory.discrete_category
universes v u
open category_theory
open category_theory.fun... |
8395e1a172e95abd85d758a275c1ecc915d6e796 | d4df7c538bbc0b06771d7b7a6f46fbadebb8c5eb | /src/monad_transformers/monad_trans.lean | c88e6615ff55249bed5b8e68fdaac8bc3cc6919c | [] | no_license | breakerzirconia/LeanTransformers | 11bb924b59ac589d0c6b39586d27cccc8f9e939c | 3c52441b8990bab7d8cf1817df6e04f657a14e1c | refs/heads/main | 1,682,610,526,027 | 1,620,477,129,000 | 1,620,477,129,000 | 365,507,838 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 124 | lean | class monad_trans (t : (Type → Type) → Type → Type) :=
(lift {m : Type → Type} [monad m] {a : Type} : m a → t m a) |
f0bfddc7ceba54df0ba0570f95d030349afbfc4c | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/data/multiset/nodup.lean | 6bc678fa92323115a87d10911b3d96ddab875f8f | [
"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 | 9,523 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
-/
import data.multiset.powerset
import data.multiset.range
/-!
# The `nodup` predicate for multisets without duplicate elements.
-/
namespace multiset
open list... |
10cbb43476eaa7b15f18327dde305a0752853d15 | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch3/ex0314.lean | 14fa0d36dc8af9233731557ceb674f2c6d6a80c0 | [] | 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 | 115 | lean | variables p q : Prop
example (hpq : p → q) (hnq: ¬q) : ¬p :=
assume hp : p,
show false, from hnq (hpq hp)
|
544eadd3861968b5728452488c293d84ce89aa6b | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/1218.lean | 67a132460d7c967ed16969e6ae4e0174a9128bb7 | [
"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 | 88 | lean | example (h : false) : "hello" = "goodbye" :=
begin try {reflexivity}, contradiction end
|
e60f66f5761b5fa592962a9dd884423b73e27cd4 | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /src/Lean/Message.lean | d363ef89bddebaaace74b33af1cad757fbed1884 | [
"Apache-2.0"
] | permissive | williamdemeo/lean4 | 72161c58fe65c3ad955d6a3050bb7d37c04c0d54 | 6d00fcf1d6d873e195f9220c668ef9c58e9c4a35 | refs/heads/master | 1,678,305,356,877 | 1,614,708,995,000 | 1,614,708,995,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 13,113 | lean | /-
Copyright (c) 2018 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Sebastian Ullrich, Leonardo de Moura
Message Type used by the Lean frontend
-/
import Lean.Data.Position
import Lean.Data.OpenDecl
import Lean.Syntax
import Lean.MetavarContext
... |
3ab62fb5649a3332dab378f941a5179c5f0a48de | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/macroElabRulesIssue1.lean | f511da52e6fd22ebd622a78055d7bde05d1549ac | [
"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 | 275 | lean | import Lean
open Lean Elab Tactic
syntax "Foo" (ident <|> num) : tactic
elab_rules : tactic
| `(tactic| Foo $x:num) =>
logInfo "num"
macro_rules
| `(tactic| Foo $x:ident) => `(tactic| trace "ident")
example : True := by
Foo x -- should not fail
trivial
|
067cf4af33320e861771c0350bbd8c5a72b7cc34 | 5d166a16ae129621cb54ca9dde86c275d7d2b483 | /tests/lean/run/basic_monitor1.lean | b38e7244fa709ddd17daee66017a74baa9d8d768 | [
"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 | 243 | lean | @[vm_monitor]
meta def basic_monitor : vm_monitor nat :=
{ init := 0, step := λ s, return (trace ("step " ++ s^.to_string) (s+1)) >> failure }
set_option debugger true
def f : nat → nat
| 0 := 0
| (a+1) := f a
#eval trace "a" (f 4)
|
a2959c6a75886a1bbfd36e3e1b14a5944dd0d421 | 4376c25f060c13471bb89cdb12aeac1d53e53876 | /src/espaces-metriques/test.lean | f4a6bd49b85958600d26ec5bcdea8cfca1e36d0b | [
"MIT"
] | permissive | RaitoBezarius/projet-maths-lean | 8fa7df563d64c256561ab71893c523fc1424b85c | 42356e980e021a20c3468f5ca1639fec01bb934f | refs/heads/master | 1,613,002,128,339 | 1,589,289,282,000 | 1,589,289,282,000 | 244,431,534 | 0 | 1 | MIT | 1,584,312,574,000 | 1,583,169,883,000 | TeX | UTF-8 | Lean | false | false | 3,570 | lean | import data.real.basic
class metric_space (X : Type*) :=
(d : X → X → ℝ)
(d_pos : ∀ x y, d x y ≥ 0)
(presep : ∀ x y, x=y → d x y = 0)
(sep : ∀ x y, d x y = 0 → x = y)
(sym : ∀ x y, d x y = d y x)
(triangle : ∀ x y z, d x z ≤ d x y + d y z)
class premetric_space (X : Type*) :=
(d : X → X → ℝ)
(d_pos : ∀ x y, d x y ≥ 0)... |
310e10b3feb8a3f0c58b9e87aa3c86809ee04390 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/algebraic_topology/topological_simplex.lean | 9b937cb5132641a67b77e7d7db94f66e54ebda57 | [
"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 | 3,133 | lean | /-
Copyright (c) 2021 Adam Topaz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Adam Topaz
-/
import algebraic_topology.simplex_category
import topology.category.Top.basic
import topology.instances.nnreal
/-!
# Topological simplices
We define the nat... |
f4b33ae70bb9d83340a37654e0ee0d5644453d2c | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /stage0/src/Lean/Elab/Macro.lean | 722e78d3fe5092b08997eebbd702defb779f33f8 | [
"Apache-2.0"
] | permissive | WojciechKarpiel/lean4 | 7f89706b8e3c1f942b83a2c91a3a00b05da0e65b | f6e1314fa08293dea66a329e05b6c196a0189163 | refs/heads/master | 1,686,633,402,214 | 1,625,821,189,000 | 1,625,821,258,000 | 384,640,886 | 0 | 0 | Apache-2.0 | 1,625,903,617,000 | 1,625,903,026,000 | null | UTF-8 | Lean | false | false | 1,955 | 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.MacroArgUtil
namespace Lean.Elab.Command
open Lean.Syntax
open Lean.Parser.Term hiding macroArg
open Lean.Parser.Command
@[builtinMacro L... |
a4ca1f37998cf76a833ed423e9cd4e2e6e0af149 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Elab/Macro.lean | 93059a6c35a659568ea41448d0e866b0e22b808e | [
"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,159 | 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.MacroArgUtil
namespace Lean.Elab.Command
open Lean.Syntax
open Lean.Parser.Term hiding macroArg
open Lean.Parser.Command
@[builtin_comman... |
f882d3f1572d0bea59f0fdb113cf28ce08dc44fc | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/cheap_try_refl.lean | 5b55480fb2012a6520ce68d1797f06eccddb645e | [
"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 | 387 | lean | example (h : false) : 10000000 = 20000000 :=
begin
try {simp},
contradiction
end
example (h : false) (x : nat) : x + 10000000 = x + 20000000 :=
begin
try {simp},
contradiction
end
example (h : false) (x y : nat) : x + y + 10000000 = x + y + 20000000 :=
begin
try {simp},
contradiction
end
example (h : fal... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.