Theorem frecuzrdgsuc 10866

Description: Successor value of a recursive definition generator on upper integers. See comment in frec2uz0d 10851 for the description of 𝐺 as the mapping from ω to (ℤ_≥‘𝐶). (Contributed by Jim Kingdon, 28-May-2020.)

Hypotheses

Ref	Expression
frec2uz.1	⊢ (𝜑 → 𝐶 ∈ ℤ)
frec2uz.2	⊢ 𝐺 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 𝐶)
frecuzrdgrrn.a	⊢ (𝜑 → 𝐴 ∈ 𝑆)
frecuzrdgrrn.f	⊢ ((𝜑 ∧ (𝑥 ∈ (ℤ≥‘𝐶) ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) ∈ 𝑆)
frecuzrdgrrn.2	⊢ 𝑅 = frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩)
frecuzrdgtcl.3	⊢ (𝜑 → 𝑇 = ran 𝑅)

Assertion

Ref	Expression
frecuzrdgsuc	⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑇‘(𝐵 + 1)) = (𝐵𝐹(𝑇‘𝐵)))

Distinct variable groups:   𝑦,𝐴   𝑥,𝐶,𝑦   𝑦,𝐺   𝑥,𝐹,𝑦   𝑥,𝑆,𝑦   𝜑,𝑥,𝑦   𝑥,𝐵,𝑦

Allowed substitution hints:   𝐴(𝑥)   𝑅(𝑥, 𝑦)   𝑇(𝑥, 𝑦)   𝐺(𝑥)

Proof of Theorem frecuzrdgsuc

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

