proposition: Lemma conv_in_oplus_conv_set p (X Y : set A) x y : X x -> Y y -> (oplus_conv_set X Y) (x <|p|> y).
proof: Proof. by move=> *; exists p=> //; exact: conv_in_conv_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