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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
c3623304de04f937b6a98b219e26edab84fe2c79 | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch5/ex0205.lean | bcca5e1a8e17842b50bc47d8a7e5e4e1bdd8ffdb | [] | no_license | Ailrun/Theorem_Proving_in_Lean | ae6a23f3c54d62d401314d6a771e8ff8b4132db2 | 2eb1b5caf93c6a5a555c79e9097cf2ba5a66cf68 | refs/heads/master | 1,609,838,270,467 | 1,586,846,743,000 | 1,586,846,743,000 | 240,967,761 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 176 | lean | variables x y z w : ℕ
example (h₁ : x = y) (h₂ : y = z) (h₃ : z = w) : x = w :=
begin
apply eq.trans,
assumption,
apply eq.trans,
assumption,
assumption
end
|
d0084cd88d03a421049ade7001d45453b3310919 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/analysis/box_integral/divergence_theorem.lean | ea65ee8a4ed601061c210e881f489381343ad41d | [
"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 | 16,443 | 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 analysis.box_integral.basic
import analysis.box_integral.partition.additive
import analysis.calculus.fderiv.basic
/-!
# Divergence integral for Henstock-Kur... |
d32c9ccc8a18d09701a408741919c9052958cb4c | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/topology/extend_from.lean | 5fa21fb42a4d0b0a14095692b5a59a95874835b3 | [
"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,128 | lean | /-
Copyright (c) 2020 Anatole Dedecker. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Anatole Dedecker
-/
import topology.separation
/-!
# Extending a function from a subset
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file requir... |
f9825aac3b728bb0384de2ec8140a37dd182f65f | 1a61aba1b67cddccce19532a9596efe44be4285f | /library/data/rat/order.lean | 5dedf223a7e333e02088f7bbce79004539829079 | [
"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 | 14,179 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad
Adds the ordering, and instantiates the rationals as an ordered field.
-/
import data.int algebra.ordered_field .basic
open quot eq.ops
/- the ordering on representation... |
3de0499ebf77b15f79c495cb578063bae97e2078 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/topology/algebra/valued_field.lean | 9bf06e431ca653c28093a407e1eeb0b0ee250dbc | [
"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 | 14,617 | lean | /-
Copyright (c) 2021 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot
-/
import topology.algebra.valuation
import topology.algebra.with_zero_topology
import topology.algebra.uniform_field
/-!
# Valued fields and their completions
In thi... |
64b561cf7cc09edb64042d50e00d7adac83fd8f7 | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/number_theory/sum_four_squares.lean | 4afaf3b0b2606dce1c58d8a189fb30e4abefd117 | [
"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 | 11,925 | 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 algebra.group_power.identities
import data.zmod.basic
import field_theory.finite.basic
import data.int.parity
import data.fintype.card
/-!
# Lagrange's four squa... |
a5af56844e273ee3ca2460bacf97577dd3db0e22 | f2fbd9ce3f46053c664b74a5294d7d2f584e72d3 | /src/for_mathlib/complete_groups.lean | 9aeedd5fab858d81d79da0f1c52e303ebb23dd29 | [
"Apache-2.0"
] | permissive | jcommelin/lean-perfectoid-spaces | c656ae26a2338ee7a0072dab63baf577f079ca12 | d5ed816bcc116fd4cde5ce9aaf03905d00ee391c | refs/heads/master | 1,584,610,432,107 | 1,538,491,594,000 | 1,538,491,594,000 | 136,299,168 | 0 | 0 | null | 1,528,274,452,000 | 1,528,274,452,000 | null | UTF-8 | Lean | false | false | 9,285 | lean | import for_mathlib.group_completion
namespace add_comm_group
variables {α : Type*} {β : Type*} {γ : Type*} [add_comm_group α] [add_comm_group β] [add_comm_group γ]
class is_Z_bilin (f : α × β → γ) : Prop :=
(add_left : ∀ a a' b, f (a + a', b) = f (a, b) + f (a', b))
(add_right : ∀ a b b', f (a, b + b') = f (a, b) ... |
7306a8cd01cd696b2bdd039c9c82ae0c22993bcd | 680b0d1592ce164979dab866b232f6fa743f2cc8 | /library/data/fintype/card.lean | a4a9555a71da59fb6852248b3129aad9bf35db47 | [
"Apache-2.0"
] | permissive | syohex/lean | 657428ab520f8277fc18cf04bea2ad200dbae782 | 081ad1212b686780f3ff8a6d0e5f8a1d29a7d8bc | refs/heads/master | 1,611,274,838,635 | 1,452,668,188,000 | 1,452,668,188,000 | 49,562,028 | 0 | 0 | null | 1,452,675,604,000 | 1,452,675,602,000 | null | UTF-8 | Lean | false | false | 2,018 | lean | /-
Copyright (c) 2015 Haitao Zhang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Haitao Zhang
Cardinality for finite types.
-/
import .basic data.list data.finset.card
open eq.ops nat function list finset
namespace fintype
definition card [reducible] (A : Type) [fi... |
1df64597b14ec7275981cc0bdcef5fe24c94699b | 82b86ba2ae0d5aed0f01f49c46db5afec0eb2bd7 | /stage0/src/Lean/Util.lean | 24177c3f0f338d2cbba6fd48c4d4688ee4e83c16 | [
"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 | 674 | 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.Util.CollectLevelParams
import Lean.Util.CollectMVars
import Lean.Util.FindMVar
import Lean.Util.MonadCache
import... |
0a125f40ad9f335e8cd4d9e953feddf1c7aa1966 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/lean/interactive/hover.lean | cc42cc1db88669c7af26c40bc1e366ad71c029a4 | [
"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,969 | lean | import Lean
example : True := by
apply True.intro
--^ textDocument/hover
example : True := by
simp [True.intro]
--^ textDocument/hover
example (n : Nat) : True := by
match n with
| Nat.zero => _
--^ textDocument/hover
| n + 1 => _
/-- My tactic -/
macro "mytac" o:"only"? e:term : tactic => ... |
733861165d1c95deef55f8f04348ef99c8ce21a1 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/order/zorn.lean | ee9041cf52c619c982ff79b7297074c9f8f85887 | [] | 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 | 7,161 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
Zorn's lemmas.
Ported from Isabelle/HOL (written by Jacques D. Fleuriot, Tobias Nipkow, and Christian Sternagel).
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.ini... |
d13483b28b21166a4f83352cb0ef24e2644ce2a6 | 47c6e122a73eb61594f0426d74d9c1897ac5668e | /src/test.lean | 7fcd09635184a5f823be2b0c81bfda651b149c10 | [] | 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,235 | lean | import data.nat.prime
import number_theory.padics.padic_norm
import data.pnat.factors
-- ERIC'S CODE
@[simp]
lemma prime_multiset.coe_add (m n : prime_multiset) : ↑(m + n) = (m + n : multiset ℕ) :=
is_add_monoid_hom.map_add _ _ _
attribute [simp] pnat.coe_nat_factor_multiset
lemma factors_mul {p q : ℕ} (hp : 0 < p) ... |
699fafffdc387a4020108bb2c59f28ce77e97527 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebra/polynomial/big_operators.lean | 9f48a03f1f5af5d7e6b9692542263f5870543549 | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 13,231 | 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 algebra.order.with_zero
import data.polynomial.monic
/-!
# Lemmas for the interaction between polynomials and `∑` and `∏`.
Recall that `∑` and `∏... |
fb9ac8a3612dc5af5fee06d5bd24dad1579bb0fb | c777c32c8e484e195053731103c5e52af26a25d1 | /src/analysis/calculus/fderiv_analytic.lean | bddec64dbb2bc7eda5cbdd39605d791a5e15d378 | [
"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,198 | 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 analysis.analytic.basic
import analysis.calculus.deriv
import analysis.calculus.cont_diff_def
/-!
# Frechet derivatives of analytic functions.
A function e... |
2ee4b6c897ad86a01e5c34cf5408cbfc55cbc862 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/topology/metric_space/completion.lean | 1c3af9bda6bd8ef57c1120bec912c45a14c8e615 | [
"Apache-2.0"
] | permissive | dupuisf/mathlib | 62de4ec6544bf3b79086afd27b6529acfaf2c1bb | 8582b06b0a5d06c33ee07d0bdf7c646cae22cf36 | refs/heads/master | 1,669,494,854,016 | 1,595,692,409,000 | 1,595,692,409,000 | 272,046,630 | 0 | 0 | Apache-2.0 | 1,592,066,143,000 | 1,592,066,142,000 | null | UTF-8 | Lean | false | false | 8,683 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Sébastien Gouëzel
-/
import topology.uniform_space.completion
import topology.metric_space.isometry
/-!
# The completion of a metric space
Completion of uniform spaces are already ... |
85effe81833aad160988bcf839f99dc91231e09a | 9631e35ca5dd719ccc7d3a57ec322fd93d6a0776 | /src/gcd_maze/definition.lean | 430333451f336c4138f4997a3d68ad0811292b06 | [] | no_license | kbuzzard/maze-game | 123fa47e0262edb6d147178d239a345d847ff147 | 362ab394ae5218c43b24232aaeef08efc0067eab | refs/heads/master | 1,670,131,466,823 | 1,598,546,702,000 | 1,598,546,702,000 | 290,744,081 | 5 | 1 | null | 1,598,546,703,000 | 1,598,523,538,000 | Lean | UTF-8 | Lean | false | false | 1,564 | lean | import tactic
-- start in room 0
-- need to find our way to room gcd(a,b)
/-- Solver docs : Terms of type `maze` are rooms in the game. -/
@[derive has_reflect]
inductive direction : Type
| north | east | south | west
namespace maze
/-
ABC
DEF
GHI
-/
section parameter_a_b
parameters (a b : ℕ)
@[reducible] defi... |
0cf2b1b515b873eec4dcb27159a34bfe299acb0b | cbcb0199842f03e7606d4e43666573fc15dd07a5 | /src/topology/metric_space/completion.lean | a6cfd04fae82925991b829df21fd15d6e90a6226 | [
"Apache-2.0"
] | permissive | truonghoangle/mathlib | a6a7c14b3767ec71156239d8ea97f6921fe79627 | 673bae584febcd830c2c9256eb7e7a81e27ed303 | refs/heads/master | 1,590,347,998,944 | 1,559,728,860,000 | 1,559,728,860,000 | 187,431,971 | 0 | 0 | null | 1,558,238,525,000 | 1,558,238,525,000 | null | UTF-8 | Lean | false | false | 8,740 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Sébastien Gouëzel
The completion of a metric space.
Completion of uniform spaces are already defined in `topology.uniform_space.completion`. We show
here that the uniform space com... |
fe1a0dc298e4dc50028c429c3ebc3b674470af71 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/category_theory/abelian/basic.lean | 053e568b728595408a0917ce00a8571f9691818a | [
"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,039 | lean | /-
Copyright (c) 2020 Markus Himmel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel, Johan Commelin, Scott Morrison
-/
import category_theory.limits.constructions.pullbacks
import category_theory.limits.shapes.biproducts
import category_theory.limits.sha... |
9e0953d361cb42553c231aeca5c47479147fcdef | e0f9ba56b7fedc16ef8697f6caeef5898b435143 | /src/data/mv_polynomial.lean | 38b4f83b81f449ee38f3d91ddb8b0ca5af8dc13e | [
"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 | 58,301 | 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, Shing Tak Lam
-/
import data.polynomial
import data.equiv.ring
import data.equiv.fin
import tactic.omega
/-!
# Multivariate polynomials... |
2a8a8430e0e49e620a3d9d241c7eeb0b1780c51b | ae1e94c332e17c7dc7051ce976d5a9eebe7ab8a5 | /stage0/src/Init/Control/StateRef.lean | 09eab326c5c8b416781c62f74a18a7074ea985f7 | [
"Apache-2.0"
] | permissive | dupuisf/lean4 | d082d13b01243e1de29ae680eefb476961221eef | 6a39c65bd28eb0e28c3870188f348c8914502718 | refs/heads/master | 1,676,948,755,391 | 1,610,665,114,000 | 1,610,665,114,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,413 | 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
The State monad transformer using IO references.
-/
prelude
import Init.System.IO
import Init.Control.State
def StateRefT' (ω : Type) (σ :... |
191e079a7330fb3b90fb780cc8d68140aedb2bc1 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/algebra/order/monoid/lemmas.lean | 2f2ca1f8b5c177c2a3d3ec15dc58ae46a2f7627b | [
"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 | 48,190 | 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, Damiano Testa,
Yuyang Zhao
-/
import algebra.covariant_and_contravariant
import order.min_max
/-!
# Ordered monoids
>... |
7f193a7e033ca4df1cd4555abfce656ed5413451 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /src/Init/Lean/Meta/SynthInstance.lean | dd2cda5b5ff8393d9500ca6e945c3ee327c88e3a | [
"Apache-2.0"
] | permissive | mhuisi/lean4 | 28d35a4febc2e251c7f05492e13f3b05d6f9b7af | dda44bc47f3e5d024508060dac2bcb59fd12e4c0 | refs/heads/master | 1,621,225,489,283 | 1,585,142,689,000 | 1,585,142,689,000 | 250,590,438 | 0 | 2 | Apache-2.0 | 1,602,443,220,000 | 1,585,327,814,000 | C | UTF-8 | Lean | false | false | 24,717 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Daniel Selsam, Leonardo de Moura
Type class instance synthesizer using tabled resolution.
-/
import Init.Lean.Meta.Basic
import Init.Lean.Meta.Instances
import Init.Lean.Meta.L... |
ed69ba68ce874594728bb8c20334fd4b00ad36b9 | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /src/Lean/Elab/Extra.lean | 409997436c0b6387f058fd75b5c8a8e0faa3c2aa | [
"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 | 3,727 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Elab.App
/-
Auxiliary elaboration functions: AKA custom elaborators
-/
namespace Lean.Elab.Term
open Meta
@[builtinTermElab binrel] def elabB... |
12f09f70f3a5ab59628ec6e1a675bef10adc20a0 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/run/unicode.lean | 637479edff865fd925a25953266a923677f8cb52 | [
"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 | 127 | lean | constant N : Type
constant α : N
constant β₁ : N
check β₁
constant δ : N
check δ
constant δ₁₁ : N
check δ₁₁
|
2ddc0228689d4cff1175175025b98e2ff86166e1 | 3268ab3a126f0fef71459fbf170dc38efe5d0506 | /algebra/exact_couple.hlean | 2cfdfadd75f16b2ee7c54a1c4b1e976845035ea4 | [
"Apache-2.0"
] | permissive | soraismus/Spectral | f043fed1a4e02ddfeba531769b2980eb817471f4 | 32512bf47db3a1b932856e7ed7c7830b1fc07ef0 | refs/heads/master | 1,585,628,705,579 | 1,538,609,948,000 | 1,538,609,974,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 36,684 | hlean | /- Exact couples of graded (left-) R-modules. This file includes:
- Constructing exact couples from sequences of maps
- Deriving an exact couple
- The convergence theorem for exact couples -/
-- Author: Floris van Doorn
import .graded ..spectrum.basic .product_group .ring
open algebra is_trunc left_module is_e... |
4cadca640915f28f1318f5f9a35892c712cc0a07 | 2c41ae31b2b771ad5646ad880201393f5269a7f0 | /Lean/Qualities/MissionEffective.lean | 4fedfd52218ad6653681dff3dd5368fa2e1f746b | [] | no_license | kevinsullivan/Boehm | 926f25bc6f1a8b6bd47d333d936fdfc278228312 | 55208395bff20d48a598b7fa33a4d55a2447a9cf | refs/heads/master | 1,586,127,134,302 | 1,488,252,326,000 | 1,488,252,326,000 | 32,836,930 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,176 | lean | import SystemModel.System
import Qualities.PhysicalCapable
import Qualities.CyberCapable
import Qualities.HumanUsable
import Qualities.Speed
import Qualities.Endurable
import Qualities.Maneuverable
import Qualities.Accurate
import Qualities.Impactful
import Qualities.Scalable
import Qualities.Versatile
impor... |
300c28103d9824dc54072da4b44d0ae23bb30641 | ed27983dd289b3bcad416f0b1927105d6ef19db8 | /src/inClassNotes/higherOrderFunctions/higherOrderFunctions-example.lean | ca25d6c326f52748ad91f308a006530cd7550e98 | [] | no_license | liuxin-James/complogic-s21 | 0d55b76dbe25024473d31d98b5b83655c365f811 | 13e03e0114626643b44015c654151fb651603486 | refs/heads/master | 1,681,109,264,463 | 1,618,848,261,000 | 1,618,848,261,000 | 337,599,491 | 0 | 0 | null | 1,613,141,619,000 | 1,612,925,555,000 | null | UTF-8 | Lean | false | false | 601 | lean | def func (n : nat) : (nat → nat) :=
λ m, m + n
def foo (n : nat) : (nat → (string → bool)) :=
fun (m : nat),
fun (s : string),
tt
#check foo 1 2
#check foo
def x := func 3
#check func
-- func 3
-- λ (m : ℕ), 3 + m
-- x := λ (m : ℕ), 3 + m
#eval x 6
-- 3 + m
-- 3 + 6
-- 9
/-
def func (3 : nat) : (nat... |
8c972352e1ca5bb374a538d7bc8574cb22d3912c | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/category_theory/adjunction/fully_faithful.lean | 42b9367fb29c4b350a245eda0d711cce1f0769c7 | [
"Apache-2.0"
] | permissive | rmitta/mathlib | 8d90aee30b4db2b013e01f62c33f297d7e64a43d | 883d974b608845bad30ae19e27e33c285200bf84 | refs/heads/master | 1,585,776,832,544 | 1,576,874,096,000 | 1,576,874,096,000 | 153,663,165 | 0 | 2 | Apache-2.0 | 1,544,806,490,000 | 1,539,884,365,000 | Lean | UTF-8 | Lean | false | false | 2,286 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.adjunction.basic
import category_theory.yoneda
open category_theory
namespace category_theory
universes v₁ v₂ u₁ u₂
open category
open oppos... |
57630d4d2f5e1dae3072f6d955f0c5cd9c541cd1 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/linear_algebra/matrix.lean | d240e409faf79aaaf9dc4fd7b7bb0741d82ad458 | [
"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 | 35,535 | lean | /-
Copyright (c) 2019 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Johannes Hölzl, Patrick Massot, Casper Putz
-/
import linear_algebra.finite_dimensional
import linear_algebra.nonsingular_inverse
import linear_algebra.multilinear
import linear_algebra... |
f441a79677ada0413f5fb35d40828a79dc8761d4 | 9028d228ac200bbefe3a711342514dd4e4458bff | /src/order/lexicographic.lean | 1bcd573a9b3baf4d4ed4721a06abc99a7a13ef5a | [
"Apache-2.0"
] | permissive | mcncm/mathlib | 8d25099344d9d2bee62822cb9ed43aa3e09fa05e | fde3d78cadeec5ef827b16ae55664ef115e66f57 | refs/heads/master | 1,672,743,316,277 | 1,602,618,514,000 | 1,602,618,514,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,668 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Scott Morrison, Minchao Wu
Lexicographic preorder / partial_order / linear_order / decidable_linear_order,
for pairs and dependent pairs.
-/
import tactic.basic
universes u v
/-- The... |
469dbdf1a9981ec46167c8ed27e54126f4dbdf26 | ac49064e8a9a038e07cf5574b4fccd8a70d115c8 | /hott/types/int/hott.hlean | 90d4f691f89094f7ad206842abcb2a20b8d4998f | [
"Apache-2.0"
] | permissive | Bolt64/lean2 | 7c75016729569e04a3f403c7a4fc7c1de4377c9d | 75fd8162488214a959dbe3303a185cbbb83f60f9 | refs/heads/master | 1,611,290,445,156 | 1,493,763,922,000 | 1,493,763,922,000 | 81,566,307 | 0 | 0 | null | 1,486,732,167,000 | 1,486,732,167,000 | null | UTF-8 | Lean | false | false | 6,281 | 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 integers specific to HoTT
-/
import .basic types.eq arity algebra.bundled
open core eq is_equiv equiv algebra is_trunc
open nat (hiding pred)
na... |
86d24f7c607d4f7123d206185a17d62c1247254e | 76df16d6c3760cb415f1294caee997cc4736e09b | /lean/src/sym_factory/sym_factory.lean | b710f03ca13a28dab2c430c355ce44428e9def92 | [
"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 | 7,022 | lean | import ..tactic.all
import ..cs.lang
import ..cs.sym
import ..cs.conc
import ..op.sym
import ..cs.util
import .defs
import ..cs.lib
import ..op.simp
import ..basic.basic
import ..basic.sym
import ..op.basic
import .basic
import .opS
namespace sym_factory
open sym
open op.sym
open op.lang.op
lemma cast_choices.sound.... |
d763adcb3991ad47eae2b17feef313a93c70e436 | 690889011852559ee5ac4dfea77092de8c832e7e | /src/category_theory/products/basic.lean | 36b7fa75e9a4aefb4b903081fb9e32f646c7e395 | [
"Apache-2.0"
] | permissive | williamdemeo/mathlib | f6df180148f8acc91de9ba5e558976ab40a872c7 | 1fa03c29f9f273203bbffb79d10d31f696b3d317 | refs/heads/master | 1,584,785,260,929 | 1,572,195,914,000 | 1,572,195,913,000 | 138,435,193 | 0 | 0 | Apache-2.0 | 1,529,789,739,000 | 1,529,789,739,000 | null | UTF-8 | Lean | false | false | 6,934 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Stephen Morgan, Scott Morrison
-/
import category_theory.equivalence
import category_theory.eq_to_hom
import tactic.interactive
namespace category_theory
universes v₁ v₂ v₃ v₄ u₁ u₂ ... |
4cb17f0f1002da6be24e821acf18a1523e2434d0 | 92b50235facfbc08dfe7f334827d47281471333b | /hott/types/int/basic.hlean | 2e7f123c8fa2974d8b98569f2ca2c4fb2e680ae4 | [
"Apache-2.0"
] | permissive | htzh/lean | 24f6ed7510ab637379ec31af406d12584d31792c | d70c79f4e30aafecdfc4a60b5d3512199200ab6e | refs/heads/master | 1,607,677,731,270 | 1,437,089,952,000 | 1,437,089,952,000 | 37,078,816 | 0 | 0 | null | 1,433,780,956,000 | 1,433,780,955,000 | null | UTF-8 | Lean | false | false | 37,412 | hlean | /-
Copyright (c) 2014 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Jeremy Avigad
The integers, with addition, multiplication, and subtraction. The representation of the integers is
chosen to compute efficiently.
To faciliate prov... |
b98789c3bf3962c3725303eeaa6ba1c8010be1a1 | 59e5eb5b0b465111c363c967363a954891f7de2e | /Leancode/fptp/src/ElGamal.lean | e6e87c179f3080ae378b1a5cfd8eb88fe9b9e141 | [
"Apache-2.0"
] | permissive | mukeshtiwari/formal-fptp | 1987fb35e5594ea047b1b2f7e36a804dece6272f | 883a6a245cfdce7af0fc3cc2c3769281fe60afa0 | refs/heads/master | 1,650,002,177,929 | 1,585,742,596,000 | 1,585,742,596,000 | 249,091,342 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,811 | lean | import data.zmod.basic data.nat.prime
data.zmod.quadratic_reciprocity
tactic.find tactic.omega data.vector
list_lemma
namespace ElGamal
/-
A Schnorr group is a large prime-order subgroup of ℤ∗𝑝,
the multiplicative group of integers modulo 𝑝.
To generate such a group, we find 𝑝=𝑞𝑟+1 such that 𝑝 and 𝑞
... |
9e1566cd6e113f731151064365dac9c879cced5e | 592ee40978ac7604005a4e0d35bbc4b467389241 | /Library/generated/mathscheme-lean/Semiring.lean | aa350ecfc56188b81d7a3ec63ecec55574ca3eec | [] | 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 | 12,570 | 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 Semiring
structure Semiring (A : Type) : Type :=
(zero : A)
(plus : (A → (A → A)))
(times : (A → (A → A)))
(associative_times : (∀ {x y z : A} , (... |
7209def54abe2828447a028c6a009458ce790ffb | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/algebra/big_operators/nat_antidiagonal.lean | 4abb48d4be2229dce53b821926adacaab2572df9 | [
"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 | 958 | lean | /-
Copyright (c) 2020 Aaron Anderson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson
-/
import data.finset.nat_antidiagonal
import algebra.big_operators.basic
/-!
# Big operators for `nat_antidiagonal`
This file contains theorems relevant to big opera... |
00822c5094877d9f0ee038a1f03b332bb3a664f2 | 64874bd1010548c7f5a6e3e8902efa63baaff785 | /library/algebra/order.lean | 788fb8cf0b0823ed2815044bbcbf536e021eda0a | [
"Apache-2.0"
] | permissive | tjiaqi/lean | 4634d729795c164664d10d093f3545287c76628f | d0ce4cf62f4246b0600c07e074d86e51f2195e30 | refs/heads/master | 1,622,323,796,480 | 1,422,643,069,000 | 1,422,643,069,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 13,869 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: algebra.order
Author: Jeremy Avigad
Various types of orders. We develop weak orders "≤" and strict orders "<" separately. We also
consider structures with both, where the two are relat... |
058747be5548083b932d8d013c5acb113ef8337c | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/topology/sheaves/sheaf_condition/sites.lean | 7cb8f2bfb00d0bd98c25a1a1c66f1add0e111b7a | [
"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 | 22,057 | lean | /-
Copyright (c) 2021 Justus Springer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Justus Springer
-/
import category_theory.sites.spaces
import topology.sheaves.sheaf
import category_theory.sites.dense_subsite
/-!
# The sheaf condition in terms of sites.
The th... |
a99cfec8fcb050d50b33de3ab22d73094be63429 | 36938939954e91f23dec66a02728db08a7acfcf9 | /lean/runelf.lean | 9c08ea6c4a32089a9a2f36b68c092a06124a2d28 | [
"Apache-2.0"
] | permissive | pnwamk/reopt-vcg | f8b56dd0279392a5e1c6aee721be8138e6b558d3 | c9f9f185fbefc25c36c4b506bbc85fd1a03c3b6d | refs/heads/master | 1,631,145,017,772 | 1,593,549,019,000 | 1,593,549,143,000 | 254,191,418 | 0 | 0 | null | 1,586,377,077,000 | 1,586,377,077,000 | null | UTF-8 | Lean | false | false | 5,712 | lean | /- This file ties together the evaluator, elf support, and the decoder -/
import system.io
import x86_semantics.machine_memory
import .elf
import .translate
import decodex86
open x86
def get_filename_arg : io (string × string) := do
args ← io.cmdline_args,
match args with
| [decoder, name ] := do
return... |
0e6f85c201c6fae35703d76665a4cc78d0e5ecc3 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/lake/examples/hello/lakefile.lean | 6248d47afbdcabdf7de63ab445daa873f48e59e7 | [
"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 | 111 | lean | import Lake
open Lake DSL
package hello
lean_lib Hello
@[default_target]
lean_exe hello {
root := `Main
}
|
a7bc587c79be2636e4685f5ad7e9cd2a20bc92c2 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/order/filter/at_top_bot.lean | 086cf2580565ce9aa6343a948f469f4ee44d1431 | [
"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 | 80,942 | 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 algebra.order.field.basic
import data.finset.preimage
import data.set.intervals.disjoint
import data.set.interv... |
158e51bfff49edc43d3da90f1424e08fe4a1387d | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/analysis/special_functions/pow.lean | 448127aefa8fa328ee830a85bfe63eccae315e68 | [
"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 | 92,757 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Abhimanyu Pallavi Sudhir, Jean Lo, Calle Sönne, Sébastien Gouëzel,
Rémy Degenne, David Loeffler
-/
import analysis.special_functions.complex.log
/-!
# Power function on ... |
05486d2f446b5d789e369a8ae340047f79d4fc92 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/control/monad/cont.lean | b5767c8228f7906c88859827b2d19e7ce298745d | [
"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,399 | lean | /-
Copyright (c) 2019 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
Monad encapsulating continuation passing programming style, similar to
Haskell's `Cont`, `ContT` and `MonadCont`:
<http://hackage.haskell.org/package/mtl-2.2.2/docs/Control-M... |
b6b42201948fff9ab10a89c6f0378759bd01f69e | 64874bd1010548c7f5a6e3e8902efa63baaff785 | /library/init/measurable.lean | 93e5079ae4e4cd34f0cd2ce31f360b09fc21ef2a | [
"Apache-2.0"
] | permissive | tjiaqi/lean | 4634d729795c164664d10d093f3545287c76628f | d0ce4cf62f4246b0600c07e074d86e51f2195e30 | refs/heads/master | 1,622,323,796,480 | 1,422,643,069,000 | 1,422,643,069,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,443 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: init.measurable
Authors: Leonardo de Moura
Types with a nat-valued complexity measure.
-/
prelude
import init.nat
open nat
inductive measurable [class] (A : Type) :=
mk : (A →... |
749d49bb3f9e87910071f411307aea32df13a737 | aa2345b30d710f7e75f13157a35845ee6d48c017 | /category_theory/products.lean | 162dd3f08ba9dd3de224803c52a046f046ba7aee | [
"Apache-2.0"
] | permissive | CohenCyril/mathlib | 5241b20a3fd0ac0133e48e618a5fb7761ca7dcbe | a12d5a192f5923016752f638d19fc1a51610f163 | refs/heads/master | 1,586,031,957,957 | 1,541,432,824,000 | 1,541,432,824,000 | 156,246,337 | 0 | 0 | Apache-2.0 | 1,541,434,514,000 | 1,541,434,513,000 | null | UTF-8 | Lean | false | false | 4,909 | lean | -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Stephen Morgan, Scott Morrison
import category_theory.functor_category
import category_theory.isomorphism
import tactic.interactive
namespace category_theory
universes u₁ v₁ u... |
dde01a44d1f77a06bd5e1f4ea2b8df8bebb045b7 | bb31430994044506fa42fd667e2d556327e18dfe | /src/number_theory/well_approximable.lean | 621d66baf8be11ebcaa34b5ed07de8672e8a5bae | [
"Apache-2.0"
] | permissive | sgouezel/mathlib | 0cb4e5335a2ba189fa7af96d83a377f83270e503 | 00638177efd1b2534fc5269363ebf42a7871df9a | refs/heads/master | 1,674,527,483,042 | 1,673,665,568,000 | 1,673,665,568,000 | 119,598,202 | 0 | 0 | null | 1,517,348,647,000 | 1,517,348,646,000 | null | UTF-8 | Lean | false | false | 16,750 | lean | /-
Copyright (c) 2022 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import dynamics.ergodic.add_circle
import measure_theory.covering.liminf_limsup
import data.nat.totient
/-!
# Well-approximable numbers and Gallagher's ergodic theorem
Ga... |
3599b7dd6b51a65c09f330081cbae68209edfc41 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/combinatorics/simple_graph/coloring.lean | d6544452730adce7dd617e046e433da1219c0814 | [
"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 | 15,575 | lean | /-
Copyright (c) 2021 Arthur Paulino. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Arthur Paulino, Kyle Miller
-/
import combinatorics.simple_graph.subgraph
import combinatorics.simple_graph.clique
import data.nat.lattice
import data.setoid.partition
import order.an... |
e5c584328ec6ab15e6c5de813595c3734933b11c | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/rw_set4.lean | 274962455f741bd1592607fb5589deb8ddc3876b | [
"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 | 423 | lean | open tactic
attribute [congr, priority std.priority.default+1]
theorem forall_congr_prop_eq {P₁ P₂ Q₁ Q₂ : Prop} :
P₁ = P₂ → (P₂ → Q₁ = Q₂) → (P₁ → Q₁) = (P₂ → Q₂) :=
sorry
#print [congr] default
example (A : Type) (a b c : A) : (a = b) → (a = c) → a = b := by simp {contextual := tt}
example (A : Type) (a b c : A)... |
e0813f1bb76b0ce4cee197efb4c5cb41b39ecbcb | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/logic/relation.lean | 995a7ec1905616805d9917036c6a85e0f2b45d56 | [
"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 | 18,313 | lean | /-
Copyright (c) 2018 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
-/
import tactic.basic
/-!
# Relation closures
This file defines the reflexive, transitive, and reflexive transitive closures of relations.
It also proves some basic r... |
0c598868587ff4f32d4a3eb5cd22b43c65bfc142 | 92b50235facfbc08dfe7f334827d47281471333b | /library/data/list/comb.lean | 42e1bf5b9ceb9c1a7d96192636c8d0c02048a8fc | [
"Apache-2.0"
] | permissive | htzh/lean | 24f6ed7510ab637379ec31af406d12584d31792c | d70c79f4e30aafecdfc4a60b5d3512199200ab6e | refs/heads/master | 1,607,677,731,270 | 1,437,089,952,000 | 1,437,089,952,000 | 37,078,816 | 0 | 0 | null | 1,433,780,956,000 | 1,433,780,955,000 | null | UTF-8 | Lean | false | false | 19,560 | lean | /-
Copyright (c) 2015 Leonardo de Moura. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Haitao Zhang
List combinators.
-/
import data.list.basic data.equiv
open nat prod decidable function helper_tactics
namespace list
variables {A B C : Type}
/- m... |
6c59731eee20c6b04cf7e262fbc28a437f9d1f47 | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/j4.lean | fbc5101e7f34bfba10483762dc1c422220e5d05a | [
"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 | 1,490 | lean | import macros
import tactic
using Nat
definition dvd (a b : Nat) : Bool := ∃ c, a * c = b
infix 50 | : dvd
theorem dvd_elim {a b : Nat} (H : a | b) : ∃ c, a * c = b := H
theorem dvd_intro {a b : Nat} (c : Nat) (H : a * c = b) : a | b := exists_intro c H
set_opaque dvd true
theorem dvd_trans {a b c} (H1 : a | b) (H2... |
d83e6c406be30b595c262ae188bb4cade42b9aae | 5ae26df177f810c5006841e9c73dc56e01b978d7 | /src/category_theory/const.lean | dead4eb73693885ec4e8256744717486e2ba97b1 | [
"Apache-2.0"
] | permissive | ChrisHughes24/mathlib | 98322577c460bc6b1fe5c21f42ce33ad1c3e5558 | a2a867e827c2a6702beb9efc2b9282bd801d5f9a | refs/heads/master | 1,583,848,251,477 | 1,565,164,247,000 | 1,565,164,247,000 | 129,409,993 | 0 | 1 | Apache-2.0 | 1,565,164,817,000 | 1,523,628,059,000 | Lean | UTF-8 | Lean | false | false | 2,513 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.functor_category
import category_theory.opposites
universes v₁ v₂ v₃ u₁ u₂ u₃ -- declare the `v`'s first; see `category_theory.category` for ... |
c81f323b0688f1e93574e1bcdfcd5d0b5718686a | 4fc5f02f6ed9423b87987589bcc202f985d7e9ff | /src/game/world5/level1.lean | 3c38460eece8f8c43a367851b6922bb52ca008af | [
"Apache-2.0"
] | permissive | grthomson/natural_number_game | 2937533df0b83e73e6a873c0779ee21e30f09778 | 0a23a327ca724b95406c510ee27c55f5b97e612f | refs/heads/master | 1,599,994,591,355 | 1,588,869,073,000 | 1,588,869,073,000 | 222,750,177 | 0 | 0 | Apache-2.0 | 1,574,183,960,000 | 1,574,183,960,000 | null | UTF-8 | Lean | false | false | 4,428 | lean | -- World name : Function world
/-
# Function world.
If you have beaten Addition World, then you have got
quite good at manipulating equalities in Lean using the `rw` tactic.
But there are plenty of levels later on which will require you
to manipulate functions, and `rw` is not the tool for you here.
To manipulate ... |
321546646332c5af7e08356b3172604e9369077d | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/tactic/monotonicity/lemmas.lean | 4912d311ab8c801dc5441c43c80cd98298117400 | [
"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,345 | lean | /-
Copyright (c) 2019 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
-/
import algebra.order.group.abs
import algebra.order.ring.defs
import algebra.order.sub.canonical
import data.set.lattice
import tactic.monotonicity.basic
variables {α : Ty... |
c21e7af027dc8913172e6a1b2ebbe45aacdff031 | 05b503addd423dd68145d68b8cde5cd595d74365 | /src/data/monoid_algebra.lean | f7a25f24ce417ba77d62495b3118857127cb789c | [
"Apache-2.0"
] | permissive | aestriplex/mathlib | 77513ff2b176d74a3bec114f33b519069788811d | e2fa8b2b1b732d7c25119229e3cdfba8370cb00f | refs/heads/master | 1,621,969,960,692 | 1,586,279,279,000 | 1,586,279,279,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 13,503 | 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, Scott Morrison
-/
import data.finsupp
/-!
# Monoid algebras
When the domain of a `finsupp` has a multiplicative or additive structure, we can define
a convolution pro... |
3b7f50fd7e270649117374fa889b070de61979a2 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/int/cast/prod.lean | 8482a3857906ba454007333ad72a0687f0c4e7d1 | [
"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 | 718 | 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.cast.lemmas
import data.nat.cast.prod
/-!
# The product of two `add_group_with_one`s.
-/
namespace prod
variables {α β : Type*} [add_group_with_one... |
fb00dca6068375b8bc65f5d7be0f64637a00833b | 367134ba5a65885e863bdc4507601606690974c1 | /src/ring_theory/algebraic.lean | fd7e6937f6b23694850dd898e85fdb64df21ea4f | [
"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,790 | lean | /-
Copyright (c) 2019 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import linear_algebra.finite_dimensional
import ring_theory.integral_closure
import data.polynomial.integral_normalization
/-!
# Algebraic elements and algebraic ex... |
1799f38e44c5efd697ee3404687226fc5b0f4c9a | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/algebra/big_operators.lean | e4b3bfd69b6aac3f7bc688d6fe6b5b296dcc4019 | [
"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 | 30,768 | 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
Some big operators for lists and finite sets.
-/
import tactic.tauto data.list.basic data.finset
import algebra.group algebra.ordered_group algebra.group_power
univers... |
1903e6955ec514112a7546a85fca39c11f0bbc08 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/algebra/big_operators/fin.lean | 6196b758c417f4c95c64aaeecb594df7ed696cf6 | [
"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 | 974 | lean | /-
Copyright (c) 2021 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen
-/
import algebra.big_operators.basic
import data.fintype.fin
/-!
# Big operators and `fin`
Some results about products and sums over the type `fin`.
-/
open_locale big_oper... |
476acceeeb1a570c93b025b107d78fe10d5c5680 | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/data/int/modeq.lean | 332fb68aa262adae350e13587d0e39db1ebbae54 | [
"Apache-2.0"
] | permissive | troyjlee/mathlib | e18d4b8026e32062ab9e89bc3b003a5d1cfec3f5 | 45e7eb8447555247246e3fe91c87066506c14875 | refs/heads/master | 1,689,248,035,046 | 1,629,470,528,000 | 1,629,470,528,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,498 | 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.nat.modeq
import tactic.ring
/-!
# Congruences modulo an integer
This file defines the equivalence relation `a ≡ b [ZMOD n]` on the integers, similarly to ... |
e49855eff7d38fc808761af9605568dd7171147d | 4727251e0cd73359b15b664c3170e5d754078599 | /src/data/buffer/parser/numeral.lean | bbc5f7571d4128a92950ff9858ddc48cbdfea88b | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 4,491 | lean | /-
Copyright (c) 2020 Yakov Pechersky. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yakov Pechersky
-/
import data.buffer.parser.basic
/-!
# Numeral parsers
This file expands on the existing `nat : parser ℕ` to provide parsers into any type `α` that
can be represen... |
27e511b73c897f3e461eceb2e0e24e7e46133ac0 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/linear_algebra/linear_independent.lean | 7d3ad051d1b7639e9dd8b34445dad7f485c99926 | [
"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 | 56,969 | lean | /-
Copyright (c) 2020 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro, Alexander Bentkamp, Anne Baanen
-/
import linear_algebra.finsupp
import linear_algebra.prod
import data.equiv.fin
import set_theory.cardinal
/-!
# Linear... |
b7bb1033541326de955c86f125a6d6288c8ee7d8 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/logic/denumerable.lean | 0f72967e03d89d8c64a7223cf8df65c0ba6973d0 | [
"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 | 10,766 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.fintype.basic
import data.list.min_max
import logic.encodable.basic
/-!
# Denumerable types
This file defines denumerable (countably infinite) types as ... |
daacc3c2e5c0904e9ce0afb9a5c4b27908e86bff | 08bd4ba4ca87dba1f09d2c96a26f5d65da81f4b4 | /src/Init/Data/List/Basic.lean | fca0ee920d237f174bb869764d3a90ceade968b1 | [
"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",
"Apache-2.0",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | gebner/lean4 | d51c4922640a52a6f7426536ea669ef18a1d9af5 | 8cd9ce06843c9d42d6d6dc43d3e81e3b49dfc20f | refs/heads/master | 1,685,732,780,391 | 1,672,962,627,000 | 1,673,459,398,000 | 373,307,283 | 0 | 0 | Apache-2.0 | 1,691,316,730,000 | 1,622,669,271,000 | Lean | UTF-8 | Lean | false | false | 29,112 | 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.SimpLemmas
import Init.Data.Nat.Basic
set_option linter.missingDocs true -- keep it documented
open Decidable List
universe u v w
varia... |
85b68b8386758e273d05138ab4d8ee23879b721d | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebra/algebra/tower.lean | fdbf486098571697e40bf272fa5a11941cb702d4 | [
"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 | 14,025 | lean | /-
Copyright (c) 2020 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import algebra.algebra.subalgebra.basic
import algebra.algebra.bilinear
/-!
# Towers of algebras
In this file we prove basic facts about towers of algebra.
An algebra tower... |
9b4625063bcdadc64e7d710712bacdfb19df14e4 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/analysis/inner_product_space/euclidean_dist.lean | 2fd3110be79a76d1fb573f884a00f18de4cdd441 | [
"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 | 4,704 | 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 analysis.inner_product_space.calculus
import analysis.inner_product_space.pi_L2
/-!
# Euclidean distance on a finite dimensional space
When we define a smo... |
7ed1cf93c544d07f0a8bbb64fd650d6bf725993b | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/field_theory/perfect_closure.lean | cde76f595d70f8a32532940f70a5e1ab1bd5f7d7 | [
"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 | 17,004 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Yury Kudryashov
-/
import algebra.char_p data.equiv.ring
/-!
# The perfect closure of a field
-/
universes u v
/-- A perfect field is a field of characteristic p that has p-t... |
aa27daa44694f34ea61c119aade3adcf9e15285a | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/data/array/lemmas.lean | 6a05b8ca6d2f3c8b0889c1904061113425650169 | [
"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 | 9,450 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Mario Carneiro
-/
import data.list.basic category.traversable.equiv data.vector2
universes u w
namespace d_array
variables {n : ℕ} {α : fin n → Type u}
ins... |
3f88be27854f4cf2438bafe9d4e6a57ecea779e5 | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /tests/lean/run/tree.lean | 7a488a79a03a9386b18e1574bfee58914d16a798 | [
"Apache-2.0"
] | permissive | chubbymaggie/lean | 0d06ae25f9dd396306fb02190e89422ea94afd7b | d2c7b5c31928c98f545b16420d37842c43b4ae9a | refs/heads/master | 1,611,313,622,901 | 1,430,266,839,000 | 1,430,267,083,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,979 | lean | import logic data.prod
open eq.ops prod
inductive tree (A : Type) :=
| leaf : A → tree A
| node : tree A → tree A → tree A
inductive one.{l} : Type.{max 1 l} :=
star : one
set_option pp.universes true
namespace tree
namespace manual
section
universe variables l₁ l₂
variable {A : Type.{l₁}}
variable (C... |
639ce3f4d55e0b2594c2fefd6ead07395db67056 | 618003631150032a5676f229d13a079ac875ff77 | /src/measure_theory/decomposition.lean | 3e7f0169e6428192db23ca06967e00a30702a980 | [
"Apache-2.0"
] | permissive | awainverse/mathlib | 939b68c8486df66cfda64d327ad3d9165248c777 | ea76bd8f3ca0a8bf0a166a06a475b10663dec44a | refs/heads/master | 1,659,592,962,036 | 1,590,987,592,000 | 1,590,987,592,000 | 268,436,019 | 1 | 0 | Apache-2.0 | 1,590,990,500,000 | 1,590,990,500,000 | null | UTF-8 | Lean | false | false | 8,590 | lean | /-
Copyright (c) 2019 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
Hahn decomposition theorem
TODO:
* introduce finite measures (into nnreal)
* show general for signed measures (into ℝ)
-/
import measure_theory.measure_space
open set... |
9b8a9a56b43c52c135f7c1c7b97fc7dc15f08ee4 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/foApprox.lean | 475d409be2703d5b2383d0796ca2c3dd817f5cb7 | [
"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 | 265 | lean | def f : Prop → Prop := id
class Foo (foo : Prop → Prop) where
l : x → foo x
instance : Foo f where
l := by simp_all [f]
theorem test' (h : x = True) : f x := by
have _ := True
apply Foo.l -- `?foo ?x =?= [mdata noImplicitLambda:1 f x]`
simp [h]
|
af41c935731d3d2f9b84d45e1f7a5443f5a732c4 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/measure_theory/measure/finite_measure_weak_convergence.lean | aed6f9a29353940d895f7da785693525e91e25dd | [
"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 | 56,037 | lean | /-
Copyright (c) 2021 Kalle Kytölä. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kalle Kytölä
-/
import measure_theory.measure.measure_space
import measure_theory.integral.set_integral
import measure_theory.integral.average
import topology.continuous_function.bounded... |
af4f7f327a1f013df21d53d094cd3a8240af79dc | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/topology/nhds_set.lean | 9b4dded88b23ab3fad39229cab9b2efed7d0e39a | [
"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 | 3,971 | lean | /-
Copyright (c) 2022 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Patrick Massot
-/
import topology.basic
/-!
# Neighborhoods of a set
In this file we define the filter `𝓝ˢ s` or `nhds_set s` consisting of all neighborhoods of a... |
864f8f7a6b011a35a9701476dbbf3bcc8265e72c | 54c9ed381c63410c9b6af3b0a1722c41152f037f | /experiments/metacheck/MetaCheck.lean | 9b6601a9045265c2300210298a963ce7390d8779 | [
"Apache-2.0"
] | permissive | dselsam/binport | 0233f1aa961a77c4fc96f0dccc780d958c5efc6c | aef374df0e169e2c3f1dc911de240c076315805c | refs/heads/master | 1,687,453,448,108 | 1,627,483,296,000 | 1,627,483,296,000 | 333,825,622 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,430 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Daniel Selsam
-/
import Lean
import Std.Data.HashSet
open Lean Lean.Meta
open Std (HashSet mkHashSet)
namespace MetaCheckExperiment
def BLACK_LIST : HashSet Name :=
({} : H... |
231bb3f03de4fc22cdc53765f1fcd31173d763c0 | 49bd2218ae088932d847f9030c8dbff1c5607bb7 | /src/measure_theory/integration.lean | d7c36e66ace9f39804e01cfb49ae4ecda69f510b | [
"Apache-2.0"
] | permissive | FredericLeRoux/mathlib | e8f696421dd3e4edc8c7edb3369421c8463d7bac | 3645bf8fb426757e0a20af110d1fdded281d286e | refs/heads/master | 1,607,062,870,732 | 1,578,513,186,000 | 1,578,513,186,000 | 231,653,181 | 0 | 0 | Apache-2.0 | 1,578,080,327,000 | 1,578,080,326,000 | null | UTF-8 | Lean | false | false | 55,152 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Johannes Hölzl
Lebesgue integral on `ennreal`.
We define simple functions and show that each Borel measurable function on `ennreal` can be
approximated by a sequence ... |
b744c0b10d23b997e8a66290183f76e46da4ed52 | 626e312b5c1cb2d88fca108f5933076012633192 | /src/topology/metric_space/hausdorff_distance.lean | 0f50188e99c76a21f05f1178f07f4f6cd3e68ae5 | [
"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 | 32,614 | 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.metric_space.isometry
import topology.instances.ennreal
import analysis.specific_limits
/-!
# Hausdorff distance
The Hausdorff distance on sub... |
fac166b63c5fcc7f9689ad0c22ce856f84415599 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/category_theory/monoidal/functorial.lean | 70225b04057d0682a68cce87f58da5e6364e5e4c | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 3,681 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.monoidal.functor
import category_theory.functor.functorial
/-!
# Unbundled lax monoidal functors
## Design considerations
The essential probl... |
d4074be63c5d68c1ecf2803b5ba47c54f7d6bae2 | 9ad8d18fbe5f120c22b5e035bc240f711d2cbd7e | /src/data/family.lean | f3b1b7ca85c25b48bb02bc8ed753114737b8c4d6 | [] | 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 | 11,893 | 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 file sets up some definitions for working with parametrised families
of types, and morphisms between them. In other words, we essentially
work with the cate... |
bdf8f7ba9a88fa01334204cebde1603af02a2453 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/category_theory/limits/shapes/constructions/equalizers.lean | 486b0149f5233d6d60f57e03c931550faf2b8873 | [
"Apache-2.0"
] | permissive | dupuisf/mathlib | 62de4ec6544bf3b79086afd27b6529acfaf2c1bb | 8582b06b0a5d06c33ee07d0bdf7c646cae22cf36 | refs/heads/master | 1,669,494,854,016 | 1,595,692,409,000 | 1,595,692,409,000 | 272,046,630 | 0 | 0 | Apache-2.0 | 1,592,066,143,000 | 1,592,066,142,000 | null | UTF-8 | Lean | false | false | 2,701 | lean | /-
Copyright (c) 2020 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta
-/
import category_theory.limits.shapes.equalizers
import category_theory.limits.shapes.binary_products
import category_theory.limits.shapes.pullbacks
/-!
# Constructing eq... |
f16ea858be45e083cfdbdc7fa4218a6cc2005abe | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/tactic/equiv_rw.lean | ca74919c3eecc81378240cdbdc49c22ce8bd0d1e | [
"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 | 13,474 | 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 logic.equiv.defs
import tactic.clear
import tactic.simp_result
import tactic.apply
import control.equiv_functor.instances -- these make equiv_rw more powerful!... |
fb4441ddcd79b340bf1c1302b99938851e8cf7f5 | efce24474b28579aba3272fdb77177dc2b11d7aa | /src/homotopy_theory/topological_spaces/fundamental_groupoid.lean | 61ac89e6ce73a55ac0a6a2e4367a1e3629bc1fd7 | [
"Apache-2.0"
] | permissive | rwbarton/lean-homotopy-theory | cff499f24268d60e1c546e7c86c33f58c62888ed | 39e1b4ea1ed1b0eca2f68bc64162dde6a6396dee | refs/heads/lean-3.4.2 | 1,622,711,883,224 | 1,598,550,958,000 | 1,598,550,958,000 | 136,023,667 | 12 | 6 | Apache-2.0 | 1,573,187,573,000 | 1,528,116,262,000 | Lean | UTF-8 | Lean | false | false | 1,541 | lean | import category_theory.bundled
import category_theory.induced
import homotopy_theory.formal.cofibrations.track
import homotopy_theory.formal.i_category.cofibration_category
import .pi_n
noncomputable theory
open category_theory
local notation f ` ∘ `:80 g:80 := g ≫ f
namespace homotopy_theory.topological_spaces
open... |
ca43b493222910d9daa46bd8230bca87a9c29f60 | bc6b522ca01a7d1eddd58687225d93b4bb90fc65 | /test/simple.lean | a96111c4e28acba551fb78adf809004a515d86bd | [] | no_license | cipher1024/olean-rs | c8fcf0a47570e922be4dfd33b5f3b6ac9571e6f7 | 4707d26177733753ee4195b4b0883b4089e85f11 | refs/heads/master | 1,588,599,805,382 | 1,557,346,494,000 | 1,557,346,494,000 | 179,171,289 | 1 | 0 | null | 1,554,245,858,000 | 1,554,245,858,000 | null | UTF-8 | Lean | false | false | 17 | lean | import system.io
|
b9b7735e53b2969c95eb27a3bbdd3ff4265e771b | 618003631150032a5676f229d13a079ac875ff77 | /src/category_theory/conj.lean | 5eacf2faf14ab575ba60f855eb5c823fa2f0dea1 | [
"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 | 5,801 | 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.endomorphism
import algebra.group_power
/-!
# Conjugate morphisms by isomorphisms
An isomorphism `α : X ≅ Y` defines
- a monoid isomorphism... |
8d54b5798f0854d5a4d4016d4c886223bac848ef | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /src/Lean/Structure.lean | b69738bead64b41cb7888e25451344cd8615bbd5 | [
"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 | 7,307 | 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
Helper functions for retrieving structure information.
-/
import Lean.Environment
import Lean.ProjFns
/- TODO: We currently assume that the projection functi... |
2828fb1961a5581ee3e184e00867dfc8b9390353 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/group_theory/submonoid/membership.lean | 92c94d4d69e32b1f11f57197e8ba838b96ef343b | [
"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 | 14,423 | lean | /-
Copyright (c) 2018 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Kenny Lau, Johan Commelin, Mario Carneiro, Kevin Buzzard,
Amelia Livingston, Yury Kudryashov
-/
import group_theory.submonoid.operations
import algebra.big_operators.ba... |
56ef587b35262f88597866bf0c77fe8a1959ebef | 4727251e0cd73359b15b664c3170e5d754078599 | /src/category_theory/limits/shapes/default.lean | ce39844b6f1e1e4abd9f3e72d785b8c050a1e923 | [
"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 | 585 | lean | import category_theory.limits.shapes.terminal
import category_theory.limits.shapes.binary_products
import category_theory.limits.shapes.products
import category_theory.limits.shapes.finite_products
import category_theory.limits.shapes.finite_limits
import category_theory.limits.shapes.biproducts
import category_theory.... |
ec622913f6e12aef668eaba29a372452e2836b2c | fe208a542cea7b2d6d7ff79f94d535f6d11d814a | /src/Logic/one_liner.lean | 6f716908b80a47990dc263e932ffefcf99aecc72 | [] | no_license | ImperialCollegeLondon/M1F_room_342_questions | c4b98b14113fe900a7f388762269305faff73e63 | 63de9a6ab9c27a433039dd5530bc9b10b1d227f7 | refs/heads/master | 1,585,807,312,561 | 1,545,232,972,000 | 1,545,232,972,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,294 | lean | inductive fml
| atom (i : ℕ)
| imp (a b : fml)
| not (a : fml)
open fml
infixr ` →' `:50 := imp -- right associative
prefix `¬' `:51 := fml.not
inductive prf : fml → Type
| axk (p q) : prf (p →' q →' p)
| axs (p q r) : prf $ (p →' q →' r) →' (p →' q) →' (p →' r)
| axX (p q) : prf $ ((¬' q) →' (¬' p)) →' p →' q
| mp... |
2bed56d4a2346753e1df9c8e99777abc135ceef4 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/run/nested_common_subexpr_issue.lean | a34bab48366c4a08391739d098a278922beb5c19 | [
"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 | 332 | lean | -- set_option trace.compiler true
def fib_aux : ℕ → ℕ × ℕ
| 0 := (0, 1)
| (n+1) := let p := fib_aux n in (p.2, p.1 + p.2)
def fib n := (fib_aux n).2
#eval fib 10000
def fib_aux2 : ℕ → ℕ × ℕ
| 0 := (0, 1)
| (n+1) := let (a, b) := fib_aux2 n in (b, a + b)
def fib2 n := (fib_aux2 n).2
#eval fib2 10000
|
eefb9d49009a3930ae90756e2ec802a1d465316f | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tests/compiler/lazylist.lean | 7034deed238ed90795e656d38a1918e6e6661bd7 | [
"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,048 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
universe u v w
inductive LazyList (α : Type u) where
| nil : LazyList α
| cons (hd : α) (tl : LazyList α) : LazyList α
... |
008af05731fca96e0563c5b07e6ac1d16072db94 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/data/polynomial/identities.lean | 34412f8293ccb4e8a3028013f35b9ae1c3506dc0 | [
"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 | 3,523 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Johannes Hölzl, Scott Morrison, Jens Wagemaker
-/
import data.polynomial.derivative
/-!
# Theory of univariate polynomials
The main def is `binom_expansion`.
-/
noncompu... |
a223cd0f52dbb59e574d5f190ae36c1682d5cdc4 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/order/lexicographic.lean | a9f0b737899129a2cfde1aa0e18b509b9a6b7fa7 | [
"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 | 5,039 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Minchao Wu
-/
import data.equiv.basic
import data.prod
import tactic.basic
/-!
# Lexicographic order
This file defines the lexicographic relation for pairs and depend... |
554a789a5901be18f2ccd80bb3d7fd9337031b92 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/set_theory/ordinal/natural_ops.lean | c57041816c21de29e481f456baf53b97d3ded219 | [
"Apache-2.0"
] | permissive | ramonfmir/mathlib | c5dc8b33155473fab97c38bd3aa6723dc289beaa | 14c52e990c17f5a00c0cc9e09847af16fabbed25 | refs/heads/master | 1,661,979,343,526 | 1,660,830,384,000 | 1,660,830,384,000 | 182,072,989 | 0 | 0 | null | 1,555,585,876,000 | 1,555,585,876,000 | null | UTF-8 | Lean | false | false | 12,060 | lean | /-
Copyright (c) 2022 Violeta Hernández Palacios. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Violeta Hernández Palacios
-/
import set_theory.ordinal.arithmetic
/-!
# Natural operations on ordinals
The goal of this file is to define natural addition and multiplic... |
7f37cb06659c04af3698b55241937c8ad66f8ee4 | efa51dd2edbbbbd6c34bd0ce436415eb405832e7 | /20161026_ICTAC_Tutorial/ex17.lean | 0e1c25f0aa3ee5d557808556df5bda80781cf7d1 | [
"Apache-2.0"
] | permissive | leanprover/presentations | dd031a05bcb12c8855676c77e52ed84246bd889a | 3ce2d132d299409f1de269fa8e95afa1333d644e | refs/heads/master | 1,688,703,388,796 | 1,686,838,383,000 | 1,687,465,742,000 | 29,750,158 | 12 | 9 | Apache-2.0 | 1,540,211,670,000 | 1,422,042,683,000 | Lean | UTF-8 | Lean | false | false | 145 | lean | check let y := 2 + 2 in y * y -- ℕ
eval let y := 2 + 2 in y * y -- 16
def t (x : ℕ) : ℕ :=
let y := x + x in y * y
eval t 2 -- 16
|
c85f08b14d86d80b4c4d131d0aa17b797c22e260 | 491068d2ad28831e7dade8d6dff871c3e49d9431 | /tests/lean/num4.lean | f5fd4d67065fba51fdefd01286f3539413c54daa | [
"Apache-2.0"
] | permissive | davidmueller13/lean | 65a3ed141b4088cd0a268e4de80eb6778b21a0e9 | c626e2e3c6f3771e07c32e82ee5b9e030de5b050 | refs/heads/master | 1,611,278,313,401 | 1,444,021,177,000 | 1,444,021,177,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 278 | lean | import data.num
set_option pp.notation false
set_option pp.implicit true
namespace foo
constant N : Type.{1}
constant z : N
constant o : N
constant a : N
notation 0 := z
notation 1 := o
check a = 0
end foo
check 2 = 1
check #foo foo.a = 1
open foo
check a = 1
|
1bec69063227540e3c5d17db839e720d6cf7e0b0 | 9a2260f3b7b64ae9c50bf326fdb0387f5ac64683 | /src/NITRO/JavaScript.lean | a84766d9eaf8e698bd022d67afa1e68ab9cbd47d | [
"LicenseRef-scancode-mit-taylor-variant",
"LicenseRef-scancode-warranty-disclaimer"
] | permissive | o89/nitro | e8e1c7f3e7baeb7a659f899c605d37b1d3e553a6 | c62a67398a89d6e6a2e9da62350adaf5f17cfda9 | refs/heads/master | 1,670,068,174,264 | 1,669,086,407,000 | 1,669,086,407,000 | 204,147,098 | 3 | 5 | null | null | null | null | UTF-8 | Lean | false | false | 2,273 | lean | import N2O.Network.Default
import NITRO.Elements
def action (x : String) : Result :=
let term := λ b => Term.tuple
[ Term.atom "io",
Term.binary b,
Term.binary ByteArray.empty ];
match Put.run (Put.unicode x) with
| Sum.ok bytes =>
match writeTerm (term bytes) with
| Sum.ok v => Result.reply (Msg.binary ... |
8c1ebb39b9b3611286fed9c546ac7b007b712efe | 491068d2ad28831e7dade8d6dff871c3e49d9431 | /tests/lean/run/congr_tac2.lean | 8036aaece99a68c5237b33174ac4930e59781cc7 | [
"Apache-2.0"
] | permissive | davidmueller13/lean | 65a3ed141b4088cd0a268e4de80eb6778b21a0e9 | c626e2e3c6f3771e07c32e82ee5b9e030de5b050 | refs/heads/master | 1,611,278,313,401 | 1,444,021,177,000 | 1,444,021,177,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,305 | lean | import data.finset
open finset list
example (A : Type) (f : nat → nat → nat → nat) (a b : nat) : a = b → f a = f b :=
begin
intros,
congruence,
assumption
end
structure finite_set [class] {T : Type} (xs : set T) :=
(to_finset : finset T) (is_equiv : to_set to_finset = xs)
definition finset_set.is_subsingleton ... |
7008e910bab33892d08f98a0ab7f382e6e9bf0fc | d1a52c3f208fa42c41df8278c3d280f075eb020c | /src/Lean/Util/ReplaceLevel.lean | 9c1beb5401bf16b6186c7edcfc5c6ffa8f2936c6 | [
"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,420 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Expr
namespace Lean
namespace Level
partial def replace (f? : Level → Option Level) (u : Level) : Level :=
match f? u with
| some v => v
... |
a8c49e8ac5aafdee153c6edf3a35473c8cfacf4a | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/analysis/specific_limits.lean | 3d92eb40ae189be7d7554afae5d33e4b61fbbbf5 | [
"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 | 47,627 | 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
-/
import algebra.geom_sum
import analysis.asymptotics.asymptotics
import order.filter.archimedean
import order.iterate
import topology.instances.ennreal
/-!
# A collec... |
c011191607bccab8f6e82714f31b9c2aa0ceb686 | 8930e38ac0fae2e5e55c28d0577a8e44e2639a6d | /order/lattice.lean | d942ec5b7d27b645f8357880c7a7847d245ed7ee | [
"Apache-2.0"
] | permissive | SG4316/mathlib | 3d64035d02a97f8556ad9ff249a81a0a51a3321a | a7846022507b531a8ab53b8af8a91953fceafd3a | refs/heads/master | 1,584,869,960,527 | 1,530,718,645,000 | 1,530,724,110,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,956 | 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
Defines the inf/sup (semi)-lattice with optionally top/bot type class hierarchy.
-/
import order.basic
set_option old_structure_cmd true
universes u v w
-- TODO: mo... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.