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

Theorem en1eqsnbi 9174
Description: A set containing an element has exactly one element iff it is a singleton. Formerly part of proof for rngen1zr 20708. (Contributed by FL, 13-Feb-2010.) (Revised by AV, 25-Jan-2020.)
Assertion
Ref Expression
en1eqsnbi (𝐴𝐵 → (𝐵 ≈ 1o𝐵 = {𝐴}))

Proof of Theorem en1eqsnbi
StepHypRef Expression
1 en1eqsn 9173 . . 3 ((𝐴𝐵𝐵 ≈ 1o) → 𝐵 = {𝐴})
21ex 412 . 2 (𝐴𝐵 → (𝐵 ≈ 1o𝐵 = {𝐴}))
3 ensn1g 8957 . . 3 (𝐴𝐵 → {𝐴} ≈ 1o)
4 breq1 5099 . . 3 (𝐵 = {𝐴} → (𝐵 ≈ 1o ↔ {𝐴} ≈ 1o))
53, 4syl5ibrcom 247 . 2 (𝐴𝐵 → (𝐵 = {𝐴} → 𝐵 ≈ 1o))
62, 5impbid 212 1 (𝐴𝐵 → (𝐵 ≈ 1o𝐵 = {𝐴}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206   = wceq 1541  wcel 2113  {csn 4578   class class class wbr 5096  1oc1o 8388  cen 8878
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-12 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pr 5375
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-ne 2931  df-ral 3050  df-rex 3059  df-reu 3349  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-br 5097  df-opab 5159  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-suc 6321  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-1o 8395  df-en 8882
This theorem is referenced by:  srgen1zr  20149  rngen1zr  20708  rngosn4  38065
  Copyright terms: Public domain W3C validator