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

Theorem efgtval 18136
Description: Value of the extension function, which maps a word (a representation of the group element as a sequence of elements and their inverses) to its direct extensions, defined as the original representation with an element and its inverse inserted somewhere in the string. (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 ) "> >. )
) )
Assertion
Ref Expression
efgtval  |-  ( ( X  e.  W  /\  N  e.  ( 0 ... ( # `  X
) )  /\  A  e.  ( I  X.  2o ) )  ->  ( N ( T `  X ) A )  =  ( X splice  <. N ,  N ,  <" A
( M `  A
) "> >. )
)
Distinct variable groups:    y, z    v, n, w, y, z   
n, M, v, w   
n, W, v, w, y, z    y,  .~ , z    n, I, v, w, y, z
Allowed substitution hints:    A( y, z, w, v, n)    .~ ( w, v, n)    T( y, z, w, v, n)    M( y, z)    N( y, z, w, v, n)    X( y, z, w, v, n)

Proof of Theorem efgtval
Dummy variables  a 
b are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 efgval.w . . . . . 6  |-  W  =  (  _I  ` Word  ( I  X.  2o ) )
2 efgval.r . . . . . 6  |-  .~  =  ( ~FG  `  I )
3 efgval2.m . . . . . 6  |-  M  =  ( y  e.  I ,  z  e.  2o  |->  <. y ,  ( 1o 
\  z ) >.
)
4 efgval2.t . . . . . 6  |-  T  =  ( v  e.  W  |->  ( n  e.  ( 0 ... ( # `  v ) ) ,  w  e.  ( I  X.  2o )  |->  ( v splice  <. n ,  n ,  <" w ( M `  w ) "> >. )
) )
51, 2, 3, 4efgtf 18135 . . . . 5  |-  ( X  e.  W  ->  (
( T `  X
)  =  ( a  e.  ( 0 ... ( # `  X
) ) ,  b  e.  ( I  X.  2o )  |->  ( X splice  <. a ,  a , 
<" b ( M `
 b ) "> >. ) )  /\  ( T `  X ) : ( ( 0 ... ( # `  X
) )  X.  (
I  X.  2o ) ) --> W ) )
65simpld 475 . . . 4  |-  ( X  e.  W  ->  ( T `  X )  =  ( a  e.  ( 0 ... ( # `
 X ) ) ,  b  e.  ( I  X.  2o ) 
