Theorem frecuzrdgfunlem 10354

Description: The recursive definition generator on upper integers produces a a function. (Contributed by Jim Kingdon, 24-Apr-2022.)

Hypotheses

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

Assertion

Ref	Expression
frecuzrdgfunlem	⊢ (𝜑 → Fun ran 𝑅)

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

Allowed substitution hints:   𝐴(𝑥,𝑦)

Proof of Theorem frecuzrdgfunlem

Dummy variables 𝑧 𝑤 𝑣 are mutually distinct and 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	1, 2, 3, 4, 5	frecuzrdgrclt 10350	. . . . 5 ⊢ (𝜑 → 𝑅:ω⟶((ℤ≥‘𝐶) × 𝑆))
7		frn 5346	. . . . 5 ⊢ (𝑅:ω⟶((ℤ≥‘𝐶) × 𝑆) → ran 𝑅 ⊆ ((ℤ≥‘𝐶) × 𝑆))
8	6, 7	syl 14	. . . 4 ⊢ (𝜑 → ran 𝑅 ⊆ ((ℤ≥‘𝐶) × 𝑆))
9		xpss 4712	. . . 4 ⊢ ((ℤ≥‘𝐶) × 𝑆) ⊆ (V × V)
10	8, 9	sstrdi 3154	. . 3 ⊢ (𝜑 → ran 𝑅 ⊆ (V × V))
11		df-rel 4611	. . 3 ⊢ (Rel ran 𝑅 ↔ ran 𝑅 ⊆ (V × V))
12	10, 11	sylibr 133	. 2 ⊢ (𝜑 → Rel ran 𝑅)
13		frecuzrdgfunlem.g	. . . . . . . . . 10 ⊢ 𝐺 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 𝐶)
14	1, 13	frec2uzf1od 10341	. . . . . . . . 9 ⊢ (𝜑 → 𝐺:ω–1-1-onto→(ℤ≥‘𝐶))
15		f1ocnvdm 5749	. . . . . . . . 9 ⊢ ((𝐺:ω–1-1-onto→(ℤ≥‘𝐶) ∧ 𝑣 ∈ (ℤ≥‘𝐶)) → (◡𝐺‘𝑣) ∈ ω)
16	14, 15	sylan 281	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑣 ∈ (ℤ≥‘𝐶)) → (◡𝐺‘𝑣) ∈ ω)
17	6	ffvelrnda 5620	. . . . . . . 8 ⊢ ((𝜑 ∧ (◡𝐺‘𝑣) ∈ ω) → (𝑅‘(◡𝐺‘𝑣)) ∈ ((ℤ≥‘𝐶) × 𝑆))
18	16, 17	syldan 280	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑣 ∈ (ℤ≥‘𝐶)) → (𝑅‘(◡𝐺‘𝑣)) ∈ ((ℤ≥‘𝐶) × 𝑆))
19		xp2nd 6134	. . . . . . 7 ⊢ ((𝑅‘(◡𝐺‘𝑣)) ∈ ((ℤ≥‘𝐶) × 𝑆) → (2nd ‘(𝑅‘(◡𝐺‘𝑣))) ∈ 𝑆)
20	18, 19	syl 14	. . . . . 6 ⊢ ((𝜑 ∧ 𝑣 ∈ (ℤ≥‘𝐶)) → (2nd ‘(𝑅‘(◡𝐺‘𝑣))) ∈ 𝑆)
21		ffn 5337	. . . . . . . . . 10 ⊢ (𝑅:ω⟶((ℤ≥‘𝐶) × 𝑆) → 𝑅 Fn ω)
22		fvelrnb 5534	. . . . . . . . . 10 ⊢ (𝑅 Fn ω → (⟨𝑣, 𝑧⟩ ∈ ran 𝑅 ↔ ∃𝑤 ∈ ω (𝑅‘𝑤) = ⟨𝑣, 𝑧⟩))
23	6, 21, 22	3syl 17	. . . . . . . . 9 ⊢ (𝜑 → (⟨𝑣, 𝑧⟩ ∈ ran 𝑅 ↔ ∃𝑤 ∈ ω (𝑅‘𝑤) = ⟨𝑣, 𝑧⟩))
24	6	ffvelrnda 5620	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑤 ∈ ω) → (𝑅‘𝑤) ∈ ((ℤ≥‘𝐶) × 𝑆))
25		1st2nd2 6143	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑅‘𝑤) ∈ ((ℤ≥‘𝐶) × 𝑆) → (𝑅‘𝑤) = ⟨(1st ‘(𝑅‘𝑤)), (2nd ‘(𝑅‘𝑤))⟩)
26	24, 25	syl 14	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑤 ∈ ω) → (𝑅‘𝑤) = ⟨(1st ‘(𝑅‘𝑤)), (2nd ‘(𝑅‘𝑤))⟩)
27	1	adantr 274	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑤 ∈ ω) → 𝐶 ∈ ℤ)
28	2	adantr 274	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑤 ∈ ω) → 𝐴 ∈ 𝑆)
29	3	adantr 274	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑤 ∈ ω) → 𝑆 ⊆ 𝑇)
30	4	adantlr 469	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑤 ∈ ω) ∧ (𝑥 ∈ (ℤ≥‘𝐶) ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) ∈ 𝑆)
31		simpr 109	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑤 ∈ ω) → 𝑤 ∈ ω)
32	27, 28, 29, 30, 5, 31, 13	frecuzrdgg 10351	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑤 ∈ ω) → (1st ‘(𝑅‘𝑤)) = (𝐺‘𝑤))
33	32	opeq1d 3764	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑤 ∈ ω) → ⟨(1st ‘(𝑅‘𝑤)), (2nd ‘(𝑅‘𝑤))⟩ = ⟨(𝐺‘𝑤), (2nd ‘(𝑅‘𝑤))⟩)
34	26, 33	eqtrd 2198	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑤 ∈ ω) → (𝑅‘𝑤) = ⟨(𝐺‘𝑤), (2nd ‘(𝑅‘𝑤))⟩)
35	34	eqeq1d 2174	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑤 ∈ ω) → ((𝑅‘𝑤) = ⟨𝑣, 𝑧⟩ ↔ ⟨(𝐺‘𝑤), (2nd ‘(𝑅‘𝑤))⟩ = ⟨𝑣, 𝑧⟩))
36		vex 2729	. . . . . . . . . . . . . . . . . 18 ⊢ 𝑣 ∈ V
37		vex 2729	. . . . . . . . . . . . . . . . . 18 ⊢ 𝑧 ∈ V
38	36, 37	opth2 4218	. . . . . . . . . . . . . . . . 17 ⊢ (⟨(𝐺‘𝑤), (2nd ‘(𝑅‘𝑤))⟩ = ⟨𝑣, 𝑧⟩ ↔ ((𝐺‘𝑤) = 𝑣 ∧ (2nd ‘(𝑅‘𝑤)) = 𝑧))
39	38	simplbi 272	. . . . . . . . . . . . . . . 16 ⊢ (⟨(𝐺‘𝑤), (2nd ‘(𝑅‘𝑤))⟩ = ⟨𝑣, 𝑧⟩ → (𝐺‘𝑤) = 𝑣)
40	35, 39	syl6bi 162	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑤 ∈ ω) → ((𝑅‘𝑤) = ⟨𝑣, 𝑧⟩ → (𝐺‘𝑤) = 𝑣))
41		f1ocnvfv 5747	. . . . . . . . . . . . . . . 16 ⊢ ((𝐺:ω–1-1-onto→(ℤ≥‘𝐶) ∧ 𝑤 ∈ ω) → ((𝐺‘𝑤) = 𝑣 → (◡𝐺‘𝑣) = 𝑤))
42	14, 41	sylan 281	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑤 ∈ ω) → ((𝐺‘𝑤) = 𝑣 → (◡𝐺‘𝑣) = 𝑤))
43	40, 42	syld 45	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑤 ∈ ω) → ((𝑅‘𝑤) = ⟨𝑣, 𝑧⟩ → (◡𝐺‘𝑣) = 𝑤))
44		fveq2 5486	. . . . . . . . . . . . . . 15 ⊢ ((◡𝐺‘𝑣) = 𝑤 → (𝑅‘(◡𝐺‘𝑣)) = (𝑅‘𝑤))
45	44	fveq2d 5490	. . . . . . . . . . . . . 14 ⊢ ((◡𝐺‘𝑣) = 𝑤 → (2nd ‘(𝑅‘(◡𝐺‘𝑣))) = (2nd ‘(𝑅‘𝑤)))
46	43, 45	syl6 33	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑤 ∈ ω) → ((𝑅‘𝑤) = ⟨𝑣, 𝑧⟩ → (2nd ‘(𝑅‘(◡𝐺‘𝑣))) = (2nd ‘(𝑅‘𝑤))))
47	46	imp 123	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑤 ∈ ω) ∧ (𝑅‘𝑤) = ⟨𝑣, 𝑧⟩) → (2nd ‘(𝑅‘(◡𝐺‘𝑣))) = (2nd ‘(𝑅‘𝑤)))
48	36, 37	op2ndd 6117	. . . . . . . . . . . . 13 ⊢ ((𝑅‘𝑤) = ⟨𝑣, 𝑧⟩ → (2nd ‘(𝑅‘𝑤)) = 𝑧)
49	48	adantl 275	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑤 ∈ ω) ∧ (𝑅‘𝑤) = ⟨𝑣, 𝑧⟩) → (2nd ‘(𝑅‘𝑤)) = 𝑧)
50	47, 49	eqtr2d 2199	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑤 ∈ ω) ∧ (𝑅‘𝑤) = ⟨𝑣, 𝑧⟩) → 𝑧 = (2nd ‘(𝑅‘(◡𝐺‘𝑣))))
51	50	ex 114	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑤 ∈ ω) → ((𝑅‘𝑤) = ⟨𝑣, 𝑧⟩ → 𝑧 = (2nd ‘(𝑅‘(◡𝐺‘𝑣)))))
52	51	rexlimdva 2583	. . . . . . . . 9 ⊢ (𝜑 → (∃𝑤 ∈ ω (𝑅‘𝑤) = ⟨𝑣, 𝑧⟩ → 𝑧 = (2nd ‘(𝑅‘(◡𝐺‘𝑣)))))
53	23, 52	sylbid 149	. . . . . . . 8 ⊢ (𝜑 → (⟨𝑣, 𝑧⟩ ∈ ran 𝑅 → 𝑧 = (2nd ‘(𝑅‘(◡𝐺‘𝑣)))))
54	53	alrimiv 1862	. . . . . . 7 ⊢ (𝜑 → ∀𝑧(⟨𝑣, 𝑧⟩ ∈ ran 𝑅 → 𝑧 = (2nd ‘(𝑅‘(◡𝐺‘𝑣)))))
55	54	adantr 274	. . . . . 6 ⊢ ((𝜑 ∧ 𝑣 ∈ (ℤ≥‘𝐶)) → ∀𝑧(⟨𝑣, 𝑧⟩ ∈ ran 𝑅 → 𝑧 = (2nd ‘(𝑅‘(◡𝐺‘𝑣)))))
56		eqeq2 2175	. . . . . . . . 9 ⊢ (𝑤 = (2nd ‘(𝑅‘(◡𝐺‘𝑣))) → (𝑧 = 𝑤 ↔ 𝑧 = (2nd ‘(𝑅‘(◡𝐺‘𝑣)))))
57	56	imbi2d 229	. . . . . . . 8 ⊢ (𝑤 = (2nd ‘(𝑅‘(◡𝐺‘𝑣))) → ((⟨𝑣, 𝑧⟩ ∈ ran 𝑅 → 𝑧 = 𝑤) ↔ (⟨𝑣, 𝑧⟩ ∈ ran 𝑅 → 𝑧 = (2nd ‘(𝑅‘(◡𝐺‘𝑣))))))
58	57	albidv 1812	. . . . . . 7 ⊢ (𝑤 = (2nd ‘(𝑅‘(◡𝐺‘𝑣))) → (∀𝑧(⟨𝑣, 𝑧⟩ ∈ ran 𝑅 → 𝑧 = 𝑤) ↔ ∀𝑧(⟨𝑣, 𝑧⟩ ∈ ran 𝑅 → 𝑧 = (2nd ‘(𝑅‘(◡𝐺‘𝑣))))))
59	58	spcegv 2814	. . . . . 6 ⊢ ((2nd ‘(𝑅‘(◡𝐺‘𝑣))) ∈ 𝑆 → (∀𝑧(⟨𝑣, 𝑧⟩ ∈ ran 𝑅 → 𝑧 = (2nd ‘(𝑅‘(◡𝐺‘𝑣)))) → ∃𝑤∀𝑧(⟨𝑣, 𝑧⟩ ∈ ran 𝑅 → 𝑧 = 𝑤)))
60	20, 55, 59	sylc 62	. . . . 5 ⊢ ((𝜑 ∧ 𝑣 ∈ (ℤ≥‘𝐶)) → ∃𝑤∀𝑧(⟨𝑣, 𝑧⟩ ∈ ran 𝑅 → 𝑧 = 𝑤))
61		nfv 1516	. . . . . 6 ⊢ Ⅎ𝑤⟨𝑣, 𝑧⟩ ∈ ran 𝑅
62	61	mo2r 2066	. . . . 5 ⊢ (∃𝑤∀𝑧(⟨𝑣, 𝑧⟩ ∈ ran 𝑅 → 𝑧 = 𝑤) → ∃*𝑧⟨𝑣, 𝑧⟩ ∈ ran 𝑅)
63	60, 62	syl 14	. . . 4 ⊢ ((𝜑 ∧ 𝑣 ∈ (ℤ≥‘𝐶)) → ∃*𝑧⟨𝑣, 𝑧⟩ ∈ ran 𝑅)
64	1, 2, 3, 4, 5	frecuzrdgdom 10353	. . . . . 6 ⊢ (𝜑 → dom ran 𝑅 = (ℤ≥‘𝐶))
65	64	eleq2d 2236	. . . . 5 ⊢ (𝜑 → (𝑣 ∈ dom ran 𝑅 ↔ 𝑣 ∈ (ℤ≥‘𝐶)))
66	65	pm5.32i 450	. . . 4 ⊢ ((𝜑 ∧ 𝑣 ∈ dom ran 𝑅) ↔ (𝜑 ∧ 𝑣 ∈ (ℤ≥‘𝐶)))
67		df-br 3983	. . . . 5 ⊢ (𝑣ran 𝑅 𝑧 ↔ ⟨𝑣, 𝑧⟩ ∈ ran 𝑅)
68	67	mobii 2051	. . . 4 ⊢ (∃*𝑧 𝑣ran 𝑅 𝑧 ↔ ∃*𝑧⟨𝑣, 𝑧⟩ ∈ ran 𝑅)
69	63, 66, 68	3imtr4i 200	. . 3 ⊢ ((𝜑 ∧ 𝑣 ∈ dom ran 𝑅) → ∃*𝑧 𝑣ran 𝑅 𝑧)
70	69	ralrimiva 2539	. 2 ⊢ (𝜑 → ∀𝑣 ∈ dom ran 𝑅∃*𝑧 𝑣ran 𝑅 𝑧)
71		dffun7 5215	. 2 ⊢ (Fun ran 𝑅 ↔ (Rel ran 𝑅 ∧ ∀𝑣 ∈ dom ran 𝑅∃*𝑧 𝑣ran 𝑅 𝑧))
72	12, 70, 71	sylanbrc 414	1 ⊢ (𝜑 → Fun ran 𝑅)

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104  ∀wal 1341   = wceq 1343  ∃wex 1480  ∃*wmo 2015   ∈ wcel 2136  ∀wral 2444  ∃wrex 2445  Vcvv 2726   ⊆ wss 3116  ⟨cop 3579   class class class wbr 3982   ↦ cmpt 4043  ωcom 4567   × cxp 4602  ^◡ccnv 4603  dom cdm 4604  ran crn 4605  Rel wrel 4609  Fun wfun 5182   Fn wfn 5183  ⟶wf 5184  –1-1-onto→wf1o 5187  ‘cfv 5188  (class class class)co 5842   ∈ cmpo 5844  1^st c1st 6106  2^nd c2nd 6107  freccfrec 6358  1c1 7754   + caddc 7756  ℤcz 9191  ℤ_≥cuz 9466

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-coll 4097  ax-sep 4100  ax-nul 4108  ax-pow 4153  ax-pr 4187  ax-un 4411  ax-setind 4514  ax-iinf 4565  ax-cnex 7844  ax-resscn 7845  ax-1cn 7846  ax-1re 7847  ax-icn 7848  ax-addcl 7849  ax-addrcl 7850  ax-mulcl 7851  ax-addcom 7853  ax-addass 7855  ax-distr 7857  ax-i2m1 7858  ax-0lt1 7859  ax-0id 7861  ax-rnegex 7862  ax-cnre 7864  ax-pre-ltirr 7865  ax-pre-ltwlin 7866  ax-pre-lttrn 7867  ax-pre-ltadd 7869

This theorem depends on definitions:  df-bi 116  df-3or 969  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-nel 2432  df-ral 2449  df-rex 2450  df-reu 2451  df-rab 2453  df-v 2728  df-sbc 2952  df-csb 3046  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-nul 3410  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-int 3825  df-iun 3868  df-br 3983  df-opab 4044  df-mpt 4045  df-tr 4081  df-id 4271  df-iord 4344  df-on 4346  df-ilim 4347  df-suc 4349  df-iom 4568  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-f1 5193  df-fo 5194  df-f1o 5195  df-fv 5196  df-riota 5798  df-ov 5845  df-oprab 5846  df-mpo 5847  df-1st 6108  df-2nd 6109  df-recs 6273  df-frec 6359  df-pnf 7935  df-mnf 7936  df-xr 7937  df-ltxr 7938  df-le 7939  df-sub 8071  df-neg 8072  df-inn 8858  df-n0 9115  df-z 9192  df-uz 9467

This theorem is referenced by:  frecuzrdgfun  10355