Theorem tfrlem9a 8331

Description: Lemma for transfinite recursion. Without using ax-rep 5229, show that all the restrictions of recs are sets. (Contributed by Mario Carneiro, 16-Nov-2014.)

Hypothesis

Ref	Expression
tfrlem.1	⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))}

Assertion

Ref	Expression
tfrlem9a	⊢ (𝐵 ∈ dom recs(𝐹) → (recs(𝐹) ↾ 𝐵) ∈ V)

Distinct variable groups:   𝑥,𝑓,𝑦,𝐵   𝑓,𝐹,𝑥,𝑦

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

Proof of Theorem tfrlem9a

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

Step	Hyp	Ref	Expression
1		tfrlem.1	. . . . 5 ⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))}
2	1	tfrlem7 8328	. . . 4 ⊢ Fun recs(𝐹)
3		funfvop 7004	. . . 4 ⊢ ((Fun recs(𝐹) ∧ 𝐵 ∈ dom recs(𝐹)) → ⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ recs(𝐹))
4	2, 3	mpan 690	. . 3 ⊢ (𝐵 ∈ dom recs(𝐹) → ⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ recs(𝐹))
5	1	recsfval 8326	. . . . 5 ⊢ recs(𝐹) = ∪ 𝐴
6	5	eleq2i 2820	. . . 4 ⊢ (⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ recs(𝐹) ↔ ⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ ∪ 𝐴)
7		eluni 4870	. . . 4 ⊢ (⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ ∪ 𝐴 ↔ ∃𝑔(⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ 𝑔 ∧ 𝑔 ∈ 𝐴))
8	6, 7	bitri 275	. . 3 ⊢ (⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ recs(𝐹) ↔ ∃𝑔(⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ 𝑔 ∧ 𝑔 ∈ 𝐴))
9	4, 8	sylib 218	. 2 ⊢ (𝐵 ∈ dom recs(𝐹) → ∃𝑔(⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ 𝑔 ∧ 𝑔 ∈ 𝐴))
10		simprr 772	. . . 4 ⊢ ((𝐵 ∈ dom recs(𝐹) ∧ (⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ 𝑔 ∧ 𝑔 ∈ 𝐴)) → 𝑔 ∈ 𝐴)
11		vex 3448	. . . . 5 ⊢ 𝑔 ∈ V
12	1, 11	tfrlem3a 8322	. . . 4 ⊢ (𝑔 ∈ 𝐴 ↔ ∃𝑧 ∈ On (𝑔 Fn 𝑧 ∧ ∀𝑎 ∈ 𝑧 (𝑔‘𝑎) = (𝐹‘(𝑔 ↾ 𝑎))))
13	10, 12	sylib 218	. . 3 ⊢ ((𝐵 ∈ dom recs(𝐹) ∧ (⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ 𝑔 ∧ 𝑔 ∈ 𝐴)) → ∃𝑧 ∈ On (𝑔 Fn 𝑧 ∧ ∀𝑎 ∈ 𝑧 (𝑔‘𝑎) = (𝐹‘(𝑔 ↾ 𝑎))))
14	2	a1i 11	. . . . . . . 8 ⊢ (((𝐵 ∈ dom recs(𝐹) ∧ (⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ 𝑔 ∧ 𝑔 ∈ 𝐴)) ∧ (𝑧 ∈ On ∧ 𝑔 Fn 𝑧)) → Fun recs(𝐹))
15		simplrr 777	. . . . . . . . . 10 ⊢ (((𝐵 ∈ dom recs(𝐹) ∧ (⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ 𝑔 ∧ 𝑔 ∈ 𝐴)) ∧ (𝑧 ∈ On ∧ 𝑔 Fn 𝑧)) → 𝑔 ∈ 𝐴)
16		elssuni 4897	. . . . . . . . . 10 ⊢ (𝑔 ∈ 𝐴 → 𝑔 ⊆ ∪ 𝐴)
17	15, 16	syl 17	. . . . . . . . 9 ⊢ (((𝐵 ∈ dom recs(𝐹) ∧ (⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ 𝑔 ∧ 𝑔 ∈ 𝐴)) ∧ (𝑧 ∈ On ∧ 𝑔 Fn 𝑧)) → 𝑔 ⊆ ∪ 𝐴)
18	17, 5	sseqtrrdi 3985	. . . . . . . 8 ⊢ (((𝐵 ∈ dom recs(𝐹) ∧ (⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ 𝑔 ∧ 𝑔 ∈ 𝐴)) ∧ (𝑧 ∈ On ∧ 𝑔 Fn 𝑧)) → 𝑔 ⊆ recs(𝐹))
19		fndm 6603	. . . . . . . . . . . 12 ⊢ (𝑔 Fn 𝑧 → dom 𝑔 = 𝑧)
20	19	ad2antll 729	. . . . . . . . . . 11 ⊢ (((𝐵 ∈ dom recs(𝐹) ∧ (⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ 𝑔 ∧ 𝑔 ∈ 𝐴)) ∧ (𝑧 ∈ On ∧ 𝑔 Fn 𝑧)) → dom 𝑔 = 𝑧)
21		simprl 770	. . . . . . . . . . 11 ⊢ (((𝐵 ∈ dom recs(𝐹) ∧ (⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ 𝑔 ∧ 𝑔 ∈ 𝐴)) ∧ (𝑧 ∈ On ∧ 𝑔 Fn 𝑧)) → 𝑧 ∈ On)
22	20, 21	eqeltrd 2828	. . . . . . . . . 10 ⊢ (((𝐵 ∈ dom recs(𝐹) ∧ (⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ 𝑔 ∧ 𝑔 ∈ 𝐴)) ∧ (𝑧 ∈ On ∧ 𝑔 Fn 𝑧)) → dom 𝑔 ∈ On)
23		eloni 6330	. . . . . . . . . 10 ⊢ (dom 𝑔 ∈ On → Ord dom 𝑔)
24	22, 23	syl 17	. . . . . . . . 9 ⊢ (((𝐵 ∈ dom recs(𝐹) ∧ (⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ 𝑔 ∧ 𝑔 ∈ 𝐴)) ∧ (𝑧 ∈ On ∧ 𝑔 Fn 𝑧)) → Ord dom 𝑔)
25		simpll 766	. . . . . . . . . 10 ⊢ (((𝐵 ∈ dom recs(𝐹) ∧ (⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ 𝑔 ∧ 𝑔 ∈ 𝐴)) ∧ (𝑧 ∈ On ∧ 𝑔 Fn 𝑧)) → 𝐵 ∈ dom recs(𝐹))
26		fvexd 6855	. . . . . . . . . 10 ⊢ (((𝐵 ∈ dom recs(𝐹) ∧ (⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ 𝑔 ∧ 𝑔 ∈ 𝐴)) ∧ (𝑧 ∈ On ∧ 𝑔 Fn 𝑧)) → (recs(𝐹)‘𝐵) ∈ V)
27		simplrl 776	. . . . . . . . . . 11 ⊢ (((𝐵 ∈ dom recs(𝐹) ∧ (⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ 𝑔 ∧ 𝑔 ∈ 𝐴)) ∧ (𝑧 ∈ On ∧ 𝑔 Fn 𝑧)) → ⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ 𝑔)
28		df-br 5103	. . . . . . . . . . 11 ⊢ (𝐵𝑔(recs(𝐹)‘𝐵) ↔ ⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ 𝑔)
29	27, 28	sylibr 234	. . . . . . . . . 10 ⊢ (((𝐵 ∈ dom recs(𝐹) ∧ (⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ 𝑔 ∧ 𝑔 ∈ 𝐴)) ∧ (𝑧 ∈ On ∧ 𝑔 Fn 𝑧)) → 𝐵𝑔(recs(𝐹)‘𝐵))
30		breldmg 5863	. . . . . . . . . 10 ⊢ ((𝐵 ∈ dom recs(𝐹) ∧ (recs(𝐹)‘𝐵) ∈ V ∧ 𝐵𝑔(recs(𝐹)‘𝐵)) → 𝐵 ∈ dom 𝑔)
31	25, 26, 29, 30	syl3anc 1373	. . . . . . . . 9 ⊢ (((𝐵 ∈ dom recs(𝐹) ∧ (⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ 𝑔 ∧ 𝑔 ∈ 𝐴)) ∧ (𝑧 ∈ On ∧ 𝑔 Fn 𝑧)) → 𝐵 ∈ dom 𝑔)
32		ordelss 6336	. . . . . . . . 9 ⊢ ((Ord dom 𝑔 ∧ 𝐵 ∈ dom 𝑔) → 𝐵 ⊆ dom 𝑔)
33	24, 31, 32	syl2anc 584	. . . . . . . 8 ⊢ (((𝐵 ∈ dom recs(𝐹) ∧ (⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ 𝑔 ∧ 𝑔 ∈ 𝐴)) ∧ (𝑧 ∈ On ∧ 𝑔 Fn 𝑧)) → 𝐵 ⊆ dom 𝑔)
34		fun2ssres 6545	. . . . . . . 8 ⊢ ((Fun recs(𝐹) ∧ 𝑔 ⊆ recs(𝐹) ∧ 𝐵 ⊆ dom 𝑔) → (recs(𝐹) ↾ 𝐵) = (𝑔 ↾ 𝐵))
35	14, 18, 33, 34	syl3anc 1373	. . . . . . 7 ⊢ (((𝐵 ∈ dom recs(𝐹) ∧ (⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ 𝑔 ∧ 𝑔 ∈ 𝐴)) ∧ (𝑧 ∈ On ∧ 𝑔 Fn 𝑧)) → (recs(𝐹) ↾ 𝐵) = (𝑔 ↾ 𝐵))
36	11	resex 5989	. . . . . . . 8 ⊢ (𝑔 ↾ 𝐵) ∈ V
37	36	a1i 11	. . . . . . 7 ⊢ (((𝐵 ∈ dom recs(𝐹) ∧ (⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ 𝑔 ∧ 𝑔 ∈ 𝐴)) ∧ (𝑧 ∈ On ∧ 𝑔 Fn 𝑧)) → (𝑔 ↾ 𝐵) ∈ V)
38	35, 37	eqeltrd 2828	. . . . . 6 ⊢ (((𝐵 ∈ dom recs(𝐹) ∧ (⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ 𝑔 ∧ 𝑔 ∈ 𝐴)) ∧ (𝑧 ∈ On ∧ 𝑔 Fn 𝑧)) → (recs(𝐹) ↾ 𝐵) ∈ V)
39	38	expr 456	. . . . 5 ⊢ (((𝐵 ∈ dom recs(𝐹) ∧ (⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ 𝑔 ∧ 𝑔 ∈ 𝐴)) ∧ 𝑧 ∈ On) → (𝑔 Fn 𝑧 → (recs(𝐹) ↾ 𝐵) ∈ V))
40	39	adantrd 491	. . . 4 ⊢ (((𝐵 ∈ dom recs(𝐹) ∧ (⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ 𝑔 ∧ 𝑔 ∈ 𝐴)) ∧ 𝑧 ∈ On) → ((𝑔 Fn 𝑧 ∧ ∀𝑎 ∈ 𝑧 (𝑔‘𝑎) = (𝐹‘(𝑔 ↾ 𝑎))) → (recs(𝐹) ↾ 𝐵) ∈ V))
41	40	rexlimdva 3134	. . 3 ⊢ ((𝐵 ∈ dom recs(𝐹) ∧ (⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ 𝑔 ∧ 𝑔 ∈ 𝐴)) → (∃𝑧 ∈ On (𝑔 Fn 𝑧 ∧ ∀𝑎 ∈ 𝑧 (𝑔‘𝑎) = (𝐹‘(𝑔 ↾ 𝑎))) → (recs(𝐹) ↾ 𝐵) ∈ V))
42	13, 41	mpd 15	. 2 ⊢ ((𝐵 ∈ dom recs(𝐹) ∧ (⟨𝐵, (recs(𝐹)‘𝐵)⟩ ∈ 𝑔 ∧ 𝑔 ∈ 𝐴)) → (recs(𝐹) ↾ 𝐵) ∈ V)
43	9, 42	exlimddv 1935	1 ⊢ (𝐵 ∈ dom recs(𝐹) → (recs(𝐹) ↾ 𝐵) ∈ V)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1540  ∃wex 1779   ∈ wcel 2109  {cab 2707  ∀wral 3044  ∃wrex 3053  Vcvv 3444   ⊆ wss 3911  ⟨cop 4591  ∪ cuni 4867   class class class wbr 5102  dom cdm 5631   ↾ cres 5633  Ord word 6319  Oncon0 6320  Fun wfun 6493   Fn wfn 6494  ‘cfv 6499  recscrecs 8316

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5246  ax-nul 5256  ax-pr 5382  ax-un 7691

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-pss 3931  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-tr 5210  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6262  df-ord 6323  df-on 6324  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-fo 6505  df-fv 6507  df-ov 7372  df-2nd 7948  df-frecs 8237  df-wrecs 8268  df-recs 8317

This theorem is referenced by:  tfrlem15  8337  tfrlem16  8338  rdgseg  8367