proposition: Lemma fsdist1bind (A B : choiceType) (a : A) (f : A -> {dist B}) : fsdist1 a >>= f = f a.
proof: Proof. apply/val_inj/val_inj => /=; congr fmap_of_fsfun; apply/fsfunP => b. by rewrite fsdistbindE supp_fsdist1 big_seq_fset1 fsdist1xx mul1R. Qed.
imports: HB(structures) mathcomp(all_ssreflect ssralg ssrnum) mathcomp(finmap) Reals mathcomp(mathcomp_extra) mathcomp(classical_sets boolp cardinality Rstruct reals) mathcomp(ereal topology esum measure probability) ssrR realType_ext Reals_ext ssr_ext ssralg_ext bigop_ext fdist convex