Theorem cbvralw 2709

Description: Rule used to change bound variables, using implicit substitution. Version of cbvral 2711 with a disjoint variable condition. Although we don't do so yet, we expect this disjoint variable condition will allow us to remove reliance on ax-i12 1517 and ax-bndl 1519 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
cbvralw	|- ( A. x e. A ph <-> A. y e. A ps )

Distinct variable group:   x, y, A

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

Proof of Theorem cbvralw

Step	Hyp	Ref	Expression
1		nfcv 2329	. 2 |- F/_ x A
2		nfcv 2329	. 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	cbvralfw 2705	1 |- ( A. x e. A ph <-> A. y e. A ps )

Syntax hints:   -> wi 4   <-> wb 105   F/wnf 1470   A.wral 2465

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 710  ax-5 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-10 1515  ax-11 1516  ax-i12 1517  ax-bndl 1519  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-ext 2169

This theorem depends on definitions:  df-bi 117  df-nf 1471  df-sb 1773  df-cleq 2180  df-clel 2183  df-nfc 2318  df-ral 2470

This theorem is referenced by:  pcmptdvds  12356  lgseisenlem2  14691