Theorem seqeq1 10702

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

Assertion

Ref	Expression
seqeq1	⊢ (𝑀 = 𝑁 → seq𝑀( + , 𝐹) = seq𝑁( + , 𝐹))

Proof of Theorem seqeq1

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		id 19	. . . . . 6 ⊢ (𝑀 = 𝑁 → 𝑀 = 𝑁)
2		fveq2 5635	. . . . . 6 ⊢ (𝑀 = 𝑁 → (𝐹‘𝑀) = (𝐹‘𝑁))
3	1, 2	opeq12d 3868	. . . . 5 ⊢ (𝑀 = 𝑁 → ⟨𝑀, (𝐹‘𝑀)⟩ = ⟨𝑁, (𝐹‘𝑁)⟩)
4		freceq2 6554	. . . . 5 ⊢ (⟨𝑀, (𝐹‘𝑀)⟩ = ⟨𝑁, (𝐹‘𝑁)⟩ → frec((𝑥 ∈ (ℤ≥‘𝑀), 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑀, (𝐹‘𝑀)⟩) = frec((𝑥 ∈ (ℤ≥‘𝑀), 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑁, (𝐹‘𝑁)⟩))
5	3, 4	syl 14	. . . 4 ⊢ (𝑀 = 𝑁 → frec((𝑥 ∈ (ℤ≥‘𝑀), 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑀, (𝐹‘𝑀)⟩) = frec((𝑥 ∈ (ℤ≥‘𝑀), 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑁, (𝐹‘𝑁)⟩))
6		fveq2 5635	. . . . . 6 ⊢ (𝑀 = 𝑁 → (ℤ≥‘𝑀) = (ℤ≥‘𝑁))
7		eqid 2229	. . . . . 6 ⊢ V = V
8		mpoeq12 6076	. . . . . 6 ⊢ (((ℤ≥‘𝑀) = (ℤ≥‘𝑁) ∧ V = V) → (𝑥 ∈ (ℤ≥‘𝑀), 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩) = (𝑥 ∈ (ℤ≥‘𝑁), 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩))
9	6, 7, 8	sylancl 413	. . . . 5 ⊢ (𝑀 = 𝑁 → (𝑥 ∈ (ℤ≥‘𝑀), 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩) = (𝑥 ∈ (ℤ≥‘𝑁), 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩))
10		freceq1 6553	. . . . 5 ⊢ ((𝑥 ∈ (ℤ≥‘𝑀), 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩) = (𝑥 ∈ (ℤ≥‘𝑁), 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩) → frec((𝑥 ∈ (ℤ≥‘𝑀), 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑁, (𝐹‘𝑁)⟩) = frec((𝑥 ∈ (ℤ≥‘𝑁), 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑁, (𝐹‘𝑁)⟩))
11	9, 10	syl 14	. . . 4 ⊢ (𝑀 = 𝑁 → frec((𝑥 ∈ (ℤ≥‘𝑀), 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑁, (𝐹‘𝑁)⟩) = frec((𝑥 ∈ (ℤ≥‘𝑁), 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑁, (𝐹‘𝑁)⟩))
12	5, 11	eqtrd 2262	. . 3 ⊢ (𝑀 = 𝑁 → frec((𝑥 ∈ (ℤ≥‘𝑀), 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑀, (𝐹‘𝑀)⟩) = frec((𝑥 ∈ (ℤ≥‘𝑁), 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑁, (𝐹‘𝑁)⟩))
13	12	rneqd 4959	. 2 ⊢ (𝑀 = 𝑁 → ran frec((𝑥 ∈ (ℤ≥‘𝑀), 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑀, (𝐹‘𝑀)⟩) = ran frec((𝑥 ∈ (ℤ≥‘𝑁), 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑁, (𝐹‘𝑁)⟩))
14		df-seqfrec 10700	. 2 ⊢ seq𝑀( + , 𝐹) = ran frec((𝑥 ∈ (ℤ≥‘𝑀), 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑀, (𝐹‘𝑀)⟩)
15		df-seqfrec 10700	. 2 ⊢ seq𝑁( + , 𝐹) = ran frec((𝑥 ∈ (ℤ≥‘𝑁), 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑁, (𝐹‘𝑁)⟩)
16	13, 14, 15	3eqtr4g 2287	1 ⊢ (𝑀 = 𝑁 → seq𝑀( + , 𝐹) = seq𝑁( + , 𝐹))

Syntax hints:   → wi 4   = wceq 1395  Vcvv 2800  ⟨cop 3670  ran crn 4724  ‘cfv 5324  (class class class)co 6013   ∈ cmpo 6015  freccfrec 6551  1c1 8023   + caddc 8025  ℤ_≥cuz 9745  seqcseq 10699

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2802  df-un 3202  df-in 3204  df-ss 3211  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-br 4087  df-opab 4149  df-mpt 4150  df-cnv 4731  df-dm 4733  df-rn 4734  df-res 4735  df-iota 5284  df-fv 5332  df-oprab 6017  df-mpo 6018  df-recs 6466  df-frec 6552  df-seqfrec 10700

This theorem is referenced by:  seqeq1d  10705  seq3f1olemqsum  10765  seqf1oglem2  10772  seq3id  10777  seq3z  10780  iserex  11890  summodclem2  11933  summodc  11934  zsumdc  11935  isumsplit  12042  ntrivcvgap  12099  ntrivcvgap0  12100  prodmodclem2  12128  prodmodc  12129  zproddc  12130  fprodntrivap  12135  ege2le3  12222  gsumfzval  13464  gsumval2  13470