Theorem cbvral2vw 2749

Description: Change bound variables of double restricted universal quantification, using implicit substitution. Version of cbvral2v 2751 with a disjoint variable condition, which does not require ax-13 2178. (Contributed by NM, 10-Aug-2004.) (Revised by GG, 10-Jan-2024.)

Hypotheses

Ref	Expression
cbvral2vw.1	|- ( x = z -> ( ph <-> ch ) )
cbvral2vw.2	|- ( y = w -> ( ch <-> ps ) )

Assertion

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

Distinct variable groups:   x, z   y, w   x, A, z   x, y, B, z   w, B   ph, z   ps, y   ch, x   ch, w

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

Proof of Theorem cbvral2vw

Step	Hyp	Ref	Expression
1		cbvral2vw.1	. . . 4 |- ( x = z -> ( ph <-> ch ) )
2	1	ralbidv 2506	. . 3 |- ( x = z -> ( A. y e. B ph <-> A. y e. B ch ) )
3	2	cbvralvw 2742	. 2 |- ( A. x e. A A. y e. B ph <-> A. z e. A A. y e. B ch )
4		cbvral2vw.2	. . . 4 |- ( y = w -> ( ch <-> ps ) )
5	4	cbvralvw 2742	. . 3 |- ( A. y e. B ch <-> A. w e. B ps )
6	5	ralbii 2512	. 2 |- ( A. z e. A A. y e. B ch <-> A. z e. A A. w e. B ps )
7	3, 6	bitri 184	1 |- ( A. x e. A A. y e. B ph <-> A. z e. A A. w e. B ps )

Syntax hints:   -> wi 4   <-> wb 105   A.wral 2484

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 1470  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557

This theorem depends on definitions:  df-bi 117  df-tru 1376  df-nf 1484  df-clel 2201  df-ral 2489

This theorem is referenced by:  mhmpropd  13331