Distributive join-semilattices #
[UPSTREAM] candidate for a new Mathlib/Order/DistribSemilattice.lean.
A join-semilattice is distributive when every element below a join b ⊔ c is the join of an
element below b and an element below c. Every distributive lattice is distributive in this
sense, and a lattice that is distributive in this sense obeys the distributive law
(inf_sup_le), so the notion extends distributivity to
semilattices that lack meets. Any two elements of a distributive semilattice have a lower bound,
and the largest lower set inside a sup-closed set is again sup-closed.
Main definitions #
IsDistribSemilatticeSup α:αis a distributive join-semilattice.
A join-semilattice is distributive when every element below b ⊔ c is the join of an element
below b and an element below c.
- exists_sup_eq_of_le_sup {a b c : α} (h : a ≤ b ⊔ c) : ∃ b' ≤ b, ∃ c' ≤ c, b' ⊔ c' = a
An element below a join splits along the join.
Instances
The distributive law, in a lattice distributive as a semilattice.
The largest lower set inside a sup-closed set is sup-closed.