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

Theorem efgrelexlema 16261
Description: If two words  A ,  B are related under the free group equivalence, then there exist two extension sequences  a ,  b such that  a ends at  A,  b ends at  B, and  a and  B have the same starting point. (Contributed by Mario Carneiro, 1-Oct-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 ) ) )
efgrelexlem.1  |-  L  =  { <. i ,  j
>.  |  E. c  e.  ( `' S " { i } ) E. d  e.  ( `' S " { j } ) ( c `
 0 )  =  ( d `  0
) }
Assertion
Ref Expression
efgrelexlema  |-  ( A L B  <->  E. a  e.  ( `' S " { A } ) E. b  e.  ( `' S " { B } ) ( a `
 0 )  =  ( b `  0
) )
Distinct variable groups:    a, b,
c, d, i, j, A    y, a, z, b    L, a, b    n, c, t, v, w, y, z    m, a, n, t, v, w, x, M, b, c, i, j    k, a, T, b, c, i, j, m, t, x    W, a, b, c    k, d, m, n, t, v, w, x, y, z, W, i, j    .~ , a, b, c, d, i, j, m, t, x, y, z    B, a, b, c, d, i, j    S, a, b, c, d, i, j    I,
a, b, c, i, j, m, n, t, v, w, x, y, z    D, a, b, c, d, i, j, m, t
Allowed substitution hints:    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, d)    I( k, d)    L( x, y, z, w, v, t, i, j, k, m, n, c, d)    M( y, z, k, d)

Proof of Theorem efgrelexlema
StepHypRef Expression
1 efgrelexlem.1 . . . 4  |-  L  =  { <. i ,  j
>.  |  E. c  e.  ( `' S " { i } ) E. d  e.  ( `' S " { j } ) ( c `
 0 )  =  ( d `  0
) }
21relopabi 4980 . . 3  |-  Rel  L
3 brrelex12 4891 . . 3  |-  ( ( Rel  L  /\  A L B )  ->  ( A  e.  _V  /\  B  e.  _V ) )
42, 3mpan 670 . 2  |-  ( A L B  ->  ( A  e.  _V  /\  B  e.  _V ) )
5 n0i 3657 . . . . . 6  |-  ( a  e.  ( `' S " { A } )  ->  -.  ( `' S " { A }
)  =  (/) )
6 snprc 3954 . . . . . . . 8  |-  ( -.  A  e.  _V  <->  { A }  =  (/) )
7 imaeq2 5180 . . . . . . . 8  |-  ( { A }  =  (/)  ->  ( `' S " { A } )  =  ( `' S " (/) ) )
86, 7sylbi 195 . . . . . . 7  |-  ( -.  A  e.  _V  ->  ( `' S " { A } )  =  ( `' S " (/) ) )
9 ima0 5199 . . . . . . 7  |-  ( `' S " (/) )  =  (/)
108, 9syl6eq 2491 . . . . . 6  |-  ( -.  A  e.  _V  ->  ( `' S " { A } )  =  (/) )
115, 10nsyl2 127 . . . . 5  |-  ( a  e.  ( `' S " { A } )  ->  A  e.  _V )
12 n0i 3657 . . . . . 6  |-  ( b  e.  ( `' S " { B } )  ->  -.  ( `' S " { B }
)  =  (/) )
13 snprc 3954 . . . . . . . 8  |-  ( -.  B  e.  _V  <->  { B }  =  (/) )
14 imaeq2 5180 . . . . . . . 8  |-  ( { B }  =  (/)  ->  ( `' S " { B } )  =  ( `' S " (/) ) )
1513, 14sylbi 195 . . . . . . 7  |-  ( -.  B  e.  _V  ->  ( `' S " { B } )  =  ( `' S " (/) ) )
1615, 9syl6eq 2491 . . . . . 6  |-  ( -.  B  e.  _V  ->  ( `' S " { B } )  =  (/) )
1712, 16nsyl2 127 . . . . 5  |-  ( b  e.  ( `' S " { B } )  ->  B  e.  _V )
1811, 17anim12i 566 . . . 4  |-  ( ( a  e.  ( `' S " { A } )  /\  b  e.  ( `' S " { B } ) )  ->  ( A  e. 
_V  /\  B  e.  _V ) )
1918a1d 25 . . 3  |-  ( ( a  e.  ( `' S " { A } )  /\  b  e.  ( `' S " { B } ) )  ->  ( ( a `
 0 )  =  ( b `  0
)  ->  ( A  e.  _V  /\  B  e. 
_V ) ) )
2019rexlimivv 2861 . 2  |-  ( E. a  e.  ( `' S " { A } ) E. b  e.  ( `' S " { B } ) ( a `  0 )  =  ( b ` 
0 )  ->  ( A  e.  _V  /\  B  e.  _V ) )
21 fveq1 5705 . . . . . 6  |-  ( c  =  a  ->  (
c `  0 )  =  ( a ` 
0 ) )
2221eqeq1d 2451 . . . . 5  |-  ( c  =  a  ->  (
( c `  0
)  =  ( d `
 0 )  <->  ( a `  0 )  =  ( d `  0
) ) )
23 fveq1 5705 . . . . . 6  |-  ( d  =  b  ->  (
d `  0 )  =  ( b ` 
0 ) )
2423eqeq2d 2454 . . . . 5  |-  ( d  =  b  ->  (
( a `  0
)  =  ( d `
 0 )  <->  ( a `  0 )  =  ( b `  0
) ) )
2522, 24cbvrex2v 2971 . . . 4  |-  ( E. c  e.  ( `' S " { i } ) E. d  e.  ( `' S " { j } ) ( c `  0
)  =  ( d `
 0 )  <->  E. a  e.  ( `' S " { i } ) E. b  e.  ( `' S " { j } ) ( a `
 0 )  =  ( b `  0
) )
26 sneq 3902 . . . . . 6  |-  ( i  =  A  ->  { i }  =  { A } )
2726imaeq2d 5184 . . . . 5  |-  ( i  =  A  ->  ( `' S " { i } )  =  ( `' S " { A } ) )
2827rexeqdv 2939 . . . 4  |-  ( i  =  A  ->  ( E. a  e.  ( `' S " { i } ) E. b  e.  ( `' S " { j } ) ( a `  0
)  =  ( b `
 0 )  <->  E. a  e.  ( `' S " { A } ) E. b  e.  ( `' S " { j } ) ( a `
 0 )  =  ( b `  0
) ) )
2925, 28syl5bb 257 . . 3  |-  ( i  =  A  ->  ( E. c  e.  ( `' S " { i } ) E. d  e.  ( `' S " { j } ) ( c `  0
)  =  ( d `
 0 )  <->  E. a  e.  ( `' S " { A } ) E. b  e.  ( `' S " { j } ) ( a `
 0 )  =  ( b `  0
) ) )
30 sneq 3902 . . . . . 6  |-  ( j  =  B  ->  { j }  =  { B } )
3130imaeq2d 5184 . . . . 5  |-  ( j  =  B  ->  ( `' S " { j } )  =  ( `' S " { B } ) )
3231rexeqdv 2939 . . . 4  |-  ( j  =  B  ->  ( E. b  e.  ( `' S " { j } ) ( a `
 0 )  =  ( b `  0
)  <->  E. b  e.  ( `' S " { B } ) ( a `
 0 )  =  ( b `  0
) ) )
3332rexbidv 2751 . . 3  |-  ( j  =  B  ->  ( E. a  e.  ( `' S " { A } ) E. b  e.  ( `' S " { j } ) ( a `  0
)  =  ( b `
 0 )  <->  E. a  e.  ( `' S " { A } ) E. b  e.  ( `' S " { B } ) ( a `
 0 )  =  ( b `  0
) ) )
3429, 33, 1brabg 4623 . 2  |-  ( ( A  e.  _V  /\  B  e.  _V )  ->  ( A L B  <->  E. a  e.  ( `' S " { A } ) E. b  e.  ( `' S " { B } ) ( a `  0 )  =  ( b ` 
0 ) ) )
354, 20, 34pm5.21nii 353 1  |-  ( A L B  <->  E. a  e.  ( `' S " { A } ) E. b  e.  ( `' S " { B } ) ( a `
 0 )  =  ( b `  0
) )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    <-> wb 184    /\ wa 369    = wceq 1369    e. wcel 1756   A.wral 2730   E.wrex 2731   {crab 2734   _Vcvv 2987    \ cdif 3340   (/)c0 3652   {csn 3892   <.cop 3898   <.cotp 3900   U_ciun 4186   class class class wbr 4307   {copab 4364    e. cmpt 4365    _I cid 4646    X. cxp 4853   `'ccnv 4854   ran crn 4856   "cima 4858   Rel wrel 4860   ` cfv 5433  (class class class)co 6106    e. cmpt2 6108   1oc1o 6928   2oc2o 6929   0cc0 9297   1c1 9298    - cmin 9610   ...cfz 11452  ..^cfzo 11563   #chash 12118  Word cword 12236   splice csplice 12241   <"cs2 12483   ~FG cefg 16218
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1591  ax-4 1602  ax-5 1670  ax-6 1708  ax-7 1728  ax-9 1760  ax-10 1775  ax-11 1780  ax-12 1792  ax-13 1943  ax-ext 2423  ax-sep 4428  ax-nul 4436  ax-pr 4546
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 967  df-tru 1372  df-ex 1587  df-nf 1590  df-sb 1701  df-eu 2257  df-mo 2258  df-clab 2430  df-cleq 2436  df-clel 2439  df-nfc 2577  df-ne 2622  df-ral 2735  df-rex 2736  df-rab 2739  df-v 2989  df-dif 3346  df-un 3348  df-in 3350  df-ss 3357  df-nul 3653  df-if 3807  df-sn 3893  df-pr 3895  df-op 3899  df-uni 4107  df-br 4308  df-opab 4366  df-xp 4861  df-rel 4862  df-cnv 4863  df-dm 4865  df-rn 4866  df-res 4867  df-ima 4868  df-iota 5396  df-fv 5441
This theorem is referenced by:  efgrelexlemb  16262  efgrelex  16263
  Copyright terms: Public domain W3C validator