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

Theorem eqsn 4790
Description: Two ways to express that a nonempty set equals a singleton. (Contributed by NM, 15-Dec-2007.) (Proof shortened by JJ, 23-Jul-2021.)
Assertion
Ref Expression
eqsn (𝐴 ≠ ∅ → (𝐴 = {𝐵} ↔ ∀𝑥 ∈ 𝐴 𝑥 = 𝐵))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem eqsn
StepHypRef Expression
1 df-ne 2960 . . 3 (𝐴 ≠ ∅ ↔ ¬ 𝐴 = ∅)
2 biorf 950 . . 3 (¬ 𝐴 = ∅ → (𝐴 = {𝐵} ↔ (𝐴 = ∅ ∨ 𝐴 = {𝐵})))
31, 2sylbi 220 . 2 (𝐴 ≠ ∅ → (𝐴 = {𝐵} ↔ (𝐴 = ∅ ∨ 𝐴 = {𝐵})))
4 dfss3 3902 . . 3 (𝐴 ⊆ {𝐵} ↔ ∀𝑥 ∈ 𝐴 𝑥 ∈ {𝐵})
5 sssn 4787 . . 3 (𝐴 ⊆ {𝐵} ↔ (𝐴 = ∅ ∨ 𝐴 = {𝐵}))
6 velsn 4600 . . . 4 (𝑥 ∈ {𝐵} ↔ 𝑥 = 𝐵)
76ralbii 3112 . . 3 (∀𝑥 ∈ 𝐴 𝑥 ∈ {𝐵} ↔ ∀𝑥 ∈ 𝐴 𝑥 = 𝐵)
84, 5, 73bitr3i 304 . 2 ((𝐴 = ∅ ∨ 𝐴 = {𝐵}) ↔ ∀𝑥 ∈ 𝐴 𝑥 = 𝐵)
93, 8bitrdi 290 1 (𝐴 ≠ ∅ → (𝐴 = {𝐵} ↔ ∀𝑥 ∈ 𝐴 𝑥 = 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∨ wo 861   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080   ⊆ wss 3900  ∅c0 4281  {csn 4588
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-v 3456  df-ss 3901  df-dif 4050  df-nul 4282  df-sn 4589
This theorem is used by:  eqsnd  4791  issn  4792  zornn0g  10622  hashgt12el  14608  hashgt12el2  14609  hashge2el2dif  14666  simpgnideld  20366  01eq0ring  20832  lssne0  21277  qtopeu  24090  n0nsnel  33210  dimval  34344  dimvalfi  34345  rngoueqz  39140  n0nsn2el  48429  lmod0rng  49660
  Copyright terms: Public domain W3C validator