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

Theorem cbvrexsvw 3300
Description: Change bound variable by using a substitution. Version of cbvrexsv 3339 with a disjoint variable condition, which does not require ax-13 2371. (Contributed by NM, 2-Mar-2008.) Avoid ax-13 2371. (Revised by Gino Giotto, 10-Jan-2024.)
Assertion
Ref Expression
cbvrexsvw (∃𝑥𝐴 𝜑 ↔ ∃𝑦𝐴 [𝑦 / 𝑥]𝜑)
Distinct variable groups:   𝑥,𝐴   𝜑,𝑦   𝑦,𝐴,𝑥
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem cbvrexsvw
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 nfv 1918 . . 3 𝑧𝜑
2 nfs1v 2154 . . 3 𝑥[𝑧 / 𝑥]𝜑
3 sbequ12 2244 . . 3 (𝑥 = 𝑧 → (𝜑 ↔ [𝑧 / 𝑥]𝜑))
41, 2, 3cbvrexw 3289 . 2 (∃𝑥𝐴 𝜑 ↔ ∃𝑧𝐴 [𝑧 / 𝑥]𝜑)
5 nfv 1918 . . 3 𝑦[𝑧 / 𝑥]𝜑
6 nfv 1918 . . 3 𝑧[𝑦 / 𝑥]𝜑
7 sbequ 2087 . . 3 (𝑧 = 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑))
85, 6, 7cbvrexw 3289 . 2 (∃𝑧𝐴 [𝑧 / 𝑥]𝜑 ↔ ∃𝑦𝐴 [𝑦 / 𝑥]𝜑)
94, 8bitri 275 1 (∃𝑥𝐴 𝜑 ↔ ∃𝑦𝐴 [𝑦 / 𝑥]𝜑)
Colors of variables: wff setvar class
Syntax hints:  wb 205  [wsb 2068  wrex 3070
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-10 2138  ax-11 2155  ax-12 2172
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-ex 1783  df-nf 1787  df-sb 2069  df-clel 2811  df-nfc 2886  df-ral 3062  df-rex 3071
This theorem is referenced by:  rspesbca  3838  ac6sf  10430  ac6gf  36237
  Copyright terms: Public domain W3C validator