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

Theorem efgsdmi 17072
Description: Property of the last link in the chain of extensions. (Contributed by Mario Carneiro, 29-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 ) ) )
Assertion
Ref Expression
efgsdmi  |-  ( ( F  e.  dom  S  /\  ( ( # `  F
)  -  1 )  e.  NN )  -> 
( S `  F
)  e.  ran  ( T `  ( F `  ( ( ( # `  F )  -  1 )  -  1 ) ) ) )
Distinct variable groups:    y, z    t, n, v, w, y, z, m, x    m, M    x, n, M, t, v, w    k, m, t, x, T    k, n, v, w, y, z, W, m, t, x    .~ , m, t, x, y, z    m, I, n, t, v, w, x, y, z    D, m, t
Allowed substitution hints:    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)    F( x, y, z, w, v, t, k, m, n)    I( k)    M( y, z, k)

Proof of Theorem efgsdmi
Dummy variable  i is distinct from all other variables.
StepHypRef Expression
1 efgval.w . . . 4  |-  W  =  (  _I  ` Word  ( I  X.  2o ) )
2 efgval.r . . . 4  |-  .~  =  ( ~FG  `  I )
3 efgval2.m . . . 4  |-  M  =  ( y  e.  I ,  z  e.  2o  |->  <. y ,  ( 1o 
\  z ) >.
)
4 efgval2.t . . . 4  |-  T  =  ( v  e.  W  |->  ( n  e.  ( 0 ... ( # `  v ) ) ,  w  e.  ( I  X.  2o )  |->  ( v splice  <. n ,  n ,  <" w ( M `  w ) "> >. )
) )
5 efgred.d . . . 4  |-  D  =  ( W  \  U_ x  e.  W  ran  ( T `  x ) )
6 efgred.s . . . 4  |-  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 ) ) )
71, 2, 3, 4, 5, 6efgsval 17071 . . 3  |-  ( F  e.  dom  S  -> 
( S `  F
)  =  ( F `
 ( ( # `  F )  -  1 ) ) )
