Theorem seqval 13984

Description: Value of the sequence builder function. (Contributed by Mario Carneiro, 24-Jun-2013.)

Hypothesis

Ref	Expression
seqval.1	⊢ 𝑅 = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑥(𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1))))𝑦)⟩), ⟨𝑀, (𝐹‘𝑀)⟩) ↾ ω)

Assertion

Ref	Expression
seqval	⊢ seq𝑀( + , 𝐹) = ran 𝑅

Distinct variable groups:   𝑤,𝐹,𝑥,𝑦,𝑧   𝑤, + ,𝑥,𝑦,𝑧   𝑥,𝑀,𝑦

Allowed substitution hints:   𝑅(𝑥,𝑦,𝑧,𝑤)   𝑀(𝑧,𝑤)

Proof of Theorem seqval

Step	Hyp	Ref	Expression
1		df-ima 5689	. 2 ⊢ (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑀, (𝐹‘𝑀)⟩) “ ω) = ran (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑀, (𝐹‘𝑀)⟩) ↾ ω)
2		df-seq 13974	. 2 ⊢ seq𝑀( + , 𝐹) = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑀, (𝐹‘𝑀)⟩) “ ω)
3		seqval.1	. . . 4 ⊢ 𝑅 = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑥(𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1))))𝑦)⟩), ⟨𝑀, (𝐹‘𝑀)⟩) ↾ ω)
4		eqid 2731	. . . . . . 7 ⊢ V = V
5		fvoveq1 7435	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑥 → (𝐹‘(𝑧 + 1)) = (𝐹‘(𝑥 + 1)))
6	5	oveq2d 7428	. . . . . . . . . 10 ⊢ (𝑧 = 𝑥 → (𝑤 + (𝐹‘(𝑧 + 1))) = (𝑤 + (𝐹‘(𝑥 + 1))))
7		oveq1 7419	. . . . . . . . . 10 ⊢ (𝑤 = 𝑦 → (𝑤 + (𝐹‘(𝑥 + 1))) = (𝑦 + (𝐹‘(𝑥 + 1))))
8		eqid 2731	. . . . . . . . . 10 ⊢ (𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1)))) = (𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1))))
9		ovex 7445	. . . . . . . . . 10 ⊢ (𝑦 + (𝐹‘(𝑥 + 1))) ∈ V
10	6, 7, 8, 9	ovmpo 7571	. . . . . . . . 9 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V) → (𝑥(𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1))))𝑦) = (𝑦 + (𝐹‘(𝑥 + 1))))
11	10	el2v 3481	. . . . . . . 8 ⊢ (𝑥(𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1))))𝑦) = (𝑦 + (𝐹‘(𝑥 + 1)))
12	11	opeq2i 4877	. . . . . . 7 ⊢ ⟨(𝑥 + 1), (𝑥(𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1))))𝑦)⟩ = ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩
13	4, 4, 12	mpoeq123i 7488	. . . . . 6 ⊢ (𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑥(𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1))))𝑦)⟩) = (𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩)
14		rdgeq1 8417	. . . . . 6 ⊢ ((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑥(𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1))))𝑦)⟩) = (𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩) → rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑥(𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1))))𝑦)⟩), ⟨𝑀, (𝐹‘𝑀)⟩) = rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑀, (𝐹‘𝑀)⟩))
15	13, 14	ax-mp 5	. . . . 5 ⊢ rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑥(𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1))))𝑦)⟩), ⟨𝑀, (𝐹‘𝑀)⟩) = rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑀, (𝐹‘𝑀)⟩)
16	15	reseq1i 5977	. . . 4 ⊢ (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑥(𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1))))𝑦)⟩), ⟨𝑀, (𝐹‘𝑀)⟩) ↾ ω) = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑀, (𝐹‘𝑀)⟩) ↾ ω)
17	3, 16	eqtri 2759	. . 3 ⊢ 𝑅 = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑀, (𝐹‘𝑀)⟩) ↾ ω)
18	17	rneqi 5936	. 2 ⊢ ran 𝑅 = ran (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑀, (𝐹‘𝑀)⟩) ↾ ω)
19	1, 2, 18	3eqtr4i 2769	1 ⊢ seq𝑀( + , 𝐹) = ran 𝑅

Syntax hints:   = wceq 1540  Vcvv 3473  ⟨cop 4634  ran crn 5677   ↾ cres 5678   “ cima 5679  ‘cfv 6543  (class class class)co 7412   ∈ cmpo 7414  ωcom 7859  reccrdg 8415  1c1 11117   + caddc 11119  seqcseq 13973

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2702  ax-sep 5299  ax-nul 5306  ax-pr 5427

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-rab 3432  df-v 3475  df-sbc 3778  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5574  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-pred 6300  df-iota 6495  df-fun 6545  df-fv 6551  df-ov 7415  df-oprab 7416  df-mpo 7417  df-frecs 8272  df-wrecs 8303  df-recs 8377  df-rdg 8416  df-seq 13974

This theorem is referenced by:  seqfn  13985  seq1  13986  seqp1  13988