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

Theorem s1val 11363
Description: Value of a singleton word. (Contributed by Stefan O'Rear, 15-Aug-2015.) (Revised by Mario Carneiro, 26-Feb-2016.)
Assertion
Ref Expression
s1val  |-  ( A  e.  V  ->  <" A ">  =  { <. 0 ,  A >. } )

Proof of Theorem s1val
StepHypRef Expression
1 df-s1 11362 . 2  |-  <" A ">  =  { <. 0 ,  (  _I  `  A ) >. }
2 fvi 5754 . . . 4  |-  ( A  e.  V  ->  (  _I  `  A )  =  A )
32opeq2d 3906 . . 3  |-  ( A  e.  V  ->  <. 0 ,  (  _I  `  A
) >.  =  <. 0 ,  A >. )
43sneqd 3718 . 2  |-  ( A  e.  V  ->  { <. 0 ,  (  _I  `  A ) >. }  =  { <. 0 ,  A >. } )
51, 4eqtrid 2283 1  |-  ( A  e.  V  ->  <" A ">  =  { <. 0 ,  A >. } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1402    e. wcel 2209   {csn 3705   <.cop 3708    _I cid 4428   ` cfv 5372   0cc0 8169   <"cs1 11361
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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-iota 5332  df-fun 5374  df-fv 5380  df-s1 11362
This theorem is referenced by:  s1rn  11364  s1cl  11367  s1prc  11369  s1leng  11370  s1dmg  11371  s1fv  11372  s111  11377  uspgr1ewopdc  16399  usgr2v1e2w  16401
  Copyright terms: Public domain W3C validator