Lax Lean Archive

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

Deep chain, link 3 of 9

Lax771644.Chain03 · concepts/Lax771644/Chain03.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

    Link 3 of a linear chain of nine single-statement concepts, each proved from the previous one. The chain exists to make the layout engine draw a long, deep path with no branching.

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

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1import Mathlib.Data.Nat.Notation
    2import Lax771644.Foundations
    3
    4/-!
    5---
    6title: Deep chain, link 3 of 9
    7type: theorem
    8---
    9Link 3 of a linear chain of nine single-statement concepts, each proved from
    10the previous one. The chain exists to make the layout engine draw a long, deep
    11path with no branching.
    12
    13# Formalization notes
    14
    15Each link weakens the previous rung by one, so the chain is a genuine
    16composition rather than nine restatements.
    17-/
    18
    19namespace Lax771644.Chain03
    20
    21/-- Descent from stage 510 to stage 507. -/
    22axiom rung : Foundations.Descent 510 507
    23
    24end Lax771644.Chain03
    25
    Show Proof
    Formalization notes

    Each link weakens the previous rung by one, so the chain is a genuine composition rather than nine restatements.

    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…