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

Theorem ccatvalfn 11289
Description: The concatenation of two words is a function over the half-open integer range having the sum of the lengths of the word as length. (Contributed by Alexander van der Vekens, 30-Mar-2018.)
Assertion
Ref Expression
ccatvalfn  |-  ( ( A  e. Word  V  /\  B  e. Word  V )  ->  ( A ++  B )  Fn  ( 0..^ ( ( `  A )  +  ( `  B )
) ) )

Proof of Theorem ccatvalfn
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 fvexg 5689 . . . . . 6  |-  ( ( A  e. Word  V  /\  x  e.  ( 0..^ ( ( `  A
)  +  ( `  B
) ) ) )  ->  ( A `  x )  e.  _V )
21adantlr 477 . . . . 5  |-  ( ( ( A  e. Word  V  /\  B  e. Word  V )  /\  x  e.  ( 0..^ ( ( `  A
)  +  ( `  B
) ) ) )  ->  ( A `  x )  e.  _V )
3 simplr 529 . . . . . 6  |-  ( ( ( A  e. Word  V  /\  B  e. Word  V )  /\  x  e.  ( 0..^ ( ( `  A
)  +  ( `  B
) ) ) )  ->  B  e. Word  V
)
4 elfzoelz 10481 . . . . . . . 8  |-  ( x  e.  ( 0..^ ( ( `  A )  +  ( `  B )
) )  ->  x  e.  ZZ )
54adantl 277 . . . . . . 7  |-  ( ( ( A  e. Word  V  /\  B  e. Word  V )  /\  x  e.  ( 0..^ ( ( `  A
)  +  ( `  B
) ) ) )  ->  x  e.  ZZ )
6 lencl 11228 . . . . . . . . 9  |-  ( A  e. Word  V  ->  ( `  A )  e.  NN0 )
76nn0zd 9698 . . . . . . . 8  |-  ( A  e. Word  V  ->  ( `  A )  e.  ZZ )
87ad2antrr 488 . . . . . . 7  |-  ( ( ( A  e. Word  V  /\  B  e. Word  V )  /\  x  e.  ( 0..^ ( ( `  A
)  +  ( `  B
) ) ) )  ->  ( `  A )  e.  ZZ )
95, 8zsubcld 9705 . . . . . 6  |-  ( ( ( A  e. Word  V  /\  B  e. Word  V )  /\  x  e.  ( 0..^ ( ( `  A
)  +  ( `  B
) ) ) )  ->  ( x  -  ( `  A ) )  e.  ZZ )
10 fvexg 5689 . . . . . 6  |-  ( ( B  e. Word  V  /\  ( x  -  ( `  A ) )  e.  ZZ )  ->  ( B `  ( x  -  ( `  A )
) )  e.  _V )
113, 9, 10syl2anc 411 . . . . 5  |-  ( ( ( A  e. Word  V  /\  B  e. Word  V )  /\  x  e.  ( 0..^ ( ( `  A
)  +  ( `  B
) ) ) )  ->  ( B `  ( x  -  ( `  A ) ) )  e.  _V )
122, 11ifexd 4605 . . . 4  |-  ( ( ( A  e. Word  V  /\  B  e. Word  V )  /\  x  e.  ( 0..^ ( ( `  A
)  +  ( `  B
) ) ) )  ->  if ( x  e.  ( 0..^ ( `  A ) ) ,  ( A `  x
) ,  ( B `
 ( x  -  ( `  A ) ) ) )  e.  _V )
1312ralrimiva 2615 . . 3  |-  ( ( A  e. Word  V  /\  B  e. Word  V )  ->  A. x  e.  ( 0..^ ( ( `  A
)  +  ( `  B
) ) ) if ( x  e.  ( 0..^ ( `  A
) ) ,  ( A `  x ) ,  ( B `  ( x  -  ( `  A ) ) ) )  e.  _V )
14 eqid 2232 . . . 4  |-  ( x  e.  ( 0..^ ( ( `  A )  +  ( `  B )
) )  |->  if ( x  e.  ( 0..^ ( `  A )
) ,  ( A `
 x ) ,  ( B `  (
x  -  ( `  A
) ) ) ) )  =  ( x  e.  ( 0..^ ( ( `  A )  +  ( `  B )
) )  |->  if ( x  e.  ( 0..^ ( `  A )
) ,  ( A `
 x ) ,  ( B `  (
x  -  ( `  A
) ) ) ) )
1514fnmpt 5485 . . 3  |-  ( A. x  e.  ( 0..^ ( ( `  A
)  +  ( `  B
) ) ) if ( x  e.  ( 0..^ ( `  A
) ) ,  ( A `  x ) ,  ( B `  ( x  -  ( `  A ) ) ) )  e.  _V  ->  ( x  e.  ( 0..^ ( ( `  A
)  +  ( `  B
) ) )  |->  if ( x  e.  ( 0..^ ( `  A
) ) ,  ( A `  x ) ,  ( B `  ( x  -  ( `  A ) ) ) ) )  Fn  (
0..^ ( ( `  A
)  +  ( `  B
) ) ) )
1613, 15syl 14 . 2  |-  ( ( A  e. Word  V  /\  B  e. Word  V )  ->  ( x  e.  ( 0..^ ( ( `  A
)  +  ( `  B
) ) )  |->  if ( x  e.  ( 0..^ ( `  A
) ) ,  ( A `  x ) ,  ( B `  ( x  -  ( `  A ) ) ) ) )  Fn  (
0..^ ( ( `  A
)  +  ( `  B
) ) ) )
17 wrdfin 11243 . . . 4  |-  ( A  e. Word  V  ->  A  e.  Fin )
18 wrdfin 11243 . . . 4  |-  ( B  e. Word  V  ->  B  e.  Fin )
19 ccatfvalfi 11280 . . . 4  |-  ( ( A  e.  Fin  /\  B  e.  Fin )  ->  ( A ++  B )  =  ( x  e.  ( 0..^ ( ( `  A )  +  ( `  B ) ) ) 
|->  if ( x  e.  ( 0..^ ( `  A
) ) ,  ( A `  x ) ,  ( B `  ( x  -  ( `  A ) ) ) ) ) )
2017, 18, 19syl2an 289 . . 3  |-  ( ( A  e. Word  V  /\  B  e. Word  V )  ->  ( A ++  B )  =  ( x  e.  ( 0..^ ( ( `  A )  +  ( `  B ) ) ) 
|->  if ( x  e.  ( 0..^ ( `  A
) ) ,  ( A `  x ) ,  ( B `  ( x  -  ( `  A ) ) ) ) ) )
2120fneq1d 5446 . 2  |-  ( ( A  e. Word  V  /\  B  e. Word  V )  ->  ( ( A ++  B
)  Fn  ( 0..^ ( ( `  A
)  +  ( `  B
) ) )  <->  ( x  e.  ( 0..^ ( ( `  A )  +  ( `  B ) ) ) 
|->  if ( x  e.  ( 0..^ ( `  A
) ) ,  ( A `  x ) ,  ( B `  ( x  -  ( `  A ) ) ) ) )  Fn  (
0..^ ( ( `  A
)  +  ( `  B
) ) ) ) )
2216, 21mpbird 167 1  |-  ( ( A  e. Word  V  /\  B  e. Word  V )  ->  ( A ++  B )  Fn  ( 0..^ ( ( `  A )  +  ( `  B )
) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398    e. wcel 2203   A.wral 2520   _Vcvv 2813   ifcif 3620    |-> cmpt 4171    Fn wfn 5347   ` cfv 5352  (class class class)co 6050   Fincfn 6975   0cc0 8127    + caddc 8130    - cmin 8444   ZZcz 9577  ..^cfzo 10476  ♯chash 11138  Word cword 11224   ++ cconcat 11278
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 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-nul 4236  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-iinf 4710  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-addcom 8227  ax-addass 8229  ax-distr 8231  ax-i2m1 8232  ax-0lt1 8233  ax-0id 8235  ax-rnegex 8236  ax-cnre 8238  ax-pre-ltirr 8239  ax-pre-ltwlin 8240  ax-pre-lttrn 8241  ax-pre-apti 8242  ax-pre-ltadd 8243
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 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-if 3621  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-tr 4209  df-id 4414  df-iord 4487  df-on 4489  df-ilim 4490  df-suc 4492  df-iom 4713  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-1st 6334  df-2nd 6335  df-recs 6536  df-frec 6622  df-1o 6647  df-er 6767  df-en 6976  df-dom 6977  df-fin 6978  df-pnf 8310  df-mnf 8311  df-xr 8312  df-ltxr 8313  df-le 8314  df-sub 8446  df-neg 8447  df-inn 9238  df-n0 9497  df-z 9578  df-uz 9854  df-fz 10343  df-fzo 10477  df-ihash 11139  df-word 11225  df-concat 11279
This theorem is referenced by:  ccatlid  11294  ccatrid  11295  ccatrn  11297  pfxccat1  11394  pfxccatin12  11425
  Copyright terms: Public domain W3C validator