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

Theorem ccats1val2 11353
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 11334 . . . 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 11253 . . . . . . 7  |-  ( W  e. Word  V  ->  ( `  W )  e.  NN0 )
54nn0zd 9716 . . . . . 6  |-  ( W  e. Word  V  ->  ( `  W )  e.  ZZ )
6 elfzomin 10573 . . . . . 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 11337 . . . . . . . 8  |-  ( S  e.  V  ->  ( ` 
<" S "> )  =  1 )
98oveq2d 6074 . . . . . . 7  |-  ( S  e.  V  ->  (
( `  W )  +  ( `  <" S "> ) )  =  ( ( `  W
)  +  1 ) )
109oveq2d 6074 . . . . . 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 2314 . . . 4  |-  ( ( W  e. Word  V  /\  S  e.  V  /\  I  =  ( `  W
) )  ->  ( `  W )  e.  ( ( `  W )..^ ( ( `  W )  +  ( `  <" S "> ) ) ) )
13 eleq1 2297 . . . . 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 11311 . . 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 6065 . . . . 5  |-  ( I  =  ( `  W
)  ->  ( I  -  ( `  W )
)  =  ( ( `  W )  -  ( `  W ) ) )
19183ad2ant3 1047 . . . 4  |-  ( ( W  e. Word  V  /\  S  e.  V  /\  I  =  ( `  W
) )  ->  (
I  -  ( `  W
) )  =  ( ( `  W )  -  ( `  W )
) )
204nn0cnd 9572 . . . . . 6  |-  ( W  e. Word  V  ->  ( `  W )  e.  CC )
2120subidd 8588 . . . . 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 2267 . . 3  |-  ( ( W  e. Word  V  /\  S  e.  V  /\  I  =  ( `  W
) )  ->  (
I  -  ( `  W
) )  =  0 )
2423fveq2d 5679 . 2  |-  ( ( W  e. Word  V  /\  S  e.  V  /\  I  =  ( `  W
) )  ->  ( <" S "> `  ( I  -  ( `  W ) ) )  =  ( <" S "> `  0 )
)
25 s1fv 11339 . . 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 2271 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 2205   ` cfv 5357  (class class class)co 6058   0cc0 8143   1c1 8144    + caddc 8146    - cmin 8460   ZZcz 9594  ..^cfzo 10498  ♯chash 11163  Word cword 11249   ++ cconcat 11303   <"cs1 11328
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 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-addass 8245  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-0id 8251  ax-rnegex 8252  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-apti 8258  ax-pre-ltadd 8259
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 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-if 3625  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-iord 4492  df-on 4494  df-ilim 4495  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-recs 6549  df-frec 6635  df-1o 6660  df-er 6780  df-en 6989  df-dom 6990  df-fin 6991  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8462  df-neg 8463  df-inn 9255  df-n0 9514  df-z 9595  df-uz 9872  df-fz 10362  df-fzo 10499  df-ihash 11164  df-word 11250  df-concat 11304  df-s1 11329
This theorem is referenced by:  ccatws1ls  11355  ccatw2s1p1g  11358  ccatw2s1p2  11359
  Copyright terms: Public domain W3C validator