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

Theorem ccats1val2 11166
Description: Value of the symbol concatenated with a word. (Contributed by Alexander van der Vekens, 5-Aug-2018.) (Proof shortened by Alexander van der Vekens, 14-Oct-2018.)
Assertion
Ref Expression
ccats1val2  |-  ( ( W  e. Word  V  /\  S  e.  V  /\  I  =  ( `  W
) )  ->  (
( W ++  <" S "> ) `  I
)  =  S )

Proof of Theorem ccats1val2
StepHypRef Expression
1 simp1 1021 . . 3  |-  ( ( W  e. Word  V  /\  S  e.  V  /\  I  =  ( `  W
) )  ->  W  e. Word  V )
2 s1cl 11149 . . . 4  |-  ( S  e.  V  ->  <" S ">  e. Word  V )
323ad2ant2 1043 . . 3  |-  ( ( W  e. Word  V  /\  S  e.  V  /\  I  =  ( `  W
) )  ->  <" S ">  e. Word  V )
4 lencl 11070 . . . . . . 7  |-  ( W  e. Word  V  ->  ( `  W )  e.  NN0 )
54nn0zd 9563 . . . . . 6  |-  ( W  e. Word  V  ->  ( `  W )  e.  ZZ )
6 elfzomin 10407 . . . . . 6  |-  ( ( `  W )  e.  ZZ  ->  ( `  W )  e.  ( ( `  W
)..^ ( ( `  W
)  +  1 ) ) )
71, 5, 63syl 17 . . . . 5  |-  ( ( W  e. Word  V  /\  S  e.  V  /\  I  =  ( `  W
) )  ->  ( `  W )  e.  ( ( `  W )..^ ( ( `  W )  +  1 ) ) )
8 s1leng 11152 . . . . . . . 8  |-  ( S  e.  V  ->  ( ` 
<" S "> )  =  1 )
98oveq2d 6016 . . . . . . 7  |-  ( S  e.  V  ->  (
( `  W )  +  ( `  <" S "> ) )  =  ( ( `  W
)  +  1 ) )
109oveq2d 6016 . . . . . 6  |-  ( S  e.  V  ->  (
( `  W )..^ ( ( `  W )  +  ( `  <" S "> ) ) )  =  ( ( `  W
)..^ ( ( `  W
)  +  1 ) ) )
11103ad2ant2 1043 . . . . 5  |-  ( ( W  e. Word  V  /\  S  e.  V  /\  I  =  ( `  W
) )  ->  (
( `  W )..^ ( ( `  W )  +  ( `  <" S "> ) ) )  =  ( ( `  W
)..^ ( ( `  W
)  +  1 ) ) )
127, 11eleqtrrd 2309 . . . 4  |-  ( ( W  e. Word  V  /\  S  e.  V  /\  I  =  ( `  W
) )  ->  ( `  W )  e.  ( ( `  W )..^ ( ( `  W )  +  ( `  <" S "> ) ) ) )
13 eleq1 2292 . . . . 5  |-  ( I  =  ( `  W
)  ->  ( I  e.  ( ( `  W
)..^ ( ( `  W
)  +  ( `  <" S "> )
) )  <->  ( `  W
)  e.  ( ( `  W )..^ ( ( `  W )  +  ( `  <" S "> ) ) ) ) )
14133ad2ant3 1044 . . . 4  |-  ( ( W  e. Word  V  /\  S  e.  V  /\  I  =  ( `  W
) )  ->  (
I  e.  ( ( `  W )..^ ( ( `  W )  +  ( `  <" S "> ) ) )  <->  ( `  W
)  e.  ( ( `  W )..^ ( ( `  W )  +  ( `  <" S "> ) ) ) ) )
1512, 14mpbird 167 . . 3  |-  ( ( W  e. Word  V  /\  S  e.  V  /\  I  =  ( `  W
) )  ->  I  e.  ( ( `  W
)..^ ( ( `  W
)  +  ( `  <" S "> )
) ) )
16 ccatval2 11128 . . 3  |-  ( ( W  e. Word  V  /\  <" S ">  e. Word  V  /\  I  e.  ( ( `  W
)..^ ( ( `  W
)  +  ( `  <" S "> )
) ) )  -> 
( ( W ++  <" S "> ) `  I )  =  (
<" S "> `  ( I  -  ( `  W ) ) ) )
171, 3, 15, 16syl3anc 1271 . 2  |-  ( ( W  e. Word  V  /\  S  e.  V  /\  I  =  ( `  W
) )  ->  (
( W ++  <" S "> ) `  I
)  =  ( <" S "> `  ( I  -  ( `  W ) ) ) )
18 oveq1 6007 . . . . 5  |-  ( I  =  ( `  W
)  ->  ( I  -  ( `  W )
)  =  ( ( `  W )  -  ( `  W ) ) )
19183ad2ant3 1044 . . . 4  |-  ( ( W  e. Word  V  /\  S  e.  V  /\  I  =  ( `  W
) )  ->  (
I  -  ( `  W
) )  =  ( ( `  W )  -  ( `  W )
) )
204nn0cnd 9420 . . . . . 6  |-  ( W  e. Word  V  ->  ( `  W )  e.  CC )
2120subidd 8441 . . . . 5  |-  ( W  e. Word  V  ->  (
( `  W )  -  ( `  W ) )  =  0 )
22213ad2ant1 1042 . . . 4  |-  ( ( W  e. Word  V  /\  S  e.  V  /\  I  =  ( `  W
) )  ->  (
( `  W )  -  ( `  W ) )  =  0 )
2319, 22eqtrd 2262 . . 3  |-  ( ( W  e. Word  V  /\  S  e.  V  /\  I  =  ( `  W
) )  ->  (
I  -  ( `  W
) )  =  0 )
2423fveq2d 5630 . 2  |-  ( ( W  e. Word  V  /\  S  e.  V  /\  I  =  ( `  W
) )  ->  ( <" S "> `  ( I  -  ( `  W ) ) )  =  ( <" S "> `  0 )
)
25 s1fv 11154 . . 3  |-  ( S  e.  V  ->  ( <" S "> `  0 )  =  S )
26253ad2ant2 1043 . 2  |-  ( ( W  e. Word  V  /\  S  e.  V  /\  I  =  ( `  W
) )  ->  ( <" S "> `  0 )  =  S )
2717, 24, 263eqtrd 2266 1  |-  ( ( W  e. Word  V  /\  S  e.  V  /\  I  =  ( `  W
) )  ->  (
( W ++  <" S "> ) `  I
)  =  S )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    /\ w3a 1002    = wceq 1395    e. wcel 2200   ` cfv 5317  (class class class)co 6000   0cc0 7995   1c1 7996    + caddc 7998    - cmin 8313   ZZcz 9442  ..^cfzo 10334  ♯chash 10992  Word cword 11066   ++ cconcat 11120   <"cs1 11143
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-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4198  ax-sep 4201  ax-nul 4209  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-setind 4628  ax-iinf 4679  ax-cnex 8086  ax-resscn 8087  ax-1cn 8088  ax-1re 8089  ax-icn 8090  ax-addcl 8091  ax-addrcl 8092  ax-mulcl 8093  ax-addcom 8095  ax-addass 8097  ax-distr 8099  ax-i2m1 8100  ax-0lt1 8101  ax-0id 8103  ax-rnegex 8104  ax-cnre 8106  ax-pre-ltirr 8107  ax-pre-ltwlin 8108  ax-pre-lttrn 8109  ax-pre-apti 8110  ax-pre-ltadd 8111
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-if 3603  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-int 3923  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-tr 4182  df-id 4383  df-iord 4456  df-on 4458  df-ilim 4459  df-suc 4461  df-iom 4682  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-f1 5322  df-fo 5323  df-f1o 5324  df-fv 5325  df-riota 5953  df-ov 6003  df-oprab 6004  df-mpo 6005  df-1st 6284  df-2nd 6285  df-recs 6449  df-frec 6535  df-1o 6560  df-er 6678  df-en 6886  df-dom 6887  df-fin 6888  df-pnf 8179  df-mnf 8180  df-xr 8181  df-ltxr 8182  df-le 8183  df-sub 8315  df-neg 8316  df-inn 9107  df-n0 9366  df-z 9443  df-uz 9719  df-fz 10201  df-fzo 10335  df-ihash 10993  df-word 11067  df-concat 11121  df-s1 11144
This theorem is referenced by:  ccatws1ls  11168  ccatw2s1p2  11171
  Copyright terms: Public domain W3C validator