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

Theorem elsn2g 3706
Description: There is only one element in a singleton. Exercise 2 of [TakeutiZaring] p. 15. This variation requires only that  B, rather than  A, be a set. (Contributed by NM, 28-Oct-2003.)
Assertion
Ref Expression
elsn2g  |-  ( B  e.  V  ->  ( A  e.  { B } 
<->  A  =  B ) )

Proof of Theorem elsn2g
StepHypRef Expression
1 elsni 3691 . 2  |-  ( A  e.  { B }  ->  A  =  B )
2 snidg 3702 . . 3  |-  ( B  e.  V  ->  B  e.  { B } )
3 eleq1 2294 . . 3  |-  ( A  =  B  ->  ( A  e.  { B } 
<->  B  e.  { B } ) )
42, 3syl5ibrcom 157 . 2  |-  ( B  e.  V  ->  ( A  =  B  ->  A  e.  { B }
) )
51, 4impbid2 143 1  |-  ( B  e.  V  ->  ( A  e.  { B } 
<->  A  =  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    = wceq 1398    e. wcel 2202   {csn 3673
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-v 2805  df-sn 3679
This theorem is referenced by:  elsn2  3707  elsuc2g  4508  mptiniseg  5238  elfzp1  10369  fzosplitsni  10544  zfz1isolemiso  11166  1nsgtrivd  13886  zrhrhmb  14718  ply1termlem  15553
  Copyright terms: Public domain W3C validator