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

Theorem elsng 3720
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 2245 . 2  |-  ( x  =  A  ->  (
x  =  B  <->  A  =  B ) )
2 df-sn 3711 . 2  |-  { B }  =  { x  |  x  =  B }
31, 2elab2g 2973 1  |-  ( A  e.  V  ->  ( A  e.  { B } 
<->  A  =  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    = wceq 1402    e. wcel 2209   {csn 3705
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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This theorem depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-v 2823  df-sn 3711
This theorem is referenced by:  elsn  3721  elsni  3723  snidg  3734  eltpg  3750  eldifsn  3836  elsucg  4544  funconstss  5818  fniniseg  5820  fniniseg2  5822  suppimacnvfn  6476  tpfidceq  7227  fidcenumlemrks  7260  ltxr  10156  elfzp12  10484  1exp  10983  imasaddfnlemg  13612  0subm  13768  0subg  13979  0nsg  13994  kerf1ghm  14054  lsssn0  14679  plycj  15785  2lgslem2  16125
  Copyright terms: Public domain W3C validator