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

Theorem efgredlemf 16550
Description: Lemma for efgredleme 16552. (Contributed by Mario Carneiro, 4-Jun-2016.)
Hypotheses
Ref Expression
efgval.w  |-  W  =  (  _I  ` Word  ( I  X.  2o ) )
efgval.r  |-  .~  =  ( ~FG  `  I )
efgval2.m  |-  M  =  ( y  e.  I ,  z  e.  2o  |->  <. y ,  ( 1o 
\  z ) >.
)
efgval2.t  |-  T  =  ( v  e.  W  |->  ( n  e.  ( 0 ... ( # `  v ) ) ,  w  e.  ( I  X.  2o )  |->  ( v splice  <. n ,  n ,  <" w ( M `  w ) "> >. )
) )
efgred.d  |-  D  =  ( W  \  U_ x  e.  W  ran  ( T `  x ) )
efgred.s  |-  S  =  ( m  e.  {
t  e.  (Word  W  \  { (/) } )  |  ( ( t ` 
0 )  e.  D  /\  A. k  e.  ( 1..^ ( # `  t
) ) ( t `
 k )  e. 
ran  ( T `  ( t `  (
k  -  1 ) ) ) ) } 
|->  ( m `  (
( # `  m )  -  1 ) ) )
efgredlem.1  |-  ( ph  ->  A. a  e.  dom  S A. b  e.  dom  S ( ( # `  ( S `  a )
)  <  ( # `  ( S `  A )
)  ->  ( ( S `  a )  =  ( S `  b )  ->  (
a `  0 )  =  ( b ` 
0 ) ) ) )
efgredlem.2  |-  ( ph  ->  A  e.  dom  S
)
efgredlem.3  |-  ( ph  ->  B  e.  dom  S
)
efgredlem.4  |-  ( ph  ->  ( S `  A
)  =  ( S `
 B ) )
efgredlem.5  |-  ( ph  ->  -.  ( A ` 
0 )  =  ( B `  0 ) )
efgredlemb.k  |-  K  =  ( ( ( # `  A )  -  1 )  -  1 )
efgredlemb.l  |-  L  =  ( ( ( # `  B )  -  1 )  -  1 )
Assertion
Ref Expression
efgredlemf  |-  ( ph  ->  ( ( A `  K )  e.  W  /\  ( B `  L
)  e.  W ) )
Distinct variable groups:    a, b, A    y, a, z, b    L, a, b    K, a, b    t, n, v, w, y, z    m, a, n, t, v, w, x, M, b    k,
a, T, b, m, t, x    W, a, b    k, n, v, w, y, z, W, m, t, x    .~ , a,
b, m, t, x, y, z    B, a, b    S, a, b    I,
a, b, m, n, t, v, w, x, y, z    D, a, b, m, t
Allowed substitution hints:    ph( x, y, z, w, v, t, k, m, n, a, b)    A( x, y, z, w, v, t, k, m, n)    B( x, y, z, w, v, t, k, m, n)    D( x, y, z, w, v, k, n)    .~ ( w, v, k, n)    S( x, y, z, w, v, t, k, m, n)    T( y, z, w, v, n)    I( k)    K( x, y, z, w, v, t, k, m, n)    L( x, y, z, w, v, t, k, m, n)    M( y, z, k)

Proof of Theorem efgredlemf
Dummy variable  i is distinct from all other variables.
StepHypRef Expression
1 efgredlem.2 . . . . . 6  |-  ( ph  ->  A  e.  dom  S
)
2 efgval.w . . . . . . . 8  |-  W  =  (  _I  ` Word  ( I  X.  2o ) )
3 efgval.r . . . . . . . 8  |-  .~  =  ( ~FG  `  I )
4 efgval2.m . . . . . . . 8  |-  M  =  ( y  e.  I ,  z  e.  2o  |->  <. y ,  ( 1o 
\  z ) >.
)
5 efgval2.t . . . . . . . 8  |-  T  =  ( v  e.  W  |->  ( n  e.  ( 0 ... ( # `  v ) ) ,  w  e.  ( I  X.  2o )  |->  ( v splice  <. n ,  n ,  <" w ( M `  w ) "> >. )
) )
6 efgred.d . . . . . . . 8  |-  D  =  ( W  \  U_ x  e.  W  ran  ( T `  x ) )
7 efgred.s . . . . . . . 8  |-  S  =  ( m  e.  {
t  e.  (Word  W  \  { (/) } )  |  ( ( t ` 
0 )  e.  D  /\  A. k  e.  ( 1..^ ( # `  t
) ) ( t `
 k )  e. 
ran  ( T `  ( t `  (
k  -  1 ) ) ) ) } 
|->  ( m `  (
( # `  m )  -  1 ) ) )
82, 3, 4, 5, 6, 7efgsdm 16539 . . . . . . 7  |-  ( A  e.  dom  S  <->  ( A  e.  (Word  W  \  { (/)
} )  /\  ( A `  0 )  e.  D  /\  A. i  e.  ( 1..^ ( # `  A ) ) ( A `  i )  e.  ran  ( T `
 ( A `  ( i  -  1 ) ) ) ) )
98simp1bi 1006 . . . . . 6  |-  ( A  e.  dom  S  ->  A  e.  (Word  W  \  { (/) } ) )
101, 9syl 16 . . . . 5  |-  ( ph  ->  A  e.  (Word  W  \  { (/) } ) )
1110eldifad 3483 . . . 4  |-  ( ph  ->  A  e. Word  W )
12 wrdf 12508 . . . 4  |-  ( A  e. Word  W  ->  A : ( 0..^ (
# `  A )
) --> W )
1311, 12syl 16 . . 3  |-  ( ph  ->  A : ( 0..^ ( # `  A
) ) --> W )
14 fzossfz 11805 . . . . 5  |-  ( 0..^ ( ( # `  A
)  -  1 ) )  C_  ( 0 ... ( ( # `  A )  -  1 ) )
15 lencl 12517 . . . . . . . 8  |-  ( A  e. Word  W  ->  ( # `
 A )  e. 
NN0 )
1611, 15syl 16 . . . . . . 7  |-  ( ph  ->  ( # `  A
)  e.  NN0 )
1716nn0zd 10955 . . . . . 6  |-  ( ph  ->  ( # `  A
)  e.  ZZ )
18 fzoval 11789 . . . . . 6  |-  ( (
# `  A )  e.  ZZ  ->  ( 0..^ ( # `  A
) )  =  ( 0 ... ( (
# `  A )  -  1 ) ) )
1917, 18syl 16 . . . . 5  |-  ( ph  ->  ( 0..^ ( # `  A ) )  =  ( 0 ... (
( # `  A )  -  1 ) ) )
2014, 19syl5sseqr 3548 . . . 4  |-  ( ph  ->  ( 0..^ ( (
# `  A )  -  1 ) ) 
C_  ( 0..^ (
# `  A )
) )
21 efgredlemb.k . . . . 5  |-  K  =  ( ( ( # `  A )  -  1 )  -  1 )
22 efgredlem.1 . . . . . . . 8  |-  ( ph  ->  A. a  e.  dom  S A. b  e.  dom  S ( ( # `  ( S `  a )
)  <  ( # `  ( S `  A )
)  ->  ( ( S `  a )  =  ( S `  b )  ->  (
a `  0 )  =  ( b ` 
0 ) ) ) )
23 efgredlem.3 . . . . . . . 8  |-  ( ph  ->  B  e.  dom  S
)
24 efgredlem.4 . . . . . . . 8  |-  ( ph  ->  ( S `  A
)  =  ( S `
 B ) )
25 efgredlem.5 . . . . . . . 8  |-  ( ph  ->  -.  ( A ` 
0 )  =  ( B `  0 ) )
262, 3, 4, 5, 6, 7, 22, 1, 23, 24, 25efgredlema 16549 . . . . . . 7  |-  ( ph  ->  ( ( ( # `  A )  -  1 )  e.  NN  /\  ( ( # `  B
)  -  1 )  e.  NN ) )
2726simpld 459 . . . . . 6  |-  ( ph  ->  ( ( # `  A
)  -  1 )  e.  NN )
28 fzo0end 11863 . . . . . 6  |-  ( ( ( # `  A
)  -  1 )  e.  NN  ->  (
( ( # `  A
)  -  1 )  -  1 )  e.  ( 0..^ ( (
# `  A )  -  1 ) ) )
2927, 28syl 16 . . . . 5  |-  ( ph  ->  ( ( ( # `  A )  -  1 )  -  1 )  e.  ( 0..^ ( ( # `  A
)  -  1 ) ) )
3021, 29syl5eqel 2554 . . . 4  |-  ( ph  ->  K  e.  ( 0..^ ( ( # `  A
)  -  1 ) ) )
3120, 30sseldd 3500 . . 3  |-  ( ph  ->  K  e.  ( 0..^ ( # `  A
) ) )
3213, 31ffvelrnd 6015 . 2  |-  ( ph  ->  ( A `  K
)  e.  W )
332, 3, 4, 5, 6, 7efgsdm 16539 . . . . . . 7  |-  ( B  e.  dom  S  <->  ( B  e.  (Word  W  \  { (/)
} )  /\  ( B `  0 )  e.  D  /\  A. i  e.  ( 1..^ ( # `  B ) ) ( B `  i )  e.  ran  ( T `
 ( B `  ( i  -  1 ) ) ) ) )
3433simp1bi 1006 . . . . . 6  |-  ( B  e.  dom  S  ->  B  e.  (Word  W  \  { (/) } ) )
3523, 34syl 16 . . . . 5  |-  ( ph  ->  B  e.  (Word  W  \  { (/) } ) )
3635eldifad 3483 . . . 4  |-  ( ph  ->  B  e. Word  W )
37 wrdf 12508 . . . 4  |-  ( B  e. Word  W  ->  B : ( 0..^ (
# `  B )
) --> W )
3836, 37syl 16 . . 3  |-  ( ph  ->  B : ( 0..^ ( # `  B
) ) --> W )
39 fzossfz 11805 . . . . 5  |-  ( 0..^ ( ( # `  B
)  -  1 ) )  C_  ( 0 ... ( ( # `  B )  -  1 ) )
40 lencl 12517 . . . . . . . 8  |-  ( B  e. Word  W  ->  ( # `
 B )  e. 
NN0 )
4136, 40syl 16 . . . . . . 7  |-  ( ph  ->  ( # `  B
)  e.  NN0 )
4241nn0zd 10955 . . . . . 6  |-  ( ph  ->  ( # `  B
)  e.  ZZ )
43 fzoval 11789 . . . . . 6  |-  ( (
# `  B )  e.  ZZ  ->  ( 0..^ ( # `  B
) )  =  ( 0 ... ( (
# `  B )  -  1 ) ) )
4442, 43syl 16 . . . . 5  |-  ( ph  ->  ( 0..^ ( # `  B ) )  =  ( 0 ... (
( # `  B )  -  1 ) ) )
4539, 44syl5sseqr 3548 . . . 4  |-  ( ph  ->  ( 0..^ ( (
# `  B )  -  1 ) ) 
C_  ( 0..^ (
# `  B )
) )
46 efgredlemb.l . . . . 5  |-  L  =  ( ( ( # `  B )  -  1 )  -  1 )
4726simprd 463 . . . . . 6  |-  ( ph  ->  ( ( # `  B
)  -  1 )  e.  NN )
48 fzo0end 11863 . . . . . 6  |-  ( ( ( # `  B
)  -  1 )  e.  NN  ->  (
( ( # `  B
)  -  1 )  -  1 )  e.  ( 0..^ ( (
# `  B )  -  1 ) ) )
4947, 48syl 16 . . . . 5  |-  ( ph  ->  ( ( ( # `  B )  -  1 )  -  1 )  e.  ( 0..^ ( ( # `  B
)  -  1 ) ) )
5046, 49syl5eqel 2554 . . . 4  |-  ( ph  ->  L  e.  ( 0..^ ( ( # `  B
)  -  1 ) ) )
5145, 50sseldd 3500 . . 3  |-  ( ph  ->  L  e.  ( 0..^ ( # `  B
) ) )
5238, 51ffvelrnd 6015 . 2  |-  ( ph  ->  ( B `  L
)  e.  W )
5332, 52jca 532 1  |-  ( ph  ->  ( ( A `  K )  e.  W  /\  ( B `  L
)  e.  W ) )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 369    = wceq 1374    e. wcel 1762   A.wral 2809   {crab 2813    \ cdif 3468   (/)c0 3780   {csn 4022   <.cop 4028   <.cotp 4030   U_ciun 4320   class class class wbr 4442    |-> cmpt 4500    _I cid 4785    X. cxp 4992   dom cdm 4994   ran crn 4995   -->wf 5577   ` cfv 5581  (class class class)co 6277    |-> cmpt2 6279   1oc1o 7115   2oc2o 7116   0cc0 9483   1c1 9484    < clt 9619    - cmin 9796   NNcn 10527   NN0cn0 10786   ZZcz 10855   ...cfz 11663  ..^cfzo 11783   #chash 12362  Word cword 12489   splice csplice 12494   <"cs2 12758   ~FG cefg 16515
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 1963  ax-ext 2440  ax-rep 4553  ax-sep 4563  ax-nul 4571  ax-pow 4620  ax-pr 4681  ax-un 6569  ax-cnex 9539  ax-resscn 9540  ax-1cn 9541  ax-icn 9542  ax-addcl 9543  ax-addrcl 9544  ax-mulcl 9545  ax-mulrcl 9546  ax-mulcom 9547  ax-addass 9548  ax-mulass 9549  ax-distr 9550  ax-i2m1 9551  ax-1ne0 9552  ax-1rid 9553  ax-rnegex 9554  ax-rrecex 9555  ax-cnre 9556  ax-pre-lttri 9557  ax-pre-lttrn 9558  ax-pre-ltadd 9559  ax-pre-mulgt0 9560
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 2274  df-mo 2275  df-clab 2448  df-cleq 2454  df-clel 2457  df-nfc 2612  df-ne 2659  df-nel 2660  df-ral 2814  df-rex 2815  df-reu 2816  df-rab 2818  df-v 3110  df-sbc 3327  df-csb 3431  df-dif 3474  df-un 3476  df-in 3478  df-ss 3485  df-pss 3487  df-nul 3781  df-if 3935  df-pw 4007  df-sn 4023  df-pr 4025  df-tp 4027  df-op 4029  df-uni 4241  df-int 4278  df-iun 4322  df-br 4443  df-opab 4501  df-mpt 4502  df-tr 4536  df-eprel 4786  df-id 4790  df-po 4795  df-so 4796  df-fr 4833  df-we 4835  df-ord 4876  df-on 4877  df-lim 4878  df-suc 4879  df-xp 5000  df-rel 5001  df-cnv 5002  df-co 5003  df-dm 5004  df-rn 5005  df-res 5006  df-ima 5007  df-iota 5544  df-fun 5583  df-fn 5584  df-f 5585  df-f1 5586  df-fo 5587  df-f1o 5588  df-fv 5589  df-riota 6238  df-ov 6280  df-oprab 6281  df-mpt2 6282  df-om 6674  df-1st 6776  df-2nd 6777  df-recs 7034  df-rdg 7068  df-1o 7122  df-oadd 7126  df-er 7303  df-en 7509  df-dom 7510  df-sdom 7511  df-fin 7512  df-card 8311  df-pnf 9621  df-mnf 9622  df-xr 9623  df-ltxr 9624  df-le 9625  df-sub 9798  df-neg 9799  df-nn 10528  df-2 10585  df-n0 10787  df-z 10856  df-uz 11074  df-fz 11664  df-fzo 11784  df-hash 12363  df-word 12497
This theorem is referenced by:  efgredlemg  16551  efgredleme  16552
  Copyright terms: Public domain W3C validator