Theorem seqeq123d 14066

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 14063	. 2 ⊢ (𝜑 → seq𝑀( + , 𝐹) = seq𝑁( + , 𝐹))
3		seqeq123d.2	. . 3 ⊢ (𝜑 → + = 𝑄)
4	3	seqeq2d 14064	. 2 ⊢ (𝜑 → seq𝑁( + , 𝐹) = seq𝑁(𝑄, 𝐹))
5		seqeq123d.3	. . 3 ⊢ (𝜑 → 𝐹 = 𝐺)
6	5	seqeq3d 14065	. 2 ⊢ (𝜑 → seq𝑁(𝑄, 𝐹) = seq𝑁(𝑄, 𝐺))
7	2, 4, 6	3eqtrd 2805	1 ⊢ (𝜑 → seq𝑀( + , 𝐹) = seq𝑁(𝑄, 𝐺))

This proof depends on syntax axioms:   → wi 4   = wceq 1570  seqcseq 14057

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2738

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-ral 3083  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-mpt 5198  df-xp 5672  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-pred 6309  df-iota 6499  df-fv 6551  df-ov 7426  df-oprab 7427  df-mpo 7428  df-frecs 8287  df-wrecs 8318  df-recs 8367  df-rdg 8406  df-seq 14058

This theorem is used by:  relexpsucnnr  15088  sseqval  34810  bj-finsumval0  37970  itcoval  49482