Theorem tfrlemibacc 6305

Description: Each element of B is an acceptable function. Lemma for tfrlemi1 6311. (Contributed by Jim Kingdon, 14-Mar-2019.) (Proof shortened by Mario Carneiro, 24-May-2019.)

Hypotheses

Ref	Expression
tfrlemisucfn.1	|- A = { f | E. x e. On ( f Fn x /\ A. y e. x ( f ` y ) = ( F ` ( f |` y ) ) ) }
tfrlemisucfn.2	|- ( ph -> A. x ( Fun F /\ ( F ` x ) e. _V ) )
tfrlemi1.3	|- B = { h | E. z e. x E. g ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( F ` g ) >. } ) ) }
tfrlemi1.4	|- ( ph -> x e. On )
tfrlemi1.5	|- ( ph -> A. z e. x E. g ( g Fn z /\ A. w e. z ( g ` w ) = ( F ` ( g |` w ) ) ) )

Assertion

Ref	Expression
tfrlemibacc	|- ( ph -> B C_ A )

Distinct variable groups:   f, g, h, w, x, y, z, A   f, F, g, h, w, x, y, z   ph, w, y   w, B, f, g, h, z   ph, g, h, z

Allowed substitution hints:   ph( x, f)   B( x, y)

Proof of Theorem tfrlemibacc

Step	Hyp	Ref	Expression
1		tfrlemi1.3	. 2 |- B = { h | E. z e. x E. g ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( F ` g ) >. } ) ) }
2		simpr3 1000	. . . . . . 7 |- ( ( ( ph /\ z e. x ) /\ ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( F ` g ) >. } ) ) ) -> h = ( g u. { <. z , ( F ` g ) >. } ) )
3		tfrlemisucfn.1	. . . . . . . 8 |- A = { f | E. x e. On ( f Fn x /\ A. y e. x ( f ` y ) = ( F ` ( f |` y ) ) ) }
4		tfrlemisucfn.2	. . . . . . . . 9 |- ( ph -> A. x ( Fun F /\ ( F ` x ) e. _V ) )
5	4	ad2antrr 485	. . . . . . . 8 |- ( ( ( ph /\ z e. x ) /\ ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( F ` g ) >. } ) ) ) -> A. x ( Fun F /\ ( F ` x ) e. _V ) )
6		tfrlemi1.4	. . . . . . . . . 10 |- ( ph -> x e. On )
7	6	ad2antrr 485	. . . . . . . . 9 |- ( ( ( ph /\ z e. x ) /\ ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( F ` g ) >. } ) ) ) -> x e. On )
8		simplr 525	. . . . . . . . 9 |- ( ( ( ph /\ z e. x ) /\ ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( F ` g ) >. } ) ) ) -> z e. x )
9		onelon 4369	. . . . . . . . 9 |- ( ( x e. On /\ z e. x ) -> z e. On )
10	7, 8, 9	syl2anc 409	. . . . . . . 8 |- ( ( ( ph /\ z e. x ) /\ ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( F ` g ) >. } ) ) ) -> z e. On )
11		simpr1 998	. . . . . . . 8 |- ( ( ( ph /\ z e. x ) /\ ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( F ` g ) >. } ) ) ) -> g Fn z )
12		simpr2 999	. . . . . . . 8 |- ( ( ( ph /\ z e. x ) /\ ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( F ` g ) >. } ) ) ) -> g e. A )
13	3, 5, 10, 11, 12	tfrlemisucaccv 6304	. . . . . . 7 |- ( ( ( ph /\ z e. x ) /\ ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( F ` g ) >. } ) ) ) -> ( g u. { <. z , ( F ` g ) >. } ) e. A )
14	2, 13	eqeltrd 2247	. . . . . 6 |- ( ( ( ph /\ z e. x ) /\ ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( F ` g ) >. } ) ) ) -> h e. A )
15	14	ex 114	. . . . 5 |- ( ( ph /\ z e. x ) -> ( ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( F ` g ) >. } ) ) -> h e. A ) )
16	15	exlimdv 1812	. . . 4 |- ( ( ph /\ z e. x ) -> ( E. g ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( F ` g ) >. } ) ) -> h e. A ) )
17	16	rexlimdva 2587	. . 3 |- ( ph -> ( E. z e. x E. g ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( F ` g ) >. } ) ) -> h e. A ) )
18	17	abssdv 3221	. 2 |- ( ph -> { h | E. z e. x E. g ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( F ` g ) >. } ) ) } C_ A )
19	1, 18	eqsstrid 3193	1 |- ( ph -> B C_ A )

Syntax hints:   -> wi 4   /\ wa 103   /\ w3a 973   A.wal 1346   = wceq 1348   E.wex 1485   e. wcel 2141   {cab 2156   A.wral 2448   E.wrex 2449   _Vcvv 2730   u. cun 3119   C_ wss 3121   {csn 3583   <.cop 3586   Oncon0 4348   |` cres 4613   Fun wfun 5192   Fn wfn 5193   ` cfv 5198

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-setind 4521

This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-ral 2453  df-rex 2454  df-v 2732  df-sbc 2956  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-nul 3415  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-br 3990  df-opab 4051  df-tr 4088  df-id 4278  df-iord 4351  df-on 4353  df-suc 4356  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-res 4623  df-iota 5160  df-fun 5200  df-fn 5201  df-fv 5206

This theorem is referenced by:  tfrlemibfn  6307  tfrlemiubacc  6309