Step	Hyp	Ref	Expression
1		frec2uz.1	. . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ ℤ)
2	1	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → 𝐶 ∈ ℤ)
3		frec2uz.2	. . . . . 6 ⊢ 𝐺 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 𝐶)
4		frecuzrdgrrn.a	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ 𝑆)
5	4	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → 𝐴 ∈ 𝑆)
6		frecuzrdgrrn.f	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ (ℤ≥‘𝐶) ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) ∈ 𝑆)
7	6	adantlr 481	. . . . . 6 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ (𝑥 ∈ (ℤ≥‘𝐶) ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) ∈ 𝑆)
8		frecuzrdgrrn.2	. . . . . 6 ⊢ 𝑅 = frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩)
9		peano2uz 9993	. . . . . . 7 ⊢ (𝐵 ∈ (ℤ≥‘𝐶) → (𝐵 + 1) ∈ (ℤ≥‘𝐶))
10	9	adantl 277	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝐵 + 1) ∈ (ℤ≥‘𝐶))
11	2, 3, 5, 7, 8, 10	frecuzrdglem 10863	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → ⟨(𝐵 + 1), (2nd ‘(𝑅‘(◡𝐺‘(𝐵 + 1))))⟩ ∈ ran 𝑅)
12		frecuzrdgtcl.3	. . . . . 6 ⊢ (𝜑 → 𝑇 = ran 𝑅)
13	12	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → 𝑇 = ran 𝑅)
14	11, 13	eleqtrrd 2318	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → ⟨(𝐵 + 1), (2nd ‘(𝑅‘(◡𝐺‘(𝐵 + 1))))⟩ ∈ 𝑇)
15	1, 3, 4, 6, 8, 12	frecuzrdgtcl 10864	. . . . . . 7 ⊢ (𝜑 → 𝑇:(ℤ≥‘𝐶)⟶𝑆)
16		ffun 5536	. . . . . . 7 ⊢ (𝑇:(ℤ≥‘𝐶)⟶𝑆 → Fun 𝑇)
17	15, 16	syl 14	. . . . . 6 ⊢ (𝜑 → Fun 𝑇)
18		funopfv 5740	. . . . . 6 ⊢ (Fun 𝑇 → (⟨(𝐵 + 1), (2nd ‘(𝑅‘(◡𝐺‘(𝐵 + 1))))⟩ ∈ 𝑇 → (𝑇‘(𝐵 + 1)) = (2nd ‘(𝑅‘(◡𝐺‘(𝐵 + 1))))))
19	17, 18	syl 14	. . . . 5 ⊢ (𝜑 → (⟨(𝐵 + 1), (2nd ‘(𝑅‘(◡𝐺‘(𝐵 + 1))))⟩ ∈ 𝑇 → (𝑇‘(𝐵 + 1)) = (2nd ‘(𝑅‘(◡𝐺‘(𝐵 + 1))))))
20	19	adantr 276	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (⟨(𝐵 + 1), (2nd ‘(𝑅‘(◡𝐺‘(𝐵 + 1))))⟩ ∈ 𝑇 → (𝑇‘(𝐵 + 1)) = (2nd ‘(𝑅‘(◡𝐺‘(𝐵 + 1))))))
21	14, 20	mpd 13	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑇‘(𝐵 + 1)) = (2nd ‘(𝑅‘(◡𝐺‘(𝐵 + 1)))))
22	1, 3	frec2uzf1od 10858	. . . . . . . . 9 ⊢ (𝜑 → 𝐺:ω–1-1-onto→(ℤ≥‘𝐶))
23		f1ocnvdm 5987	. . . . . . . . 9 ⊢ ((𝐺:ω–1-1-onto→(ℤ≥‘𝐶) ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (◡𝐺‘𝐵) ∈ ω)
24	22, 23	sylan 283	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (◡𝐺‘𝐵) ∈ ω)
25	2, 3, 24	frec2uzsucd 10853	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝐺‘suc (◡𝐺‘𝐵)) = ((𝐺‘(◡𝐺‘𝐵)) + 1))
26		f1ocnvfv2 5984	. . . . . . . . 9 ⊢ ((𝐺:ω–1-1-onto→(ℤ≥‘𝐶) ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝐺‘(◡𝐺‘𝐵)) = 𝐵)
27	22, 26	sylan 283	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝐺‘(◡𝐺‘𝐵)) = 𝐵)
28	27	oveq1d 6100	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → ((𝐺‘(◡𝐺‘𝐵)) + 1) = (𝐵 + 1))
29	25, 28	eqtrd 2271	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝐺‘suc (◡𝐺‘𝐵)) = (𝐵 + 1))
30		peano2 4742	. . . . . . . 8 ⊢ ((◡𝐺‘𝐵) ∈ ω → suc (◡𝐺‘𝐵) ∈ ω)
31	24, 30	syl 14	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → suc (◡𝐺‘𝐵) ∈ ω)
32		f1ocnvfv 5985	. . . . . . 7 ⊢ ((𝐺:ω–1-1-onto→(ℤ≥‘𝐶) ∧ suc (◡𝐺‘𝐵) ∈ ω) → ((𝐺‘suc (◡𝐺‘𝐵)) = (𝐵 + 1) → (◡𝐺‘(𝐵 + 1)) = suc (◡𝐺‘𝐵)))
33	22, 31, 32	syl2an2r 603	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → ((𝐺‘suc (◡𝐺‘𝐵)) = (𝐵 + 1) → (◡𝐺‘(𝐵 + 1)) = suc (◡𝐺‘𝐵)))
34	29, 33	mpd 13	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (◡𝐺‘(𝐵 + 1)) = suc (◡𝐺‘𝐵))
35	34	fveq2d 5699	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑅‘(◡𝐺‘(𝐵 + 1))) = (𝑅‘suc (◡𝐺‘𝐵)))
36	35	fveq2d 5699	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (2nd ‘(𝑅‘(◡𝐺‘(𝐵 + 1)))) = (2nd ‘(𝑅‘suc (◡𝐺‘𝐵))))
37	21, 36	eqtrd 2271	. 2 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑇‘(𝐵 + 1)) = (2nd ‘(𝑅‘suc (◡𝐺‘𝐵))))
38		1st2nd2 6409	. . . . . . . . . . 11 ⊢ (𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆) → 𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩)
39	38	adantl 277	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → 𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩)
40	39	fveq2d 5699	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘𝑧) = ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘⟨(1st ‘𝑧), (2nd ‘𝑧)⟩))
41		df-ov 6088	. . . . . . . . . . 11 ⊢ ((1st ‘𝑧)(𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd ‘𝑧)) = ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘⟨(1st ‘𝑧), (2nd ‘𝑧)⟩)
42		xp1st 6399	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆) → (1st ‘𝑧) ∈ (ℤ≥‘𝐶))
43	42	adantl 277	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → (1st ‘𝑧) ∈ (ℤ≥‘𝐶))
44		xp2nd 6400	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆) → (2nd ‘𝑧) ∈ 𝑆)
45	44	adantl 277	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → (2nd ‘𝑧) ∈ 𝑆)
46		peano2uz 9993	. . . . . . . . . . . . . 14 ⊢ ((1st ‘𝑧) ∈ (ℤ≥‘𝐶) → ((1st ‘𝑧) + 1) ∈ (ℤ≥‘𝐶))
47	43, 46	syl 14	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((1st ‘𝑧) + 1) ∈ (ℤ≥‘𝐶))
48		oveq2 6093	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = (2nd ‘𝑧) → ((1st ‘𝑧)𝐹𝑦) = ((1st ‘𝑧)𝐹(2nd ‘𝑧)))
49	48	eleq1d 2307	. . . . . . . . . . . . . 14 ⊢ (𝑦 = (2nd ‘𝑧) → (((1st ‘𝑧)𝐹𝑦) ∈ 𝑆 ↔ ((1st ‘𝑧)𝐹(2nd ‘𝑧)) ∈ 𝑆))
50		oveq1 6092	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = (1st ‘𝑧) → (𝑥𝐹𝑦) = ((1st ‘𝑧)𝐹𝑦))
51	50	eleq1d 2307	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = (1st ‘𝑧) → ((𝑥𝐹𝑦) ∈ 𝑆 ↔ ((1st ‘𝑧)𝐹𝑦) ∈ 𝑆))
52	51	ralbidv 2550	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = (1st ‘𝑧) → (∀𝑦 ∈ 𝑆 (𝑥𝐹𝑦) ∈ 𝑆 ↔ ∀𝑦 ∈ 𝑆 ((1st ‘𝑧)𝐹𝑦) ∈ 𝑆))
53	6	ralrimivva 2632	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ∀𝑥 ∈ (ℤ≥‘𝐶)∀𝑦 ∈ 𝑆 (𝑥𝐹𝑦) ∈ 𝑆)
54	53	ad2antrr 492	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ∀𝑥 ∈ (ℤ≥‘𝐶)∀𝑦 ∈ 𝑆 (𝑥𝐹𝑦) ∈ 𝑆)
55	52, 54, 43	rspcdva 2934	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ∀𝑦 ∈ 𝑆 ((1st ‘𝑧)𝐹𝑦) ∈ 𝑆)
56	49, 55, 45	rspcdva 2934	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((1st ‘𝑧)𝐹(2nd ‘𝑧)) ∈ 𝑆)
57		opelxp 4804	. . . . . . . . . . . . 13 ⊢ (⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹(2nd ‘𝑧))⟩ ∈ ((ℤ≥‘𝐶) × 𝑆) ↔ (((1st ‘𝑧) + 1) ∈ (ℤ≥‘𝐶) ∧ ((1st ‘𝑧)𝐹(2nd ‘𝑧)) ∈ 𝑆))
58	47, 56, 57	sylanbrc 421	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹(2nd ‘𝑧))⟩ ∈ ((ℤ≥‘𝐶) × 𝑆))
59		oveq1 6092	. . . . . . . . . . . . . 14 ⊢ (𝑥 = (1st ‘𝑧) → (𝑥 + 1) = ((1st ‘𝑧) + 1))
60	59, 50	opeq12d 3912	. . . . . . . . . . . . 13 ⊢ (𝑥 = (1st ‘𝑧) → ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩ = ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹𝑦)⟩)
61	48	opeq2d 3911	. . . . . . . . . . . . 13 ⊢ (𝑦 = (2nd ‘𝑧) → ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹𝑦)⟩ = ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹(2nd ‘𝑧))⟩)
62		eqid 2238	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩) = (𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)
63	60, 61, 62	ovmpog 6223	. . . . . . . . . . . 12 ⊢ (((1st ‘𝑧) ∈ (ℤ≥‘𝐶) ∧ (2nd ‘𝑧) ∈ 𝑆 ∧ ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹(2nd ‘𝑧))⟩ ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((1st ‘𝑧)(𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd ‘𝑧)) = ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹(2nd ‘𝑧))⟩)
64	43, 45, 58, 63	syl3anc 1278	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((1st ‘𝑧)(𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd ‘𝑧)) = ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹(2nd ‘𝑧))⟩)
65	41, 64	eqtr3id 2285	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘⟨(1st ‘𝑧), (2nd ‘𝑧)⟩) = ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹(2nd ‘𝑧))⟩)
66	65, 58	eqeltrd 2315	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘⟨(1st ‘𝑧), (2nd ‘𝑧)⟩) ∈ ((ℤ≥‘𝐶) × 𝑆))
67	40, 66	eqeltrd 2315	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘𝑧) ∈ ((ℤ≥‘𝐶) × 𝑆))
68	67	ralrimiva 2623	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → ∀𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘𝑧) ∈ ((ℤ≥‘𝐶) × 𝑆))
69		uzid 9946	. . . . . . . . 9 ⊢ (𝐶 ∈ ℤ → 𝐶 ∈ (ℤ≥‘𝐶))
70	2, 69	syl 14	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → 𝐶 ∈ (ℤ≥‘𝐶))
71		opelxp 4804	. . . . . . . 8 ⊢ (⟨𝐶, 𝐴⟩ ∈ ((ℤ≥‘𝐶) × 𝑆) ↔ (𝐶 ∈ (ℤ≥‘𝐶) ∧ 𝐴 ∈ 𝑆))
72	70, 5, 71	sylanbrc 421	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → ⟨𝐶, 𝐴⟩ ∈ ((ℤ≥‘𝐶) × 𝑆))
73		frecsuc 6678	. . . . . . 7 ⊢ ((∀𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘𝑧) ∈ ((ℤ≥‘𝐶) × 𝑆) ∧ ⟨𝐶, 𝐴⟩ ∈ ((ℤ≥‘𝐶) × 𝑆) ∧ (◡𝐺‘𝐵) ∈ ω) → (frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩)‘suc (◡𝐺‘𝐵)) = ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘(frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩)‘(◡𝐺‘𝐵))))
74	68, 72, 24, 73	syl3anc 1278	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩)‘suc (◡𝐺‘𝐵)) = ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘(frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩)‘(◡𝐺‘𝐵))))
75	8	fveq1i 5696	. . . . . 6 ⊢ (𝑅‘suc (◡𝐺‘𝐵)) = (frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩)‘suc (◡𝐺‘𝐵))
76	8	fveq1i 5696	. . . . . . 7 ⊢ (𝑅‘(◡𝐺‘𝐵)) = (frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩)‘(◡𝐺‘𝐵))
77	76	fveq2i 5698	. . . . . 6 ⊢ ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘(𝑅‘(◡𝐺‘𝐵))) = ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘(frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩)‘(◡𝐺‘𝐵)))
78	74, 75, 77	3eqtr4g 2296	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑅‘suc (◡𝐺‘𝐵)) = ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘(𝑅‘(◡𝐺‘𝐵))))
79	2, 3, 5, 7, 8, 24	frec2uzrdg 10861	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑅‘(◡𝐺‘𝐵)) = ⟨(𝐺‘(◡𝐺‘𝐵)), (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩)
80	79	fveq2d 5699	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘(𝑅‘(◡𝐺‘𝐵))) = ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘⟨(𝐺‘(◡𝐺‘𝐵)), (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩))
81		df-ov 6088	. . . . . 6 ⊢ ((𝐺‘(◡𝐺‘𝐵))(𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd ‘(𝑅‘(◡𝐺‘𝐵)))) = ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘⟨(𝐺‘(◡𝐺‘𝐵)), (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩)
82	80, 81	eqtr4di 2289	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘(𝑅‘(◡𝐺‘𝐵))) = ((𝐺‘(◡𝐺‘𝐵))(𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
83	2, 3, 24	frec2uzuzd 10854	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝐺‘(◡𝐺‘𝐵)) ∈ (ℤ≥‘𝐶))
84	2, 3, 5, 7, 8	frecuzrdgrrn 10860	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ (◡𝐺‘𝐵) ∈ ω) → (𝑅‘(◡𝐺‘𝐵)) ∈ ((ℤ≥‘𝐶) × 𝑆))
85	24, 84	mpdan 425	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑅‘(◡𝐺‘𝐵)) ∈ ((ℤ≥‘𝐶) × 𝑆))
86		xp2nd 6400	. . . . . . 7 ⊢ ((𝑅‘(◡𝐺‘𝐵)) ∈ ((ℤ≥‘𝐶) × 𝑆) → (2nd ‘(𝑅‘(◡𝐺‘𝐵))) ∈ 𝑆)
87	85, 86	syl 14	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (2nd ‘(𝑅‘(◡𝐺‘𝐵))) ∈ 𝑆)
88	28, 10	eqeltrd 2315	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → ((𝐺‘(◡𝐺‘𝐵)) + 1) ∈ (ℤ≥‘𝐶))
89	7	caovclg 6242	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ (𝑧 ∈ (ℤ≥‘𝐶) ∧ 𝑤 ∈ 𝑆)) → (𝑧𝐹𝑤) ∈ 𝑆)
90	89, 83, 87	caovcld 6243	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))) ∈ 𝑆)
91		opelxp 4804	. . . . . . 7 ⊢ (⟨((𝐺‘(◡𝐺‘𝐵)) + 1), ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩ ∈ ((ℤ≥‘𝐶) × 𝑆) ↔ (((𝐺‘(◡𝐺‘𝐵)) + 1) ∈ (ℤ≥‘𝐶) ∧ ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))) ∈ 𝑆))
92	88, 90, 91	sylanbrc 421	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → ⟨((𝐺‘(◡𝐺‘𝐵)) + 1), ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩ ∈ ((ℤ≥‘𝐶) × 𝑆))
93		oveq1 6092	. . . . . . . 8 ⊢ (𝑧 = (𝐺‘(◡𝐺‘𝐵)) → (𝑧 + 1) = ((𝐺‘(◡𝐺‘𝐵)) + 1))
94		oveq1 6092	. . . . . . . 8 ⊢ (𝑧 = (𝐺‘(◡𝐺‘𝐵)) → (𝑧𝐹𝑤) = ((𝐺‘(◡𝐺‘𝐵))𝐹𝑤))
95	93, 94	opeq12d 3912	. . . . . . 7 ⊢ (𝑧 = (𝐺‘(◡𝐺‘𝐵)) → ⟨(𝑧 + 1), (𝑧𝐹𝑤)⟩ = ⟨((𝐺‘(◡𝐺‘𝐵)) + 1), ((𝐺‘(◡𝐺‘𝐵))𝐹𝑤)⟩)
96		oveq2 6093	. . . . . . . 8 ⊢ (𝑤 = (2nd ‘(𝑅‘(◡𝐺‘𝐵))) → ((𝐺‘(◡𝐺‘𝐵))𝐹𝑤) = ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
97	96	opeq2d 3911	. . . . . . 7 ⊢ (𝑤 = (2nd ‘(𝑅‘(◡𝐺‘𝐵))) → ⟨((𝐺‘(◡𝐺‘𝐵)) + 1), ((𝐺‘(◡𝐺‘𝐵))𝐹𝑤)⟩ = ⟨((𝐺‘(◡𝐺‘𝐵)) + 1), ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩)
98		oveq1 6092	. . . . . . . . 9 ⊢ (𝑥 = 𝑧 → (𝑥 + 1) = (𝑧 + 1))
99		oveq1 6092	. . . . . . . . 9 ⊢ (𝑥 = 𝑧 → (𝑥𝐹𝑦) = (𝑧𝐹𝑦))
100	98, 99	opeq12d 3912	. . . . . . . 8 ⊢ (𝑥 = 𝑧 → ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩ = ⟨(𝑧 + 1), (𝑧𝐹𝑦)⟩)
101		oveq2 6093	. . . . . . . . 9 ⊢ (𝑦 = 𝑤 → (𝑧𝐹𝑦) = (𝑧𝐹𝑤))
102	101	opeq2d 3911	. . . . . . . 8 ⊢ (𝑦 = 𝑤 → ⟨(𝑧 + 1), (𝑧𝐹𝑦)⟩ = ⟨(𝑧 + 1), (𝑧𝐹𝑤)⟩)
103	100, 102	cbvmpov 6168	. . . . . . 7 ⊢ (𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩) = (𝑧 ∈ (ℤ≥‘𝐶), 𝑤 ∈ 𝑆 ↦ ⟨(𝑧 + 1), (𝑧𝐹𝑤)⟩)
104	95, 97, 103	ovmpog 6223	. . . . . 6 ⊢ (((𝐺‘(◡𝐺‘𝐵)) ∈ (ℤ≥‘𝐶) ∧ (2nd ‘(𝑅‘(◡𝐺‘𝐵))) ∈ 𝑆 ∧ ⟨((𝐺‘(◡𝐺‘𝐵)) + 1), ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩ ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((𝐺‘(◡𝐺‘𝐵))(𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd ‘(𝑅‘(◡𝐺‘𝐵)))) = ⟨((𝐺‘(◡𝐺‘𝐵)) + 1), ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩)
105	83, 87, 92, 104	syl3anc 1278	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → ((𝐺‘(◡𝐺‘𝐵))(𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd ‘(𝑅‘(◡𝐺‘𝐵)))) = ⟨((𝐺‘(◡𝐺‘𝐵)) + 1), ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩)
106	78, 82, 105	3eqtrd 2275	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑅‘suc (◡𝐺‘𝐵)) = ⟨((𝐺‘(◡𝐺‘𝐵)) + 1), ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩)
107	106	fveq2d 5699	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (2nd ‘(𝑅‘suc (◡𝐺‘𝐵))) = (2nd ‘⟨((𝐺‘(◡𝐺‘𝐵)) + 1), ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩))
108		op2ndg 6385	. . . 4 ⊢ ((((𝐺‘(◡𝐺‘𝐵)) + 1) ∈ (ℤ≥‘𝐶) ∧ ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))) ∈ 𝑆) → (2nd ‘⟨((𝐺‘(◡𝐺‘𝐵)) + 1), ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩) = ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
109	88, 90, 108	syl2anc 415	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (2nd ‘⟨((𝐺‘(◡𝐺‘𝐵)) + 1), ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩) = ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
110	107, 109	eqtrd 2271	. 2 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (2nd ‘(𝑅‘suc (◡𝐺‘𝐵))) = ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
111		simpr 110	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → 𝐵 ∈ (ℤ≥‘𝐶))
112	2, 3, 5, 7, 8, 111	frecuzrdglem 10863	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → ⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩ ∈ ran 𝑅)
113	112, 13	eleqtrrd 2318	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → ⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩ ∈ 𝑇)
114		funopfv 5740	. . . . . . 7 ⊢ (Fun 𝑇 → (⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩ ∈ 𝑇 → (𝑇‘𝐵) = (2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
115	17, 114	syl 14	. . . . . 6 ⊢ (𝜑 → (⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩ ∈ 𝑇 → (𝑇‘𝐵) = (2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
116	115	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩ ∈ 𝑇 → (𝑇‘𝐵) = (2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
117	113, 116	mpd 13	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑇‘𝐵) = (2nd ‘(𝑅‘(◡𝐺‘𝐵))))
118	117	eqcomd 2244	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (2nd ‘(𝑅‘(◡𝐺‘𝐵))) = (𝑇‘𝐵))
119	27, 118	oveq12d 6103	. 2 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))) = (𝐵𝐹(𝑇‘𝐵)))
120	37, 110, 119	3eqtrd 2275	1 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑇‘(𝐵 + 1)) = (𝐵𝐹(𝑇‘𝐵)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   = wceq 1402   ∈ wcel 2209  ∀wral 2528  ⟨cop 3712   ↦ cmpt 4192  suc csuc 4510  ωcom 4737   × cxp 4772  ^◡ccnv 4773  ran crn 4775  Fun wfun 5371  ⟶wf 5373  –1-1-onto→wf1o 5376  ‘cfv 5377  (class class class)co 6085   ∈ cmpo 6087  1^st c1st 6372  2^nd c2nd 6373  freccfrec 6661  1c1 8181   + caddc 8183  ℤcz 9649  ℤ_≥cuz 9931

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8271  ax-resscn 8272  ax-1cn 8273  ax-1re 8274  ax-icn 8275  ax-addcl 8276  ax-addrcl 8277  ax-mulcl 8278  ax-addcom 8280  ax-addass 8282  ax-distr 8284  ax-i2m1 8285  ax-0lt1 8286  ax-0id 8288  ax-rnegex 8289  ax-cnre 8291  ax-pre-ltirr 8292  ax-pre-ltwlin 8293  ax-pre-lttrn 8294  ax-pre-ltadd 8296

This proof depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  df-pnf 8363  df-mnf 8364  df-xr 8365  df-ltxr 8366  df-le 8367  df-sub 8501  df-neg 8502  df-inn 9308  df-n0 9569  df-z 9650  df-uz 9932

This theorem is used by: (None)