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

Theorem euxfr 3681
Description: Transfer existential uniqueness from a variable 𝑥 to another variable 𝑦 contained in expression 𝐴. Usage of this theorem is discouraged because it depends on ax-13 2402. Use the weaker euxfrw 3679 when possible. (Contributed by NM, 14-Nov-2004.) (New usage is discouraged.)
Hypotheses
Ref Expression
euxfr.1 𝐴 ∈ V
euxfr.2 ∃!𝑦 𝑥 = 𝐴
euxfr.3 (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
Assertion
Ref Expression
euxfr (∃!𝑥𝜑 ↔ ∃!𝑦𝜓)
Distinct variable groups:   𝜓,𝑥   𝜑,𝑦   𝑥,𝐴
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)   𝐴(𝑦)

Proof of Theorem euxfr
StepHypRef Expression
1 euxfr.2 . . . . . 6 ∃!𝑦 𝑥 = 𝐴
2 euex 2603 . . . . . 6 (∃!𝑦 𝑥 = 𝐴 → ∃𝑦 𝑥 = 𝐴)
31, 2ax-mp 5 . . . . 5 ∃𝑦 𝑥 = 𝐴
43biantrur 540 . . . 4 (𝜑 ↔ (∃𝑦 𝑥 = 𝐴 ∧ 𝜑))
5 19.41v 1982 . . . 4 (∃𝑦(𝑥 = 𝐴 ∧ 𝜑) ↔ (∃𝑦 𝑥 = 𝐴 ∧ 𝜑))
6 euxfr.3 . . . . . 6 (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
76pm5.32i 585 . . . . 5 ((𝑥 = 𝐴 ∧ 𝜑) ↔ (𝑥 = 𝐴 ∧ 𝜓))
87exbii 1881 . . . 4 (∃𝑦(𝑥 = 𝐴 ∧ 𝜑) ↔ ∃𝑦(𝑥 = 𝐴 ∧ 𝜓))
94, 5, 83bitr2i 302 . . 3 (𝜑 ↔ ∃𝑦(𝑥 = 𝐴 ∧ 𝜓))
109eubii 2611 . 2 (∃!𝑥𝜑 ↔ ∃!𝑥∃𝑦(𝑥 = 𝐴 ∧ 𝜓))
11 euxfr.1 . . 3 𝐴 ∈ V
121eumoi 2605 . . 3 ∃*𝑦 𝑥 = 𝐴
1311, 12euxfr2 3680 . 2 (∃!𝑥∃𝑦(𝑥 = 𝐴 ∧ 𝜓) ↔ ∃!𝑦𝜓)
1410, 13bitri 278 1 (∃!𝑥𝜑 ↔ ∃!𝑦𝜓)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∃!weu 2594  Vcvv 3451
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-13 2402  ax-ext 2733
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-mo 2565  df-eu 2595  df-cleq 2753  df-clel 2836
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator