Theorem tfr1onlembacc 6586

Description: Lemma for tfr1on 6594. Each element of B is an acceptable function. (Contributed by Jim Kingdon, 14-Mar-2022.)

Hypotheses

Ref	Expression
tfr1on.f	|- F = recs ( G )
tfr1on.g	|- ( ph -> Fun G )
tfr1on.x	|- ( ph -> Ord X )
tfr1on.ex	|- ( ( ph /\ x e. X /\ f Fn x ) -> ( G ` f ) e. _V )
tfr1onlemsucfn.1	|- A = { f | E. x e. X ( f Fn x /\ A. y e. x ( f ` y ) = ( G ` ( f |` y ) ) ) }
tfr1onlembacc.3	|- B = { h | E. z e. D E. g ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( G ` g ) >. } ) ) }
tfr1onlembacc.u	|- ( ( ph /\ x e. U. X ) -> suc x e. X )
tfr1onlembacc.4	|- ( ph -> D e. X )
tfr1onlembacc.5	|- ( ph -> A. z e. D E. g ( g Fn z /\ A. w e. z ( g ` w ) = ( G ` ( g |` w ) ) ) )

Assertion

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

Distinct variable groups:   A, f, g, h, x, z   D, f, g, x   f, G, x, y   f, X, x   ph, f, g, h, x, z   y, g, z

Allowed substitution hints:   ph( y, w)   A( y, w)   B( x, y, z, w, f, g, h)   D( y, z, w, h)   F( x, y, z, w, f, g, h)   G( z, w, g, h)   X( y, z, w, g, h)

Proof of Theorem tfr1onlembacc

Step	Hyp	Ref	Expression
1		tfr1onlembacc.3	. 2 |- B = { h | E. z e. D E. g ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( G ` g ) >. } ) ) }
2		simpr3 1032	. . . . . . 7 |- ( ( ( ph /\ z e. D ) /\ ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( G ` g ) >. } ) ) ) -> h = ( g u. { <. z , ( G ` g ) >. } ) )
3		tfr1on.f	. . . . . . . 8 |- F = recs ( G )
4		tfr1on.g	. . . . . . . . 9 |- ( ph -> Fun G )
5	4	ad2antrr 488	. . . . . . . 8 |- ( ( ( ph /\ z e. D ) /\ ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( G ` g ) >. } ) ) ) -> Fun G )
6		tfr1on.x	. . . . . . . . 9 |- ( ph -> Ord X )
7	6	ad2antrr 488	. . . . . . . 8 |- ( ( ( ph /\ z e. D ) /\ ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( G ` g ) >. } ) ) ) -> Ord X )
8		tfr1on.ex	. . . . . . . . . 10 |- ( ( ph /\ x e. X /\ f Fn x ) -> ( G ` f ) e. _V )
9	8	3adant1r 1258	. . . . . . . . 9 |- ( ( ( ph /\ z e. D ) /\ x e. X /\ f Fn x ) -> ( G ` f ) e. _V )
10	9	3adant1r 1258	. . . . . . . 8 |- ( ( ( ( ph /\ z e. D ) /\ ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( G ` g ) >. } ) ) ) /\ x e. X /\ f Fn x ) -> ( G ` f ) e. _V )
11		tfr1onlemsucfn.1	. . . . . . . 8 |- A = { f | E. x e. X ( f Fn x /\ A. y e. x ( f ` y ) = ( G ` ( f |` y ) ) ) }
12		tfr1onlembacc.4	. . . . . . . . 9 |- ( ph -> D e. X )
13	12	ad2antrr 488	. . . . . . . 8 |- ( ( ( ph /\ z e. D ) /\ ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( G ` g ) >. } ) ) ) -> D e. X )
14		simplr 529	. . . . . . . 8 |- ( ( ( ph /\ z e. D ) /\ ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( G ` g ) >. } ) ) ) -> z e. D )
15		tfr1onlembacc.u	. . . . . . . . . 10 |- ( ( ph /\ x e. U. X ) -> suc x e. X )
16	15	adantlr 477	. . . . . . . . 9 |- ( ( ( ph /\ z e. D ) /\ x e. U. X ) -> suc x e. X )
17	16	adantlr 477	. . . . . . . 8 |- ( ( ( ( ph /\ z e. D ) /\ ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( G ` g ) >. } ) ) ) /\ x e. U. X ) -> suc x e. X )
18		simpr1 1030	. . . . . . . 8 |- ( ( ( ph /\ z e. D ) /\ ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( G ` g ) >. } ) ) ) -> g Fn z )
19		simpr2 1031	. . . . . . . 8 |- ( ( ( ph /\ z e. D ) /\ ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( G ` g ) >. } ) ) ) -> g e. A )
20	3, 5, 7, 10, 11, 13, 14, 17, 18, 19	tfr1onlemsucaccv 6585	. . . . . . 7 |- ( ( ( ph /\ z e. D ) /\ ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( G ` g ) >. } ) ) ) -> ( g u. { <. z , ( G ` g ) >. } ) e. A )
21	2, 20	eqeltrd 2311	. . . . . 6 |- ( ( ( ph /\ z e. D ) /\ ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( G ` g ) >. } ) ) ) -> h e. A )
22	21	ex 115	. . . . 5 |- ( ( ph /\ z e. D ) -> ( ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( G ` g ) >. } ) ) -> h e. A ) )
23	22	exlimdv 1868	. . . 4 |- ( ( ph /\ z e. D ) -> ( E. g ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( G ` g ) >. } ) ) -> h e. A ) )
24	23	rexlimdva 2662	. . 3 |- ( ph -> ( E. z e. D E. g ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( G ` g ) >. } ) ) -> h e. A ) )
25	24	abssdv 3316	. 2 |- ( ph -> { h | E. z e. D E. g ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( G ` g ) >. } ) ) } C_ A )
26	1, 25	eqsstrid 3288	1 |- ( ph -> B C_ A )

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 1005   = wceq 1398   E.wex 1541   e. wcel 2205   {cab 2220   A.wral 2522   E.wrex 2523   _Vcvv 2815   u. cun 3212   C_ wss 3214   {csn 3694   <.cop 3697   U.cuni 3919   Ord word 4488   suc csuc 4491   |` cres 4756   Fun wfun 5351   Fn wfn 5352   ` cfv 5357  recscrecs 6548

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 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-v 2817  df-sbc 3046  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-opab 4177  df-tr 4214  df-id 4419  df-iord 4492  df-on 4494  df-suc 4497  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-res 4766  df-iota 5317  df-fun 5359  df-fn 5360  df-fv 5365

This theorem is referenced by:  tfr1onlembfn  6588  tfr1onlemubacc  6590