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

Theorem clwwlkbij 24925
Description: There is a bijection between the set of closed walks of a fixed length represented by walks (as word) and the set of closed walks (as words) of a fixed length. The difference between these two representations is that in the first case the starting vertex is repeated at the end of the word, and in the second case it is not. (Contributed by Alexander van der Vekens, 29-Sep-2018.)
Assertion
Ref Expression
clwwlkbij  |-  ( ( V  e.  X  /\  E  e.  Y  /\  N  e.  NN )  ->  E. f  f : { w  e.  ( ( V WWalksN  E ) `  N )  |  ( lastS  `  w )  =  ( w `  0 ) } -1-1-onto-> ( ( V ClWWalksN  E ) `
 N ) )
Distinct variable groups:    f, E, w    f, N, w    f, V, w
Allowed substitution hints:    X( w, f)    Y( w, f)

Proof of Theorem clwwlkbij
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 fvex 5882 . . 3  |-  ( ( V WWalksN  E ) `  N
)  e.  _V
21mptrabex 6145 . 2  |-  ( x  e.  { w  e.  ( ( V WWalksN  E
) `  N )  |  ( lastS  `  w )  =  ( w ` 
0 ) }  |->  ( x substr  <. 0 ,  N >. ) )  e.  _V
3 eqid 2457 . . 3  |-  { w  e.  ( ( V WWalksN  E
) `  N )  |  ( lastS  `  w )  =  ( w ` 
0 ) }  =  { w  e.  (
( V WWalksN  E ) `  N )  |  ( lastS  `  w )  =  ( w `  0 ) }
4 eqid 2457 . . 3  |-  ( x  e.  { w  e.  ( ( V WWalksN  E
) `  N )  |  ( lastS  `  w )  =  ( w ` 
0 ) }  |->  ( x substr  <. 0 ,  N >. ) )  =  ( x  e.  { w  e.  ( ( V WWalksN  E
) `  N )  |  ( lastS  `  w )  =  ( w ` 
0 ) }  |->  ( x substr  <. 0 ,  N >. ) )
53, 4clwwlkf1o 24924 . 2  |-  ( ( V  e.  X  /\  E  e.  Y  /\  N  e.  NN )  ->  ( x  e.  {
w  e.  ( ( V WWalksN  E ) `  N
)  |  ( lastS  `  w
)  =  ( w `
 0 ) } 
|->  ( x substr  <. 0 ,  N >. ) ) : { w  e.  ( ( V WWalksN  E ) `  N )  |  ( lastS  `  w )  =  ( w `  0 ) } -1-1-onto-> ( ( V ClWWalksN  E ) `
 N ) )
6 f1oeq1 5813 . . 3  |-  ( f  =  ( x  e. 
{ w  e.  ( ( V WWalksN  E ) `  N )  |  ( lastS  `  w )  =  ( w `  0 ) }  |->  ( x substr  <. 0 ,  N >. ) )  -> 
( f : {
w  e.  ( ( V WWalksN  E ) `  N
)  |  ( lastS  `  w
)  =  ( w `
 0 ) } -1-1-onto-> ( ( V ClWWalksN  E ) `  N )  <->  ( x  e.  { w  e.  ( ( V WWalksN  E ) `  N )  |  ( lastS  `  w )  =  ( w `  0 ) }  |->  ( x substr  <. 0 ,  N >. ) ) : { w  e.  ( ( V WWalksN  E ) `  N )  |  ( lastS  `  w )  =  ( w `  0 ) } -1-1-onto-> ( ( V ClWWalksN  E ) `
 N ) ) )
76spcegv 3195 . 2  |-  ( ( x  e.  { w  e.  ( ( V WWalksN  E
) `  N )  |  ( lastS  `  w )  =  ( w ` 
0 ) }  |->  ( x substr  <. 0 ,  N >. ) )  e.  _V  ->  ( ( x  e. 
{ w  e.  ( ( V WWalksN  E ) `  N )  |  ( lastS  `  w )  =  ( w `  0 ) }  |->  ( x substr  <. 0 ,  N >. ) ) : { w  e.  ( ( V WWalksN  E ) `  N )  |  ( lastS  `  w )  =  ( w `  0 ) } -1-1-onto-> ( ( V ClWWalksN  E ) `
 N )  ->  E. f  f : { w  e.  (
( V WWalksN  E ) `  N )  |  ( lastS  `  w )  =  ( w `  0 ) } -1-1-onto-> ( ( V ClWWalksN  E ) `
 N ) ) )
82, 5, 7mpsyl 63 1  |-  ( ( V  e.  X  /\  E  e.  Y  /\  N  e.  NN )  ->  E. f  f : { w  e.  ( ( V WWalksN  E ) `  N )  |  ( lastS  `  w )  =  ( w `  0 ) } -1-1-onto-> ( ( V ClWWalksN  E ) `
 N ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ w3a 973    = wceq 1395   E.wex 1613    e. wcel 1819   {crab 2811   _Vcvv 3109   <.cop 4038    |-> cmpt 4515   -1-1-onto->wf1o 5593   ` cfv 5594  (class class class)co 6296   0cc0 9509   NNcn 10556   lastS clsw 12538   substr csubstr 12541   WWalksN cwwlkn 24804   ClWWalksN cclwwlkn 24875
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1619  ax-4 1632  ax-5 1705  ax-6 1748  ax-7 1791  ax-8 1821  ax-9 1823  ax-10 1838  ax-11 1843  ax-12 1855  ax-13 2000  ax-ext 2435  ax-rep 4568  ax-sep 4578  ax-nul 4586  ax-pow 4634  ax-pr 4695  ax-un 6591  ax-cnex 9565  ax-resscn 9566  ax-1cn 9567  ax-icn 9568  ax-addcl 9569  ax-addrcl 9570  ax-mulcl 9571  ax-mulrcl 9572  ax-mulcom 9573  ax-addass 9574  ax-mulass 9575  ax-distr 9576  ax-i2m1 9577  ax-1ne0 9578  ax-1rid 9579  ax-rnegex 9580  ax-rrecex 9581  ax-cnre 9582  ax-pre-lttri 9583  ax-pre-lttrn 9584  ax-pre-ltadd 9585  ax-pre-mulgt0 9586
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 974  df-3an 975  df-tru 1398  df-fal 1401  df-ex 1614  df-nf 1618  df-sb 1741  df-eu 2287  df-mo 2288  df-clab 2443  df-cleq 2449  df-clel 2452  df-nfc 2607  df-ne 2654  df-nel 2655  df-ral 2812  df-rex 2813  df-reu 2814  df-rmo 2815  df-rab 2816  df-v 3111  df-sbc 3328  df-csb 3431  df-dif 3474  df-un 3476  df-in 3478  df-ss 3485  df-pss 3487  df-nul 3794  df-if 3945  df-pw 4017  df-sn 4033  df-pr 4035  df-tp 4037  df-op 4039  df-uni 4252  df-int 4289  df-iun 4334  df-br 4457  df-opab 4516  df-mpt 4517  df-tr 4551  df-eprel 4800  df-id 4804  df-po 4809  df-so 4810  df-fr 4847  df-we 4849  df-ord 4890  df-on 4891  df-lim 4892  df-suc 4893  df-xp 5014  df-rel 5015  df-cnv 5016  df-co 5017  df-dm 5018  df-rn 5019  df-res 5020  df-ima 5021  df-iota 5557  df-fun 5596  df-fn 5597  df-f 5598  df-f1 5599  df-fo 5600  df-f1o 5601  df-fv 5602  df-riota 6258  df-ov 6299  df-oprab 6300  df-mpt2 6301  df-om 6700  df-1st 6799  df-2nd 6800  df-recs 7060  df-rdg 7094  df-1o 7148  df-oadd 7152  df-er 7329  df-map 7440  df-pm 7441  df-en 7536  df-dom 7537  df-sdom 7538  df-fin 7539  df-card 8337  df-cda 8565  df-pnf 9647  df-mnf 9648  df-xr 9649  df-ltxr 9650  df-le 9651  df-sub 9826  df-neg 9827  df-nn 10557  df-2 10615  df-n0 10817  df-z 10886  df-uz 11107  df-rp 11246  df-fz 11698  df-fzo 11821  df-hash 12408  df-word 12545  df-lsw 12546  df-concat 12547  df-s1 12548  df-substr 12549  df-wwlk 24805  df-wwlkn 24806  df-clwwlk 24877  df-clwwlkn 24878
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator