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

Theorem s111 11319
Description: The singleton word function is injective. (Contributed by Mario Carneiro, 1-Oct-2015.) (Revised by Mario Carneiro, 26-Feb-2016.)
Assertion
Ref Expression
s111  |-  ( ( S  e.  A  /\  T  e.  A )  ->  ( <" S ">  =  <" T ">  <->  S  =  T
) )

Proof of Theorem s111
StepHypRef Expression
1 s1val 11305 . . 3  |-  ( S  e.  A  ->  <" S ">  =  { <. 0 ,  S >. } )
2 s1val 11305 . . 3  |-  ( T  e.  A  ->  <" T ">  =  { <. 0 ,  T >. } )
31, 2eqeqan12d 2248 . 2  |-  ( ( S  e.  A  /\  T  e.  A )  ->  ( <" S ">  =  <" T ">  <->  { <. 0 ,  S >. }  =  { <. 0 ,  T >. } ) )
4 0nn0 9511 . . . 4  |-  0  e.  NN0
5 simpl 109 . . . 4  |-  ( ( S  e.  A  /\  T  e.  A )  ->  S  e.  A )
6 opexg 4344 . . . 4  |-  ( ( 0  e.  NN0  /\  S  e.  A )  -> 
<. 0 ,  S >.  e.  _V )
74, 5, 6sylancr 414 . . 3  |-  ( ( S  e.  A  /\  T  e.  A )  -> 
<. 0 ,  S >.  e.  _V )
8 sneqbg 3867 . . 3  |-  ( <.
0 ,  S >.  e. 
_V  ->  ( { <. 0 ,  S >. }  =  { <. 0 ,  T >. }  <->  <. 0 ,  S >.  =  <. 0 ,  T >. ) )
97, 8syl 14 . 2  |-  ( ( S  e.  A  /\  T  e.  A )  ->  ( { <. 0 ,  S >. }  =  { <. 0 ,  T >. }  <->  <. 0 ,  S >.  = 
<. 0 ,  T >. ) )
10 0z 9588 . . . 4  |-  0  e.  ZZ
11 eqid 2232 . . . . 5  |-  0  =  0
12 opthg 4354 . . . . . 6  |-  ( ( 0  e.  ZZ  /\  S  e.  A )  ->  ( <. 0 ,  S >.  =  <. 0 ,  T >.  <-> 
( 0  =  0  /\  S  =  T ) ) )
1312baibd 931 . . . . 5  |-  ( ( ( 0  e.  ZZ  /\  S  e.  A )  /\  0  =  0 )  ->  ( <. 0 ,  S >.  = 
<. 0 ,  T >.  <-> 
S  =  T ) )
1411, 13mpan2 425 . . . 4  |-  ( ( 0  e.  ZZ  /\  S  e.  A )  ->  ( <. 0 ,  S >.  =  <. 0 ,  T >.  <-> 
S  =  T ) )
1510, 14mpan 424 . . 3  |-  ( S  e.  A  ->  ( <. 0 ,  S >.  = 
<. 0 ,  T >.  <-> 
S  =  T ) )
1615adantr 276 . 2  |-  ( ( S  e.  A  /\  T  e.  A )  ->  ( <. 0 ,  S >.  =  <. 0 ,  T >.  <-> 
S  =  T ) )
173, 9, 163bitrd 214 1  |-  ( ( S  e.  A  /\  T  e.  A )  ->  ( <" S ">  =  <" T ">  <->  S  =  T
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2203   _Vcvv 2813   {csn 3689   <.cop 3692   0cc0 8127   NN0cn0 9496   ZZcz 9577   <"cs1 11303
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-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-i2m1 8232  ax-rnegex 8236
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-rab 2529  df-v 2815  df-sbc 3043  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-iota 5312  df-fun 5354  df-fv 5360  df-ov 6053  df-neg 8447  df-n0 9497  df-z 9578  df-s1 11304
This theorem is referenced by:  pfxsuff1eqwrdeq  11391
  Copyright terms: Public domain W3C validator