fact: Definition least_upper_bound_subtype_univ {A : hsubtype P} (x : least_upper_bound (pr1carrier A)) (x' : P) : x ≤ x' <-> (forall y, A y -> y ≤ x').
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.Combinatorics.WellOrderedSets UniMath.OrderTheory.DCPOs.AlternativeDefinitions.Dcpo