Theorem noseqrdgsuc 28709

Description: Successor value of a recursive definition generator on surreal sequences. (Contributed by Scott Fenton, 19-Apr-2025.)

Hypotheses

Ref	Expression
om2noseq.1	⊢ (𝜑 → 𝐶 ∈ No)
om2noseq.2	⊢ (𝜑 → 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω))
om2noseq.3	⊢ (𝜑 → 𝑍 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) “ ω))
noseqrdg.1	⊢ (𝜑 → 𝐴 ∈ 𝑉)
noseqrdg.2	⊢ (𝜑 → 𝑅 = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω))
noseqrdg.3	⊢ (𝜑 → 𝑆 = ran 𝑅)

Assertion

Ref	Expression
noseqrdgsuc	⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝑆‘(𝐵 +s 1s )) = (𝐵𝐹(𝑆‘𝐵)))

Distinct variable groups:   𝑥,𝐶   𝑥,𝐹,𝑦   𝑥,𝐵

Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝐴(𝑥, 𝑦)   𝐵(𝑦)   𝐶(𝑦)   𝑅(𝑥, 𝑦)   𝑆(𝑥, 𝑦)   𝐺(𝑥, 𝑦)   𝑉(𝑥, 𝑦)   𝑍(𝑥, 𝑦)

Proof of Theorem noseqrdgsuc

Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		om2noseq.1	. . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ No)
2		om2noseq.2	. . . . . . 7 ⊢ (𝜑 → 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω))
3		om2noseq.3	. . . . . . 7 ⊢ (𝜑 → 𝑍 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) “ ω))
4		noseqrdg.1	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
5		noseqrdg.2	. . . . . . 7 ⊢ (𝜑 → 𝑅 = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω))
6		noseqrdg.3	. . . . . . 7 ⊢ (𝜑 → 𝑆 = ran 𝑅)
7	1, 2, 3, 4, 5, 6	noseqrdgfn 28707	. . . . . 6 ⊢ (𝜑 → 𝑆 Fn 𝑍)
8	7	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → 𝑆 Fn 𝑍)
9	8	fnfund 6651	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → Fun 𝑆)
10	3	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → 𝑍 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) “ ω))
11	1	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → 𝐶 ∈ No)
12		simpr 490	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → 𝐵 ∈ 𝑍)
13	10, 11, 12	noseqp1 28692	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝐵 +s 1s ) ∈ 𝑍)
14	1, 2, 3, 4, 5	noseqrdglem 28706	. . . . . 6 ⊢ ((𝜑 ∧ (𝐵 +s 1s ) ∈ 𝑍) → ⟨(𝐵 +s 1s ), (2nd ‘(𝑅‘(◡𝐺‘(𝐵 +s 1s ))))⟩ ∈ ran 𝑅)
15	13, 14	syldan 603	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → ⟨(𝐵 +s 1s ), (2nd ‘(𝑅‘(◡𝐺‘(𝐵 +s 1s ))))⟩ ∈ ran 𝑅)
16	6	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → 𝑆 = ran 𝑅)
17	15, 16	eleqtrrd 2867	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → ⟨(𝐵 +s 1s ), (2nd ‘(𝑅‘(◡𝐺‘(𝐵 +s 1s ))))⟩ ∈ 𝑆)
18		funopfv 6945	. . . 4 ⊢ (Fun 𝑆 → (⟨(𝐵 +s 1s ), (2nd ‘(𝑅‘(◡𝐺‘(𝐵 +s 1s ))))⟩ ∈ 𝑆 → (𝑆‘(𝐵 +s 1s )) = (2nd ‘(𝑅‘(◡𝐺‘(𝐵 +s 1s ))))))
19	9, 17, 18	sylc 66	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝑆‘(𝐵 +s 1s )) = (2nd ‘(𝑅‘(◡𝐺‘(𝐵 +s 1s )))))
20	1, 2, 3	om2noseqf1o 28702	. . . . . . . 8 ⊢ (𝜑 → 𝐺:ω–1-1-onto→𝑍)
21	20	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → 𝐺:ω–1-1-onto→𝑍)
22		f1ocnvdm 7303	. . . . . . . . 9 ⊢ ((𝐺:ω–1-1-onto→𝑍 ∧ 𝐵 ∈ 𝑍) → (◡𝐺‘𝐵) ∈ ω)
23	20, 22	sylan 592	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → (◡𝐺‘𝐵) ∈ ω)
24		peano2 7911	. . . . . . . 8 ⊢ ((◡𝐺‘𝐵) ∈ ω → suc (◡𝐺‘𝐵) ∈ ω)
25	23, 24	syl 18	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → suc (◡𝐺‘𝐵) ∈ ω)
26	21, 25	jca 521	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝐺:ω–1-1-onto→𝑍 ∧ suc (◡𝐺‘𝐵) ∈ ω))
27	2	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω))
28	11, 27, 23	om2noseqsuc 28698	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝐺‘suc (◡𝐺‘𝐵)) = ((𝐺‘(◡𝐺‘𝐵)) +s 1s ))
29		f1ocnvfv2 7295	. . . . . . . . 9 ⊢ ((𝐺:ω–1-1-onto→𝑍 ∧ 𝐵 ∈ 𝑍) → (𝐺‘(◡𝐺‘𝐵)) = 𝐵)
30	20, 29	sylan 592	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝐺‘(◡𝐺‘𝐵)) = 𝐵)
31	30	oveq1d 7445	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → ((𝐺‘(◡𝐺‘𝐵)) +s 1s ) = (𝐵 +s 1s ))
32	28, 31	eqtrd 2798	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝐺‘suc (◡𝐺‘𝐵)) = (𝐵 +s 1s ))
33		f1ocnvfv 7296	. . . . . 6 ⊢ ((𝐺:ω–1-1-onto→𝑍 ∧ suc (◡𝐺‘𝐵) ∈ ω) → ((𝐺‘suc (◡𝐺‘𝐵)) = (𝐵 +s 1s ) → (◡𝐺‘(𝐵 +s 1s )) = suc (◡𝐺‘𝐵)))
34	26, 32, 33	sylc 66	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → (◡𝐺‘(𝐵 +s 1s )) = suc (◡𝐺‘𝐵))
35	34	fveq2d 6900	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝑅‘(◡𝐺‘(𝐵 +s 1s ))) = (𝑅‘suc (◡𝐺‘𝐵)))
36	35	fveq2d 6900	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → (2nd ‘(𝑅‘(◡𝐺‘(𝐵 +s 1s )))) = (2nd ‘(𝑅‘suc (◡𝐺‘𝐵))))
37	19, 36	eqtrd 2798	. 2 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝑆‘(𝐵 +s 1s )) = (2nd ‘(𝑅‘suc (◡𝐺‘𝐵))))
38		frsuc 8459	. . . . . . . . 9 ⊢ ((◡𝐺‘𝐵) ∈ ω → ((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)‘suc (◡𝐺‘𝐵)) = ((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩)‘((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)‘(◡𝐺‘𝐵))))
39	38	adantl 487	. . . . . . . 8 ⊢ ((𝜑 ∧ (◡𝐺‘𝐵) ∈ ω) → ((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)‘suc (◡𝐺‘𝐵)) = ((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩)‘((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)‘(◡𝐺‘𝐵))))
40	5	fveq1d 6898	. . . . . . . . 9 ⊢ (𝜑 → (𝑅‘suc (◡𝐺‘𝐵)) = ((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)‘suc (◡𝐺‘𝐵)))
41	40	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ (◡𝐺‘𝐵) ∈ ω) → (𝑅‘suc (◡𝐺‘𝐵)) = ((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)‘suc (◡𝐺‘𝐵)))
42	5	fveq1d 6898	. . . . . . . . . 10 ⊢ (𝜑 → (𝑅‘(◡𝐺‘𝐵)) = ((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)‘(◡𝐺‘𝐵)))
43	42	fveq2d 6900	. . . . . . . . 9 ⊢ (𝜑 → ((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩)‘(𝑅‘(◡𝐺‘𝐵))) = ((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩)‘((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)‘(◡𝐺‘𝐵))))
44	43	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ (◡𝐺‘𝐵) ∈ ω) → ((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩)‘(𝑅‘(◡𝐺‘𝐵))) = ((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩)‘((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)‘(◡𝐺‘𝐵))))
45	39, 41, 44	3eqtr4d 2808	. . . . . . 7 ⊢ ((𝜑 ∧ (◡𝐺‘𝐵) ∈ ω) → (𝑅‘suc (◡𝐺‘𝐵)) = ((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩)‘(𝑅‘(◡𝐺‘𝐵))))
46	1, 2, 3, 4, 5	om2noseqrdg 28705	. . . . . . . . 9 ⊢ ((𝜑 ∧ (◡𝐺‘𝐵) ∈ ω) → (𝑅‘(◡𝐺‘𝐵)) = ⟨(𝐺‘(◡𝐺‘𝐵)), (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩)
47	46	fveq2d 6900	. . . . . . . 8 ⊢ ((𝜑 ∧ (◡𝐺‘𝐵) ∈ ω) → ((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩)‘(𝑅‘(◡𝐺‘𝐵))) = ((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩)‘⟨(𝐺‘(◡𝐺‘𝐵)), (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩))
48		df-ov 7433	. . . . . . . 8 ⊢ ((𝐺‘(◡𝐺‘𝐵))(𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩)(2nd ‘(𝑅‘(◡𝐺‘𝐵)))) = ((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩)‘⟨(𝐺‘(◡𝐺‘𝐵)), (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩)
49	47, 48	eqtr4di 2816	. . . . . . 7 ⊢ ((𝜑 ∧ (◡𝐺‘𝐵) ∈ ω) → ((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩)‘(𝑅‘(◡𝐺‘𝐵))) = ((𝐺‘(◡𝐺‘𝐵))(𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩)(2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
50	45, 49	eqtrd 2798	. . . . . 6 ⊢ ((𝜑 ∧ (◡𝐺‘𝐵) ∈ ω) → (𝑅‘suc (◡𝐺‘𝐵)) = ((𝐺‘(◡𝐺‘𝐵))(𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩)(2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
51		fvex 6909	. . . . . . 7 ⊢ (𝐺‘(◡𝐺‘𝐵)) ∈ V
52		fvex 6909	. . . . . . 7 ⊢ (2nd ‘(𝑅‘(◡𝐺‘𝐵))) ∈ V
53		oveq1 7437	. . . . . . . . 9 ⊢ (𝑧 = (𝐺‘(◡𝐺‘𝐵)) → (𝑧 +s 1s ) = ((𝐺‘(◡𝐺‘𝐵)) +s 1s ))
54		oveq1 7437	. . . . . . . . 9 ⊢ (𝑧 = (𝐺‘(◡𝐺‘𝐵)) → (𝑧𝐹𝑤) = ((𝐺‘(◡𝐺‘𝐵))𝐹𝑤))
55	53, 54	opeq12d 4851	. . . . . . . 8 ⊢ (𝑧 = (𝐺‘(◡𝐺‘𝐵)) → ⟨(𝑧 +s 1s ), (𝑧𝐹𝑤)⟩ = ⟨((𝐺‘(◡𝐺‘𝐵)) +s 1s ), ((𝐺‘(◡𝐺‘𝐵))𝐹𝑤)⟩)
56		oveq2 7438	. . . . . . . . 9 ⊢ (𝑤 = (2nd ‘(𝑅‘(◡𝐺‘𝐵))) → ((𝐺‘(◡𝐺‘𝐵))𝐹𝑤) = ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
57	56	opeq2d 4850	. . . . . . . 8 ⊢ (𝑤 = (2nd ‘(𝑅‘(◡𝐺‘𝐵))) → ⟨((𝐺‘(◡𝐺‘𝐵)) +s 1s ), ((𝐺‘(◡𝐺‘𝐵))𝐹𝑤)⟩ = ⟨((𝐺‘(◡𝐺‘𝐵)) +s 1s ), ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩)
58		oveq1 7437	. . . . . . . . . 10 ⊢ (𝑥 = 𝑧 → (𝑥 +s 1s ) = (𝑧 +s 1s ))
59		oveq1 7437	. . . . . . . . . 10 ⊢ (𝑥 = 𝑧 → (𝑥𝐹𝑦) = (𝑧𝐹𝑦))
60	58, 59	opeq12d 4851	. . . . . . . . 9 ⊢ (𝑥 = 𝑧 → ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩ = ⟨(𝑧 +s 1s ), (𝑧𝐹𝑦)⟩)
61		oveq2 7438	. . . . . . . . . 10 ⊢ (𝑦 = 𝑤 → (𝑧𝐹𝑦) = (𝑧𝐹𝑤))
62	61	opeq2d 4850	. . . . . . . . 9 ⊢ (𝑦 = 𝑤 → ⟨(𝑧 +s 1s ), (𝑧𝐹𝑦)⟩ = ⟨(𝑧 +s 1s ), (𝑧𝐹𝑤)⟩)
63	60, 62	cbvmpov 7525	. . . . . . . 8 ⊢ (𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩) = (𝑧 ∈ V, 𝑤 ∈ V ↦ ⟨(𝑧 +s 1s ), (𝑧𝐹𝑤)⟩)
64		opex 5436	. . . . . . . 8 ⊢ ⟨((𝐺‘(◡𝐺‘𝐵)) +s 1s ), ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩ ∈ V
65	55, 57, 63, 64	ovmpo 7590	. . . . . . 7 ⊢ (((𝐺‘(◡𝐺‘𝐵)) ∈ V ∧ (2nd ‘(𝑅‘(◡𝐺‘𝐵))) ∈ V) → ((𝐺‘(◡𝐺‘𝐵))(𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩)(2nd ‘(𝑅‘(◡𝐺‘𝐵)))) = ⟨((𝐺‘(◡𝐺‘𝐵)) +s 1s ), ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩)
66	51, 52, 65	mp2an 705	. . . . . 6 ⊢ ((𝐺‘(◡𝐺‘𝐵))(𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩)(2nd ‘(𝑅‘(◡𝐺‘𝐵)))) = ⟨((𝐺‘(◡𝐺‘𝐵)) +s 1s ), ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩
67	50, 66	eqtrdi 2814	. . . . 5 ⊢ ((𝜑 ∧ (◡𝐺‘𝐵) ∈ ω) → (𝑅‘suc (◡𝐺‘𝐵)) = ⟨((𝐺‘(◡𝐺‘𝐵)) +s 1s ), ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩)
68	67	fveq2d 6900	. . . 4 ⊢ ((𝜑 ∧ (◡𝐺‘𝐵) ∈ ω) → (2nd ‘(𝑅‘suc (◡𝐺‘𝐵))) = (2nd ‘⟨((𝐺‘(◡𝐺‘𝐵)) +s 1s ), ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩))
69		ovex 7463	. . . . 5 ⊢ ((𝐺‘(◡𝐺‘𝐵)) +s 1s ) ∈ V
70		ovex 7463	. . . . 5 ⊢ ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))) ∈ V
71	69, 70	op2nd 8020	. . . 4 ⊢ (2nd ‘⟨((𝐺‘(◡𝐺‘𝐵)) +s 1s ), ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩) = ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))
72	68, 71	eqtrdi 2814	. . 3 ⊢ ((𝜑 ∧ (◡𝐺‘𝐵) ∈ ω) → (2nd ‘(𝑅‘suc (◡𝐺‘𝐵))) = ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
73	23, 72	syldan 603	. 2 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → (2nd ‘(𝑅‘suc (◡𝐺‘𝐵))) = ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
74	1, 2, 3, 4, 5	noseqrdglem 28706	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → ⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩ ∈ ran 𝑅)
75	74, 16	eleqtrrd 2867	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → ⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩ ∈ 𝑆)
76		funopfv 6945	. . . . 5 ⊢ (Fun 𝑆 → (⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩ ∈ 𝑆 → (𝑆‘𝐵) = (2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
77	9, 75, 76	sylc 66	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝑆‘𝐵) = (2nd ‘(𝑅‘(◡𝐺‘𝐵))))
78	77	eqcomd 2769	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → (2nd ‘(𝑅‘(◡𝐺‘𝐵))) = (𝑆‘𝐵))
79	30, 78	oveq12d 7448	. 2 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))) = (𝐵𝐹(𝑆‘𝐵)))
80	37, 73, 79	3eqtrd 2802	1 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝑆‘(𝐵 +s 1s )) = (𝐵𝐹(𝑆‘𝐵)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2146  Vcvv 3454  ⟨cop 4838   ↦ cmpt 5189  ^◡ccnv 5654  ran crn 5656   ↾ cres 5657   “ cima 5658  suc csuc 6371  Fun wfun 6541   Fn wfn 6542  –1-1-onto→wf1o 6546  ‘cfv 6547  (class class class)co 7430   ∈ cmpo 7432  ωcom 7887  2^nd c2nd 8010  reccrdg 8431  Nocsur 28012   1_s c1s 28207   +_s cadds 28360

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 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7761

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4839  df-ot 4862  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6311  df-ord 6372  df-on 6373  df-lim 6374  df-suc 6375  df-iota 6501  df-fun 6549  df-fn 6550  df-f 6551  df-f1 6552  df-fo 6553  df-f1o 6554  df-fv 6555  df-riota 7387  df-ov 7433  df-oprab 7434  df-mpo 7435  df-om 7888  df-1st 8011  df-2nd 8012  df-frecs 8313  df-wrecs 8344  df-recs 8393  df-rdg 8432  df-1o 8490  df-2o 8491  df-oadd 8494  df-nadd 8689  df-no 28015  df-lts 28016  df-bday 28017  df-les 28117  df-slts 28159  df-cuts 28161  df-0s 28208  df-1s 28209  df-made 28228  df-old 28229  df-left 28231  df-right 28232  df-norec2 28350  df-adds 28361

This theorem is used by:  seqsp1  28712