Lax Lean Archive

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

One proof assuming eight other concepts

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

    A single-statement concept whose proof assumes one statement from each of eight different concepts of this submission. Every one of those uses is coarsened by the drawing to a single port on the assumed concept's box, so this is the test for a wide rail of cross-concept assumption arrows.

    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: One proof assuming eight other concepts
    7type: theorem
    8---
    9A single-statement concept whose proof assumes one statement from each of eight
    10different concepts of this submission. Every one of those uses is coarsened by
    11the drawing to a single port on the assumed concept's box, so this is the test
    12for a wide rail of *cross-concept* assumption arrows.
    13
    14# Formalization notes
    15
    16The eight foreign rungs are chosen to descend, so the composite from stage 200
    17down to stage 10 uses each of them.
    18-/
    19
    20namespace Lax771644.ManyForeignAssumptions
    21
    22/-- Descent from stage 200 to stage 10, assembled from eight other concepts. -/
    23axiom descends_far : Foundations.Descent 200 10
    24
    25end Lax771644.ManyForeignAssumptions
    26
    Show Proof
    Formalization notes

    The eight foreign rungs are chosen to descend, so the composite from stage 200 down to stage 10 uses each of them.

    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…