Metamath Proof Explorer


Theorem seqfeq

Description: Equality of sequences. (Contributed by Mario Carneiro, 13-Jul-2013) (Revised by Mario Carneiro, 27-May-2014)

Ref Expression
Hypotheses seqfeq.1 ⊢ φ → M ∈ ℤ
seqfeq.2 ⊢ φ ∧ k ∈ ℤ ≥ M → F ⁡ k = G ⁡ k
Assertion seqfeq ⊢ φ → seq M + ˙ F = seq M + ˙ G

Proof

Step Hyp Ref Expression
1 seqfeq.1 ⊢ φ → M ∈ ℤ
2 seqfeq.2 ⊢ φ ∧ k ∈ ℤ ≥ M → F ⁡ k = G ⁡ k
3 seqfn ⊢ M ∈ ℤ → seq M + ˙ F Fn ℤ ≥ M
4 1 3 syl ⊢ φ → seq M + ˙ F Fn ℤ ≥ M
5 seqfn ⊢ M ∈ ℤ → seq M + ˙ G Fn ℤ ≥ M
6 1 5 syl ⊢ φ → seq M + ˙ G Fn ℤ ≥ M
7 simpr ⊢ φ ∧ x ∈ ℤ ≥ M → x ∈ ℤ ≥ M
8 elfzuz ⊢ k ∈ M … x → k ∈ ℤ ≥ M
9 8 2 sylan2 ⊢ φ ∧ k ∈ M … x → F ⁡ k = G ⁡ k
10 9 adantlr ⊢ φ ∧ x ∈ ℤ ≥ M ∧ k ∈ M … x → F ⁡ k = G ⁡ k
11 7 10 seqfveq ⊢ φ ∧ x ∈ ℤ ≥ M → seq M + ˙ F ⁡ x = seq M + ˙ G ⁡ x
12 4 6 11 eqfnfvd ⊢ φ → seq M + ˙ F = seq M + ˙ G