Theorem cbvrexw 2700

Description: Rule used to change bound variables, using implicit substitution. Version of cbvrexfw 2696 with more disjoint variable conditions. Although we don't do so yet, we expect the disjoint variable conditions will allow us to remove reliance on ax-i12 1507 and ax-bndl 1509 in the proof. (Contributed by NM, 31-Jul-2003.) (Revised by Gino Giotto, 10-Jan-2024.)

Hypotheses

Ref	Expression
cbvralw.1	|- F/ y ph
cbvralw.2	|- F/ x ps
cbvralw.3	|- ( x = y -> ( ph <-> ps ) )

Assertion

Ref	Expression
cbvrexw	|- ( E. x e. A ph <-> E. y e. A ps )

Distinct variable group:   x, y, A

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

Proof of Theorem cbvrexw

Step	Hyp	Ref	Expression
1		nfcv 2319	. 2 |- F/_ x A
2		nfcv 2319	. 2 |- F/_ y A
3		cbvralw.1	. 2 |- F/ y ph
4		cbvralw.2	. 2 |- F/ x ps
5		cbvralw.3	. 2 |- ( x = y -> ( ph <-> ps ) )
6	1, 2, 3, 4, 5	cbvrexfw 2696	1 |- ( E. x e. A ph <-> E. y e. A ps )

Syntax hints:   -> wi 4   <-> wb 105   F/wnf 1460   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-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159

This theorem depends on definitions:  df-bi 117  df-nf 1461  df-sb 1763  df-cleq 2170  df-clel 2173  df-nfc 2308  df-rex 2461

This theorem is referenced by:  elabrexg  5761