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

Theorem clwlkcompim 30380
Description: Implications for the properties of the components of a closed walk. (Contributed by Alexander van der Vekens, 24-Jun-2018.)
Hypotheses
Ref Expression
clwlkcomp.1  |-  F  =  ( 1st `  W
)
clwlkcomp.2  |-  P  =  ( 2nd `  W
)
Assertion
Ref Expression
clwlkcompim  |-  ( W  e.  ( V ClWalks  E
)  ->  ( ( F  e. Word  dom  E  /\  P : ( 0 ... ( # `  F
) ) --> V )  /\  ( A. k  e.  ( 0..^ ( # `  F ) ) ( E `  ( F `
 k ) )  =  { ( P `
 k ) ,  ( P `  (
k  +  1 ) ) }  /\  ( P `  0 )  =  ( P `  ( # `  F ) ) ) ) )
Distinct variable groups:    k, E    k, F    P, k    k, V   
k, W

Proof of Theorem clwlkcompim
Dummy variables  e 
f  p  v are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-clwlk 30368 . . . 4  |- ClWalks  =  ( v  e.  _V , 
e  e.  _V  |->  {
<. f ,  p >.  |  ( f ( v Walks 
e ) p  /\  ( p `  0
)  =  ( p `
 ( # `  f
) ) ) } )
2 vex 2970 . . . . 5  |-  v  e. 
_V
3 vex 2970 . . . . 5  |-  e  e. 
_V
4 clwlk 30371 . . . . . 6  |-  ( ( v  e.  _V  /\  e  e.  _V )  ->  ( v ClWalks  e )  =  { <. f ,  p >.  |  (
f ( v Walks  e
) p  /\  (
p `  0 )  =  ( p `  ( # `  f ) ) ) } )
5 ovex 6111 . . . . . 6  |-  ( v ClWalks 
e )  e.  _V
64, 5syl6eqelr 2527 . . . . 5  |-  ( ( v  e.  _V  /\  e  e.  _V )  ->  { <. f ,  p >.  |  ( f ( v Walks  e ) p  /\  ( p ` 
0 )  =  ( p `  ( # `  f ) ) ) }  e.  _V )
72, 3, 6mp2an 672 . . . 4  |-  { <. f ,  p >.  |  ( f ( v Walks  e
) p  /\  (
p `  0 )  =  ( p `  ( # `  f ) ) ) }  e.  _V
8 oveq12 6095 . . . . . . 7  |-  ( ( v  =  V  /\  e  =  E )  ->  ( v Walks  e )  =  ( V Walks  E
) )
98breqd 4298 . . . . . 6  |-  ( ( v  =  V  /\  e  =  E )  ->  ( f ( v Walks 
e ) p  <->  f ( V Walks  E ) p ) )
109anbi1d 704 . . . . 5  |-  ( ( v  =  V  /\  e  =  E )  ->  ( ( f ( v Walks  e ) p  /\  ( p ` 
0 )  =  ( p `  ( # `  f ) ) )  <-> 
( f ( V Walks 
E ) p  /\  ( p `  0
)  =  ( p `
 ( # `  f
) ) ) ) )
1110opabbidv 4350 . . . 4  |-  ( ( v  =  V  /\  e  =  E )  ->  { <. f ,  p >.  |  ( f ( v Walks  e ) p  /\  ( p ` 
0 )  =  ( p `  ( # `  f ) ) ) }  =  { <. f ,  p >.  |  ( f ( V Walks  E
) p  /\  (
p `  0 )  =  ( p `  ( # `  f ) ) ) } )
121, 7, 11elovmpt2 6302 . . 3  |-  ( W  e.  ( V ClWalks  E
)  <->  ( V  e. 
_V  /\  E  e.  _V  /\  W  e.  { <. f ,  p >.  |  ( f ( V Walks 
E ) p  /\  ( p `  0
)  =  ( p `
 ( # `  f
) ) ) } ) )
13 elopaelxp 30088 . . . 4  |-  ( W  e.  { <. f ,  p >.  |  (
f ( V Walks  E
) p  /\  (
p `  0 )  =  ( p `  ( # `  f ) ) ) }  ->  W  e.  ( _V  X.  _V ) )
14 clwlkcomp.1 . . . . . 6  |-  F  =  ( 1st `  W
)
15 clwlkcomp.2 . . . . . 6  |-  P  =  ( 2nd `  W
)
1614, 15clwlkcomp 30379 . . . . 5  |-  ( ( V  e.  _V  /\  E  e.  _V  /\  W  e.  ( _V  X.  _V ) )  ->  ( W  e.  ( V ClWalks  E )  <->  ( ( F  e. Word  dom  E  /\  P : ( 0 ... ( # `  F
) ) --> V )  /\  ( A. k  e.  ( 0..^ ( # `  F ) ) ( E `  ( F `
 k ) )  =  { ( P `
 k ) ,  ( P `  (
k  +  1 ) ) }  /\  ( P `  0 )  =  ( P `  ( # `  F ) ) ) ) ) )
1716biimpd 207 . . . 4  |-  ( ( V  e.  _V  /\  E  e.  _V  /\  W  e.  ( _V  X.  _V ) )  ->  ( W  e.  ( V ClWalks  E )  ->  ( ( F  e. Word  dom  E  /\  P : ( 0 ... ( # `  F
) ) --> V )  /\  ( A. k  e.  ( 0..^ ( # `  F ) ) ( E `  ( F `
 k ) )  =  { ( P `
 k ) ,  ( P `  (
k  +  1 ) ) }  /\  ( P `  0 )  =  ( P `  ( # `  F ) ) ) ) ) )
1813, 17syl3an3 1253 . . 3  |-  ( ( V  e.  _V  /\  E  e.  _V  /\  W  e.  { <. f ,  p >.  |  ( f ( V Walks  E ) p  /\  ( p ` 
0 )  =  ( p `  ( # `  f ) ) ) } )  ->  ( W  e.  ( V ClWalks  E )  ->  ( ( F  e. Word  dom  E  /\  P : ( 0 ... ( # `  F
) ) --> V )  /\  ( A. k  e.  ( 0..^ ( # `  F ) ) ( E `  ( F `
 k ) )  =  { ( P `
 k ) ,  ( P `  (
k  +  1 ) ) }  /\  ( P `  0 )  =  ( P `  ( # `  F ) ) ) ) ) )
1912, 18sylbi 195 . 2  |-  ( W  e.  ( V ClWalks  E
)  ->  ( W  e.  ( V ClWalks  E )  ->  ( ( F  e. Word  dom  E  /\  P :
( 0 ... ( # `
 F ) ) --> V )  /\  ( A. k  e.  (
0..^ ( # `  F
) ) ( E `
 ( F `  k ) )  =  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) }  /\  ( P `
 0 )  =  ( P `  ( # `
 F ) ) ) ) ) )
2019pm2.43i 47 1  |-  ( W  e.  ( V ClWalks  E
)  ->  ( ( F  e. Word  dom  E  /\  P : ( 0 ... ( # `  F
) ) --> V )  /\  ( A. k  e.  ( 0..^ ( # `  F ) ) ( E `  ( F `
 k ) )  =  { ( P `
 k ) ,  ( P `  (
k  +  1 ) ) }  /\  ( P `  0 )  =  ( P `  ( # `  F ) ) ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369    /\ w3a 965    = wceq 1369    e. wcel 1756   A.wral 2710   _Vcvv 2967   {cpr 3874   class class class wbr 4287   {copab 4344    X. cxp 4833   dom cdm 4835   -->wf 5409   ` cfv 5413  (class class class)co 6086   1stc1st 6570   2ndc2nd 6571   0cc0 9274   1c1 9275    + caddc 9277   ...cfz 11429  ..^cfzo 11540   #chash 12095  Word cword 12213   Walks cwalk 23356   ClWalks cclwlk 30365
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 2419  ax-rep 4398  ax-sep 4408  ax-nul 4416  ax-pow 4465  ax-pr 4526  ax-un 6367  ax-cnex 9330  ax-resscn 9331  ax-1cn 9332  ax-icn 9333  ax-addcl 9334  ax-addrcl 9335  ax-mulcl 9336  ax-mulrcl 9337  ax-mulcom 9338  ax-addass 9339  ax-mulass 9340  ax-distr 9341  ax-i2m1 9342  ax-1ne0 9343  ax-1rid 9344  ax-rnegex 9345  ax-rrecex 9346  ax-cnre 9347  ax-pre-lttri 9348  ax-pre-lttrn 9349  ax-pre-ltadd 9350  ax-pre-mulgt0 9351
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 2256  df-mo 2257  df-clab 2425  df-cleq 2431  df-clel 2434  df-nfc 2563  df-ne 2603  df-nel 2604  df-ral 2715  df-rex 2716  df-reu 2717  df-rab 2719  df-v 2969  df-sbc 3182  df-csb 3284  df-dif 3326  df-un 3328  df-in 3330  df-ss 3337  df-pss 3339  df-nul 3633  df-if 3787  df-pw 3857  df-sn 3873  df-pr 3875  df-tp 3877  df-op 3879  df-uni 4087  df-int 4124  df-iun 4168  df-br 4288  df-opab 4346  df-mpt 4347  df-tr 4381  df-eprel 4627  df-id 4631  df-po 4636  df-so 4637  df-fr 4674  df-we 4676  df-ord 4717  df-on 4718  df-lim 4719  df-suc 4720  df-xp 4841  df-rel 4842  df-cnv 4843  df-co 4844  df-dm 4845  df-rn 4846  df-res 4847  df-ima 4848  df-iota 5376  df-fun 5415  df-fn 5416  df-f 5417  df-f1 5418  df-fo 5419  df-f1o 5420  df-fv 5421  df-riota 6047  df-ov 6089  df-oprab 6090  df-mpt2 6091  df-om 6472  df-1st 6572  df-2nd 6573  df-recs 6824  df-rdg 6858  df-1o 6912  df-oadd 6916  df-er 7093  df-map 7208  df-pm 7209  df-en 7303  df-dom 7304  df-sdom 7305  df-fin 7306  df-card 8101  df-pnf 9412  df-mnf 9413  df-xr 9414  df-ltxr 9415  df-le 9416  df-sub 9589  df-neg 9590  df-nn 10315  df-n0 10572  df-z 10639  df-uz 10854  df-fz 11430  df-fzo 11541  df-hash 12096  df-word 12221  df-wlk 23366  df-clwlk 30368
This theorem is referenced by:  clwlkfclwwlk2wrd  30466  clwlkfclwwlk1hash  30468  clwlkfclwwlk  30470  clwlkf1clwwlklem1  30472  clwlkf1clwwlklem2  30473  clwlkf1clwwlklem3  30474
  Copyright terms: Public domain W3C validator