Theorems · Definition · order theory
OrderIso.supIrredLowerSet
{α : Type u_1} → [inst : PartialOrder α] → [Finite α] → α ≃o { s // SupIrred s }Birkhoff Representation for partial orders. Any partial order is isomorphic to the partial order of sup-irreducible elements in its lattice of lower sets.
- Defined in
- Mathlib.Order.Birkhoff
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 72 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- PartialOrderFinite
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- PartialOrderstatement and proof · cited by 6,410
- Finitestatement and proof · cited by 3,029
- OrderIsostatement · cited by 874
- LowerSetstatement · cited by 230
- SupIrredstatement · cited by 34
- RelIso.ofSurjectiveproof · cited by 4
- OrderEmbedding.supIrredLowerSetproof · cited by 2
- OrderEmbedding.supIrredLowerSet_surjectiveproof · cited by 0
Cited by3
Results whose statement or proof uses this declaration.
- OrderIso.supIrredLowerSet_symm_applystatement and proof · cited by 0
- OrderIso.supIrredLowerSet.congr_simpstatement and proof · cited by 0
- OrderIso.supIrredLowerSet_applystatement · cited by 0