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

Theorem ccatfvalfi 11338
Description: Value of the concatenation operator. (Contributed by Stefan O'Rear, 15-Aug-2015.)
Assertion
Ref Expression
ccatfvalfi  |-  ( ( S  e.  Fin  /\  T  e.  Fin )  ->  ( S ++  T )  =  ( x  e.  ( 0..^ ( ( `  S )  +  ( `  T ) ) ) 
|->  if ( x  e.  ( 0..^ ( `  S
) ) ,  ( S `  x ) ,  ( T `  ( x  -  ( `  S ) ) ) ) ) )
Distinct variable groups:    x, S    x, T

Proof of Theorem ccatfvalfi
Dummy variables  t  s are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elex 2833 . . 3  |-  ( S  e.  Fin  ->  S  e.  _V )
21adantr 276 . 2  |-  ( ( S  e.  Fin  /\  T  e.  Fin )  ->  S  e.  _V )
3 elex 2833 . . 3  |-  ( T  e.  Fin  ->  T  e.  _V )
43adantl 277 . 2  |-  ( ( S  e.  Fin  /\  T  e.  Fin )  ->  T  e.  _V )
5 0zd 9635 . . . 4  |-  ( ( S  e.  Fin  /\  T  e.  Fin )  ->  0  e.  ZZ )
6 hashcl 11198 . . . . . . 7  |-  ( S  e.  Fin  ->  ( `  S )  e.  NN0 )
76adantr 276 . . . . . 6  |-  ( ( S  e.  Fin  /\  T  e.  Fin )  ->  ( `  S )  e.  NN0 )
8 hashcl 11198 . . . . . . 7  |-  ( T  e.  Fin  ->  ( `  T )  e.  NN0 )
98adantl 277 . . . . . 6  |-  ( ( S  e.  Fin  /\  T  e.  Fin )  ->  ( `  T )  e.  NN0 )
107, 9nn0addcld 9603 . . . . 5  |-  ( ( S  e.  Fin  /\  T  e.  Fin )  ->  ( ( `  S
)  +  ( `  T
) )  e.  NN0 )
1110nn0zd 9745 . . . 4  |-  ( ( S  e.  Fin  /\  T  e.  Fin )  ->  ( ( `  S
)  +  ( `  T
) )  e.  ZZ )
12 fzofig 10847 . . . 4  |-  ( ( 0  e.  ZZ  /\  ( ( `  S )  +  ( `  T )
)  e.  ZZ )  ->  ( 0..^ ( ( `  S )  +  ( `  T )
) )  e.  Fin )
135, 11, 12syl2anc 415 . . 3  |-  ( ( S  e.  Fin  /\  T  e.  Fin )  ->  ( 0..^ ( ( `  S )  +  ( `  T ) ) )  e.  Fin )
1413mptexd 5935 . 2  |-  ( ( S  e.  Fin  /\  T  e.  Fin )  ->  ( x  e.  ( 0..^ ( ( `  S
)  +  ( `  T
) ) )  |->  if ( x  e.  ( 0..^ ( `  S
) ) ,  ( S `  x ) ,  ( T `  ( x  -  ( `  S ) ) ) ) )  e.  _V )
15 fveq2 5690 . . . . . 6  |-  ( s  =  S  ->  ( `  s )  =  ( `  S ) )
1615oveq1d 6090 . . . . 5  |-  ( s  =  S  ->  (
( `  s )  +  ( `  t )
)  =  ( ( `  S )  +  ( `  t ) ) )
1716oveq2d 6091 . . . 4  |-  ( s  =  S  ->  (
0..^ ( ( `  s
)  +  ( `  t
) ) )  =  ( 0..^ ( ( `  S )  +  ( `  t ) ) ) )
1815oveq2d 6091 . . . . . 6  |-  ( s  =  S  ->  (
0..^ ( `  s )
)  =  ( 0..^ ( `  S )
) )
1918eleq2d 2308 . . . . 5  |-  ( s  =  S  ->  (
x  e.  ( 0..^ ( `  s )
)  <->  x  e.  (
0..^ ( `  S )
) ) )
20 fveq1 5689 . . . . 5  |-  ( s  =  S  ->  (
s `  x )  =  ( S `  x ) )
2115oveq2d 6091 . . . . . 6  |-  ( s  =  S  ->  (
x  -  ( `  s
) )  =  ( x  -  ( `  S
) ) )
2221fveq2d 5694 . . . . 5  |-  ( s  =  S  ->  (
t `  ( x  -  ( `  s )
) )  =  ( t `  ( x  -  ( `  S
) ) ) )
2319, 20, 22ifbieq12d 3664 . . . 4  |-  ( s  =  S  ->  if ( x  e.  (
0..^ ( `  s )
) ,  ( s `
 x ) ,  ( t `  (
x  -  ( `  s
) ) ) )  =  if ( x  e.  ( 0..^ ( `  S ) ) ,  ( S `  x
) ,  ( t `
 ( x  -  ( `  S ) ) ) ) )
2417, 23mpteq12dv 4208 . . 3  |-  ( s  =  S  ->  (
x  e.  ( 0..^ ( ( `  s
)  +  ( `  t
) ) )  |->  if ( x  e.  ( 0..^ ( `  s
) ) ,  ( s `  x ) ,  ( t `  ( x  -  ( `  s ) ) ) ) )  =  ( x  e.  ( 0..^ ( ( `  S
)  +  ( `  t
) ) )  |->  if ( x  e.  ( 0..^ ( `  S
) ) ,  ( S `  x ) ,  ( t `  ( x  -  ( `  S ) ) ) ) ) )
25 fveq2 5690 . . . . . 6  |-  ( t  =  T  ->  ( `  t )  =  ( `  T ) )
2625oveq2d 6091 . . . . 5  |-  ( t  =  T  ->  (
( `  S )  +  ( `  t )
)  =  ( ( `  S )  +  ( `  T ) ) )
2726oveq2d 6091 . . . 4  |-  ( t  =  T  ->  (
0..^ ( ( `  S
)  +  ( `  t
) ) )  =  ( 0..^ ( ( `  S )  +  ( `  T ) ) ) )
28 fveq1 5689 . . . . 5  |-  ( t  =  T  ->  (
t `  ( x  -  ( `  S )
) )  =  ( T `  ( x  -  ( `  S
) ) ) )
2928ifeq2d 3656 . . . 4  |-  ( t  =  T  ->  if ( x  e.  (
0..^ ( `  S )
) ,  ( S `
 x ) ,  ( t `  (
x  -  ( `  S
) ) ) )  =  if ( x  e.  ( 0..^ ( `  S ) ) ,  ( S `  x
) ,  ( T `
 ( x  -  ( `  S ) ) ) ) )
3027, 29mpteq12dv 4208 . . 3  |-  ( t  =  T  ->  (
x  e.  ( 0..^ ( ( `  S
)  +  ( `  t
) ) )  |->  if ( x  e.  ( 0..^ ( `  S
) ) ,  ( S `  x ) ,  ( t `  ( x  -  ( `  S ) ) ) ) )  =  ( x  e.  ( 0..^ ( ( `  S
)  +  ( `  T
) ) )  |->  if ( x  e.  ( 0..^ ( `  S
) ) ,  ( S `  x ) ,  ( T `  ( x  -  ( `  S ) ) ) ) ) )
31 df-concat 11337 . . 3  |- ++  =  ( s  e.  _V , 
t  e.  _V  |->  ( x  e.  ( 0..^ ( ( `  s
)  +  ( `  t
) ) )  |->  if ( x  e.  ( 0..^ ( `  s
) ) ,  ( s `  x ) ,  ( t `  ( x  -  ( `  s ) ) ) ) ) )
3224, 30, 31ovmpog 6213 . 2  |-  ( ( S  e.  _V  /\  T  e.  _V  /\  (
x  e.  ( 0..^ ( ( `  S
)  +  ( `  T
) ) )  |->  if ( x  e.  ( 0..^ ( `  S
) ) ,  ( S `  x ) ,  ( T `  ( x  -  ( `  S ) ) ) ) )  e.  _V )  ->  ( S ++  T
)  =  ( x  e.  ( 0..^ ( ( `  S )  +  ( `  T )
) )  |->  if ( x  e.  ( 0..^ ( `  S )
) ,  ( S `
 x ) ,  ( T `  (
x  -  ( `  S
) ) ) ) ) )
332, 4, 14, 32syl3anc 1278 1  |-  ( ( S  e.  Fin  /\  T  e.  Fin )  ->  ( S ++  T )  =  ( x  e.  ( 0..^ ( ( `  S )  +  ( `  T ) ) ) 
|->  if ( x  e.  ( 0..^ ( `  S
) ) ,  ( S `  x ) ,  ( T `  ( x  -  ( `  S ) ) ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   _Vcvv 2821   ifcif 3635    |-> cmpt 4187   ` cfv 5372  (class class class)co 6075   Fincfn 7012   0cc0 8169    + caddc 8172    - cmin 8487   NN0cn0 9542   ZZcz 9623  ..^cfzo 10527  ♯chash 11192   ++ cconcat 11336
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 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 4241  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-iinf 4730  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-addcom 8269  ax-addass 8271  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-0id 8277  ax-rnegex 8278  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283  ax-pre-apti 8284  ax-pre-ltadd 8285
This theorem 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 3636  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-iord 4506  df-on 4508  df-ilim 4509  df-suc 4511  df-iom 4733  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-recs 6566  df-frec 6652  df-1o 6677  df-er 6797  df-en 7013  df-dom 7014  df-fin 7015  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-sub 8489  df-neg 8490  df-inn 9284  df-n0 9543  df-z 9624  df-uz 9901  df-fz 10391  df-fzo 10528  df-ihash 11193  df-concat 11337
This theorem is referenced by:  ccatcl  11339  ccatlen  11341  ccatval1  11343  ccatval2  11344  ccatvalfn  11347  ccatalpha  11359
  Copyright terms: Public domain W3C validator