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

Theorem sneqr 3848
Description: If the singletons of two sets are equal, the two sets are equal. Part of Exercise 4 of [TakeutiZaring] p. 15. (Contributed by NM, 27-Aug-1993.)
Hypothesis
Ref Expression
sneqr.1  |-  A  e. 
_V
Assertion
Ref Expression
sneqr  |-  ( { A }  =  { B }  ->  A  =  B )

Proof of Theorem sneqr
StepHypRef Expression
1 sneqr.1 . . . 4  |-  A  e. 
_V
21snid 3704 . . 3  |-  A  e. 
{ A }
3 eleq2 2295 . . 3  |-  ( { A }  =  { B }  ->  ( A  e.  { A }  <->  A  e.  { B }
) )
42, 3mpbii 148 . 2  |-  ( { A }  =  { B }  ->  A  e. 
{ B } )
51elsn 3689 . 2  |-  ( A  e.  { B }  <->  A  =  B )
64, 5sylib 122 1  |-  ( { A }  =  { B }  ->  A  =  B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1398    e. wcel 2202   _Vcvv 2803   {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:  sneqrg  3850  opth1  4334  cc2lem  7545
  Copyright terms: Public domain W3C validator