Theorem seqeq123d 14157

Description: Equality deduction for the sequence builder operation. (Contributed by Mario Carneiro, 7-Sep-2013.)

Hypotheses

Ref	Expression
seqeq123d.1	⊢ (𝜑 → 𝑀 = 𝑁)
seqeq123d.2	⊢ (𝜑 → + = 𝑄)
seqeq123d.3	⊢ (𝜑 → 𝐹 = 𝐺)

Assertion

Ref	Expression
seqeq123d	⊢ (𝜑 → seq𝑀( + , 𝐹) = seq𝑁(𝑄, 𝐺))

Proof of Theorem seqeq123d

Step	Hyp	Ref	Expression
1		seqeq123d.1	. . 3 ⊢ (𝜑 → 𝑀 = 𝑁)
2	1	seqeq1d 14154	. 2 ⊢ (𝜑 → seq𝑀( + , 𝐹) = seq𝑁( + , 𝐹))
3		seqeq123d.2	. . 3 ⊢ (𝜑 → + = 𝑄)
4	3	seqeq2d 14155	. 2 ⊢ (𝜑 → seq𝑁( + , 𝐹) = seq𝑁(𝑄, 𝐹))
5		seqeq123d.3	. . 3 ⊢ (𝜑 → 𝐹 = 𝐺)
6	5	seqeq3d 14156	. 2 ⊢ (𝜑 → seq𝑁(𝑄, 𝐹) = seq𝑁(𝑄, 𝐺))
7	2, 4, 6	3eqtrd 2799	1 ⊢ (𝜑 → seq𝑀( + , 𝐹) = seq𝑁(𝑄, 𝐺))

This proof depends on syntax axioms:   → wi 4   = wceq 1569  seqcseq 14148

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-xp 5656  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-iota 6494  df-fv 6547  df-ov 7424  df-oprab 7425  df-mpo 7426  df-frecs 8303  df-wrecs 8334  df-recs 8383  df-rdg 8422  df-seq 14149

This theorem is used by:  relexpsucnnr  15184  sseqval  35067  bj-finsumval0  38300  itcoval  49867