Theorem tfrlem3-2d 6473

Description: Lemma for transfinite recursion which changes a bound variable (Contributed by Jim Kingdon, 2-Jul-2019.)

Hypothesis

Ref	Expression
tfrlem3-2d.1	|- ( ph -> A. x ( Fun F /\ ( F ` x ) e. _V ) )

Assertion

Ref	Expression
tfrlem3-2d	|- ( ph -> ( Fun F /\ ( F ` g ) e. _V ) )

Distinct variable group:   x, g, F

Allowed substitution hints:   ph( x, g)

Proof of Theorem tfrlem3-2d

Step	Hyp	Ref	Expression
1		tfrlem3-2d.1	. . 3 |- ( ph -> A. x ( Fun F /\ ( F ` x ) e. _V ) )
2		fveq2 5635	. . . . . 6 |- ( x = g -> ( F ` x ) = ( F ` g ) )
3	2	eleq1d 2298	. . . . 5 |- ( x = g -> ( ( F ` x ) e. _V <-> ( F ` g ) e. _V ) )
4	3	anbi2d 464	. . . 4 |- ( x = g -> ( ( Fun F /\ ( F ` x ) e. _V ) <-> ( Fun F /\ ( F ` g ) e. _V ) ) )
5	4	cbvalv 1964	. . 3 |- ( A. x ( Fun F /\ ( F ` x ) e. _V ) <-> A. g ( Fun F /\ ( F ` g ) e. _V ) )
6	1, 5	sylib 122	. 2 |- ( ph -> A. g ( Fun F /\ ( F ` g ) e. _V ) )
7	6	19.21bi 1604	1 |- ( ph -> ( Fun F /\ ( F ` g ) e. _V ) )

Syntax hints:   -> wi 4   /\ wa 104   A.wal 1393   e. wcel 2200   _Vcvv 2800   Fun wfun 5318   ` cfv 5324

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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-rex 2514  df-v 2802  df-un 3202  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-br 4087  df-iota 5284  df-fv 5332

This theorem is referenced by:  tfrlemisucfn  6485  tfrlemisucaccv  6486  tfrlemibxssdm  6488  tfrlemibfn  6489  tfrlemi14d  6494