Theorem cbvrabv 2812

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	⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
cbvrabv	⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑦 ∈ 𝐴 ∣ 𝜓}

Distinct variable groups:   𝑥,𝑦,𝐴   𝜑,𝑦   𝜓,𝑥

Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)

Proof of Theorem cbvrabv

Step	Hyp	Ref	Expression
1		nfcv 2384	. 2 ⊢ Ⅎ𝑥𝐴
2		nfcv 2384	. 2 ⊢ Ⅎ𝑦𝐴
3		nfv 1577	. 2 ⊢ Ⅎ𝑦𝜑
4		nfv 1577	. 2 ⊢ Ⅎ𝑥𝜓
5		cbvrabv.1	. 2 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
6	1, 2, 3, 4, 5	cbvrab 2811	1 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑦 ∈ 𝐴 ∣ 𝜓}

Syntax hints:   → wi 4   ↔ wb 105   = wceq 1398  {crab 2524

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2214

This theorem depends on definitions:  df-bi 117  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-rab 2529

This theorem is referenced by:  pwnss  4272  acexmidlemv  6048  exmidac  7516  genipv  7824  ltexpri  7928  suplocsrlempr  8122  suplocsr  8124  zsupssdc  10598  hashfibc  11207  bitsfzolem  12640  nninfctlemfo  12736  sqne2sq  12874  eulerth  12930  odzval  12939  pcprecl  12987  pcprendvds  12988  pcpremul  12991  pceulem  12992  4sqlem19  13107  ballotfilemelo  13141  lfgredg2dom  16127  vtxdumgrfival  16293  vtxduspgrfvedgfilem  16295  vtxduspgrfvedgfi  16296