Incomparability is symmetric and irreflexive

Lax825442.IncomparableProperties · concepts/Lax825442/IncomparableProperties.lean · lax-825442

proven

Loading review…

Sign in with ORCID

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

    Incomparability of graph parameters is symmetric and irreflexive.

    Concept map
    5 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 Lax825442.Incomparable
    2
    3/-!
    4---
    5title: Incomparability is symmetric and irreflexive
    6type: theorem
    7---
    8Incomparability of graph parameters is symmetric and irreflexive.
    9-/
    10
    11namespace Lax825442.IncomparableProperties
    12
    13open Lax153141.GraphParameters
    14
    15/-- Incomparability is symmetric and no parameter is incomparable with itself. -/
    16axiom incomparable_symmetric_irreflexive :
    17 (Symmetric Lax825442.Incomparable.Incomparable) ∧
    18 (Irreflexive Lax825442.Incomparable.Incomparable)
    19
    20end Lax825442.IncomparableProperties
    21
    Show Proof
    Builds on
    Used by

    none

    From Mathlib

    none

    Discussion

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

    Loading discussion…