Lax Lean Archive

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

Two sibling proofs forming a chain

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

    Statement 2 is proved from statement 1 and statement 3 from statement 2, both inside this one concept. The two turnstiles must be stacked so that the second sits below the output of the first without colliding with the dock row.

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

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

    1 s1 proven

    2 s2 proven

    3 s3 proven

    Lean source view on GitHub

    1import Mathlib.Data.Nat.Notation
    2import Lax771644.Foundations
    3
    4/-!
    5---
    6title: Two sibling proofs forming a chain
    7type: theorem
    8---
    9Statement 2 is proved from statement 1 and statement 3 from statement 2, both
    10inside this one concept. The two turnstiles must be stacked so that the second
    11sits below the output of the first without colliding with the dock row.
    12
    13# Formalization notes
    14
    15Each step weakens the lower rung by one, so the chain is genuine rather than
    16three unrelated claims.
    17-/
    18
    19namespace Lax771644.SiblingChain
    20
    21/-- Descent from stage 52 to stage 51. -/
    22axiom s1 : Foundations.Descent 52 51
    23
    24/-- Descent from stage 52 to stage 50. -/
    25axiom s2 : Foundations.Descent 52 50
    26
    27/-- Descent from stage 52 to stage 49. -/
    28axiom s3 : Foundations.Descent 52 49
    29
    30end Lax771644.SiblingChain
    31
    Show ProofShow ProofShow Proof
    Formalization notes

    Each step weakens the lower rung by one, so the chain is genuine rather than three unrelated claims.

    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…