proposition: Lemma dE a : d a = if a \in [fset s b | b in finsupp P] then P (r a) else 0.
proof: Proof. by rewrite /d; unlock => /=; rewrite fsfunE. 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