Theorem tfrlemibacc 6384

Description: Each element of B is an acceptable function. Lemma for tfrlemi1 6390. (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 1007	. . . . . . 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 488	. . . . . . . 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 488	. . . . . . . . 9 |- ( ( ( ph /\ z e. x ) /\ ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( F ` g ) >. } ) ) ) -> x e. On )
8		simplr 528	. . . . . . . . 9 |- ( ( ( ph /\ z e. x ) /\ ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( F ` g ) >. } ) ) ) -> z e. x )
9		onelon 4419	. . . . . . . . 9 |- ( ( x e. On /\ z e. x ) -> z e. On )
10	7, 8, 9	syl2anc 411	. . . . . . . 8 |- ( ( ( ph /\ z e. x ) /\ ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( F ` g ) >. } ) ) ) -> z e. On )
11		simpr1 1005	. . . . . . . 8 |- ( ( ( ph /\ z e. x ) /\ ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( F ` g ) >. } ) ) ) -> g Fn z )
12		simpr2 1006	. . . . . . . 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 6383	. . . . . . 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 2273	. . . . . 6 |- ( ( ( ph /\ z e. x ) /\ ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( F ` g ) >. } ) ) ) -> h e. A )
15	14	ex 115	. . . . 5 |- ( ( ph /\ z e. x ) -> ( ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( F ` g ) >. } ) ) -> h e. A ) )
16	15	exlimdv 1833	. . . 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 2614	. . 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 3257	. 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 3229	1 |- ( ph -> B C_ A )

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 980   A.wal 1362   = wceq 1364   E.wex 1506   e. wcel 2167   {cab 2182   A.wral 2475   E.wrex 2476   _Vcvv 2763   u. cun 3155   C_ wss 3157   {csn 3622   <.cop 3625   Oncon0 4398   |` cres 4665   Fun wfun 5252   Fn wfn 5253   ` cfv 5258

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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-v 2765  df-sbc 2990  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3451  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-br 4034  df-opab 4095  df-tr 4132  df-id 4328  df-iord 4401  df-on 4403  df-suc 4406  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-res 4675  df-iota 5219  df-fun 5260  df-fn 5261  df-fv 5266

This theorem is referenced by:  tfrlemibfn  6386  tfrlemiubacc  6388