Theorem tfrlem3ag 6395

Description: Lemma for transfinite recursion. This lemma just changes some bound variables in A for later use. (Contributed by Jim Kingdon, 5-Jul-2019.)

Hypothesis

Ref	Expression
tfrlem3.1	|- A = { f | E. x e. On ( f Fn x /\ A. y e. x ( f ` y ) = ( F ` ( f |` y ) ) ) }

Assertion

Ref	Expression
tfrlem3ag	|- ( G e. _V -> ( G e. A <-> E. z e. On ( G Fn z /\ A. w e. z ( G ` w ) = ( F ` ( G |` w ) ) ) ) )

Distinct variable groups:   w, f, x, y, z, F   f, G, w, x, y, z

Allowed substitution hints:   A( x, y, z, w, f)

Proof of Theorem tfrlem3ag

Step	Hyp	Ref	Expression
1		fneq12 5367	. . . 4 |- ( ( f = G /\ x = z ) -> ( f Fn x <-> G Fn z ) )
2		simpll 527	. . . . . . 7 |- ( ( ( f = G /\ x = z ) /\ y = w ) -> f = G )
3		simpr 110	. . . . . . 7 |- ( ( ( f = G /\ x = z ) /\ y = w ) -> y = w )
4	2, 3	fveq12d 5583	. . . . . 6 |- ( ( ( f = G /\ x = z ) /\ y = w ) -> ( f ` y ) = ( G ` w ) )
5	2, 3	reseq12d 4960	. . . . . . 7 |- ( ( ( f = G /\ x = z ) /\ y = w ) -> ( f |` y ) = ( G |` w ) )
6	5	fveq2d 5580	. . . . . 6 |- ( ( ( f = G /\ x = z ) /\ y = w ) -> ( F ` ( f |` y ) ) = ( F ` ( G |` w ) ) )
7	4, 6	eqeq12d 2220	. . . . 5 |- ( ( ( f = G /\ x = z ) /\ y = w ) -> ( ( f ` y ) = ( F ` ( f |` y ) ) <-> ( G ` w ) = ( F ` ( G |` w ) ) ) )
8		simplr 528	. . . . 5 |- ( ( ( f = G /\ x = z ) /\ y = w ) -> x = z )
9	7, 8	cbvraldva2 2745	. . . 4 |- ( ( f = G /\ x = z ) -> ( A. y e. x ( f ` y ) = ( F ` ( f |` y ) ) <-> A. w e. z ( G ` w ) = ( F ` ( G |` w ) ) ) )
10	1, 9	anbi12d 473	. . 3 |- ( ( f = G /\ x = z ) -> ( ( f Fn x /\ A. y e. x ( f ` y ) = ( F ` ( f |` y ) ) ) <-> ( G Fn z /\ A. w e. z ( G ` w ) = ( F ` ( G |` w ) ) ) ) )
11	10	cbvrexdva 2748	. 2 |- ( f = G -> ( E. x e. On ( f Fn x /\ A. y e. x ( f ` y ) = ( F ` ( f |` y ) ) ) <-> E. z e. On ( G Fn z /\ A. w e. z ( G ` w ) = ( F ` ( G |` w ) ) ) ) )
12		tfrlem3.1	. 2 |- A = { f | E. x e. On ( f Fn x /\ A. y e. x ( f ` y ) = ( F ` ( f |` y ) ) ) }
13	11, 12	elab2g 2920	1 |- ( G e. _V -> ( G e. A <-> E. z e. On ( G Fn z /\ A. w e. z ( G ` w ) = ( F ` ( G |` w ) ) ) ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1373   e. wcel 2176   {cab 2191   A.wral 2484   E.wrex 2485   _Vcvv 2772   Oncon0 4410   |` cres 4677   Fn wfn 5266   ` cfv 5271

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-io 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-ext 2187

This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1484  df-sb 1786  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-v 2774  df-un 3170  df-in 3172  df-ss 3179  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-br 4045  df-opab 4106  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-res 4687  df-iota 5232  df-fun 5273  df-fn 5274  df-fv 5279

This theorem is referenced by:  tfrlemisucaccv  6411