Definition make_least_suchthat {A : P -> hProp} (x : P) (x_least : is_least_suchthat A x) : least_suchthat A. Proof. use tpair. { exists x. apply x_least. } apply x_least. Defined.
Require Import UniMath.Foundations.All. Require Import UniMath.MoreFoundations.All. Require Import UniMath.OrderTheory.OrderedSets.WellOrderedSets. Require Import UniMath.OrderTheory.DCPOs.AlternativeDefinitions.Dcpo. Require Import UniMath.OrderTheory.Posets.Subposets.