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

Theorem ccat2s1fvwd 11335
Description: Extract a symbol of a word from the concatenation of the word with two single symbols. (Contributed by AV, 22-Sep-2018.) (Revised by AV, 13-Jan-2020.) (Proof shortened by AV, 1-May-2020.) (Revised by AV, 28-Jan-2024.)
Hypotheses
Ref Expression
ccat2s1fvwd.w  |-  ( ph  ->  W  e. Word  V )
ccat2s1fvwd.i  |-  ( ph  ->  I  e.  NN0 )
ccat2s1fvwd.1  |-  ( ph  ->  I  <  ( `  W
) )
ccat2s1fvwd.x  |-  ( ph  ->  X  e.  A )
ccat2s1fvwd.y  |-  ( ph  ->  Y  e.  B )
Assertion
Ref Expression
ccat2s1fvwd  |-  ( ph  ->  ( ( ( W ++ 
<" X "> ) ++  <" Y "> ) `  I )  =  ( W `  I ) )

Proof of Theorem ccat2s1fvwd
StepHypRef Expression
1 ccat2s1fvwd.w . . . . 5  |-  ( ph  ->  W  e. Word  V )
2 wrdv 11240 . . . . 5  |-  ( W  e. Word  V  ->  W  e. Word  _V )
31, 2syl 14 . . . 4  |-  ( ph  ->  W  e. Word  _V )
4 ccat2s1fvwd.x . . . . . 6  |-  ( ph  ->  X  e.  A )
54elexd 2827 . . . . 5  |-  ( ph  ->  X  e.  _V )
65s1cld 11310 . . . 4  |-  ( ph  ->  <" X ">  e. Word  _V )
7 ccat2s1fvwd.y . . . . . 6  |-  ( ph  ->  Y  e.  B )
87elexd 2827 . . . . 5  |-  ( ph  ->  Y  e.  _V )
98s1cld 11310 . . . 4  |-  ( ph  ->  <" Y ">  e. Word  _V )
10 ccatass 11296 . . . 4  |-  ( ( W  e. Word  _V  /\  <" X ">  e. Word  _V  /\  <" Y ">  e. Word  _V )  ->  ( ( W ++  <" X "> ) ++  <" Y "> )  =  ( W ++  ( <" X "> ++  <" Y "> ) ) )
113, 6, 9, 10syl3anc 1274 . . 3  |-  ( ph  ->  ( ( W ++  <" X "> ) ++  <" Y "> )  =  ( W ++  ( <" X "> ++  <" Y "> ) ) )
1211fveq1d 5672 . 2  |-  ( ph  ->  ( ( ( W ++ 
<" X "> ) ++  <" Y "> ) `  I )  =  ( ( W ++  ( <" X "> ++  <" Y "> ) ) `  I
) )
13 ccatws1cl 11320 . . . 4  |-  ( (
<" X ">  e. Word  _V  /\  Y  e. 
_V )  ->  ( <" X "> ++  <" Y "> )  e. Word  _V )
146, 8, 13syl2anc 411 . . 3  |-  ( ph  ->  ( <" X "> ++  <" Y "> )  e. Word  _V )
15 ccat2s1fvwd.i . . . 4  |-  ( ph  ->  I  e.  NN0 )
16 ccat2s1fvwd.1 . . . 4  |-  ( ph  ->  I  <  ( `  W
) )
17 simp2 1025 . . . . 5  |-  ( ( W  e. Word  V  /\  I  e.  NN0  /\  I  <  ( `  W )
)  ->  I  e.  NN0 )
18 lencl 11228 . . . . . . 7  |-  ( W  e. Word  V  ->  ( `  W )  e.  NN0 )
19183ad2ant1 1045 . . . . . 6  |-  ( ( W  e. Word  V  /\  I  e.  NN0  /\  I  <  ( `  W )
)  ->  ( `  W
)  e.  NN0 )
20 nn0ge0 9521 . . . . . . . . 9  |-  ( I  e.  NN0  ->  0  <_  I )
2120adantl 277 . . . . . . . 8  |-  ( ( W  e. Word  V  /\  I  e.  NN0 )  -> 
0  <_  I )
22 0red 8275 . . . . . . . . 9  |-  ( ( W  e. Word  V  /\  I  e.  NN0 )  -> 
0  e.  RR )
23 nn0re 9505 . . . . . . . . . 10  |-  ( I  e.  NN0  ->  I  e.  RR )
2423adantl 277 . . . . . . . . 9  |-  ( ( W  e. Word  V  /\  I  e.  NN0 )  ->  I  e.  RR )
2518nn0red 9554 . . . . . . . . . 10  |-  ( W  e. Word  V  ->  ( `  W )  e.  RR )
2625adantr 276 . . . . . . . . 9  |-  ( ( W  e. Word  V  /\  I  e.  NN0 )  -> 
( `  W )  e.  RR )
27 lelttr 8362 . . . . . . . . 9  |-  ( ( 0  e.  RR  /\  I  e.  RR  /\  ( `  W )  e.  RR )  ->  ( ( 0  <_  I  /\  I  <  ( `  W )
)  ->  0  <  ( `  W ) ) )
2822, 24, 26, 27syl3anc 1274 . . . . . . . 8  |-  ( ( W  e. Word  V  /\  I  e.  NN0 )  -> 
( ( 0  <_  I  /\  I  <  ( `  W ) )  -> 
0  <  ( `  W
) ) )
2921, 28mpand 429 . . . . . . 7  |-  ( ( W  e. Word  V  /\  I  e.  NN0 )  -> 
( I  <  ( `  W )  ->  0  <  ( `  W )
) )
30293impia 1227 . . . . . 6  |-  ( ( W  e. Word  V  /\  I  e.  NN0  /\  I  <  ( `  W )
)  ->  0  <  ( `  W ) )
31 elnnnn0b 9540 . . . . . 6  |-  ( ( `  W )  e.  NN  <->  ( ( `  W )  e.  NN0  /\  0  < 
( `  W ) ) )
3219, 30, 31sylanbrc 417 . . . . 5  |-  ( ( W  e. Word  V  /\  I  e.  NN0  /\  I  <  ( `  W )
)  ->  ( `  W
)  e.  NN )
33 simp3 1026 . . . . 5  |-  ( ( W  e. Word  V  /\  I  e.  NN0  /\  I  <  ( `  W )
)  ->  I  <  ( `  W ) )
34 elfzo0 10520 . . . . 5  |-  ( I  e.  ( 0..^ ( `  W ) )  <->  ( I  e.  NN0  /\  ( `  W
)  e.  NN  /\  I  <  ( `  W )
) )
3517, 32, 33, 34syl3anbrc 1208 . . . 4  |-  ( ( W  e. Word  V  /\  I  e.  NN0  /\  I  <  ( `  W )
)  ->  I  e.  ( 0..^ ( `  W
) ) )
361, 15, 16, 35syl3anc 1274 . . 3  |-  ( ph  ->  I  e.  ( 0..^ ( `  W )
) )
37 ccatval1 11285 . . 3  |-  ( ( W  e. Word  V  /\  ( <" X "> ++  <" Y "> )  e. Word  _V  /\  I  e.  ( 0..^ ( `  W )
) )  ->  (
( W ++  ( <" X "> ++  <" Y "> ) ) `  I
)  =  ( W `
 I ) )
381, 14, 36, 37syl3anc 1274 . 2  |-  ( ph  ->  ( ( W ++  ( <" X "> ++  <" Y "> ) ) `  I
)  =  ( W `
 I ) )
3912, 38eqtrd 2265 1  |-  ( ph  ->  ( ( ( W ++ 
<" X "> ) ++  <" Y "> ) `  I )  =  ( W `  I ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1005    = wceq 1398    e. wcel 2203   _Vcvv 2813   class class class wbr 4109   ` cfv 5352  (class class class)co 6050   RRcr 8126   0cc0 8127    < clt 8308    <_ cle 8309   NNcn 9237   NN0cn0 9496  ..^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:  ccat2s1fstg  11336  clwwlknonex2lem2  16433
  Copyright terms: Public domain W3C validator