Theorem tfrlemi14d 6348

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

Hypotheses

Ref	Expression
tfrlemi14d.1	|- A = { f | E. x e. On ( f Fn x /\ A. y e. x ( f ` y ) = ( F ` ( f |` y ) ) ) }
tfrlemi14d.2	|- ( ph -> A. x ( Fun F /\ ( F ` x ) e. _V ) )

Assertion

Ref	Expression
tfrlemi14d	|- ( ph -> dom recs ( F ) = On )

Distinct variable groups:   x, f, y, A   f, F, x, y   ph, f, y

Allowed substitution hint:   ph( x)

Proof of Theorem tfrlemi14d

Dummy variables g h u w z are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		tfrlemi14d.1	. . . 4 |- A = { f | E. x e. On ( f Fn x /\ A. y e. x ( f ` y ) = ( F ` ( f |` y ) ) ) }
2	1	tfrlem8 6333	. . 3 |- Ord dom recs ( F )
3		ordsson 4503	. . 3 |- ( Ord dom recs ( F ) -> dom recs ( F ) C_ On )
4	2, 3	mp1i 10	. 2 |- ( ph -> dom recs ( F ) C_ On )
5		tfrlemi14d.2	. . . . . . . 8 |- ( ph -> A. x ( Fun F /\ ( F ` x ) e. _V ) )
6	1, 5	tfrlemi1 6347	. . . . . . 7 |- ( ( ph /\ z e. On ) -> E. g ( g Fn z /\ A. u e. z ( g ` u ) = ( F ` ( g |` u ) ) ) )
7	5	ad2antrr 488	. . . . . . . . 9 |- ( ( ( ph /\ z e. On ) /\ ( g Fn z /\ A. u e. z ( g ` u ) = ( F ` ( g |` u ) ) ) ) -> A. x ( Fun F /\ ( F ` x ) e. _V ) )
8		simplr 528	. . . . . . . . 9 |- ( ( ( ph /\ z e. On ) /\ ( g Fn z /\ A. u e. z ( g ` u ) = ( F ` ( g |` u ) ) ) ) -> z e. On )
9		simprl 529	. . . . . . . . 9 |- ( ( ( ph /\ z e. On ) /\ ( g Fn z /\ A. u e. z ( g ` u ) = ( F ` ( g |` u ) ) ) ) -> g Fn z )
10		fneq2 5317	. . . . . . . . . . . . 13 |- ( w = z -> ( g Fn w <-> g Fn z ) )
11		raleq 2683	. . . . . . . . . . . . 13 |- ( w = z -> ( A. u e. w ( g ` u ) = ( F ` ( g |` u ) ) <-> A. u e. z ( g ` u ) = ( F ` ( g |` u ) ) ) )
12	10, 11	anbi12d 473	. . . . . . . . . . . 12 |- ( w = z -> ( ( g Fn w /\ A. u e. w ( g ` u ) = ( F ` ( g |` u ) ) ) <-> ( g Fn z /\ A. u e. z ( g ` u ) = ( F ` ( g |` u ) ) ) ) )
13	12	rspcev 2853	. . . . . . . . . . 11 |- ( ( z e. On /\ ( g Fn z /\ A. u e. z ( g ` u ) = ( F ` ( g |` u ) ) ) ) -> E. w e. On ( g Fn w /\ A. u e. w ( g ` u ) = ( F ` ( g |` u ) ) ) )
14	13	adantll 476	. . . . . . . . . 10 |- ( ( ( ph /\ z e. On ) /\ ( g Fn z /\ A. u e. z ( g ` u ) = ( F ` ( g |` u ) ) ) ) -> E. w e. On ( g Fn w /\ A. u e. w ( g ` u ) = ( F ` ( g |` u ) ) ) )
15		vex 2752	. . . . . . . . . . 11 |- g e. _V
16	1, 15	tfrlem3a 6325	. . . . . . . . . 10 |- ( g e. A <-> E. w e. On ( g Fn w /\ A. u e. w ( g ` u ) = ( F ` ( g |` u ) ) ) )
17	14, 16	sylibr 134	. . . . . . . . 9 |- ( ( ( ph /\ z e. On ) /\ ( g Fn z /\ A. u e. z ( g ` u ) = ( F ` ( g |` u ) ) ) ) -> g e. A )
18	1, 7, 8, 9, 17	tfrlemisucaccv 6340	. . . . . . . 8 |- ( ( ( ph /\ z e. On ) /\ ( g Fn z /\ A. u e. z ( g ` u ) = ( F ` ( g |` u ) ) ) ) -> ( g u. { <. z , ( F ` g ) >. } ) e. A )
19		vex 2752	. . . . . . . . . . . 12 |- z e. _V
20	5	tfrlem3-2d 6327	. . . . . . . . . . . . 13 |- ( ph -> ( Fun F /\ ( F ` g ) e. _V ) )
21	20	simprd 114	. . . . . . . . . . . 12 |- ( ph -> ( F ` g ) e. _V )
22		opexg 4240	. . . . . . . . . . . 12 |- ( ( z e. _V /\ ( F ` g ) e. _V ) -> <. z , ( F ` g ) >. e. _V )
23	19, 21, 22	sylancr 414	. . . . . . . . . . 11 |- ( ph -> <. z , ( F ` g ) >. e. _V )
24		snidg 3633	. . . . . . . . . . 11 |- ( <. z , ( F ` g ) >. e. _V -> <. z , ( F ` g ) >. e. { <. z , ( F ` g ) >. } )
25		elun2 3315	. . . . . . . . . . 11 |- ( <. z , ( F ` g ) >. e. { <. z , ( F ` g ) >. } -> <. z , ( F ` g ) >. e. ( g u. { <. z , ( F ` g ) >. } ) )
26	23, 24, 25	3syl 17	. . . . . . . . . 10 |- ( ph -> <. z , ( F ` g ) >. e. ( g u. { <. z , ( F ` g ) >. } ) )
27	26	ad2antrr 488	. . . . . . . . 9 |- ( ( ( ph /\ z e. On ) /\ ( g Fn z /\ A. u e. z ( g ` u ) = ( F ` ( g |` u ) ) ) ) -> <. z , ( F ` g ) >. e. ( g u. { <. z , ( F ` g ) >. } ) )
28		opeldmg 4844	. . . . . . . . . . 11 |- ( ( z e. _V /\ ( F ` g ) e. _V ) -> ( <. z , ( F ` g ) >. e. ( g u. { <. z , ( F ` g ) >. } ) -> z e. dom ( g u. { <. z , ( F ` g ) >. } ) ) )
29	19, 21, 28	sylancr 414	. . . . . . . . . 10 |- ( ph -> ( <. z , ( F ` g ) >. e. ( g u. { <. z , ( F ` g ) >. } ) -> z e. dom ( g u. { <. z , ( F ` g ) >. } ) ) )
30	29	ad2antrr 488	. . . . . . . . 9 |- ( ( ( ph /\ z e. On ) /\ ( g Fn z /\ A. u e. z ( g ` u ) = ( F ` ( g |` u ) ) ) ) -> ( <. z , ( F ` g ) >. e. ( g u. { <. z , ( F ` g ) >. } ) -> z e. dom ( g u. { <. z , ( F ` g ) >. } ) ) )
31	27, 30	mpd 13	. . . . . . . 8 |- ( ( ( ph /\ z e. On ) /\ ( g Fn z /\ A. u e. z ( g ` u ) = ( F ` ( g |` u ) ) ) ) -> z e. dom ( g u. { <. z , ( F ` g ) >. } ) )
32		dmeq 4839	. . . . . . . . . 10 |- ( h = ( g u. { <. z , ( F ` g ) >. } ) -> dom h = dom ( g u. { <. z , ( F ` g ) >. } ) )
33	32	eleq2d 2257	. . . . . . . . 9 |- ( h = ( g u. { <. z , ( F ` g ) >. } ) -> ( z e. dom h <-> z e. dom ( g u. { <. z , ( F ` g ) >. } ) ) )
34	33	rspcev 2853	. . . . . . . 8 |- ( ( ( g u. { <. z , ( F ` g ) >. } ) e. A /\ z e. dom ( g u. { <. z , ( F ` g ) >. } ) ) -> E. h e. A z e. dom h )
35	18, 31, 34	syl2anc 411	. . . . . . 7 |- ( ( ( ph /\ z e. On ) /\ ( g Fn z /\ A. u e. z ( g ` u ) = ( F ` ( g |` u ) ) ) ) -> E. h e. A z e. dom h )
36	6, 35	exlimddv 1908	. . . . . 6 |- ( ( ph /\ z e. On ) -> E. h e. A z e. dom h )
37		eliun 3902	. . . . . 6 |- ( z e. U_ h e. A dom h <-> E. h e. A z e. dom h )
38	36, 37	sylibr 134	. . . . 5 |- ( ( ph /\ z e. On ) -> z e. U_ h e. A dom h )
39	38	ex 115	. . . 4 |- ( ph -> ( z e. On -> z e. U_ h e. A dom h ) )
40	39	ssrdv 3173	. . 3 |- ( ph -> On C_ U_ h e. A dom h )
41	1	recsfval 6330	. . . . 5 |- recs ( F ) = U. A
42	41	dmeqi 4840	. . . 4 |- dom recs ( F ) = dom U. A
43		dmuni 4849	. . . 4 |- dom U. A = U_ h e. A dom h
44	42, 43	eqtri 2208	. . 3 |- dom recs ( F ) = U_ h e. A dom h
45	40, 44	sseqtrrdi 3216	. 2 |- ( ph -> On C_ dom recs ( F ) )
46	4, 45	eqssd 3184	1 |- ( ph -> dom recs ( F ) = On )

