Covers of lower sets #
In a well-founded partial order, a lower set covers another exactly when it adds a single element,
and that element is maximal in it. This is the lower-set counterpart of mathlib's
Set.covBy_iff_exists_insert. [UPSTREAM] candidate for Mathlib/Order/UpperLower/.
Main results #
LowerSet.covBy_iff_exists_insert:s ⋖ tifftisswith one element added.LowerSet.maximal_of_coe_eq_insert: the element added is maximal int.
theorem
LowerSet.maximal_of_coe_eq_insert
{α : Type u_1}
[PartialOrder α]
{s t : LowerSet α}
{a : α}
(ha : a ∉ s)
(ht : ↑t = insert a ↑s)
:
Maximal (fun (x : α) => x ∈ t) a
An element added to a lower set to give a lower set is maximal in it.
theorem
LowerSet.covBy_iff_exists_insert
{α : Type u_1}
[PartialOrder α]
{s t : LowerSet α}
[WellFoundedLT α]
:
s ⋖ t ↔ ∃ a ∉ s, ↑t = insert a ↑s