fact: Definition least_upper_bound_univ {I} {p : I -> P} (x : least_upper_bound p) (x' : P) : x ≤ x' <-> isupperbound p x'.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.Combinatorics.WellOrderedSets UniMath.OrderTheory.DCPOs.AlternativeDefinitions.Dcpo