proposition: Lemma summable_eq {A : choiceType} {s : A} : realsum.summable (T:=A) (R:=R) (λ x, (x == s)%:R).
proof: Proof. match goal with | |- realsum.summable ?f => eassert (f = _) as Hf end. { extensionality x. rewrite eq_sym. rewrite -dunit1E. reflexivity. } rewrite Hf. clear Hf. apply summable_mu. Qed.
imports: Coq(Utf8) Relational(OrderEnrichedCategory OrderEnrichedRelativeMonadExamples) mathcomp(ssrnat ssreflect ssrfun ssrbool ssrnum eqtype choice reals distr seq all_algebra fintype realsum) extructures(ord fset fmap) Mon(SPropBase) Crypt(Prelude Axioms ChoiceAsOrd SubDistr Couplings RulesStateProb UniformStateProb UniformDistrLemmas StateTransfThetaDens StateTransformingLaxMorph choice_type pkg_core_definition pkg_notation pkg_tactics pkg_composition pkg_heap pkg_semantics pkg_lookup pkg_advantage pkg_invariants pkg_distr) Equations.Prop.DepElim Equations(Equations) Crypt(FreeProbProg)