|->  ( X splice  <. a ,  a ,  <" b ( M `  b ) "> >.
) ) )
76oveqd 6667 . . 3  |-  ( X  e.  W  ->  ( N ( T `  X ) A )  =  ( N ( a  e.  ( 0 ... ( # `  X
) ) ,  b  e.  ( I  X.  2o )  |->  ( X splice  <. a ,  a , 
<" b ( M `
 b ) "> >. ) ) A ) )
8 oteq1 4411 . . . . . 6  |-  ( a  =  N  ->  <. a ,  a ,  <" b ( M `  b ) "> >.  =  <. N ,  a ,  <" b ( M `  b ) "> >. )
9 oteq2 4412 . . . . . 6  |-  ( a  =  N  ->  <. N , 
a ,  <" b
( M `  b
) "> >.  =  <. N ,  N ,  <" b ( M `  b ) "> >.
)
108, 9eqtrd 2656 . . . . 5  |-  ( a  =  N  ->  <. a ,  a ,  <" b ( M `  b ) "> >.  =  <. N ,  N ,  <" b ( M `  b ) "> >. )
1110oveq2d 6666 . . . 4  |-  ( a  =  N  ->  ( X splice  <. a ,  a ,  <" b ( M `  b ) "> >. )  =  ( X splice  <. N ,  N ,  <" b
( M `  b
) "> >. )
)
12 id 22 . . . . . . 7  |-  ( b  =  A  ->  b  =  A )
13 fveq2 6191 . . . . . . 7  |-  ( b  =  A  ->  ( M `  b )  =  ( M `  A ) )
1412, 13s2eqd 13608 . . . . . 6  |-  ( b  =  A  ->  <" b
( M `  b
) ">  =  <" A ( M `
 A ) "> )
1514oteq3d 4416 . . . . 5  |-  ( b  =  A  ->  <. N ,  N ,  <" b
( M `  b
) "> >.  =  <. N ,  N ,  <" A ( M `  A ) "> >.
)
1615oveq2d 6666 . . . 4  |-  ( b  =  A  ->  ( X splice  <. N ,  N ,  <" b ( M `  b ) "> >. )  =  ( X splice  <. N ,  N ,  <" A
( M `  A
) "> >. )
)
17 eqid 2622 . . . 4  |-  ( a  e.  ( 0 ... ( # `  X
) ) ,  b  e.  ( I  X.  2o )  |->  ( X splice  <. a ,  a , 
<" b ( M `
 b ) "> >. ) )  =  ( a  e.  ( 0 ... ( # `  X ) ) ,  b  e.  ( I  X.  2o )  |->  ( X splice  <. a ,  a ,  <" b ( M `  b ) "> >. )
)
18 ovex 6678 . . . 4  |-  ( X splice  <. N ,  N ,  <" A ( M `
 A ) "> >. )  e.  _V
1911, 16, 17, 18ovmpt2 6796 . . 3  |-  ( ( N  e.  ( 0 ... ( # `  X
) )  /\  A  e.  ( I  X.  2o ) )  ->  ( N ( a  e.  ( 0 ... ( # `
 X ) ) ,  b  e.  ( I  X.  2o ) 
|->  ( X splice  <. a ,  a ,  <" b ( M `  b ) "> >.
) ) A )  =  ( X splice  <. N ,  N ,  <" A
( M `  A
) "> >. )
)
207, 19sylan9eq 2676 . 2  |-  ( ( X  e.  W  /\  ( N  e.  (
0 ... ( # `  X
) )  /\  A  e.  ( I  X.  2o ) ) )  -> 
( N ( T `
 X ) A )  =  ( X splice  <. N ,  N ,  <" A ( M `
 A ) "> >. ) )
21203impb 1260 1  |-  ( ( X  e.  W  /\  N  e.  ( 0 ... ( # `  X
) )  /\  A  e.  ( I  X.  2o ) )  ->  ( N ( T `  X ) A )  =  ( X splice  <. N ,  N ,  <" A
( M `  A
) "> >. )
)
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 384    /\ w3a 1037    = wceq 1483    e. wcel 1990    \ cdif 3571   <.cop 4183   <.cotp 4185    |-> cmpt 4729    _I cid 5023    X. cxp 5112   -->wf 5884   ` cfv 5888  (class class class)co 6650    |-> cmpt2 6652   1oc1o 7553   2oc2o 7554   0cc0 9936   ...cfz 12326   #chash 13117  Word cword 13291   splice csplice 13296   <"cs2 13586   ~FG cefg 18119
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-cnex 9992  ax-resscn 9993  ax-1cn 9994  ax-icn 9995  ax-addcl 9996  ax-addrcl 9997  ax-mulcl 9998  ax-mulrcl 9999  ax-mulcom 10000  ax-addass 10001  ax-mulass 10002  ax-distr 10003  ax-i2m1 10004  ax-1ne0 10005  ax-1rid 10006  ax-rnegex 10007  ax-rrecex 10008  ax-cnre 10009  ax-pre-lttri 10010  ax-pre-lttrn 10011  ax-pre-ltadd 10012  ax-pre-mulgt0 10013
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-nel 2898  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-ot 4186  df-uni 4437  df-int 4476  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-riota 6611  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-om 7066  df-1st 7168  df-2nd 7169  df-wrecs 7407  df-recs 7468  df-rdg 7506  df-1o 7560  df-2o 7561  df-oadd 7564  df-er 7742  df-map 7859  df-pm 7860  df-en 7956  df-dom 7957  df-sdom 7958  df-fin 7959  df-card 8765  df-pnf 10076  df-mnf 10077  df-xr 10078  df-ltxr 10079  df-le 10080  df-sub 10268  df-neg 10269  df-nn 11021  df-n0 11293  df-z 11378  df-uz 11688  df-fz 12327  df-fzo 12466  df-hash 13118  df-word 13299  df-concat 13301  df-s1 13302  df-substr 13303  df-splice 13304  df-s2 13593
This theorem is referenced by:  efginvrel2  18140  efgredleme  18156  efgredlemc  18158  efgcpbllemb  18168
  Copyright terms: Public domain W3C validator