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

Theorem wlkl1loop 16513
Description: A walk of length 1 from a vertex to itself is a loop. (Contributed by AV, 23-Apr-2021.)
Assertion
Ref Expression
wlkl1loop  |-  ( ( ( Fun  (iEdg `  G )  /\  F
(Walks `  G ) P )  /\  (
( `  F )  =  1  /\  ( P `
 0 )  =  ( P `  1
) ) )  ->  { ( P ` 
0 ) }  e.  (Edg `  G ) )

Proof of Theorem wlkl1loop
Dummy variable  k is distinct from all other variables.
StepHypRef Expression
1 wlkv 16481 . . . . 5  |-  ( F (Walks `  G ) P  ->  ( G  e. 
_V  /\  F  e.  _V  /\  P  e.  _V ) )
2 simp3l 1056 . . . . . . . . 9  |-  ( ( G  e.  _V  /\  F (Walks `  G ) P  /\  ( Fun  (iEdg `  G )  /\  (
( `  F )  =  1  /\  ( P `
 0 )  =  ( P `  1
) ) ) )  ->  Fun  (iEdg `  G
) )
3 simp2 1029 . . . . . . . . 9  |-  ( ( G  e.  _V  /\  F (Walks `  G ) P  /\  ( Fun  (iEdg `  G )  /\  (
( `  F )  =  1  /\  ( P `
 0 )  =  ( P `  1
) ) ) )  ->  F (Walks `  G ) P )
4 c0ex 8310 . . . . . . . . . . . . 13  |-  0  e.  _V
54snid 3736 . . . . . . . . . . . 12  |-  0  e.  { 0 }
6 oveq2 6083 . . . . . . . . . . . . 13  |-  ( ( `  F )  =  1  ->  ( 0..^ ( `  F ) )  =  ( 0..^ 1 ) )
7 fzo01 10612 . . . . . . . . . . . . 13  |-  ( 0..^ 1 )  =  {
0 }
86, 7eqtrdi 2287 . . . . . . . . . . . 12  |-  ( ( `  F )  =  1  ->  ( 0..^ ( `  F ) )  =  { 0 } )
95, 8eleqtrrid 2328 . . . . . . . . . . 11  |-  ( ( `  F )  =  1  ->  0  e.  ( 0..^ ( `  F
) ) )
109ad2antrl 494 . . . . . . . . . 10  |-  ( ( Fun  (iEdg `  G
)  /\  ( ( `  F )  =  1  /\  ( P ` 
0 )  =  ( P `  1 ) ) )  ->  0  e.  ( 0..^ ( `  F
) ) )
11103ad2ant3 1051 . . . . . . . . 9  |-  ( ( G  e.  _V  /\  F (Walks `  G ) P  /\  ( Fun  (iEdg `  G )  /\  (
( `  F )  =  1  /\  ( P `
 0 )  =  ( P `  1
) ) ) )  ->  0  e.  ( 0..^ ( `  F
) ) )
12 eqid 2238 . . . . . . . . . 10  |-  (iEdg `  G )  =  (iEdg `  G )
1312iedginwlk 16512 . . . . . . . . 9  |-  ( ( Fun  (iEdg `  G
)  /\  F (Walks `  G ) P  /\  0  e.  ( 0..^ ( `  F )
) )  ->  (
(iEdg `  G ) `  ( F `  0
) )  e.  ran  (iEdg `  G ) )
142, 3, 11, 13syl3anc 1278 . . . . . . . 8  |-  ( ( G  e.  _V  /\  F (Walks `  G ) P  /\  ( Fun  (iEdg `  G )  /\  (
( `  F )  =  1  /\  ( P `
 0 )  =  ( P `  1
) ) ) )  ->  ( (iEdg `  G ) `  ( F `  0 )
)  e.  ran  (iEdg `  G ) )
15 eqid 2238 . . . . . . . . . . 11  |-  (Vtx `  G )  =  (Vtx
`  G )
1615, 12iswlkg 16484 . . . . . . . . . 10  |-  ( G  e.  _V  ->  ( F (Walks `  G ) P 
<->  ( F  e. Word  dom  (iEdg `  G )  /\  P : ( 0 ... ( `  F )
) --> (Vtx `  G
)  /\  A. k  e.  ( 0..^ ( `  F
) )if- ( ( P `  k )  =  ( P `  ( k  +  1 ) ) ,  ( (iEdg `  G ) `  ( F `  k
) )  =  {
( P `  k
) } ,  {
( P `  k
) ,  ( P `
 ( k  +  1 ) ) } 
C_  ( (iEdg `  G ) `  ( F `  k )
) ) ) ) )
178raleqdv 2755 . . . . . . . . . . . . . . 15  |-  ( ( `  F )  =  1  ->  ( A. k  e.  ( 0..^ ( `  F
) )if- ( ( P `  k )  =  ( P `  ( k  +  1 ) ) ,  ( (iEdg `  G ) `  ( F `  k
) )  =  {
( P `  k
) } ,  {
( P `  k
) ,  ( P `
 ( k  +  1 ) ) } 
C_  ( (iEdg `  G ) `  ( F `  k )
) )  <->  A. k  e.  { 0 }if- (
( P `  k
)  =  ( P `
 ( k  +  1 ) ) ,  ( (iEdg `  G
) `  ( F `  k ) )  =  { ( P `  k ) } ,  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) }  C_  ( (iEdg `  G ) `  ( F `  k )
) ) ) )
18 oveq1 6082 . . . . . . . . . . . . . . . . . 18  |-  ( k  =  0  ->  (
k  +  1 )  =  ( 0  +  1 ) )
19 0p1e1 9397 . . . . . . . . . . . . . . . . . 18  |-  ( 0  +  1 )  =  1
2018, 19eqtrdi 2287 . . . . . . . . . . . . . . . . 17  |-  ( k  =  0  ->  (
k  +  1 )  =  1 )
21 wkslem2 16476 . . . . . . . . . . . . . . . . 17  |-  ( ( k  =  0  /\  ( k  +  1 )  =  1 )  ->  (if- ( ( P `  k )  =  ( P `  ( k  +  1 ) ) ,  ( (iEdg `  G ) `  ( F `  k
) )  =  {
( P `  k
) } ,  {
( P `  k
) ,  ( P `
 ( k  +  1 ) ) } 
C_  ( (iEdg `  G ) `  ( F `  k )
) )  <-> if- ( ( P `  0 )  =  ( P ` 
1 ) ,  ( (iEdg `  G ) `  ( F `  0
) )  =  {
( P `  0
) } ,  {
( P `  0
) ,  ( P `
 1 ) } 
C_  ( (iEdg `  G ) `  ( F `  0 )
) ) ) )
2220, 21mpdan 425 . . . . . . . . . . . . . . . 16  |-  ( k  =  0  ->  (if- ( ( P `  k )  =  ( P `  ( k  +  1 ) ) ,  ( (iEdg `  G ) `  ( F `  k )
)  =  { ( P `  k ) } ,  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) }  C_  ( (iEdg `  G ) `  ( F `  k
) ) )  <-> if- ( ( P `  0 )  =  ( P ` 
1 ) ,  ( (iEdg `  G ) `  ( F `  0
) )  =  {
( P `  0
) } ,  {
( P `  0
) ,  ( P `
 1 ) } 
C_  ( (iEdg `  G ) `  ( F `  0 )
) ) ) )
234, 22ralsn 3748 . . . . . . . . . . . . . . 15  |-  ( A. k  e.  { 0 }if- ( ( P `  k )  =  ( P `  ( k  +  1 ) ) ,  ( (iEdg `  G ) `  ( F `  k )
)  =  { ( P `  k ) } ,  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) }  C_  ( (iEdg `  G ) `  ( F `  k
) ) )  <-> if- ( ( P `  0 )  =  ( P ` 
1 ) ,  ( (iEdg `  G ) `  ( F `  0
) )  =  {
( P `  0
) } ,  {
( P `  0
) ,  ( P `
 1 ) } 
C_  ( (iEdg `  G ) `  ( F `  0 )
) ) )
2417, 23bitrdi 196 . . . . . . . . . . . . . 14  |-  ( ( `  F )  =  1  ->  ( A. k  e.  ( 0..^ ( `  F
) )if- ( ( P `  k )  =  ( P `  ( k  +  1 ) ) ,  ( (iEdg `  G ) `  ( F `  k
) )  =  {
( P `  k
) } ,  {
( P `  k
) ,  ( P `
 ( k  +  1 ) ) } 
C_  ( (iEdg `  G ) `  ( F `  k )
) )  <-> if- ( ( P `  0 )  =  ( P ` 
1 ) ,  ( (iEdg `  G ) `  ( F `  0
) )  =  {
( P `  0
) } ,  {
( P `  0
) ,  ( P `
 1 ) } 
C_  ( (iEdg `  G ) `  ( F `  0 )
) ) ) )
2524ad2antrl 494 . . . . . . . . . . . . 13  |-  ( ( Fun  (iEdg `  G
)  /\  ( ( `  F )  =  1  /\  ( P ` 
0 )  =  ( P `  1 ) ) )  ->  ( A. k  e.  (
0..^ ( `  F )
)if- ( ( P `
 k )  =  ( P `  (
k  +  1 ) ) ,  ( (iEdg `  G ) `  ( F `  k )
)  =  { ( P `  k ) } ,  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) }  C_  ( (iEdg `  G ) `  ( F `  k
) ) )  <-> if- ( ( P `  0 )  =  ( P ` 
1 ) ,  ( (iEdg `  G ) `  ( F `  0
) )  =  {
( P `  0
) } ,  {
( P `  0
) ,  ( P `
 1 ) } 
C_  ( (iEdg `  G ) `  ( F `  0 )
) ) ) )
26 ifptru 1002 . . . . . . . . . . . . . . . . 17  |-  ( ( P `  0 )  =  ( P ` 
1 )  ->  (if- ( ( P ` 
0 )  =  ( P `  1 ) ,  ( (iEdg `  G ) `  ( F `  0 )
)  =  { ( P `  0 ) } ,  { ( P `  0 ) ,  ( P ` 
1 ) }  C_  ( (iEdg `  G ) `  ( F `  0
) ) )  <->  ( (iEdg `  G ) `  ( F `  0 )
)  =  { ( P `  0 ) } ) )
2726biimpa 296 . . . . . . . . . . . . . . . 16  |-  ( ( ( P `  0
)  =  ( P `
 1 )  /\ if- ( ( P ` 
0 )  =  ( P `  1 ) ,  ( (iEdg `  G ) `  ( F `  0 )
)  =  { ( P `  0 ) } ,  { ( P `  0 ) ,  ( P ` 
1 ) }  C_  ( (iEdg `  G ) `  ( F `  0
) ) ) )  ->  ( (iEdg `  G ) `  ( F `  0 )
)  =  { ( P `  0 ) } )
2827eqcomd 2244 . . . . . . . . . . . . . . 15  |-  ( ( ( P `  0
)  =  ( P `
 1 )  /\ if- ( ( P ` 
0 )  =  ( P `  1 ) ,  ( (iEdg `  G ) `  ( F `  0 )
)  =  { ( P `  0 ) } ,  { ( P `  0 ) ,  ( P ` 
1 ) }  C_  ( (iEdg `  G ) `  ( F `  0
) ) ) )  ->  { ( P `
 0 ) }  =  ( (iEdg `  G ) `  ( F `  0 )
) )
2928ex 115 . . . . . . . . . . . . . 14  |-  ( ( P `  0 )  =  ( P ` 
1 )  ->  (if- ( ( P ` 
0 )  =  ( P `  1 ) ,  ( (iEdg `  G ) `  ( F `  0 )
)  =  { ( P `  0 ) } ,  { ( P `  0 ) ,  ( P ` 
1 ) }  C_  ( (iEdg `  G ) `  ( F `  0
) ) )  ->  { ( P ` 
0 ) }  =  ( (iEdg `  G ) `  ( F `  0
) ) ) )
3029ad2antll 495 . . . . . . . . . . . . 13  |-  ( ( Fun  (iEdg `  G
)  /\  ( ( `  F )  =  1  /\  ( P ` 
0 )  =  ( P `  1 ) ) )  ->  (if- ( ( P ` 
0 )  =  ( P `  1 ) ,  ( (iEdg `  G ) `  ( F `  0 )
)  =  { ( P `  0 ) } ,  { ( P `  0 ) ,  ( P ` 
1 ) }  C_  ( (iEdg `  G ) `  ( F `  0
) ) )  ->  { ( P ` 
0 ) }  =  ( (iEdg `  G ) `  ( F `  0
) ) ) )
3125, 30sylbid 150 . . . . . . . . . . . 12  |-  ( ( Fun  (iEdg `  G
)  /\  ( ( `  F )  =  1  /\  ( P ` 
0 )  =  ( P `  1 ) ) )  ->  ( A. k  e.  (
0..^ ( `  F )
)if- ( ( P `
 k )  =  ( P `  (
k  +  1 ) ) ,  ( (iEdg `  G ) `  ( F `  k )
)  =  { ( P `  k ) } ,  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) }  C_  ( (iEdg `  G ) `  ( F `  k
) ) )  ->  { ( P ` 
0 ) }  =  ( (iEdg `  G ) `  ( F `  0
) ) ) )
3231com12 30 . . . . . . . . . . 11  |-  ( A. k  e.  ( 0..^ ( `  F )
)if- ( ( P `
 k )  =  ( P `  (
k  +  1 ) ) ,  ( (iEdg `  G ) `  ( F `  k )
)  =  { ( P `  k ) } ,  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) }  C_  ( (iEdg `  G ) `  ( F `  k
) ) )  -> 
( ( Fun  (iEdg `  G )  /\  (
( `  F )  =  1  /\  ( P `
 0 )  =  ( P `  1
) ) )  ->  { ( P ` 
0 ) }  =  ( (iEdg `  G ) `  ( F `  0
) ) ) )
33323ad2ant3 1051 . . . . . . . . . 10  |-  ( ( F  e. Word  dom  (iEdg `  G )  /\  P : ( 0 ... ( `  F )
) --> (Vtx `  G
)  /\  A. k  e.  ( 0..^ ( `  F
) )if- ( ( P `  k )  =  ( P `  ( k  +  1 ) ) ,  ( (iEdg `  G ) `  ( F `  k
) )  =  {
( P `  k
) } ,  {
( P `  k
) ,  ( P `
 ( k  +  1 ) ) } 
C_  ( (iEdg `  G ) `  ( F `  k )
) ) )  -> 
( ( Fun  (iEdg `  G )  /\  (
( `  F )  =  1  /\  ( P `
 0 )  =  ( P `  1
) ) )  ->  { ( P ` 
0 ) }  =  ( (iEdg `  G ) `  ( F `  0
) ) ) )
3416, 33biimtrdi 163 . . . . . . . . 9  |-  ( G  e.  _V  ->  ( F (Walks `  G ) P  ->  ( ( Fun  (iEdg `  G )  /\  ( ( `  F
)  =  1  /\  ( P `  0
)  =  ( P `
 1 ) ) )  ->  { ( P `  0 ) }  =  ( (iEdg `  G ) `  ( F `  0 )
) ) ) )
35343imp 1224 . . . . . . . 8  |-  ( ( G  e.  _V  /\  F (Walks `  G ) P  /\  ( Fun  (iEdg `  G )  /\  (
( `  F )  =  1  /\  ( P `
 0 )  =  ( P `  1
) ) ) )  ->  { ( P `
 0 ) }  =  ( (iEdg `  G ) `  ( F `  0 )
) )
36 edgvalg 16214 . . . . . . . . 9  |-  ( G  e.  _V  ->  (Edg `  G )  =  ran  (iEdg `  G ) )
37363ad2ant1 1049 . . . . . . . 8  |-  ( ( G  e.  _V  /\  F (Walks `  G ) P  /\  ( Fun  (iEdg `  G )  /\  (
( `  F )  =  1  /\  ( P `
 0 )  =  ( P `  1
) ) ) )  ->  (Edg `  G
)  =  ran  (iEdg `  G ) )
3814, 35, 373eltr4d 2322 . . . . . . 7  |-  ( ( G  e.  _V  /\  F (Walks `  G ) P  /\  ( Fun  (iEdg `  G )  /\  (
( `  F )  =  1  /\  ( P `
 0 )  =  ( P `  1
) ) ) )  ->  { ( P `
 0 ) }  e.  (Edg `  G
) )
39383exp 1233 . . . . . 6  |-  ( G  e.  _V  ->  ( F (Walks `  G ) P  ->  ( ( Fun  (iEdg `  G )  /\  ( ( `  F
)  =  1  /\  ( P `  0
)  =  ( P `
 1 ) ) )  ->  { ( P `  0 ) }  e.  (Edg `  G
) ) ) )
40393ad2ant1 1049 . . . . 5  |-  ( ( G  e.  _V  /\  F  e.  _V  /\  P  e.  _V )  ->  ( F (Walks `  G ) P  ->  ( ( Fun  (iEdg `  G )  /\  ( ( `  F
)  =  1  /\  ( P `  0
)  =  ( P `
 1 ) ) )  ->  { ( P `  0 ) }  e.  (Edg `  G
) ) ) )
411, 40mpcom 36 . . . 4  |-  ( F (Walks `  G ) P  ->  ( ( Fun  (iEdg `  G )  /\  ( ( `  F
)  =  1  /\  ( P `  0
)  =  ( P `
 1 ) ) )  ->  { ( P `  0 ) }  e.  (Edg `  G
) ) )
4241expd 258 . . 3  |-  ( F (Walks `  G ) P  ->  ( Fun  (iEdg `  G )  ->  (
( ( `  F
)  =  1  /\  ( P `  0
)  =  ( P `
 1 ) )  ->  { ( P `
 0 ) }  e.  (Edg `  G
) ) ) )
4342impcom 125 . 2  |-  ( ( Fun  (iEdg `  G
)  /\  F (Walks `  G ) P )  ->  ( ( ( `  F )  =  1  /\  ( P ` 
0 )  =  ( P `  1 ) )  ->  { ( P `  0 ) }  e.  (Edg `  G
) ) )
4443imp 124 1  |-  ( ( ( Fun  (iEdg `  G )  /\  F
(Walks `  G ) P )  /\  (
( `  F )  =  1  /\  ( P `
 0 )  =  ( P `  1
) ) )  ->  { ( P ` 
0 ) }  e.  (Edg `  G ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105  if-wif 990    /\ w3a 1009    = wceq 1402    e. wcel 2209   A.wral 2528   _Vcvv 2821    C_ wss 3220   {csn 3705   {cpr 3706   class class class wbr 4125   dom cdm 4769   ran crn 4770   Fun wfun 5366   -->wf 5368   ` cfv 5372  (class class class)co 6075   0cc0 8169   1c1 8170    + caddc 8172   ...cfz 10390  ..^cfzo 10527  ♯chash 11192  Word cword 11282  Vtxcvtx 16167  iEdgciedg 16168  Edgcedg 16212  Walkscwlks 16472
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-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-iinf 4730  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-addcom 8269  ax-mulcom 8270  ax-addass 8271  ax-mulass 8272  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-1rid 8276  ax-0id 8277  ax-rnegex 8278  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283  ax-pre-apti 8284  ax-pre-ltadd 8285
This theorem depends on definitions:  df-bi 117  df-dc 847  df-ifp 991  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 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-tr 4225  df-id 4433  df-iord 4506  df-on 4508  df-ilim 4509  df-suc 4511  df-iom 4733  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-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-recs 6566  df-frec 6652  df-1o 6677  df-er 6797  df-map 6914  df-en 7013  df-dom 7014  df-fin 7015  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-sub 8489  df-neg 8490  df-inn 9284  df-2 9342  df-3 9343  df-4 9344  df-5 9345  df-6 9346  df-7 9347  df-8 9348  df-9 9349  df-n0 9543  df-z 9624  df-dec 9757  df-uz 9901  df-fz 10391  df-fzo 10528  df-ihash 11193  df-word 11283  df-ndx 13333  df-slot 13334  df-base 13336  df-edgf 16160  df-vtx 16169  df-iedg 16170  df-edg 16213  df-wlks 16473
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator