proposition: Lemma conv_setE p (X Y : set A) : X :<| p |>: Y = \bigcup_(x in X) (x <| p |>: Y).
proof: Proof. by []. 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