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

Theorem clwwlknonmpo 16583
Description:  (ClWWalksNOn `  G ) is an operator mapping a vertex  v and a nonnegative integer  n to the set of closed walks on  v of length  n as words over the set of vertices in a graph  G. (Contributed by AV, 25-Feb-2022.) (Proof shortened by AV, 2-Mar-2024.)
Assertion
Ref Expression
clwwlknonmpo  |-  (ClWWalksNOn `  G
)  =  ( v  e.  (Vtx `  G
) ,  n  e. 
NN0  |->  { w  e.  ( n ClWWalksN  G )  |  ( w ` 
0 )  =  v } )
Distinct variable group:    n, G, v, w

Proof of Theorem clwwlknonmpo
Dummy variables  g  s  x are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-clwwlknon 16582 . . . 4  |- ClWWalksNOn  =  ( g  e.  _V  |->  ( v  e.  (Vtx `  g ) ,  n  e.  NN0  |->  { w  e.  ( n ClWWalksN  g )  |  ( w ` 
0 )  =  v } ) )
21mptrcl 5782 . . 3  |-  ( x  e.  (ClWWalksNOn `  G )  ->  G  e.  _V )
3 eqid 2238 . . . . 5  |-  ( v  e.  (Vtx `  G
) ,  n  e. 
NN0  |->  { w  e.  ( n ClWWalksN  G )  |  ( w ` 
0 )  =  v } )  =  ( v  e.  (Vtx `  G ) ,  n  e.  NN0  |->  { w  e.  ( n ClWWalksN  G )  |  ( w ` 
0 )  =  v } )
43elmpom 6464 . . . 4  |-  ( x  e.  ( v  e.  (Vtx `  G ) ,  n  e.  NN0  |->  { w  e.  (
n ClWWalksN  G )  |  ( w `  0 )  =  v } )  ->  E. s  s  e.  (Vtx `  G )
)
5 df-vtx 16169 . . . . . 6  |- Vtx  =  ( g  e.  _V  |->  if ( g  e.  ( _V  X.  _V ) ,  ( 1st `  g
) ,  ( Base `  g ) ) )
65mptrcl 5782 . . . . 5  |-  ( s  e.  (Vtx `  G
)  ->  G  e.  _V )
76exlimiv 1651 . . . 4  |-  ( E. s  s  e.  (Vtx
`  G )  ->  G  e.  _V )
84, 7syl 14 . . 3  |-  ( x  e.  ( v  e.  (Vtx `  G ) ,  n  e.  NN0  |->  { w  e.  (
n ClWWalksN  G )  |  ( w `  0 )  =  v } )  ->  G  e.  _V )
9 fveq2 5690 . . . . . 6  |-  ( g  =  G  ->  (Vtx `  g )  =  (Vtx
`  G ) )
10 eqidd 2239 . . . . . 6  |-  ( g  =  G  ->  NN0  =  NN0 )
11 oveq2 6083 . . . . . . 7  |-  ( g  =  G  ->  (
n ClWWalksN  g )  =  ( n ClWWalksN  G ) )
1211rabeqdv 2815 . . . . . 6  |-  ( g  =  G  ->  { w  e.  ( n ClWWalksN  g )  |  ( w ` 
0 )  =  v }  =  { w  e.  ( n ClWWalksN  G )  |  ( w ` 
0 )  =  v } )
139, 10, 12mpoeq123dv 6140 . . . . 5  |-  ( g  =  G  ->  (
v  e.  (Vtx `  g ) ,  n  e.  NN0  |->  { w  e.  ( n ClWWalksN  g )  |  ( w ` 
0 )  =  v } )  =  ( v  e.  (Vtx `  G ) ,  n  e.  NN0  |->  { w  e.  ( n ClWWalksN  G )  |  ( w ` 
0 )  =  v } ) )
14 id 19 . . . . 5  |-  ( G  e.  _V  ->  G  e.  _V )
15 vtxex 16173 . . . . . 6  |-  ( G  e.  _V  ->  (Vtx `  G )  e.  _V )
16 nn0ex 9548 . . . . . 6  |-  NN0  e.  _V
17 mpoexga 6438 . . . . . 6  |-  ( ( (Vtx `  G )  e.  _V  /\  NN0  e.  _V )  ->  ( v  e.  (Vtx `  G
) ,  n  e. 
NN0  |->  { w  e.  ( n ClWWalksN  G )  |  ( w ` 
0 )  =  v } )  e.  _V )
1815, 16, 17sylancl 417 . . . . 5  |-  ( G  e.  _V  ->  (
v  e.  (Vtx `  G ) ,  n  e.  NN0  |->  { w  e.  ( n ClWWalksN  G )  |  ( w ` 
0 )  =  v } )  e.  _V )
191, 13, 14, 18fvmptd3 5793 . . . 4  |-  ( G  e.  _V  ->  (ClWWalksNOn `  G )  =  ( v  e.  (Vtx `  G ) ,  n  e.  NN0  |->  { w  e.  ( n ClWWalksN  G )  |  ( w ` 
0 )  =  v } ) )
2019eleq2d 2308 . . 3  |-  ( G  e.  _V  ->  (
x  e.  (ClWWalksNOn `  G
)  <->  x  e.  (
v  e.  (Vtx `  G ) ,  n  e.  NN0  |->  { w  e.  ( n ClWWalksN  G )  |  ( w ` 
0 )  =  v } ) ) )
212, 8, 20pm5.21nii 716 . 2  |-  ( x  e.  (ClWWalksNOn `  G )  <->  x  e.  ( v  e.  (Vtx
`  G ) ,  n  e.  NN0  |->  { w  e.  ( n ClWWalksN  G )  |  ( w ` 
0 )  =  v } ) )
2221eqriv 2235 1  |-  (ClWWalksNOn `  G
)  =  ( v  e.  (Vtx `  G
) ,  n  e. 
NN0  |->  { w  e.  ( n ClWWalksN  G )  |  ( w ` 
0 )  =  v } )
Colors of variables: wff set class
Syntax hints:    = wceq 1402   E.wex 1545    e. wcel 2209   {crab 2532   _Vcvv 2821   ifcif 3635    X. cxp 4767   ` cfv 5372  (class class class)co 6075    e. cmpo 6077   1stc1st 6362   0cc0 8169   NN0cn0 9542   Basecbs 13330  Vtxcvtx 16167   ClWWalksN cclwwlkn 16558  ClWWalksNOncclwwlknon 16581
This theorem was proved from 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 4241  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-i2m1 8274
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  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-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-if 3636  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-inn 9284  df-n0 9543  df-ndx 13333  df-slot 13334  df-base 13336  df-vtx 16169  df-clwwlknon 16582
This theorem is referenced by:  clwwlknon  16584  clwwlk0on0  16586
  Copyright terms: Public domain W3C validator