proposition: Lemma summableMr (S1 S2 : T -> R) : (exists M, forall x, `|S2 x| <= M) -> summable S1 -> summable (S1 \* S2).
proof: Proof. by move=> bd sm; apply/summable_mulrC/summableMl. Qed.
imports: mathcomp(all_ssreflect all_algebra) mathcomp.classical(boolp) xfinmap ereal reals discrete realseq mathcomp.classical(classical_sets functions mathcomp_extra) topology