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