Theorem frecuzrdgsuctlem 10675

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

Hypotheses

Ref	Expression
frecuzrdgrclt.c	⊢ (𝜑 → 𝐶 ∈ ℤ)
frecuzrdgrclt.a	⊢ (𝜑 → 𝐴 ∈ 𝑆)
frecuzrdgrclt.t	⊢ (𝜑 → 𝑆 ⊆ 𝑇)
frecuzrdgrclt.f	⊢ ((𝜑 ∧ (𝑥 ∈ (ℤ≥‘𝐶) ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) ∈ 𝑆)
frecuzrdgrclt.r	⊢ 𝑅 = frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩)
frecuzrdgsuctlem.g	⊢ 𝐺 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 𝐶)
frecuzrdgsuctlem.ran	⊢ (𝜑 → 𝑃 = ran 𝑅)

Assertion

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

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

Allowed substitution hints:   𝐴(𝑥,𝑦)   𝑃(𝑥,𝑦)

Proof of Theorem frecuzrdgsuctlem

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		frecuzrdgrclt.c	. . . . . 6 ⊢ (𝜑 → 𝐶 ∈ ℤ)
2		frecuzrdgrclt.a	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ 𝑆)
3		frecuzrdgrclt.t	. . . . . 6 ⊢ (𝜑 → 𝑆 ⊆ 𝑇)
4		frecuzrdgrclt.f	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (ℤ≥‘𝐶) ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) ∈ 𝑆)
5		frecuzrdgrclt.r	. . . . . 6 ⊢ 𝑅 = frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩)
6		frecuzrdgsuctlem.ran	. . . . . 6 ⊢ (𝜑 → 𝑃 = ran 𝑅)
7	1, 2, 3, 4, 5, 6	frecuzrdgtclt 10673	. . . . 5 ⊢ (𝜑 → 𝑃:(ℤ≥‘𝐶)⟶𝑆)
8	7	adantr 276	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → 𝑃:(ℤ≥‘𝐶)⟶𝑆)
9		ffun 5482	. . . 4 ⊢ (𝑃:(ℤ≥‘𝐶)⟶𝑆 → Fun 𝑃)
10	8, 9	syl 14	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → Fun 𝑃)
11		1st2nd2 6333	. . . . . . . . . . . . . . 15 ⊢ (𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆) → 𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩)
12	11	adantl 277	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → 𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩)
13	12	fveq2d 5639	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘𝑧) = ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘⟨(1st ‘𝑧), (2nd ‘𝑧)⟩))
14		df-ov 6016	. . . . . . . . . . . . 13 ⊢ ((1st ‘𝑧)(𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd ‘𝑧)) = ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘⟨(1st ‘𝑧), (2nd ‘𝑧)⟩)
15	13, 14	eqtr4di 2280	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘𝑧) = ((1st ‘𝑧)(𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd ‘𝑧)))
16		xp1st 6323	. . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆) → (1st ‘𝑧) ∈ (ℤ≥‘𝐶))
17	16	adantl 277	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → (1st ‘𝑧) ∈ (ℤ≥‘𝐶))
18	3	ad2antrr 488	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → 𝑆 ⊆ 𝑇)
19		xp2nd 6324	. . . . . . . . . . . . . . 15 ⊢ (𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆) → (2nd ‘𝑧) ∈ 𝑆)
20	19	adantl 277	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → (2nd ‘𝑧) ∈ 𝑆)
21	18, 20	sseldd 3226	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → (2nd ‘𝑧) ∈ 𝑇)
22		peano2uz 9807	. . . . . . . . . . . . . . 15 ⊢ ((1st ‘𝑧) ∈ (ℤ≥‘𝐶) → ((1st ‘𝑧) + 1) ∈ (ℤ≥‘𝐶))
23	17, 22	syl 14	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((1st ‘𝑧) + 1) ∈ (ℤ≥‘𝐶))
24		oveq2 6021	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = (2nd ‘𝑧) → ((1st ‘𝑧)𝐹𝑦) = ((1st ‘𝑧)𝐹(2nd ‘𝑧)))
25	24	eleq1d 2298	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = (2nd ‘𝑧) → (((1st ‘𝑧)𝐹𝑦) ∈ 𝑆 ↔ ((1st ‘𝑧)𝐹(2nd ‘𝑧)) ∈ 𝑆))
26		oveq1 6020	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = (1st ‘𝑧) → (𝑥𝐹𝑦) = ((1st ‘𝑧)𝐹𝑦))
27	26	eleq1d 2298	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = (1st ‘𝑧) → ((𝑥𝐹𝑦) ∈ 𝑆 ↔ ((1st ‘𝑧)𝐹𝑦) ∈ 𝑆))
28	27	ralbidv 2530	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = (1st ‘𝑧) → (∀𝑦 ∈ 𝑆 (𝑥𝐹𝑦) ∈ 𝑆 ↔ ∀𝑦 ∈ 𝑆 ((1st ‘𝑧)𝐹𝑦) ∈ 𝑆))
29	4	ralrimivva 2612	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ∀𝑥 ∈ (ℤ≥‘𝐶)∀𝑦 ∈ 𝑆 (𝑥𝐹𝑦) ∈ 𝑆)
30	29	ad2antrr 488	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ∀𝑥 ∈ (ℤ≥‘𝐶)∀𝑦 ∈ 𝑆 (𝑥𝐹𝑦) ∈ 𝑆)
31	28, 30, 17	rspcdva 2913	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ∀𝑦 ∈ 𝑆 ((1st ‘𝑧)𝐹𝑦) ∈ 𝑆)
32	25, 31, 20	rspcdva 2913	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((1st ‘𝑧)𝐹(2nd ‘𝑧)) ∈ 𝑆)
33		opelxpi 4755	. . . . . . . . . . . . . 14 ⊢ ((((1st ‘𝑧) + 1) ∈ (ℤ≥‘𝐶) ∧ ((1st ‘𝑧)𝐹(2nd ‘𝑧)) ∈ 𝑆) → ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹(2nd ‘𝑧))⟩ ∈ ((ℤ≥‘𝐶) × 𝑆))
34	23, 32, 33	syl2anc 411	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹(2nd ‘𝑧))⟩ ∈ ((ℤ≥‘𝐶) × 𝑆))
35		oveq1 6020	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = (1st ‘𝑧) → (𝑥 + 1) = ((1st ‘𝑧) + 1))
36	35, 26	opeq12d 3868	. . . . . . . . . . . . . 14 ⊢ (𝑥 = (1st ‘𝑧) → ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩ = ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹𝑦)⟩)
37	24	opeq2d 3867	. . . . . . . . . . . . . 14 ⊢ (𝑦 = (2nd ‘𝑧) → ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹𝑦)⟩ = ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹(2nd ‘𝑧))⟩)
38		eqid 2229	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩) = (𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)
39	36, 37, 38	ovmpog 6151	. . . . . . . . . . . . 13 ⊢ (((1st ‘𝑧) ∈ (ℤ≥‘𝐶) ∧ (2nd ‘𝑧) ∈ 𝑇 ∧ ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹(2nd ‘𝑧))⟩ ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((1st ‘𝑧)(𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd ‘𝑧)) = ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹(2nd ‘𝑧))⟩)
40	17, 21, 34, 39	syl3anc 1271	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((1st ‘𝑧)(𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd ‘𝑧)) = ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹(2nd ‘𝑧))⟩)
41	15, 40	eqtrd 2262	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘𝑧) = ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹(2nd ‘𝑧))⟩)
42	41, 34	eqeltrd 2306	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘𝑧) ∈ ((ℤ≥‘𝐶) × 𝑆))
43	42	ralrimiva 2603	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → ∀𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘𝑧) ∈ ((ℤ≥‘𝐶) × 𝑆))
44		uzid 9760	. . . . . . . . . . . 12 ⊢ (𝐶 ∈ ℤ → 𝐶 ∈ (ℤ≥‘𝐶))
45	1, 44	syl 14	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐶 ∈ (ℤ≥‘𝐶))
46		opelxpi 4755	. . . . . . . . . . 11 ⊢ ((𝐶 ∈ (ℤ≥‘𝐶) ∧ 𝐴 ∈ 𝑆) → ⟨𝐶, 𝐴⟩ ∈ ((ℤ≥‘𝐶) × 𝑆))
47	45, 2, 46	syl2anc 411	. . . . . . . . . 10 ⊢ (𝜑 → ⟨𝐶, 𝐴⟩ ∈ ((ℤ≥‘𝐶) × 𝑆))
48	47	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → ⟨𝐶, 𝐴⟩ ∈ ((ℤ≥‘𝐶) × 𝑆))
49		frecuzrdgsuctlem.g	. . . . . . . . . . 11 ⊢ 𝐺 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 𝐶)
50	1, 49	frec2uzf1od 10658	. . . . . . . . . 10 ⊢ (𝜑 → 𝐺:ω–1-1-onto→(ℤ≥‘𝐶))
51		f1ocnvdm 5917	. . . . . . . . . 10 ⊢ ((𝐺:ω–1-1-onto→(ℤ≥‘𝐶) ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (◡𝐺‘𝐵) ∈ ω)
52	50, 51	sylan 283	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (◡𝐺‘𝐵) ∈ ω)
53		frecsuc 6568	. . . . . . . . 9 ⊢ ((∀𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘𝑧) ∈ ((ℤ≥‘𝐶) × 𝑆) ∧ ⟨𝐶, 𝐴⟩ ∈ ((ℤ≥‘𝐶) × 𝑆) ∧ (◡𝐺‘𝐵) ∈ ω) → (frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩)‘suc (◡𝐺‘𝐵)) = ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘(frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩)‘(◡𝐺‘𝐵))))
54	43, 48, 52, 53	syl3anc 1271	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩)‘suc (◡𝐺‘𝐵)) = ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘(frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩)‘(◡𝐺‘𝐵))))
55	5	fveq1i 5636	. . . . . . . 8 ⊢ (𝑅‘suc (◡𝐺‘𝐵)) = (frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩)‘suc (◡𝐺‘𝐵))
56	5	fveq1i 5636	. . . . . . . . 9 ⊢ (𝑅‘(◡𝐺‘𝐵)) = (frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩)‘(◡𝐺‘𝐵))
57	56	fveq2i 5638	. . . . . . . 8 ⊢ ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘(𝑅‘(◡𝐺‘𝐵))) = ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘(frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩)‘(◡𝐺‘𝐵)))
58	54, 55, 57	3eqtr4g 2287	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑅‘suc (◡𝐺‘𝐵)) = ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘(𝑅‘(◡𝐺‘𝐵))))
59	1, 2, 3, 4, 5	frecuzrdgrclt 10667	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑅:ω⟶((ℤ≥‘𝐶) × 𝑆))
60	59	adantr 276	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → 𝑅:ω⟶((ℤ≥‘𝐶) × 𝑆))
61	60, 52	ffvelcdmd 5779	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑅‘(◡𝐺‘𝐵)) ∈ ((ℤ≥‘𝐶) × 𝑆))
62		1st2nd2 6333	. . . . . . . . . 10 ⊢ ((𝑅‘(◡𝐺‘𝐵)) ∈ ((ℤ≥‘𝐶) × 𝑆) → (𝑅‘(◡𝐺‘𝐵)) = ⟨(1st ‘(𝑅‘(◡𝐺‘𝐵))), (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩)
63	61, 62	syl 14	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑅‘(◡𝐺‘𝐵)) = ⟨(1st ‘(𝑅‘(◡𝐺‘𝐵))), (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩)
64	1	adantr 276	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → 𝐶 ∈ ℤ)
65	2	adantr 276	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → 𝐴 ∈ 𝑆)
66	3	adantr 276	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → 𝑆 ⊆ 𝑇)
67	4	adantlr 477	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ (𝑥 ∈ (ℤ≥‘𝐶) ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) ∈ 𝑆)
68	64, 65, 66, 67, 5, 52, 49	frecuzrdgg 10668	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (1st ‘(𝑅‘(◡𝐺‘𝐵))) = (𝐺‘(◡𝐺‘𝐵)))
69		f1ocnvfv2 5914	. . . . . . . . . . . 12 ⊢ ((𝐺:ω–1-1-onto→(ℤ≥‘𝐶) ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝐺‘(◡𝐺‘𝐵)) = 𝐵)
70	50, 69	sylan 283	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝐺‘(◡𝐺‘𝐵)) = 𝐵)
71	68, 70	eqtrd 2262	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (1st ‘(𝑅‘(◡𝐺‘𝐵))) = 𝐵)
72	71	opeq1d 3866	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → ⟨(1st ‘(𝑅‘(◡𝐺‘𝐵))), (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩ = ⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩)
73	63, 72	eqtrd 2262	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑅‘(◡𝐺‘𝐵)) = ⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩)
74	73	fveq2d 5639	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘(𝑅‘(◡𝐺‘𝐵))) = ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩))
75	58, 74	eqtrd 2262	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑅‘suc (◡𝐺‘𝐵)) = ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩))
76		df-ov 6016	. . . . . 6 ⊢ (𝐵(𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd ‘(𝑅‘(◡𝐺‘𝐵)))) = ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩)
77	75, 76	eqtr4di 2280	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑅‘suc (◡𝐺‘𝐵)) = (𝐵(𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
78		simpr 110	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → 𝐵 ∈ (ℤ≥‘𝐶))
79		xp2nd 6324	. . . . . . . 8 ⊢ ((𝑅‘(◡𝐺‘𝐵)) ∈ ((ℤ≥‘𝐶) × 𝑆) → (2nd ‘(𝑅‘(◡𝐺‘𝐵))) ∈ 𝑆)
80	61, 79	syl 14	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (2nd ‘(𝑅‘(◡𝐺‘𝐵))) ∈ 𝑆)
81	66, 80	sseldd 3226	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (2nd ‘(𝑅‘(◡𝐺‘𝐵))) ∈ 𝑇)
82		peano2uz 9807	. . . . . . . 8 ⊢ (𝐵 ∈ (ℤ≥‘𝐶) → (𝐵 + 1) ∈ (ℤ≥‘𝐶))
83	82	adantl 277	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝐵 + 1) ∈ (ℤ≥‘𝐶))
84	67, 78, 80	caovcld 6171	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝐵𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))) ∈ 𝑆)
85		opelxp 4753	. . . . . . 7 ⊢ (⟨(𝐵 + 1), (𝐵𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩ ∈ ((ℤ≥‘𝐶) × 𝑆) ↔ ((𝐵 + 1) ∈ (ℤ≥‘𝐶) ∧ (𝐵𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))) ∈ 𝑆))
86	83, 84, 85	sylanbrc 417	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → ⟨(𝐵 + 1), (𝐵𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩ ∈ ((ℤ≥‘𝐶) × 𝑆))
87		oveq1 6020	. . . . . . . 8 ⊢ (𝑥 = 𝐵 → (𝑥 + 1) = (𝐵 + 1))
88		oveq1 6020	. . . . . . . 8 ⊢ (𝑥 = 𝐵 → (𝑥𝐹𝑦) = (𝐵𝐹𝑦))
89	87, 88	opeq12d 3868	. . . . . . 7 ⊢ (𝑥 = 𝐵 → ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩ = ⟨(𝐵 + 1), (𝐵𝐹𝑦)⟩)
90		oveq2 6021	. . . . . . . 8 ⊢ (𝑦 = (2nd ‘(𝑅‘(◡𝐺‘𝐵))) → (𝐵𝐹𝑦) = (𝐵𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
91	90	opeq2d 3867	. . . . . . 7 ⊢ (𝑦 = (2nd ‘(𝑅‘(◡𝐺‘𝐵))) → ⟨(𝐵 + 1), (𝐵𝐹𝑦)⟩ = ⟨(𝐵 + 1), (𝐵𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩)
92	89, 91, 38	ovmpog 6151	. . . . . 6 ⊢ ((𝐵 ∈ (ℤ≥‘𝐶) ∧ (2nd ‘(𝑅‘(◡𝐺‘𝐵))) ∈ 𝑇 ∧ ⟨(𝐵 + 1), (𝐵𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩ ∈ ((ℤ≥‘𝐶) × 𝑆)) → (𝐵(𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd ‘(𝑅‘(◡𝐺‘𝐵)))) = ⟨(𝐵 + 1), (𝐵𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩)
93	78, 81, 86, 92	syl3anc 1271	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝐵(𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd ‘(𝑅‘(◡𝐺‘𝐵)))) = ⟨(𝐵 + 1), (𝐵𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩)
94	77, 93	eqtrd 2262	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑅‘suc (◡𝐺‘𝐵)) = ⟨(𝐵 + 1), (𝐵𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩)
95		ffun 5482	. . . . . . 7 ⊢ (𝑅:ω⟶((ℤ≥‘𝐶) × 𝑆) → Fun 𝑅)
96	60, 95	syl 14	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → Fun 𝑅)
97		peano2 4691	. . . . . . . 8 ⊢ ((◡𝐺‘𝐵) ∈ ω → suc (◡𝐺‘𝐵) ∈ ω)
98	52, 97	syl 14	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → suc (◡𝐺‘𝐵) ∈ ω)
99		fdm 5485	. . . . . . . 8 ⊢ (𝑅:ω⟶((ℤ≥‘𝐶) × 𝑆) → dom 𝑅 = ω)
100	60, 99	syl 14	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → dom 𝑅 = ω)
101	98, 100	eleqtrrd 2309	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → suc (◡𝐺‘𝐵) ∈ dom 𝑅)
102		fvelrn 5774	. . . . . 6 ⊢ ((Fun 𝑅 ∧ suc (◡𝐺‘𝐵) ∈ dom 𝑅) → (𝑅‘suc (◡𝐺‘𝐵)) ∈ ran 𝑅)
103	96, 101, 102	syl2anc 411	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑅‘suc (◡𝐺‘𝐵)) ∈ ran 𝑅)
104	6	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → 𝑃 = ran 𝑅)
105	103, 104	eleqtrrd 2309	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑅‘suc (◡𝐺‘𝐵)) ∈ 𝑃)
106	94, 105	eqeltrrd 2307	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → ⟨(𝐵 + 1), (𝐵𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩ ∈ 𝑃)
107		funopfv 5679	. . 3 ⊢ (Fun 𝑃 → (⟨(𝐵 + 1), (𝐵𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩ ∈ 𝑃 → (𝑃‘(𝐵 + 1)) = (𝐵𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))))
108	10, 106, 107	sylc 62	. 2 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑃‘(𝐵 + 1)) = (𝐵𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
109	52, 100	eleqtrrd 2309	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (◡𝐺‘𝐵) ∈ dom 𝑅)
110		fvelrn 5774	. . . . . . 7 ⊢ ((Fun 𝑅 ∧ (◡𝐺‘𝐵) ∈ dom 𝑅) → (𝑅‘(◡𝐺‘𝐵)) ∈ ran 𝑅)
111	96, 109, 110	syl2anc 411	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑅‘(◡𝐺‘𝐵)) ∈ ran 𝑅)
112	111, 104	eleqtrrd 2309	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑅‘(◡𝐺‘𝐵)) ∈ 𝑃)
113	73, 112	eqeltrrd 2307	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → ⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩ ∈ 𝑃)
114		funopfv 5679	. . . 4 ⊢ (Fun 𝑃 → (⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩ ∈ 𝑃 → (𝑃‘𝐵) = (2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
115	10, 113, 114	sylc 62	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑃‘𝐵) = (2nd ‘(𝑅‘(◡𝐺‘𝐵))))
116	115	oveq2d 6029	. 2 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝐵𝐹(𝑃‘𝐵)) = (𝐵𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
117	108, 116	eqtr4d 2265	1 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑃‘(𝐵 + 1)) = (𝐵𝐹(𝑃‘𝐵)))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1395   ∈ wcel 2200  ∀wral 2508   ⊆ wss 3198  ⟨cop 3670   ↦ cmpt 4148  suc csuc 4460  ωcom 4686   × cxp 4721  ^◡ccnv 4722  dom cdm 4723  ran crn 4724  Fun wfun 5318  ⟶wf 5320  –1-1-onto→wf1o 5323  ‘cfv 5324  (class class class)co 6013   ∈ cmpo 6015  1^st c1st 6296  2^nd c2nd 6297  freccfrec 6551  1c1 8023   + caddc 8025  ℤcz 9469  ℤ_≥cuz 9745

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-in1 617  ax-in2 618  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-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4202  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-iinf 4684  ax-cnex 8113  ax-resscn 8114  ax-1cn 8115  ax-1re 8116  ax-icn 8117  ax-addcl 8118  ax-addrcl 8119  ax-mulcl 8120  ax-addcom 8122  ax-addass 8124  ax-distr 8126  ax-i2m1 8127  ax-0lt1 8128  ax-0id 8130  ax-rnegex 8131  ax-cnre 8133  ax-pre-ltirr 8134  ax-pre-ltwlin 8135  ax-pre-lttrn 8136  ax-pre-ltadd 8138

This theorem depends on definitions:  df-bi 117  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-tr 4186  df-id 4388  df-iord 4461  df-on 4463  df-ilim 4464  df-suc 4466  df-iom 4687  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1st 6298  df-2nd 6299  df-recs 6466  df-frec 6552  df-pnf 8206  df-mnf 8207  df-xr 8208  df-ltxr 8209  df-le 8210  df-sub 8342  df-neg 8343  df-inn 9134  df-n0 9393  df-z 9470  df-uz 9746

This theorem is referenced by:  frecuzrdgsuct  10676