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

Theorem exists2 2691
Description: A condition implying that at least two things exist. (Contributed by NM, 10-Apr-2004.) (Proof shortened by Andrew Salmon, 9-Jul-2011.) Reduce axiom usage. (Revised by Wolf Lammen, 4-Mar-2023.)
Assertion
Ref Expression
exists2 ((∃𝑥𝜑 ∧ ∃𝑥 ¬ 𝜑) → ¬ ∃!𝑥 𝑥 = 𝑥)

Proof of Theorem exists2
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 axc16nf 2301 . . . . . 6 (∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥𝜑)
21nfrd 1814 . . . . 5 (∀𝑥 𝑥 = 𝑦 → (∃𝑥𝜑 → ∀𝑥𝜑))
32com12 33 . . . 4 (∃𝑥𝜑 → (∀𝑥 𝑥 = 𝑦 → ∀𝑥𝜑))
4 exists1 2690 . . . 4 (∃!𝑥 𝑥 = 𝑥 ↔ ∀𝑥 𝑥 = 𝑦)
5 alex 1849 . . . . 5 (∀𝑥𝜑 ↔ ¬ ∃𝑥 ¬ 𝜑)
65bicomi 227 . . . 4 (¬ ∃𝑥 ¬ 𝜑 ↔ ∀𝑥𝜑)
73, 4, 63imtr4g 299 . . 3 (∃𝑥𝜑 → (∃!𝑥 𝑥 = 𝑥 → ¬ ∃𝑥 ¬ 𝜑))
87con2d 135 . 2 (∃𝑥𝜑 → (∃𝑥 ¬ 𝜑 → ¬ ∃!𝑥 𝑥 = 𝑥))
98imp 411 1 ((∃𝑥𝜑 ∧ ∃𝑥 ¬ 𝜑) → ¬ ∃!𝑥 𝑥 = 𝑥)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 400  wal 1561  wex 1802  ∃!weu 2598
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-12 2215
This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1566  df-ex 1803  df-nf 1807  df-mo 2569  df-eu 2599
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator