proposition: Lemma eseries_mkcondl {R : numFieldType} (f : (\bar R)^nat) P Q : \sum_(i <oo | P i && Q i) f i = \sum_(i <oo | Q i) if P i then f i else 0.
proof: Proof. by apply/congr_lim/funext => n; rewrite big_mkcondl. Qed.
imports: mathcomp(all_ssreflect ssralg ssrint ssrnum matrix) mathcomp(interval rat) mathcomp(mathcomp_extra boolp classical_sets functions) mathcomp(set_interval) reals ereal signed topology normedtype landau