Syntax hints:   -> wi 4   /\ wa 104   A.wal 1361   = wceq 1363   e. wcel 2158   {cab 2173   A.wral 2465   E.wrex 2466   _Vcvv 2749   u. cun 3139   C_ wss 3141   {csn 3604   <.cop 3607   U.cuni 3821   U_ciun 3898   Ord word 4374   Oncon0 4375   dom cdm 4638   |` cres 4640   Fun wfun 5222   Fn wfn 5223   ` cfv 5228  recscrecs 6319

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 615  ax-in2 616  ax-io 710  ax-5 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-10 1515  ax-11 1516  ax-i12 1517  ax-bndl 1519  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-13 2160  ax-14 2161  ax-ext 2169  ax-coll 4130  ax-sep 4133  ax-pow 4186  ax-pr 4221  ax-un 4445  ax-setind 4548

This theorem depends on definitions:  df-bi 117  df-3an 981  df-tru 1366  df-fal 1369  df-nf 1471  df-sb 1773  df-eu 2039  df-mo 2040  df-clab 2174  df-cleq 2180  df-clel 2183  df-nfc 2318  df-ne 2358  df-ral 2470  df-rex 2471  df-reu 2472  df-rab 2474  df-v 2751  df-sbc 2975  df-csb 3070  df-dif 3143  df-un 3145  df-in 3147  df-ss 3154  df-nul 3435  df-pw 3589  df-sn 3610  df-pr 3611  df-op 3613  df-uni 3822  df-iun 3900  df-br 4016  df-opab 4077  df-mpt 4078  df-tr 4114  df-id 4305  df-iord 4378  df-on 4380  df-suc 4383  df-xp 4644  df-rel 4645  df-cnv 4646  df-co 4647  df-dm 4648  df-rn 4649  df-res 4650  df-ima 4651  df-iota 5190  df-fun 5230  df-fn 5231  df-f 5232  df-f1 5233  df-fo 5234  df-f1o 5235  df-fv 5236  df-recs 6320

This theorem is referenced by:  tfri1d  6350