Theorem tfrlemi14d 6604

Description: The domain of recs is all ordinals (lemma for transfinite recursion). (Contributed by Jim Kingdon, 9-Jul-2019.)

Hypotheses

Ref	Expression
tfrlemi14d.1	⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))}
tfrlemi14d.2	⊢ (𝜑 → ∀𝑥(Fun 𝐹 ∧ (𝐹‘𝑥) ∈ V))

Assertion

Ref	Expression
tfrlemi14d	⊢ (𝜑 → dom recs(𝐹) = On)

Distinct variable groups:   𝑥,𝑓,𝑦,𝐴   𝑓,𝐹,𝑥,𝑦   𝜑,𝑓,𝑦

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem tfrlemi14d

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

Step	Hyp	Ref	Expression
1		tfrlemi14d.1	. . . 4 ⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))}
2	1	tfrlem8 6589	. . 3 ⊢ Ord dom recs(𝐹)
3		ordsson 4639	. . 3 ⊢ (Ord dom recs(𝐹) → dom recs(𝐹) ⊆ On)
4	2, 3	mp1i 10	. 2 ⊢ (𝜑 → dom recs(𝐹) ⊆ On)
5		tfrlemi14d.2	. . . . . . . 8 ⊢ (𝜑 → ∀𝑥(Fun 𝐹 ∧ (𝐹‘𝑥) ∈ V))
6	1, 5	tfrlemi1 6603	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ On) → ∃𝑔(𝑔 Fn 𝑧 ∧ ∀𝑢 ∈ 𝑧 (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢))))
7	5	ad2antrr 492	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ On) ∧ (𝑔 Fn 𝑧 ∧ ∀𝑢 ∈ 𝑧 (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢)))) → ∀𝑥(Fun 𝐹 ∧ (𝐹‘𝑥) ∈ V))
8		simplr 533	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ On) ∧ (𝑔 Fn 𝑧 ∧ ∀𝑢 ∈ 𝑧 (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢)))) → 𝑧 ∈ On)
9		simprl 535	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ On) ∧ (𝑔 Fn 𝑧 ∧ ∀𝑢 ∈ 𝑧 (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢)))) → 𝑔 Fn 𝑧)
10		fneq2 5470	. . . . . . . . . . . . 13 ⊢ (𝑤 = 𝑧 → (𝑔 Fn 𝑤 ↔ 𝑔 Fn 𝑧))
11		raleq 2749	. . . . . . . . . . . . 13 ⊢ (𝑤 = 𝑧 → (∀𝑢 ∈ 𝑤 (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢)) ↔ ∀𝑢 ∈ 𝑧 (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢))))
12	10, 11	anbi12d 477	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑧 → ((𝑔 Fn 𝑤 ∧ ∀𝑢 ∈ 𝑤 (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢))) ↔ (𝑔 Fn 𝑧 ∧ ∀𝑢 ∈ 𝑧 (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢)))))
13	12	rspcev 2929	. . . . . . . . . . 11 ⊢ ((𝑧 ∈ On ∧ (𝑔 Fn 𝑧 ∧ ∀𝑢 ∈ 𝑧 (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢)))) → ∃𝑤 ∈ On (𝑔 Fn 𝑤 ∧ ∀𝑢 ∈ 𝑤 (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢))))
14	13	adantll 480	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ On) ∧ (𝑔 Fn 𝑧 ∧ ∀𝑢 ∈ 𝑧 (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢)))) → ∃𝑤 ∈ On (𝑔 Fn 𝑤 ∧ ∀𝑢 ∈ 𝑤 (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢))))
15		vex 2824	. . . . . . . . . . 11 ⊢ 𝑔 ∈ V
16	1, 15	tfrlem3a 6581	. . . . . . . . . 10 ⊢ (𝑔 ∈ 𝐴 ↔ ∃𝑤 ∈ On (𝑔 Fn 𝑤 ∧ ∀𝑢 ∈ 𝑤 (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢))))
17	14, 16	sylibr 134	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ On) ∧ (𝑔 Fn 𝑧 ∧ ∀𝑢 ∈ 𝑧 (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢)))) → 𝑔 ∈ 𝐴)
18	1, 7, 8, 9, 17	tfrlemisucaccv 6596	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ On) ∧ (𝑔 Fn 𝑧 ∧ ∀𝑢 ∈ 𝑧 (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢)))) → (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ∈ 𝐴)
19		vex 2824	. . . . . . . . . . . 12 ⊢ 𝑧 ∈ V
20	5	tfrlem3-2d 6583	. . . . . . . . . . . . 13 ⊢ (𝜑 → (Fun 𝐹 ∧ (𝐹‘𝑔) ∈ V))
21	20	simprd 114	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐹‘𝑔) ∈ V)
22		opexg 4368	. . . . . . . . . . . 12 ⊢ ((𝑧 ∈ V ∧ (𝐹‘𝑔) ∈ V) → ⟨𝑧, (𝐹‘𝑔)⟩ ∈ V)
23	19, 21, 22	sylancr 418	. . . . . . . . . . 11 ⊢ (𝜑 → ⟨𝑧, (𝐹‘𝑔)⟩ ∈ V)
24		snidg 3738	. . . . . . . . . . 11 ⊢ (⟨𝑧, (𝐹‘𝑔)⟩ ∈ V → ⟨𝑧, (𝐹‘𝑔)⟩ ∈ {⟨𝑧, (𝐹‘𝑔)⟩})
25		elun2 3397	. . . . . . . . . . 11 ⊢ (⟨𝑧, (𝐹‘𝑔)⟩ ∈ {⟨𝑧, (𝐹‘𝑔)⟩} → ⟨𝑧, (𝐹‘𝑔)⟩ ∈ (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}))
26	23, 24, 25	3syl 17	. . . . . . . . . 10 ⊢ (𝜑 → ⟨𝑧, (𝐹‘𝑔)⟩ ∈ (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}))
27	26	ad2antrr 492	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ On) ∧ (𝑔 Fn 𝑧 ∧ ∀𝑢 ∈ 𝑧 (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢)))) → ⟨𝑧, (𝐹‘𝑔)⟩ ∈ (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}))
28		opeldmg 4986	. . . . . . . . . . 11 ⊢ ((𝑧 ∈ V ∧ (𝐹‘𝑔) ∈ V) → (⟨𝑧, (𝐹‘𝑔)⟩ ∈ (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) → 𝑧 ∈ dom (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩})))
29	19, 21, 28	sylancr 418	. . . . . . . . . 10 ⊢ (𝜑 → (⟨𝑧, (𝐹‘𝑔)⟩ ∈ (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) → 𝑧 ∈ dom (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩})))
30	29	ad2antrr 492	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ On) ∧ (𝑔 Fn 𝑧 ∧ ∀𝑢 ∈ 𝑧 (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢)))) → (⟨𝑧, (𝐹‘𝑔)⟩ ∈ (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) → 𝑧 ∈ dom (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩})))
31	27, 30	mpd 13	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ On) ∧ (𝑔 Fn 𝑧 ∧ ∀𝑢 ∈ 𝑧 (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢)))) → 𝑧 ∈ dom (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}))
32		dmeq 4981	. . . . . . . . . 10 ⊢ (ℎ = (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) → dom ℎ = dom (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}))
33	32	eleq2d 2308	. . . . . . . . 9 ⊢ (ℎ = (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) → (𝑧 ∈ dom ℎ ↔ 𝑧 ∈ dom (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩})))
34	33	rspcev 2929	. . . . . . . 8 ⊢ (((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ∈ 𝐴 ∧ 𝑧 ∈ dom (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩})) → ∃ℎ ∈ 𝐴 𝑧 ∈ dom ℎ)
35	18, 31, 34	syl2anc 415	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ On) ∧ (𝑔 Fn 𝑧 ∧ ∀𝑢 ∈ 𝑧 (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢)))) → ∃ℎ ∈ 𝐴 𝑧 ∈ dom ℎ)
36	6, 35	exlimddv 1954	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ On) → ∃ℎ ∈ 𝐴 𝑧 ∈ dom ℎ)
37		eliun 4016	. . . . . 6 ⊢ (𝑧 ∈ ∪ ℎ ∈ 𝐴 dom ℎ ↔ ∃ℎ ∈ 𝐴 𝑧 ∈ dom ℎ)
38	36, 37	sylibr 134	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ On) → 𝑧 ∈ ∪ ℎ ∈ 𝐴 dom ℎ)
39	38	ex 115	. . . 4 ⊢ (𝜑 → (𝑧 ∈ On → 𝑧 ∈ ∪ ℎ ∈ 𝐴 dom ℎ))
40	39	ssrdv 3254	. . 3 ⊢ (𝜑 → On ⊆ ∪ ℎ ∈ 𝐴 dom ℎ)
41	1	recsfval 6586	. . . . 5 ⊢ recs(𝐹) = ∪ 𝐴
42	41	dmeqi 4982	. . . 4 ⊢ dom recs(𝐹) = dom ∪ 𝐴
43		dmuni 4991	. . . 4 ⊢ dom ∪ 𝐴 = ∪ ℎ ∈ 𝐴 dom ℎ
44	42, 43	eqtri 2259	. . 3 ⊢ dom recs(𝐹) = ∪ ℎ ∈ 𝐴 dom ℎ
45	40, 44	sseqtrrdi 3297	. 2 ⊢ (𝜑 → On ⊆ dom recs(𝐹))
46	4, 45	eqssd 3265	1 ⊢ (𝜑 → dom recs(𝐹) = On)

This proof depends on syntax axioms:   → wi 4   ∧ wa 104  ∀wal 1400   = wceq 1402   ∈ wcel 2209  {cab 2224  ∀wral 2528  ∃wrex 2529  Vcvv 2821   ∪ cun 3218   ⊆ wss 3220  {csn 3709  ⟨cop 3712  ∪ cuni 3935  ∪ ciun 4012  Ord word 4507  Oncon0 4508  dom cdm 4774   ↾ cres 4776  Fun wfun 5371   Fn wfn 5372  ‘cfv 5377  recscrecs 6575

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-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684

This proof depends on definitions:  df-bi 117  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-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-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  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-recs 6576

This theorem is used by:  tfri1d  6606