MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  swrdccatin12lem2c Structured version   Unicode version

Theorem swrdccatin12lem2c 12663
Description: Lemma for swrdccatin12lem2 12664 and swrdccatin12lem3 12665. (Contributed by AV, 30-Mar-2018.) (Revised by AV, 27-May-2018.)
Hypothesis
Ref Expression
swrdccatin12.l  |-  L  =  ( # `  A
)
Assertion
Ref Expression
swrdccatin12lem2c  |-  ( ( ( A  e. Word  V  /\  B  e. Word  V )  /\  ( M  e.  ( 0 ... L
)  /\  N  e.  ( L ... ( L  +  ( # `  B
) ) ) ) )  ->  ( ( A concat  B )  e. Word  V  /\  M  e.  (
0 ... N )  /\  N  e.  ( 0 ... ( # `  ( A concat  B ) ) ) ) )

Proof of Theorem swrdccatin12lem2c
StepHypRef Expression
1 ccatcl 12545 . . 3  |-  ( ( A  e. Word  V  /\  B  e. Word  V )  ->  ( A concat  B )  e. Word  V )
21adantr 465 . 2  |-  ( ( ( A  e. Word  V  /\  B  e. Word  V )  /\  ( M  e.  ( 0 ... L
)  /\  N  e.  ( L ... ( L  +  ( # `  B
) ) ) ) )  ->  ( A concat  B )  e. Word  V )
3 elfz0fzfz0 11766 . . 3  |-  ( ( M  e.  ( 0 ... L )  /\  N  e.  ( L ... ( L  +  (
# `  B )
) ) )  ->  M  e.  ( 0 ... N ) )
43adantl 466 . 2  |-  ( ( ( A  e. Word  V  /\  B  e. Word  V )  /\  ( M  e.  ( 0 ... L
)  /\  N  e.  ( L ... ( L  +  ( # `  B
) ) ) ) )  ->  M  e.  ( 0 ... N
) )
5 elfzuz2 11680 . . . . . . 7  |-  ( M  e.  ( 0 ... L )  ->  L  e.  ( ZZ>= `  0 )
)
65adantl 466 . . . . . 6  |-  ( ( ( A  e. Word  V  /\  B  e. Word  V )  /\  M  e.  ( 0 ... L ) )  ->  L  e.  ( ZZ>= `  0 )
)
7 fzss1 11711 . . . . . 6  |-  ( L  e.  ( ZZ>= `  0
)  ->  ( L ... ( L  +  (
# `  B )
) )  C_  (
0 ... ( L  +  ( # `  B ) ) ) )
86, 7syl 16 . . . . 5  |-  ( ( ( A  e. Word  V  /\  B  e. Word  V )  /\  M  e.  ( 0 ... L ) )  ->  ( L ... ( L  +  (
# `  B )
) )  C_  (
0 ... ( L  +  ( # `  B ) ) ) )
98sseld 3496 . . . 4  |-  ( ( ( A  e. Word  V  /\  B  e. Word  V )  /\  M  e.  ( 0 ... L ) )  ->  ( N  e.  ( L ... ( L  +  ( # `  B
) ) )  ->  N  e.  ( 0 ... ( L  +  ( # `  B ) ) ) ) )
109impr 619 . . 3  |-  ( ( ( A  e. Word  V  /\  B  e. Word  V )  /\  ( M  e.  ( 0 ... L
)  /\  N  e.  ( L ... ( L  +  ( # `  B
) ) ) ) )  ->  N  e.  ( 0 ... ( L  +  ( # `  B
) ) ) )
11 ccatlen 12546 . . . . . . 7  |-  ( ( A  e. Word  V  /\  B  e. Word  V )  ->  ( # `  ( A concat  B ) )  =  ( ( # `  A
)  +  ( # `  B ) ) )
12 swrdccatin12.l . . . . . . . . . 10  |-  L  =  ( # `  A
)
1312eqcomi 2473 . . . . . . . . 9  |-  ( # `  A )  =  L
1413a1i 11 . . . . . . . 8  |-  ( ( A  e. Word  V  /\  B  e. Word  V )  ->  ( # `  A
)  =  L )
1514oveq1d 6290 . . . . . . 7  |-  ( ( A  e. Word  V  /\  B  e. Word  V )  ->  ( ( # `  A
)  +  ( # `  B ) )  =  ( L  +  (
# `  B )
) )
1611, 15eqtrd 2501 . . . . . 6  |-  ( ( A  e. Word  V  /\  B  e. Word  V )  ->  ( # `  ( A concat  B ) )  =  ( L  +  (
# `  B )
) )
1716oveq2d 6291 . . . . 5  |-  ( ( A  e. Word  V  /\  B  e. Word  V )  ->  ( 0 ... ( # `
 ( A concat  B
) ) )  =  ( 0 ... ( L  +  ( # `  B
) ) ) )
1817eleq2d 2530 . . . 4  |-  ( ( A  e. Word  V  /\  B  e. Word  V )  ->  ( N  e.  ( 0 ... ( # `  ( A concat  B ) ) )  <->  N  e.  ( 0 ... ( L  +  ( # `  B
) ) ) ) )
1918adantr 465 . . 3  |-  ( ( ( A  e. Word  V  /\  B  e. Word  V )  /\  ( M  e.  ( 0 ... L
)  /\  N  e.  ( L ... ( L  +  ( # `  B
) ) ) ) )  ->  ( N  e.  ( 0 ... ( # `
 ( A concat  B
) ) )  <->  N  e.  ( 0 ... ( L  +  ( # `  B
) ) ) ) )
2010, 19mpbird 232 . 2  |-  ( ( ( A  e. Word  V  /\  B  e. Word  V )  /\  ( M  e.  ( 0 ... L
)  /\  N  e.  ( L ... ( L  +  ( # `  B
) ) ) ) )  ->  N  e.  ( 0 ... ( # `
 ( A concat  B
) ) ) )
212, 4, 203jca 1171 1  |-  ( ( ( A  e. Word  V  /\  B  e. Word  V )  /\  ( M  e.  ( 0 ... L
)  /\  N  e.  ( L ... ( L  +  ( # `  B
) ) ) ) )  ->  ( ( A concat  B )  e. Word  V  /\  M  e.  (
0 ... N )  /\  N  e.  ( 0 ... ( # `  ( A concat  B ) ) ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 369    /\ w3a 968    = wceq 1374    e. wcel 1762    C_ wss 3469   ` cfv 5579  (class class class)co 6275   0cc0 9481    + caddc 9484   ZZ>=cuz 11071   ...cfz 11661   #chash 12360  Word cword 12487   concat cconcat 12489
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1596  ax-4 1607  ax-5 1675  ax-6 1714  ax-7 1734  ax-8 1764  ax-9 1766  ax-10 1781  ax-11 1786  ax-12 1798  ax-13 1961  ax-ext 2438  ax-rep 4551  ax-sep 4561  ax-nul 4569  ax-pow 4618  ax-pr 4679  ax-un 6567  ax-cnex 9537  ax-resscn 9538  ax-1cn 9539  ax-icn 9540  ax-addcl 9541  ax-addrcl 9542  ax-mulcl 9543  ax-mulrcl 9544  ax-mulcom 9545  ax-addass 9546  ax-mulass 9547  ax-distr 9548  ax-i2m1 9549  ax-1ne0 9550  ax-1rid 9551  ax-rnegex 9552  ax-rrecex 9553  ax-cnre 9554  ax-pre-lttri 9555  ax-pre-lttrn 9556  ax-pre-ltadd 9557  ax-pre-mulgt0 9558
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 969  df-3an 970  df-tru 1377  df-ex 1592  df-nf 1595  df-sb 1707  df-eu 2272  df-mo 2273  df-clab 2446  df-cleq 2452  df-clel 2455  df-nfc 2610  df-ne 2657  df-nel 2658  df-ral 2812  df-rex 2813  df-reu 2814  df-rab 2816  df-v 3108  df-sbc 3325  df-csb 3429  df-dif 3472  df-un 3474  df-in 3476  df-ss 3483  df-pss 3485  df-nul 3779  df-if 3933  df-pw 4005  df-sn 4021  df-pr 4023  df-tp 4025  df-op 4027  df-uni 4239  df-int 4276  df-iun 4320  df-br 4441  df-opab 4499  df-mpt 4500  df-tr 4534  df-eprel 4784  df-id 4788  df-po 4793  df-so 4794  df-fr 4831  df-we 4833  df-ord 4874  df-on 4875  df-lim 4876  df-suc 4877  df-xp 4998  df-rel 4999  df-cnv 5000  df-co 5001  df-dm 5002  df-rn 5003  df-res 5004  df-ima 5005  df-iota 5542  df-fun 5581  df-fn 5582  df-f 5583  df-f1 5584  df-fo 5585  df-f1o 5586  df-fv 5587  df-riota 6236  df-ov 6278  df-oprab 6279  df-mpt2 6280  df-om 6672  df-1st 6774  df-2nd 6775  df-recs 7032  df-rdg 7066  df-1o 7120  df-oadd 7124  df-er 7301  df-en 7507  df-dom 7508  df-sdom 7509  df-fin 7510  df-card 8309  df-pnf 9619  df-mnf 9620  df-xr 9621  df-ltxr 9622  df-le 9623  df-sub 9796  df-neg 9797  df-nn 10526  df-n0 10785  df-z 10854  df-uz 11072  df-fz 11662  df-fzo 11782  df-hash 12361  df-word 12495  df-concat 12497
This theorem is referenced by:  swrdccatin12lem2  12664  swrdccatin12lem3  12665
  Copyright terms: Public domain W3C validator