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

Theorem elsng 3481
Description: There is exactly one element in a singleton. Exercise 2 of [TakeutiZaring] p. 15 (generalized). (Contributed by NM, 13-Sep-1995.) (Proof shortened by Andrew Salmon, 29-Jun-2011.)
Assertion
Ref Expression
elsng  |-  ( A  e.  V  ->  ( A  e.  { B } 
<->  A  =  B ) )

Proof of Theorem elsng
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 eqeq1 2101 . 2  |-  ( x  =  A  ->  (
x  =  B  <->  A  =  B ) )
2 df-sn 3472 . 2  |-  { B }  =  { x  |  x  =  B }
31, 2elab2g 2776 1  |-  ( A  e.  V  ->  ( A  e.  { B } 
<->  A  =  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 104    = wceq 1296    e. wcel 1445   {csn 3466
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 668  ax-5 1388  ax-7 1389  ax-gen 1390  ax-ie1 1434  ax-ie2 1435  ax-8 1447  ax-10 1448  ax-11 1449  ax-i12 1450  ax-bndl 1451  ax-4 1452  ax-17 1471  ax-i9 1475  ax-ial 1479  ax-i5r 1480  ax-ext 2077
This theorem depends on definitions:  df-bi 116  df-tru 1299  df-nf 1402  df-sb 1700  df-clab 2082  df-cleq 2088  df-clel 2091  df-nfc 2224  df-v 2635  df-sn 3472
This theorem is referenced by:  elsn  3482  elsni  3484  snidg  3493  eltpg  3508  eldifsn  3589  elsucg  4255  funconstss  5456  fniniseg  5458  fniniseg2  5460  fidcenumlemrks  6742  ltxr  9345  elfzp12  9662  1exp  10115
  Copyright terms: Public domain W3C validator