MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cbvrexsvw Structured version   Visualization version   GIF version

Theorem cbvrexsvw 3317
Description: Change bound variable by using a substitution. Version of cbvrexsv 3356 with a disjoint variable condition, which does not require ax-13 2404. (Contributed by NM, 2-Mar-2008.) Avoid ax-13 2404. (Revised by GG, 10-Jan-2024.) (Proof shortened by Wolf Lammen, 8-Mar-2025.)
Assertion
Ref Expression
cbvrexsvw (∃𝑥𝐴 𝜑 ↔ ∃𝑦𝐴 [𝑦 / 𝑥]𝜑)
Distinct variable groups:   𝑥,𝑦,𝐴   𝜑,𝑦
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem cbvrexsvw
StepHypRef Expression
1 nfv 1944 . 2 𝑦𝜑
2 nfs1v 2191 . 2 𝑥[𝑦 / 𝑥]𝜑
3 sbequ12 2287 . 2 (𝑥 = 𝑦 → (𝜑 ↔ [𝑦 / 𝑥]𝜑))
41, 2, 3cbvrexw 3308 1 (∃𝑥𝐴 𝜑 ↔ ∃𝑦𝐴 [𝑦 / 𝑥]𝜑)
Colors of variables: wff setvar class
Syntax hints:  wb 209  [wsb 2096  wrex 3089
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-10 2176  ax-11 2192  ax-12 2213
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-ex 1810  df-nf 1814  df-sb 2097  df-clel 2838  df-nfc 2912  df-ral 3080  df-rex 3090
This theorem is referenced by:  rspesbca  3834  ac6sf  10468  ac6gf  38383
  Copyright terms: Public domain W3C validator