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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
65fd4e5664cc6fc1000f0a0bd9e10c9faef29ac7 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/control/traversable/lemmas.lean | c3814364d2cfd1f3a27d5c0e279c6f60895ab322 | [] | 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 | 5,063 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Simon Hudon
Lemmas about traversing collections.
Inspired by:
The Essence of the Iterator Pattern
Jeremy Gibbons and Bruno César dos Santos Oliveira
In Journal of Functional... |
b28cf09516ec3edef2d0c4957841624980a18f91 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/unusedWarningAtStructUpdate.lean | e75f7e85a6f1f287923e8539bab156c24e19605d | [
"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 | 174 | lean | set_option linter.unusedVariables true
structure Ctx where
s : String
def f (s : String) : ReaderT Ctx Id Unit :=
withReader (fun ctx => { ctx with s := s }) (pure ())
|
64603066869c45ce4066846d9130692fc0592630 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/analysis/normed_space/bounded_linear_maps.lean | 91d1a39711935f054404220b634619f70117a1e8 | [
"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 | 20,563 | lean | /-
Copyright (c) 2018 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Johannes Hölzl
Continuous linear functions -- functions between normed vector spaces which are bounded and linear.
-/
import analysis.normed_space.multilinear
noncomp... |
bdb47e2c6fe6edb82d5b5eb1f218938c240817ad | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/category_theory/category/Cat.lean | cb487d840051b9658a534702ba4b925786cda8c1 | [
"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 | 1,814 | 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
import category_theory.eq_to_hom
/-!
# Category of categories
This file contains the definition of the category `Cat` of ... |
30bd5873d4d727d83aa21b1f8c15bb639168098e | cc5bb0a18c45fa529fc8bf0365b1fbf48464c5a8 | /library/init/meta/interactive.lean | 56a8484d41cd17bc87c305aef0059a5822d5f3f9 | [
"Apache-2.0"
] | permissive | mk12/lean | 6bb58b9f3cfe312236b41779478d345399f00918 | 092fc89333160661c4c5a6295f3054cafff4341e | refs/heads/master | 1,609,531,450,083 | 1,501,275,267,000 | 1,501,278,025,000 | 98,760,144 | 0 | 0 | null | 1,501,364,485,000 | 1,501,364,485,000 | null | UTF-8 | Lean | false | false | 41,057 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.meta.tactic init.meta.rewrite_tactic init.meta.simp_tactic
import init.meta.smt.congruence_closure init.category.combinators
import init... |
3037e9024d0aeb434f96771e4541b36885514f71 | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /tests/lean/run/matchEqs.lean | 23c5c3f6b8482dca3f9689ca3a90602b0a43f2d1 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | tobiasgrosser/lean4 | ce0fd9cca0feba1100656679bf41f0bffdbabb71 | ebdbdc10436a4d9d6b66acf78aae7a23f5bd073f | refs/heads/master | 1,673,103,412,948 | 1,664,930,501,000 | 1,664,930,501,000 | 186,870,185 | 0 | 0 | Apache-2.0 | 1,665,129,237,000 | 1,557,939,901,000 | Lean | UTF-8 | Lean | false | false | 612 | lean | import Lean
syntax (name := test) "test%" ident : command
open Lean.Elab
open Lean.Elab.Command
@[commandElab test] def elabTest : CommandElab := fun stx => do
let id ← resolveGlobalConstNoOverloadWithInfo stx[1]
liftTermElabM do
IO.println (repr (← Lean.Meta.Match.getEquationsFor id))
return ()
def f (x :... |
84bdcb256062fd967550ebf61e83ec3983044ccb | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/topology/is_locally_homeomorph.lean | 75fa4fe4ab8ecfecf3c169755bc5cc96659b5ad5 | [
"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 | 4,955 | lean | /-
Copyright (c) 2021 Thomas Browning. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Thomas Browning
-/
import topology.local_homeomorph
/-!
# Local homeomorphisms
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding PR to ma... |
0cbf49ffa1be07179b5c88fbfc10fec0fbd72e96 | 853df553b1d6ca524e3f0a79aedd32dde5d27ec3 | /src/algebra/ordered_group.lean | 18f7cc7d5761d6201078646a176bfbc45eaf0279 | [
"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 | 63,072 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Mario Carneiro, Johannes Hölzl
-/
import algebra.group.with_one
import algebra.group.type_tags
import order.bounded_lattice
set_option old_structure_c... |
54116372e1379e9c3238c7cffd08aeeecbb30556 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/number_theory/primes_congruent_one.lean | 1712603e18984e6ba5af5a2597de599af6157d24 | [
"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 | 3,680 | lean | /-
Copyright (c) 2020 Riccardo Brasca. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Riccardo Brasca
-/
import ring_theory.polynomial.cyclotomic
import topology.algebra.polynomial
import field_theory.finite.basic
/-!
# Primes congruent to one
We prove that, for any... |
423676a1fa548d83cef194fe15a73a2d0402c4aa | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/ring_theory/polynomial/opposites.lean | 4ecea9805d529e172ebf79fefc3e1d7701b6dba5 | [
"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 | 4,254 | lean | /-
Copyright (c) 2022 Damiano Testa. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Damiano Testa
-/
import data.polynomial.degree.definitions
/-! # Interactions between `R[X]` and `Rᵐᵒᵖ[X]`
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file req... |
223e5e1ee82df3f1635336da17599f5f1393784d | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /tests/lean/run/rc_tests.lean | 32474d3a1ea52fdf9f8369f1b61b88cc91775a0d | [
"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 | 1,129 | lean |
universes u v
-- set_option pp.binder_types false
set_option pp.explicit true
set_option trace.compiler.llnf true
-- set_option trace.compiler.boxed true
namespace x1
def f (x : Bool) (y z : Nat) : Nat :=
match x with
| true => y
| false => z + y + y
end x1
namespace x2
def f (x : Nat) : Nat := x
end x2
name... |
94d2ec5af8854a2feefb2b0a7e5d03ea91c52252 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/lean/phashmap_inst_coherence.lean | 9985cf2695d6a5ff00f0e04ce0cb62d575fde0e1 | [
"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 | 370 | lean | import Std.Data.PersistentHashMap
open Std
def m : PersistentHashMap Nat Nat :=
let m : PersistentHashMap Nat Nat := {};
m.insert 1 1
def natDiffHash : Hashable Nat :=
⟨fun n => UInt64.ofNat $ n+10⟩
-- The following example should fail since the `Hashable` instance used to create `m` is not `natDiffHash`
#eval @Pers... |
bd4680ac85288a8429e9ff5fe117b0dccd44bf19 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/topology/continuous_function/compact.lean | a9e1834733f461325599f564a2cf8616a822dca4 | [
"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 | 17,883 | lean | /-
Copyright (c) 2021 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import topology.continuous_function.bounded
import topology.uniform_space.compact
import topology.compact_open
import topology.sets.compacts
/-!
# Continuous functio... |
3f3e8f0a3a6c8c04ad3c5b06d5b2b8864f19d5df | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/topology/algebra/group/basic.lean | 9abda0620f2dba3348cd81988ad900cecc68827f | [
"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 | 66,930 | 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, Patrick Massot
-/
import group_theory.group_action.conj_act
import group_theory.group_action.quotient
import group_theory.quotient_group
import order.fi... |
1bdc88a39c4e5a22daa07fbb9650ca0b99012f5b | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /src/builtin/lean2h.lean | 6752ce4258e5a99983ba038836be12c3e9e15596 | [
"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 | 2,329 | lean | (*
-- Auxiliary script for generating .h file that declare mk_* and is_* functions for
-- constants defined in Lean
local env = get_environment()
local num_imports = 0
print('/*')
print('Copyright (c) 2013 Microsoft Corporation. All rights reserved.')
print('Released under Apache 2.0 license as described in the ... |
e0632d60575bcc089f5088d1e93ad99f26d6835c | 626e312b5c1cb2d88fca108f5933076012633192 | /test/lint.lean | 08a8983e5ed80badaef7856134026330c7b1590c | [
"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 | 4,806 | lean | import tactic.lint
import algebra.ring.basic
def foo1 (n m : ℕ) : ℕ := n + 1
def foo2 (n m : ℕ) : m = m := by refl
lemma foo3 (n m : ℕ) : ℕ := n - m
lemma foo.foo (n m : ℕ) : n ≥ n := le_refl n
instance bar.bar : has_add ℕ := by apply_instance -- we don't check the name of instances
lemma foo.bar (ε > 0) : ε = ε := r... |
77981e7c5a9febbe3f65a39095f082aec30a19f7 | 9d2e3d5a2e2342a283affd97eead310c3b528a24 | /src/solutions/wednesday/afternoon/algebraic_hierarchy.lean | 43a21ea2391aaa5adda3e804873d523649d6e67d | [] | permissive | Vtec234/lftcm2020 | ad2610ab614beefe44acc5622bb4a7fff9a5ea46 | bbbd4c8162f8c2ef602300ab8fdeca231886375d | refs/heads/master | 1,668,808,098,623 | 1,594,989,081,000 | 1,594,990,079,000 | 280,423,039 | 0 | 0 | MIT | 1,594,990,209,000 | 1,594,990,209,000 | null | UTF-8 | Lean | false | false | 19,967 | lean | /-
This is a sorry-free file covering the material on Wednesday afternoon
at LFTCM2020. It's how to build some algebraic structures in Lean
-/
import data.rat.basic -- we'll need the rationals at the end of this file
/-
As a mathematician I essentially always start my Lean files with the following line:
-/
import tac... |
3d28740dbf362740f8190c3bb171a0dd962b9ae3 | 367134ba5a65885e863bdc4507601606690974c1 | /src/tactic/equiv_rw.lean | dbe3ce5fe1efa028640bc24ff97ad769c7484c8d | [
"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 | 12,084 | 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 tactic.simp_result
import tactic.clear
import control.equiv_functor.instances
/-!
# The `equiv_rw` tactic transports goals or hypotheses along equivalences.
... |
164e6ffb2829787d97627fa0616eec1559d044bf | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/algebra/group/pi.lean | 538f9445a578248b6ce0410e192438f52c22616b | [
"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 | 5,927 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon, Patrick Massot
-/
import data.pi
import algebra.ordered_group
import algebra.group_with_zero
import tactic.pi_instances
/-!
# Pi instances for groups and monoids
This file d... |
cba2a8120c48f730c98b81b0026d9ed1a94b5fe6 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /hott/arity.hlean | 88ed2b08e217db03b2ac642e62f6de7b0e6b163c | [
"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 | 11,083 | hlean | /-
Copyright (c) 2014 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Floris van Doorn
Theorems about functions with multiple arguments
-/
variables {A U V W X Y Z : Type} {B : A → Type} {C : Πa, B a → Type} {D : Πa b, C a b → Type}
{E : Πa ... |
1739f230e4e9991ee0f9c0b7a861cd6f341c61ad | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/topology/continuous_function/stone_weierstrass.lean | 1c07645da016767e538f2807d3ea6204f64b5003 | [
"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 | 21,099 | lean | /-
Copyright (c) 2021 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Heather Macbeth
-/
import topology.continuous_function.weierstrass
import data.complex.is_R_or_C
/-!
# The Stone-Weierstrass theorem
If a subalgebra `A` of `C(X, ℝ)`,... |
059cc4fae3ef9b375a46ef884796fd41bd050033 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/803.lean | a2b65dc650f94943db2bc9b2b7466c3b86eef32b | [
"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 | 586 | lean | import data.matrix
open algebra fin nat
namespace matrix
definition vector [reducible] (A : Type) (n : nat) := fin n → A
definition to_cvec [reducible] [coercion] {A : Type} {n : nat} (v : vector A n)
: matrix A n 1 := λ i o, v i
definition to_rvec [reducible] [coercion] {A : Type} {n : nat} (v : vector A n)
: matr... |
0e58af345915a8ee65a1192bb6a3afaef83ef460 | 7617a8700fc3eebd9200f1e620ee65b3565d2eff | /src/vc0/preservation.lean | b0bb929d7e6fe9c480ced3097116f2ac1f1d5322 | [] | no_license | digama0/vc0 | 9747eee791c5c2f58eb53264ca6263ee53de0f87 | b8b192c8c139e0b5a25a7284b93ed53cdf7fd7a5 | refs/heads/master | 1,626,186,940,436 | 1,592,385,972,000 | 1,592,385,972,000 | 158,556,766 | 5 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 33,051 | lean | import vc0.basic
namespace c0
open ast ast.gdecl
theorem start_ok (Γ : ast) (ok : Γ.ok) : ∀ s, start Γ s → state.ok Γ s
| _ (@start.mk _ s h) := begin
rcases get_body_ok' ok.ind h with ⟨h₁, h₂|⟨⟨⟩⟩⟩,
rcases ok.ok_init h with ⟨δ, h₃⟩,
exact state.ok.stmt (some type.int) env.ok.empty vtype.of_ty.int h₁ h₃ (or.in... |
bdcb3d1c2e52238631b62b2111d9d0c7af348756 | c31182a012eec69da0a1f6c05f42b0f0717d212d | /src/rescale/normed_group.lean | d75e8a6ad37cbdb8ec3e6d373ba023107e074536 | [] | no_license | Ja1941/lean-liquid | fbec3ffc7fc67df1b5ca95b7ee225685ab9ffbdc | 8e80ed0cbdf5145d6814e833a674eaf05a1495c1 | refs/heads/master | 1,689,437,983,362 | 1,628,362,719,000 | 1,628,362,719,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,140 | lean | import rescale.basic
import locally_constant.Vhat
import category_theory.preadditive.additive_functor
import facts.nnreal
noncomputable theory
open_locale big_operators classical nnreal
namespace rescale
variables {N : ℝ≥0} {V : Type*}
instance [has_norm V] : has_norm (rescale N V) :=
{ norm := λ v, ∥of.symm v∥/N... |
e130840d733c2bc3ecad225b40259c3272f6b34f | 271e26e338b0c14544a889c31c30b39c989f2e0f | /src/Init/Data/Char/Basic.lean | c08b18437ba73e04602f3ccf7fc3541354fde9c9 | [
"Apache-2.0"
] | permissive | dgorokho/lean4 | 805f99b0b60c545b64ac34ab8237a8504f89d7d4 | e949a052bad59b1c7b54a82d24d516a656487d8a | refs/heads/master | 1,607,061,363,851 | 1,578,006,086,000 | 1,578,006,086,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,592 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
prelude
import Init.Data.UInt
@[inline, reducible] def isValidChar (n : UInt32) : Prop :=
n < 0xd800 ∨ (0xdfff < n ∧ n < 0x110000)
/-- The `Char` Type repre... |
55a0d44dab88af1ce355bce0a7ea02f0e8e4c5ea | cbb817439c51008d66b37ce6b1964fea61434d35 | /theorem-proving-in-lean/src/chap_5.lean | 70772cf3588b1729649b65d55edb2ff5220d7a28 | [] | no_license | tomhoule/theorem-proving-in-lean-exercises | a07f99d4f6b41ce003e8a0274c7bc46359fa62b2 | 60ccc71b8a6df6924e7cc90aab713b804f78da9f | refs/heads/master | 1,663,582,321,828 | 1,590,352,467,000 | 1,590,352,476,000 | 257,107,936 | 3 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 15,096 | lean |
section chap3ex1
variables p q r : Prop
example : p ∧ q ↔ q ∧ p :=
begin
apply iff.intro,
repeat {
intro h,
exact and.intro h.right h.left,
}
end
example : p ∨ q ↔ q ∨ p :=
begin
apply iff.intro,
intro h,
apply or.elim ... |
97703dc37dd6bc67ce9ef5007c855fde2dbaa4a1 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/combinatorics/simple_graph/strongly_regular.lean | 524ac8e540e0dbbe95ad806763071c20b46c7036 | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 7,036 | lean | /-
Copyright (c) 2021 Alena Gusakov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Alena Gusakov
-/
import combinatorics.simple_graph.basic
import data.set.finite
/-!
# Strongly regular graphs
## Main definitions
* `G.is_SRG_with n k ℓ μ` (see `simple_graph.is_SRG_w... |
03504bb7d47855b721fcc0e5787648c4fe7464be | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/probability/martingale/basic.lean | 222656ee7ace411e135c5a67b9028d34d1191a6c | [
"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 | 24,864 | 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, Kexing Ying
-/
import probability.notation
import probability.process.stopping
/-!
# Martingales
A family of functions `f : ι → Ω → E` is a martingale with respect to a f... |
ad086c459c08f08cff69e87a8c6250e05de68837 | 07c6143268cfb72beccd1cc35735d424ebcb187b | /src/computability/halting.lean | 304c5579c0b5f857d9134b8156402a31d1fbbfc2 | [
"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 | 13,447 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
-/
import computability.partrec_code
/-!
# Computability theory and the halting problem
A universal partial recursive function, Rice's theorem, and the halting problem... |
6dfa97e727965870e38397439164d3f0eac8afbf | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/data/finset/sort.lean | 03b9234fbce4ec8db4e161b9b108d280bf8476f5 | [
"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 | 9,827 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.fintype.basic
import data.multiset.sort
import data.list.nodup_equiv_fin
/-!
# Construct a sorted list from a finset.
-/
namespace finset
open multiset... |
cf80d3eb0781aca846fa3d9022f5e033306596b9 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/category_theory/concrete_category/elementwise.lean | 5f3f03bfc0badb225b5ff248dc624c58d3b841f7 | [
"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 | 570 | lean | /-
Copyright (c) 2022 Andrew Yang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Andrew Yang
-/
import tactic.elementwise
import category_theory.limits.has_limits
import category_theory.limits.shapes.kernels
/-!
In this file we provide various simp lemmas in its elem... |
d17be29107be2100f2d094c24919f8cb376f7e22 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/combinatorics/simple_graph/adj_matrix.lean | bcc2905beeeeb962367194cd9127ea6ec0e22dfd | [
"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 | 3,165 | lean | /-
Copyright (c) 2020 Aaron Anderson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson, Jalex Stark
-/
import combinatorics.simple_graph.basic
import data.rel
import linear_algebra.matrix.trace
/-!
# Adjacency Matrices
This module defines the adjacency m... |
080680c5fc35921bb3f909ff9baf95f7db2aaecc | 618003631150032a5676f229d13a079ac875ff77 | /src/category_theory/category/Cat.lean | f7048648a0db2b56795c9d12b765d8af6b4802a6 | [
"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 | 1,370 | 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
/-!
# Category of categories
This file contains definition of category `Cat` of all categories. In
this category objects... |
0d497b7d2d6e3a514103ad063061c0cf081db3c7 | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/let3.lean | a6d7d62decc8b30b533b702169c3beafa5425de6 | [
"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 | 182 | lean | import Int.
variable magic : forall (H : Bool), H
set_option pp::notation false
set_option pp::coercion true
print let a : Int := 1,
H : a > 0 := magic (a > 0)
in H |
066845b1216e6f0b63bc4b1dbc37567c62088adf | 87fd6b43d22688237c02b87c30d2a524f53bab24 | /src/game/sup_inf/infSumConst.lean | a1301f47f59ce13fb83b7aeb937b0f423bdda846 | [
"Apache-2.0"
] | permissive | grthomson/real-number-game | 66142fedf0987db90f66daed52f9c8b42b70f909 | 8ddc15fdddc241c246653f7bb341df36e4e880a8 | refs/heads/master | 1,668,059,330,605 | 1,592,873,454,000 | 1,592,873,454,000 | 262,025,764 | 0 | 0 | null | 1,588,849,107,000 | 1,588,849,106,000 | null | UTF-8 | Lean | false | false | 686 | lean | import game.sup_inf.infSumSets
namespace xena -- hide
/-
# Chapter 3 : Sup and Inf
## Level 7
Another level that showcases the infimum.
-/
def sum_set_const (A : set ℝ) (c : ℝ) := { x : ℝ | ∃ y ∈ A, x = y + c}
/- Lemma
If $A$ is a set of reals, then
$$ \textrm{inf} (c + A) = c + \textrm{inf} (A)$$
-/
lemma inf_su... |
9c33296e62a7cfac1e1336c8b8da24b08fb0069f | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/algebra/category/Module/monoidal.lean | dea21e486a38a5832092e62151250b78bca2620c | [
"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 | 12,191 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Buzzard, Scott Morrison, Jakob von Raumer
-/
import category_theory.monoidal.braided
import category_theory.closed.monoidal
import algebra.category.Module.basic
import linear_alg... |
45cc0af609ee65ef48f450b18f1716100f45c46a | 26ac254ecb57ffcb886ff709cf018390161a9225 | /src/ring_theory/polynomial/basic.lean | 4629b96c861acd645d55e77087c24cd201f80440 | [
"Apache-2.0"
] | permissive | eric-wieser/mathlib | 42842584f584359bbe1fc8b88b3ff937c8acd72d | d0df6b81cd0920ad569158c06a3fd5abb9e63301 | refs/heads/master | 1,669,546,404,255 | 1,595,254,668,000 | 1,595,254,668,000 | 281,173,504 | 0 | 0 | Apache-2.0 | 1,595,263,582,000 | 1,595,263,581,000 | null | UTF-8 | Lean | false | false | 19,810 | lean | /-
Copyright (c) 2019 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
Ring-theoretic supplement of data.polynomial.
Main result: Hilbert basis theorem, that if a ring is noetherian then so is its polynomial ring.
-/
import algebra.char_p
import da... |
ab88f923839d1b374e33619ddaafddd198459ef2 | 3dd1b66af77106badae6edb1c4dea91a146ead30 | /tests/lean/run/tactic11.lean | 0d1a6c865f868dda5ff8c68331777f325279c960 | [
"Apache-2.0"
] | permissive | silky/lean | 79c20c15c93feef47bb659a2cc139b26f3614642 | df8b88dca2f8da1a422cb618cd476ef5be730546 | refs/heads/master | 1,610,737,587,697 | 1,406,574,534,000 | 1,406,574,534,000 | 22,362,176 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 301 | lean | import standard
using tactic
theorem tst (a b : Prop) (H : a ↔ b) : b ↔ a
:= have H1 [fact] : a → b, -- We need to mark H1 as fact, otherwise it is not visible by tactics
from iff_elim_left H,
by apply iff_intro;
apply (assume Hb, iff_mp_right H Hb);
apply (assume Ha, H1 Ha)
|
bb78fc7daccb0aa891ad7936109d942082fc6842 | 6fca17f8d5025f89be1b2d9d15c9e0c4b4900cbf | /src/game/world2/level1.lean | def41de2cdb4d054960dd4773ab41728d2d87d06 | [
"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 | 7,844 | lean | import mynat.definition -- Imports the natural numbers.
import mynat.add -- imports addition.
namespace mynat -- hide
-- World name : Addition world
/- Axiom : add_zero (a : mynat) :
a + 0 = a
-/
/- Axiom : add_succ (a b : mynat) :
a + succ(b) = succ(a + b)
-/
/- Tactic : induction
## Summary
if `n : mynat` is in... |
f41237a7dab1218892e45d57279df723245045a6 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/int/cast/defs.lean | ec6e9b20d54631d3f5fdd1896418a7ff0d15dc62 | [
"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,447 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Gabriel Ebner
-/
import data.nat.cast.defs
/-!
# Cast of integers
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding PR to ... |
55ce7eafa9b957e8c1fba2449f2fc6e6b34bc3de | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/function_expected.lean | 867e68a13bfc552b6cfadec3c4ee5bf8b56f18c5 | [
"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 | 497 | lean | import data.sigma
open function
namespace Lob
inductive TypeExpr : Type₁ :=
| Arrow : TypeExpr → TypeExpr → TypeExpr
| QuotedTermExpr : TypeExpr → TypeExpr
open TypeExpr
inductive TermExpr : TypeExpr → Type :=
| Lob : ∀ { LT : TypeExpr }, TermExpr (Arrow (QuotedTermExpr LT) LT) → TermExpr LT
open TermExpr
definit... |
46144309811b3a2eb9874699bb3585967d9a350f | acc85b4be2c618b11fc7cb3005521ae6858a8d07 | /data/int/order.lean | 2b9bd73beb2dfc53332905863fada8c50b98c314 | [
"Apache-2.0"
] | permissive | linpingchuan/mathlib | d49990b236574df2a45d9919ba43c923f693d341 | 5ad8020f67eb13896a41cc7691d072c9331b1f76 | refs/heads/master | 1,626,019,377,808 | 1,508,048,784,000 | 1,508,048,784,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,026 | 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 order relation on the integers.
-/
import data.int.basic
namespace int
theorem exists_least_of_bdd {P : ℤ → Prop} [HP : decidable_pred P]
(Hbdd : ∃ b : ℤ, ∀ z :... |
73ea9b308dd9f2fb5a077fb210c763bff89f570c | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/run/meta2.lean | 2e5531d401160dc97c709305b561da9a2b0d6ef1 | [
"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 | 241 | lean | import system.io
open io
meta definition foo : nat → nat
| a := nat.cases_on a 1 (λ n, foo n + 2)
#eval (foo 10)
variable [io.interface]
meta definition loop : nat → io unit
| a := do put_str ">> ", print a, put_str "\n", loop (a+1)
|
1e6c3e197eb98bbf2ae9c1890403aa3d475cec4c | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/topology/uniform_space/compact_separated.lean | 44d7312423510b46bff3f1e538c639a5a176f686 | [
"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 | 10,489 | 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 topology.uniform_space.separation
/-!
# Compact separated uniform spaces
## Main statements
* `compact_space_uniformity`: On a separated compact uniform spac... |
1f78068b780c94b1dc699561422f2fc64d5ba785 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/meta/widget/replace_save_info.lean | c3d749b78907225c8b08e1f2c95e712cc9f01ec3 | [] | 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 | 242 | lean | /-
Copyright (c) E.W.Ayers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: E.W.Ayers
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.meta.widget.interactive_expr
namespace Mathlib
|
3330b0556e2d41b733d8019a454417b4dec7c548 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/category_theory/sites/plus.lean | f286b413aecf404980b1244bfe22002924a43c36 | [
"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 | 11,563 | lean | /-
Copyright (c) 2021 Adam Topaz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Adam Topaz
-/
import category_theory.sites.sheaf
/-!
# The plus construction for presheaves.
This file contains the construction of `P⁺`, for a presheaf `P : Cᵒᵖ ⥤ D`
where `C` is endow... |
cf44410e48d181400c816900bb29a8fae6b39295 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/lean/run/toFromJson.lean | e87e9aa81723f786b68083b148d2c1fcd7aa1f85 | [
"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 | 3,099 | lean | import Lean
open Lean
declare_syntax_cat json
syntax str : json
syntax num : json
syntax "{" (ident ": " json),* "}" : json
syntax "[" json,* "]" : json
syntax "json " json : term
/- declare a micro json parser, so we can write our tests in a more legible way. -/
open Json in macro_rules
| `(json $s:str) => pure ... |
eda75d6b25b4e6d21d990deaa6681940acda89d3 | f57570f33b51ef0271f8c366142363d5ae8fff45 | /src/enderton_predicate_logic.lean | f29ea8d478ea9b4a0f1d6e34ea288ccb8b884c36 | [] | no_license | maxd13/lean-logic | 4083cb3fbb45b423befca7fda7268b8ba85ff3a6 | ddcab46b77adca91b120a5f37afbd48794da8b52 | refs/heads/master | 1,692,257,681,488 | 1,631,740,832,000 | 1,631,740,832,000 | 246,324,437 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 23,394 | lean | import data.set.countable tactic.find tactic.tidy tactic.ring
universe u
-- We introduce a much simplified version of
-- untyped first order (minimal) predicate logic.
-- make all propositions decidable.
-- Allows us to freely use ifs like in Haskell
-- but then we must add noncomputable to all functions
-- local at... |
0846b741dbc4528209ef58eb485b775f9a4dc8a7 | 1a61aba1b67cddccce19532a9596efe44be4285f | /hott/function.hlean | 318f54eece56a623b32f4ae0583e9dd83f394a2b | [
"Apache-2.0"
] | permissive | eigengrau/lean | 07986a0f2548688c13ba36231f6cdbee82abf4c6 | f8a773be1112015e2d232661ce616d23f12874d0 | refs/heads/master | 1,610,939,198,566 | 1,441,352,386,000 | 1,441,352,494,000 | 41,903,576 | 0 | 0 | null | 1,441,352,210,000 | 1,441,352,210,000 | null | UTF-8 | Lean | false | false | 4,438 | hlean | /-
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
Ported from Coq HoTT
Theorems about embeddings and surjections
-/
import hit.trunc types.equiv
open equiv sigma sigma.ops eq trunc is_trunc pi is_equiv fiber prod
... |
70bc4257fade7c351fd6d665214c2be5077072fb | 947b78d97130d56365ae2ec264df196ce769371a | /src/Lean/Elab.lean | b6d22aa99b002b2d7753e33f55c3611c208a63c7 | [
"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 | 732 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Elab.Import
import Lean.Elab.Exception
import Lean.Elab.StrategyAttrs
import Lean.Elab.Command
import Lean.Elab.Term
import Lean.Elab.App
import... |
324226e5c6cde69d2f3e94bc519a1dbc93f79e7c | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/category/Module/change_of_rings.lean | 9d8c285ba51102861d8a50ea785e0967151683c7 | [
"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 | 6,242 | 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.Module.basic
import ring_theory.tensor_product
/-!
# Change Of Rings
## Main definitions
* `category_theory.Module.restrict_scalars`: given rin... |
24f7ce73df5830837e8ec227c4914921b1104ebc | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/measure_theory/integral/integral_eq_improper.lean | 1cd7f2b27154178d2505f47df1a4e6816abf22ac | [
"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 | 48,248 | lean | /-
Copyright (c) 2021 Anatole Dedecker. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anatole Dedecker, Bhavik Mehta
-/
import analysis.special_functions.pow.deriv
import measure_theory.integral.fund_thm_calculus
import order.filter.at_top_bot
import measure_theory.fu... |
60f362482b3fcaafa5d9bfc61c9dcb2e2b352b8f | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/data/nat/choose/basic.lean | f2b2422bf65bd5558f767d3519cb8d4fbff6a604 | [
"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 | 10,317 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Bhavik Mehta
-/
import data.nat.factorial
/-!
# Binomial coefficients
This file defines binomial coefficients and proves simple lemmas (i.e. those not
requiring more impo... |
1ae88036fc43564960c793babf6d7a5376e3429a | df561f413cfe0a88b1056655515399c546ff32a5 | /4-proposition-world/l1.lean | d8cfc1ab44c438a9316eaa7d7cffe58c4cfa3f0a | [] | no_license | nicholaspun/natural-number-game-solutions | 31d5158415c6f582694680044c5c6469032c2a06 | 1e2aed86d2e76a3f4a275c6d99e795ad30cf6df0 | refs/heads/main | 1,675,123,625,012 | 1,607,633,548,000 | 1,607,633,548,000 | 318,933,860 | 3 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 70 | lean | example (P Q : Prop) (p : P) (h : P → Q) : Q :=
begin
exact h p,
end |
962191077243756ddc9ac353549196892104718e | d1a52c3f208fa42c41df8278c3d280f075eb020c | /src/Init/Meta.lean | 1e16e2aa49c5de712ef079080da42c996c746b51 | [
"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 | 35,302 | 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 and Sebastian Ullrich
Additional goodies for writing macros
-/
prelude
import Init.Data.Array.Basic
namespace Lean
@[extern c inline "lean_box(LEAN_VERSION_... |
65611a9a56d9daaad0ae66b6d1083386c1cf5d5d | 367134ba5a65885e863bdc4507601606690974c1 | /src/data/polynomial/mirror.lean | a7546d3cd0226bf50e313b02902eda933e2a0987 | [
"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 | 7,375 | lean | /-
Copyright (c) 2020 Thomas Browning. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Thomas Browning
-/
import data.polynomial.ring_division
import algebra.big_operators.nat_antidiagonal
/-!
# "Mirror" of a univariate polynomial
In this file we define `polynomial.m... |
4ce3f099ada7b1268b291cd80d9c390296e152a0 | 46125763b4dbf50619e8846a1371029346f4c3db | /src/meta/expr.lean | 666a9cd2b15deba769ea369efa94222f66f103aa | [
"Apache-2.0"
] | permissive | thjread/mathlib | a9d97612cedc2c3101060737233df15abcdb9eb1 | 7cffe2520a5518bba19227a107078d83fa725ddc | refs/heads/master | 1,615,637,696,376 | 1,583,953,063,000 | 1,583,953,063,000 | 246,680,271 | 0 | 0 | Apache-2.0 | 1,583,960,875,000 | 1,583,960,875,000 | null | UTF-8 | Lean | false | false | 26,277 | lean | /-
Copyright (c) 2019 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Simon Hudon, Scott Morrison, Keeley Hoek, Robert Y. Lewis
-/
import data.string.defs tactic.derive_inhabited
/-!
# Additional operations on expr and related types
Thi... |
822cb51bfac2687f3b41cc8da50fc74a3905fc26 | a332e4934ff49f6c0a1af6799591f6694d9ccda6 | /sphinx/6_12.lean | 38bfafb6b0c8bab68f494fe2be60af1c9917b204 | [
"CC-BY-4.0"
] | permissive | khanhdt/formalabstracts | 295624d43b15275bf1acd03e6835b35d496bde42 | c25503700d85df0a592d681c8fdf3b8af6b9a759 | refs/heads/master | 1,584,616,983,167 | 1,528,963,872,000 | 1,528,963,872,000 | 136,273,754 | 0 | 0 | null | 1,528,260,960,000 | 1,528,260,960,000 | null | UTF-8 | Lean | false | false | 1,441 | lean |
def symn_group (α: Type): Type := {f: α → α // function.bijective f}
instance (α: Type): has_one (symn_group α):=
((id, function.bijective_id))
instance (α: Type): has_mul (symn_group α):=
(λ(f, f_is_bij) (g, g_is_bij), (f ∘ g, function.bijective_comp f_is_bij g_is_bij)
instance (α: Type): group (symn_group α):=... |
b03013c87c8bb508885acbfaf391ef31de19d634 | 4e0c49ab645d61b5c3e486a1b460db14552914ae | /library/init/meta/interactive.lean | 51d400ecff46ca309a9941e38ee943e7b8fdf0b9 | [
"Apache-2.0"
] | permissive | saik2121/lean | 0c733955a9a33270a86d17f4139054c8bd09cff5 | 13007ebb4de63859d9866c19f6e753bbf1852f41 | refs/heads/master | 1,676,215,937,507 | 1,609,762,908,000 | 1,609,762,908,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 72,018 | 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, Jannis Limperg
-/
prelude
import init.meta.tactic init.meta.type_context init.meta.rewrite_tactic init.meta.simp_tactic
import init.meta.smt.congruence_closur... |
c94ed9b78d5520b9ba721f2185f938f8e525fbb7 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/ring_theory/polynomial/chebyshev/default_auto.lean | 08ec1a30ea16e6b1c441e6e4b9dd0d1de821faf4 | [] | 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 | 169 | lean | import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.ring_theory.polynomial.chebyshev.basic
import Mathlib.PostPort
namespace Mathlib
end Mathlib |
f46ab04853e5b3e21558a1d259e7bf5cf7e1515d | 47c6e122a73eb61594f0426d74d9c1897ac5668e | /src/sylowthree.lean | b272d1be736572c3352e5bf69d0cebcd7a07b142 | [] | no_license | ineswright/Lean-Sylow | 19ec5d964be8a66e25e227621fbac79c88a83ddf | 74b99544ab1ca96dc28fbe152125f565763a893b | refs/heads/main | 1,688,108,643,799 | 1,627,664,383,000 | 1,627,664,383,000 | 382,315,172 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,153 | lean | -- import group_theory.sylow
import tactic
import sylowtwo
open equiv fintype finset mul_action function nat sylow
open subgroup quotient_group
universe u
variables {G : Type u} [group G]
open_locale classical
/-
* Let `nₚ` be the number of Sylow `p`-subgroups of `G`, then `nₚ` divides the index of the Sylow
`p`-s... |
db3023b94925ac0ca39275b0b84bce0053c860d9 | a9fe717b93ccfa4b2e64faeb24f96dfefb390240 | /simp_omega.lean | 14bda7377e446de65a505840f1d7c697dec2c0c9 | [] | no_license | skbaek/omega | ab1f4a6daadfc8c855f14c39d9459ab841527141 | 715e384ed14e8eb177a326700066e7c98269e078 | refs/heads/master | 1,588,000,876,352 | 1,552,645,917,000 | 1,552,645,917,000 | 174,442,914 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 844 | lean | import logic.basic data.list.basic
variables {α : Type} {p q : Prop}
run_cmd mk_simp_attr `omega
attribute [omega]
list.map
list.length_map
zero_mul
mul_zero
zero_add
add_zero
neg_zero
zero_sub
sub_zero
false_and
and_false
true_or
or_true
list.forall_mem_nil
sub_self
open lean
open l... |
3c816d031f60007f3b4722412e4b4cd27ae60e64 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/data/mv_polynomial/variables.lean | 75bc64f2f31bc103f1169db281f000aeaa1fc927 | [
"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 | 29,340 | 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 algebra.big_operators.order
import data.mv_polynomial.monad
/-!
# Degrees and variables of polynomials
This file establishes ... |
867b919c8128b6a033d3d38ce16a261df3540770 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/category_theory/category/pairwise.lean | a8a0a7e9d07ffe8cec76e9b959a8e58c91d190c0 | [
"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 | 4,201 | lean | import topology.sheaves.sheaf
import category_theory.limits.preserves.basic
/-!
# The category of "pairwise intersections".
Given `ι : Type v`, we build the diagram category `pairwise ι`
with objects `single i` and `pair i j`, for `i j : ι`,
whose only non-identity morphisms are
`left : single i ⟶ pair i j` and `righ... |
8e5aca21deb0799b03261437c834ad1bc429e1ca | 22e97a5d648fc451e25a06c668dc03ac7ed7bc25 | /src/algebra/ordered_ring.lean | 4dc591c6e69ac045c4ad8732422c7548d1dc07a3 | [
"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 | 42,604 | 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
-/
import algebra.ring
import algebra.ordered_group
set_option default_priority 100 -- see Note [default priority]
set_option old_struc... |
e00b13b6ae6a7091214eda0206e60f00a5b6b473 | d0f9af2b0ace5ce352570d61b09019c8ef4a3b96 | /exam_2/satisfiability/exam2.lean | 77546cfd3c51eadb68cf16c4f8732e657dd1bbbb | [] | 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 | 10,140 | lean | /-
Justin Ngo
jmn4fms
4/12/20
Sullivan 2102-001
-/
import .satisfiability
import .rules_of_reasoning
/-
CS2102 Exam #2: Propositional Logic
-/
/-
#1. Define a predicate function, is_satisfiable: pExp → bool
that returns true iff the given proposition is satisfiable.
Hint: Model your answer on our definition of is_va... |
51aa86a725e7c78924f0b95335054ee8315cd503 | 9c1ad797ec8a5eddb37d34806c543602d9a6bf70 | /universal/comparisons.1.lean | 223d96c5b2c70323985bcfbb440a35505c223672 | [] | no_license | timjb/lean-category-theory | 816eefc3a0582c22c05f4ee1c57ed04e57c0982f | 12916cce261d08bb8740bc85e0175b75fb2a60f4 | refs/heads/master | 1,611,078,926,765 | 1,492,080,000,000 | 1,492,080,000,000 | 88,348,246 | 0 | 0 | null | 1,492,262,499,000 | 1,492,262,498,000 | null | UTF-8 | Lean | false | false | 1,214 | lean | -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Scott Morrison
import .comparisons
open tqft.categories
open tqft.categories.functor
open tqft.categories.natural_transformation
open tqft.categories.isomorphism
open tqft.cat... |
0bfa6c86770f6ecddd281e56723c2e0591bd4584 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/nested_begin.lean | 423d8ba0291cbe4db62d0cee0b6b07bbca33f806 | [
"Apache-2.0"
] | permissive | soonhokong/lean | cb8aa01055ffe2af0fb99a16b4cda8463b882cd1 | 38607e3eb57f57f77c0ac114ad169e9e4262e24f | refs/heads/master | 1,611,187,284,081 | 1,450,766,737,000 | 1,476,122,547,000 | 11,513,992 | 2 | 0 | null | 1,401,763,102,000 | 1,374,182,235,000 | C++ | UTF-8 | Lean | false | false | 1,272 | lean | import logic data.nat.basic
open nat
inductive vector (A : Type) : nat → Type :=
| vnil : vector A zero
| vcons : Π {n : nat}, A → vector A n → vector A (succ n)
namespace vector
definition no_confusion2 {A : Type} {n : nat} {P : Type} {v₁ v₂ : vector A n} : v₁ = v₂ → vector.no_confusion_type P v₁ v₂ :=
assume H... |
e787eddd304a8d5aa7945375bde47e5307137931 | 9d2e3d5a2e2342a283affd97eead310c3b528a24 | /src/hints/thursday/afternoon/category_theory/exercise2/hint7.lean | 48650e9d9f7e1c6d722e54967ebbd1180c83ab1a | [] | permissive | Vtec234/lftcm2020 | ad2610ab614beefe44acc5622bb4a7fff9a5ea46 | bbbd4c8162f8c2ef602300ab8fdeca231886375d | refs/heads/master | 1,668,808,098,623 | 1,594,989,081,000 | 1,594,990,079,000 | 280,423,039 | 0 | 0 | MIT | 1,594,990,209,000 | 1,594,990,209,000 | null | UTF-8 | Lean | false | false | 1,446 | lean | import algebra.category.CommRing.basic
import data.polynomial
noncomputable theory -- the default implementation of polynomials is noncomputable
local attribute [irreducible] polynomial.eval₂
def Ring.polynomial : Ring ⥤ Ring :=
{ obj := λ R, Ring.of (polynomial R),
map := λ R S f, ring_hom.of (polynomial.map f), ... |
bd20fbe15d8ea7c86c6a62f64e6110b8c04114d3 | 5ee26964f602030578ef0159d46145dd2e357ba5 | /src/for_mathlib/uniform_space/uniform_field.lean | 5d9541d9266cdb00446eb3731fe599173d24d45b | [
"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 | 13,815 | lean | /-
The goal of this file is to prove the main part of Proposition 7 of Bourbaki GT III 6.8 :
The completion hat K of a Hausdorff topological field is a field if the image under
the mapping x ↦ x⁻¹ of every Cauchy filter (with respect to the additive uniform structure)
which does not have a cluster point at 0 is a Cauc... |
8935e10dc2139f6d7c226783e39ef192645d30a2 | 271e26e338b0c14544a889c31c30b39c989f2e0f | /stage0/src/Init/Control/Id.lean | 7bbe9f963cc058deaf62da944c0d36f8d64be148 | [
"Apache-2.0"
] | permissive | dgorokho/lean4 | 805f99b0b60c545b64ac34ab8237a8504f89d7d4 | e949a052bad59b1c7b54a82d24d516a656487d8a | refs/heads/master | 1,607,061,363,851 | 1,578,006,086,000 | 1,578,006,086,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 678 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
The identity Monad.
-/
prelude
import Init.Control.Lift
universe u
def Id (type : Type u) : Type u := type
@[inline] def Id.pure {α : Type u} (x : α) : Id α... |
2ae7613776d57aeb210532037d652efd6d846754 | df561f413cfe0a88b1056655515399c546ff32a5 | /8-inequality-world/l17.lean | 232f261dd4942dbe2191c9413895dac93ab34979 | [] | no_license | nicholaspun/natural-number-game-solutions | 31d5158415c6f582694680044c5c6469032c2a06 | 1e2aed86d2e76a3f4a275c6d99e795ad30cf6df0 | refs/heads/main | 1,675,123,625,012 | 1,607,633,548,000 | 1,607,633,548,000 | 318,933,860 | 3 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 123 | lean | lemma lt_iff_succ_le (a b : mynat) : a < b ↔ succ a ≤ b :=
begin
split,
exact lt_aux_one a b,
exact lt_aux_two a b,
end |
93a6b09f0328c06d15e9a2fccbf2288703dcd919 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/analysis/box_integral/partition/basic.lean | ce849353626fcd07ccb5dcf11f7fb32903d9ec05 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 29,402 | lean | /-
Copyright (c) 2021 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import algebra.big_operators.option
import analysis.box_integral.box.basic
/-!
# Partitions of rectangular boxes in `ℝⁿ`
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4... |
8f10e5e5001c24b0137d732d17cf9b089b699765 | 9d2e3d5a2e2342a283affd97eead310c3b528a24 | /src/exercises_sources/friday/topology.lean | 8397eddeea66d87704f4684fd212692f58fd67fc | [] | permissive | Vtec234/lftcm2020 | ad2610ab614beefe44acc5622bb4a7fff9a5ea46 | bbbd4c8162f8c2ef602300ab8fdeca231886375d | refs/heads/master | 1,668,808,098,623 | 1,594,989,081,000 | 1,594,990,079,000 | 280,423,039 | 0 | 0 | MIT | 1,594,990,209,000 | 1,594,990,209,000 | null | UTF-8 | Lean | false | false | 12,134 | lean | import topology.metric_space.basic
open_locale classical filter topological_space
namespace lftcm
open filter set
/-!
# Filters
## Definition of filters
-/
def principal {α : Type*} (s : set α) : filter α :=
{ sets := {t | s ⊆ t},
univ_sets := begin
sorry
end,
sets_of_superset := begin
sorry
end,
... |
62e2827d1936c0281703bed4cb77117a3aba4075 | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /src/algebra/module/basic.lean | aae5bdcfeedc7288ae6baedff578490134a726a0 | [
"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 | 20,469 | lean | /-
Copyright (c) 2015 Nathaniel Thomas. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nathaniel Thomas, Jeremy Avigad, Johannes Hölzl, Mario Carneiro
-/
import algebra.big_operators.basic
import algebra.smul_with_zero
import group_theory.group_action.group
/-!
# Modu... |
3cc61a882aa2e62102b1bc6e339898141bb4c041 | 432d948a4d3d242fdfb44b81c9e1b1baacd58617 | /src/measure_theory/lp_space.lean | bc7fb052ef52879b0a37ab577b4f095900545d15 | [
"Apache-2.0"
] | permissive | JLimperg/aesop3 | 306cc6570c556568897ed2e508c8869667252e8a | a4a116f650cc7403428e72bd2e2c4cda300fe03f | refs/heads/master | 1,682,884,916,368 | 1,620,320,033,000 | 1,620,320,033,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 79,166 | 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, Sébastien Gouëzel
-/
import measure_theory.ess_sup
import measure_theory.ae_eq_fun
import analysis.mean_inequalities
import topology.continuous_function.compact
/-!
# ℒp s... |
fb15cf5f288e24daff0d614d5397f525b08e49e3 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/computability/reduce_auto.lean | 61714732ce23296203d0edd3bfe12da1f4280c8c | [] | 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 | 18,766 | lean | /-
Copyright (c) 2019 Minchao Wu. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Minchao Wu, Mario Carneiro
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.computability.halting
import Mathlib.PostPort
universes u_1 u_2 u_3 u v
namespac... |
2e5579408ff32e2d0369f54f147c57d1dec6ee8c | 0c1546a496eccfb56620165cad015f88d56190c5 | /library/init/native/default.lean | f72b79b4264ea6c9aaf075a2b63c1d9b464de8ee | [
"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 | 23,814 | lean | /-
Copyright (c) 2016 Jared Roesch. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jared Roesch
-/
prelude
import init.meta.format
import init.meta.expr
import init.category.state
import init.data.string
import init.data.list.instances
import init.native.ir
import in... |
846c263c2c4130e8287ac608d2dff0e0bb244507 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /library/data/set/basic.lean | 0dc45166f664b8e3c464252f88d1732fa6efcabf | [
"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 | 36,003 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad, Leonardo de Moura
-/
import logic.connectives logic.identities algebra.binary
open eq.ops binary function
definition set (X : Type) := X → Prop
namespace set
variable {... |
4cb4e705a82084c2ad544d1529bbfe8f721c3350 | 592ee40978ac7604005a4e0d35bbc4b467389241 | /Library/generated/mathscheme-lean/BoundedJoinLattice.lean | 3c93d382b17e7d465de2be6a83f968ae895fa75d | [] | 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 | 11,947 | 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 BoundedJoinLattice
structure BoundedJoinLattice (A : Type) : Type :=
(plus : (A → (A → A)))
(commutative_plus : (∀ {x y : A} , (plus x y) = (plus y x)))
... |
c6cbe369a2b7610499280f1656b105e373e4361e | 12dabd587ce2621d9a4eff9f16e354d02e206c8e | /world02/level02.lean | d1257b65182564c6d023934302b8b8f2bd656bac | [] | no_license | abdelq/natural-number-game | a1b5b8f1d52625a7addcefc97c966d3f06a48263 | bbddadc6d2e78ece2e9acd40fa7702ecc2db75c2 | refs/heads/master | 1,668,606,478,691 | 1,594,175,058,000 | 1,594,175,058,000 | 278,673,209 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 180 | lean | lemma add_assoc (a b c : mynat) : (a + b) + c = a + (b + c) :=
begin
induction c with h hd,
rw add_zero,
rw add_zero,
refl,
rw add_succ,
rw add_succ,
rw add_succ,
rw hd,
refl,
end
|
e36f385a1cce350d9e1cdac5fc79992b7b56448b | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/linear_algebra/quotient.lean | 559dbecec9c268d916d7e7a1f5bd9450f7c28647 | [
"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 | 17,104 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro, Kevin Buzzard, Yury Kudryashov
-/
import group_theory.quotient_group
import linear_algebra.span
/-!
# Quotients by submodules
* If `p` is a submodule ... |
56569c2804eb92dbb5a46a13575915779dafe273 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/tactic/omega/int/form.lean | 4de2b5889b9a9ceffbe4cbf8a0ad64ac85bda275 | [
"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 | 4,162 | 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 formulas in pre-normalized form. -/
import tactic.omega.int.preterm
namespace omega
namespace int
/-- Intermediate shadow syntax for LNA formulas that ... |
31d714426115c3f4c42889f2cfc42a086fa368ac | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/univIssue.lean | 7991a2158d22cf273955b9ec116ff07d326db7ea | [
"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 | 307 | lean | universe u v
@[inline] def ex1 {σ : Type u} {m : Type u → Type v} [Functor m] {α : Type u} (x : StateT σ m α) (s : σ) : m α :=
Functor.map Prod.fst (x s)
@[inline] def ex2 {σ : Type u} {m : Type u → Type v} [Functor m] {α : Type u} (x : StateT σ m α) (s : σ) : m α :=
Prod.fst <$> x s
|
5f5fdc8e1460f1666609792bc36b76849c8cdd23 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/data/list/defs.lean | 6c8c0a3cf96a044433396c8b9c52cd8a3a09decb | [
"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 | 41,499 | lean | /-
Copyright (c) 2014 Parikshit Khanna. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Parikshit Khanna, Jeremy Avigad, Leonardo de Moura, Floris van Doorn, Mario Carneiro
-/
import data.option.defs
import logic.basic
import tactic.cache
import data.rbmap.basic
import ... |
59efde0e870849a6e94d418c145386b5c14de623 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/ring_theory/integral_domain.lean | 8c9618b8c8c800253c011d68b3590bb749765ee8 | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 8,261 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Chris Hughes
-/
import data.fintype.card
import data.polynomial.ring_division
import group_theory.specific_groups.cyclic
import algebra.geom_sum
/-!
# Integral domain... |
9b60543f09940b66f29f512f6bbf0323389f0aa3 | 097294e9b80f0d9893ac160b9c7219aa135b51b9 | /instructor/types/nat/dm_nat_test.lean | 4eae03cb4ad5c5e3e1dcf0dd407693fb0ae73eac | [] | no_license | AbigailCastro17/CS2102-Discrete-Math | cf296251be9418ce90206f5e66bde9163e21abf9 | d741e4d2d6a9b2e0c8380e51706218b8f608cee4 | refs/heads/main | 1,682,891,087,358 | 1,621,401,341,000 | 1,621,401,341,000 | 368,749,959 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 337 | lean | import .dm_nat
open hidden
def zro := dm_nat.zero
def one := dm_nat.succ zro
def two := dm_nat.succ one
def three := dm_nat.succ (dm_nat.succ (dm_nat.succ dm_nat.zero))
def four := dm_nat.succ three
def five := dm_nat.succ four
-- etc
#reduce one
#reduce two
#reduce three
#reduce four
#reduce successor four
#reduce... |
fc745e83e3823c1bb212cc4b8b9c61ffe6f2a459 | 97c8e5d8aca4afeebb5b335f26a492c53680efc8 | /ground_zero/cubical/V.lean | f406d1f1d13f7d2ab9f1801745fe0c0e04a178c6 | [] | no_license | jfrancese/lean | cf32f0d8d5520b6f0e9d3987deb95841c553c53c | 06e7efaecce4093d97fb5ecc75479df2ef1dbbdb | refs/heads/master | 1,587,915,151,351 | 1,551,012,140,000 | 1,551,012,140,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,367 | lean | import ground_zero.cubical.path ground_zero.theorems.ua
open ground_zero.HITs ground_zero.types
/-
V, Vproj
* https://arxiv.org/abs/1712.01800
Part 6 ‘Rules’, page 66 ‘Univalence’
ua, uabeta
-/
namespace ground_zero.cubical
universes u v
def V (i : I) {α β : Sort u} (e : α ≃ β) : Sort u :=
interval.rec ... |
86b97be795f8d94c842438741495eee0e22614ce | b7f22e51856f4989b970961f794f1c435f9b8f78 | /hott/types/nat/hott.hlean | 48162995e8b0d097b7c2a89f7cc512eeb250faa2 | [
"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 | 7,824 | hlean | /-
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
Theorems about the natural numbers specific to HoTT
-/
import .order types.pointed
open is_trunc unit empty eq equiv algebra pointed
namespace nat
definition is... |
84ae70f1d53b9cf1f212b11d4e3a926f27a0c4f8 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/measure_theory/integral/average.lean | 05d85570cef2be852d7f05759cde56cdf92d25fd | [
"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 | 35,002 | lean | /-
Copyright (c) 2022 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov, Yaël Dillies
-/
import measure_theory.integral.set_integral
/-!
# Integral average of a function
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to t... |
2f4193f33a01ab2734b1fa6952c8db620cd1aef5 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/algebra/category/Mon/adjunctions.lean | ecd1b0e332b0e025f96c6b12c02d2c6e198cd07d | [
"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 | 1,661 | lean | /-
Copyright (c) 2021 Julian Kuelshammer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Julian Kuelshammer
-/
import algebra.category.Mon.basic
import algebra.category.Semigroup.basic
import algebra.group.with_one
/-!
# Adjunctions regarding the category of monoids
... |
aee397601497b9f51c4a3b3b5c959d1933fec1ec | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/algebra/big_operators/enat_auto.lean | 1ec22d7a73e650c8426468b345c75207452022fe | [] | 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 | 688 | lean | /-
Copyright (c) 2020 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.algebra.big_operators.basic
import Mathlib.data.nat.enat
import Mathlib.PostPort
unive... |
f5f042d9a7a3b401dc2bb213d2499465ab42ecef | d1a52c3f208fa42c41df8278c3d280f075eb020c | /src/Lean/Meta/LevelDefEq.lean | 0e93b64579c9ad8791e4a59a13b7e6e97cd22082 | [
"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 | 4,820 | 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` ... |
0bdf34e3f9a3c215f9205c186b1cb6fb3218dee5 | 968e2f50b755d3048175f176376eff7139e9df70 | /examples/prop_logic_theory/unnamed_529.lean | 8f849184a28d9fa1e1926d8ad065e2764aada538 | [] | no_license | gihanmarasingha/mth1001_sphinx | 190a003269ba5e54717b448302a27ca26e31d491 | 05126586cbf5786e521be1ea2ef5b4ba3c44e74a | refs/heads/master | 1,672,913,933,677 | 1,604,516,583,000 | 1,604,516,583,000 | 309,245,750 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 233 | lean | variables p q : Prop
-- BEGIN
example (h : p ∧ q) : q :=
begin
have h₂ : q, from h.right, -- We have `h₂ : q` by right and elimination on `h`.
show q, from h₂, -- We show `q` by reiteration on `h₂`.
end
-- END |
ceb0c2c179601018db7d2c21619cc95b4541d9a9 | b00eb947a9c4141624aa8919e94ce6dcd249ed70 | /src/Lean/Elab/Match.lean | 81394db4c75fd3e9d1ced46709bdee5fe7387daf | [
"Apache-2.0"
] | permissive | gebner/lean4-old | a4129a041af2d4d12afb3a8d4deedabde727719b | ee51cdfaf63ee313c914d83264f91f414a0e3b6e | refs/heads/master | 1,683,628,606,745 | 1,622,651,300,000 | 1,622,654,405,000 | 142,608,821 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 58,797 | 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.Util.CollectFVars
import Lean.Meta.Match.MatchPatternAttr
import Lean.Meta.Match.Match
import Lean.Meta.SortLocalDecls
import Lean.Meta.Generali... |
c7dc7062349ded88bf49dbcdc09e593a48bdde8f | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/data/zmod/basic.lean | 4e4bee6c4326ec60c97567736e755d38e0e4e95e | [
"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 | 28,945 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Chris Hughes
-/
import data.int.modeq
import algebra.char_p
import data.nat.totient
import ring_theory.ideal.operations
/-!
# Integers mod `n`
Definition of the integers mod n, and the... |
3596643a402d0599c69e2e77c25203010f7ddd75 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/set/opposite.lean | 9a3786f567a47236a4b1d36668e5c60866e2d91a | [
"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,441 | lean | /-
Copyright (c) 2022 Markus Himmel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel
-/
import data.opposite
import data.set.image
/-!
# The opposite of a set
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding P... |
34a9dc43bfcdb7d9254b86ecc5adbc49b94004ee | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/fintype/card.lean | 81345e7f233c9310db131c321c75935ea3503dff | [
"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 | 40,940 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.fintype.basic
import data.finset.card
import data.list.nodup_equiv_fin
import tactic.positivity
import tactic.wlog
/-!
# Cardinalities of finite types
#... |
26758d7e18ab29823409454088ca70f9c4f26a3b | d7189ea2ef694124821b033e533f18905b5e87ef | /galois/data/bounded_list.lean | 8f0be6d54d845f8261d639c2698d23d9a10f6d72 | [
"Apache-2.0"
] | permissive | digama0/lean-protocol-support | eaa7e6f8b8e0d5bbfff1f7f52bfb79a3b11b0f59 | cabfa3abedbdd6fdca6e2da6fbbf91a13ed48dda | refs/heads/master | 1,625,421,450,627 | 1,506,035,462,000 | 1,506,035,462,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,526 | lean | import galois.tactic
universe variables u v
def bounded_list (α : Type u) (n : ℕ) := { l : list α // l.length ≤ n }
namespace bounded_list
/-- Two bounded_lists are equal if the underlying lists are equal. -/
theorem eq (α : Type u) (n : ℕ)
: ∀ {t₀ t₁ : bounded_list α n}, t₀^.val = t₁^.val → t₀ = t₁
| ⟨l, p₀⟩ ⟨.(l)... |
a463020abb6368225108e839aab4ba3a8e0021ef | d78da34857deb99eac819e7889eae59fdccec754 | /src/magma.lean | e46595a2ca82d106ba7cbd2808a181cdcfd559e3 | [] | no_license | wudcscheme/conceptual-mathematics-in-lean | 6ef168b69fb28eb25223db10ebb4b2fefad4dbdb | cc7877f528bfaf99a024844744e023acbfcadb1d | refs/heads/master | 1,678,885,284,910 | 1,601,437,497,000 | 1,601,663,206,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,151 | lean | import category_theory.category
import category_theory.concrete_category.bundled
import data.real.basic
namespace magma
universe u
open category_theory
class magma (carrier: Type*) extends has_mul carrier
def Magma := bundled magma
instance mag_has_mul (m: Magma) : has_mul m.α := ⟨ m.str.mul ⟩
section magma_h... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.