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

Theorem wlkl1loop 16299
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 16267 . . . . 5  |-  ( F (Walks `  G ) P  ->  ( G  e. 
_V  /\  F  e.  _V  /\  P  e.  _V ) )
2 simp3l 1052 . . . . . . . . 9  |-  ( ( G  e.  _V  /\  F (Walks `  G ) P  /\  ( Fun  (iEdg `  G )  /\  (
( `  F )  =  1  /\  ( P `
 0 )  =  ( P `  1
) ) ) )  ->  Fun  (iEdg `  G
) )
3 simp2 1025 . . . . . . . . 9  |-  ( ( G  e.  _V  /\  F (Walks `  G ) P  /\  ( Fun  (iEdg `  G )  /\  (
( `  F )  =  1  /\  ( P `
 0 )  =  ( P `  1
) ) ) )  ->  F (Walks `  G ) P )
4 c0ex 8233 . . . . . . . . . . . . 13  |-  0  e.  _V
54snid 3704 . . . . . . . . . . . 12  |-  0  e.  { 0 }
6 oveq2 6036 . . . . . . . . . . . . 13  |-  ( ( `  F )  =  1  ->  ( 0..^ ( `  F ) )  =  ( 0..^ 1 ) )
7 fzo01 10524 . . . . . . . . . . . . 13  |-  ( 0..^ 1 )  =  {
0 }
86, 7eqtrdi 2280 . . . . . . . . . . . 12  |-  ( ( `  F )  =  1  ->  ( 0..^ ( `  F ) )  =  { 0 } )
95, 8eleqtrrid 2321 . . . . . . . . . . 11  |-  ( ( `  F )  =  1  ->  0  e.  ( 0..^ ( `  F
) ) )
109ad2antrl 490 . . . . . . . . . 10  |-  ( ( Fun  (iEdg `  G
)  /\  ( ( `  F )  =  1  /\  ( P ` 
0 )  =  ( P `  1 ) ) )  ->  0  e.  ( 0..^ ( `  F
) ) )
11103ad2ant3 1047 . . . . . . . . 9  |-  ( ( G  e.  _V  /\  F (Walks `  G ) P  /\  ( Fun  (iEdg `  G )  /\  (
( `  F )  =  1  /\  ( P `
 0 )  =  ( P `  1
) ) ) )  ->  0  e.  ( 0..^ ( `  F
) ) )
12 eqid 2231 . . . . . . . . . 10  |-  (iEdg `  G )  =  (iEdg `  G )
1312iedginwlk 16298 . . . . . . . . 9  |-  ( ( Fun  (iEdg `  G
)  /\  F (Walks `  G ) P  /\  0  e.  ( 0..^ ( `  F )
) )  ->  (
(iEdg `  G ) `  ( F `  0
) )  e.  ran  (iEdg `  G ) )
142, 3, 11, 13syl3anc 1274 . . . . . . . 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 2231 . . . . . . . . . . 11  |-  (Vtx `  G )  =  (Vtx
`  G )
1615, 12iswlkg 16270 . . . . . . . . . 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 2737 . . . . . . . . . . . . . . 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 6035 . . . . . . . . . . . . . . . . . 18  |-  ( k  =  0  ->  (
k  +  1 )  =  ( 0  +  1 ) )
19 0p1e1 9316 . . . . . . . . . . . . . . . . . 18  |-  ( 0  +  1 )  =  1
2018, 19eqtrdi 2280 . . . . . . . . . . . . . . . . 17  |-  ( k  =  0  ->  (
k  +  1 )  =  1 )
21 wkslem2 16262 . . . . . . . . . . . . . . . . 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 421 . . . . . . . . . . . . . . . 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 3716 . . . . . . . . . . . . . . 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 490 . . . . . . . . . . . . 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 998 . . . . . . . . . . . . . . . . 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 2237 . . . . . . . . . . . . . . 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 491 . . . . . . . . . . . . 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 1047 . . . . . . . . . 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 1220 . . . . . . . 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 16000 . . . . . . . . 9  |-  ( G  e.  _V  ->  (Edg `  G )  =  ran  (iEdg `  G ) )
37363ad2ant1 1045 . . . . . . . 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 2315 . . . . . . 7  |-  ( ( G  e.  _V  /\  F (Walks `  G ) P  /\  ( Fun  (iEdg `  G )  /\  (
( `  F )  =  1  /\  ( P `
 0 )  =  ( P `  1
) ) ) )  ->  { ( P `
 0 ) }  e.  (Edg `  G
) )
39383exp 1229 . . . . . 6  |-  ( G  e.  _V  ->  ( F (Walks `  G ) P  ->  ( ( Fun  (iEdg `  G )  /\  ( ( `  F
)  =  1  /\  ( P `  0
)  =  ( P `
 1 ) ) )  ->  { ( P `  0 ) }  e.  (Edg `  G
) ) ) )
40393ad2ant1 1045 . . . . 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 986    /\ w3a 1005    = wceq 1398    e. wcel 2202   A.wral 2511   _Vcvv 2803    C_ wss 3201   {csn 3673   {cpr 3674   class class class wbr 4093   dom cdm 4731   ran crn 4732   Fun wfun 5327   -->wf 5329   ` cfv 5333  (class class class)co 6028   0cc0 8092   1c1 8093    + caddc 8095   ...cfz 10305  ..^cfzo 10439  ♯chash 11100  Word cword 11179  Vtxcvtx 15953  iEdgciedg 15954  Edgcedg 15998  Walkscwlks 16258
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692  ax-cnex 8183  ax-resscn 8184  ax-1cn 8185  ax-1re 8186  ax-icn 8187  ax-addcl 8188  ax-addrcl 8189  ax-mulcl 8190  ax-addcom 8192  ax-mulcom 8193  ax-addass 8194  ax-mulass 8195  ax-distr 8196  ax-i2m1 8197  ax-0lt1 8198  ax-1rid 8199  ax-0id 8200  ax-rnegex 8201  ax-cnre 8203  ax-pre-ltirr 8204  ax-pre-ltwlin 8205  ax-pre-lttrn 8206  ax-pre-apti 8207  ax-pre-ltadd 8208
This theorem depends on definitions:  df-bi 117  df-dc 843  df-ifp 987  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-if 3608  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-iord 4469  df-on 4471  df-ilim 4472  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-recs 6514  df-frec 6600  df-1o 6625  df-er 6745  df-map 6862  df-en 6953  df-dom 6954  df-fin 6955  df-pnf 8275  df-mnf 8276  df-xr 8277  df-ltxr 8278  df-le 8279  df-sub 8411  df-neg 8412  df-inn 9203  df-2 9261  df-3 9262  df-4 9263  df-5 9264  df-6 9265  df-7 9266  df-8 9267  df-9 9268  df-n0 9462  df-z 9541  df-dec 9673  df-uz 9817  df-fz 10306  df-fzo 10440  df-ihash 11101  df-word 11180  df-ndx 13165  df-slot 13166  df-base 13168  df-edgf 15946  df-vtx 15955  df-iedg 15956  df-edg 15999  df-wlks 16259
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator