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

Theorem snec 6190
Description: The singleton of an equivalence class. (Contributed by NM, 29-Jan-1999.) (Revised by Mario Carneiro, 9-Jul-2014.)
Hypothesis
Ref Expression
snec.1  |-  A  e. 
_V
Assertion
Ref Expression
snec  |-  { [ A ] R }  =  ( { A } /. R )

Proof of Theorem snec
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 snec.1 . . . 4  |-  A  e. 
_V
2 eceq1 6164 . . . . 5  |-  ( x  =  A  ->  [ x ] R  =  [ A ] R )
32eqeq2d 2092 . . . 4  |-  ( x  =  A  ->  (
y  =  [ x ] R  <->  y  =  [ A ] R ) )
41, 3rexsn 3437 . . 3  |-  ( E. x  e.  { A } y  =  [
x ] R  <->  y  =  [ A ] R )
54abbii 2194 . 2  |-  { y  |  E. x  e. 
{ A } y  =  [ x ] R }  =  {
y  |  y  =  [ A ] R }
6 df-qs 6135 . 2  |-  ( { A } /. R
)  =  { y  |  E. x  e. 
{ A } y  =  [ x ] R }
7 df-sn 3404 . 2  |-  { [ A ] R }  =  { y  |  y  =  [ A ] R }
85, 6, 73eqtr4ri 2112 1  |-  { [ A ] R }  =  ( { A } /. R )
Colors of variables: wff set class
Syntax hints:    = wceq 1284    e. wcel 1433   {cab 2067   E.wrex 2349   _Vcvv 2601   {csn 3398   [cec 6127   /.cqs 6128
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-rex 2354  df-v 2603  df-sbc 2816  df-un 2977  df-in 2979  df-ss 2986  df-sn 3404  df-pr 3405  df-op 3407  df-br 3786  df-opab 3840  df-xp 4369  df-cnv 4371  df-dm 4373  df-rn 4374  df-res 4375  df-ima 4376  df-ec 6131  df-qs 6135
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator