Theorem cbvalvw 1891

Description: Change bound variable. See cbvalv 1889 for a version with fewer disjoint variable conditions. (Contributed by NM, 9-Apr-2017.)

Hypothesis

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

Assertion

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

Distinct variable groups:   x, y   ps, x   ph, y

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

Proof of Theorem cbvalvw

Step	Hyp	Ref	Expression
1		cbvalvw.1	. 2 |- ( x = y -> ( ph <-> ps ) )
2	1	cbvalv 1889	1 |- ( A. x ph <-> A. y ps )

Syntax hints:   -> wi 4   <-> wb 104   A.wal 1329

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514

This theorem depends on definitions:  df-bi 116  df-nf 1437

This theorem is referenced by: (None)