Theorems · Definition · combinatorics
SimpleGraph.hasse
(α : Type u_1) → [Preorder α] → SimpleGraph α
The Hasse diagram of an order as a simple graph. The graph of the covering relation.
- Defined in
- Mathlib.Combinatorics.SimpleGraph.Hasse
- Cited by
- 8 results in Mathlib
- Foundations
- Depth 11 from the axioms · uses propext, Quot.sound
- Assumes
- Preorder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Preorderstatement and proof · cited by 7,952
- SimpleGraphstatement · cited by 3,072
- CovByproof · cited by 290
Cited by10
Results whose statement or proof uses this declaration.
- SimpleGraph.pathGraphproof · cited by 8
- SimpleGraph.hasseDualIsostatement · cited by 2
- SimpleGraph.hasse_preconnected_of_succstatement and proof · cited by 1
- SimpleGraph.hasse_prodstatement and proof · cited by 0
- SimpleGraph.pathGraph_two_eq_topproof · cited by 0
- SimpleGraph.cliqueFree_hasse_threestatement and proof · cited by 0
- SimpleGraph.hasseDualIso_applystatement · cited by 0
- SimpleGraph.hasseDualIso_symm_applystatement · cited by 0
- SimpleGraph.hasse_adjstatement · cited by 0
- SimpleGraph.hasse_preconnected_of_predstatement and proof · cited by 0