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

Theorem euor 2641
Description: Introduce a disjunct into a unique existential quantifier. For a version requiring disjoint variables, but fewer axioms, see euorv 2642. (Contributed by NM, 21-Oct-2005.)
Hypothesis
Ref Expression
euor.nf 𝑥𝜑
Assertion
Ref Expression
euor ((¬ 𝜑 ∧ ∃!𝑥𝜓) → ∃!𝑥(𝜑𝜓))

Proof of Theorem euor
StepHypRef Expression
1 euor.nf . . . 4 𝑥𝜑
21nfn 1890 . . 3 𝑥 ¬ 𝜑
3 biorf 950 . . 3 𝜑 → (𝜓 ↔ (𝜑𝜓)))
42, 3eubid 2617 . 2 𝜑 → (∃!𝑥𝜓 ↔ ∃!𝑥(𝜑𝜓)))
54biimpa 482 1 ((¬ 𝜑 ∧ ∃!𝑥𝜓) → ∃!𝑥(𝜑𝜓))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wa 401  wo 861  wnf 1816  ∃!weu 2598
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-12 2216
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1813  df-nf 1817  df-mo 2569  df-eu 2599
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator