proposition: Lemma fin_somewhere_finite : forallb (fun f => bsomewhere_finite (trsInt f)) Fs = true -> forall f : sig, somewhere_finite (trsInt f).
proof: Proof. rewrite forallb_forall. intros H f. rewrite <- bsomewhere_finite_ok. apply H. apply Fs_ok. Qed.
imports: CoLoR(AArcticBasedInt Matrix OrdSemiRing VecUtil AMonAlg SN RelUtil NatUtil AWFMInterpretation LogicUtil AMatrixBasedInt BoolUtil ListUtil)