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

Theorem euae 2719
Description: Two ways to express "exactly one thing exists". To paraphrase the statement and explain the label: there Exists a Unique thing if and only if for All 𝑥, 𝑥 Equals some given (and disjoint) 𝑦. Both sides are false in set theory, see theorems neutru 33366 and dtru 5169. (Contributed by NM, 5-Apr-2004.) State the theorem using truth constant . (Revised by BJ, 7-Oct-2022.) Reduce axiom dependencies. (Revised by Wolf Lammen, 2-Mar-2023.)
Assertion
Ref Expression
euae (∃!𝑥⊤ ↔ ∀𝑥 𝑥 = 𝑦)
Distinct variable group:   𝑥,𝑦

Proof of Theorem euae
StepHypRef Expression
1 extru 1961 . . 3 𝑥
21biantrur 531 . 2 (∃𝑦𝑥(⊤ → 𝑥 = 𝑦) ↔ (∃𝑥⊤ ∧ ∃𝑦𝑥(⊤ → 𝑥 = 𝑦)))
3 hbaev 2039 . . . . 5 (∀𝑥 𝑥 = 𝑦 → ∀𝑦𝑥 𝑥 = 𝑦)
4319.8w 1964 . . . 4 (∀𝑥 𝑥 = 𝑦 → ∃𝑦𝑥 𝑥 = 𝑦)
5 hbnaev 2042 . . . . . 6 (¬ ∀𝑥 𝑥 = 𝑦 → ∀𝑦 ¬ ∀𝑥 𝑥 = 𝑦)
6 alnex 1767 . . . . . 6 (∀𝑦 ¬ ∀𝑥 𝑥 = 𝑦 ↔ ¬ ∃𝑦𝑥 𝑥 = 𝑦)
75, 6sylib 219 . . . . 5 (¬ ∀𝑥 𝑥 = 𝑦 → ¬ ∃𝑦𝑥 𝑥 = 𝑦)
87con4i 114 . . . 4 (∃𝑦𝑥 𝑥 = 𝑦 → ∀𝑥 𝑥 = 𝑦)
94, 8impbii 210 . . 3 (∀𝑥 𝑥 = 𝑦 ↔ ∃𝑦𝑥 𝑥 = 𝑦)
10 trut 1531 . . . . 5 (𝑥 = 𝑦 ↔ (⊤ → 𝑥 = 𝑦))
1110albii 1805 . . . 4 (∀𝑥 𝑥 = 𝑦 ↔ ∀𝑥(⊤ → 𝑥 = 𝑦))
1211exbii 1833 . . 3 (∃𝑦𝑥 𝑥 = 𝑦 ↔ ∃𝑦𝑥(⊤ → 𝑥 = 𝑦))
139, 12bitri 276 . 2 (∀𝑥 𝑥 = 𝑦 ↔ ∃𝑦𝑥(⊤ → 𝑥 = 𝑦))
14 eu3v 2615 . 2 (∃!𝑥⊤ ↔ (∃𝑥⊤ ∧ ∃𝑦𝑥(⊤ → 𝑥 = 𝑦)))
152, 13, 143bitr4ri 305 1 (∃!𝑥⊤ ↔ ∀𝑥 𝑥 = 𝑦)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 207  wa 396  wal 1523  wtru 1526  wex 1765  ∃!weu 2613
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1781  ax-4 1795  ax-5 1892  ax-6 1951  ax-7 1996
This theorem depends on definitions:  df-bi 208  df-an 397  df-tru 1528  df-ex 1766  df-mo 2578  df-eu 2614
This theorem is referenced by:  exists1  2721
  Copyright terms: Public domain W3C validator