Proof
fun (P : Ens -> Prop) (A : Ens) (h : Bounded_By A P) => Bounded_th1 P A h.
Definition Bounded_CHOICE (P : Ens -> Prop) := REPLACEMENT P.

Theorem Bounded_CHOICE_pr :
forall (P : Ens -> Prop) (b : Bounded P), Bounded_By (Bounded_CHOICE P) P.