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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
38e3a182b95c60671910f2c69c44632a7d376673 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/number_theory/legendre_symbol/quadratic_char.lean | 29534941c1225fe7d18fd4a5de6dfab8832346cc | [
"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 | 10,800 | lean | /-
Copyright (c) 2022 Michael Stoll. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Michael Stoll
-/
import number_theory.legendre_symbol.zmod_char
import field_theory.finite.basic
/-!
# Quadratic characters of finite fields
This file defines the quadratic character ... |
f25bf9d170093ac30f2b7431f7e685746ebe1f78 | 626e312b5c1cb2d88fca108f5933076012633192 | /src/ring_theory/multiplicity.lean | 73d708f59c534bb298e9729ebc9790baf3469ab6 | [
"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 | 19,385 | 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, Chris Hughes
-/
import algebra.associated
import algebra.big_operators.basic
import ring_theory.valuation.basic
/-!
# Multiplicity of a divisor
For a commutative mo... |
7995f9e304e78e9718dbabffc88d0728a464c915 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebraic_geometry/prime_spectrum/basic.lean | d45eb115408ecc040ff927655c10a9238d134035 | [
"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 | 30,822 | 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 algebra.punit_instances
import linear_algebra.finsupp
import ring_theory.nilpotent
import ring_theory.localization.away
import ring_theory.ideal.prod
import ri... |
2f3202bf6e0efa4328190aabce997deccc7ddd6b | 9ad8d18fbe5f120c22b5e035bc240f711d2cbd7e | /src/data/heq_extra.lean | 40d964e2d69281c68455f66445082c559431d06b | [] | no_license | agusakov/lean_lib | c0e9cc29fc7d2518004e224376adeb5e69b5cc1a | f88d162da2f990b87c4d34f5f46bbca2bbc5948e | refs/heads/master | 1,642,141,461,087 | 1,557,395,798,000 | 1,557,395,798,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,844 | lean | /-
Copyright (c) 2019 Neil Strickland. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Neil Strickland
This contains some additional lemmas for working with heterogenous
equality. It is far from clear that the approach taken here
(or in places where these results ar... |
2cad2a87154826b4b9100d72be20518082328c7f | cf39355caa609c0f33405126beee2739aa3cb77e | /library/init/meta/converter/conv.lean | 84b0bba94e79d3a22e814638e1c44036a8d2420b | [
"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 | 4,414 | 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
Converter monad for building simplifiers.
-/
prelude
import init.meta.tactic init.meta.simp_tactic init.meta.interactive
import init.meta.congr_lemma init.met... |
beb7b47a19f756053f39f7df819aacacc970f087 | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /02_Dependent_Type_Theory.org.16.lean | 4d9ea607e29de0e248ba548bba7878d05a67b023 | [] | no_license | cjmazey/lean-tutorial | ba559a49f82aa6c5848b9bf17b7389bf7f4ba645 | 381f61c9fcac56d01d959ae0fa6e376f2c4e3b34 | refs/heads/master | 1,610,286,098,832 | 1,447,124,923,000 | 1,447,124,923,000 | 43,082,433 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 167 | lean | /- page 19 -/
import standard
constants A B C : Type
constants (g : B → C) (f : A → B)
-- BEGIN
definition g_comp_f (x : A) : C := g (f x)
print g_comp_f
-- END
|
3ff2c5dbb0cf55be4a014c2032fc74569439d374 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /test/matrix.lean | 3b664285a3c82028362cfeae0dcd36d56eba882f | [
"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 | 2,135 | lean | import data.matrix.notation
variables {α : Type} [semiring α]
namespace matrix
open_locale matrix
example {a a' b b' c c' d d' : α} :
![![a, b], ![c, d]] + ![![a', b'], ![c', d']] = ![![a + a', b + b'], ![c + c', d + d']] :=
by simp
example {a a' b b' c c' d d' : α} :
![![a, b], ![c, d]] ⬝ ![![a', b'], ![c', d... |
5116b921ea0d8e77217a79a848774fe06a547161 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/geometry/manifold/manifold.lean | ea7cab94f06131000b0ba98155fde9c20d85d6db | [
"Apache-2.0"
] | permissive | gebner/mathlib | eab0150cc4f79ec45d2016a8c21750244a2e7ff0 | cc6a6edc397c55118df62831e23bfbd6e6c6b4ab | refs/heads/master | 1,625,574,853,976 | 1,586,712,827,000 | 1,586,712,827,000 | 99,101,412 | 1 | 0 | Apache-2.0 | 1,586,716,389,000 | 1,501,667,958,000 | Lean | UTF-8 | Lean | false | false | 26,465 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import topology.local_homeomorph
/-!
# Manifolds
A manifold is a topological space M locally modelled on a model space H, i.e., the manifold is
covered by op... |
bb16a3bcf3117ae9bf5ba6323f197686b45d9d01 | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /src/Lean/Elab/SyntheticMVars.lean | 60f90a2bccce90e321645139a8252d9e30abd713 | [
"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 | 17,539 | 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, Sebastian Ullrich
-/
import Lean.Util.ForEachExpr
import Lean.Elab.Term
import Lean.Elab.Tactic.Basic
namespace Lean.Elab.Term
open Tactic (TacticM evalTacti... |
2018b1621ee4eb8f05775e37c757b1c625d34586 | 76df16d6c3760cb415f1294caee997cc4736e09b | /lean/src/lib/dict.lean | 5c614a82f1707e1ef888ebe8365e78506211bf62 | [
"MIT"
] | permissive | uw-unsat/leanette-popl22-artifact | 70409d9cbd8921d794d27b7992bf1d9a4087e9fe | 80fea2519e61b45a283fbf7903acdf6d5528dbe7 | refs/heads/master | 1,681,592,449,670 | 1,637,037,431,000 | 1,637,037,431,000 | 414,331,908 | 6 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 1,579 | lean | namespace dictionary
meta def tactic.dec_trivial := `[exact dec_trivial]
/- Definitions -/
section defs
variables (κ α : Type*)
def dict := κ → α
instance [inhabited α] : inhabited (dict κ α) :=
⟨λ _, default α⟩
end defs
/- Operations and lemmas -/
section ops
variables {κ α : Type*} [decidable_eq κ]
def dict.up... |
0446e11c75dd5161f599b57c58990e15bdad54fa | 3dd1b66af77106badae6edb1c4dea91a146ead30 | /tests/lean/run/set2.lean | 75d67010ea05483701b140d01a75ace85c66792f | [
"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 | 366 | lean | import standard bool
using bool
namespace set
definition set (T : Type) := T → bool
definition mem {T : Type} (a : T) (s : set T) := s a = '1
infix `∈`:50 := mem
section
parameter {T : Type}
definition empty : set T := λx, '0
notation `∅` := empty
theorem mem_empty (x : T) : ¬ (x ∈ ∅)
:= not_intro (λH : ... |
fde6b0a9b6b959ed814808140319b803cd2e6655 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /library/init/meta/set_get_option_tactics.lean | 2b19250ff4a4d8ab4398661aa8f68a972f26eb83 | [
"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 | 1,245 | 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
namespace tactic
meta_definition set_bool_option (n : name) (v : bool) : tactic unit :=
do s ← read,
write $ tactic_stat... |
e9275452ac0b3072146d13a0b9a4d20f1d4b6d78 | 1abd1ed12aa68b375cdef28959f39531c6e95b84 | /src/algebra/direct_sum/module.lean | 4786ed9ea4f59cc0f0144d707d015b7da7f799cc | [
"Apache-2.0"
] | permissive | jumpy4/mathlib | d3829e75173012833e9f15ac16e481e17596de0f | af36f1a35f279f0e5b3c2a77647c6bf2cfd51a13 | refs/heads/master | 1,693,508,842,818 | 1,636,203,271,000 | 1,636,203,271,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,033 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import algebra.direct_sum.basic
import linear_algebra.dfinsupp
/-!
# Direct sum of modules over commutative rings, indexed by a discrete type.
This file provides constructors... |
649c135a4fc2f5385773186d48588ca0f85baf86 | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/order/filter/at_top_bot.lean | c4329ccd9bab51ce813a779c7830747494832feb | [
"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 | 61,715 | 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, Jeremy Avigad, Yury Kudryashov, Patrick Massot
-/
import order.filter.bases
import data.finset.preimage
/-!
# `at_top` and `at_bot` filters on preorded sets, monoids a... |
b5f967678f5be627b4ec4d16718a6726b3ce3a7d | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/monoid_algebra/grading.lean | 00881606744f434c430f1b86d7d908888debd4ee | [
"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 | 8,453 | lean | /-
Copyright (c) 2021 Eric Wieser. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Eric Wieser
-/
import linear_algebra.finsupp
import algebra.monoid_algebra.support
import algebra.direct_sum.internal
import ring_theory.graded_algebra.basic
/-!
# Internal grading of an... |
1188a3747927ca9c37082cce1e618a029d8c70ae | af6139dd14451ab8f69cf181cf3a20f22bd699be | /library/init/function.lean | 3ebe8d458c83cf481976f4e75a7cdd169ae5faaa | [
"Apache-2.0"
] | permissive | gitter-badger/lean-1 | 1cca01252d3113faa45681b6a00e1b5e3a0f6203 | 5c7ade4ee4f1cdf5028eabc5db949479d6737c85 | refs/heads/master | 1,611,425,383,521 | 1,487,871,140,000 | 1,487,871,140,000 | 82,995,612 | 0 | 0 | null | 1,487,905,618,000 | 1,487,905,618,000 | null | UTF-8 | Lean | false | false | 5,403 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura, Jeremy Avigad, Haitao Zhang
General operations on functions.
-/
prelude
import init.data.prod init.funext init.logic
universes u₁ u₂ u₃ u₄
namespace function... |
94204b2b042410bc290b58ea0e071f6d48e97410 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/linear_algebra/alternating.lean | 5669b54276324d43cadcf6823661d7cca0bca3b5 | [
"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 | 29,914 | lean | /-
Copyright (c) 2020 Zhangir Azerbayev. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Eric Wieser, Zhangir Azerbayev
-/
import linear_algebra.multilinear
import linear_algebra.linear_independent
import group_theory.perm.sign
import group_theory.perm.subgroup
import ... |
3a9a699df1a66d832a9e1eb5b6de5853ff2aafdc | 1a61aba1b67cddccce19532a9596efe44be4285f | /library/data/nat/div.lean | 9b586565e601ab62afd561ba072d0fa4add57b86 | [
"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 | 26,537 | 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
Definitions and properties of div and mod. Much of the development follows Isabelle's library.
-/
import data.nat.sub
open eq.ops well_founded decidabl... |
b9e75fd09663e1a343f81c380fe93092b452a980 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/ring_theory/trace.lean | eb9117f5572cee823165c9ad859018c19cc22844 | [
"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 | 22,486 | lean | /-
Copyright (c) 2020 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen
-/
import linear_algebra.matrix.bilinear_form
import linear_algebra.matrix.charpoly.minpoly
import linear_algebra.determinant
import linear_algebra.finite_dimensional
import ... |
19001aeea155af7ceb30c5ec7b87788fc772695e | 367134ba5a65885e863bdc4507601606690974c1 | /src/analysis/calculus/tangent_cone.lean | d29894cdffd03762eaef91d4921e0b0501d17b0c | [
"Apache-2.0"
] | permissive | kodyvajjha/mathlib | 9bead00e90f68269a313f45f5561766cfd8d5cad | b98af5dd79e13a38d84438b850a2e8858ec21284 | refs/heads/master | 1,624,350,366,310 | 1,615,563,062,000 | 1,615,563,062,000 | 162,666,963 | 0 | 0 | Apache-2.0 | 1,545,367,651,000 | 1,545,367,651,000 | null | UTF-8 | Lean | false | false | 16,696 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import analysis.convex.basic
import analysis.normed_space.bounded_linear_maps
import analysis.specific_limits
/-!
# Tangent cone
In this file, we define two p... |
ca834d3c5dc1b69324e195df1a049147a96a5177 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/linear_algebra/affine_space/midpoint.lean | 7ceb9c2dc54059b6a4f12afa6d6d2539226814bb | [] | 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 | 10,646 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Yury Kudryashov
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.algebra.invertible
import Mathlib.linear_algebra.affine_space.affine_equiv
import Mathlib.... |
03ac80d897c66f950b8bb31c36171563eff45cd0 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/data/nat/choose/dvd.lean | 61dc0c6023377e0a89cc511254cf0a16776b36a7 | [
"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 | 1,225 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Patrick Stevens
-/
import data.nat.choose.basic
import data.nat.prime
/-!
# Divisibility properties of binomial coefficients
-/
namespace nat
open_locale nat
namespace ... |
4aaa88e7a61d21a40611f6474fba80f393d5ce9a | e0f9ba56b7fedc16ef8697f6caeef5898b435143 | /src/group_theory/perm/cycles.lean | 4cf2f71275f0ffcc18d86cc332d1bf254e0cd1bf | [
"Apache-2.0"
] | permissive | anrddh/mathlib | 6a374da53c7e3a35cb0298b0cd67824efef362b4 | a4266a01d2dcb10de19369307c986d038c7bb6a6 | refs/heads/master | 1,656,710,827,909 | 1,589,560,456,000 | 1,589,560,456,000 | 264,271,800 | 0 | 0 | Apache-2.0 | 1,589,568,062,000 | 1,589,568,061,000 | null | UTF-8 | Lean | false | false | 7,477 | lean | /-
Copyright (c) 2019 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import group_theory.perm.sign
import group_theory.order_of_element
namespace equiv.perm
open equiv function finset
variables {α : Type*} {β : Type*} [decidable_eq α]
de... |
0fb739db6942fccd2eb4b7fcecf4c5c8eaae3199 | a45212b1526d532e6e83c44ddca6a05795113ddc | /test/finish1.lean | ba20a0cf03b5d3db32eb85c2a605f696b506fac5 | [
"Apache-2.0"
] | permissive | fpvandoorn/mathlib | b21ab4068db079cbb8590b58fda9cc4bc1f35df4 | b3433a51ea8bc07c4159c1073838fc0ee9b8f227 | refs/heads/master | 1,624,791,089,608 | 1,556,715,231,000 | 1,556,715,231,000 | 165,722,980 | 5 | 0 | Apache-2.0 | 1,552,657,455,000 | 1,547,494,646,000 | Lean | UTF-8 | Lean | false | false | 4,965 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
Examples to test finish. (The designations "clarify," "safe," "iauto," etc. are
from a previous tableau prover.)
-/
import tactic.finish
open auto
section
variab... |
c6af3afe623c2f1ec19d4b0310891a0b1d768b49 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/data/int/log.lean | 62658ff08354091a1a7cc87d3caf2b62fa9407eb | [
"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 | 12,269 | lean | /-
Copyright (c) 2022 Eric Wieser. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Eric Wieser
-/
import data.nat.log
import algebra.order.floor
import algebra.field_power
/-!
# Integer logarithms in a field with respect to a natural base
This file defines two `ℤ`-val... |
cc00bd0348444e9160b7f6c19efea1e76823bec0 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/nat/modeq.lean | 3ac75bbcc4506c765cdf00386c3a131935ce4b4e | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 18,545 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.int.gcd
import tactic.abel
/-!
# Congruences modulo a natural number
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a cor... |
315f8a858bc30858b1bca1d66eda6f5739837585 | 329788bf44a766cbceec47f6d3a91aeee20146cf | /src/module-fg.lean | d686fcedfc505df527a65cf8e29f28119323ec2e | [] | no_license | jamiebell2805/BSD-conjecture | ca69613bb4b0d7051575ff6a7528ccace1bf9c6b | 74aa51f13750868b7011e397576d6f8035d69360 | refs/heads/master | 1,685,937,124,285 | 1,624,744,421,000 | 1,624,744,421,000 | 364,047,425 | 7 | 0 | null | 1,624,482,924,000 | 1,620,072,330,000 | Lean | UTF-8 | Lean | false | false | 1,482 | lean | import elliptic_curve_rationals
import group_theory.subgroup
import group_theory.finiteness
import group_theory.quotient_group
import data.fintype.card
import data.set.finite
import init.data.nat.lemmas
import data.nat.prime
import data.zmod.basic
import data.complex.basic
import analysis.special_functions.pow
import o... |
6ae4da1a7a82f061c8fb820cfe66011ba6cb8b76 | 367134ba5a65885e863bdc4507601606690974c1 | /src/data/zsqrtd/gaussian_int.lean | 9de0ea656e14ba0d093d7b41e5bc4d4f88c115bc | [
"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,626 | lean | /-
Copyright (c) 2019 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Chris Hughes
-/
import data.zsqrtd.basic
import data.complex.basic
import ring_theory.principal_ideal_domain
import number_theory.quadratic_reciprocity
/-!
# Gaussian integers
The Gaussi... |
29f73ed7972f14379ba73781dfd0e5f514b2fbeb | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/ring_theory/power_series/basic.lean | 7748ffd2f8757573733b8c85eb0529e9cca62985 | [
"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 | 64,476 | lean | /-
Copyright (c) 2019 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Kenny Lau
-/
import data.mv_polynomial
import linear_algebra.std_basis
import ring_theory.ideal.operations
import ring_theory.multiplicity
import ring_theory.algebra_to... |
256b0646b7c99226ee8d96e69bb0d786b50f19d7 | 246309748072bf9f8da313401699689ebbecd94d | /src/linear_algebra/affine_space/independent.lean | 7e64af5e6ff0c0508c1713a3c7ebe62c72e66768 | [
"Apache-2.0"
] | permissive | YJMD/mathlib | b703a641e5f32a996f7842f7c0043bab2b462ee2 | 7310eab9fa8c1b1229dca42682f1fa6bfb7dbbf9 | refs/heads/master | 1,670,714,479,314 | 1,599,035,445,000 | 1,599,035,445,000 | 292,279,930 | 0 | 0 | null | 1,599,050,561,000 | 1,599,050,560,000 | null | UTF-8 | Lean | false | false | 18,295 | lean | /-
Copyright (c) 2020 Joseph Myers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Joseph Myers.
-/
import data.finset.sort
import linear_algebra.affine_space.combination
import linear_algebra.basis
noncomputable theory
open_locale big_operators
open_locale classical
... |
8437523c37f8873cbdfb1075dc90aaaa9aba4605 | 392d28f7e76ae84b38b6424255b29b4a4af0d129 | /inClassNotes/00_whatIsALanguage.lean | be4c66d5ed69112ed7260af2ae06cb41a301fec3 | [] | 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 | 1,428 | lean | inductive Syntax : Type
| I
| II
| III
| IV
| V
inductive Semantics : Type
| one
| two
| three
| four
| five
#reduce one -- Visible only in Semantics namespace
#reduce Semantics.one -- Qualified access to that namespace
open Semantics -- Open namespaces
open Syntax
#reduce one -- Now de... |
d650a17ccd4063e05f70157ced4f5285aa744f36 | 750acab0c635b67751bcfec43c5411aa3941c441 | /module.lean | 6fa221ac60e497fc2b3b9ceab5b596a372db2388 | [] | no_license | nthomas103/lean_work | 912f8e662cdd73ba97f5d3655ddb8a5d2cd204c9 | 7e9785cae2b60a77b41922fd5d5b159a1fae415c | refs/heads/master | 1,586,739,169,355 | 1,455,759,226,000 | 1,455,759,226,000 | 50,978,095 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 16,492 | 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
Modules and vector spaces over a ring.
-/
import algebra.field data --data.matrix
open eq.ops set function fin
definition vector [reducible] (A : Ty... |
22da8c419dbc0f55b9cb8af40f3cf99a30f34ca4 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/linterSuspiciousUnexpanderPatterns.lean | fe3cd7909a9ce56f48c0c5a2c02a82b2264e892a | [
"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 | 378 | lean | import Lean
set_option linter.suspiciousUnexpanderPatterns true
@[app_unexpander List.nil] def unexpandListNilBad : Lean.PrettyPrinter.Unexpander
| `(List.nil) => `([])
| _ => throw ()
/--hey-/
@[app_unexpander List.cons] private def unexpandListConsBad : Lean.PrettyPrinter.Unexpander
| `(List.cons $x []... |
ceb568acc7ac763f22312f28306cf7a6742be083 | ad0c7d243dc1bd563419e2767ed42fb323d7beea | /tests/linarith.lean | daafaebaacfae36e5c0c6c3c3b844fa9ac6232d1 | [
"Apache-2.0"
] | permissive | sebzim4500/mathlib | e0b5a63b1655f910dee30badf09bd7e191d3cf30 | 6997cafbd3a7325af5cb318561768c316ceb7757 | refs/heads/master | 1,585,549,958,618 | 1,538,221,723,000 | 1,538,221,723,000 | 150,869,076 | 0 | 0 | Apache-2.0 | 1,538,229,323,000 | 1,538,229,323,000 | null | UTF-8 | Lean | false | false | 2,415 | lean | import tactic.linarith
example (e b c a v0 v1 : ℚ) (h1 : v0 = 5*a) (h2 : v1 = 3*b) (h3 : v0 + v1 + c = 10) :
v0 + 5 + (v1 - 3) + (c - 2) = 10 :=
by linarith
example (ε : ℚ) (h1 : ε > 0) : ε / 2 + ε / 3 + ε / 7 < ε :=
by linarith
example (x y z : ℚ) (h1 : 2*x < 3*y) (h2 : -4*x + z/2 < 0)
(h3 : 12*y - z < ... |
18eb6fccb57c2e6c17763b83d85921f434b98ab6 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/order/group/type_tags.lean | 96fdf16b6f4df3cde51fdfb0e6e3446f189a0f6a | [
"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 | 1,112 | 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.order.group.instances
import algebra.order.monoid.type_tags
/-! # Ordered group structures on `multip... |
5cdba142b08358f37e59aad33362191c0402a026 | 2a70b774d16dbdf5a533432ee0ebab6838df0948 | /_target/deps/mathlib/src/category_theory/abelian/non_preadditive.lean | 7997cfb3cce90045511f0e55d120e60109f89a67 | [
"Apache-2.0"
] | permissive | hjvromen/lewis | 40b035973df7c77ebf927afab7878c76d05ff758 | 105b675f73630f028ad5d890897a51b3c1146fb0 | refs/heads/master | 1,677,944,636,343 | 1,676,555,301,000 | 1,676,555,301,000 | 327,553,599 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 32,053 | lean | /-
Copyright (c) 2020 Markus Himmel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel
-/
import category_theory.limits.shapes.finite_products
import category_theory.limits.shapes.kernels
import category_theory.limits.shapes.normal_mono
import category_theor... |
1d7e32353a96b5c9b23cea430e1b5bc90f022ac4 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /library/init/meta/pexpr.lean | 2f79d1f68acab14028c4a9d5326bd52bd6dad2c8 | [
"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 | 990 | 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.expr
universe variables u
/- Quoted expressions. They can be converted into expressions by using a tactic. -/
meta_constant pexpr ... |
263dc2f3920b9a45855d84a86dae57151b4bccea | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/category_theory/limits/comma.lean | 74fbc6f9fc26e5b1dc13d6551eb6dee0958f7256 | [
"Apache-2.0"
] | permissive | jcommelin/mathlib | d8456447c36c176e14d96d9e76f39841f69d2d9b | ee8279351a2e434c2852345c51b728d22af5a156 | refs/heads/master | 1,664,782,136,488 | 1,663,638,983,000 | 1,663,638,983,000 | 132,563,656 | 0 | 0 | Apache-2.0 | 1,663,599,929,000 | 1,525,760,539,000 | Lean | UTF-8 | Lean | false | false | 10,352 | lean | /-
Copyright (c) 2021 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta
-/
import category_theory.arrow
import category_theory.limits.constructions.epi_mono
import category_theory.limits.creates
import category_theory.limits.preserves.finite
imp... |
e7c9fe3044539c68f1fc10b4cc506fa21f99c419 | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /src/Lean/Elab/DefView.lean | f744f38b4fa0c185c41791d8cff617d1ba3e406a | [
"Apache-2.0"
] | permissive | williamdemeo/lean4 | 72161c58fe65c3ad955d6a3050bb7d37c04c0d54 | 6d00fcf1d6d873e195f9220c668ef9c58e9c4a35 | refs/heads/master | 1,678,305,356,877 | 1,614,708,995,000 | 1,614,708,995,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,107 | 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, Sebastian Ullrich
-/
import Std.ShareCommon
import Lean.Parser.Command
import Lean.Util.CollectLevelParams
import Lean.Util.FoldConsts
import Lean.Elab.Collec... |
d175fe4644fe3f3628d3e8e24f354a43841eccf0 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/category_theory/groupoid/free_groupoid.lean | 4a683ef2d8107dd48d603dd38a1793e79ca61e7e | [
"Apache-2.0"
] | permissive | kbuzzard/mathlib | 2ff9e85dfe2a46f4b291927f983afec17e946eb8 | 58537299e922f9c77df76cb613910914a479c1f7 | refs/heads/master | 1,685,313,702,744 | 1,683,974,212,000 | 1,683,974,212,000 | 128,185,277 | 1 | 0 | null | 1,522,920,600,000 | 1,522,920,600,000 | null | UTF-8 | Lean | false | false | 7,583 | lean | /-
Copyright (c) 2022 Rémi Bottinelli. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Rémi Bottinelli
-/
import category_theory.category.basic
import category_theory.functor.basic
import category_theory.groupoid
import tactic.nth_rewrite
import category_theory.path_cat... |
974b0668c78d31c2aadfd7719c3e830ca864110f | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/ring_theory/polynomial/selmer.lean | ba8ec36036055d47bdd5882436b04f97e8c76f3e | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 3,594 | lean | /-
Copyright (c) 2022 Thomas Browning. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Thomas Browning
-/
import data.polynomial.unit_trinomial
import ring_theory.polynomial.gauss_lemma
import tactic.linear_combination
/-!
# Irreducibility of Selmer Polynomials
> THI... |
1bd6aa4f97c5becbe62a506892f719bd59234646 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/compiler/overflow1.lean | 22c2af12f33b6024b436bcf9ca542432f0bd5ffe | [
"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 | 422 | lean | def longArray (n : Nat := 50000) (xs : Array Char := #[]) : Array Char :=
match n with
| 0 => xs
| n+1 => longArray n (xs.push 'a')
def OverflowIte
{m : Type -> Type}
[inst1: Monad m]
(xs: Array Char) :
StateT Nat m Nat :=
xs.foldlM (fun (len : Nat) (s : Char) => if s = 'z' then panic "z" else return len + 1... |
e980158f00f12748e1866c37c26e4969adf3d043 | a156d865507798f08f46a2f6ca204d9727f4734d | /src/tactic/depends.lean | fdaec2e3a2918b9150fe1713aaf5d880aff565bd | [] | no_license | jesse-michael-han/formalabstracts | 4e2fc8c107a3388823ffbd1671dd1e54108ea394 | 63a949de7989f17c791c40e580c3011516af57e0 | refs/heads/master | 1,625,470,495,408 | 1,551,315,841,000 | 1,551,316,547,000 | 136,272,424 | 0 | 0 | null | 1,528,259,798,000 | 1,528,259,798,000 | null | UTF-8 | Lean | false | false | 4,266 | lean | /-
Copyright (c) 2018 Koundinya Vajjha. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Koundinya Vajjha
A meta def called `#depends` which gives the names of all the theorems (the statement of) a given definition/theorem depends on.
-/
import ..basic
open tactic exp... |
d814b89e25b3a2f3585c26a9ef7261b4f76dfa7e | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tests/lean/474.lean | 7ca5b35f9296a30916ee175c89eded295a76abe1 | [
"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 | 1,697 | lean | import Lean
open Lean Meta
#eval show MetaM Unit from do
let e ← withLetDecl `y (mkConst ``Nat) (mkConst ``Nat.zero) fun y => do
let m ← mkFreshExprMVar (mkConst ``Nat)
assignExprMVar m.mvarId! y
let e ← mkApp2 (mkConst ``Nat.add) m y
-- goal: construct λ y, e
dbg_trace (← ppExpr (← mkLambdaFVars... |
a92108dcbe2f64a3b07acd2b882bf42e3876643c | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /03_Propositions_and_Proofs.org.6.lean | 736ea58e15d42b18407ca9308aa6b3cf5a87794d | [] | no_license | cjmazey/lean-tutorial | ba559a49f82aa6c5848b9bf17b7389bf7f4ba645 | 381f61c9fcac56d01d959ae0fa6e376f2c4e3b34 | refs/heads/master | 1,610,286,098,832 | 1,447,124,923,000 | 1,447,124,923,000 | 43,082,433 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 144 | lean | /- page 36 -/
import standard
constants p q : Prop
-- BEGIN
theorem t1 : p → q → p := λ Hp : p, λ Hq : q, Hp
reveal t1
print t1
-- END
|
9f2be2a695c304698463ae90c6c9cf3a1a255acf | 82b86ba2ae0d5aed0f01f49c46db5afec0eb2bd7 | /tests/lean/run/elabCmd.lean | 1a7b17ae71159c1f21b9cdd4629af81d08fc5ad9 | [
"Apache-2.0"
] | permissive | banksonian/lean4 | 3a2e6b0f1eb63aa56ff95b8d07b2f851072d54dc | 78da6b3aa2840693eea354a41e89fc5b212a5011 | refs/heads/master | 1,673,703,624,165 | 1,605,123,551,000 | 1,605,123,551,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 704 | lean | import Lean
open Lean
open Lean.Elab
open Lean.Elab.Term
def getCtors (c : Name) : TermElabM (List Name) := do
let env ← getEnv;
(match env.find? c with
| some (ConstantInfo.inductInfo val) =>
pure val.ctors
| _ => pure [])
def elabAnonCtor (args : Syntax) (τ : Expr) : TermElabM Expr :=
match τ.getAppFn with
... |
acb12cafc0b8f61e8dcbd08057a68d009a1f99d4 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/order/category/LinearOrder.lean | 2f1c682402098214cf5511030ebdf8cf8687edc1 | [] | 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 | 1,359 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.order.category.PartialOrder
import Mathlib.PostPort
universes u_1
namespace Mathlib
/-!... |
cdaa1980321fbc26aa1f38a7d0162d8c8da2ed19 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /stage0/src/Init/Control/Basic.lean | 00876d7983b741810bf8414d6a207a7378f6c231 | [
"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 | 3,815 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura, Sebastian Ullrich
-/
prelude
import Init.Core
universe u v w
@[reducible] def Functor.mapRev {f : Type u → Type v} [Functor f] {α β : Type u} : f α → (α → β)... |
572568e38c383fec9783adb3df0c96021280ac09 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/ring_theory/witt_vector/defs.lean | 8c8bf30c8d265237b79255de909117db4a06236d | [
"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 | 11,676 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Robert Y. Lewis
-/
import ring_theory.witt_vector.structure_polynomial
/-!
# Witt vectors
In this file we define the type of `p`-typical Witt vectors and ring operat... |
02425ef5ae6a408b63d3b7c9a49e01799c114f95 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/subobject/comma.lean | 3c74b8cf0034c0f3d0782bfcf2a0b91d5ae70b76 | [
"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 | 10,315 | 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 category_theory.subobject.well_powered
import category_theory.limits.preserves.finite
import category_theory.limits.shapes.finite_limits
/-!
# Subobjects in the... |
529d7a30d51a5cfefddb7ec6d396b82b1f8ddc88 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/endomorphism.lean | fc90370b8f3764919cae92464ac0ab5a48932aa1 | [] | 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,351 | lean | /-
Copyright (c) 2019 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov, Scott Morrison, Simon Hudon
Definition and basic properties of endomorphisms and automorphisms of an object in a category.
-/
import Mathlib.PrePort
import Mathlib.L... |
58a84ba681c4b15ca4e32be0b3c71f3511cbb999 | a721fe7446524f18ba361625fc01033d9c8b7a78 | /elaborate/add_comm_2.stripped.lean | 33d2b01fa34f5cc2c630a1c3ee0e5978f680acb4 | [] | no_license | Sterrs/leaning | 8fd80d1f0a6117a220bb2e57ece639b9a63deadc | 3901cc953694b33adda86cb88ca30ba99594db31 | refs/heads/master | 1,627,023,822,744 | 1,616,515,221,000 | 1,616,515,221,000 | 245,512,190 | 2 | 0 | null | 1,616,429,050,000 | 1,583,527,118,000 | Lean | UTF-8 | Lean | false | false | 1,508 | lean | λ (m n : mynat), (mynat.rec ⟨λ (m : mynat), eq.rec (eq.refl m) (eq.rec (eq.refl (m = add zero m)) (eq.rec (eq.refl (m = add zero m)) ((mynat.rec ⟨eq.refl zero, punit.star⟩ (λ (n : mynat) (ih : pprod (add zero n = n) (mynat.rec punit (λ (n : mynat) (ih : Type), pprod (pprod (add zero n = n) ih) punit) n)), ⟨eq.rec (eq.r... |
52ecc17a8e430160e050e88dc9f0e2bf5c881c89 | cc62cd292c1acc80a10b1c645915b70d2cdee661 | /src/category_theory/sigma_category.lean | d222643b11a746efcc3bb6fdd01190ca079af3b0 | [] | no_license | RitaAhmadi/lean-category-theory | 4afb881c4b387ee2c8ce706c454fbf9db8897a29 | a27b4ae5eac978e9188d2e867c3d11d9a5b87a9e | refs/heads/master | 1,651,786,183,402 | 1,565,604,314,000 | 1,565,604,314,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 950 | 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 category_theory.fully_faithful
/- This is exactly analogous to the full_subcategory definition for a subtype, but
for a sigma type instead. -/
namespace c... |
016e022ff87c3f166f81053f665cf8b7df7afd5b | ba306bac106b8f27befb2a800f4357237f86c760 | /lean/love03_forward_proofs_demo.lean | e73c2cd6c7e8bcb4c747950de4d00dd464f652c4 | [] | no_license | qyqnl/logical_verification_2020 | 406aa4cc47797501275ea07de5d6f59f01e977d0 | 17dff35b56336acb671ddfb36871f98475bc0b96 | refs/heads/master | 1,672,501,336,112 | 1,603,724,260,000 | 1,603,724,260,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,750 | lean | import .love01_definitions_and_statements_demo
/- # LoVe Demo 3: Forward Proofs
When developing a proof, often it makes sense to work __forward__: to start with
what we already know and proceed step by step towards our goal. Lean's
structured proofs and raw proof terms are two style that support forward
reasoning. -... |
b01fcd82d33245e7dd6926fce4e6b41f517ab4fc | 8e6cad62ec62c6c348e5faaa3c3f2079012bdd69 | /src/group_theory/perm/sign.lean | 94aa33a6f1158f7717c1737b153b04c5bdec5462 | [
"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 | 32,671 | 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 data.fintype.basic
import data.finset.sort
import group_theory.perm.basic
import group_theory.order_of_element
import tactic.norm_swap
/-!
# Sign of a permutation... |
49cadb848ac35d6f5a14d9bf972233c59cda66fd | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/multiset/nodup.lean | 40ed28dae0c4723c2182551c81c468ce1e885a19 | [
"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 | 9,412 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.list.nodup
import data.multiset.bind
import data.multiset.range
/-!
# The `nodup` predicate for multisets without duplicate elements.
> THIS FILE... |
992a6511baf0889d45104cbb861a8852ff19ff1f | 0c1546a496eccfb56620165cad015f88d56190c5 | /library/init/meta/tactic.lean | 3da8784a87a64a0c5c154c7e49c677a70fe3300f | [
"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 | 34,508 | 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.function init.data.option.basic init.util
import init.category.combinators init.category.monad init.category.alternative
import init.dat... |
53f62823c72b6b748379c2fdb426012fcb3639d6 | 4a894698f2ae3f991490c25af3c13ea4435dac48 | /src/instructor/lectures/lecture_5.lean | 69f6a927a0c66bb5d3c2526d60d30cb0953a7fe9 | [] | no_license | gnujey/cs2120f21 | 8a33f636346d59ade049dcc1726634f434ac1955 | 138d43446c443c1d15cd2f17fb607c4f0dff702f | refs/heads/main | 1,690,598,880,775 | 1,631,132,566,000 | 1,631,132,566,000 | 405,182,739 | 1 | 0 | null | 1,631,299,824,000 | 1,631,299,823,000 | null | UTF-8 | Lean | false | false | 2,509 | lean | /-
INTRODUCTION and ELIMINATION RULES
-/
/-
For ∀ x, P x (every x has property P)
- introduction rule: assume arbitrary x, then show P x
- elimination rule: *apply* a proof of ∀ x, P x, as a
kind of function to a specific value of x, say k, to
produce a proof of P k.
-/
theorem silly : ∀ (n : ℕ), true :=
be... |
0a83c1e7eec70aefbdeff93cc68ed1d71f717aa5 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /archive/100-theorems-list/83_friendship_graphs.lean | f6033c4a2cc7cab634f4109cc619d2a57d0c6909 | [
"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 | 13,776 | 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, Kyle Miller
-/
import combinatorics.simple_graph.adj_matrix
import linear_algebra.matrix.charpoly.coeff
import data.int.modeq
import data.zmod.basic
import... |
96f670ddc5bc21236bb89b831ed022e38c5f301f | dfbb669f3f58ceb57cb207dcfab5726a07425b03 | /vscode-lean4/test/test-fixtures/multi/test/Main.lean | bfe240205479e39717b600dd6f23e0a10280cdf4 | [
"Apache-2.0"
] | permissive | leanprover/vscode-lean4 | 8bcf7f06867b3c1d42007fe6da863a7a17444dbb | 6ef0bfa668bdeaad0979e6df10551d42fcc01094 | refs/heads/master | 1,692,247,771,767 | 1,691,608,804,000 | 1,691,608,804,000 | 325,845,305 | 64 | 24 | Apache-2.0 | 1,694,176,429,000 | 1,609,435,614,000 | TypeScript | UTF-8 | Lean | false | false | 152 | lean | import Test
import Lean
import Lean.Expr
def main : IO Unit :=
IO.println s!"Hello, {hello}!"
#eval Lean.versionString
#eval main
#eval IO.appPath |
2a0f05f767e6bc71d60fcb91c86832cf387b4172 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/control/traversable/equiv.lean | 160d2e5cdcc22be72c0f761c05905fa6c6a226c4 | [
"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 | 6,230 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
-/
import control.traversable.lemmas
import logic.equiv.basic
/-!
# Transferring `traversable` instances along isomorphisms
This file allows to transfer `traversable` instan... |
9756ce96b4845c7b039e1082df5ac013a555171a | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/match_perf_issue.lean | 2aec70c9beb1e2c4dda71540e5f19a2ff838e504 | [
"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 | 481 | lean | def f : nat → bool
| 0 := ff
| _ := tt
inductive tree
| leaf : nat → tree
| node : nat → tree → tree → tree
def mk_tree : nat → nat → tree
| 0 v := tree.leaf v
| (n+1) v :=
let t := mk_tree n v in
tree.node v t t
def tst : tree → nat
| (tree.leaf v) := v
| (tree.node v l r) :=
match f v with
| tt := tst ... |
5580c2479149f87e2cd08d3654883115735ba7d6 | b70031c8e2c5337b91d7e70f1e0c5f528f7b0e77 | /src/analysis/normed_space/enorm.lean | b39002e5d0f66d1fd14f06d48328560dbbe5cf4e | [
"Apache-2.0"
] | permissive | molodiuc/mathlib | cae2ba3ef1601c1f42ca0b625c79b061b63fef5b | 98ebe5a6739fbe254f9ee9d401882d4388f91035 | refs/heads/master | 1,674,237,127,059 | 1,606,353,533,000 | 1,606,353,533,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,627 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Yury G. Kudryashov
-/
import analysis.normed_space.basic
/-!
# Extended norm
In this file we define a structure `enorm 𝕜 V` representing an extended norm (i.e., a norm that can
t... |
32a4b0e3fcebf6e69af21755ca624cd538c57e78 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/field_theory/galois.lean | 132caae2c2b465a4f3f8b48819a30a8f8af87eba | [
"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 | 18,436 | lean | /-
Copyright (c) 2020 Thomas Browning, Patrick Lutz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Thomas Browning, Patrick Lutz
-/
import field_theory.normal
import field_theory.primitive_element
import field_theory.fixed
import ring_theory.power_basis
import group_... |
9a15da7db904a5980ece11e2f0e12cf7b8280c0c | 206422fb9edabf63def0ed2aa3f489150fb09ccb | /src/data/set/function.lean | cc7cb18b1d1b5a735d72f828041d1643917ef82a | [
"Apache-2.0"
] | permissive | hamdysalah1/mathlib | b915f86b2503feeae268de369f1b16932321f097 | 95454452f6b3569bf967d35aab8d852b1ddf8017 | refs/heads/master | 1,677,154,116,545 | 1,611,797,994,000 | 1,611,797,994,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 30,680 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad, Andrew Zipperer, Haitao Zhang, Minchao Wu, Yury Kudryashov
-/
import data.set.basic
import logic.function.conjugate
/-!
# Functions over sets
## Main definitions
### Pr... |
b1c5bf183c67556b634140b97950a4be8decf744 | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /tests/lean/run/decidelet.lean | 2f0fe461ab3717a43cf5eab99ca983a45c179a13 | [
"Apache-2.0"
] | permissive | williamdemeo/lean4 | 72161c58fe65c3ad955d6a3050bb7d37c04c0d54 | 6d00fcf1d6d873e195f9220c668ef9c58e9c4a35 | refs/heads/master | 1,678,305,356,877 | 1,614,708,995,000 | 1,614,708,995,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 57 | lean | theorem ex : let x := 1; x < 2 := by
intro x
decide!
|
649b750c3077fa3de7de5b682dea475f382f2185 | 1b8f093752ba748c5ca0083afef2959aaa7dace5 | /src/category_theory/limits/squares.lean | 07d89f5e69b0958358eb0b14fd0df1940dbc8f9d | [] | no_license | khoek/lean-category-theory | 7ec4cda9cc64a5a4ffeb84712ac7d020dbbba386 | 63dcb598e9270a3e8b56d1769eb4f825a177cd95 | refs/heads/master | 1,585,251,725,759 | 1,539,344,445,000 | 1,539,344,445,000 | 145,281,070 | 0 | 0 | null | 1,534,662,376,000 | 1,534,662,376,000 | null | UTF-8 | Lean | false | false | 5,194 | lean | -- Copyright (c) 2018 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Scott Morrison, Reid Barton, Mario Carneiro
import category_theory.limits.shape
open category_theory
namespace category_theory.limits
universes u v w
variables {C : Type u} ... |
70ee88569d8912e962246ed58b6ba200de777695 | 4e3bf8e2b29061457a887ac8889e88fa5aa0e34c | /lean/love06_monads_homework_solution.lean | 18f10caee947f2402b4826c5a8d48f213b689bda | [] | no_license | mukeshtiwari/logical_verification_2019 | 9f964c067a71f65eb8884743273fbeef99e6503d | 16f62717f55ed5b7b87e03ae0134791a9bef9b9a | refs/heads/master | 1,619,158,844,208 | 1,585,139,500,000 | 1,585,139,500,000 | 249,906,380 | 0 | 0 | null | 1,585,118,728,000 | 1,585,118,727,000 | null | UTF-8 | Lean | false | false | 2,226 | lean | /- LoVe Homework 6: Monads -/
import .lovelib
namespace LoVe
/- Question 2 **optional**: Monadic Structure on Lists -/
/- `list` can be seen as a monad, similar to `option` but with several possible
outcomes. It is also similar to `set`, but the results are ordered and finite.
The code below sets `list` up as a mo... |
d8ea569d0b7f4fce85ef7d48a42fd0e3acb580af | 8cb37a089cdb4af3af9d8bf1002b417e407a8e9e | /library/init/meta/mk_has_reflect_instance.lean | 6046e15d22a224b17ffd5d37a2e3daa61444abec | [
"Apache-2.0"
] | permissive | kbuzzard/lean | ae3c3db4bb462d750dbf7419b28bafb3ec983ef7 | ed1788fd674bb8991acffc8fca585ec746711928 | refs/heads/master | 1,620,983,366,617 | 1,618,937,600,000 | 1,618,937,600,000 | 359,886,396 | 1 | 0 | Apache-2.0 | 1,618,936,987,000 | 1,618,936,987,000 | null | UTF-8 | Lean | false | false | 3,745 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
Helper tactic for constructing a has_reflect instance.
-/
prelude
import init.meta.rec_util
namespace tactic
open expr environment list
/- Retrieve the name... |
c97b2e890f9682c8e436a725d65be1599c9d3f68 | 3dd1b66af77106badae6edb1c4dea91a146ead30 | /tests/lean/run/tactic10.lean | 975686b87875bdedc87caab31151216cc47294be | [
"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 | 199 | lean | import standard
using tactic
theorem tst (a b : Prop) (H : a ↔ b) : b ↔ a
:= by apply iff_intro;
apply (assume Hb, iff_mp_right H Hb);
apply (assume Ha, iff_mp_left H Ha)
check tst
|
08c3a73c91ba4beeb600a497fe01e5a4e6b242dd | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/category/Group/abelian.lean | 757ef5fdc8848c060a360338e54e334d27d90eb3 | [
"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 | 1,549 | lean | /-
Copyright (c) 2020 Markus Himmel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel
-/
import algebra.category.Group.Z_Module_equivalence
import algebra.category.Group.limits
import algebra.category.Group.colimits
import algebra.category.Module.abelian
im... |
5e2e097d3b6a0bfbd7955ce89ed9cf875399edb7 | fd71e7836e9a5d14548f6d3291653cbb6c608dbe | /src/test/slim_check/tactics.lean | dc7aa8efa1f006fb10d0c5503177deae56fd797b | [] | no_license | cipher1024/slim_check | 382c80a98aed105a97eeac84f590a06dca4d8c7d | 5969b7f72e01fdd46f2502ed0cbf69c0699061d4 | refs/heads/master | 1,625,514,334,828 | 1,574,118,572,000 | 1,574,118,572,000 | 101,538,155 | 2 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 4,941 | lean |
import test.slim_check.testable
namespace tactic.interactive
open tactic slim_check
meta def expect_failure (cmd : itactic) : tactic unit :=
λ s, match cmd s with
| (interaction_monad.result.exception msg _ s') :=
match msg with
| (some msg') := (trace (msg' ()) >> admit) s'
| none := admit s'
end
| (inter... |
5f3f4a7976ff82bc9cb19b8f319b0eed655548ed | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/tactic/restate_axiom.lean | 2781d9052aaf37f9e94479817be1a31e37b3a144 | [
"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 | 3,196 | 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 data.buffer.parser
import tactic.doc_commands
open lean.parser tactic interactive parser
/--
`restate_axiom` takes a structure field, and makes a new, defini... |
abaab092bb579ebeea1b24659b80fcbac949ad23 | f083c4ed5d443659f3ed9b43b1ca5bb037ddeb58 | /algebra/group.lean | 8f80fb41d37bb3fd7250939a7edc24089b3b46f8 | [
"Apache-2.0"
] | permissive | semorrison/mathlib | 1be6f11086e0d24180fec4b9696d3ec58b439d10 | 20b4143976dad48e664c4847b75a85237dca0a89 | refs/heads/master | 1,583,799,212,170 | 1,535,634,130,000 | 1,535,730,505,000 | 129,076,205 | 0 | 0 | Apache-2.0 | 1,551,697,998,000 | 1,523,442,265,000 | Lean | UTF-8 | Lean | false | false | 24,584 | 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
Various multiplicative and additive structures.
-/
import tactic.interactive data.option
section pending_1857
/- Transport multiplicative to additive... |
1277d2d93ac4fcf424723796593ca7c959a0c0c6 | 437dc96105f48409c3981d46fb48e57c9ac3a3e4 | /src/analysis/normed_space/real_inner_product.lean | af4e75cbae39eebaa97f011066d8af24ebd5bb73 | [
"Apache-2.0"
] | permissive | dan-c-k/mathlib | 08efec79bd7481ee6da9cc44c24a653bff4fbe0d | 96efc220f6225bc7a5ed8349900391a33a38cc56 | refs/heads/master | 1,658,082,847,093 | 1,589,013,201,000 | 1,589,013,201,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 21,993 | lean | /-
Copyright (c) 2019 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou
-/
import algebra.quadratic_discriminant
import analysis.special_functions.pow
import tactic.monotonicity
/-!
# Inner Product Space
This file defines real inner product... |
5ba84c7dcba4b40f748a20b9292a7d8f0cb7f4c3 | b815abf92ce063fe0d1fabf5b42da483552aa3e8 | /library/init/meta/interactive.lean | 08f72b665804684f7eb340e5a80a26dd95acf9fc | [
"Apache-2.0"
] | permissive | yodalee/lean | a368d842df12c63e9f79414ed7bbee805b9001ef | 317989bf9ef6ae1dec7488c2363dbfcdc16e0756 | refs/heads/master | 1,610,551,176,860 | 1,481,430,138,000 | 1,481,646,441,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 15,053 | 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
namespace tactic
namespace interactive
namespace types
/- The parser treats ... |
a15e6311b5668903f60c96ae7da7fd2f2ab765b2 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/field_theory/subfield.lean | 1b7ce59a11b14afb6252977ad83d855c127fe1bf | [
"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 | 23,970 | lean | /-
Copyright (c) 2020 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen
-/
import algebra.algebra.basic
/-!
# Subfields
Let `K` be a field. This file defines the "bundled" subfield type `subfield K`, a type
whose terms correspond to subfields o... |
c01b2dfbbbd6e6e1297b8eec3e00d7e9abc5fefc | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/get_unused_name.lean | 5548ba28ce80d8a52c9d8de4410223f06d47a7c4 | [
"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 | 337 | lean | open tactic
example (a b c : nat) : a = c → a + b = b + c :=
by do
n1 ← get_unused_name `a,
n2 ← get_unused_name `b,
n3 ← get_unused_name `c,
n4 ← get_unused_name `d,
intro n1,
n5 ← get_unused_name `a,
trace n1 >> trace n2 >> trace n3 >> trace n4 >> trace n5,
get_local `a >>= subst,
`[apply nat.add_c... |
762ed33b222b645ec6d4ff280d1c57a9fe76f2e8 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/algebraic_geometry/structure_sheaf.lean | 39b26484582332c1318af40a1917331f053a3895 | [
"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 | 44,840 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Scott Morrison
-/
import algebraic_geometry.prime_spectrum.basic
import algebra.category.CommRing.colimits
import algebra.category.CommRing.limits
import topology.sheav... |
9de4e38ee9a05643a50e95f7e3d562e42d2f176e | d98f8063520761a65549cff3a6e0b1f33c180b92 | /super/clauses.lean | 137164525a68c51c738179aaa77264e61bc577ae | [] | no_license | gebner/POPL17_tutorial | 76cb1f3164b2f62812f718538d83e3c39bcda927 | 04aaaea171736317bf20bc849b96069188d73a55 | refs/heads/master | 1,610,408,282,574 | 1,504,117,783,000 | 1,504,117,783,000 | 78,612,687 | 0 | 0 | null | 1,484,118,765,000 | 1,484,118,765,000 | null | UTF-8 | Lean | false | false | 366 | lean | import tools.super
open super tactic monad
example (a b : ℕ → Prop) (h : ∀x, (¬a x → b x) ∧ ¬b x ∧ ¬a x) := by do
c ← get_local `h >>= clause.of_classical_proof,
trace c,
cs ← get_clauses_classical [c],
trace cs,
c0 ← returnopt $ cs^.nth 0,
c1 ← returnopt $ cs^.nth 1,
c2 ← returnopt $ cs^.nth 2,
trace c0^.type,
tr... |
36993feb0696c2381093ae794e431c44f460e3eb | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/simpMatchDiscr.lean | 62f31a7d4d475b89194374c6a3152801654675fa | [
"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 | 1,367 | lean | inductive Vec (α : Type u) : Nat → Type u
| nil : Vec α 0
| cons : α → {n : Nat} → Vec α n → Vec α (n+1)
def Vec.repeat (a : α) (n : Nat) : Vec α n :=
match n with
| 0 => nil
| n+1 => cons a («repeat» a n)
instance [Inhabited α] : Inhabited (Vec α n) where
default := Vec.repeat default n
def Vec.map (... |
d5023c87345865f9d37ab89254c30d6fce6a4188 | 1a9d3677cccdaaccacb163507570e75d34043a38 | /src/week_2/Part_B_subgroups.lean | 16ce9b1484493e8bc810318588720acf57abab43 | [
"Apache-2.0"
] | permissive | alreadydone/formalising-mathematics | 687d386a72065795e784e270f5c05ea3948b67dd | 65869362cd7a2ac74dd1a97c7f9471835726570b | refs/heads/master | 1,680,260,936,332 | 1,616,563,371,000 | 1,616,563,371,000 | 348,780,769 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 18,579 | lean | /-
Change the below line to
import week_2.kb_solutions.Part_A_groups_solutions
(once the solutions are posted) if you want to get rid of the warning
-/
import week_2.Part_A_groups
/-!
## Subgroups
We define the structure `subgroup G`, whose terms are subgroups of `G`.
A subgroup of `G` is implemented as a subse... |
0a542ea5f6a3122cd8bd9052533d445dc7f69aeb | 8e381650eb2c1c5361be64ff97e47d956bf2ab9f | /src/Kenny/subsheaf.lean | a2cb1ddbd211c90b5bf40dbd0679348b44bc0c2b | [] | no_license | alreadydone/lean-scheme | 04c51ab08eca7ccf6c21344d45d202780fa667af | 52d7624f57415eea27ed4dfa916cd94189221a1c | refs/heads/master | 1,599,418,221,423 | 1,562,248,559,000 | 1,562,248,559,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,422 | lean | import Kenny.sheaf_on_opens
universes v u
open topological_space
variables {X : Type u} [topological_space X]
structure subpresheaf (F : presheaf.{u v} X) : Type (max u v) :=
(to_set : Π U : opens X, set (F U))
(res_mem_to_set : ∀ {U V : opens X} (HVU : V ⊆ U) {x : F U}, x ∈ to_set U → F.res U V HVU x ∈ to_set V)
... |
c4ef8afa45589d867704abe95005843324f7d825 | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/measure_theory/measure/hausdorff.lean | 1580ae1f63c8a84e9e29a723aa7383bce6371365 | [
"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 | 61,503 | 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 topology.metric_space.metric_separated
import measure_theory.constructions.borel_space
import measure_theory.measure.lebesgue
import analysis.special_functio... |
adbfeb46a0d413f367ec2c973135d55ccc988cc4 | 32025d5c2d6e33ad3b6dd8a3c91e1e838066a7f7 | /src/Lean/Meta/Match/CaseValues.lean | fd067d2fb1589f23e32fbb2d94fa31334fab6e64 | [
"Apache-2.0"
] | permissive | walterhu1015/lean4 | b2c71b688975177402758924eaa513475ed6ce72 | 2214d81e84646a905d0b20b032c89caf89c737ad | refs/heads/master | 1,671,342,096,906 | 1,599,695,985,000 | 1,599,695,985,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,549 | 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.Tactic.Subst
import Lean.Meta.Tactic.Clear
namespace Lean
namespace Meta
structure CaseValueSubgoal :=
(mvarId : MVarId)
(newH : FVarId... |
0315f144bb7f0de14b5f9cafcf5c859007d3b074 | e38e95b38a38a99ecfa1255822e78e4b26f65bb0 | /src/certigrad/tactics.lean | 023059211ecf21bb7e9b8e5523a4ab9c50edffd6 | [
"Apache-2.0"
] | permissive | ColaDrill/certigrad | fefb1be3670adccd3bed2f3faf57507f156fd501 | fe288251f623ac7152e5ce555f1cd9d3a20203c2 | refs/heads/master | 1,593,297,324,250 | 1,499,903,753,000 | 1,499,903,753,000 | 97,075,797 | 1 | 0 | null | 1,499,916,210,000 | 1,499,916,210,000 | null | UTF-8 | Lean | false | false | 4,683 | lean | /-
Copyright (c) 2017 Daniel Selsam. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Daniel Selsam
Miscellaneous tactics.
-/
import .util
namespace tactic
meta def simp_lemmas.append_simp : simp_lemmas → list name → tactic simp_lemmas
| sls [] := return sls
| sls... |
d94077315fc277ae4f61199e6059872367a033e0 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/algebra/group_power/order.lean | 58d0cbda3e30af9500cd06d8e7f8334c49128ebc | [
"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,891 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Robert Y. Lewis
-/
import algebra.order.ring
import algebra.group_power.ring
/-!
# Lemmas about the interaction of power operations with order
Note that some lemmas are... |
d4698c42f10d1c4def2e36ed0a2b146b866654bb | c31182a012eec69da0a1f6c05f42b0f0717d212d | /src/for_mathlib/SemiNormedGroup_Completion.lean | 4a120429adc8b82edeec2e9d240a0cb91eca3adf | [] | 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 | 5,902 | lean | import category_theory.currying
import category_theory.preadditive.additive_functor
import topology.category.Profinite
import topology.algebra.group_completion
import topology.metric_space.completion
import for_mathlib.normed_group_hom_completion
import locally_constant.SemiNormedGroup
/-
# Completions of normed gr... |
55444f5100e0cda8c7d604688f578bbf3b8e65e3 | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /library/data/sigma/decl.lean | 5abf408ddd329049757f410ecd6aa30f4057eaa3 | [
"Apache-2.0"
] | permissive | codyroux/lean | 7f8dff750722c5382bdd0a9a9275dc4bb2c58dd3 | 0cca265db19f7296531e339192e9b9bae4a31f8b | refs/heads/master | 1,610,909,964,159 | 1,407,084,399,000 | 1,416,857,075,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 636 | lean | -- Copyright (c) 2014 Microsoft Corporation. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Author: Leonardo de Moura, Jeremy Avigad, Floris van Doorn
import logic.eq logic.heq data.unit
structure sigma {A : Type} (B : A → Type) :=
dpair :: (dpr1 : A) (dpr2 : B dpr1)
no... |
08aed5343f5a5c194ec41247c66bf8204aa7069e | 35b83be3126daae10419b573c55e1fed009d3ae8 | /_target/deps/mathlib/algebra/ordered_group.lean | dec1c227c7f17390782cb67bde0faccd8b003bb2 | [] | no_license | AHassan1024/Lean_Playground | ccb25b72029d199c0d23d002db2d32a9f2689ebc | a00b004c3a2eb9e3e863c361aa2b115260472414 | refs/heads/master | 1,586,221,905,125 | 1,544,951,310,000 | 1,544,951,310,000 | 157,934,290 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 23,799 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Johannes Hölzl
Ordered monoids and groups.
-/
import algebra.group order.bounded_lattice tactic.basic
universe u
variable {α : Type u}
section old_structure_cmd
set... |
a5d8b6e3b20f411f8aa07e1655f05ebc4e93b20b | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /stage0/src/Lean/Meta/Match/Match.lean | 9768897ecb9d2df0692f3630d90a0239b3a47c03 | [
"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 | 41,026 | 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.CollectLevelParams
import Lean.Util.Recognizers
import Lean.Compiler.ExternAttr
import Lean.Meta.Check
import Lean.Meta.Closure
import Lean... |
6ed6cdbce4d2dd1ccf7d18439e15f29fb431137b | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/ring_theory/localization/fraction_ring.lean | f31ab35a512248b3c81c8e43612b3b2c56ec4aa5 | [
"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 | 12,142 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Mario Carneiro, Johan Commelin, Amelia Livingston, Anne Baanen
-/
import algebra.algebra.tower
import ring_theory.localization.basic
/-!
# Fraction ring / fraction field Frac(R)... |
fd0c2a1fa284029239022ce6df598e86de0c15d6 | 1abd1ed12aa68b375cdef28959f39531c6e95b84 | /src/data/multiset/basic.lean | 812553d8e4d9cb5cb9fff8b626a87d366a7f1990 | [
"Apache-2.0"
] | permissive | jumpy4/mathlib | d3829e75173012833e9f15ac16e481e17596de0f | af36f1a35f279f0e5b3c2a77647c6bf2cfd51a13 | refs/heads/master | 1,693,508,842,818 | 1,636,203,271,000 | 1,636,203,271,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 105,506 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.list.perm
import data.list.prod_monoid
/-!
# Multisets
These are implemented as the quotient of a list by permutations.
## Notation
We define the ... |
8d6463d278f91bec14697a10166491696630b1bc | ea4aee6b11f86433e69bb5e50d0259e056d0ae61 | /src/tidy/smt.lean | 22e4d202115f80674ae1b0ff653f09c7f1f711fe | [] | no_license | timjb/lean-tidy | e18feff0b7f0aad08c614fb4d34aaf527bf21e20 | e767e259bf76c69edfd4ab8af1b76e6f1ed67f48 | refs/heads/master | 1,624,861,693,182 | 1,504,411,006,000 | 1,504,411,006,000 | 103,740,824 | 0 | 0 | null | 1,505,553,968,000 | 1,505,553,968,000 | null | UTF-8 | Lean | false | false | 674 | lean | -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Scott Morrison
open tactic
open smt_tactic
open lean.parser
open interactive
-- TODO raise an issue about note and pose remaining in smt_tactic
meta def unfold_coe : tactic un... |
cb0c438f59d5be3f7b74a87d106ca60f408caae8 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/order/complete_boolean_algebra.lean | bc8a554475b167245a38cb87bdb22194fbb5e1b4 | [
"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 | 14,283 | 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, Yaël Dillies
-/
import order.complete_lattice
import order.directed
/-!
# Frames, completely distributive lattices and Boolean algebras
In this file we define and pro... |
1faea46177cb267ab6b9a649a24c065be657b4d8 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/topology/algebra/group.lean | 6a2106ea697311c5151869f6ceec1fba083823d5 | [
"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 | 44,225 | 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.quotient_group
import order.filter.pointwise
import topology.algebra.monoid
import topology.homeomorph
import topo... |
ff281186508dbb96f4c5573eaab4a4578318737a | c3de33d4701e6113627153fe1103b255e752ed7d | /logic/basic.lean | 26552b7ed991631eaa64d7f49e06bb12a3812eb5 | [] | no_license | jroesch/library_dev | 77d2b246ff47ab05d55cb9706a37d3de97038388 | 4faa0a45c6aa7eee6e661113c2072b8840bff79b | refs/heads/master | 1,611,281,606,352 | 1,495,661,644,000 | 1,495,661,644,000 | 92,340,430 | 0 | 0 | null | 1,495,663,344,000 | 1,495,663,344,000 | null | UTF-8 | Lean | false | false | 17,367 | 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
Theorems that require decidability hypotheses are in the namespace "decidable".
Classical versions are in the namespace "classical".
Note: in the pres... |
27912991d1e0cfcf88054f0a1f2a6683b39e10bc | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/category_theory/filtered.lean | 736aac534e7695571d781621689a1a0d2bb7ad10 | [
"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 | 26,504 | lean | /-
Copyright (c) 2019 Reid Barton. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Reid Barton, Scott Morrison
-/
import category_theory.fin_category
import category_theory.limits.cones
import category_theory.adjunction.basic
import category_theory.category.preorder
imp... |
afdcf208c46bd52089c9f71bafc01169528a577d | 682dc1c167e5900ba3168b89700ae1cf501cfa29 | /src/del/languageDEL.lean | e2df92c3d917deee3903b84a220d9ccc959fe9af | [] | no_license | paulaneeley/modal | 834558c87f55cdd6d8a29bb46c12f4d1de3239bc | ee5d149d4ecb337005b850bddf4453e56a5daf04 | refs/heads/master | 1,675,911,819,093 | 1,609,785,144,000 | 1,609,785,144,000 | 270,388,715 | 13 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 2,128 | lean | /-
Copyright (c) 2021 Paula Neeley. All rights reserved.
Author: Paula Neeley
Following the textbook "Dynamic Epistemic Logic" by
Hans van Ditmarsch, Wiebe van der Hoek, and Barteld Kooi
-/
-- Def 2.1, pg 12
inductive form (agents : Type) : Type
| bot : form
| var (n : nat) : form
| and (φ ... |
9d5927a06ce3af1dbb8f71de5d700fa723cc6749 | 43390109ab88557e6090f3245c47479c123ee500 | /src/M1F/problem_bank/0301/S0301.lean | dac3fc59a0454cb653646983260505c0dfa2cec9 | [
"Apache-2.0"
] | permissive | Ja1941/xena-UROP-2018 | 41f0956519f94d56b8bf6834a8d39473f4923200 | b111fb87f343cf79eca3b886f99ee15c1dd9884b | refs/heads/master | 1,662,355,955,139 | 1,590,577,325,000 | 1,590,577,325,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 16,973 | lean | import xenalib.M1Fstuff algebra.group_power xenalib.square_root xenalib.complex
local infix ` ^ ` := monoid.pow
-- Need to start off with some fake reals to do Q1,2
constant fake_reals : Type
@[instance] constant fake_reals_comm_ring : comm_ring fake_reals
@[instance] constant fake_reals_have_lt : has_lt fake_reals... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.