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

Theorem elsn2g 3666
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 3651 . 2  |-  ( A  e.  { B }  ->  A  =  B )
2 snidg 3662 . . 3  |-  ( B  e.  V  ->  B  e.  { B } )
3 eleq1 2268 . . 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 1373    e. wcel 2176   {csn 3633
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 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-ext 2187
This theorem depends on definitions:  df-bi 117  df-tru 1376  df-nf 1484  df-sb 1786  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-v 2774  df-sn 3639
This theorem is referenced by:  elsn2  3667  elsuc2g  4452  mptiniseg  5177  elfzp1  10194  fzosplitsni  10364  zfz1isolemiso  10984  1nsgtrivd  13555  zrhrhmb  14384  ply1termlem  15214
  Copyright terms: Public domain W3C validator