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

Theorem ccatval2 11174
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 11131 . . . 4  |-  ( S  e. Word  B  ->  S  e.  Fin )
2 wrdfin 11131 . . . 4  |-  ( T  e. Word  B  ->  T  e.  Fin )
3 ccatfvalfi 11168 . . . 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 1043 . 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 2294 . . . 4  |-  ( x  =  I  ->  (
x  e.  ( 0..^ ( `  S )
)  <->  I  e.  (
0..^ ( `  S )
) ) )
7 fveq2 5639 . . . 4  |-  ( x  =  I  ->  ( S `  x )  =  ( S `  I ) )
8 fvoveq1 6040 . . . 4  |-  ( x  =  I  ->  ( T `  ( x  -  ( `  S )
) )  =  ( T `  ( I  -  ( `  S
) ) ) )
96, 7, 8ifbieq12d 3632 . . 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 10414 . . . . . 6  |-  ( ( 0..^ ( `  S
) )  i^i  (
( `  S )..^ ( ( `  S )  +  ( `  T )
) ) )  =  (/)
11 minel 3556 . . . . . 6  |-  ( ( I  e.  ( ( `  S )..^ ( ( `  S )  +  ( `  T ) ) )  /\  ( ( 0..^ ( `  S )
)  i^i  ( ( `  S )..^ ( ( `  S )  +  ( `  T ) ) ) )  =  (/) )  ->  -.  I  e.  (
0..^ ( `  S )
) )
1210, 11mpan2 425 . . . . 5  |-  ( I  e.  ( ( `  S
)..^ ( ( `  S
)  +  ( `  T
) ) )  ->  -.  I  e.  (
0..^ ( `  S )
) )
13123ad2ant3 1046 . . . 4  |-  ( ( S  e. Word  B  /\  T  e. Word  B  /\  I  e.  ( ( `  S
)..^ ( ( `  S
)  +  ( `  T
) ) ) )  ->  -.  I  e.  ( 0..^ ( `  S
) ) )
1413iffalsed 3615 . . 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 2286 . 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 11042 . . . . 5  |-  ( S  e.  Fin  ->  ( `  S )  e.  NN0 )
18 fzoss1 10407 . . . . . 6  |-  ( ( `  S )  e.  (
ZZ>= `  0 )  -> 
( ( `  S
)..^ ( ( `  S
)  +  ( `  T
) ) )  C_  ( 0..^ ( ( `  S
)  +  ( `  T
) ) ) )
19 nn0uz 9790 . . . . . 6  |-  NN0  =  ( ZZ>= `  0 )
2018, 19eleq2s 2326 . . . . 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 3226 . . 3  |-  ( ( S  e. Word  B  /\  T  e. Word  B )  ->  ( I  e.  ( ( `  S )..^ ( ( `  S )  +  ( `  T )
) )  ->  I  e.  ( 0..^ ( ( `  S )  +  ( `  T ) ) ) ) )
23223impia 1226 . 2  |-  ( ( S  e. Word  B  /\  T  e. Word  B  /\  I  e.  ( ( `  S
)..^ ( ( `  S
)  +  ( `  T
) ) ) )  ->  I  e.  ( 0..^ ( ( `  S
)  +  ( `  T
) ) ) )
24 simp2 1024 . . 3  |-  ( ( S  e. Word  B  /\  T  e. Word  B  /\  I  e.  ( ( `  S
)..^ ( ( `  S
)  +  ( `  T
) ) ) )  ->  T  e. Word  B
)
25 elfzoelz 10381 . . . . 5  |-  ( I  e.  ( ( `  S
)..^ ( ( `  S
)  +  ( `  T
) ) )  ->  I  e.  ZZ )
26253ad2ant3 1046 . . . 4  |-  ( ( S  e. Word  B  /\  T  e. Word  B  /\  I  e.  ( ( `  S
)..^ ( ( `  S
)  +  ( `  T
) ) ) )  ->  I  e.  ZZ )
27 lencl 11116 . . . . . 6  |-  ( S  e. Word  B  ->  ( `  S )  e.  NN0 )
2827nn0zd 9599 . . . . 5  |-  ( S  e. Word  B  ->  ( `  S )  e.  ZZ )
29283ad2ant1 1044 . . . 4  |-  ( ( S  e. Word  B  /\  T  e. Word  B  /\  I  e.  ( ( `  S
)..^ ( ( `  S
)  +  ( `  T
) ) ) )  ->  ( `  S )  e.  ZZ )
3026, 29zsubcld 9606 . . 3  |-  ( ( S  e. Word  B  /\  T  e. Word  B  /\  I  e.  ( ( `  S
)..^ ( ( `  S
)  +  ( `  T
) ) ) )  ->  ( I  -  ( `  S ) )  e.  ZZ )
31 fvexg 5658 . . 3  |-  ( ( T  e. Word  B  /\  ( I  -  ( `  S ) )  e.  ZZ )  ->  ( T `  ( I  -  ( `  S )
) )  e.  _V )
3224, 30, 31syl2anc 411 . 2  |-  ( ( S  e. Word  B  /\  T  e. Word  B  /\  I  e.  ( ( `  S
)..^ ( ( `  S
)  +  ( `  T
) ) ) )  ->  ( T `  ( I  -  ( `  S ) ) )  e.  _V )
335, 15, 23, 32fvmptd 5727 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
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    /\ w3a 1004    = wceq 1397    e. wcel 2202   _Vcvv 2802    i^i cin 3199    C_ wss 3200   (/)c0 3494   ifcif 3605    |-> cmpt 4150   ` cfv 5326  (class class class)co 6017   Fincfn 6908   0cc0 8031    + caddc 8034    - cmin 8349   NN0cn0 9401   ZZcz 9478   ZZ>=cuz 9754  ..^cfzo 10376  ♯chash 11036  Word cword 11112   ++ cconcat 11166
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 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-addcom 8131  ax-addass 8133  ax-distr 8135  ax-i2m1 8136  ax-0lt1 8137  ax-0id 8139  ax-rnegex 8140  ax-cnre 8142  ax-pre-ltirr 8143  ax-pre-ltwlin 8144  ax-pre-lttrn 8145  ax-pre-apti 8146  ax-pre-ltadd 8147
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 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-recs 6470  df-frec 6556  df-1o 6581  df-er 6701  df-en 6909  df-dom 6910  df-fin 6911  df-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219  df-sub 8351  df-neg 8352  df-inn 9143  df-n0 9402  df-z 9479  df-uz 9755  df-fz 10243  df-fzo 10377  df-ihash 11037  df-word 11113  df-concat 11167
This theorem is referenced by:  ccatval3  11175  ccatsymb  11178  ccatval21sw  11181  ccatlid  11182  ccatass  11184  ccatrn  11185  lswccatn0lsw  11187  ccats1val2  11216  ccatswrd  11250  ccatpfx  11281  pfxccatin12lem2  11311  pfxccatin12  11313  clwwlkccatlem  16250
  Copyright terms: Public domain W3C validator