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

Theorem s1eq 11071
Description: Equality theorem for a singleton word. (Contributed by Mario Carneiro, 26-Feb-2016.)
Assertion
Ref Expression
s1eq  |-  ( A  =  B  ->  <" A ">  =  <" B "> )

Proof of Theorem s1eq
StepHypRef Expression
1 fveq2 5575 . . . 4  |-  ( A  =  B  ->  (  _I  `  A )  =  (  _I  `  B
) )
21opeq2d 3825 . . 3  |-  ( A  =  B  ->  <. 0 ,  (  _I  `  A
) >.  =  <. 0 ,  (  _I  `  B
) >. )
32sneqd 3645 . 2  |-  ( A  =  B  ->  { <. 0 ,  (  _I  `  A ) >. }  =  { <. 0 ,  (  _I  `  B )
>. } )
4 df-s1 11068 . 2  |-  <" A ">  =  { <. 0 ,  (  _I  `  A ) >. }
5 df-s1 11068 . 2  |-  <" B ">  =  { <. 0 ,  (  _I  `  B ) >. }
63, 4, 53eqtr4g 2262 1  |-  ( A  =  B  ->  <" A ">  =  <" B "> )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1372   {csn 3632   <.cop 3635    _I cid 4334   ` cfv 5270   0cc0 7924   <"cs1 11067
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 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-ext 2186
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1375  df-nf 1483  df-sb 1785  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-rex 2489  df-v 2773  df-un 3169  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-br 4044  df-iota 5231  df-fv 5278  df-s1 11068
This theorem is referenced by:  s1eqd  11072  wrdl1exs1  11081  wrdl1s1  11082
  Copyright terms: Public domain W3C validator