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

Theorem ccatvalfn 11314
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 5694 . . . . . 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 10503 . . . . . . . 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 11253 . . . . . . . . 9  |-  ( A  e. Word  V  ->  ( `  A )  e.  NN0 )
76nn0zd 9716 . . . . . . . 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 9723 . . . . . 6  |-  ( ( ( A  e. Word  V  /\  B  e. Word  V )  /\  x  e.  ( 0..^ ( ( `  A
)  +  ( `  B
) ) ) )  ->  ( x  -  ( `  A ) )  e.  ZZ )
10 fvexg 5694 . . . . . 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 4610 . . . 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 2617 . . 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 2234 . . . 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 5490 . . 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 11268 . . . 4  |-  ( A  e. Word  V  ->  A  e.  Fin )
18 wrdfin 11268 . . . 4  |-  ( B  e. Word  V  ->  B  e.  Fin )
19 ccatfvalfi 11305 . . . 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 5451 . 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 2205   A.wral 2522   _Vcvv 2815   ifcif 3624    |-> cmpt 4176    Fn wfn 5352   ` cfv 5357  (class class class)co 6058   Fincfn 6988   0cc0 8143    + caddc 8146    - cmin 8460   ZZcz 9594  ..^cfzo 10498  ♯chash 11163  Word cword 11249   ++ cconcat 11303
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 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-addass 8245  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-0id 8251  ax-rnegex 8252  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-apti 8258  ax-pre-ltadd 8259
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 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-if 3625  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-iord 4492  df-on 4494  df-ilim 4495  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-recs 6549  df-frec 6635  df-1o 6660  df-er 6780  df-en 6989  df-dom 6990  df-fin 6991  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8462  df-neg 8463  df-inn 9255  df-n0 9514  df-z 9595  df-uz 9872  df-fz 10362  df-fzo 10499  df-ihash 11164  df-word 11250  df-concat 11304
This theorem is referenced by:  ccatlid  11319  ccatrid  11320  ccatrn  11322  pfxccat1  11419  pfxccatin12  11450
  Copyright terms: Public domain W3C validator