proposition: Lemma Rseq_equiv_eq : forall Un Vn, {m | forall n, (n >= m)%nat -> Un n = Vn n} -> Un ~ Vn.
proof: Proof. intros Un Vn Heq eps Heps. destruct Heq as (N, Heq). exists N. intros n HN. unfold Rseq_constant, Rseq_minus, Rseq_plus. rewrite (Heq n). ring_simplify (Vn n - Vn n). rewrite Rabs_R0. apply Rmult_le_pos. intuition. apply Rabs_pos. assumption. Qed.
imports: PeanoNat Reals Rintegral Rintegral_usual Rintegral_tactic Lia Lra Rsequence_facts Rsequence_subsequence Rpser RTaylor MyRfunctions Rsequence_tactics