OrderEmbedding.birkhoffFinset

{α : Type u_1} → [inst : DistribLattice α] → [Fintype α] → [DecidablePred SupIrred] → α ↪o Finset { 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: 4 results in Mathlib
Foundations: Depth 70 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes: DistribLattice Fintype DecidablePred

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Results whose statement or proof uses this declaration.