proposition: Lemma conv_cset1 (p : {prob R}) (x y : A) : [set x] :<|p|>: [set y] = [set x <|p|> y].
proof: Proof. rewrite eqEsubset; split=> [u|u ->]; last exact: conv_in_conv_set. by case/conv_in_conv_set'=> x' [] y' [] -> [] -> ->. 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