proposition: Lemma iter_conv_set_superset (X : neset A) n : X `<=` iter_conv_set X n .
proof: Proof. move=> x Xx; elim: n => // n IHn; rewrite iterS_conv_set. by exists 1%:pr => //; rewrite conv1_set. Qed.
imports: HB(structures) Reals mathcomp(all_ssreflect ssralg ssrnum) mathcomp(mathcomp_extra boolp classical_sets Rstruct reals) mathcomp(finmap) Reals_ext realType_ext classical_sets_ext ssrR fdist fsdist convex