Theorem cbvrex2vw 2717

Description: Change bound variables of double restricted universal quantification, using implicit substitution. Version of cbvrex2v 2719 with a disjoint variable condition, which does not require ax-13 2150. (Contributed by FL, 2-Jul-2012.) (Revised by Gino Giotto, 10-Jan-2024.)

Hypotheses

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

Assertion

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

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

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

Proof of Theorem cbvrex2vw

Step	Hyp	Ref	Expression
1		cbvrex2vw.1	. . . 4 |- ( x = z -> ( ph <-> ch ) )
2	1	rexbidv 2478	. . 3 |- ( x = z -> ( E. y e. B ph <-> E. y e. B ch ) )
3	2	cbvrexvw 2710	. 2 |- ( E. x e. A E. y e. B ph <-> E. z e. A E. y e. B ch )
4		cbvrex2vw.2	. . . 4 |- ( y = w -> ( ch <-> ps ) )
5	4	cbvrexvw 2710	. . 3 |- ( E. y e. B ch <-> E. w e. B ps )
6	5	rexbii 2484	. 2 |- ( E. z e. A E. y e. B ch <-> E. z e. A E. w e. B ps )
7	3, 6	bitri 184	1 |- ( E. x e. A E. y e. B ph <-> E. z e. A E. w e. B ps )

Syntax hints:   -> wi 4   <-> wb 105   E.wrex 2456

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 1447  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534

This theorem depends on definitions:  df-bi 117  df-tru 1356  df-nf 1461  df-clel 2173  df-rex 2461

This theorem is referenced by:  4sqlem2  12389  2sqlem9  14556