Theorem cbvalvw 1912

Description: Change bound variable. See cbvalv 1910 for a version with fewer disjoint variable conditions. (Contributed by NM, 9-Apr-2017.) Avoid ax-7 1441. (Revised by Gino Giotto, 25-Aug-2024.)

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	. . . 4 |- ( x = y -> ( ph <-> ps ) )
2	1	spv 1853	. . 3 |- ( A. x ph -> ps )
3	2	alrimiv 1867	. 2 |- ( A. x ph -> A. y ps )
4	1	equcoms 1701	. . . . 5 |- ( y = x -> ( ph <-> ps ) )
5	4	biimprd 157	. . . 4 |- ( y = x -> ( ps -> ph ) )
6	5	spimv 1804	. . 3 |- ( A. y ps -> ph )
7	6	alrimiv 1867	. 2 |- ( A. y ps -> A. x ph )
8	3, 7	impbii 125	1 |- ( A. x ph <-> A. y ps )

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

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 1440  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527

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

This theorem is referenced by:  cbvralvw  2700  cbvreuvw  2702