Theorem cbvrabv 2820

Description: Rule to change the bound variable in a restricted class abstraction, using implicit substitution. (Contributed by NM, 26-May-1999.)

Hypothesis

Ref	Expression
cbvrabv.1	|- ( x = y -> ( ph <-> ps ) )

Assertion

Ref	Expression
cbvrabv	|- { x e. A | ph } = { y e. A | ps }

Distinct variable groups:   x, y, A   ph, y   ps, x

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

Proof of Theorem cbvrabv

Step	Hyp	Ref	Expression
1		nfcv 2392	. 2 |- F/_ x A
2		nfcv 2392	. 2 |- F/_ y A
3		nfv 1581	. 2 |- F/ y ph
4		nfv 1581	. 2 |- F/ x ps
5		cbvrabv.1	. 2 |- ( x = y -> ( ph <-> ps ) )
6	1, 2, 3, 4, 5	cbvrab 2819	1 |- { x e. A | ph } = { y e. A | ps }

Syntax hints:   -> wi 4   <-> wb 105   = wceq 1402   {crab 2532

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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This theorem depends on definitions:  df-bi 117  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-rab 2537

This theorem is referenced by:  pwnss  4291  acexmidlemv  6073  exmidac  7555  genipv  7866  ltexpri  7970  suplocsrlempr  8164  suplocsr  8166  zsupssdc  10651  hashfibc  11261  bitsfzolem  12699  nninfctlemfo  12795  sqne2sq  12933  eulerth  12989  odzval  12998  pcprecl  13046  pcprendvds  13047  pcpremul  13050  pceulem  13051  4sqlem19  13166  ballotfilemelo  13200  ballotfileme  13214  ballotfilemimin  13227  ballotfilemfrcn0  13251  ballotfilem7  13257  ballotfi  13260  lfgredg2dom  16287  vtxdumgrfival  16453  vtxduspgrfvedgfilem  16455  vtxduspgrfvedgfi  16456