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

Theorem efgredlemb 16553
Description: The reduced word that forms the base of the sequence in efgsval 16538 is uniquely determined, given the ending representation. (Contributed by Mario Carneiro, 30-Sep-2015.)
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 )
efgredlemb.p  |-  ( ph  ->  P  e.  ( 0 ... ( # `  ( A `  K )
) ) )
efgredlemb.q  |-  ( ph  ->  Q  e.  ( 0 ... ( # `  ( B `  L )
) ) )
efgredlemb.u  |-  ( ph  ->  U  e.  ( I  X.  2o ) )
efgredlemb.v  |-  ( ph  ->  V  e.  ( I  X.  2o ) )
efgredlemb.6  |-  ( ph  ->  ( S `  A
)  =  ( P ( T `  ( A `  K )
) U ) )
efgredlemb.7  |-  ( ph  ->  ( S `  B
)  =  ( Q ( T `  ( B `  L )
) V ) )
efgredlemb.8  |-  ( ph  ->  -.  ( A `  K )  =  ( B `  L ) )
Assertion
Ref Expression
efgredlemb  |-  -.  ph
Distinct variable groups:    a, b, A    y, a, z, b    L, a, b    K, a, b    t, n, v, w, y, z, P   
m, a, n, t, v, w, x, M, b    U, n, v, w, y, z    k, a, T, b, m, t, x    n, V, v, w, y, z    Q, n, t, v, w, y, z    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)    P( x, k, m, a, b)    Q( x, k, m, a, b)    .~ ( w, v, k, n)    S( x, y, z, w, v, t, k, m, n)    T( y, z, w, v, n)    U( x, t, k, m, a, b)    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)    V( x, t, k, m, a, b)

