proposition: Lemma sum_fine (I : Type) s (P : pred I) (F : I -> \bar R) : (forall i, P i -> F i \is a fin_num) -> (\sum_(i <- s | P i) fine (F i) = fine (\sum_(i <- s | P i) F i))%R.
proof: Proof. by move=> h; rewrite -EFin_sum_fine. Qed.
imports: HB(structures) mathcomp(all_ssreflect all_algebra finmap) mathcomp(mathcomp_extra) signed