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

Theorem euxfrw 3686
Description: Transfer existential uniqueness from a variable 𝑥 to another variable 𝑦 contained in expression 𝐴. Version of euxfr 3688 with a disjoint variable condition, which does not require ax-13 2405. (Contributed by NM, 14-Nov-2004.) Avoid ax-13 2405. (Revised by GG, 10-Jan-2024.)
Hypotheses
Ref Expression
euxfrw.1 𝐴 ∈ V
euxfrw.2 ∃!𝑦 𝑥 = 𝐴
euxfrw.3 (𝑥 = 𝐴 → (𝜑𝜓))
Assertion
Ref Expression
euxfrw (∃!𝑥𝜑 ↔ ∃!𝑦𝜓)
Distinct variable groups:   𝜓,𝑥   𝜑,𝑦   𝑥,𝐴   𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)   𝐴(𝑦)

Proof of Theorem euxfrw
StepHypRef Expression
1 euxfrw.2 . . . . . 6 ∃!𝑦 𝑥 = 𝐴
2 euex 2606 . . . . . 6 (∃!𝑦 𝑥 = 𝐴 → ∃𝑦 𝑥 = 𝐴)
31, 2ax-mp 5 . . . . 5 𝑦 𝑥 = 𝐴
43biantrur 538 . . . 4 (𝜑 ↔ (∃𝑦 𝑥 = 𝐴𝜑))
5 19.41v 1971 . . . 4 (∃𝑦(𝑥 = 𝐴𝜑) ↔ (∃𝑦 𝑥 = 𝐴𝜑))
6 euxfrw.3 . . . . . 6 (𝑥 = 𝐴 → (𝜑𝜓))
76pm5.32i 582 . . . . 5 ((𝑥 = 𝐴𝜑) ↔ (𝑥 = 𝐴𝜓))
87exbii 1870 . . . 4 (∃𝑦(𝑥 = 𝐴𝜑) ↔ ∃𝑦(𝑥 = 𝐴𝜓))
94, 5, 83bitr2i 301 . . 3 (𝜑 ↔ ∃𝑦(𝑥 = 𝐴𝜓))
109eubii 2614 . 2 (∃!𝑥𝜑 ↔ ∃!𝑥𝑦(𝑥 = 𝐴𝜓))
11 euxfrw.1 . . 3 𝐴 ∈ V
121eumoi 2608 . . 3 ∃*𝑦 𝑥 = 𝐴
1311, 12euxfr2w 3685 . 2 (∃!𝑥𝑦(𝑥 = 𝐴𝜓) ↔ ∃!𝑦𝜓)
1410, 13bitri 277 1 (∃!𝑥𝜑 ↔ ∃!𝑦𝜓)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399   = wceq 1562  wex 1801  wcel 2144  ∃!weu 2597  Vcvv 3456
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2214  ax-ext 2736
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-tru 1565  df-ex 1802  df-nf 1806  df-mo 2568  df-eu 2598  df-cleq 2756  df-clel 2839
This theorem is referenced by:  moxfr  43278
  Copyright terms: Public domain W3C validator