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

Theorem exists2 2685
Description: A condition implying that at least two things exist. (Contributed by NM, 10-Apr-2004.) (Proof shortened by Andrew Salmon, 9-Jul-2011.)
Assertion
Ref Expression
exists2 ((∃𝑥𝜑 ∧ ∃𝑥 ¬ 𝜑) → ¬ ∃!𝑥 𝑥 = 𝑥)

Proof of Theorem exists2
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 nfeu1 2590 . . . . . 6 𝑥∃!𝑥 𝑥 = 𝑥
2 nfa1 2193 . . . . . 6 𝑥𝑥𝜑
3 exists1 2684 . . . . . . 7 (∃!𝑥 𝑥 = 𝑥 ↔ ∀𝑥 𝑥 = 𝑦)
4 axc16 2313 . . . . . . 7 (∀𝑥 𝑥 = 𝑦 → (𝜑 → ∀𝑥𝜑))
53, 4sylbi 208 . . . . . 6 (∃!𝑥 𝑥 = 𝑥 → (𝜑 → ∀𝑥𝜑))
61, 2, 5exlimd 2251 . . . . 5 (∃!𝑥 𝑥 = 𝑥 → (∃𝑥𝜑 → ∀𝑥𝜑))
76com12 32 . . . 4 (∃𝑥𝜑 → (∃!𝑥 𝑥 = 𝑥 → ∀𝑥𝜑))
8 alex 1920 . . . 4 (∀𝑥𝜑 ↔ ¬ ∃𝑥 ¬ 𝜑)
97, 8syl6ib 242 . . 3 (∃𝑥𝜑 → (∃!𝑥 𝑥 = 𝑥 → ¬ ∃𝑥 ¬ 𝜑))
109con2d 131 . 2 (∃𝑥𝜑 → (∃𝑥 ¬ 𝜑 → ¬ ∃!𝑥 𝑥 = 𝑥))
1110imp 395 1 ((∃𝑥𝜑 ∧ ∃𝑥 ¬ 𝜑) → ¬ ∃!𝑥 𝑥 = 𝑥)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 384  wal 1650  wex 1874  ∃!weu 2581
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1890  ax-4 1904  ax-5 2005  ax-6 2070  ax-7 2105  ax-10 2183  ax-11 2198  ax-12 2211  ax-13 2352
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 874  df-tru 1656  df-ex 1875  df-nf 1879  df-mo 2565  df-eu 2582
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator