proposition: Lemma convE p (X Y : necset A) : conv p X Y = conv_set p X Y :> set A.
proof: Proof. by rewrite /conv; unlock. 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