fact: Definition is_least_upper_bound {I} (p : I -> P) (x : P) : hProp := is_least_suchthat (isupperbound_hprop p) x.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.Combinatorics.WellOrderedSets UniMath.OrderTheory.DCPOs.AlternativeDefinitions.Dcpo