induction ls; intuition.
unfold rat_inf_limit, inf_limit.
intuition.
exists O.
intuition.
inversion H4; clear H4; subst.
unfold sumList.
simpl.
rewrite H5.
eapply leRat_trans.
eapply eqRat_impl_leRat.
rewrite <- ratIdentityIndiscernables.
intuition.
eapply rat0_le_all.
eapply (@rat_inf_limit_trans _ (fun n : nat => ratAdd_rel (f1 a n) (sumList_rel (fun a0 : A => f1 a0 n) ls))).
unfold rat_inf_limit_2, inf_limit_2.
intuition.
exists O.
intuition.
inversion H5; clear H5; subst.
unfold ratAdd_rel in *.
rewrite H6.
rewrite H12.
eapply leRat_trans.
eapply eqRat_impl_leRat.
rewrite <- ratIdentityIndiscernables.
eapply eqRat_refl.
eapply rat0_le_all.
trivial.
trivial.
eapply rat_inf_limit_eq.
eapply rat_inf_limit_sum.
eauto.
unfold left_total; intuition.
eapply sumList_rel_left_total.
intuition.
eapply H0.
eapply H.
eauto.
unfold sumList.
simpl.
symmetry.
rewrite fold_add_body_eq; [idtac | eapply ratAdd_comm | idtac].
rewrite fold_add_init.
eapply eqRat_refl.
intuition.
unfold left_total; intuition.
eapply ratAdd_rel_left_total.
eapply H0.
eapply sumList_rel_left_total.
intuition.
eapply H0.
eauto.
intuition.
eapply sumList_rel_func; eauto.
intuition.
eauto.
Qed.

(* Specifications: *)
Lemma ratInverse_continuous : forall c,
~ c == 0 ->
continuous_at (fun v' r : Rat => r == ratInverse v') c.