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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
f287518aa062e628eee541279906bb10214d646a | d6124c8dbe5661dcc5b8c9da0a56fbf1f0480ad6 | /Papyrus/IR/TypeRef.lean | 388f597901bb6b31148ad0939f503f39168188ce | [
"Apache-2.0"
] | permissive | xubaiw/lean4-papyrus | c3fbbf8ba162eb5f210155ae4e20feb2d32c8182 | 02e82973a5badda26fc0f9fd15b3d37e2eb309e0 | refs/heads/master | 1,691,425,756,824 | 1,632,122,825,000 | 1,632,123,075,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,696 | lean | import Papyrus.FFI
import Papyrus.Context
import Papyrus.IR.TypeID
namespace Papyrus
/--
An opaque type representing and external LLVM
[Type](https://llvm.org/doxygen/classllvm_1_1Type.html).
-/
constant Llvm.Type : Type := Unit
/--
A reference to an external LLVM
[Type](https://llvm.org/doxygen/classllvm_1_... |
ca3bbbdd64fd88ccf5b088abe9377ba197caf342 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/tactic/omega/eq_elim.lean | 5909b8a64262af8cce7459dd2d1f8f9ae3809717 | [] | 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 | 3,936 | lean | /-
Copyright (c) 2019 Seul Baek. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Seul Baek
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.tactic.omega.clause
import Mathlib.PostPort
universes l
namespace Mathlib
/-
Correctness lemmas fo... |
fec7c3dbdb23d074672dd98f376298b12545c848 | ebbdcbd7ddc89a9ef7c3b397b301d5f5272a918f | /qp/p1_categories/c5_leancat/s2_depprod.lean | 2c200e0941da8a1b97103ddc27eafb81762b8262 | [] | no_license | intoverflow/qvr | 34b9ef23604738381ca20b7d622fd0399d88f2dd | 0cfcd33fe4bf8d93851a00cec5bfd21e77105d74 | refs/heads/master | 1,616,591,570,371 | 1,492,575,772,000 | 1,492,575,772,000 | 80,061,627 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 12,997 | lean | /- -----------------------------------------------------------------------
Dependent products in LeanCat.
----------------------------------------------------------------------- -/
import ..c1_basic
import ..c2_limits
import ..c3_wtypes
import .s1_basic
namespace qp
open stdaux
universe variables ℓ ℓobjx ℓhomx
... |
6e23209aa6448e734c24bfb7c7229ad067150542 | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/category_theory/products/basic.lean | 211fa0c2a29db788410799579aeafebb8e861e80 | [
"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 | 5,179 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Stephen Morgan, Scott Morrison
-/
import category_theory.eq_to_hom
namespace category_theory
universes v₁ v₂ v₃ v₄ u₁ u₂ u₃ u₄ -- declare the `v`'s first; see `category_theory.catego... |
af607d62a4aa986c006c1572bffbe9d36e2fdb1a | b074a51e20fdb737b2d4c635dd292fc54685e010 | /src/data/list/basic.lean | 121ee9293e0ca2ede3c69f73ea495635c89295b0 | [
"Apache-2.0"
] | permissive | minchaowu/mathlib | 2daf6ffdb5a56eeca403e894af88bcaaf65aec5e | 879da1cf04c2baa9eaa7bd2472100bc0335e5c73 | refs/heads/master | 1,609,628,676,768 | 1,564,310,105,000 | 1,564,310,105,000 | 99,461,307 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 212,882 | lean | /-
Copyright (c) 2014 Parikshit Khanna. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Parikshit Khanna, Jeremy Avigad, Leonardo de Moura, Floris van Doorn, Mario Carneiro
Basic properties of lists.
-/
import
tactic.interactive tactic.mk_iff_of_inductive_prop
logi... |
b8a3b3183e402d22989e1fe4f04c940b0e7b74ac | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/combinatorics/young_diagram.lean | 2d80a2b00291e8ff4769d53dfbd5d8ddbf7d674f | [
"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 | 11,056 | lean | /-
Copyright (c) 2022 Jake Levinson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jake Levinson
-/
import order.upper_lower
import data.finset.preimage
/-!
# Young diagrams
A Young diagram is a finite set of up-left justified boxes:
```text
□□□□□
□□□
□□□
□
```
Thi... |
73ad825ce5bf02707b84ae99cfb2a9b19f413233 | 592ee40978ac7604005a4e0d35bbc4b467389241 | /Library/generated/mathscheme-lean/MultMeetSemilattice.lean | 66f6306175cd4204114645993ed0c55be978ee4f | [] | no_license | ysharoda/Deriving-Definitions | 3e149e6641fae440badd35ac110a0bd705a49ad2 | dfecb27572022de3d4aa702cae8db19957523a59 | refs/heads/master | 1,679,127,857,700 | 1,615,939,007,000 | 1,615,939,007,000 | 229,785,731 | 4 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,911 | lean | import init.data.nat.basic
import init.data.fin.basic
import data.vector
import .Prelude
open Staged
open nat
open fin
open vector
section MultMeetSemilattice
structure MultMeetSemilattice (A : Type) : Type :=
(times : (A → (A → A)))
(commutative_times : (∀ {x y : A} , (times x y) = (times y x)))
... |
6979378601c3e4c860fe36794938ab696746645c | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/category_theory/sites/grothendieck.lean | 6d9af6d6516c7a0e0d4697cfccd2ed9814c60411 | [
"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 | 19,412 | lean | /-
Copyright (c) 2020 Bhavik Mehta, E. W. Ayers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta, E. W. Ayers
-/
import category_theory.sites.sieves
import category_theory.limits.shapes.pullbacks
import category_theory.limits.shapes.multiequalizer
import c... |
8cca74afe480f61e0f96096f601a8905d8a78760 | 556aeb81a103e9e0ac4e1fe0ce1bc6e6161c3c5e | /src/starkware/cairo/common/cairo_secp/verification/verification/signature_recover_public_key_assert_nn_soundness.lean | 372f2d079ccd796bdc4e240f7a76ffdfa3f62f37 | [] | permissive | starkware-libs/formal-proofs | d6b731604461bf99e6ba820e68acca62a21709e8 | f5fa4ba6a471357fd171175183203d0b437f6527 | refs/heads/master | 1,691,085,444,753 | 1,690,507,386,000 | 1,690,507,386,000 | 410,476,629 | 32 | 9 | Apache-2.0 | 1,690,506,773,000 | 1,632,639,790,000 | Lean | UTF-8 | Lean | false | false | 3,257 | lean | /-
File: signature_recover_public_key_assert_nn_soundness.lean
Autogenerated file.
-/
import starkware.cairo.lean.semantics.soundness.hoare
import .signature_recover_public_key_code
import ..signature_recover_public_key_spec
open tactic
open starkware.cairo.common.math
variables {F : Type} [field F] [decidable_eq F]... |
31d69fb9a12ac76d57a42410312f94a4ed2ce848 | d5ecf6c46a2f605470a4a7724909dc4b9e7350e0 | /analysis/limits.lean | 8b79b285155bdc9c8cc424dba5c79d8108a22615 | [
"Apache-2.0"
] | permissive | MonoidMusician/mathlib | 41f79df478987a636b735c338396813d2e8e44c4 | 72234ef1a050eea3a2197c23aeb345fc13c08ff3 | refs/heads/master | 1,583,672,205,771 | 1,522,892,143,000 | 1,522,892,143,000 | 128,144,032 | 0 | 0 | Apache-2.0 | 1,522,892,144,000 | 1,522,890,892,000 | Lean | UTF-8 | Lean | false | false | 8,004 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
A collection of limit properties.
-/
import algebra.big_operators algebra.group_power
analysis.real analysis.topology.infinite_sum
noncomputable theory
open classical... |
6420129e16b8615c99c7a626d7b793e0fae1a48c | 42610cc2e5db9c90269470365e6056df0122eaa0 | /hott/homotopy/circle.hlean | 9fec818dab1d954b04976cefc00d5668e1288490 | [
"Apache-2.0"
] | permissive | tomsib2001/lean | 2ab59bfaebd24a62109f800dcf4a7139ebd73858 | eb639a7d53fb40175bea5c8da86b51d14bb91f76 | refs/heads/master | 1,586,128,387,740 | 1,468,968,950,000 | 1,468,968,950,000 | 61,027,234 | 0 | 0 | null | 1,465,813,585,000 | 1,465,813,585,000 | null | UTF-8 | Lean | false | false | 12,943 | hlean | /-
Copyright (c) 2015 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
Declaration of the circle
-/
import .sphere
import types.int.hott
import algebra.homotopy_group .connectedness
open eq susp bool sphere_index is_equiv equiv is_tr... |
5c77407cc741b89791d5b73e58260e259cdb57e0 | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/algebra/lie/basic.lean | f6a8c887d4e63eb2574fd6511d1bc23382a204e0 | [
"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 | 26,710 | lean | /-
Copyright (c) 2019 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import data.bracket
import algebra.algebra.basic
import tactic.noncomm_ring
/-!
# Lie algebras
This file defines Lie rings and Lie algebras over a commutative ring togeth... |
226054cde855cb6a4eb235b1a9a98d674ca330b1 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/extra/goal_hole.lean | d8a8a2b342858a34e512ba88d2d82ad0bc568145 | [
"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 | 106 | lean | example (a b c : nat) : a = b → b = c → a = c :=
begin
intro h₁ h₂,
exact eq.trans _ h₂
end
|
1bfa421ff716f2b6f6ba621e31b5b76b5623eb55 | 853df553b1d6ca524e3f0a79aedd32dde5d27ec3 | /src/data/support.lean | 808283562912b6a3432230f9d2286a4f8db8a093 | [
"Apache-2.0"
] | permissive | DanielFabian/mathlib | efc3a50b5dde303c59eeb6353ef4c35a345d7112 | f520d07eba0c852e96fe26da71d85bf6d40fcc2a | refs/heads/master | 1,668,739,922,971 | 1,595,201,756,000 | 1,595,201,756,000 | 279,469,476 | 0 | 0 | null | 1,594,696,604,000 | 1,594,696,604,000 | null | UTF-8 | Lean | false | false | 4,861 | 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 order.conditionally_complete_lattice
import algebra.big_operators
/-!
# Support of a function
In this file we define `function.support f = {x | f x ≠ 0}` a... |
765d6c02c6719daa2315b56a58b29df1555a7b64 | 2c41ae31b2b771ad5646ad880201393f5269a7f0 | /Lean/Qualities/Manufacturable.lean | 010239c3dd5a867c8387681396b9a0ad8419c5cb | [] | no_license | kevinsullivan/Boehm | 926f25bc6f1a8b6bd47d333d936fdfc278228312 | 55208395bff20d48a598b7fa33a4d55a2447a9cf | refs/heads/master | 1,586,127,134,302 | 1,488,252,326,000 | 1,488,252,326,000 | 32,836,930 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 695 | lean | -- Manufacturable
/-
[Manufacturable] is parameterized by an instance of type [SystemType], and it's a sub-attribute to [Efficient].
An instance of type [SystemType] is deemed [Manufacturable] if and only if all the requirements are satisfied.
-/
import SystemModel.System
inductive Manufacturable (sys_type: ... |
fa8dd159cd36e5772929d351710dc6f78a8e7e5e | 94e33a31faa76775069b071adea97e86e218a8ee | /src/tactic/doc_commands.lean | 721a9e477b84bc5056940e1218c28049878d811a | [
"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 | 17,319 | lean | /-
Copyright (c) 2020 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
-/
import tactic.fix_reflect_string
/-!
# Documentation commands
We generate html documentation from mathlib. It is convenient to collect lists of tactics, commands,... |
1f90958a93ec9d96cbb986f090de2bfacec9d9df | 75db7e3219bba2fbf41bf5b905f34fcb3c6ca3f2 | /library/data/set/finite.lean | df1546892420e2a4a65078bcb59942471db68b41 | [
"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 | 8,756 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad
The notion of "finiteness" for sets. This approach is not computational: for example, just because
an element s : set A satsifies finite s doesn't mean that we can com... |
e6b32d1ff0dba60c7d93fd4006ea1770626704eb | 75db7e3219bba2fbf41bf5b905f34fcb3c6ca3f2 | /hott/homotopy/wedge.hlean | 103d9596f51871edb524710ff1699d15c2125d57 | [
"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,737 | hlean | /-
Copyright (c) 2016 Jakob von Raumer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jakob von Raumer, Ulrik Buchholtz
The Wedge Sum of Two Pointed Types
-/
import hit.pointed_pushout .connectedness
open eq pushout pointed Pointed unit
definition Wedge (A B : Type... |
ccff7eb61239f13c8a2452af8ed996f75998d99a | 30b012bb72d640ec30c8fdd4c45fdfa67beb012c | /data/equiv/list.lean | bfb13a3c15ff8b5bd15280ea55aa473c3207ab13 | [
"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 | 8,940 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
Additional equiv and encodable instances for lists and finsets.
-/
import data.equiv.denumerable data.nat.pairing order.order_iso
data.vector2 data.array.lemmas data.f... |
a65cae65b2579134b12f9d579ddf5f3309210a94 | 6b2a480f27775cba4f3ae191b1c1387a29de586e | /group_rep1/sommation.lean | 51812dd7b9cf98cc119323cc1f3b03fe0d13acf8 | [] | no_license | Or7ando/group_representation | a681de2e19d1930a1e1be573d6735a2f0b8356cb | 9b576984f17764ebf26c8caa2a542d248f1b50d2 | refs/heads/master | 1,662,413,107,324 | 1,590,302,389,000 | 1,590,302,389,000 | 258,130,829 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 2,021 | lean | import linear_algebra.basic
import data.fintype.basic
import algebra.big_operators
import data.finset algebra.big_operators
import data.set.function
import data.equiv.basic
open finset
open equiv function fintype finset
universes u v w
namespace technical
notation `Σ` := finset.sum finset.univ
variables {α : Ty... |
7200f52e315ba5a6fe90d2d4471547d5ff9f7f9d | 75db7e3219bba2fbf41bf5b905f34fcb3c6ca3f2 | /hott/algebra/category/category.hlean | e07f82ab02c533c27586f665e0beb428f11d391f | [
"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 | 4,797 | hlean | /-
Copyright (c) 2014 Jakob von Raumer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jakob von Raumer
-/
import .iso
open iso is_equiv equiv eq is_trunc sigma equiv.ops
/-
A category is a precategory extended by a witness
that the function from paths to isomorp... |
7e6c81e6a60dc2e0855a4ca50d0a925afdd41535 | 07c6143268cfb72beccd1cc35735d424ebcb187b | /src/algebra/continued_fractions/terminated_stable.lean | 25def8a55ea4ca982142b8fbff09970cf9b18cf2 | [
"Apache-2.0"
] | permissive | khoek/mathlib | bc49a842910af13a3c372748310e86467d1dc766 | aa55f8b50354b3e11ba64792dcb06cccb2d8ee28 | refs/heads/master | 1,588,232,063,837 | 1,587,304,803,000 | 1,587,304,803,000 | 176,688,517 | 0 | 0 | Apache-2.0 | 1,553,070,585,000 | 1,553,070,585,000 | null | UTF-8 | Lean | false | false | 4,650 | 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.translations
/-!
# Stabilisation of gcf Computations Under Termination
## Summary
We show that the continuants and convergent... |
62792f50a2d11007f06545ae7959a527abe7fa5d | 2896b9fe3a438a5619c7c90fc035be5592aa6c95 | /src/zero_divisors_and_nilpotents.lean | 3864d7cfd09d93d6fbd4f7c9c04f9867fe7489ac | [] | no_license | anrddh/commutative-algebra-playground | 29f29210083ada4ea2e04e1dc2016e8a2a028782 | 4f4d1701e2c21f13bba50cf1bda44ec7a125a91e | refs/heads/master | 1,656,887,159,041 | 1,589,827,091,000 | 1,589,827,091,000 | 265,029,257 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,470 | lean | import algebra.associated
import algebra.group_power
import ring_theory.ideal_operations
import ring_theory.ideals
universe u
variables {α : Type*}
open_locale classical
/- An element a of a ring α is a zero divisor if there exists a b ∈ α
such that b ≠ 0 and ab = 0. -/
def is_zero_divisor [comm_ring α] (a : α) ... |
e6de54bbb1159070d03930042ae7e3924f1a718c | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/computability/partrec.lean | 4ce2cf46d92153df0932f35c63c2e2a7d6712716 | [
"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 | 29,010 | 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 computability.primrec
import data.nat.psub
import data.pfun
/-!
# The partial recursive functions
The partial recursive functions are defined similarly to th... |
524301384c37f765ea8be6261bbde4a24a84a568 | ae1e94c332e17c7dc7051ce976d5a9eebe7ab8a5 | /stage0/src/Lean/ToExpr.lean | 25e529d3c5fd4944844a4bfa8c55e16af0afef6d | [
"Apache-2.0"
] | permissive | dupuisf/lean4 | d082d13b01243e1de29ae680eefb476961221eef | 6a39c65bd28eb0e28c3870188f348c8914502718 | refs/heads/master | 1,676,948,755,391 | 1,610,665,114,000 | 1,610,665,114,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,686 | 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
universe u
namespace Lean
class ToExpr (α : Type u) where
toExpr : α → Expr
toTypeExpr : Expr
export ToExpr (toExpr toTypeExpr)
... |
0a2eed328dab9149ac16a15baa8402deec50928b | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/data/polynomial/degree/card_pow_degree.lean | 97d35000554b12475fe3adad299b432588f51f84 | [
"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,709 | lean | /-
Copyright (c) 2021 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen
-/
import algebra.order.euclidean_absolute_value
import data.polynomial.field_division
/-!
# Absolute value on polynomials over a finite field.
Let `Fq` be a finite field of... |
0e6e56f489da38d2c67737de9433a563530b2ef5 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/topology/metric_space/gromov_hausdorff_realized.lean | 3cbe80c69dc6170aafabd214d856985ab4556384 | [
"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 | 26,160 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: 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-... |
15ac721415decce0e21d00dd2d162605d7963c8a | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch2/ex0101.lean | fd733cd57821daaf22af8d899c16271d90649a96 | [] | 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 | 161 | lean | constant m : nat
constant n : nat
constants b1 b2 : bool
#check m
#check n
#check n + 0
#check m * (n + 0)
#check b1
#check b1 && b2
#check b1 || b2
#check tt
|
017e097e628d1ab07bb6480fc7b8bf507f3f61a6 | 4fa161becb8ce7378a709f5992a594764699e268 | /src/topology/metric_space/emetric_space.lean | 112141c25eeee905b02ce35afb4a0ce7ff0afd29 | [
"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 | 39,956 | lean | /-
Copyright (c) 2015, 2017 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Robert Y. Lewis, Johannes Hölzl, Mario Carneiro, Sébastien Gouëzel
-/
import data.real.ennreal
import topology.uniform_space.uniform_embedding
import topology.unifo... |
5249b4f6a01900f7ded866eb06c4466809f3704c | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/dbgMacros.lean | 8d0d9e23f67332b1802545d23b097f371968b5a1 | [
"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 | 372 | lean | def f (x : Nat) :=
if x = 0 then panic! "unexpected zero"
else x - 1
#eval f 0
#eval f 10
def g (x : Nat) :=
if x = 0 then unreachable!
else x - 1
#eval g 0
def h (x : Nat) :=
assert! x != 0;
x - 1
#eval h 1
#eval h 0
def f2 (x : Nat) :=
dbg_trace "f2, x: {x}";
x + 1
#eval f2 10
def g2 (x : Nat) : IO Nat := do... |
a333b08a7a7ab48bc211564ba4634e2b17eeb95c | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/order/boolean_algebra.lean | 0bb2f78a6b2dee25890f6d34ceac0dd096a824fd | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,579 | 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
Type class hierarchy for Boolean algebras.
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.order.bounded_lattice
import Mathlib.PostPort
... |
3f273a94e754da2522fef1425e4cbb7978d28135 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/generalizes.lean | c1041b78e7ac2021cd6d262e6091a6d09c564c9c | [
"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 | 246 | lean | open tactic
theorem tst (A B : Type) (a : A) (b : B) : a == b → b == a :=
by do
a ← get_local `a, b ← get_local `b, B ← get_local `B,
generalizes [a, b, B],
intro_lst [`B', `b, `a], H ← intro `H,
mk_app `heq.symm [H] >>= exact
|
e32f8f8ee2353724c0b1032f27043a0ed0f69545 | 7da5ceac20aaab989eeb795a4be9639982e7b35a | /src/analysis/manifolds/manifold.lean | b9bad907296cfcda7daa1e9b71eb1d590bacbd52 | [
"MIT"
] | permissive | formalabstracts/formalabstracts | 46c2f1b3a172e62ca6ffeb46fbbdf1705718af49 | b0173da1af45421239d44492eeecd54bf65ee0f6 | refs/heads/master | 1,606,896,370,374 | 1,572,988,776,000 | 1,572,988,776,000 | 96,763,004 | 165 | 28 | null | 1,555,709,319,000 | 1,499,680,948,000 | Lean | UTF-8 | Lean | false | false | 4,057 | lean | import .basic
open pfun topological_space set
noncomputable theory
universes u v w
variables {k : ℕ∞} {E : euclidean_space.{u}}
/- topological manifolds -/
structure chart (X : Top) (E : euclidean_space) :=
(iso : X ≃ₜ. E.to_Top)
(h1 : is_open iso.to_fun.dom)
(h2 : is_open iso.inv_fun.dom)
namespace chart
vari... |
544f294ea2d8b788d4f3ac7213007935575582c7 | f3849be5d845a1cb97680f0bbbe03b85518312f0 | /library/init/meta/match_tactic.lean | f10cc3878ce523cf4efcb174129f08e8eb1e029d | [
"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 | 4,487 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.meta.tactic init.function
namespace tactic
meta structure pattern :=
/- Term to match. -/
(target : expr)
/- Set of universes that is i... |
3590ef06ff2af19d5537ab4931ec0c975534004e | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /src/Lean/Meta/LevelDefEq.lean | a7ed14ac204a16712ff4abad1eb2a804a9f9c135 | [
"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,756 | 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.CollectMVars
import Lean.Meta.Basic
import Lean.Meta.InferType
import Lean.Meta.DecLevel
namespace Lean.Meta
/--
Return true iff `lvl` ... |
1c3e83dad3a448119447a764a5aa350e377f5673 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/analysis/inner_product_space/projection.lean | 224ae229cb48cea5ec85b370b23ef56255227feb | [
"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 | 58,670 | lean | /-
Copyright (c) 2019 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou, Frédéric Dupuis, Heather Macbeth
-/
import analysis.convex.basic
import analysis.inner_product_space.basic
import analysis.normed_space.is_R_or_C
/-!
# The orthogonal pr... |
1647242be9251e6687447a802eae685922b5b57b | 4727251e0cd73359b15b664c3170e5d754078599 | /src/category_theory/monad/equiv_mon.lean | f29bfa055703666b843931f7ebbda54b9a8c7e59 | [
"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,249 | lean | /-
Copyright (c) 2020 Adam Topaz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Adam Topaz
-/
import category_theory.monad.basic
import category_theory.monoidal.End
import category_theory.monoidal.Mon_
import category_theory.category.Cat
/-!
# The equivalence betwee... |
c0f190c103d66f88f1917496e3055afadfd3ebf4 | ba4794a0deca1d2aaa68914cd285d77880907b5c | /src/game/world5/level2.lean | a83411d8a11e335d7b4e4ae72017c0d7824201d8 | [
"Apache-2.0"
] | permissive | ChrisHughes24/natural_number_game | c7c00aa1f6a95004286fd456ed13cf6e113159ce | 9d09925424da9f6275e6cfe427c8bcf12bb0944f | refs/heads/master | 1,600,715,773,528 | 1,573,910,462,000 | 1,573,910,462,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,373 | lean | import mynat.add -- + on mynat
import mynat.mul -- * on mynat
/- Tactic : intro
## Summary:
`intro p` will turn a goal `⊢ P → Q` into a hypothesis `p : P`
and goal `⊢ Q`. If `P` and `Q` are sets `intro p` means "let $p$ be an arbitrary element of $P$".
If `P` and `Q` are propositions then `intro p` says "assume $P... |
1cebd642d483aa2c71684e875991e443d70c92c2 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Compiler/LCNF/PhaseExt.lean | 6b532c80364cd2b62795fb781c4598fa8e6b2bd2 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 3,580 | lean | /-
Copyright (c) 2022 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Compiler.LCNF.PassManager
namespace Lean.Compiler.LCNF
abbrev DeclExtState := PHashMap Name Decl
private abbrev declLt (a b : Decl) :=
Name... |
a0c466b5a6c94aef0dcd0a198356ce6291d65658 | 3f7026ea8bef0825ca0339a275c03b911baef64d | /src/computability/primrec.lean | 405c30e3d677f12bdf0031ff08072453e36de484 | [
"Apache-2.0"
] | permissive | rspencer01/mathlib | b1e3afa5c121362ef0881012cc116513ab09f18c | c7d36292c6b9234dc40143c16288932ae38fdc12 | refs/heads/master | 1,595,010,346,708 | 1,567,511,503,000 | 1,567,511,503,000 | 206,071,681 | 0 | 0 | Apache-2.0 | 1,567,513,643,000 | 1,567,513,643,000 | null | UTF-8 | Lean | false | false | 50,093 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
The primitive recursive functions are the least collection of functions
nat → nat which are closed under projections (using the mkpair
pairing function), composition, ze... |
ebc89b9bc86b56c51d0420d2e2cb6c8773364925 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /library/init/meta/environment.lean | c303b7f5d5eca685ebfa2e0c1e21ff061d34aa7c | [
"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 | 6,266 | 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.declaration init.meta.exceptional init.data.option.basic
import init.meta.rb_map
meta constant environment : Type
namespace envir... |
bbd5ae8906324a5df986bbda801bf954032ee291 | e030b0259b777fedcdf73dd966f3f1556d392178 | /library/init/algebra/ordered_group.lean | 31cfbb7c09a9d076a67027a7c362b2e2710f1e20 | [
"Apache-2.0"
] | permissive | fgdorais/lean | 17b46a095b70b21fa0790ce74876658dc5faca06 | c3b7c54d7cca7aaa25328f0a5660b6b75fe26055 | refs/heads/master | 1,611,523,590,686 | 1,484,412,902,000 | 1,484,412,902,000 | 38,489,734 | 0 | 0 | null | 1,435,923,380,000 | 1,435,923,379,000 | null | UTF-8 | Lean | false | false | 23,105 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura
-/
prelude
import init.algebra.order init.algebra.group
/- Make sure instances defined in this file have lower priority than the ones
define... |
ecba8d9889dc2f48952611c82ab9e1e3843195b3 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/combinatorics/hales_jewett.lean | 0102dc5a1bf837d5b629a5e785790a0b9f691299 | [
"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 | 15,455 | lean | /-
Copyright (c) 2021 David Wärn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Wärn
-/
import data.fintype.basic
import algebra.big_operators.basic
/-!
# The Hales-Jewett theorem
We prove the Hales-Jewett theorem and deduce Van der Waerden's theorem as a coro... |
d34d5ede6df1370881f724e7178f4413c3b7f79e | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/run/IO3.lean | 9d3e7dd3ef25511f3321ecda5fb49db45afd2859 | [
"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 | 217 | lean | import system.IO
definition main : IO unit :=
do { l ← get_line,
if l = "hello" then
put_str "you have typed hello\n"
else
do {put_str "you did not type hello\n", put_str "-----------\n"} }
|
6c2c951f6fe475713aa20384a75ab32e9b656990 | f7315930643edc12e76c229a742d5446dad77097 | /library/data/encodable.lean | 3c1619a1120a49e0eb210f1ddfd8dfc0d888c89f | [
"Apache-2.0"
] | permissive | bmalehorn/lean | 8f77b762a76c59afff7b7403f9eb5fc2c3ce70c1 | 53653c352643751c4b62ff63ec5e555f11dae8eb | refs/heads/master | 1,610,945,684,489 | 1,429,681,220,000 | 1,429,681,449,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,365 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: data.encodable
Author: Leonardo de Moura
Type class for encodable types.
Note that every encodable type is countable.
-/
import data.fintype data.list data.sum data.nat data.su... |
6183efa58bfeb659c84e86686c4f4b185c6a6855 | 618003631150032a5676f229d13a079ac875ff77 | /src/tactic/omega/int/preterm.lean | 3ac51ba3e14a62dc7c1b052786942c266240439e | [
"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 | 2,807 | lean | /- Copyright (c) 2019 Seul Baek. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Seul Baek
Linear integer arithmetic terms in pre-normalized form. -/
import tactic.omega.term
namespace omega
namespace int
/-- The shadow syntax for arithmetic terms. All constants are r... |
c38823237e161758ce99b110967b7cb84b0afde6 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/trace2.lean | e0d20eded75dc1485934c7decf0f4ab6b1d33854 | [
"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 | 308 | lean | open tactic
declare_trace foo.bla
example : true :=
by do
when_tracing `foo.bla $ do {
trace "hello",
trace "world" },
constructor
set_option trace.foo.bla true
#print "------------"
example : true :=
by do
when_tracing `foo.bla $ do {
trace "hello",
trace "world" },
constructor
|
17708f6964b5ecaebafe8625f1d0b3f43a8ed352 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /src/Init/Data/RBTree/Basic.lean | 2a0513c97c91e940afae53c3e16cb95b425ddfb7 | [
"Apache-2.0"
] | permissive | mhuisi/lean4 | 28d35a4febc2e251c7f05492e13f3b05d6f9b7af | dda44bc47f3e5d024508060dac2bcb59fd12e4c0 | refs/heads/master | 1,621,225,489,283 | 1,585,142,689,000 | 1,585,142,689,000 | 250,590,438 | 0 | 2 | Apache-2.0 | 1,602,443,220,000 | 1,585,327,814,000 | C | UTF-8 | Lean | false | false | 2,887 | 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.Data.RBMap.Basic
universes u v w
def RBTree (α : Type u) (lt : α → α → Bool) : Type u :=
RBMap α Unit lt
@[inline] def mkRBTree (α : T... |
ba02ff8ef0418ea60181b927f89bf531be0e7618 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/computability/tm_to_partrec.lean | 0c710e6bd6b2c1aa180fb29f5fe74b03bf2ebdcf | [
"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 | 81,082 | lean | /-
Copyright (c) 2020 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import computability.halting
import computability.turing_machine
import data.num.lemmas
import tactic.derive_fintype
/-!
# Modelling partial recursive functions usin... |
60cd9a35018dab6ae54e80d9f3caef79608e5251 | 49bd2218ae088932d847f9030c8dbff1c5607bb7 | /src/topology/algebra/infinite_sum.lean | 474b6bc9ae60ee71d26ccbfd46b295f01813a449 | [
"Apache-2.0"
] | permissive | FredericLeRoux/mathlib | e8f696421dd3e4edc8c7edb3369421c8463d7bac | 3645bf8fb426757e0a20af110d1fdded281d286e | refs/heads/master | 1,607,062,870,732 | 1,578,513,186,000 | 1,578,513,186,000 | 231,653,181 | 0 | 0 | Apache-2.0 | 1,578,080,327,000 | 1,578,080,326,000 | null | UTF-8 | Lean | false | false | 28,983 | 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
Infinite sum over a topological monoid
This sum is known as unconditionally convergent, as it sums to the same value under all possible
permutations. For Euclidean spa... |
a1015dbf54216ced84463ade6403981fec40466e | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/lean/run/structInst4.lean | a1b7ad59582fba9f36d8fd30e36fce9683f0aacd | [
"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 | 492 | lean | universes u
def a : Array ((Nat × Nat) × Bool) := #[]
def b : Array Nat := #[]
structure Foo :=
(x : Array ((Nat × Nat) × Bool) := #[])
(y : Nat := 0)
new_frontend
#check (b).modifyOp (idx := 1) (fun s => 2)
#check { [1] := 2, .. b }
#check { [1].fst.2 := 1, .. a }
def foo : Foo := {}
#check foo.x[1].1.2
#chec... |
6204a381c7ee0737922dc34612b1d5be568f6a0d | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/ring_theory/flat.lean | 802c2fac29e2132b79d330f1438ba6ecec1e2ff6 | [
"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 | 2,591 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import ring_theory.noetherian
/-!
# Flat modules
A module `M` over a commutative ring `R` is *flat*
if for all finitely generated ideals `I` of `R`,
the canonical ... |
ed5240bf0f83088dc9da9032bc0f5f32fe67419a | 5ee26964f602030578ef0159d46145dd2e357ba5 | /src/valuation/canonical.lean | ca99c24a60c5e3fa150826919f15e7e0cac9aa41 | [
"Apache-2.0"
] | permissive | fpvandoorn/lean-perfectoid-spaces | 569b4006fdfe491ca8b58dd817bb56138ada761f | 06cec51438b168837fc6e9268945735037fd1db6 | refs/heads/master | 1,590,154,571,918 | 1,557,685,392,000 | 1,557,685,392,000 | 186,363,547 | 0 | 0 | Apache-2.0 | 1,557,730,933,000 | 1,557,730,933,000 | null | UTF-8 | Lean | false | false | 32,511 | lean | import valuation.basic
import for_mathlib.quotient_group
import for_mathlib.subgroup
import for_mathlib.group -- group_equiv
/-
The purpose of this file is to define a "canonical" valuation equivalent to
a given valuation. The whole raison d'etre for this is that there are set-theoretic
issues with the equiv... |
453b5cb4251cf23f1e10e5846ad7d7b171828d68 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/data/list/instances.lean | 0a995a9c5ade4ab5ee99ebdf9648082443eaeff6 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,102 | 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
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.data.list.lemmas
universes u_1 u
namespace Mathlib
protected instance list.monad : Monad List :=
... |
161b88993a89a21d233821f2dd5261b3ffdcc0dd | 492a7e27d49633a89f7ce6e1e28f676b062fcbc9 | /src/monoidal_categories_reboot/monoidal_functor.lean | f5bbf723d772b0ceac3b3ceccdcfd9abb2f8c4fb | [
"Apache-2.0"
] | permissive | semorrison/monoidal-categories-reboot | 9edba30277de48a234b63813cf85b171772ce36f | 48b5f1d535daba4e591672042a298ac36be2e6dd | refs/heads/master | 1,642,472,396,149 | 1,560,587,477,000 | 1,560,587,477,000 | 156,465,626 | 0 | 1 | null | 1,541,549,278,000 | 1,541,549,278,000 | null | UTF-8 | Lean | false | false | 7,597 | lean | -- -- Copyright (c) 2018 Michael Jendrusch. All rights reserved.
-- -- Released under Apache 2.0 license as described in the file LICENSE.
-- -- Authors: Michael Jendrusch, Scott Morrison
-- import .monoidal_category
-- open category_theory
-- open tactic
-- universes v₁ v₂ v₃ u₁ u₂ u₃
-- open category_theory.catego... |
7211ee9a31ec8b7de6f533639c594e62a31a8317 | 076f5040b63237c6dd928c6401329ed5adcb0e44 | /answers/hw6_prop_logic_key.lean | 1e41b8be57ce0c3b24fc9c070b36d826919e2dd2 | [] | no_license | kevinsullivan/uva-cs-dm-f19 | 0f123689cf6cb078f263950b18382a7086bf30be | 09a950752884bd7ade4be33e9e89a2c4b1927167 | refs/heads/master | 1,594,771,841,541 | 1,575,853,850,000 | 1,575,853,850,000 | 205,433,890 | 4 | 9 | null | 1,571,592,121,000 | 1,567,188,539,000 | Lean | UTF-8 | Lean | false | false | 7,097 | lean | namespace prop_logic
/- [25 points total, as indicated below]
This assignment has five problems. The first
is to extend our propositional logic syntax
and semantics to support the three additional
connectives, exclusive or (⊕), implies (which
we will write as ⇒), and if and only iff (↔).
We first give you the defini... |
8dc048899ecc57d77849e6ce2a4bfbcff0b9bc7b | abd85493667895c57a7507870867b28124b3998f | /src/ring_theory/noetherian.lean | 55f3ba6460830cda5b8e1c5d377b521f39ed2aba | [
"Apache-2.0"
] | permissive | pechersky/mathlib | d56eef16bddb0bfc8bc552b05b7270aff5944393 | f1df14c2214ee114c9738e733efd5de174deb95d | refs/heads/master | 1,666,714,392,571 | 1,591,747,567,000 | 1,591,747,567,000 | 270,557,274 | 0 | 0 | Apache-2.0 | 1,591,597,975,000 | 1,591,597,974,000 | null | UTF-8 | Lean | false | false | 23,154 | lean | /-
Copyright (c) 2018 Mario Carneiro and Kevin Buzzard. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Kevin Buzzard
-/
import ring_theory.ideal_operations
import linear_algebra.basis
/-!
# Noetherian rings and modules
The following are equivalent for... |
3d89b02c17ed1f4268299d0bcc78ba992f1b5d9a | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /src/Lean/Elab/Deriving/BEq.lean | 7357f952f7cf693aff5ed684ca076bfe94840e67 | [
"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 | 4,447 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Meta.Transform
import Lean.Elab.Deriving.Basic
import Lean.Elab.Deriving.Util
namespace Lean.Elab.Deriving.BEq
open Lean.Parser.Term
open Meta
... |
12fb475bd7d5fb0b381018fb4538d3dabd5fe36d | 649957717d58c43b5d8d200da34bf374293fe739 | /src/tactic/norm_num.lean | cf907f4baae25e41238a5b68bba63e9594b0e945 | [
"Apache-2.0"
] | permissive | Vtec234/mathlib | b50c7b21edea438df7497e5ed6a45f61527f0370 | fb1848bbbfce46152f58e219dc0712f3289d2b20 | refs/heads/master | 1,592,463,095,113 | 1,562,737,749,000 | 1,562,737,749,000 | 196,202,858 | 0 | 0 | Apache-2.0 | 1,562,762,338,000 | 1,562,762,337,000 | null | UTF-8 | Lean | false | false | 18,836 | lean | /-
Copyright (c) 2017 Simon Hudon All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon, Mario Carneiro
Evaluating arithmetic expressions including *, +, -, ^, ≤
-/
import algebra.group_power data.rat.basic data.nat.prime
import tactic.interactive tactic.convert... |
7a986d2b1acf2a62c19916ea66995ffaac2291cd | 453dcd7c0d1ef170b0843a81d7d8caedc9741dce | /analysis/topology/uniform_space.lean | ab01d36489e88481567be85c7ddb9b17632981a8 | [
"Apache-2.0"
] | permissive | amswerdlow/mathlib | 9af77a1f08486d8fa059448ae2d97795bd12ec0c | 27f96e30b9c9bf518341705c99d641c38638dfd0 | refs/heads/master | 1,585,200,953,598 | 1,534,275,532,000 | 1,534,275,532,000 | 144,564,700 | 0 | 0 | null | 1,534,156,197,000 | 1,534,156,197,000 | null | UTF-8 | Lean | false | false | 77,489 | 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
Theory of uniform spaces.
Uniform spaces are a generalization of metric spaces and topological groups. Many concepts directly
generalize to uniform spa... |
908b974c69fa4e3bfd3235783aaaf4231d56d298 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/data/nat/totient.lean | ccb0ee180f622c90773fa280afc5ec09bae86280 | [
"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 | 7,735 | 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.basic
import data.nat.prime
import data.zmod.basic
/-!
# Euler's totient function
This file defines [Euler's totient function][https://en.w... |
36c7f6801eb18c0b0620f16b9a9d75bc5457089d | 618003631150032a5676f229d13a079ac875ff77 | /src/tactic/reassoc_axiom.lean | 6bdd3951cb4b9849b9e233333627c97b830ba680 | [
"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,051 | lean | /-
Copyright (c) 2019 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Simon Hudon
-/
import category_theory.category
/-!
# Tools to reformulate category-theoretic axioms in a more associativity-friendly way
## The `reassoc` attribute
The `reassoc` attr... |
0f1328593c1920a612b08dbc06446c7658cd6e6f | 853df553b1d6ca524e3f0a79aedd32dde5d27ec3 | /src/data/rat/order.lean | 01e4b2a865001e6d2b2d3af8c8934d5fa4739b88 | [
"Apache-2.0"
] | permissive | DanielFabian/mathlib | efc3a50b5dde303c59eeb6353ef4c35a345d7112 | f520d07eba0c852e96fe26da71d85bf6d40fcc2a | refs/heads/master | 1,668,739,922,971 | 1,595,201,756,000 | 1,595,201,756,000 | 279,469,476 | 0 | 0 | null | 1,594,696,604,000 | 1,594,696,604,000 | null | UTF-8 | Lean | false | false | 9,351 | lean | /-
Copyright (c) 2019 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro
-/
import data.rat.basic
/-!
# Order for Rational Numbers
## Summary
We define the order on `ℚ`, prove that `ℚ` is a discrete, linearly ordered field, ... |
abca62e9197cf2964e1a36439cc3609752980ab9 | 626e312b5c1cb2d88fca108f5933076012633192 | /src/algebra/field_power.lean | 03054085300048b4358b05822c8956301429f17c | [
"Apache-2.0"
] | permissive | Bioye97/mathlib | 9db2f9ee54418d29dd06996279ba9dc874fd6beb | 782a20a27ee83b523f801ff34efb1a9557085019 | refs/heads/master | 1,690,305,956,488 | 1,631,067,774,000 | 1,631,067,774,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,127 | lean | /-
Copyright (c) 2018 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
-/
import algebra.group_with_zero.power
import tactic.linarith
/-!
# Integer power operation on fields and division rings
This file collects basic facts about the op... |
a3cc3c14bc4100423ab5471b443f8a2c42558303 | 649957717d58c43b5d8d200da34bf374293fe739 | /src/topology/Top/adjunctions.lean | 3ff6336f4990ee47340e761c4f7105a855b68fc6 | [
"Apache-2.0"
] | permissive | Vtec234/mathlib | b50c7b21edea438df7497e5ed6a45f61527f0370 | fb1848bbbfce46152f58e219dc0712f3289d2b20 | refs/heads/master | 1,592,463,095,113 | 1,562,737,749,000 | 1,562,737,749,000 | 196,202,858 | 0 | 0 | Apache-2.0 | 1,562,762,338,000 | 1,562,762,337,000 | null | UTF-8 | Lean | false | false | 844 | lean | -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Patrick Massot, Mario Carneiro
import topology.Top.basic
import category_theory.adjunction.basic
universe u
open category_theory
open Top
namespace Top
def adj₁ : discrete ⊣... |
153443104c94f6a5628ea4c920fa97fee68c400d | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/tst10.lean | c0221bb8b4a6b0b03b767e65be962461dee5dde1 | [
"Apache-2.0"
] | permissive | codyroux/lean0.1 | 1ce92751d664aacff0529e139083304a7bbc8a71 | 0dc6fb974aa85ed6f305a2f4b10a53a44ee5f0ef | refs/heads/master | 1,610,830,535,062 | 1,402,150,480,000 | 1,402,150,480,000 | 19,588,851 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 361 | lean | variable a : Bool
variable b : Bool
-- Conjunctions
print a && b
print a && b && a
print a /\ b
print a ∧ b
print (and a b)
print and a b
-- Disjunctions
print a || b
print a \/ b
print a ∨ b
print (or a b)
print or a (or a b)
-- Simple Formulas
print a → b → a
check a → b
eval a → a
eval true → a
-- Simple proof
axiom... |
a1adadee024c1a410dd20f197b62a1589a943de2 | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/algebra/group_ring_action.lean | c8b778a4d0c2935d2708c4bbca8dae1096d54f74 | [
"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 | 5,460 | lean | /-
Copyright (c) 2020 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import group_theory.group_action.group
import data.equiv.ring
import deprecated.subring
/-!
# Group action on rings
This file defines the typeclass of monoid acting on semir... |
5250f4562c0f0a02d158b4956520324dcde493e1 | 947b78d97130d56365ae2ec264df196ce769371a | /tests/lean/run/inj1.lean | 71505264f1a4393b283ccc85596fc2b8ac6075fc | [
"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 | 930 | lean | new_frontend
theorem test1 {α} (a b : α) (as bs : List α) (h : a::as = b::bs) : a = b :=
by {
injection h;
assumption;
}
theorem test2 {α} (a b : α) (as bs : List α) (h : a::as = b::bs) : a = b :=
by {
injection h with h1 h2;
exact h1
}
theorem test3 {α} (a b : α) (as bs : List α) (h : (x : List α) → (y : Li... |
707d5ef4d8e34cdcef8cc7187eada076e8a7e64a | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/analysis/calculus/extend_deriv_auto.lean | a3d70c45f334080e8c8790d96b71699aefa0c233 | [] | 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 | 3,531 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.analysis.calculus.mean_value
import Mathlib.tactic.monotonicity.default
import Mathli... |
ef4ab6ec0558970791fb60657da8f8a79c3faa84 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/run/add_interactive.lean | 7d211ef6740d575e028cb3cc6b4f5a4be716ce90 | [
"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 | 293 | lean | namespace foo
namespace bla
open lean.parser interactive interactive.types
meta def my_exact (q : parse texpr) :=
tactic.interactive.exact q
/- Copy tactic my_exact to tactic.interactive. -/
run_cmd add_interactive [`my_exact]
end bla
example : true :=
begin
my_exact trivial
end
end foo
|
9f2fcc15b71d4d6e1976d28d7c0f0fc20551c168 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/category_theory/limits/shapes/kernel_pair.lean | 8ede928ca3455ac88647f853695dfff0087f8a1f | [
"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 | 6,164 | 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... |
ff79c94e54f2f66d10b5932af95638c3bd57b9c6 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/tactic/ring_exp.lean | c4c6e06c0807985c8a22c8b8e7264c29a3003fc6 | [
"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 | 57,247 | lean | /-
Copyright (c) 2019 Tim Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Tim Baanen
-/
import tactic.norm_num
import control.traversable.basic
/-!
# `ring_exp` tactic
A tactic for solving equations in commutative (semi)rings,
where the exponents can also cont... |
0fedab747eb15dc897e9791fbfc0580c8c5a04d4 | 6b66bef80b7e8adaed86c183cf24aa8f92f20803 | /LeanTools.lean | 066dc82830247f8002f3ef3572ea2e48291aabc9 | [
"MIT"
] | permissive | JasonGross/lean-tools | f5495e6a24061a2f268fd0871c88cb4ece8d3355 | 110f63934b9d8c9088b0a944a38ed975b740a507 | refs/heads/main | 1,679,568,529,028 | 1,616,441,204,000 | 1,616,441,204,000 | 349,493,484 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,157 | lean | import LeanTools.FindBug
import LeanTools.CommandLineColors
--import Cli
--open Cli
open LeanTools
/-
def run (args : Parsed) : IO UInt32 := pure 0
def cmd : Cmd := `[Cli|
LeanTools VIA run; ["0.0.1"]
"A collection of command-line tools for processing Lean files."
FLAGS:
SUBCOMMANDS:
FindBug.cmd
]
def ... |
49a9092a601bdfa9c6dd26eb5754f77fca952bde | 94e33a31faa76775069b071adea97e86e218a8ee | /src/category_theory/limits/constructions/finite_products_of_binary_products.lean | 3506c733d254869d6bba59c8fdd38339cfd96869 | [
"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 | 13,110 | 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.preserves.shapes.binary_products
import category_theory.limits.preserves.shapes.products
import category_theory.limits.shapes.binary_product... |
ef658b5f16a0d36663e2723f9073568160d69007 | 7d5ad87afb17e514aee234fcf0a24412eed6384f | /src/zfc.lean | 221bd156c1508b92e4dfdeea5afc2871b9e9a6df | [] | no_license | digama0/flypitch | 764f849eaef59c045dfbeca142a0f827973e70c1 | 2ec14b8da6a3964f09521d17e51f363d255b030f | refs/heads/master | 1,586,980,069,651 | 1,547,078,141,000 | 1,547,078,283,000 | 164,965,135 | 1 | 0 | null | 1,547,082,858,000 | 1,547,082,857,000 | null | UTF-8 | Lean | false | false | 14,322 | lean | import .fol set_theory.zfc tactic.tidy
open fol
namespace zfc
inductive ZFC_rel : ℕ → Type 1
| ϵ : ZFC_rel 2
def L_ZFC : Language.{1} :=
⟨λ_, ulift empty, ZFC_rel⟩
/- Note from Mario: should try using L_ZFC' -/
def ZFC_el : L_ZFC.relations 2 := ZFC_rel.ϵ
local infix ` ∈' `:100 := bounded_formula_of_relation ZFC... |
5c2740702545469e6fe546bb0315d338957683c4 | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/linear_algebra/affine_space/affine_equiv.lean | 29ab17b6a9d414dbd7f816a6dd639359f1c4d508 | [
"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 | 13,991 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov
-/
import linear_algebra.affine_space.affine_map
import algebra.invertible
/-!
# Affine equivalences
In this file we define `affine_equiv k P₁ P₂` (notation: `... |
1954106705381ea126f88d332f07bdf1b6ea0c29 | 2cf781335f4a6706b7452ab07ce323201e2e101f | /lean/deps/galois_stdlib/src/galois/data/fin.lean | 317a807603dd5ff1ca7df11e72f1e61fb441807a | [
"Apache-2.0"
] | permissive | simonjwinwood/reopt-vcg | 697cdd5e68366b5aa3298845eebc34fc97ccfbe2 | 6aca24e759bff4f2230bb58270bac6746c13665e | refs/heads/master | 1,586,353,878,347 | 1,549,667,148,000 | 1,549,667,148,000 | 159,409,828 | 0 | 0 | null | 1,543,358,444,000 | 1,543,358,444,000 | null | UTF-8 | Lean | false | false | 1,767 | lean | namespace fin
section
parameter (n:ℕ)
parameter (P:fin n → Prop)
parameter [dp:decidable_pred P]
def extend_lt {i j} : fin i → i < j → fin j
| x i_le_j := ⟨x.val, nat.lt_trans x.is_lt i_le_j⟩
def extend {i j} : fin i → i ≤ j → fin j
| x i_le_j := ⟨x.val, nat.lt_of_lt_of_le x.is_lt i_le_j⟩
def decidable_forall.part... |
aa6e54d386c77d292f4d321e6b9ed6f0f27b1829 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/measure_theory/integral/mean_inequalities.lean | ed7518c25ad77542fee774e59193e515c18cbcb3 | [
"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 | 19,799 | lean | /-
Copyright (c) 2020 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.integral.lebesgue
import analysis.mean_inequalities
import analysis.mean_inequalities_pow
import measure_theory.function.special_functions
/-!
# Me... |
c145784fec4deac6c254823f401661b3fa99c1e7 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/doNotation2.lean | 4989812923f0beb360a3bffca4154a90a1a6fb2a | [
"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,128 | lean | def f (x : Nat) : IO Nat := do
IO.println "hello world"
let aux (y : Nat) (z : Nat) : IO Nat := do
IO.println "aux started"
IO.println s!"y: {y}, z: {z}"
pure (x+y)
discard <| aux x
(x + 1) -- It is part of the application since it is indented
discard <| aux x (x -- parentheses use `withoutPosition`
-1)
discard... |
d9c932d4f0830397a1c042088fc7a2a867f06c24 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebra/category/FinVect/limits.lean | b32cdaf9da322e569d972432fdb019da8b7adf48 | [
"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,862 | lean | /-
Copyright (c) 2022 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import algebra.category.FinVect
import algebra.category.Module.limits
import algebra.category.Module.products
import algebra.category.Module.epi_mono
import category_... |
24ba74eafba315d96106b8ded5973a99797ffa8d | 367134ba5a65885e863bdc4507601606690974c1 | /src/algebra/ring/boolean_ring.lean | dabfc1b598cdc8e650700a9bd60c85ca2973d458 | [
"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 | 5,213 | lean | /-
Copyright (c) 2021 Bryan Gin-ge Chen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bryan Gin-ge Chen
-/
import tactic.ring
import tactic.abel
/-!
# Boolean rings
A Boolean ring is a ring where multiplication is idempotent. They are equivalent to Boolean
algebra... |
4fb5a37b6c86f184c8dd37c0fae364b94077abbf | 36938939954e91f23dec66a02728db08a7acfcf9 | /lean4/test-symbolic/Main.lean | 41c4a41c40e5d2f89b2d52ae8134415282a73256 | [] | no_license | pnwamk/reopt-vcg | f8b56dd0279392a5e1c6aee721be8138e6b558d3 | c9f9f185fbefc25c36c4b506bbc85fd1a03c3b6d | refs/heads/master | 1,631,145,017,772 | 1,593,549,019,000 | 1,593,549,143,000 | 254,191,418 | 0 | 0 | null | 1,586,377,077,000 | 1,586,377,077,000 | null | UTF-8 | Lean | false | false | 2,257 | lean |
-- import system.io
import Galois.Init.Io
-- FIXME!! this is from the simulator
import Main.Translate
import X86Semantics.SymbolicBackend
import DecodeX86.DecodeX86
import SMTLIB.Syntax
namespace x86
namespace symbolic
def throwS {a : Type} {m : Type -> Type} [MonadIO m] (e : String) : m a :=
monadLift (throw (IO... |
fcd8bed6212380d47556633291278abc724fcf16 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/tactic/solve_by_elim.lean | b51b2f5c7490c238be089763bf4f4afdb335c188 | [
"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,187 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon, Scott Morrison
-/
import tactic.core
/-!
# solve_by_elim
A depth-first search backwards reasoner.
`solve_by_elim` takes a list of lemmas, and repeating tries to `apply` th... |
731e7b17dce144bfdb34786a387ef94c2a75cdcd | 64874bd1010548c7f5a6e3e8902efa63baaff785 | /tests/lean/run/nat_bug2.lean | ee29522d742151ffbe5a64534131138b49e6543c | [
"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 | 707 | lean | import logic
open eq.ops
namespace experiment
inductive nat : Type :=
zero : nat,
succ : nat → nat
namespace nat
definition plus (x y : nat) : nat
:= nat.rec x (λn r, succ r) y
definition to_nat [coercion] (n : num) : nat
:= num.rec zero (λn, pos_num.rec (succ zero) (λn r, plus r (plus r (succ zero))) (λn r, plus r r)... |
680bb4e44bf9a900cf44f082f2242fbe6c55e733 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/algebra/group/basic.lean | 1d0f5dac1609fd30e03d0c792373530983e3d52a | [
"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 | 16,518 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Simon Hudon, Mario Carneiro
-/
import algebra.group.defs
import logic.function.basic
/-!
# Basic lemmas about semigroups, monoids, and groups
This f... |
cc172153d7dda50075aa822944ee3b90dab7e3bd | 38ee9024fb5974f555fb578fcf5a5a7b71e669b5 | /Mathlib/Data/List/Perm.lean | 0913120f43c9a6107b1a9c328129b95aa0bded4f | [
"Apache-2.0"
] | permissive | denayd/mathlib4 | 750e0dcd106554640a1ac701e51517501a574715 | 7f40a5c514066801ab3c6d431e9f405baa9b9c58 | refs/heads/master | 1,693,743,991,894 | 1,636,618,048,000 | 1,636,618,048,000 | 373,926,241 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,222 | lean | import Mathlib.Init.Set
import Mathlib.Data.List.Basic
namespace List
/-- `Perm l₁ l₂` or `l₁ ~ l₂` asserts that `l₁` and `l₂` are Permutations
of each other. This is defined by induction using pairwise swaps. -/
inductive Perm : List α → List α → Prop
| nil : Perm [] []
| cons : ∀ (x : α) {l₁ l₂ : List α}, Perm... |
0f178464202da9e693dd5e38762f80416ab60b8e | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/topology/stone_cech.lean | 522e2f27ea8e7f1091daac08dbc8d6ff900657e7 | [
"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 | 11,205 | lean | /-
Copyright (c) 2018 Reid Barton. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Reid Barton
-/
import topology.bases
import topology.dense_embedding
/-! # Stone-Čech compactification
Construction of the Stone-Čech compactification using ultrafilters.
Parts of the ... |
4a0a446007cdf1d0857aa51061dc0650250fd39d | 0c1546a496eccfb56620165cad015f88d56190c5 | /tests/lean/run/apply4.lean | e3ea11c88ba8aca3246bf33c40b4d118a39c8ca8 | [
"Apache-2.0"
] | permissive | Solertis/lean | 491e0939957486f664498fbfb02546e042699958 | 84188c5aa1673fdf37a082b2de8562dddf53df3f | refs/heads/master | 1,610,174,257,606 | 1,486,263,620,000 | 1,486,263,620,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,006 | lean | open tactic bool
universe variables u
constant foo {A : Type u} [inhabited A] (a b : A) : a = default A → a = b
example (a b : nat) : a = 0 → a = b :=
by do
intro `H,
apply (expr.const `foo [level.of_nat 0]),
trace_state,
assumption
definition ex : inhabited (nat × nat × bool) :=
by apply_instance
set_option... |
7ce969155bafb2d3c25a684276e7e7eb83bbf97d | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/analysis/calculus/implicit.lean | 21bbda6901e3adabe4118e743c6fb8347675d5ba | [
"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 | 20,906 | 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.inverse
import analysis.normed_space.complemented
/-!
# Implicit function theorem
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any change... |
600b9d9f6740d18b623fc6621b3daa774ce2fdf2 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/pplevel.lean | 06bc3ba33c84284a6b6fa248123250802f8e329d | [
"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 | 180 | lean | universe u v w
set_option pp.universes true
#check Type (max u v w)
#check Type u
#check @id.{max u v w}
#check Monad.{max u v, w+1}
#check Type (max (u+1) w (v+2))
#check Type _
|
2dcd279521be4efe0d09e57d05a2bb13d98d1cc9 | 92b50235facfbc08dfe7f334827d47281471333b | /hott/types/hprop_trunc.hlean | 44060c3d3d436934e423b6d2b5ebd495cba2ef6f | [
"Apache-2.0"
] | permissive | htzh/lean | 24f6ed7510ab637379ec31af406d12584d31792c | d70c79f4e30aafecdfc4a60b5d3512199200ab6e | refs/heads/master | 1,607,677,731,270 | 1,437,089,952,000 | 1,437,089,952,000 | 37,078,816 | 0 | 0 | null | 1,433,780,956,000 | 1,433,780,955,000 | null | UTF-8 | Lean | false | false | 1,793 | hlean | /-
Copyright (c) 2015 Jakob von Raumer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jakob von Raumer, Floris van Doorn
Proof of the theorem that (is_trunc n A) is a mere proposition
We prove this here to avoid circular dependency of files
We want to use this in .eq... |
042bd55c1e22e8082a3c916b1aff3940af2c4e16 | 32317185abf7e7c963f4c67c190aec61af6b3628 | /library/theories/combinatorics/choose.lean | 464de0efc87d2d171921d38647ba56ef7382125b | [
"Apache-2.0"
] | permissive | Andrew-Zipperer-unorganized/lean | 198a2317f21198cd8d26e7085e484b86277f17f7 | dcb35008e1474a0abebe632b1dced120e5f8c009 | refs/heads/master | 1,622,526,520,945 | 1,453,576,559,000 | 1,454,612,842,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,528 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad
Binomial coefficients, "n choose k".
-/
import data.nat.div data.nat.fact data.finset
open decidable
namespace nat
/- choose -/
definition choose : ℕ → ℕ → ℕ
| 0 0 ... |
5cea39b798e37b89bc3b1d94a9a048a1a6cb64c4 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/geometry/manifold/local_invariant_properties.lean | 7ad8c5f6bc848aecd0a1fab8ce3b4c5338fad8a0 | [
"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 | 25,432 | lean | /-
Copyright (c) 2020 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import geometry.manifold.smooth_manifold_with_corners
/-!
# Local properties invariant under a groupoid
We study properties of a triple `(g, s, x)` where `g` ... |
8a18537eed1320024b1d884bd0383b51249c9d1a | 61c3861020ef87c6c325fc3c3dcbabf5d6b07985 | /init/pathover.lean | eb0c04991e7468a41cb870c1c25948a776aa7b09 | [
"Apache-2.0"
] | permissive | jonas-frey/hott3 | a623be2959e8a713c03fa1b0f34bf76a561dfa87 | a944051b4eb5919bdc70978ee15fcbb48a824811 | refs/heads/master | 1,628,408,720,559 | 1,510,267,042,000 | 1,510,267,042,000 | 106,760,764 | 0 | 0 | null | 1,507,856,238,000 | 1,507,856,238,000 | null | UTF-8 | Lean | false | false | 20,225 | lean | /-
Copyright (c) 2015 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Floris van Doorn
Basic theorems about pathovers
-/
import .path .equiv
universes u v l
hott_theory
namespace hott
open equiv is_equiv function
variables {A : Type _} {A' : Type _}... |
6c592c99ad92ff79b257e16c118a96ac98db5a6e | ff5230333a701471f46c57e8c115a073ebaaa448 | /library/init/algebra/ordered_group.lean | a684706866283b33cbdc2f57b9b563f3765f70de | [
"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 | 19,999 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura
-/
prelude
import init.algebra.order init.algebra.group
/- Make sure instances defined in this file have lower priority than the ones
define... |
802a826456c686bc80b4b4ecd9e8c930486a9bbe | 4727251e0cd73359b15b664c3170e5d754078599 | /src/topology/algebra/order/monotone_convergence.lean | fa813e949b10c6c24f8d777a879ca15135a5c93d | [
"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,769 | lean | /-
Copyright (c) 2021 Heather Macbeth. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Heather Macbeth, Yury Kudryashov
-/
import topology.algebra.order.basic
/-!
# Bounded monotone sequences converge
In this file we prove a few theorems of the form “if the range of a... |
8f0785bb46a108b7e2ce1050e3dac560560846e1 | 392d28f7e76ae84b38b6424255b29b4a4af0d129 | /assignments/assignment_3/assignment_3.lean | e1c2179f33b77f8474f974e8d28a409b5f9f8421 | [] | no_license | dg-1225/complogic-s21 | dd7349fd5288ec6c7bad3b0fe27987cfe176dc67 | f46b0bce48bbefbfbcdbc3da904a85c5f643ef58 | refs/heads/master | 1,678,017,116,497 | 1,613,794,266,000 | 1,613,794,266,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,679 | lean | /-
HIGHER-ORDER FUNCTION WARMUP
-/
/-
1. Write a function, double, that takes
a natural number and returns its double.
Write it using the following recursive
definition:
- double 0 = 0
- double (n' + 1) = double n' + 2
-/
-- ANSWER HERE
/-
2. Write a function, map_list_nat, that
takes as its arguments (1) a list, ... |
3438a18e09436a66e52d21e04537effc2e7dfb31 | 8e6cad62ec62c6c348e5faaa3c3f2079012bdd69 | /src/algebra/ring/basic.lean | 98bdd6052f24e04bcda0866a8df877a7279b4a8f | [
"Apache-2.0"
] | permissive | benjamindavidson/mathlib | 8cc81c865aa8e7cf4462245f58d35ae9a56b150d | fad44b9f670670d87c8e25ff9cdf63af87ad731e | refs/heads/master | 1,679,545,578,362 | 1,615,343,014,000 | 1,615,343,014,000 | 312,926,983 | 0 | 0 | Apache-2.0 | 1,615,360,301,000 | 1,605,399,418,000 | Lean | UTF-8 | Lean | false | false | 42,236 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Floris van Doorn, Amelia Livingston, Yury Kudryashov,
Neil Strickland
-/
import algebra.divisibility
import data.set.basic
/-!
# Properties and homomo... |
013f10c96eb0425edee61fb0090344b7a523cb80 | d744d97b07fc1e61b0ebea192b2d624125898128 | /test/nat_test.lean | 37967ca95d3ac8fa6f5369741d039edfa59e1fa8 | [
"MIT"
] | permissive | parkersullivan/leanstuff | 019c757848dd8f5db185e6973969141aee6fef7c | 3da132c44d365ecd933de64fa04ba66b9e620683 | refs/heads/master | 1,599,036,040,845 | 1,573,316,625,000 | 1,573,316,625,000 | 219,181,711 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 410 | lean | import ..src.nat
open my_nat
/-testing the decrement function-/
#eval dec my_nat.nat.zero
#eval dec (my_nat.nat.succ my_nat.nat.zero)
#eval dec (my_nat.nat.succ (my_nat.nat.succ my_nat.nat.zero))
def n0 := my_nat.nat.zero
def n1 := my_nat.nat.succ n0
def n2 := my_nat.nat.succ n1
def n3 := my_nat.nat.succ n2
def... |
844cd2583914a92647c4c6dedf3d80c910fff167 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/algebra/ordered_group_auto.lean | 4f5f5ca5dd3efad54f597e57f9006eb5ad46262e | [] | 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 | 43,551 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.algebra.ordered_monoid
import Mathlib.Post... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.