proposition: Lemma iter_bigcup_conv_set (X : neset A) (n : nat) : iter_conv_set X n `<=` \bigcup_(i in natset) iter_conv_set X i.
proof: Proof. by move=> a H; exists n. 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