fact: Definition is_least_upper_bound_pointwise {X:UU} {P : X -> Poset} {I} (f : I -> forall_Poset P) (g : forall_Poset P) : hProp := ∀ x, is_least_upper_bound (fun i => f i x) (g x).
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.Combinatorics.WellOrderedSets UniMath.OrderTheory.DCPOs.AlternativeDefinitions.Dcpo