ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  eqsnm GIF version

Theorem eqsnm 3809
Description: Two ways to express that an inhabited set equals a singleton. (Contributed by Jim Kingdon, 11-Aug-2018.)
Assertion
Ref Expression
eqsnm (∃𝑥 𝑥𝐴 → (𝐴 = {𝐵} ↔ ∀𝑥𝐴 𝑥 = 𝐵))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem eqsnm
StepHypRef Expression
1 sssnm 3808 . 2 (∃𝑥 𝑥𝐴 → (𝐴 ⊆ {𝐵} ↔ 𝐴 = {𝐵}))
2 dfss3 3190 . . 3 (𝐴 ⊆ {𝐵} ↔ ∀𝑥𝐴 𝑥 ∈ {𝐵})
3 velsn 3660 . . . 4 (𝑥 ∈ {𝐵} ↔ 𝑥 = 𝐵)
43ralbii 2514 . . 3 (∀𝑥𝐴 𝑥 ∈ {𝐵} ↔ ∀𝑥𝐴 𝑥 = 𝐵)
52, 4bitri 184 . 2 (𝐴 ⊆ {𝐵} ↔ ∀𝑥𝐴 𝑥 = 𝐵)
61, 5bitr3di 195 1 (∃𝑥 𝑥𝐴 → (𝐴 = {𝐵} ↔ ∀𝑥𝐴 𝑥 = 𝐵))
Colors of variables: wff set class
Syntax hints:  wi 4  wb 105   = wceq 1373  wex 1516  wcel 2178  wral 2486  wss 3174  {csn 3643
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2189
This theorem depends on definitions:  df-bi 117  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-v 2778  df-in 3180  df-ss 3187  df-sn 3649
This theorem is referenced by:  01eq0ring  14066  nninfall  16148
  Copyright terms: Public domain W3C validator