Theorem rdgon 6543

Description: Evaluating the recursive definition generator produces an ordinal. There is a hypothesis that the characteristic function produces ordinals on ordinal arguments. (Contributed by Jim Kingdon, 26-Jul-2019.) (Revised by Jim Kingdon, 13-Apr-2022.)

Hypotheses

Ref	Expression
rdgon.2	⊢ (𝜑 → 𝐴 ∈ On)
rdgon.3	⊢ (𝜑 → ∀𝑥 ∈ On (𝐹‘𝑥) ∈ On)

Assertion

Ref	Expression
rdgon	⊢ ((𝜑 ∧ 𝐵 ∈ On) → (rec(𝐹, 𝐴)‘𝐵) ∈ On)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐹   𝜑,𝑥

Proof of Theorem rdgon

Dummy variables 𝑓 𝑔 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-irdg 6527	. 2 ⊢ rec(𝐹, 𝐴) = recs((𝑔 ∈ V ↦ (𝐴 ∪ ∪ 𝑥 ∈ dom 𝑔(𝐹‘(𝑔‘𝑥)))))
2		funmpt 5359	. . 3 ⊢ Fun (𝑔 ∈ V ↦ (𝐴 ∪ ∪ 𝑥 ∈ dom 𝑔(𝐹‘(𝑔‘𝑥))))
3	2	a1i 9	. 2 ⊢ ((𝜑 ∧ 𝐵 ∈ On) → Fun (𝑔 ∈ V ↦ (𝐴 ∪ ∪ 𝑥 ∈ dom 𝑔(𝐹‘(𝑔‘𝑥)))))
4		ordon 4579	. . 3 ⊢ Ord On
5	4	a1i 9	. 2 ⊢ ((𝜑 ∧ 𝐵 ∈ On) → Ord On)
6		vex 2802	. . . 4 ⊢ 𝑓 ∈ V
7		rdgon.2	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ On)
8	7	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ On) → 𝐴 ∈ On)
9	8	3ad2ant1 1042	. . . . 5 ⊢ (((𝜑 ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On ∧ 𝑓:𝑦⟶On) → 𝐴 ∈ On)
10	6	dmex 4994	. . . . . 6 ⊢ dom 𝑓 ∈ V
11		fveq2 5632	. . . . . . . . . 10 ⊢ (𝑥 = (𝑓‘𝑧) → (𝐹‘𝑥) = (𝐹‘(𝑓‘𝑧)))
12	11	eleq1d 2298	. . . . . . . . 9 ⊢ (𝑥 = (𝑓‘𝑧) → ((𝐹‘𝑥) ∈ On ↔ (𝐹‘(𝑓‘𝑧)) ∈ On))
13		rdgon.3	. . . . . . . . . . . 12 ⊢ (𝜑 → ∀𝑥 ∈ On (𝐹‘𝑥) ∈ On)
14	13	adantr 276	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐵 ∈ On) → ∀𝑥 ∈ On (𝐹‘𝑥) ∈ On)
15	14	3ad2ant1 1042	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On ∧ 𝑓:𝑦⟶On) → ∀𝑥 ∈ On (𝐹‘𝑥) ∈ On)
16	15	adantr 276	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On ∧ 𝑓:𝑦⟶On) ∧ 𝑧 ∈ dom 𝑓) → ∀𝑥 ∈ On (𝐹‘𝑥) ∈ On)
17		simpl3 1026	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On ∧ 𝑓:𝑦⟶On) ∧ 𝑧 ∈ dom 𝑓) → 𝑓:𝑦⟶On)
18		simpr 110	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On ∧ 𝑓:𝑦⟶On) ∧ 𝑧 ∈ dom 𝑓) → 𝑧 ∈ dom 𝑓)
19		fdm 5482	. . . . . . . . . . . . 13 ⊢ (𝑓:𝑦⟶On → dom 𝑓 = 𝑦)
20	19	eleq2d 2299	. . . . . . . . . . . 12 ⊢ (𝑓:𝑦⟶On → (𝑧 ∈ dom 𝑓 ↔ 𝑧 ∈ 𝑦))
21	17, 20	syl 14	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On ∧ 𝑓:𝑦⟶On) ∧ 𝑧 ∈ dom 𝑓) → (𝑧 ∈ dom 𝑓 ↔ 𝑧 ∈ 𝑦))
22	18, 21	mpbid 147	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On ∧ 𝑓:𝑦⟶On) ∧ 𝑧 ∈ dom 𝑓) → 𝑧 ∈ 𝑦)
23	17, 22	ffvelcdmd 5776	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On ∧ 𝑓:𝑦⟶On) ∧ 𝑧 ∈ dom 𝑓) → (𝑓‘𝑧) ∈ On)
24	12, 16, 23	rspcdva 2912	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On ∧ 𝑓:𝑦⟶On) ∧ 𝑧 ∈ dom 𝑓) → (𝐹‘(𝑓‘𝑧)) ∈ On)
25	24	ralrimiva 2603	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On ∧ 𝑓:𝑦⟶On) → ∀𝑧 ∈ dom 𝑓(𝐹‘(𝑓‘𝑧)) ∈ On)
26		fveq2 5632	. . . . . . . . . 10 ⊢ (𝑥 = 𝑧 → (𝑓‘𝑥) = (𝑓‘𝑧))
27	26	fveq2d 5636	. . . . . . . . 9 ⊢ (𝑥 = 𝑧 → (𝐹‘(𝑓‘𝑥)) = (𝐹‘(𝑓‘𝑧)))
28	27	eleq1d 2298	. . . . . . . 8 ⊢ (𝑥 = 𝑧 → ((𝐹‘(𝑓‘𝑥)) ∈ On ↔ (𝐹‘(𝑓‘𝑧)) ∈ On))
29	28	cbvralv 2765	. . . . . . 7 ⊢ (∀𝑥 ∈ dom 𝑓(𝐹‘(𝑓‘𝑥)) ∈ On ↔ ∀𝑧 ∈ dom 𝑓(𝐹‘(𝑓‘𝑧)) ∈ On)
30	25, 29	sylibr 134	. . . . . 6 ⊢ (((𝜑 ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On ∧ 𝑓:𝑦⟶On) → ∀𝑥 ∈ dom 𝑓(𝐹‘(𝑓‘𝑥)) ∈ On)
31		iunon 6441	. . . . . 6 ⊢ ((dom 𝑓 ∈ V ∧ ∀𝑥 ∈ dom 𝑓(𝐹‘(𝑓‘𝑥)) ∈ On) → ∪ 𝑥 ∈ dom 𝑓(𝐹‘(𝑓‘𝑥)) ∈ On)
32	10, 30, 31	sylancr 414	. . . . 5 ⊢ (((𝜑 ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On ∧ 𝑓:𝑦⟶On) → ∪ 𝑥 ∈ dom 𝑓(𝐹‘(𝑓‘𝑥)) ∈ On)
33		onun2 4583	. . . . 5 ⊢ ((𝐴 ∈ On ∧ ∪ 𝑥 ∈ dom 𝑓(𝐹‘(𝑓‘𝑥)) ∈ On) → (𝐴 ∪ ∪ 𝑥 ∈ dom 𝑓(𝐹‘(𝑓‘𝑥))) ∈ On)
34	9, 32, 33	syl2anc 411	. . . 4 ⊢ (((𝜑 ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On ∧ 𝑓:𝑦⟶On) → (𝐴 ∪ ∪ 𝑥 ∈ dom 𝑓(𝐹‘(𝑓‘𝑥))) ∈ On)
35		dmeq 4926	. . . . . . 7 ⊢ (𝑔 = 𝑓 → dom 𝑔 = dom 𝑓)
36		fveq1 5631	. . . . . . . 8 ⊢ (𝑔 = 𝑓 → (𝑔‘𝑥) = (𝑓‘𝑥))
37	36	fveq2d 5636	. . . . . . 7 ⊢ (𝑔 = 𝑓 → (𝐹‘(𝑔‘𝑥)) = (𝐹‘(𝑓‘𝑥)))
38	35, 37	iuneq12d 3989	. . . . . 6 ⊢ (𝑔 = 𝑓 → ∪ 𝑥 ∈ dom 𝑔(𝐹‘(𝑔‘𝑥)) = ∪ 𝑥 ∈ dom 𝑓(𝐹‘(𝑓‘𝑥)))
39	38	uneq2d 3358	. . . . 5 ⊢ (𝑔 = 𝑓 → (𝐴 ∪ ∪ 𝑥 ∈ dom 𝑔(𝐹‘(𝑔‘𝑥))) = (𝐴 ∪ ∪ 𝑥 ∈ dom 𝑓(𝐹‘(𝑓‘𝑥))))
40		eqid 2229	. . . . 5 ⊢ (𝑔 ∈ V ↦ (𝐴 ∪ ∪ 𝑥 ∈ dom 𝑔(𝐹‘(𝑔‘𝑥)))) = (𝑔 ∈ V ↦ (𝐴 ∪ ∪ 𝑥 ∈ dom 𝑔(𝐹‘(𝑔‘𝑥))))
41	39, 40	fvmptg 5715	. . . 4 ⊢ ((𝑓 ∈ V ∧ (𝐴 ∪ ∪ 𝑥 ∈ dom 𝑓(𝐹‘(𝑓‘𝑥))) ∈ On) → ((𝑔 ∈ V ↦ (𝐴 ∪ ∪ 𝑥 ∈ dom 𝑔(𝐹‘(𝑔‘𝑥))))‘𝑓) = (𝐴 ∪ ∪ 𝑥 ∈ dom 𝑓(𝐹‘(𝑓‘𝑥))))
42	6, 34, 41	sylancr 414	. . 3 ⊢ (((𝜑 ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On ∧ 𝑓:𝑦⟶On) → ((𝑔 ∈ V ↦ (𝐴 ∪ ∪ 𝑥 ∈ dom 𝑔(𝐹‘(𝑔‘𝑥))))‘𝑓) = (𝐴 ∪ ∪ 𝑥 ∈ dom 𝑓(𝐹‘(𝑓‘𝑥))))
43	42, 34	eqeltrd 2306	. 2 ⊢ (((𝜑 ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On ∧ 𝑓:𝑦⟶On) → ((𝑔 ∈ V ↦ (𝐴 ∪ ∪ 𝑥 ∈ dom 𝑔(𝐹‘(𝑔‘𝑥))))‘𝑓) ∈ On)
44		unon 4604	. . . . . 6 ⊢ ∪ On = On
45	44	eleq2i 2296	. . . . 5 ⊢ (𝑦 ∈ ∪ On ↔ 𝑦 ∈ On)
46	45	biimpi 120	. . . 4 ⊢ (𝑦 ∈ ∪ On → 𝑦 ∈ On)
47	46	adantl 277	. . 3 ⊢ (((𝜑 ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ ∪ On) → 𝑦 ∈ On)
48		onsuc 4594	. . 3 ⊢ (𝑦 ∈ On → suc 𝑦 ∈ On)
49	47, 48	syl 14	. 2 ⊢ (((𝜑 ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ ∪ On) → suc 𝑦 ∈ On)
50	44	eleq2i 2296	. . . 4 ⊢ (𝐵 ∈ ∪ On ↔ 𝐵 ∈ On)
51	50	biimpri 133	. . 3 ⊢ (𝐵 ∈ On → 𝐵 ∈ ∪ On)
52	51	adantl 277	. 2 ⊢ ((𝜑 ∧ 𝐵 ∈ On) → 𝐵 ∈ ∪ On)
53	1, 3, 5, 43, 49, 52	tfrcl 6521	1 ⊢ ((𝜑 ∧ 𝐵 ∈ On) → (rec(𝐹, 𝐴)‘𝐵) ∈ On)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 1002   = wceq 1395   ∈ wcel 2200  ∀wral 2508  Vcvv 2799   ∪ cun 3195  ∪ cuni 3888  ∪ ciun 3965   ↦ cmpt 4145  Ord word 4454  Oncon0 4455  suc csuc 4457  dom cdm 4720  Fun wfun 5315  ⟶wf 5317  ‘cfv 5321  reccrdg 6526

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 4199  ax-sep 4202  ax-pow 4259  ax-pr 4294  ax-un 4525  ax-setind 4630

This theorem depends on definitions:  df-bi 117  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-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-tr 4183  df-id 4385  df-iord 4458  df-on 4460  df-suc 4463  df-xp 4726  df-rel 4727  df-cnv 4728  df-co 4729  df-dm 4730  df-rn 4731  df-res 4732  df-ima 4733  df-iota 5281  df-fun 5323  df-fn 5324  df-f 5325  df-f1 5326  df-fo 5327  df-f1o 5328  df-fv 5329  df-recs 6462  df-irdg 6527

This theorem is referenced by:  oacl  6619  omcl  6620  oeicl  6621