Lax Lean Archive

While this submission is a draft, it cannot be used by other submissions.

A very wide dock row with a wide assumption rail

Lax771644.WideDockRow · concepts/Lax771644/WideDockRow.lean · lax-771644

proven

Loading review…

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Natural Language Statement

    Theorem

    Twelve numbered statements, every one of them proved, so the dock row is as wide as this benchmark gets. Statement 12 is a sibling proof that uses eleven of its siblings at once, which gives the widest assumption rail in the submission.

    Concept map
    2 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    This concept declares 12 statements. Each proof establishes one of them relative to its assumptions.

    1 s01 proven

    2 s02 proven

    3 s03 proven

    4 s04 proven

    5 s05 proven

    6 s06 proven

    7 s07 proven

    8 s08 proven

    9 s09 proven

    10 s10 proven

    11 s11 proven

    12 s12 proven

    Lean source view on GitHub

    1import Mathlib.Data.Nat.Notation
    2import Lax771644.Foundations
    3
    4/-!
    5---
    6title: A very wide dock row with a wide assumption rail
    7type: theorem
    8---
    9Twelve numbered statements, every one of them proved, so the dock row is as
    10wide as this benchmark gets. Statement 12 is a sibling proof that uses eleven of
    11its siblings at once, which gives the widest assumption rail in the submission.
    12
    13# Formalization notes
    14
    15The eleven single-step rungs compose to the twelfth statement exactly, so the
    16eleven assumptions of the last proof are all genuinely used.
    17-/
    18
    19namespace Lax771644.WideDockRow
    20
    21/-- Descent from stage 101 to stage 100. -/
    22axiom s01 : Foundations.Descent 101 100
    23
    24/-- Descent from stage 102 to stage 101. -/
    25axiom s02 : Foundations.Descent 102 101
    26
    27/-- Descent from stage 103 to stage 102. -/
    28axiom s03 : Foundations.Descent 103 102
    29
    30/-- Descent from stage 104 to stage 103. -/
    31axiom s04 : Foundations.Descent 104 103
    32
    33/-- Descent from stage 105 to stage 104. -/
    34axiom s05 : Foundations.Descent 105 104
    35
    36/-- Descent from stage 106 to stage 105. -/
    37axiom s06 : Foundations.Descent 106 105
    38
    39/-- Descent from stage 107 to stage 106. -/
    40axiom s07 : Foundations.Descent 107 106
    41
    42/-- Descent from stage 108 to stage 107. -/
    43axiom s08 : Foundations.Descent 108 107
    44
    45/-- Descent from stage 109 to stage 108. -/
    46axiom s09 : Foundations.Descent 109 108
    47
    48/-- Descent from stage 110 to stage 109. -/
    49axiom s10 : Foundations.Descent 110 109
    50
    51/-- Descent from stage 111 to stage 110. -/
    52axiom s11 : Foundations.Descent 111 110
    53
    54/-- Descent from stage 111 to stage 100, the composite of all eleven rungs above. -/
    55axiom s12 : Foundations.Descent 111 100
    56
    57end Lax771644.WideDockRow
    58
    Show ProofShow ProofShow ProofShow ProofShow ProofShow ProofShow ProofShow ProofShow ProofShow ProofShow ProofShow Proof
    Formalization notes

    The eleven single-step rungs compose to the twelfth statement exactly, so the eleven assumptions of the last proof are all genuinely used.

    Builds on
    Used by

    none

    From Mathlib

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…