Maps out of a powerset that preserve suprema #
A powerset is the free complete lattice on its members: a map out of it preserves suprema exactly
when it is the supremum of its values on singletons. [UPSTREAM] candidate for
Mathlib/Data/Set/Lattice/Order.lean, beside iSup_sUnion.
theorem
Set.forall_map_sSup_iff
{α : Type u_1}
{β : Type u_2}
[CompleteLattice β]
{f : Set α → β}
:
(∀ (T : Set (Set α)), f (sSup T) = ⨆ t ∈ T, f t) ↔ ∀ (s : Set α), f s = ⨆ a ∈ s, f {a}