proposition: Lemma emeasurable_fun_fsum D (I : choiceType) (A : set I) (h : I -> (T -> \bar R)) : finite_set A -> (forall n, measurable_fun D (h n)) -> measurable_fun D (fun x => \sum_(i \in A) h i x).
proof: Proof. move=> fs mh; under eq_fun do rewrite fsbig_finite//. exact: emeasurable_fun_sum. Qed.
imports: HB(structures) mathcomp(all_ssreflect ssralg ssrnum ssrint interval finmap) mathcomp(mathcomp_extra boolp classical_sets functions) mathcomp(cardinality fsbigop ) signed reals ereal topology normedtype sequences real_interval esum measure lebesgue_measure numfun