proposition: Lemma cvg_mulnl N : (N > 0)%N -> muln N @ \oo --> \oo.
proof: Proof. case: N => N // _ P [n _ Pn]; exists (n %/ N.+1).+1 => // m. by rewrite /= ltn_divLR// => n_lt; apply: Pn; rewrite mulnC /= ltnW. Qed.
imports: HB(structures) mathcomp(all_ssreflect all_algebra finmap generic_quotient) mathcomp(boolp classical_sets functions) mathcomp(cardinality mathcomp_extra fsbigop) reals signed