proposition: Lemma sumList_body_eq : forall (A : Set)(ls : list A)(f1 f2 : A -> Rat), (forall a, In a ls -> f1 a == f2 a) -> sumList ls f1 == sumList ls f2.
proof: Proof. intuition. eapply fold_add_body_eq; intuition. Qed.
imports: FCF.Rat List Permutation Arith FCF.EqDec FCF.StdNat Bool