Theorem frecuzrdgsuctlem 10425

Description: Successor value of a recursive definition generator on upper integers. See comment in frec2uz0d 10401 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 10423	. . . . 5 ⊢ (𝜑 → 𝑃:(ℤ≥‘𝐶)⟶𝑆)
8	7	adantr 276	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → 𝑃:(ℤ≥‘𝐶)⟶𝑆)
9		ffun 5370	. . . 4 ⊢ (𝑃:(ℤ≥‘𝐶)⟶𝑆 → Fun 𝑃)
10	8, 9	syl 14	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → Fun 𝑃)
11		1st2nd2 6178	. . . . . . . . . . . . . . 15 ⊢ (𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆) → 𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩)
12	11	adantl 277	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → 𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩)
13	12	fveq2d 5521	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘𝑧) = ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘⟨(1st ‘𝑧), (2nd ‘𝑧)⟩))
14		df-ov 5880	. . . . . . . . . . . . 13 ⊢ ((1st ‘𝑧)(𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd ‘𝑧)) = ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘⟨(1st ‘𝑧), (2nd ‘𝑧)⟩)
15	13, 14	eqtr4di 2228	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘𝑧) = ((1st ‘𝑧)(𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd ‘𝑧)))
16		xp1st 6168	. . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆) → (1st ‘𝑧) ∈ (ℤ≥‘𝐶))
17	16	adantl 277	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → (1st ‘𝑧) ∈ (ℤ≥‘𝐶))
18	3	ad2antrr 488	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → 𝑆 ⊆ 𝑇)
19		xp2nd 6169	. . . . . . . . . . . . . . 15 ⊢ (𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆) → (2nd ‘𝑧) ∈ 𝑆)
20	19	adantl 277	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → (2nd ‘𝑧) ∈ 𝑆)
21	18, 20	sseldd 3158	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → (2nd ‘𝑧) ∈ 𝑇)
22		peano2uz 9585	. . . . . . . . . . . . . . 15 ⊢ ((1st ‘𝑧) ∈ (ℤ≥‘𝐶) → ((1st ‘𝑧) + 1) ∈ (ℤ≥‘𝐶))
23	17, 22	syl 14	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((1st ‘𝑧) + 1) ∈ (ℤ≥‘𝐶))
24		oveq2 5885	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = (2nd ‘𝑧) → ((1st ‘𝑧)𝐹𝑦) = ((1st ‘𝑧)𝐹(2nd ‘𝑧)))
25	24	eleq1d 2246	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = (2nd ‘𝑧) → (((1st ‘𝑧)𝐹𝑦) ∈ 𝑆 ↔ ((1st ‘𝑧)𝐹(2nd ‘𝑧)) ∈ 𝑆))
26		oveq1 5884	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = (1st ‘𝑧) → (𝑥𝐹𝑦) = ((1st ‘𝑧)𝐹𝑦))
27	26	eleq1d 2246	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = (1st ‘𝑧) → ((𝑥𝐹𝑦) ∈ 𝑆 ↔ ((1st ‘𝑧)𝐹𝑦) ∈ 𝑆))
28	27	ralbidv 2477	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = (1st ‘𝑧) → (∀𝑦 ∈ 𝑆 (𝑥𝐹𝑦) ∈ 𝑆 ↔ ∀𝑦 ∈ 𝑆 ((1st ‘𝑧)𝐹𝑦) ∈ 𝑆))
29	4	ralrimivva 2559	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ∀𝑥 ∈ (ℤ≥‘𝐶)∀𝑦 ∈ 𝑆 (𝑥𝐹𝑦) ∈ 𝑆)
30	29	ad2antrr 488	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ∀𝑥 ∈ (ℤ≥‘𝐶)∀𝑦 ∈ 𝑆 (𝑥𝐹𝑦) ∈ 𝑆)
31	28, 30, 17	rspcdva 2848	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ∀𝑦 ∈ 𝑆 ((1st ‘𝑧)𝐹𝑦) ∈ 𝑆)
32	25, 31, 20	rspcdva 2848	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((1st ‘𝑧)𝐹(2nd ‘𝑧)) ∈ 𝑆)
33		opelxpi 4660	. . . . . . . . . . . . . 14 ⊢ ((((1st ‘𝑧) + 1) ∈ (ℤ≥‘𝐶) ∧ ((1st ‘𝑧)𝐹(2nd ‘𝑧)) ∈ 𝑆) → ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹(2nd ‘𝑧))⟩ ∈ ((ℤ≥‘𝐶) × 𝑆))
34	23, 32, 33	syl2anc 411	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹(2nd ‘𝑧))⟩ ∈ ((ℤ≥‘𝐶) × 𝑆))
35		oveq1 5884	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = (1st ‘𝑧) → (𝑥 + 1) = ((1st ‘𝑧) + 1))
36	35, 26	opeq12d 3788	. . . . . . . . . . . . . 14 ⊢ (𝑥 = (1st ‘𝑧) → ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩ = ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹𝑦)⟩)
37	24	opeq2d 3787	. . . . . . . . . . . . . 14 ⊢ (𝑦 = (2nd ‘𝑧) → ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹𝑦)⟩ = ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹(2nd ‘𝑧))⟩)
38		eqid 2177	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩) = (𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)
39	36, 37, 38	ovmpog 6011	. . . . . . . . . . . . 13 ⊢ (((1st ‘𝑧) ∈ (ℤ≥‘𝐶) ∧ (2nd ‘𝑧) ∈ 𝑇 ∧ ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹(2nd ‘𝑧))⟩ ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((1st ‘𝑧)(𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd ‘𝑧)) = ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹(2nd ‘𝑧))⟩)
40	17, 21, 34, 39	syl3anc 1238	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((1st ‘𝑧)(𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd ‘𝑧)) = ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹(2nd ‘𝑧))⟩)
41	15, 40	eqtrd 2210	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘𝑧) = ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹(2nd ‘𝑧))⟩)
42	41, 34	eqeltrd 2254	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘𝑧) ∈ ((ℤ≥‘𝐶) × 𝑆))
43	42	ralrimiva 2550	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → ∀𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘𝑧) ∈ ((ℤ≥‘𝐶) × 𝑆))
44		uzid 9544	. . . . . . . . . . . 12 ⊢ (𝐶 ∈ ℤ → 𝐶 ∈ (ℤ≥‘𝐶))
45	1, 44	syl 14	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐶 ∈ (ℤ≥‘𝐶))
46		opelxpi 4660	. . . . . . . . . . 11 ⊢ ((𝐶 ∈ (ℤ≥‘𝐶) ∧ 𝐴 ∈ 𝑆) → ⟨𝐶, 𝐴⟩ ∈ ((ℤ≥‘𝐶) × 𝑆))
47	45, 2, 46	syl2anc 411	. . . . . . . . . 10 ⊢ (𝜑 → ⟨𝐶, 𝐴⟩ ∈ ((ℤ≥‘𝐶) × 𝑆))
48	47	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → ⟨𝐶, 𝐴⟩ ∈ ((ℤ≥‘𝐶) × 𝑆))
49		frecuzrdgsuctlem.g	. . . . . . . . . . 11 ⊢ 𝐺 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 𝐶)
50	1, 49	frec2uzf1od 10408	. . . . . . . . . 10 ⊢ (𝜑 → 𝐺:ω–1-1-onto→(ℤ≥‘𝐶))
51		f1ocnvdm 5784	. . . . . . . . . 10 ⊢ ((𝐺:ω–1-1-onto→(ℤ≥‘𝐶) ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (◡𝐺‘𝐵) ∈ ω)
52	50, 51	sylan 283	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (◡𝐺‘𝐵) ∈ ω)
53		frecsuc 6410	. . . . . . . . 9 ⊢ ((∀𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘𝑧) ∈ ((ℤ≥‘𝐶) × 𝑆) ∧ ⟨𝐶, 𝐴⟩ ∈ ((ℤ≥‘𝐶) × 𝑆) ∧ (◡𝐺‘𝐵) ∈ ω) → (frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩)‘suc (◡𝐺‘𝐵)) = ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘(frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩)‘(◡𝐺‘𝐵))))
54	43, 48, 52, 53	syl3anc 1238	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩)‘suc (◡𝐺‘𝐵)) = ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘(frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩)‘(◡𝐺‘𝐵))))
55	5	fveq1i 5518	. . . . . . . 8 ⊢ (𝑅‘suc (◡𝐺‘𝐵)) = (frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩)‘suc (◡𝐺‘𝐵))
56	5	fveq1i 5518	. . . . . . . . 9 ⊢ (𝑅‘(◡𝐺‘𝐵)) = (frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩)‘(◡𝐺‘𝐵))
57	56	fveq2i 5520	. . . . . . . 8 ⊢ ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘(𝑅‘(◡𝐺‘𝐵))) = ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘(frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩)‘(◡𝐺‘𝐵)))
58	54, 55, 57	3eqtr4g 2235	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑅‘suc (◡𝐺‘𝐵)) = ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘(𝑅‘(◡𝐺‘𝐵))))
59	1, 2, 3, 4, 5	frecuzrdgrclt 10417	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑅:ω⟶((ℤ≥‘𝐶) × 𝑆))
60	59	adantr 276	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → 𝑅:ω⟶((ℤ≥‘𝐶) × 𝑆))
61	60, 52	ffvelcdmd 5654	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑅‘(◡𝐺‘𝐵)) ∈ ((ℤ≥‘𝐶) × 𝑆))
62		1st2nd2 6178	. . . . . . . . . 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 10418	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (1st ‘(𝑅‘(◡𝐺‘𝐵))) = (𝐺‘(◡𝐺‘𝐵)))
69		f1ocnvfv2 5781	. . . . . . . . . . . 12 ⊢ ((𝐺:ω–1-1-onto→(ℤ≥‘𝐶) ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝐺‘(◡𝐺‘𝐵)) = 𝐵)
70	50, 69	sylan 283	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝐺‘(◡𝐺‘𝐵)) = 𝐵)
71	68, 70	eqtrd 2210	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (1st ‘(𝑅‘(◡𝐺‘𝐵))) = 𝐵)
72	71	opeq1d 3786	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → ⟨(1st ‘(𝑅‘(◡𝐺‘𝐵))), (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩ = ⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩)
73	63, 72	eqtrd 2210	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑅‘(◡𝐺‘𝐵)) = ⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩)
74	73	fveq2d 5521	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘(𝑅‘(◡𝐺‘𝐵))) = ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩))
75	58, 74	eqtrd 2210	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑅‘suc (◡𝐺‘𝐵)) = ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩))
76		df-ov 5880	. . . . . 6 ⊢ (𝐵(𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd ‘(𝑅‘(◡𝐺‘𝐵)))) = ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩)
77	75, 76	eqtr4di 2228	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑅‘suc (◡𝐺‘𝐵)) = (𝐵(𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
78		simpr 110	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → 𝐵 ∈ (ℤ≥‘𝐶))
79		xp2nd 6169	. . . . . . . 8 ⊢ ((𝑅‘(◡𝐺‘𝐵)) ∈ ((ℤ≥‘𝐶) × 𝑆) → (2nd ‘(𝑅‘(◡𝐺‘𝐵))) ∈ 𝑆)
80	61, 79	syl 14	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (2nd ‘(𝑅‘(◡𝐺‘𝐵))) ∈ 𝑆)
81	66, 80	sseldd 3158	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (2nd ‘(𝑅‘(◡𝐺‘𝐵))) ∈ 𝑇)
82		peano2uz 9585	. . . . . . . 8 ⊢ (𝐵 ∈ (ℤ≥‘𝐶) → (𝐵 + 1) ∈ (ℤ≥‘𝐶))
83	82	adantl 277	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝐵 + 1) ∈ (ℤ≥‘𝐶))
84	67, 78, 80	caovcld 6030	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝐵𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))) ∈ 𝑆)
85		opelxp 4658	. . . . . . 7 ⊢ (⟨(𝐵 + 1), (𝐵𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩ ∈ ((ℤ≥‘𝐶) × 𝑆) ↔ ((𝐵 + 1) ∈ (ℤ≥‘𝐶) ∧ (𝐵𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))) ∈ 𝑆))
86	83, 84, 85	sylanbrc 417	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → ⟨(𝐵 + 1), (𝐵𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩ ∈ ((ℤ≥‘𝐶) × 𝑆))
87		oveq1 5884	. . . . . . . 8 ⊢ (𝑥 = 𝐵 → (𝑥 + 1) = (𝐵 + 1))
88		oveq1 5884	. . . . . . . 8 ⊢ (𝑥 = 𝐵 → (𝑥𝐹𝑦) = (𝐵𝐹𝑦))
89	87, 88	opeq12d 3788	. . . . . . 7 ⊢ (𝑥 = 𝐵 → ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩ = ⟨(𝐵 + 1), (𝐵𝐹𝑦)⟩)
90		oveq2 5885	. . . . . . . 8 ⊢ (𝑦 = (2nd ‘(𝑅‘(◡𝐺‘𝐵))) → (𝐵𝐹𝑦) = (𝐵𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
91	90	opeq2d 3787	. . . . . . 7 ⊢ (𝑦 = (2nd ‘(𝑅‘(◡𝐺‘𝐵))) → ⟨(𝐵 + 1), (𝐵𝐹𝑦)⟩ = ⟨(𝐵 + 1), (𝐵𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩)
92	89, 91, 38	ovmpog 6011	. . . . . 6 ⊢ ((𝐵 ∈ (ℤ≥‘𝐶) ∧ (2nd ‘(𝑅‘(◡𝐺‘𝐵))) ∈ 𝑇 ∧ ⟨(𝐵 + 1), (𝐵𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩ ∈ ((ℤ≥‘𝐶) × 𝑆)) → (𝐵(𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd ‘(𝑅‘(◡𝐺‘𝐵)))) = ⟨(𝐵 + 1), (𝐵𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩)
93	78, 81, 86, 92	syl3anc 1238	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝐵(𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd ‘(𝑅‘(◡𝐺‘𝐵)))) = ⟨(𝐵 + 1), (𝐵𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩)
94	77, 93	eqtrd 2210	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑅‘suc (◡𝐺‘𝐵)) = ⟨(𝐵 + 1), (𝐵𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩)
95		ffun 5370	. . . . . . 7 ⊢ (𝑅:ω⟶((ℤ≥‘𝐶) × 𝑆) → Fun 𝑅)
96	60, 95	syl 14	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → Fun 𝑅)
97		peano2 4596	. . . . . . . 8 ⊢ ((◡𝐺‘𝐵) ∈ ω → suc (◡𝐺‘𝐵) ∈ ω)
98	52, 97	syl 14	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → suc (◡𝐺‘𝐵) ∈ ω)
99		fdm 5373	. . . . . . . 8 ⊢ (𝑅:ω⟶((ℤ≥‘𝐶) × 𝑆) → dom 𝑅 = ω)
100	60, 99	syl 14	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → dom 𝑅 = ω)
101	98, 100	eleqtrrd 2257	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → suc (◡𝐺‘𝐵) ∈ dom 𝑅)
102		fvelrn 5649	. . . . . 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 2257	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑅‘suc (◡𝐺‘𝐵)) ∈ 𝑃)
106	94, 105	eqeltrrd 2255	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → ⟨(𝐵 + 1), (𝐵𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩ ∈ 𝑃)
107		funopfv 5557	. . 3 ⊢ (Fun 𝑃 → (⟨(𝐵 + 1), (𝐵𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩ ∈ 𝑃 → (𝑃‘(𝐵 + 1)) = (𝐵𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))))
108	10, 106, 107	sylc 62	. 2 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑃‘(𝐵 + 1)) = (𝐵𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
109	52, 100	eleqtrrd 2257	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (◡𝐺‘𝐵) ∈ dom 𝑅)
110		fvelrn 5649	. . . . . . 7 ⊢ ((Fun 𝑅 ∧ (◡𝐺‘𝐵) ∈ dom 𝑅) → (𝑅‘(◡𝐺‘𝐵)) ∈ ran 𝑅)
111	96, 109, 110	syl2anc 411	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑅‘(◡𝐺‘𝐵)) ∈ ran 𝑅)
112	111, 104	eleqtrrd 2257	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑅‘(◡𝐺‘𝐵)) ∈ 𝑃)
113	73, 112	eqeltrrd 2255	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → ⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩ ∈ 𝑃)
114		funopfv 5557	. . . 4 ⊢ (Fun 𝑃 → (⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩ ∈ 𝑃 → (𝑃‘𝐵) = (2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
115	10, 113, 114	sylc 62	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑃‘𝐵) = (2nd ‘(𝑅‘(◡𝐺‘𝐵))))
116	115	oveq2d 5893	. 2 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝐵𝐹(𝑃‘𝐵)) = (𝐵𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
117	108, 116	eqtr4d 2213	1 ⊢ ((𝜑 ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝑃‘(𝐵 + 1)) = (𝐵𝐹(𝑃‘𝐵)))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1353   ∈ wcel 2148  ∀wral 2455   ⊆ wss 3131  ⟨cop 3597   ↦ cmpt 4066  suc csuc 4367  ωcom 4591   × cxp 4626  ^◡ccnv 4627  dom cdm 4628  ran crn 4629  Fun wfun 5212  ⟶wf 5214  –1-1-onto→wf1o 5217  ‘cfv 5218  (class class class)co 5877   ∈ cmpo 5879  1^st c1st 6141  2^nd c2nd 6142  freccfrec 6393  1c1 7814   + caddc 7816  ℤcz 9255  ℤ_≥cuz 9530

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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4120  ax-sep 4123  ax-nul 4131  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538  ax-iinf 4589  ax-cnex 7904  ax-resscn 7905  ax-1cn 7906  ax-1re 7907  ax-icn 7908  ax-addcl 7909  ax-addrcl 7910  ax-mulcl 7911  ax-addcom 7913  ax-addass 7915  ax-distr 7917  ax-i2m1 7918  ax-0lt1 7919  ax-0id 7921  ax-rnegex 7922  ax-cnre 7924  ax-pre-ltirr 7925  ax-pre-ltwlin 7926  ax-pre-lttrn 7927  ax-pre-ltadd 7929

This theorem depends on definitions:  df-bi 117  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2741  df-sbc 2965  df-csb 3060  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-nul 3425  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-int 3847  df-iun 3890  df-br 4006  df-opab 4067  df-mpt 4068  df-tr 4104  df-id 4295  df-iord 4368  df-on 4370  df-ilim 4371  df-suc 4373  df-iom 4592  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-f1 5223  df-fo 5224  df-f1o 5225  df-fv 5226  df-riota 5833  df-ov 5880  df-oprab 5881  df-mpo 5882  df-1st 6143  df-2nd 6144  df-recs 6308  df-frec 6394  df-pnf 7996  df-mnf 7997  df-xr 7998  df-ltxr 7999  df-le 8000  df-sub 8132  df-neg 8133  df-inn 8922  df-n0 9179  df-z 9256  df-uz 9531

This theorem is referenced by:  frecuzrdgsuct  10426