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

Theorem ccatval2 11366
Description: Value of a symbol in the right half of a concatenated word. (Contributed by Stefan O'Rear, 15-Aug-2015.) (Revised by Mario Carneiro, 22-Sep-2015.)
Assertion
Ref Expression
ccatval2  |-  ( ( S  e. Word  B  /\  T  e. Word  B  /\  I  e.  ( ( `  S
)..^ ( ( `  S
)  +  ( `  T
) ) ) )  ->  ( ( S ++  T ) `  I
)  =  ( T `
 ( I  -  ( `  S ) ) ) )

Proof of Theorem ccatval2
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 wrdfin 11323 . . . 4  |-  ( S  e. Word  B  ->  S  e.  Fin )
2 wrdfin 11323 . . . 4  |-  ( T  e. Word  B  ->  T  e.  Fin )
3 ccatfvalfi 11360 . . . 4  |-  ( ( S  e.  Fin  /\  T  e.  Fin )  ->  ( S ++  T )  =  ( x  e.  ( 0..^ ( ( `  S )  +  ( `  T ) ) ) 
|->  if ( x  e.  ( 0..^ ( `  S
) ) ,  ( S `  x ) ,  ( T `  ( x  -  ( `  S ) ) ) ) ) )
41, 2, 3syl2an 289 . . 3  |-  ( ( S  e. Word  B  /\  T  e. Word  B )  ->  ( S ++  T )  =  ( x  e.  ( 0..^ ( ( `  S )  +  ( `  T ) ) ) 
|->  if ( x  e.  ( 0..^ ( `  S
) ) ,  ( S `  x ) ,  ( T `  ( x  -  ( `  S ) ) ) ) ) )
543adant3 1048 . 2  |-  ( ( S  e. Word  B  /\  T  e. Word  B  /\  I  e.  ( ( `  S
)..^ ( ( `  S
)  +  ( `  T
) ) ) )  ->  ( S ++  T
)  =  ( x  e.  ( 0..^ ( ( `  S )  +  ( `  T )
) )  |->  if ( x  e.  ( 0..^ ( `  S )
) ,  ( S `
 x ) ,  ( T `  (
x  -  ( `  S
) ) ) ) ) )
6 eleq1 2301 . . . 4  |-  ( x  =  I  ->  (
x  e.  ( 0..^ ( `  S )
)  <->  I  e.  (
0..^ ( `  S )
) ) )
7 fveq2 5695 . . . 4  |-  ( x  =  I  ->  ( S `  x )  =  ( S `  I ) )
8 fvoveq1 6108 . . . 4  |-  ( x  =  I  ->  ( T `  ( x  -  ( `  S )
) )  =  ( T `  ( I  -  ( `  S
) ) ) )
96, 7, 8ifbieq12d 3667 . . 3  |-  ( x  =  I  ->  if ( x  e.  (
0..^ ( `  S )
) ,  ( S `
 x ) ,  ( T `  (
x  -  ( `  S
) ) ) )  =  if ( I  e.  ( 0..^ ( `  S ) ) ,  ( S `  I
) ,  ( T `
 ( I  -  ( `  S ) ) ) ) )
10 fzodisj 10587 . . . . . 6  |-  ( ( 0..^ ( `  S
) )  i^i  (
( `  S )..^ ( ( `  S )  +  ( `  T )
) ) )  =  (/)
11 minel 3586 . . . . . 6  |-  ( ( I  e.  ( ( `  S )..^ ( ( `  S )  +  ( `  T ) ) )  /\  ( ( 0..^ ( `  S )
)  i^i  ( ( `  S )..^ ( ( `  S )  +  ( `  T ) ) ) )  =  (/) )  ->  -.  I  e.  (
0..^ ( `  S )
) )
1210, 11mpan2 429 . . . . 5  |-  ( I  e.  ( ( `  S
)..^ ( ( `  S
)  +  ( `  T
) ) )  ->  -.  I  e.  (
0..^ ( `  S )
) )
13123ad2ant3 1051 . . . 4  |-  ( ( S  e. Word  B  /\  T  e. Word  B  /\  I  e.  ( ( `  S
)..^ ( ( `  S
)  +  ( `  T
) ) ) )  ->  -.  I  e.  ( 0..^ ( `  S
) ) )
1413iffalsed 3650 . . 3  |-  ( ( S  e. Word  B  /\  T  e. Word  B  /\  I  e.  ( ( `  S
)..^ ( ( `  S
)  +  ( `  T
) ) ) )  ->  if ( I  e.  ( 0..^ ( `  S ) ) ,  ( S `  I
) ,  ( T `
 ( I  -  ( `  S ) ) ) )  =  ( T `  ( I  -  ( `  S
) ) ) )
159, 14sylan9eqr 2293 . 2  |-  ( ( ( S  e. Word  B  /\  T  e. Word  B  /\  I  e.  ( ( `  S )..^ ( ( `  S )  +  ( `  T ) ) ) )  /\  x  =  I )  ->  if ( x  e.  (
0..^ ( `  S )
) ,  ( S `
 x ) ,  ( T `  (
x  -  ( `  S
) ) ) )  =  ( T `  ( I  -  ( `  S ) ) ) )
161adantr 276 . . . . 5  |-  ( ( S  e. Word  B  /\  T  e. Word  B )  ->  S  e.  Fin )
17 hashcl 11220 . . . . 5  |-  ( S  e.  Fin  ->  ( `  S )  e.  NN0 )
18 fzoss1 10580 . . . . . 6  |-  ( ( `  S )  e.  (
ZZ>= `  0 )  -> 
( ( `  S
)..^ ( ( `  S
)  +  ( `  T
) ) )  C_  ( 0..^ ( ( `  S
)  +  ( `  T
) ) ) )
19 nn0uz 9957 . . . . . 6  |-  NN0  =  ( ZZ>= `  0 )
2018, 19eleq2s 2333 . . . . 5  |-  ( ( `  S )  e.  NN0  ->  ( ( `  S
)..^ ( ( `  S
)  +  ( `  T
) ) )  C_  ( 0..^ ( ( `  S
)  +  ( `  T
) ) ) )
2116, 17, 203syl 17 . . . 4  |-  ( ( S  e. Word  B  /\  T  e. Word  B )  ->  ( ( `  S
)..^ ( ( `  S
)  +  ( `  T
) ) )  C_  ( 0..^ ( ( `  S
)  +  ( `  T
) ) ) )
2221sseld 3247 . . 3  |-  ( ( S  e. Word  B  /\  T  e. Word  B )  ->  ( I  e.  ( ( `  S )..^ ( ( `  S )  +  ( `  T )
) )  ->  I  e.  ( 0..^ ( ( `  S )  +  ( `  T ) ) ) ) )
23223impia 1231 . 2  |-  ( ( S  e. Word  B  /\  T  e. Word  B  /\  I  e.  ( ( `  S
)..^ ( ( `  S
)  +  ( `  T
) ) ) )  ->  I  e.  ( 0..^ ( ( `  S
)  +  ( `  T
) ) ) )
24 simp2 1029 . . 3  |-  ( ( S  e. Word  B  /\  T  e. Word  B  /\  I  e.  ( ( `  S
)..^ ( ( `  S
)  +  ( `  T
) ) ) )  ->  T  e. Word  B
)
25 elfzoelz 10554 . . . . 5  |-  ( I  e.  ( ( `  S
)..^ ( ( `  S
)  +  ( `  T
) ) )  ->  I  e.  ZZ )
26253ad2ant3 1051 . . . 4  |-  ( ( S  e. Word  B  /\  T  e. Word  B  /\  I  e.  ( ( `  S
)..^ ( ( `  S
)  +  ( `  T
) ) ) )  ->  I  e.  ZZ )
27 lencl 11308 . . . . . 6  |-  ( S  e. Word  B  ->  ( `  S )  e.  NN0 )
2827nn0zd 9766 . . . . 5  |-  ( S  e. Word  B  ->  ( `  S )  e.  ZZ )
29283ad2ant1 1049 . . . 4  |-  ( ( S  e. Word  B  /\  T  e. Word  B  /\  I  e.  ( ( `  S
)..^ ( ( `  S
)  +  ( `  T
) ) ) )  ->  ( `  S )  e.  ZZ )
3026, 29zsubcld 9773 . . 3  |-  ( ( S  e. Word  B  /\  T  e. Word  B  /\  I  e.  ( ( `  S
)..^ ( ( `  S
)  +  ( `  T
) ) ) )  ->  ( I  -  ( `  S ) )  e.  ZZ )
31 fvexg 5714 . . 3  |-  ( ( T  e. Word  B  /\  ( I  -  ( `  S ) )  e.  ZZ )  ->  ( T `  ( I  -  ( `  S )
) )  e.  _V )
3224, 30, 31syl2anc 415 . 2  |-  ( ( S  e. Word  B  /\  T  e. Word  B  /\  I  e.  ( ( `  S
)..^ ( ( `  S
)  +  ( `  T
) ) ) )  ->  ( T `  ( I  -  ( `  S ) ) )  e.  _V )
335, 15, 23, 32fvmptd 5786 1  |-  ( ( S  e. Word  B  /\  T  e. Word  B  /\  I  e.  ( ( `  S
)..^ ( ( `  S
)  +  ( `  T
) ) ) )  ->  ( ( S ++  T ) `  I
)  =  ( T `
 ( I  -  ( `  S ) ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:   -. wn 3    -> wi 4    /\ wa 104    /\ w3a 1009    = wceq 1402    e. wcel 2209   _Vcvv 2821    i^i cin 3219    C_ wss 3220   (/)c0 3520   ifcif 3638    |-> cmpt 4192   ` cfv 5377  (class class class)co 6085   Fincfn 7022   0cc0 8179    + caddc 8182    - cmin 8497   NN0cn0 9563   ZZcz 9644   ZZ>=cuz 9921  ..^cfzo 10549  ♯chash 11214  Word cword 11304   ++ cconcat 11358
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  df-1o 6687  df-er 6807  df-en 7023  df-dom 7024  df-fin 7025  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-inn 9305  df-n0 9564  df-z 9645  df-uz 9922  df-fz 10412  df-fzo 10550  df-ihash 11215  df-word 11305  df-concat 11359
This theorem is used by:  ccatval3  11367  ccatsymb  11370  ccatval21sw  11373  ccatlid  11374  ccatass  11376  ccatrn  11377  lswccatn0lsw  11379  ccats1val2  11408  ccatswrd  11442  ccatpfx  11473  pfxccatin12lem2  11503  pfxccatin12  11505  clwwlkccatlem  16641
  Copyright terms: Public domain W3C validator