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

Theorem ccats1val2 11328
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 1024 . . 3  |-  ( ( W  e. Word  V  /\  S  e.  V  /\  I  =  ( `  W
) )  ->  W  e. Word  V )
2 s1cl 11309 . . . 4  |-  ( S  e.  V  ->  <" S ">  e. Word  V )
323ad2ant2 1046 . . 3  |-  ( ( W  e. Word  V  /\  S  e.  V  /\  I  =  ( `  W
) )  ->  <" S ">  e. Word  V )
4 lencl 11228 . . . . . . 7  |-  ( W  e. Word  V  ->  ( `  W )  e.  NN0 )
54nn0zd 9698 . . . . . 6  |-  ( W  e. Word  V  ->  ( `  W )  e.  ZZ )
6 elfzomin 10551 . . . . . 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 11312 . . . . . . . 8  |-  ( S  e.  V  ->  ( ` 
<" S "> )  =  1 )
98oveq2d 6066 . . . . . . 7  |-  ( S  e.  V  ->  (
( `  W )  +  ( `  <" S "> ) )  =  ( ( `  W
)  +  1 ) )
109oveq2d 6066 . . . . . 6  |-  ( S  e.  V  ->  (
( `  W )..^ ( ( `  W )  +  ( `  <" S "> ) ) )  =  ( ( `  W
)..^ ( ( `  W
)  +  1 ) ) )
11103ad2ant2 1046 . . . . 5  |-  ( ( W  e. Word  V  /\  S  e.  V  /\  I  =  ( `  W
) )  ->  (
( `  W )..^ ( ( `  W )  +  ( `  <" S "> ) ) )  =  ( ( `  W
)..^ ( ( `  W
)  +  1 ) ) )
127, 11eleqtrrd 2312 . . . 4  |-  ( ( W  e. Word  V  /\  S  e.  V  /\  I  =  ( `  W
) )  ->  ( `  W )  e.  ( ( `  W )..^ ( ( `  W )  +  ( `  <" S "> ) ) ) )
13 eleq1 2295 . . . . 5  |-  ( I  =  ( `  W
)  ->  ( I  e.  ( ( `  W
)..^ ( ( `  W
)  +  ( `  <" S "> )
) )  <->  ( `  W
)  e.  ( ( `  W )..^ ( ( `  W )  +  ( `  <" S "> ) ) ) ) )
14133ad2ant3 1047 . . . 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 11286 . . 3  |-  ( ( W  e. Word  V  /\  <" S ">  e. Word  V  /\  I  e.  ( ( `  W
)..^ ( ( `  W
)  +  ( `  <" S "> )
) ) )  -> 
( ( W ++  <" S "> ) `  I )  =  (
<" S "> `  ( I  -  ( `  W ) ) ) )
171, 3, 15, 16syl3anc 1274 . 2  |-  ( ( W  e. Word  V  /\  S  e.  V  /\  I  =  ( `  W
) )  ->  (
( W ++  <" S "> ) `  I
)  =  ( <" S "> `  ( I  -  ( `  W ) ) ) )
18 oveq1 6057 . . . . 5  |-  ( I  =  ( `  W
)  ->  ( I  -  ( `  W )
)  =  ( ( `  W )  -  ( `  W ) ) )
19183ad2ant3 1047 . . . 4  |-  ( ( W  e. Word  V  /\  S  e.  V  /\  I  =  ( `  W
) )  ->  (
I  -  ( `  W
) )  =  ( ( `  W )  -  ( `  W )
) )
204nn0cnd 9555 . . . . . 6  |-  ( W  e. Word  V  ->  ( `  W )  e.  CC )
2120subidd 8572 . . . . 5  |-  ( W  e. Word  V  ->  (
( `  W )  -  ( `  W ) )  =  0 )
22213ad2ant1 1045 . . . 4  |-  ( ( W  e. Word  V  /\  S  e.  V  /\  I  =  ( `  W
) )  ->  (
( `  W )  -  ( `  W ) )  =  0 )
2319, 22eqtrd 2265 . . 3  |-  ( ( W  e. Word  V  /\  S  e.  V  /\  I  =  ( `  W
) )  ->  (
I  -  ( `  W
) )  =  0 )
2423fveq2d 5674 . 2  |-  ( ( W  e. Word  V  /\  S  e.  V  /\  I  =  ( `  W
) )  ->  ( <" S "> `  ( I  -  ( `  W ) ) )  =  ( <" S "> `  0 )
)
25 s1fv 11314 . . 3  |-  ( S  e.  V  ->  ( <" S "> `  0 )  =  S )
26253ad2ant2 1046 . 2  |-  ( ( W  e. Word  V  /\  S  e.  V  /\  I  =  ( `  W
) )  ->  ( <" S "> `  0 )  =  S )
2717, 24, 263eqtrd 2269 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 1005    = wceq 1398    e. wcel 2203   ` cfv 5352  (class class class)co 6050   0cc0 8127   1c1 8128    + caddc 8130    - cmin 8444   ZZcz 9577  ..^cfzo 10476  ♯chash 11138  Word cword 11224   ++ cconcat 11278   <"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-in1 619  ax-in2 620  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-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-nul 4236  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-iinf 4710  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-addcom 8227  ax-addass 8229  ax-distr 8231  ax-i2m1 8232  ax-0lt1 8233  ax-0id 8235  ax-rnegex 8236  ax-cnre 8238  ax-pre-ltirr 8239  ax-pre-ltwlin 8240  ax-pre-lttrn 8241  ax-pre-apti 8242  ax-pre-ltadd 8243
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  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-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-if 3621  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-tr 4209  df-id 4414  df-iord 4487  df-on 4489  df-ilim 4490  df-suc 4492  df-iom 4713  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-1st 6334  df-2nd 6335  df-recs 6536  df-frec 6622  df-1o 6647  df-er 6767  df-en 6976  df-dom 6977  df-fin 6978  df-pnf 8310  df-mnf 8311  df-xr 8312  df-ltxr 8313  df-le 8314  df-sub 8446  df-neg 8447  df-inn 9238  df-n0 9497  df-z 9578  df-uz 9854  df-fz 10343  df-fzo 10477  df-ihash 11139  df-word 11225  df-concat 11279  df-s1 11304
This theorem is referenced by:  ccatws1ls  11330  ccatw2s1p1g  11333  ccatw2s1p2  11334
  Copyright terms: Public domain W3C validator