Theorem cbval2vw 1947

Description: Rule used to change bound variables, using implicit substitution. (Contributed by NM, 4-Feb-2005.) (Revised by GG, 10-Jan-2024.)

Hypothesis

Ref	Expression
cbval2vw.1	|- ( ( x = z /\ y = w ) -> ( ph <-> ps ) )

Assertion

Ref	Expression
cbval2vw	|- ( A. x A. y ph <-> A. z A. w ps )

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

Allowed substitution hints:   ph( x, y)   ps( z, w)

Proof of Theorem cbval2vw

Step	Hyp	Ref	Expression
1		cbval2vw.1	. . 3 |- ( ( x = z /\ y = w ) -> ( ph <-> ps ) )
2	1	cbvaldvaw 1945	. 2 |- ( x = z -> ( A. y ph <-> A. w ps ) )
3	2	cbvalvw 1934	1 |- ( A. x A. y ph <-> A. z A. w ps )

Syntax hints:   -> wi 4   /\ wa 104   <-> 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-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549

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

This theorem is referenced by:  seqf1og  10598