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

Theorem numclwwlkovg 25214
Description: Value of operation  G, mapping a vertex v and a nonnegative integer n to the "closed n-walks v(0) ... v(n-2) v(n-1) v(n) from v = v(0) = v(n) with v(n-2) = v" according to definition 6 in [Huneke] p. 2. (Contributed by Alexander van der Vekens, 14-Sep-2018.)
Hypotheses
Ref Expression
numclwwlk.c  |-  C  =  ( n  e.  NN0  |->  ( ( V ClWWalksN  E ) `
 n ) )
numclwwlk.f  |-  F  =  ( v  e.  V ,  n  e.  NN0  |->  { w  e.  ( C `  n )  |  ( w ` 
0 )  =  v } )
numclwwlk.g  |-  G  =  ( v  e.  V ,  n  e.  ( ZZ>=
`  2 )  |->  { w  e.  ( C `
 n )  |  ( ( w ` 
0 )  =  v  /\  ( w `  ( n  -  2
) )  =  ( w `  0 ) ) } )
Assertion
Ref Expression
numclwwlkovg  |-  ( ( X  e.  V  /\  N  e.  ( ZZ>= ` 
2 ) )  -> 
( X G N )  =  { w  e.  ( C `  N
)  |  ( ( w `  0 )  =  X  /\  (
w `  ( N  -  2 ) )  =  ( w ` 
0 ) ) } )
Distinct variable groups:    n, E    n, N    n, V    w, C    w, N    C, n, v, w    v, N    n, X, v, w    v, V   
w, E    w, V    w, F
Allowed substitution hints:    E( v)    F( v, n)    G( w, v, n)

Proof of Theorem numclwwlkovg
StepHypRef Expression
1 fveq2 5872 . . . 4  |-  ( n  =  N  ->  ( C `  n )  =  ( C `  N ) )
21adantl 466 . . 3  |-  ( ( v  =  X  /\  n  =  N )  ->  ( C `  n
)  =  ( C `
 N ) )
3 eqeq2 2472 . . . 4  |-  ( v  =  X  ->  (
( w `  0
)  =  v  <->  ( w `  0 )  =  X ) )
4 oveq1 6303 . . . . . 6  |-  ( n  =  N  ->  (
n  -  2 )  =  ( N  - 
2 ) )
54fveq2d 5876 . . . . 5  |-  ( n  =  N  ->  (
w `  ( n  -  2 ) )  =  ( w `  ( N  -  2
) ) )
65eqeq1d 2459 . . . 4  |-  ( n  =  N  ->  (
( w `  (
n  -  2 ) )  =  ( w `
 0 )  <->  ( w `  ( N  -  2 ) )  =  ( w `  0 ) ) )
73, 6bi2anan9 873 . . 3  |-  ( ( v  =  X  /\  n  =  N )  ->  ( ( ( w `
 0 )  =  v  /\  ( w `
 ( n  - 
2 ) )  =  ( w `  0
) )  <->  ( (
w `  0 )  =  X  /\  (
w `  ( N  -  2 ) )  =  ( w ` 
0 ) ) ) )
82, 7rabeqbidv 3104 . 2  |-  ( ( v  =  X  /\  n  =  N )  ->  { w  e.  ( C `  n )  |  ( ( w `
 0 )  =  v  /\  ( w `
 ( n  - 
2 ) )  =  ( w `  0
) ) }  =  { w  e.  ( C `  N )  |  ( ( w `
 0 )  =  X  /\  ( w `
 ( N  - 
2 ) )  =  ( w `  0
) ) } )
9 numclwwlk.g . 2  |-  G  =  ( v  e.  V ,  n  e.  ( ZZ>=
`  2 )  |->  { w  e.  ( C `
 n )  |  ( ( w ` 
0 )  =  v  /\  ( w `  ( n  -  2
) )  =  ( w `  0 ) ) } )
10 fvex 5882 . . 3  |-  ( C `
 N )  e. 
_V
1110rabex 4607 . 2  |-  { w  e.  ( C `  N
)  |  ( ( w `  0 )  =  X  /\  (
w `  ( N  -  2 ) )  =  ( w ` 
0 ) ) }  e.  _V
128, 9, 11ovmpt2a 6432 1  |-  ( ( X  e.  V  /\  N  e.  ( ZZ>= ` 
2 ) )  -> 
( X G N )  =  { w  e.  ( C `  N
)  |  ( ( w `  0 )  =  X  /\  (
w `  ( N  -  2 ) )  =  ( w ` 
0 ) ) } )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369    = wceq 1395    e. wcel 1819   {crab 2811    |-> cmpt 4515   ` cfv 5594  (class class class)co 6296    |-> cmpt2 6298   0cc0 9509    - cmin 9824   2c2 10606   NN0cn0 10816   ZZ>=cuz 11106   ClWWalksN cclwwlkn 24876
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-9 1823  ax-10 1838  ax-11 1843  ax-12 1855  ax-13 2000  ax-ext 2435  ax-sep 4578  ax-nul 4586  ax-pr 4695
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1398  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-ral 2812  df-rex 2813  df-rab 2816  df-v 3111  df-sbc 3328  df-dif 3474  df-un 3476  df-in 3478  df-ss 3485  df-nul 3794  df-if 3945  df-sn 4033  df-pr 4035  df-op 4039  df-uni 4252  df-br 4457  df-opab 4516  df-id 4804  df-xp 5014  df-rel 5015  df-cnv 5016  df-co 5017  df-dm 5018  df-iota 5557  df-fun 5596  df-fv 5602  df-ov 6299  df-oprab 6300  df-mpt2 6301
This theorem is referenced by:  numclwwlkovgel  25215  extwwlkfab  25217  numclwwlk3lem  25235
  Copyright terms: Public domain W3C validator