proposition: Lemma d0' : forall (x : T), x \in finsupp d -> 0 < d x.
proof: Proof. by move => x xfsd; case/andP: Hd => /allP /(_ x xfsd). 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 mathcomp(measure probability)