Theorems · Definition · order theory
OrderEmbedding.infIrredUpperSet
{α : Type u_1} → [inst : PartialOrder α] → α ↪o { s // InfIrred s }The Birkhoff Embedding of a finite partial order as inf-irreducible elements in its lattice of lower sets.
- Defined in
- Mathlib.Order.Birkhoff
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 67 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- PartialOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
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
- OrderEmbeddingstatement · cited by 619
- UpperSetstatement · cited by 245
- UpperSet.Iciproof · cited by 38
- InfIrredstatement · cited by 27
- UpperSet.infIrred_Iciproof · cited by 4
Cited by3
Results whose statement or proof uses this declaration.
- OrderIso.infIrredUpperSetproof · cited by 3
- OrderEmbedding.infIrredUpperSet_applystatement · cited by 0
- OrderEmbedding.infIrredUpperSet_surjectivestatement · cited by 0