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

Theorem sneqrg 3803
Description: Closed form of sneqr 3801. (Contributed by Scott Fenton, 1-Apr-2011.)
Assertion
Ref Expression
sneqrg  |-  ( A  e.  V  ->  ( { A }  =  { B }  ->  A  =  B ) )

Proof of Theorem sneqrg
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 sneq 3644 . . . 4  |-  ( x  =  A  ->  { x }  =  { A } )
21eqeq1d 2214 . . 3  |-  ( x  =  A  ->  ( { x }  =  { B }  <->  { A }  =  { B } ) )
3 eqeq1 2212 . . 3  |-  ( x  =  A  ->  (
x  =  B  <->  A  =  B ) )
42, 3imbi12d 234 . 2  |-  ( x  =  A  ->  (
( { x }  =  { B }  ->  x  =  B )  <->  ( { A }  =  { B }  ->  A  =  B ) ) )
5 vex 2775 . . 3  |-  x  e. 
_V
65sneqr 3801 . 2  |-  ( { x }  =  { B }  ->  x  =  B )
74, 6vtoclg 2833 1  |-  ( A  e.  V  ->  ( { A }  =  { B }  ->  A  =  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = 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:  sneqbg  3804
  Copyright terms: Public domain W3C validator