Incomparability is symmetric and irreflexive
Lax825442.IncomparableProperties · concepts/Lax825442/IncomparableProperties.lean · lax-825442
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Incomparability of graph parameters is symmetric and irreflexive.
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
Lean source view on GitHub
| 1 | import Lax825442.Incomparable |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Incomparability is symmetric and irreflexive |
| 6 | type: theorem |
| 7 | --- |
| 8 | Incomparability of graph parameters is symmetric and irreflexive. |
| 9 | -/ |
| 10 | |
| 11 | namespace Lax825442.IncomparableProperties |
| 12 | |
| 13 | open Lax153141.GraphParameters |
| 14 | |
| 15 | /-- Incomparability is symmetric and no parameter is incomparable with itself. -/ |
| 16 | axiom incomparable_symmetric_irreflexive : |
| 17 | (Symmetric Lax825442.Incomparable.Incomparable) ∧ |
| 18 | (Irreflexive Lax825442.Incomparable.Incomparable) |
| 19 | |
| 20 | end Lax825442.IncomparableProperties |
| 21 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments