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

Theorem lswccatn0lsw 11192
Description: The last symbol of a word concatenated with a nonempty word is the last symbol of the nonempty word. (Contributed by AV, 22-Oct-2018.) (Proof shortened by AV, 1-May-2020.)
Assertion
Ref Expression
lswccatn0lsw  |-  ( ( A  e. Word  V  /\  B  e. Word  V  /\  B  =/=  (/) )  ->  (lastS `  ( A ++  B ) )  =  (lastS `  B ) )

Proof of Theorem lswccatn0lsw
StepHypRef Expression
1 ccatlen 11176 . . . . . . 7  |-  ( ( A  e. Word  V  /\  B  e. Word  V )  ->  ( `  ( A ++  B ) )  =  ( ( `  A
)  +  ( `  B
) ) )
21oveq1d 6033 . . . . . 6  |-  ( ( A  e. Word  V  /\  B  e. Word  V )  ->  ( ( `  ( A ++  B ) )  - 
1 )  =  ( ( ( `  A
)  +  ( `  B
) )  -  1 ) )
323adant3 1043 . . . . 5  |-  ( ( A  e. Word  V  /\  B  e. Word  V  /\  B  =/=  (/) )  ->  (
( `  ( A ++  B
) )  -  1 )  =  ( ( ( `  A )  +  ( `  B )
)  -  1 ) )
4 lencl 11121 . . . . . . . . . 10  |-  ( A  e. Word  V  ->  ( `  A )  e.  NN0 )
54nn0zd 9600 . . . . . . . . 9  |-  ( A  e. Word  V  ->  ( `  A )  e.  ZZ )
6 lennncl 11137 . . . . . . . . 9  |-  ( ( B  e. Word  V  /\  B  =/=  (/) )  ->  ( `  B )  e.  NN )
7 simpl 109 . . . . . . . . . 10  |-  ( ( ( `  A )  e.  ZZ  /\  ( `  B
)  e.  NN )  ->  ( `  A )  e.  ZZ )
8 zaddcllempos 9516 . . . . . . . . . 10  |-  ( ( ( `  A )  e.  ZZ  /\  ( `  B
)  e.  NN )  ->  ( ( `  A
)  +  ( `  B
) )  e.  ZZ )
9 zre 9483 . . . . . . . . . . 11  |-  ( ( `  A )  e.  ZZ  ->  ( `  A )  e.  RR )
10 nnrp 9898 . . . . . . . . . . 11  |-  ( ( `  B )  e.  NN  ->  ( `  B )  e.  RR+ )
11 ltaddrp 9926 . . . . . . . . . . 11  |-  ( ( ( `  A )  e.  RR  /\  ( `  B
)  e.  RR+ )  ->  ( `  A )  <  ( ( `  A
)  +  ( `  B
) ) )
129, 10, 11syl2an 289 . . . . . . . . . 10  |-  ( ( ( `  A )  e.  ZZ  /\  ( `  B
)  e.  NN )  ->  ( `  A )  <  ( ( `  A
)  +  ( `  B
) ) )
137, 8, 123jca 1203 . . . . . . . . 9  |-  ( ( ( `  A )  e.  ZZ  /\  ( `  B
)  e.  NN )  ->  ( ( `  A
)  e.  ZZ  /\  ( ( `  A )  +  ( `  B )
)  e.  ZZ  /\  ( `  A )  < 
( ( `  A
)  +  ( `  B
) ) ) )
145, 6, 13syl2an 289 . . . . . . . 8  |-  ( ( A  e. Word  V  /\  ( B  e. Word  V  /\  B  =/=  (/) ) )  -> 
( ( `  A
)  e.  ZZ  /\  ( ( `  A )  +  ( `  B )
)  e.  ZZ  /\  ( `  A )  < 
( ( `  A
)  +  ( `  B
) ) ) )
15143impb 1225 . . . . . . 7  |-  ( ( A  e. Word  V  /\  B  e. Word  V  /\  B  =/=  (/) )  ->  (
( `  A )  e.  ZZ  /\  ( ( `  A )  +  ( `  B ) )  e.  ZZ  /\  ( `  A
)  <  ( ( `  A )  +  ( `  B ) ) ) )
16 fzolb 10389 . . . . . . 7  |-  ( ( `  A )  e.  ( ( `  A )..^ ( ( `  A )  +  ( `  B )
) )  <->  ( ( `  A )  e.  ZZ  /\  ( ( `  A
)  +  ( `  B
) )  e.  ZZ  /\  ( `  A )  <  ( ( `  A
)  +  ( `  B
) ) ) )
1715, 16sylibr 134 . . . . . 6  |-  ( ( A  e. Word  V  /\  B  e. Word  V  /\  B  =/=  (/) )  ->  ( `  A )  e.  ( ( `  A )..^ ( ( `  A )  +  ( `  B )
) ) )
18 fzoend 10468 . . . . . 6  |-  ( ( `  A )  e.  ( ( `  A )..^ ( ( `  A )  +  ( `  B )
) )  ->  (
( ( `  A
)  +  ( `  B
) )  -  1 )  e.  ( ( `  A )..^ ( ( `  A )  +  ( `  B ) ) ) )
1917, 18syl 14 . . . . 5  |-  ( ( A  e. Word  V  /\  B  e. Word  V  /\  B  =/=  (/) )  ->  (
( ( `  A
)  +  ( `  B
) )  -  1 )  e.  ( ( `  A )..^ ( ( `  A )  +  ( `  B ) ) ) )
203, 19eqeltrd 2308 . . . 4  |-  ( ( A  e. Word  V  /\  B  e. Word  V  /\  B  =/=  (/) )  ->  (
( `  ( A ++  B
) )  -  1 )  e.  ( ( `  A )..^ ( ( `  A )  +  ( `  B ) ) ) )
21 ccatval2 11179 . . . 4  |-  ( ( A  e. Word  V  /\  B  e. Word  V  /\  (
( `  ( A ++  B
) )  -  1 )  e.  ( ( `  A )..^ ( ( `  A )  +  ( `  B ) ) ) )  ->  ( ( A ++  B ) `  (
( `  ( A ++  B
) )  -  1 ) )  =  ( B `  ( ( ( `  ( A ++  B ) )  - 
1 )  -  ( `  A ) ) ) )
2220, 21syld3an3 1318 . . 3  |-  ( ( A  e. Word  V  /\  B  e. Word  V  /\  B  =/=  (/) )  ->  (
( A ++  B ) `
 ( ( `  ( A ++  B ) )  - 
1 ) )  =  ( B `  (
( ( `  ( A ++  B ) )  - 
1 )  -  ( `  A ) ) ) )
232oveq1d 6033 . . . . . 6  |-  ( ( A  e. Word  V  /\  B  e. Word  V )  ->  ( ( ( `  ( A ++  B ) )  - 
1 )  -  ( `  A ) )  =  ( ( ( ( `  A )  +  ( `  B ) )  - 
1 )  -  ( `  A ) ) )
244nn0cnd 9457 . . . . . . 7  |-  ( A  e. Word  V  ->  ( `  A )  e.  CC )
25 lencl 11121 . . . . . . . 8  |-  ( B  e. Word  V  ->  ( `  B )  e.  NN0 )
2625nn0cnd 9457 . . . . . . 7  |-  ( B  e. Word  V  ->  ( `  B )  e.  CC )
27 addcl 8157 . . . . . . . . 9  |-  ( ( ( `  A )  e.  CC  /\  ( `  B
)  e.  CC )  ->  ( ( `  A
)  +  ( `  B
) )  e.  CC )
28 1cnd 8195 . . . . . . . . 9  |-  ( ( ( `  A )  e.  CC  /\  ( `  B
)  e.  CC )  ->  1  e.  CC )
29 simpl 109 . . . . . . . . 9  |-  ( ( ( `  A )  e.  CC  /\  ( `  B
)  e.  CC )  ->  ( `  A )  e.  CC )
3027, 28, 29sub32d 8522 . . . . . . . 8  |-  ( ( ( `  A )  e.  CC  /\  ( `  B
)  e.  CC )  ->  ( ( ( ( `  A )  +  ( `  B )
)  -  1 )  -  ( `  A
) )  =  ( ( ( ( `  A
)  +  ( `  B
) )  -  ( `  A ) )  - 
1 ) )
31 pncan2 8386 . . . . . . . . 9  |-  ( ( ( `  A )  e.  CC  /\  ( `  B
)  e.  CC )  ->  ( ( ( `  A )  +  ( `  B ) )  -  ( `  A ) )  =  ( `  B
) )
3231oveq1d 6033 . . . . . . . 8  |-  ( ( ( `  A )  e.  CC  /\  ( `  B
)  e.  CC )  ->  ( ( ( ( `  A )  +  ( `  B )
)  -  ( `  A
) )  -  1 )  =  ( ( `  B )  -  1 ) )
3330, 32eqtrd 2264 . . . . . . 7  |-  ( ( ( `  A )  e.  CC  /\  ( `  B
)  e.  CC )  ->  ( ( ( ( `  A )  +  ( `  B )
)  -  1 )  -  ( `  A
) )  =  ( ( `  B )  -  1 ) )
3424, 26, 33syl2an 289 . . . . . 6  |-  ( ( A  e. Word  V  /\  B  e. Word  V )  ->  ( ( ( ( `  A )  +  ( `  B ) )  - 
1 )  -  ( `  A ) )  =  ( ( `  B
)  -  1 ) )
3523, 34eqtrd 2264 . . . . 5  |-  ( ( A  e. Word  V  /\  B  e. Word  V )  ->  ( ( ( `  ( A ++  B ) )  - 
1 )  -  ( `  A ) )  =  ( ( `  B
)  -  1 ) )
36353adant3 1043 . . . 4  |-  ( ( A  e. Word  V  /\  B  e. Word  V  /\  B  =/=  (/) )  ->  (
( ( `  ( A ++  B ) )  - 
1 )  -  ( `  A ) )  =  ( ( `  B
)  -  1 ) )
3736fveq2d 5643 . . 3  |-  ( ( A  e. Word  V  /\  B  e. Word  V  /\  B  =/=  (/) )  ->  ( B `  ( (
( `  ( A ++  B
) )  -  1 )  -  ( `  A
) ) )  =  ( B `  (
( `  B )  - 
1 ) ) )
3822, 37eqtrd 2264 . 2  |-  ( ( A  e. Word  V  /\  B  e. Word  V  /\  B  =/=  (/) )  ->  (
( A ++  B ) `
 ( ( `  ( A ++  B ) )  - 
1 ) )  =  ( B `  (
( `  B )  - 
1 ) ) )
39 ccatcl 11174 . . . 4  |-  ( ( A  e. Word  V  /\  B  e. Word  V )  ->  ( A ++  B )  e. Word  V )
40393adant3 1043 . . 3  |-  ( ( A  e. Word  V  /\  B  e. Word  V  /\  B  =/=  (/) )  ->  ( A ++  B )  e. Word  V
)
41 lswwrd 11164 . . 3  |-  ( ( A ++  B )  e. Word  V  ->  (lastS `  ( A ++  B ) )  =  ( ( A ++  B
) `  ( ( `  ( A ++  B ) )  -  1 ) ) )
4240, 41syl 14 . 2  |-  ( ( A  e. Word  V  /\  B  e. Word  V  /\  B  =/=  (/) )  ->  (lastS `  ( A ++  B ) )  =  ( ( A ++  B ) `  ( ( `  ( A ++  B ) )  - 
1 ) ) )
43 lswwrd 11164 . . 3  |-  ( B  e. Word  V  ->  (lastS `  B )  =  ( B `  ( ( `  B )  -  1 ) ) )
44433ad2ant2 1045 . 2  |-  ( ( A  e. Word  V  /\  B  e. Word  V  /\  B  =/=  (/) )  ->  (lastS `  B )  =  ( B `  ( ( `  B )  -  1 ) ) )
4538, 42, 443eqtr4d 2274 1  |-  ( ( A  e. Word  V  /\  B  e. Word  V  /\  B  =/=  (/) )  ->  (lastS `  ( A ++  B ) )  =  (lastS `  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1004    = wceq 1397    e. wcel 2202    =/= wne 2402   (/)c0 3494   class class class wbr 4088   ` cfv 5326  (class class class)co 6018   CCcc 8030   RRcr 8031   1c1 8033    + caddc 8035    < clt 8214    - cmin 8350   NNcn 9143   ZZcz 9479   RR+crp 9888  ..^cfzo 10377  ♯chash 11038  Word cword 11117  lastSclsw 11162   ++ cconcat 11171
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-addcom 8132  ax-addass 8134  ax-distr 8136  ax-i2m1 8137  ax-0lt1 8138  ax-0id 8140  ax-rnegex 8141  ax-cnre 8143  ax-pre-ltirr 8144  ax-pre-ltwlin 8145  ax-pre-lttrn 8146  ax-pre-apti 8147  ax-pre-ltadd 8148
This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-if 3606  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-iord 4463  df-on 4465  df-ilim 4466  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-1st 6303  df-2nd 6304  df-recs 6471  df-frec 6557  df-1o 6582  df-er 6702  df-en 6910  df-dom 6911  df-fin 6912  df-pnf 8216  df-mnf 8217  df-xr 8218  df-ltxr 8219  df-le 8220  df-sub 8352  df-neg 8353  df-inn 9144  df-n0 9403  df-z 9480  df-uz 9756  df-rp 9889  df-fz 10244  df-fzo 10378  df-ihash 11039  df-word 11118  df-lsw 11163  df-concat 11172
This theorem is referenced by:  clwwlkccat  16258
  Copyright terms: Public domain W3C validator