ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  clwwlknon Unicode version

Theorem clwwlknon 16670
Description: The set of closed walks on vertex  X of length  N in a graph  G as words over the set of vertices. (Contributed by Alexander van der Vekens, 14-Sep-2018.) (Revised by AV, 28-May-2021.) (Revised by AV, 24-Mar-2022.)
Assertion
Ref Expression
clwwlknon  |-  ( X (ClWWalksNOn `  G ) N )  =  { w  e.  ( N ClWWalksN  G )  |  ( w ` 
0 )  =  X }
Distinct variable groups:    w, G    w, N    w, X

Proof of Theorem clwwlknon
Dummy variables  n  v  x  g are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 clwwlknonmpo 16669 . . . 4  |-  (ClWWalksNOn `  G
)  =  ( v  e.  (Vtx `  G
) ,  n  e. 
NN0  |->  { w  e.  ( n ClWWalksN  G )  |  ( w ` 
0 )  =  v } )
21elmpocl 6284 . . 3  |-  ( x  e.  ( X (ClWWalksNOn `  G ) N )  ->  ( X  e.  (Vtx `  G )  /\  N  e.  NN0 ) )
3 fveq1 5694 . . . . . . . 8  |-  ( w  =  x  ->  (
w `  0 )  =  ( x ` 
0 ) )
43eqeq1d 2247 . . . . . . 7  |-  ( w  =  x  ->  (
( w `  0
)  =  X  <->  ( x `  0 )  =  X ) )
54elrab 2982 . . . . . 6  |-  ( x  e.  { w  e.  ( N ClWWalksN  G )  |  ( w ` 
0 )  =  X }  <->  ( x  e.  ( N ClWWalksN  G )  /\  ( x `  0
)  =  X ) )
65simprbi 275 . . . . 5  |-  ( x  e.  { w  e.  ( N ClWWalksN  G )  |  ( w ` 
0 )  =  X }  ->  ( x `  0 )  =  X )
7 elrabi 2979 . . . . . . . 8  |-  ( x  e.  { w  e.  ( N ClWWalksN  G )  |  ( w ` 
0 )  =  X }  ->  x  e.  ( N ClWWalksN  G ) )
8 clwwlkclwwlkn 16650 . . . . . . . 8  |-  ( x  e.  ( N ClWWalksN  G )  ->  x  e.  (ClWWalks `  G ) )
9 eqid 2238 . . . . . . . . 9  |-  (Vtx `  G )  =  (Vtx
`  G )
109clwwlkbp 16636 . . . . . . . 8  |-  ( x  e.  (ClWWalks `  G
)  ->  ( G  e.  _V  /\  x  e. Word 
(Vtx `  G )  /\  x  =/=  (/) ) )
117, 8, 103syl 17 . . . . . . 7  |-  ( x  e.  { w  e.  ( N ClWWalksN  G )  |  ( w ` 
0 )  =  X }  ->  ( G  e.  _V  /\  x  e. Word 
(Vtx `  G )  /\  x  =/=  (/) ) )
1211simp2d 1041 . . . . . 6  |-  ( x  e.  { w  e.  ( N ClWWalksN  G )  |  ( w ` 
0 )  =  X }  ->  x  e. Word  (Vtx
`  G ) )
1311simp3d 1042 . . . . . 6  |-  ( x  e.  { w  e.  ( N ClWWalksN  G )  |  ( w ` 
0 )  =  X }  ->  x  =/=  (/) )
14 fstwrdne 11343 . . . . . 6  |-  ( ( x  e. Word  (Vtx `  G )  /\  x  =/=  (/) )  ->  (
x `  0 )  e.  (Vtx `  G )
)
1512, 13, 14syl2anc 415 . . . . 5  |-  ( x  e.  { w  e.  ( N ClWWalksN  G )  |  ( w ` 
0 )  =  X }  ->  ( x `  0 )  e.  (Vtx `  G )
)
166, 15eqeltrrd 2316 . . . 4  |-  ( x  e.  { w  e.  ( N ClWWalksN  G )  |  ( w ` 
0 )  =  X }  ->  X  e.  (Vtx `  G ) )
17 clwwlknnn 16653 . . . . . 6  |-  ( x  e.  ( N ClWWalksN  G )  ->  N  e.  NN )
187, 17syl 14 . . . . 5  |-  ( x  e.  { w  e.  ( N ClWWalksN  G )  |  ( w ` 
0 )  =  X }  ->  N  e.  NN )
1918nnnn0d 9620 . . . 4  |-  ( x  e.  { w  e.  ( N ClWWalksN  G )  |  ( w ` 
0 )  =  X }  ->  N  e.  NN0 )
2016, 19jca 306 . . 3  |-  ( x  e.  { w  e.  ( N ClWWalksN  G )  |  ( w ` 
0 )  =  X }  ->  ( X  e.  (Vtx `  G )  /\  N  e.  NN0 ) )
21 clwwlkex 16639 . . . . . . . . . 10  |-  ( g  e.  _V  ->  (ClWWalks `  g )  e.  _V )
2221elv 2825 . . . . . . . . 9  |-  (ClWWalks `  g
)  e.  _V
2322rabex 4280 . . . . . . . 8  |-  { w  e.  (ClWWalks `  g )  |  ( `  w )  =  n }  e.  _V
2423gen2 1503 . . . . . . 7  |-  A. n A. g { w  e.  (ClWWalks `  g )  |  ( `  w )  =  n }  e.  _V
25 simpr 110 . . . . . . 7  |-  ( ( X  e.  (Vtx `  G )  /\  N  e.  NN0 )  ->  N  e.  NN0 )
2691vgrex 16261 . . . . . . . 8  |-  ( X  e.  (Vtx `  G
)  ->  G  e.  _V )
2726adantr 276 . . . . . . 7  |-  ( ( X  e.  (Vtx `  G )  /\  N  e.  NN0 )  ->  G  e.  _V )
28 df-clwwlkn 16645 . . . . . . . 8  |- ClWWalksN  =  ( n  e.  NN0 , 
g  e.  _V  |->  { w  e.  (ClWWalks `  g
)  |  ( `  w
)  =  n }
)
2928mpofvex 6441 . . . . . . 7  |-  ( ( A. n A. g { w  e.  (ClWWalks `  g )  |  ( `  w )  =  n }  e.  _V  /\  N  e.  NN0  /\  G  e.  _V )  ->  ( N ClWWalksN  G )  e.  _V )
3024, 25, 27, 29mp3an2i 1383 . . . . . 6  |-  ( ( X  e.  (Vtx `  G )  /\  N  e.  NN0 )  ->  ( N ClWWalksN  G )  e.  _V )
31 rabexg 4279 . . . . . 6  |-  ( ( N ClWWalksN  G )  e.  _V  ->  { w  e.  ( N ClWWalksN  G )  |  ( w `  0 )  =  X }  e.  _V )
3230, 31syl 14 . . . . 5  |-  ( ( X  e.  (Vtx `  G )  /\  N  e.  NN0 )  ->  { w  e.  ( N ClWWalksN  G )  |  ( w ` 
0 )  =  X }  e.  _V )
33 eqeq2 2248 . . . . . . 7  |-  ( v  =  X  ->  (
( w `  0
)  =  v  <->  ( w `  0 )  =  X ) )
3433rabbidv 2810 . . . . . 6  |-  ( v  =  X  ->  { w  e.  ( n ClWWalksN  G )  |  ( w ` 
0 )  =  v }  =  { w  e.  ( n ClWWalksN  G )  |  ( w ` 
0 )  =  X } )
35 oveq1 6092 . . . . . . 7  |-  ( n  =  N  ->  (
n ClWWalksN  G )  =  ( N ClWWalksN  G ) )
3635rabeqdv 2815 . . . . . 6  |-  ( n  =  N  ->  { w  e.  ( n ClWWalksN  G )  |  ( w ` 
0 )  =  X }  =  { w  e.  ( N ClWWalksN  G )  |  ( w ` 
0 )  =  X } )
3734, 36, 1ovmpog 6223 . . . . 5  |-  ( ( X  e.  (Vtx `  G )  /\  N  e.  NN0  /\  { w  e.  ( N ClWWalksN  G )  |  ( w ` 
0 )  =  X }  e.  _V )  ->  ( X (ClWWalksNOn `  G
) N )  =  { w  e.  ( N ClWWalksN  G )  |  ( w `  0 )  =  X } )
3832, 37mpd3an3 1379 . . . 4  |-  ( ( X  e.  (Vtx `  G )  /\  N  e.  NN0 )  ->  ( X (ClWWalksNOn `  G ) N )  =  { w  e.  ( N ClWWalksN  G )  |  ( w ` 
0 )  =  X } )
3938eleq2d 2308 . . 3  |-  ( ( X  e.  (Vtx `  G )  /\  N  e.  NN0 )  ->  (
x  e.  ( X (ClWWalksNOn `  G ) N )  <->  x  e.  { w  e.  ( N ClWWalksN  G )  |  ( w ` 
0 )  =  X } ) )
402, 20, 39pm5.21nii 716 . 2  |-  ( x  e.  ( X (ClWWalksNOn `  G ) N )  <-> 
x  e.  { w  e.  ( N ClWWalksN  G )  |  ( w ` 
0 )  =  X } )
4140eqriv 2235 1  |-  ( X (ClWWalksNOn `  G ) N )  =  { w  e.  ( N ClWWalksN  G )  |  ( w ` 
0 )  =  X }
Colors of variables:    wff set class
This proof depends on syntax axioms:    /\ wa 104    /\ w3a 1009   A.wal 1400    = wceq 1402    e. wcel 2209    =/= wne 2420   {crab 2532   _Vcvv 2821   (/)c0 3520   ` cfv 5377  (class class class)co 6085   0cc0 8179   NNcn 9304   NN0cn0 9563  ♯chash 11214  Word cword 11304  Vtxcvtx 16253  ClWWalkscclwwlk 16632   ClWWalksN cclwwlkn 16644  ClWWalksNOncclwwlknon 16667
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  df-1o 6687  df-er 6807  df-map 6924  df-en 7023  df-dom 7024  df-fin 7025  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910  df-inn 9305  df-n0 9564  df-z 9645  df-uz 9922  df-fz 10412  df-fzo 10550  df-ihash 11215  df-word 11305  df-ndx 13355  df-slot 13356  df-base 13358  df-vtx 16255  df-clwwlk 16633  df-clwwlkn 16645  df-clwwlknon 16668
This theorem is used by:  isclwwlknon  16671  clwwlknon2  16675
  Copyright terms: Public domain W3C validator