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

Theorem exists2 2663
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 2255 . . . . . 6 (∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥𝜑)
21nfrd 1794 . . . . 5 (∀𝑥 𝑥 = 𝑦 → (∃𝑥𝜑 → ∀𝑥𝜑))
32com12 32 . . . 4 (∃𝑥𝜑 → (∀𝑥 𝑥 = 𝑦 → ∀𝑥𝜑))
4 exists1 2662 . . . 4 (∃!𝑥 𝑥 = 𝑥 ↔ ∀𝑥 𝑥 = 𝑦)
5 alex 1828 . . . . 5 (∀𝑥𝜑 ↔ ¬ ∃𝑥 ¬ 𝜑)
65bicomi 223 . . . 4 (¬ ∃𝑥 ¬ 𝜑 ↔ ∀𝑥𝜑)
73, 4, 63imtr4g 296 . . 3 (∃𝑥𝜑 → (∃!𝑥 𝑥 = 𝑥 → ¬ ∃𝑥 ¬ 𝜑))
87con2d 134 . 2 (∃𝑥𝜑 → (∃𝑥 ¬ 𝜑 → ¬ ∃!𝑥 𝑥 = 𝑥))
98imp 407 1 ((∃𝑥𝜑 ∧ ∃𝑥 ¬ 𝜑) → ¬ ∃!𝑥 𝑥 = 𝑥)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 396  wal 1537  wex 1782  ∃!weu 2568
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-12 2171
This theorem depends on definitions:  df-bi 206  df-an 397  df-tru 1542  df-ex 1783  df-nf 1787  df-mo 2540  df-eu 2569
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator