Theorem tfrlemi14d 6542

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 6527	. . 3 |- Ord dom recs ( F )
3		ordsson 4596	. . 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 6541	. . . . . . 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 529	. . . . . . . . 9 |- ( ( ( ph /\ z e. On ) /\ ( g Fn z /\ A. u e. z ( g ` u ) = ( F ` ( g |` u ) ) ) ) -> z e. On )
9		simprl 531	. . . . . . . . 9 |- ( ( ( ph /\ z e. On ) /\ ( g Fn z /\ A. u e. z ( g ` u ) = ( F ` ( g |` u ) ) ) ) -> g Fn z )
10		fneq2 5426	. . . . . . . . . . . . 13 |- ( w = z -> ( g Fn w <-> g Fn z ) )
11		raleq 2731	. . . . . . . . . . . . 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 2911	. . . . . . . . . . 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 2806	. . . . . . . . . . 11 |- g e. _V
16	1, 15	tfrlem3a 6519	. . . . . . . . . 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 6534	. . . . . . . 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 2806	. . . . . . . . . . . 12 |- z e. _V
20	5	tfrlem3-2d 6521	. . . . . . . . . . . . 13 |- ( ph -> ( Fun F /\ ( F ` g ) e. _V ) )
21	20	simprd 114	. . . . . . . . . . . 12 |- ( ph -> ( F ` g ) e. _V )
22		opexg 4326	. . . . . . . . . . . 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 3702	. . . . . . . . . . 11 |- ( <. z , ( F ` g ) >. e. _V -> <. z , ( F ` g ) >. e. { <. z , ( F ` g ) >. } )
25		elun2 3377	. . . . . . . . . . 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 4942	. . . . . . . . . . 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 4937	. . . . . . . . . 10 |- ( h = ( g u. { <. z , ( F ` g ) >. } ) -> dom h = dom ( g u. { <. z , ( F ` g ) >. } ) )
33	32	eleq2d 2301	. . . . . . . . 9 |- ( h = ( g u. { <. z , ( F ` g ) >. } ) -> ( z e. dom h <-> z e. dom ( g u. { <. z , ( F ` g ) >. } ) ) )
34	33	rspcev 2911	. . . . . . . 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 1947	. . . . . 6 |- ( ( ph /\ z e. On ) -> E. h e. A z e. dom h )
37		eliun 3979	. . . . . 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 3234	. . 3 |- ( ph -> On C_ U_ h e. A dom h )
41	1	recsfval 6524	. . . . 5 |- recs ( F ) = U. A
42	41	dmeqi 4938	. . . 4 |- dom recs ( F ) = dom U. A
43		dmuni 4947	. . . 4 |- dom U. A = U_ h e. A dom h
44	42, 43	eqtri 2252	. . 3 |- dom recs ( F ) = U_ h e. A dom h
45	40, 44	sseqtrrdi 3277	. 2 |- ( ph -> On C_ dom recs ( F ) )
46	4, 45	eqssd 3245	1 |- ( ph -> dom recs ( F ) = On )

Syntax hints:   -> wi 4   /\ wa 104   A.wal 1396   = wceq 1398   e. wcel 2202   {cab 2217   A.wral 2511   E.wrex 2512   _Vcvv 2803   u. cun 3199   C_ wss 3201   {csn 3673   <.cop 3676   U.cuni 3898   U_ciun 3975   Ord word 4465   Oncon0 4466   dom cdm 4731   |` cres 4733   Fun wfun 5327   Fn wfn 5328   ` cfv 5333  recscrecs 6513

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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-iord 4469  df-on 4471  df-suc 4474  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-recs 6514

This theorem is referenced by:  tfri1d  6544