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

Theorem wlkl1loop 16479
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 16447 . . . . 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 8284 . . . . . . . . . . . . 13  |-  0  e.  _V
54snid 3725 . . . . . . . . . . . 12  |-  0  e.  { 0 }
6 oveq2 6066 . . . . . . . . . . . . 13  |-  ( ( `  F )  =  1  ->  ( 0..^ ( `  F ) )  =  ( 0..^ 1 ) )
7 fzo01 10583 . . . . . . . . . . . . 13  |-  ( 0..^ 1 )  =  {
0 }
86, 7eqtrdi 2283 . . . . . . . . . . . 12  |-  ( ( `  F )  =  1  ->  ( 0..^ ( `  F ) )  =  { 0 } )
95, 8eleqtrrid 2324 . . . . . . . . . . 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 2234 . . . . . . . . . 10  |-  (iEdg `  G )  =  (iEdg `  G )
1312iedginwlk 16478 . . . . . . . . 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 2234 . . . . . . . . . . 11  |-  (Vtx `  G )  =  (Vtx
`  G )
1615, 12iswlkg 16450 . . . . . . . . . 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 2749 . . . . . . . . . . . . . . 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 6065 . . . . . . . . . . . . . . . . . 18  |-  ( k  =  0  ->  (
k  +  1 )  =  ( 0  +  1 ) )
19 0p1e1 9368 . . . . . . . . . . . . . . . . . 18  |-  ( 0  +  1 )  =  1
2018, 19eqtrdi 2283 . . . . . . . . . . . . . . . . 17  |-  ( k  =  0  ->  (
k  +  1 )  =  1 )
21 wkslem2 16442 . . . . . . . . . . . . . . . . 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 3737 . . . . . . . . . . . . . . 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 2240 . . . . . . . . . . . . . . 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 16180 . . . . . . . . 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 2318 . . . . . . 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 2205   A.wral 2522   _Vcvv 2815    C_ wss 3214   {csn 3694   {cpr 3695   class class class wbr 4114   dom cdm 4754   ran crn 4755   Fun wfun 5351   -->wf 5353   ` cfv 5357  (class class class)co 6058   0cc0 8143   1c1 8144    + caddc 8146   ...cfz 10361  ..^cfzo 10498  ♯chash 11163  Word cword 11249  Vtxcvtx 16133  iEdgciedg 16134  Edgcedg 16178  Walkscwlks 16438
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 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-mulcom 8244  ax-addass 8245  ax-mulass 8246  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-1rid 8250  ax-0id 8251  ax-rnegex 8252  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-apti 8258  ax-pre-ltadd 8259
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 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-if 3625  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-iord 4492  df-on 4494  df-ilim 4495  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-recs 6549  df-frec 6635  df-1o 6660  df-er 6780  df-map 6897  df-en 6989  df-dom 6990  df-fin 6991  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8462  df-neg 8463  df-inn 9255  df-2 9313  df-3 9314  df-4 9315  df-5 9316  df-6 9317  df-7 9318  df-8 9319  df-9 9320  df-n0 9514  df-z 9595  df-dec 9728  df-uz 9872  df-fz 10362  df-fzo 10499  df-ihash 11164  df-word 11250  df-ndx 13299  df-slot 13300  df-base 13302  df-edgf 16126  df-vtx 16135  df-iedg 16136  df-edg 16179  df-wlks 16439
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator