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

Theorem ccat2s1fvwd 11273
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 11178 . . . . 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 2817 . . . . 5  |-  ( ph  ->  X  e.  _V )
65s1cld 11248 . . . 4  |-  ( ph  ->  <" X ">  e. Word  _V )
7 ccat2s1fvwd.y . . . . . 6  |-  ( ph  ->  Y  e.  B )
87elexd 2817 . . . . 5  |-  ( ph  ->  Y  e.  _V )
98s1cld 11248 . . . 4  |-  ( ph  ->  <" Y ">  e. Word  _V )
10 ccatass 11234 . . . 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 5650 . 2  |-  ( ph  ->  ( ( ( W ++ 
<" X "> ) ++  <" Y "> ) `  I )  =  ( ( W ++  ( <" X "> ++  <" Y "> ) ) `  I
) )
13 ccatws1cl 11258 . . . 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 11166 . . . . . . 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 9469 . . . . . . . . 9  |-  ( I  e.  NN0  ->  0  <_  I )
2120adantl 277 . . . . . . . 8  |-  ( ( W  e. Word  V  /\  I  e.  NN0 )  -> 
0  <_  I )
22 0red 8223 . . . . . . . . 9  |-  ( ( W  e. Word  V  /\  I  e.  NN0 )  -> 
0  e.  RR )
23 nn0re 9453 . . . . . . . . . 10  |-  ( I  e.  NN0  ->  I  e.  RR )
2423adantl 277 . . . . . . . . 9  |-  ( ( W  e. Word  V  /\  I  e.  NN0 )  ->  I  e.  RR )
2518nn0red 9500 . . . . . . . . . 10  |-  ( W  e. Word  V  ->  ( `  W )  e.  RR )
2625adantr 276 . . . . . . . . 9  |-  ( ( W  e. Word  V  /\  I  e.  NN0 )  -> 
( `  W )  e.  RR )
27 lelttr 8310 . . . . . . . . 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 9488 . . . . . 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 10466 . . . . 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 11223 . . 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 2264 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 2202   _Vcvv 2803   class class class wbr 4093   ` cfv 5333  (class class class)co 6028   RRcr 8074   0cc0 8075    < clt 8256    <_ cle 8257   NNcn 9185   NN0cn0 9444  ..^cfzo 10422  ♯chash 11083  Word cword 11162   ++ cconcat 11216   <"cs1 11241
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 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692  ax-cnex 8166  ax-resscn 8167  ax-1cn 8168  ax-1re 8169  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-addcom 8175  ax-addass 8177  ax-distr 8179  ax-i2m1 8180  ax-0lt1 8181  ax-0id 8183  ax-rnegex 8184  ax-cnre 8186  ax-pre-ltirr 8187  ax-pre-ltwlin 8188  ax-pre-lttrn 8189  ax-pre-apti 8190  ax-pre-ltadd 8191
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 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-if 3608  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-iord 4469  df-on 4471  df-ilim 4472  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-recs 6514  df-frec 6600  df-1o 6625  df-er 6745  df-en 6953  df-dom 6954  df-fin 6955  df-pnf 8258  df-mnf 8259  df-xr 8260  df-ltxr 8261  df-le 8262  df-sub 8394  df-neg 8395  df-inn 9186  df-n0 9445  df-z 9524  df-uz 9800  df-fz 10289  df-fzo 10423  df-ihash 11084  df-word 11163  df-concat 11217  df-s1 11242
This theorem is referenced by:  ccat2s1fstg  11274  clwwlknonex2lem2  16362
  Copyright terms: Public domain W3C validator