87adantr 463 . 2  |-  ( ( F  e.  dom  S  /\  ( ( # `  F
)  -  1 )  e.  NN )  -> 
( S `  F
)  =  ( F `
 ( ( # `  F )  -  1 ) ) )
9 simpr 459 . . . . . . 7  |-  ( ( F  e.  dom  S  /\  ( ( # `  F
)  -  1 )  e.  NN )  -> 
( ( # `  F
)  -  1 )  e.  NN )
10 nnuz 11161 . . . . . . 7  |-  NN  =  ( ZZ>= `  1 )
119, 10syl6eleq 2500 . . . . . 6  |-  ( ( F  e.  dom  S  /\  ( ( # `  F
)  -  1 )  e.  NN )  -> 
( ( # `  F
)  -  1 )  e.  ( ZZ>= `  1
) )
12 eluzfz1 11745 . . . . . 6  |-  ( ( ( # `  F
)  -  1 )  e.  ( ZZ>= `  1
)  ->  1  e.  ( 1 ... (
( # `  F )  -  1 ) ) )
1311, 12syl 17 . . . . 5  |-  ( ( F  e.  dom  S  /\  ( ( # `  F
)  -  1 )  e.  NN )  -> 
1  e.  ( 1 ... ( ( # `  F )  -  1 ) ) )
141, 2, 3, 4, 5, 6efgsdm 17070 . . . . . . . . 9  |-  ( F  e.  dom  S  <->  ( F  e.  (Word  W  \  { (/)
} )  /\  ( F `  0 )  e.  D  /\  A. i  e.  ( 1..^ ( # `  F ) ) ( F `  i )  e.  ran  ( T `
 ( F `  ( i  -  1 ) ) ) ) )
1514simp1bi 1012 . . . . . . . 8  |-  ( F  e.  dom  S  ->  F  e.  (Word  W  \  { (/) } ) )
1615adantr 463 . . . . . . 7  |-  ( ( F  e.  dom  S  /\  ( ( # `  F
)  -  1 )  e.  NN )  ->  F  e.  (Word  W  \  { (/) } ) )
1716eldifad 3425 . . . . . 6  |-  ( ( F  e.  dom  S  /\  ( ( # `  F
)  -  1 )  e.  NN )  ->  F  e. Word  W )
18 lencl 12612 . . . . . 6  |-  ( F  e. Word  W  ->  ( # `
 F )  e. 
NN0 )
19 nn0z 10927 . . . . . 6  |-  ( (
# `  F )  e.  NN0  ->  ( # `  F
)  e.  ZZ )
20 fzoval 11858 . . . . . 6  |-  ( (
# `  F )  e.  ZZ  ->  ( 1..^ ( # `  F
) )  =  ( 1 ... ( (
# `  F )  -  1 ) ) )
2117, 18, 19, 204syl 21 . . . . 5  |-  ( ( F  e.  dom  S  /\  ( ( # `  F
)  -  1 )  e.  NN )  -> 
( 1..^ ( # `  F ) )  =  ( 1 ... (
( # `  F )  -  1 ) ) )
2213, 21eleqtrrd 2493 . . . 4  |-  ( ( F  e.  dom  S  /\  ( ( # `  F
)  -  1 )  e.  NN )  -> 
1  e.  ( 1..^ ( # `  F
) ) )
23 fzoend 11938 . . . 4  |-  ( 1  e.  ( 1..^ (
# `  F )
)  ->  ( ( # `
 F )  - 
1 )  e.  ( 1..^ ( # `  F
) ) )
2422, 23syl 17 . . 3  |-  ( ( F  e.  dom  S  /\  ( ( # `  F
)  -  1 )  e.  NN )  -> 
( ( # `  F
)  -  1 )  e.  ( 1..^ (
# `  F )
) )
2514simp3bi 1014 . . . 4  |-  ( F  e.  dom  S  ->  A. i  e.  (
1..^ ( # `  F
) ) ( F `
 i )  e. 
ran  ( T `  ( F `  ( i  -  1 ) ) ) )
2625adantr 463 . . 3  |-  ( ( F  e.  dom  S  /\  ( ( # `  F
)  -  1 )  e.  NN )  ->  A. i  e.  (
1..^ ( # `  F
) ) ( F `
 i )  e. 
ran  ( T `  ( F `  ( i  -  1 ) ) ) )
27 fveq2 5848 . . . . 5  |-  ( i  =  ( ( # `  F )  -  1 )  ->  ( F `  i )  =  ( F `  ( (
# `  F )  -  1 ) ) )
28 oveq1 6284 . . . . . . . 8  |-  ( i  =  ( ( # `  F )  -  1 )  ->  ( i  -  1 )  =  ( ( ( # `  F )  -  1 )  -  1 ) )
2928fveq2d 5852 . . . . . . 7  |-  ( i  =  ( ( # `  F )  -  1 )  ->  ( F `  ( i  -  1 ) )  =  ( F `  ( ( ( # `  F
)  -  1 )  -  1 ) ) )
3029fveq2d 5852 . . . . . 6  |-  ( i  =  ( ( # `  F )  -  1 )  ->  ( T `  ( F `  (
i  -  1 ) ) )  =  ( T `  ( F `
 ( ( (
# `  F )  -  1 )  - 
1 ) ) ) )
3130rneqd 5050 . . . . 5  |-  ( i  =  ( ( # `  F )  -  1 )  ->  ran  ( T `
 ( F `  ( i  -  1 ) ) )  =  ran  ( T `  ( F `  ( ( ( # `  F
)  -  1 )  -  1 ) ) ) )
3227, 31eleq12d 2484 . . . 4  |-  ( i  =  ( ( # `  F )  -  1 )  ->  ( ( F `  i )  e.  ran  ( T `  ( F `  ( i  -  1 ) ) )  <->  ( F `  ( ( # `  F
)  -  1 ) )  e.  ran  ( T `  ( F `  ( ( ( # `  F )  -  1 )  -  1 ) ) ) ) )
3332rspcv 3155 . . 3  |-  ( ( ( # `  F
)  -  1 )  e.  ( 1..^ (
# `  F )
)  ->  ( A. i  e.  ( 1..^ ( # `  F
) ) ( F `
 i )  e. 
ran  ( T `  ( F `  ( i  -  1 ) ) )  ->  ( F `  ( ( # `  F
)  -  1 ) )  e.  ran  ( T `  ( F `  ( ( ( # `  F )  -  1 )  -  1 ) ) ) ) )
3424, 26, 33sylc 59 . 2  |-  ( ( F  e.  dom  S  /\  ( ( # `  F
)  -  1 )  e.  NN )  -> 
( F `  (
( # `  F )  -  1 ) )  e.  ran  ( T `
 ( F `  ( ( ( # `  F )  -  1 )  -  1 ) ) ) )
358, 34eqeltrd 2490 1  |-  ( ( F  e.  dom  S  /\  ( ( # `  F
)  -  1 )  e.  NN )  -> 
( S `  F
)  e.  ran  ( T `  ( F `  ( ( ( # `  F )  -  1 )  -  1 ) ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 367    = wceq 1405    e. wcel 1842   A.wral 2753   {crab 2757    \ cdif 3410   (/)c0 3737   {csn 3971   <.cop 3977   <.cotp 3979   U_ciun 4270    |-> cmpt 4452    _I cid 4732    X. cxp 4820   dom cdm 4822   ran crn 4823   ` cfv 5568  (class class class)co 6277    |-> cmpt2 6279   1oc1o 7159   2oc2o 7160   0cc0 9521   1c1 9522    - cmin 9840   NNcn 10575   NN0cn0 10835   ZZcz 10904   ZZ>=cuz 11126   ...cfz 11724  ..^cfzo 11852   #chash 12450  Word cword 12581   splice csplice 12586   <"cs2 12860   ~FG cefg 17046
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1639  ax-4 1652  ax-5 1725  ax-6 1771  ax-7 1814  ax-8 1844  ax-9 1846  ax-10 1861  ax-11 1866  ax-12 1878  ax-13 2026  ax-ext 2380  ax-rep 4506  ax-sep 4516  ax-nul 4524  ax-pow 4571  ax-pr 4629  ax-un 6573  ax-cnex 9577  ax-resscn 9578  ax-1cn 9579  ax-icn 9580  ax-addcl 9581  ax-addrcl 9582  ax-mulcl 9583  ax-mulrcl 9584  ax-mulcom 9585  ax-addass 9586  ax-mulass 9587  ax-distr 9588  ax-i2m1 9589  ax-1ne0 9590  ax-1rid 9591  ax-rnegex 9592  ax-rrecex 9593  ax-cnre 9594  ax-pre-lttri 9595  ax-pre-lttrn 9596  ax-pre-ltadd 9597  ax-pre-mulgt0 9598
This theorem depends on definitions:  df-bi 185  df-or 368  df-an 369  df-3or 975  df-3an 976  df-tru 1408  df-ex 1634  df-nf 1638  df-sb 1764  df-eu 2242  df-mo 2243  df-clab 2388  df-cleq 2394  df-clel 2397  df-nfc 2552  df-ne 2600  df-nel 2601  df-ral 2758  df-rex 2759  df-reu 2760  df-rmo 2761  df-rab 2762  df-v 3060  df-sbc 3277  df-csb 3373  df-dif 3416  df-un 3418  df-in 3420  df-ss 3427  df-pss 3429  df-nul 3738  df-if 3885  df-pw 3956  df-sn 3972  df-pr 3974  df-tp 3976  df-op 3978  df-uni 4191  df-int 4227  df-iun 4272  df-br 4395  df-opab 4453  df-mpt 4454  df-tr 4489  df-eprel 4733  df-id 4737  df-po 4743  df-so 4744  df-fr 4781  df-we 4783  df-xp 4828  df-rel 4829  df-cnv 4830  df-co 4831  df-dm 4832  df-rn 4833  df-res 4834  df-ima 4835  df-pred 5366  df-ord 5412  df-on 5413  df-lim 5414  df-suc 5415  df-iota 5532  df-fun 5570  df-fn 5571  df-f 5572  df-f1 5573  df-fo 5574  df-f1o 5575  df-fv 5576  df-riota 6239  df-ov 6280  df-oprab 6281  df-mpt2 6282  df-om 6683  df-1st 6783  df-2nd 6784  df-wrecs 7012  df-recs 7074  df-rdg 7112  df-1o 7166  df-oadd 7170  df-er 7347  df-en 7554  df-dom 7555  df-sdom 7556  df-fin 7557  df-card 8351  df-cda 8579  df-pnf 9659  df-mnf 9660  df-xr 9661  df-ltxr 9662  df-le 9663  df-sub 9842  df-neg 9843  df-nn 10576  df-2 10634  df-n0 10836  df-z 10905  df-uz 11127  df-fz 11725  df-fzo 11853  df-hash 12451  df-word 12589
This theorem is referenced by:  efgs1b  17076  efgredlemg  17082  efgredlemd  17084  efgredlem  17087
  Copyright terms: Public domain W3C validator