Theorems · Definition · order theory
LatticeHom.birkhoffSet
- 1000+ list: Birkhoff's representation theorem
{α : Type u_1} →
[inst : DistribLattice α] → [Fintype α] → [DecidablePred SupIrred] → LatticeHom α (Set { a // SupIrred a })Birkhoff's Representation Theorem. Any finite distributive lattice can be embedded in a powerset lattice.
- Defined in
- Mathlib.Order.Birkhoff
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 71 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Setstatement · cited by 53,352
- Fintypestatement and proof · cited by 7,736
- LatticeHomstatement · cited by 192
- DistribLatticestatement and proof · cited by 150
- SupIrredstatement and proof · cited by 34
- OrderEmbedding.birkhoffSetproof · cited by 6
- OrderEmbedding.birkhoffSet_infproof · cited by 1
- OrderEmbedding.birkhoffSet_supproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.