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

Theorem euae 2687
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 36946 and dtru 5418. (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 2005 . . 3 𝑥
21biantrur 539 . 2 (∃𝑦𝑥(⊤ → 𝑥 = 𝑦) ↔ (∃𝑥⊤ ∧ ∃𝑦𝑥(⊤ → 𝑥 = 𝑦)))
3 hbaev 2091 . . . . 5 (∀𝑥 𝑥 = 𝑦 → ∀𝑦𝑥 𝑥 = 𝑦)
4319.8w 2008 . . . 4 (∀𝑥 𝑥 = 𝑦 → ∃𝑦𝑥 𝑥 = 𝑦)
5 hbnaev 2094 . . . . . 6 (¬ ∀𝑥 𝑥 = 𝑦 → ∀𝑦 ¬ ∀𝑥 𝑥 = 𝑦)
6 alnex 1811 . . . . . 6 (∀𝑦 ¬ ∀𝑥 𝑥 = 𝑦 ↔ ¬ ∃𝑦𝑥 𝑥 = 𝑦)
75, 6sylib 221 . . . . 5 (¬ ∀𝑥 𝑥 = 𝑦 → ¬ ∃𝑦𝑥 𝑥 = 𝑦)
87con4i 115 . . . 4 (∃𝑦𝑥 𝑥 = 𝑦 → ∀𝑥 𝑥 = 𝑦)
94, 8impbii 212 . . 3 (∀𝑥 𝑥 = 𝑦 ↔ ∃𝑦𝑥 𝑥 = 𝑦)
10 trut 1576 . . . . 5 (𝑥 = 𝑦 ↔ (⊤ → 𝑥 = 𝑦))
1110albii 1849 . . . 4 (∀𝑥 𝑥 = 𝑦 ↔ ∀𝑥(⊤ → 𝑥 = 𝑦))
1211exbii 1878 . . 3 (∃𝑦𝑥 𝑥 = 𝑦 ↔ ∃𝑦𝑥(⊤ → 𝑥 = 𝑦))
139, 12bitri 278 . 2 (∀𝑥 𝑥 = 𝑦 ↔ ∃𝑦𝑥(⊤ → 𝑥 = 𝑦))
14 eu3v 2598 . 2 (∃!𝑥⊤ ↔ (∃𝑥⊤ ∧ ∃𝑦𝑥(⊤ → 𝑥 = 𝑦)))
152, 13, 143bitr4ri 307 1 (∃!𝑥⊤ ↔ ∀𝑥 𝑥 = 𝑦)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wb 209  wa 400  wal 1568  wtru 1571  wex 1809  ∃!weu 2596
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038
This proof depends on definitions:  df-bi 210  df-an 401  df-tru 1573  df-ex 1810  df-mo 2567  df-eu 2597
This theorem is used by:  exists1  2688
  Copyright terms: Public domain W3C validator