Theorem seqeq123d 14183

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

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

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735

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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5172  df-mpt 5191  df-xp 5662  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-pred 6325  df-iota 6515  df-fv 6569  df-ov 7449  df-oprab 7450  df-mpo 7451  df-frecs 8330  df-wrecs 8361  df-recs 8410  df-rdg 8449  df-seq 14175

This theorem is used by:  relexpsucnnr  15210  sseqval  35103  bj-finsumval0  38411  itcoval  49988