Theorem cbvalv 1932

Description: Rule used to change bound variables, using implicit substitition. (Contributed by NM, 5-Aug-1993.)

Hypothesis

Ref	Expression
cbvalv.1	|- ( x = y -> ( ph <-> ps ) )

Assertion

Ref	Expression
cbvalv	|- ( A. x ph <-> A. y ps )

Distinct variable groups:   ph, y   ps, x

Allowed substitution hints:   ph( x)   ps( y)

Proof of Theorem cbvalv

Step	Hyp	Ref	Expression
1		ax-17 1540	. 2 |- ( ph -> A. y ph )
2		ax-17 1540	. 2 |- ( ps -> A. x ps )
3		cbvalv.1	. 2 |- ( x = y -> ( ph <-> ps ) )
4	1, 2, 3	cbvalh 1767	1 |- ( A. x ph <-> A. y ps )

Syntax hints:   -> wi 4   <-> wb 105   A.wal 1362

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-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548

This theorem depends on definitions:  df-bi 117  df-nf 1475

This theorem is referenced by:  nfcjust  2327  cdeqal1  2980  dfss4st  3397  zfpow  4209  tfisi  4624  acexmid  5924  tfrlem3-2d  6379  tfrlemi1  6399  tfrexlem  6401  tfr1onlemaccex  6415  tfrcllemaccex  6428  findcard  6958  fisseneq  7004  genprndl  7605  genprndu  7606  zfz1iso  10950