Theorem tfr1onlembex 6349

Description: Lemma for tfr1on 6354. The set B exists. (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
tfr1onlembex	|- ( ph -> B e. _V )

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   B, g, h, w, z   D, h, z   h, G, w, z, f, y, x   g, X, z

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

Proof of Theorem tfr1onlembex

Step	Hyp	Ref	Expression
1		tfr1on.f	. . . 4 |- F = recs ( G )
2		tfr1on.g	. . . 4 |- ( ph -> Fun G )
3		tfr1on.x	. . . 4 |- ( ph -> Ord X )
4		tfr1on.ex	. . . 4 |- ( ( ph /\ x e. X /\ f Fn x ) -> ( G ` f ) e. _V )
5		tfr1onlemsucfn.1	. . . 4 |- A = { f | E. x e. X ( f Fn x /\ A. y e. x ( f ` y ) = ( G ` ( f |` y ) ) ) }
6		tfr1onlembacc.3	. . . 4 |- B = { h | E. z e. D E. g ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( G ` g ) >. } ) ) }
7		tfr1onlembacc.u	. . . 4 |- ( ( ph /\ x e. U. X ) -> suc x e. X )
8		tfr1onlembacc.4	. . . 4 |- ( ph -> D e. X )
9		tfr1onlembacc.5	. . . 4 |- ( ph -> A. z e. D E. g ( g Fn z /\ A. w e. z ( g ` w ) = ( G ` ( g |` w ) ) ) )
10	1, 2, 3, 4, 5, 6, 7, 8, 9	tfr1onlembfn 6348	. . 3 |- ( ph -> U. B Fn D )
11		fnex 5741	. . 3 |- ( ( U. B Fn D /\ D e. X ) -> U. B e. _V )
12	10, 8, 11	syl2anc 411	. 2 |- ( ph -> U. B e. _V )
13		uniexb 4475	. 2 |- ( B e. _V <-> U. B e. _V )
14	12, 13	sylibr 134	1 |- ( ph -> B e. _V )

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 978   = wceq 1353   E.wex 1492   e. wcel 2148   {cab 2163   A.wral 2455   E.wrex 2456   _Vcvv 2739   u. cun 3129   {csn 3594   <.cop 3597   U.cuni 3811   Ord word 4364   suc csuc 4367   |` cres 4630   Fun wfun 5212   Fn wfn 5213   ` cfv 5218  recscrecs 6308

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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4120  ax-sep 4123  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2741  df-sbc 2965  df-csb 3060  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-nul 3425  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-iun 3890  df-br 4006  df-opab 4067  df-mpt 4068  df-tr 4104  df-id 4295  df-iord 4368  df-on 4370  df-suc 4373  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-f1 5223  df-fo 5224  df-f1o 5225  df-fv 5226  df-recs 6309

This theorem is referenced by:  tfr1onlemex  6351