Proof of Theorem efgredlemb
StepHypRef Expression
1 efgval.w . . . . 5  |-  W  =  (  _I  ` Word  ( I  X.  2o ) )
2 efgval.r . . . . 5  |-  .~  =  ( ~FG  `  I )
3 efgval2.m . . . . 5  |-  M  =  ( y  e.  I ,  z  e.  2o  |->  <. y ,  ( 1o 
\  z ) >.
)
4 efgval2.t . . . . 5  |-  T  =  ( v  e.  W  |->  ( n  e.  ( 0 ... ( # `  v ) ) ,  w  e.  ( I  X.  2o )  |->  ( v splice  <. n ,  n ,  <" w ( M `  w ) "> >. )
) )
5 efgred.d . . . . 5  |-  D  =  ( W  \  U_ x  e.  W  ran  ( T `  x ) )
6 efgred.s . . . . 5  |-  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 ) ) )
7 efgredlem.1 . . . . . 6  |-  ( ph  ->  A. a  e.  dom  S A. b  e.  dom  S ( ( # `  ( S `  a )
)  <  ( # `  ( S `  A )
)  ->  ( ( S `  a )  =  ( S `  b )  ->  (
a `  0 )  =  ( b ` 
0 ) ) ) )
8 efgredlem.4 . . . . . . 7  |-  ( ph  ->  ( S `  A
)  =  ( S `
 B ) )
9 fveq2 5857 . . . . . . . . . 10  |-  ( ( S `  A )  =  ( S `  B )  ->  ( # `
 ( S `  A ) )  =  ( # `  ( S `  B )
) )
109breq2d 4452 . . . . . . . . 9  |-  ( ( S `  A )  =  ( S `  B )  ->  (
( # `  ( S `
 a ) )  <  ( # `  ( S `  A )
)  <->  ( # `  ( S `  a )
)  <  ( # `  ( S `  B )
) ) )
1110imbi1d 317 . . . . . . . 8  |-  ( ( S `  A )  =  ( S `  B )  ->  (
( ( # `  ( S `  a )
)  <  ( # `  ( S `  A )
)  ->  ( ( S `  a )  =  ( S `  b )  ->  (
a `  0 )  =  ( b ` 
0 ) ) )  <-> 
( ( # `  ( S `  a )
)  <  ( # `  ( S `  B )
)  ->  ( ( S `  a )  =  ( S `  b )  ->  (
a `  0 )  =  ( b ` 
0 ) ) ) ) )
12112ralbidv 2901 . . . . . . 7  |-  ( ( S `  A )  =  ( S `  B )  ->  ( A. a  e.  dom  S A. b  e.  dom  S ( ( # `  ( S `  a )
)  <  ( # `  ( S `  A )
)  ->  ( ( S `  a )  =  ( S `  b )  ->  (
a `  0 )  =  ( b ` 
0 ) ) )  <->  A. a  e.  dom  S A. b  e.  dom  S ( ( # `  ( S `  a )
)  <  ( # `  ( S `  B )
)  ->  ( ( S `  a )  =  ( S `  b )  ->  (
a `  0 )  =  ( b ` 
0 ) ) ) ) )
138, 12syl 16 . . . . . 6  |-  ( ph  ->  ( A. a  e. 
dom  S A. b  e.  dom  S ( (
# `  ( S `  a ) )  < 
( # `  ( S `
 A ) )  ->  ( ( S `
 a )  =  ( S `  b
)  ->  ( a `  0 )  =  ( b `  0
) ) )  <->  A. a  e.  dom  S A. b  e.  dom  S ( (
# `  ( S `  a ) )  < 
( # `  ( S `
 B ) )  ->  ( ( S `
 a )  =  ( S `  b
)  ->  ( a `  0 )  =  ( b `  0
) ) ) ) )
147, 13mpbid 210 . . . . 5  |-  ( ph  ->  A. a  e.  dom  S A. b  e.  dom  S ( ( # `  ( S `  a )
)  <  ( # `  ( S `  B )
)  ->  ( ( S `  a )  =  ( S `  b )  ->  (
a `  0 )  =  ( b ` 
0 ) ) ) )
15 efgredlem.3 . . . . 5  |-  ( ph  ->  B  e.  dom  S
)
16 efgredlem.2 . . . . 5  |-  ( ph  ->  A  e.  dom  S
)
178eqcomd 2468 . . . . 5  |-  ( ph  ->  ( S `  B
)  =  ( S `
 A ) )
18 efgredlem.5 . . . . . 6  |-  ( ph  ->  -.  ( A ` 
0 )  =  ( B `  0 ) )
19 eqcom 2469 . . . . . 6  |-  ( ( A `  0 )  =  ( B ` 
0 )  <->  ( B `  0 )  =  ( A `  0
) )
2018, 19sylnib 304 . . . . 5  |-  ( ph  ->  -.  ( B ` 
0 )  =  ( A `  0 ) )
21 efgredlemb.l . . . . 5  |-  L  =  ( ( ( # `  B )  -  1 )  -  1 )
22 efgredlemb.k . . . . 5  |-  K  =  ( ( ( # `  A )  -  1 )  -  1 )
23 efgredlemb.q . . . . 5  |-  ( ph  ->  Q  e.  ( 0 ... ( # `  ( B `  L )
) ) )
24 efgredlemb.p . . . . 5  |-  ( ph  ->  P  e.  ( 0 ... ( # `  ( A `  K )
) ) )
25 efgredlemb.v . . . . 5  |-  ( ph  ->  V  e.  ( I  X.  2o ) )
26 efgredlemb.u . . . . 5  |-  ( ph  ->  U  e.  ( I  X.  2o ) )
27 efgredlemb.7 . . . . 5  |-  ( ph  ->  ( S `  B
)  =  ( Q ( T `  ( B `  L )
) V ) )
28 efgredlemb.6 . . . . 5  |-  ( ph  ->  ( S `  A
)  =  ( P ( T `  ( A `  K )
) U ) )
29 efgredlemb.8 . . . . . 6  |-  ( ph  ->  -.  ( A `  K )  =  ( B `  L ) )
30 eqcom 2469 . . . . . 6  |-  ( ( A `  K )  =  ( B `  L )  <->  ( B `  L )  =  ( A `  K ) )
3129, 30sylnib 304 . . . . 5  |-  ( ph  ->  -.  ( B `  L )  =  ( A `  K ) )
321, 2, 3, 4, 5, 6, 14, 15, 16, 17, 20, 21, 22, 23, 24, 25, 26, 27, 28, 31efgredlemc 16552 . . . 4  |-  ( ph  ->  ( Q  e.  (
ZZ>= `  P )  -> 
( B `  0
)  =  ( A `
 0 ) ) )
3332, 19syl6ibr 227 . . 3  |-  ( ph  ->  ( Q  e.  (
ZZ>= `  P )  -> 
( A `  0
)  =  ( B `
 0 ) ) )
341, 2, 3, 4, 5, 6, 7, 16, 15, 8, 18, 22, 21, 24, 23, 26, 25, 28, 27, 29efgredlemc 16552 . . 3  |-  ( ph  ->  ( P  e.  (
ZZ>= `  Q )  -> 
( A `  0
)  =  ( B `
 0 ) ) )
35 elfzelz 11677 . . . . 5  |-  ( P  e.  ( 0 ... ( # `  ( A `  K )
) )  ->  P  e.  ZZ )
3624, 35syl 16 . . . 4  |-  ( ph  ->  P  e.  ZZ )
37 elfzelz 11677 . . . . 5  |-  ( Q  e.  ( 0 ... ( # `  ( B `  L )
) )  ->  Q  e.  ZZ )
3823, 37syl 16 . . . 4  |-  ( ph  ->  Q  e.  ZZ )
39 uztric 11092 . . . 4  |-  ( ( P  e.  ZZ  /\  Q  e.  ZZ )  ->  ( Q  e.  (
ZZ>= `  P )  \/  P  e.  ( ZZ>= `  Q ) ) )
4036, 38, 39syl2anc 661 . . 3  |-  ( ph  ->  ( Q  e.  (
ZZ>= `  P )  \/  P  e.  ( ZZ>= `  Q ) ) )
4133, 34, 40mpjaod 381 . 2  |-  ( ph  ->  ( A `  0
)  =  ( B `
 0 ) )
4241, 18pm2.65i 173 1  |-  -.  ph
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 184    \/ wo 368    /\ wa 369    = wceq 1374    e. wcel 1762   A.wral 2807   {crab 2811    \ cdif 3466   (/)c0 3778   {csn 4020   <.cop 4026   <.cotp 4028   U_ciun 4318   class class class wbr 4440    |-> cmpt 4498    _I cid 4783    X. cxp 4990   dom cdm 4992   ran crn 4993   ` cfv 5579  (class class class)co 6275    |-> cmpt2 6277   1oc1o 7113   2oc2o 7114   0cc0 9481   1c1 9482    < clt 9617    - cmin 9794   ZZcz 10853   ZZ>=cuz 11071   ...cfz 11661  ..^cfzo 11781   #chash 12360  Word cword 12487   splice csplice 12492   <"cs2 12756   ~FG cefg 16513
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-ot 4029  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-2o 7121  df-oadd 7124  df-er 7301  df-map 7412  df-pm 7413  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-2 10583  df-n0 10785  df-z 10854  df-uz 11072  df-rp 11210  df-fz 11662  df-fzo 11782  df-hash 12361  df-word 12495  df-concat 12497  df-s1 12498  df-substr 12499  df-splice 12500  df-s2 12763
This theorem is referenced by:  efgredlem  16554
  Copyright terms: Public domain W3C validator