Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  erclwwlkref Structured version   Unicode version

Theorem erclwwlkref 30483
Description:  .~ is a reflexive relation over the set of closed walks (defined as words). (Contributed by Alexander van der Vekens, 25-Mar-2018.) (Revised by Alexander van der Vekens, 11-Jun-2018.)
Hypothesis
Ref Expression
erclwwlk.r  |-  .~  =  { <. u ,  w >.  |  ( u  e.  ( V ClWWalks  E )  /\  w  e.  ( V ClWWalks  E )  /\  E. n  e.  ( 0 ... ( # `  w
) ) u  =  ( w cyclShift  n )
) }
Assertion
Ref Expression
erclwwlkref  |-  ( x  e.  ( V ClWWalks  E )  <-> 
x  .~  x )
Distinct variable groups:    n, E, u, w    n, V, u, w    x, n, u, w
Allowed substitution hints:    .~ ( x, w, u, n)    E( x)    V( x)

Proof of Theorem erclwwlkref
StepHypRef Expression
1 anidm 644 . . . 4  |-  ( ( x  e.  ( V ClWWalks  E )  /\  x  e.  ( V ClWWalks  E )
)  <->  x  e.  ( V ClWWalks  E ) )
21anbi1i 695 . . 3  |-  ( ( ( x  e.  ( V ClWWalks  E )  /\  x  e.  ( V ClWWalks  E )
)  /\  E. n  e.  ( 0 ... ( # `
 x ) ) x  =  ( x cyclShift  n ) )  <->  ( x  e.  ( V ClWWalks  E )  /\  E. n  e.  ( 0 ... ( # `  x ) ) x  =  ( x cyclShift  n
) ) )
3 df-3an 967 . . 3  |-  ( ( x  e.  ( V ClWWalks  E )  /\  x  e.  ( V ClWWalks  E )  /\  E. n  e.  ( 0 ... ( # `  x ) ) x  =  ( x cyclShift  n
) )  <->  ( (
x  e.  ( V ClWWalks  E )  /\  x  e.  ( V ClWWalks  E )
)  /\  E. n  e.  ( 0 ... ( # `
 x ) ) x  =  ( x cyclShift  n ) ) )
4 clwwlkprop 30433 . . . . 5  |-  ( x  e.  ( V ClWWalks  E )  ->  ( V  e. 
_V  /\  E  e.  _V  /\  x  e. Word  V
) )
5 cshw0 12431 . . . . . . 7  |-  ( x  e. Word  V  ->  (
x cyclShift  0 )  =  x )
6 0nn0 10594 . . . . . . . . . 10  |-  0  e.  NN0
76a1i 11 . . . . . . . . 9  |-  ( x  e. Word  V  ->  0  e.  NN0 )
8 lencl 12249 . . . . . . . . 9  |-  ( x  e. Word  V  ->  ( # `
 x )  e. 
NN0 )
9 hashge0 12150 . . . . . . . . 9  |-  ( x  e. Word  V  ->  0  <_  ( # `  x
) )
10 elfz2nn0 11480 . . . . . . . . 9  |-  ( 0  e.  ( 0 ... ( # `  x
) )  <->  ( 0  e.  NN0  /\  ( # `
 x )  e. 
NN0  /\  0  <_  (
# `  x )
) )
117, 8, 9, 10syl3anbrc 1172 . . . . . . . 8  |-  ( x  e. Word  V  ->  0  e.  ( 0 ... ( # `
 x ) ) )
12 eqcom 2445 . . . . . . . . 9  |-  ( ( x cyclShift  0 )  =  x  <->  x  =  (
x cyclShift  0 ) )
1312biimpi 194 . . . . . . . 8  |-  ( ( x cyclShift  0 )  =  x  ->  x  =  ( x cyclShift  0 ) )
14 oveq2 6099 . . . . . . . . . 10  |-  ( n  =  0  ->  (
x cyclShift  n )  =  ( x cyclShift  0 ) )
1514eqeq2d 2454 . . . . . . . . 9  |-  ( n  =  0  ->  (
x  =  ( x cyclShift  n )  <->  x  =  ( x cyclShift  0 ) ) )
1615rspcev 3073 . . . . . . . 8  |-  ( ( 0  e.  ( 0 ... ( # `  x
) )  /\  x  =  ( x cyclShift  0
) )  ->  E. n  e.  ( 0 ... ( # `
 x ) ) x  =  ( x cyclShift  n ) )
1711, 13, 16syl2an 477 . . . . . . 7  |-  ( ( x  e. Word  V  /\  ( x cyclShift  0 )  =  x )  ->  E. n  e.  ( 0 ... ( # `
 x ) ) x  =  ( x cyclShift  n ) )
185, 17mpdan 668 . . . . . 6  |-  ( x  e. Word  V  ->  E. n  e.  ( 0 ... ( # `
 x ) ) x  =  ( x cyclShift  n ) )
19183ad2ant3 1011 . . . . 5  |-  ( ( V  e.  _V  /\  E  e.  _V  /\  x  e. Word  V )  ->  E. n  e.  ( 0 ... ( # `
 x ) ) x  =  ( x cyclShift  n ) )
204, 19syl 16 . . . 4  |-  ( x  e.  ( V ClWWalks  E )  ->  E. n  e.  ( 0 ... ( # `  x ) ) x  =  ( x cyclShift  n
) )
2120pm4.71i 632 . . 3  |-  ( x  e.  ( V ClWWalks  E )  <-> 
( x  e.  ( V ClWWalks  E )  /\  E. n  e.  ( 0 ... ( # `  x
) ) x  =  ( x cyclShift  n )
) )
222, 3, 213bitr4ri 278 . 2  |-  ( x  e.  ( V ClWWalks  E )  <-> 
( x  e.  ( V ClWWalks  E )  /\  x  e.  ( V ClWWalks  E )  /\  E. n  e.  ( 0 ... ( # `  x ) ) x  =  ( x cyclShift  n
) ) )
23 vex 2975 . . 3  |-  x  e. 
_V
24 erclwwlk.r . . . 4  |-  .~  =  { <. u ,  w >.  |  ( u  e.  ( V ClWWalks  E )  /\  w  e.  ( V ClWWalks  E )  /\  E. n  e.  ( 0 ... ( # `  w
) ) u  =  ( w cyclShift  n )
) }
2524erclwwlkeq 30481 . . 3  |-  ( ( x  e.  _V  /\  x  e.  _V )  ->  ( x  .~  x  <->  ( x  e.  ( V ClWWalks  E )  /\  x  e.  ( V ClWWalks  E )  /\  E. n  e.  ( 0 ... ( # `  x ) ) x  =  ( x cyclShift  n
) ) ) )
2623, 23, 25mp2an 672 . 2  |-  ( x  .~  x  <->  ( x  e.  ( V ClWWalks  E )  /\  x  e.  ( V ClWWalks  E )  /\  E. n  e.  ( 0 ... ( # `  x
) ) x  =  ( x cyclShift  n )
) )
2722, 26bitr4i 252 1  |-  ( x  e.  ( V ClWWalks  E )  <-> 
x  .~  x )
Colors of variables: wff setvar class
Syntax hints:    <-> wb 184    /\ wa 369    /\ w3a 965    = wceq 1369    e. wcel 1756   E.wrex 2716   _Vcvv 2972   class class class wbr 4292   {copab 4349   ` cfv 5418  (class class class)co 6091   0cc0 9282    <_ cle 9419   NN0cn0 10579   ...cfz 11437   #chash 12103  Word cword 12221   cyclShift ccsh 12425   ClWWalks cclwwlk 30413
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-8 1758  ax-9 1760  ax-10 1775  ax-11 1780  ax-12 1792  ax-13 1943  ax-ext 2423  ax-rep 4403  ax-sep 4413  ax-nul 4421  ax-pow 4470  ax-pr 4531  ax-un 6372  ax-cnex 9338  ax-resscn 9339  ax-1cn 9340  ax-icn 9341  ax-addcl 9342  ax-addrcl 9343  ax-mulcl 9344  ax-mulrcl 9345  ax-mulcom 9346  ax-addass 9347  ax-mulass 9348  ax-distr 9349  ax-i2m1 9350  ax-1ne0 9351  ax-1rid 9352  ax-rnegex 9353  ax-rrecex 9354  ax-cnre 9355  ax-pre-lttri 9356  ax-pre-lttrn 9357  ax-pre-ltadd 9358  ax-pre-mulgt0 9359  ax-pre-sup 9360
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 966  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 2568  df-ne 2608  df-nel 2609  df-ral 2720  df-rex 2721  df-reu 2722  df-rmo 2723  df-rab 2724  df-v 2974  df-sbc 3187  df-csb 3289  df-dif 3331  df-un 3333  df-in 3335  df-ss 3342  df-pss 3344  df-nul 3638  df-if 3792  df-pw 3862  df-sn 3878  df-pr 3880  df-tp 3882  df-op 3884  df-uni 4092  df-int 4129  df-iun 4173  df-br 4293  df-opab 4351  df-mpt 4352  df-tr 4386  df-eprel 4632  df-id 4636  df-po 4641  df-so 4642  df-fr 4679  df-we 4681  df-ord 4722  df-on 4723  df-lim 4724  df-suc 4725  df-xp 4846  df-rel 4847  df-cnv 4848  df-co 4849  df-dm 4850  df-rn 4851  df-res 4852  df-ima 4853  df-iota 5381  df-fun 5420  df-fn 5421  df-f 5422  df-f1 5423  df-fo 5424  df-f1o 5425  df-fv 5426  df-riota 6052  df-ov 6094  df-oprab 6095  df-mpt2 6096  df-om 6477  df-1st 6577  df-2nd 6578  df-recs 6832  df-rdg 6866  df-1o 6920  df-oadd 6924  df-er 7101  df-map 7216  df-pm 7217  df-en 7311  df-dom 7312  df-sdom 7313  df-fin 7314  df-sup 7691  df-card 8109  df-pnf 9420  df-mnf 9421  df-xr 9422  df-ltxr 9423  df-le 9424  df-sub 9597  df-neg 9598  df-div 9994  df-nn 10323  df-n0 10580  df-z 10647  df-uz 10862  df-rp 10992  df-fz 11438  df-fzo 11549  df-fl 11642  df-mod 11709  df-hash 12104  df-word 12229  df-concat 12231  df-substr 12233  df-csh 12426  df-clwwlk 30416
This theorem is referenced by:  erclwwlk  30486
  Copyright terms: Public domain W3C validator