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

Theorem wlkvtxiedg 16286
Description: The vertices of a walk are connected by indexed edges. (Contributed by Alexander van der Vekens, 22-Jul-2018.) (Revised by AV, 2-Jan-2021.) (Proof shortened by AV, 4-Apr-2021.)
Hypothesis
Ref Expression
wlkvtxeledg.i  |-  I  =  (iEdg `  G )
Assertion
Ref Expression
wlkvtxiedg  |-  ( F (Walks `  G ) P  ->  A. k  e.  ( 0..^ ( `  F
) ) E. e  e.  ran  I { ( P `  k ) ,  ( P `  ( k  +  1 ) ) }  C_  e )
Distinct variable groups:    k, G    k, F    P, k    e, F   
e, G    e, I,
k    P, e

Proof of Theorem wlkvtxiedg
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 wlkv 16267 . . . 4  |-  ( F (Walks `  G ) P  ->  ( G  e. 
_V  /\  F  e.  _V  /\  P  e.  _V ) )
21simp1d 1036 . . 3  |-  ( F (Walks `  G ) P  ->  G  e.  _V )
3 wlkvtxeledg.i . . . 4  |-  I  =  (iEdg `  G )
43wlkvtxeledgg 16285 . . 3  |-  ( ( G  e.  _V  /\  F (Walks `  G ) P )  ->  A. k  e.  ( 0..^ ( `  F
) ) { ( P `  k ) ,  ( P `  ( k  +  1 ) ) }  C_  ( I `  ( F `  k )
) )
52, 4mpancom 422 . 2  |-  ( F (Walks `  G ) P  ->  A. k  e.  ( 0..^ ( `  F
) ) { ( P `  k ) ,  ( P `  ( k  +  1 ) ) }  C_  ( I `  ( F `  k )
) )
6 eqid 2231 . . . . . . . . . . . 12  |-  (Vtx `  G )  =  (Vtx
`  G )
76wlkpg 16276 . . . . . . . . . . 11  |-  ( ( G  e.  _V  /\  F (Walks `  G ) P )  ->  P : ( 0 ... ( `  F )
) --> (Vtx `  G
) )
87adantr 276 . . . . . . . . . 10  |-  ( ( ( G  e.  _V  /\  F (Walks `  G
) P )  /\  k  e.  ( 0..^ ( `  F )
) )  ->  P : ( 0 ... ( `  F )
) --> (Vtx `  G
) )
9 elfzofz 10460 . . . . . . . . . . 11  |-  ( k  e.  ( 0..^ ( `  F ) )  -> 
k  e.  ( 0 ... ( `  F
) ) )
109adantl 277 . . . . . . . . . 10  |-  ( ( ( G  e.  _V  /\  F (Walks `  G
) P )  /\  k  e.  ( 0..^ ( `  F )
) )  ->  k  e.  ( 0 ... ( `  F ) ) )
118, 10ffvelcdmd 5791 . . . . . . . . 9  |-  ( ( ( G  e.  _V  /\  F (Walks `  G
) P )  /\  k  e.  ( 0..^ ( `  F )
) )  ->  ( P `  k )  e.  (Vtx `  G )
)
12 prmg 3798 . . . . . . . . 9  |-  ( ( P `  k )  e.  (Vtx `  G
)  ->  E. x  x  e.  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) } )
1311, 12syl 14 . . . . . . . 8  |-  ( ( ( G  e.  _V  /\  F (Walks `  G
) P )  /\  k  e.  ( 0..^ ( `  F )
) )  ->  E. x  x  e.  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) } )
1413adantr 276 . . . . . . 7  |-  ( ( ( ( G  e. 
_V  /\  F (Walks `  G ) P )  /\  k  e.  ( 0..^ ( `  F
) ) )  /\  { ( P `  k
) ,  ( P `
 ( k  +  1 ) ) } 
C_  ( I `  ( F `  k ) ) )  ->  E. x  x  e.  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) } )
151simp2d 1037 . . . . . . . . . . . 12  |-  ( F (Walks `  G ) P  ->  F  e.  _V )
1615adantl 277 . . . . . . . . . . 11  |-  ( ( G  e.  _V  /\  F (Walks `  G ) P )  ->  F  e.  _V )
17 vex 2806 . . . . . . . . . . 11  |-  k  e. 
_V
18 fvexg 5667 . . . . . . . . . . 11  |-  ( ( F  e.  _V  /\  k  e.  _V )  ->  ( F `  k
)  e.  _V )
1916, 17, 18sylancl 413 . . . . . . . . . 10  |-  ( ( G  e.  _V  /\  F (Walks `  G ) P )  ->  ( F `  k )  e.  _V )
2019ad3antrrr 492 . . . . . . . . 9  |-  ( ( ( ( ( G  e.  _V  /\  F
(Walks `  G ) P )  /\  k  e.  ( 0..^ ( `  F
) ) )  /\  { ( P `  k
) ,  ( P `
 ( k  +  1 ) ) } 
C_  ( I `  ( F `  k ) ) )  /\  x  e.  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) } )  ->  ( F `  k )  e.  _V )
21 simplr 529 . . . . . . . . . . 11  |-  ( ( ( ( ( G  e.  _V  /\  F
(Walks `  G ) P )  /\  k  e.  ( 0..^ ( `  F
) ) )  /\  { ( P `  k
) ,  ( P `
 ( k  +  1 ) ) } 
C_  ( I `  ( F `  k ) ) )  /\  x  e.  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) } )  ->  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) }  C_  ( I `  ( F `  k )
) )
22 simpr 110 . . . . . . . . . . 11  |-  ( ( ( ( ( G  e.  _V  /\  F
(Walks `  G ) P )  /\  k  e.  ( 0..^ ( `  F
) ) )  /\  { ( P `  k
) ,  ( P `
 ( k  +  1 ) ) } 
C_  ( I `  ( F `  k ) ) )  /\  x  e.  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) } )  ->  x  e.  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) } )
2321, 22sseldd 3229 . . . . . . . . . 10  |-  ( ( ( ( ( G  e.  _V  /\  F
(Walks `  G ) P )  /\  k  e.  ( 0..^ ( `  F
) ) )  /\  { ( P `  k
) ,  ( P `
 ( k  +  1 ) ) } 
C_  ( I `  ( F `  k ) ) )  /\  x  e.  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) } )  ->  x  e.  ( I `  ( F `  k )
) )
24 fvmbr 5683 . . . . . . . . . 10  |-  ( x  e.  ( I `  ( F `  k ) )  ->  ( F `  k ) I ( I `  ( F `
 k ) ) )
2523, 24syl 14 . . . . . . . . 9  |-  ( ( ( ( ( G  e.  _V  /\  F
(Walks `  G ) P )  /\  k  e.  ( 0..^ ( `  F
) ) )  /\  { ( P `  k
) ,  ( P `
 ( k  +  1 ) ) } 
C_  ( I `  ( F `  k ) ) )  /\  x  e.  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) } )  ->  ( F `  k )
I ( I `  ( F `  k ) ) )
26 breq1 4096 . . . . . . . . 9  |-  ( y  =  ( F `  k )  ->  (
y I ( I `
 ( F `  k ) )  <->  ( F `  k ) I ( I `  ( F `
 k ) ) ) )
2720, 25, 26elabd 2952 . . . . . . . 8  |-  ( ( ( ( ( G  e.  _V  /\  F
(Walks `  G ) P )  /\  k  e.  ( 0..^ ( `  F
) ) )  /\  { ( P `  k
) ,  ( P `
 ( k  +  1 ) ) } 
C_  ( I `  ( F `  k ) ) )  /\  x  e.  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) } )  ->  E. y 
y I ( I `
 ( F `  k ) ) )
28 elfvfvex 5682 . . . . . . . . 9  |-  ( x  e.  ( I `  ( F `  k ) )  ->  ( I `  ( F `  k
) )  e.  _V )
29 elrng 4927 . . . . . . . . 9  |-  ( ( I `  ( F `
 k ) )  e.  _V  ->  (
( I `  ( F `  k )
)  e.  ran  I  <->  E. y  y I ( I `  ( F `
 k ) ) ) )
3023, 28, 293syl 17 . . . . . . . 8  |-  ( ( ( ( ( G  e.  _V  /\  F
(Walks `  G ) P )  /\  k  e.  ( 0..^ ( `  F
) ) )  /\  { ( P `  k
) ,  ( P `
 ( k  +  1 ) ) } 
C_  ( I `  ( F `  k ) ) )  /\  x  e.  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) } )  ->  (
( I `  ( F `  k )
)  e.  ran  I  <->  E. y  y I ( I `  ( F `
 k ) ) ) )
3127, 30mpbird 167 . . . . . . 7  |-  ( ( ( ( ( G  e.  _V  /\  F
(Walks `  G ) P )  /\  k  e.  ( 0..^ ( `  F
) ) )  /\  { ( P `  k
) ,  ( P `
 ( k  +  1 ) ) } 
C_  ( I `  ( F `  k ) ) )  /\  x  e.  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) } )  ->  (
I `  ( F `  k ) )  e. 
ran  I )
3214, 31exlimddv 1947 . . . . . 6  |-  ( ( ( ( G  e. 
_V  /\  F (Walks `  G ) P )  /\  k  e.  ( 0..^ ( `  F
) ) )  /\  { ( P `  k
) ,  ( P `
 ( k  +  1 ) ) } 
C_  ( I `  ( F `  k ) ) )  ->  (
I `  ( F `  k ) )  e. 
ran  I )
33 sseq2 3252 . . . . . . 7  |-  ( e  =  ( I `  ( F `  k ) )  ->  ( {
( P `  k
) ,  ( P `
 ( k  +  1 ) ) } 
C_  e  <->  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) }  C_  ( I `  ( F `  k )
) ) )
3433adantl 277 . . . . . 6  |-  ( ( ( ( ( G  e.  _V  /\  F
(Walks `  G ) P )  /\  k  e.  ( 0..^ ( `  F
) ) )  /\  { ( P `  k
) ,  ( P `
 ( k  +  1 ) ) } 
C_  ( I `  ( F `  k ) ) )  /\  e  =  ( I `  ( F `  k ) ) )  ->  ( { ( P `  k ) ,  ( P `  ( k  +  1 ) ) }  C_  e  <->  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) }  C_  ( I `  ( F `  k )
) ) )
35 simpr 110 . . . . . 6  |-  ( ( ( ( G  e. 
_V  /\  F (Walks `  G ) P )  /\  k  e.  ( 0..^ ( `  F
) ) )  /\  { ( P `  k
) ,  ( P `
 ( k  +  1 ) ) } 
C_  ( I `  ( F `  k ) ) )  ->  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) }  C_  ( I `  ( F `  k )
) )
3632, 34, 35rspcedvd 2917 . . . . 5  |-  ( ( ( ( G  e. 
_V  /\  F (Walks `  G ) P )  /\  k  e.  ( 0..^ ( `  F
) ) )  /\  { ( P `  k
) ,  ( P `
 ( k  +  1 ) ) } 
C_  ( I `  ( F `  k ) ) )  ->  E. e  e.  ran  I { ( P `  k ) ,  ( P `  ( k  +  1 ) ) }  C_  e )
3736ex 115 . . . 4  |-  ( ( ( G  e.  _V  /\  F (Walks `  G
) P )  /\  k  e.  ( 0..^ ( `  F )
) )  ->  ( { ( P `  k ) ,  ( P `  ( k  +  1 ) ) }  C_  ( I `  ( F `  k
) )  ->  E. e  e.  ran  I { ( P `  k ) ,  ( P `  ( k  +  1 ) ) }  C_  e ) )
3837ralimdva 2600 . . 3  |-  ( ( G  e.  _V  /\  F (Walks `  G ) P )  ->  ( A. k  e.  (
0..^ ( `  F )
) { ( P `
 k ) ,  ( P `  (
k  +  1 ) ) }  C_  (
I `  ( F `  k ) )  ->  A. k  e.  (
0..^ ( `  F )
) E. e  e. 
ran  I { ( P `  k ) ,  ( P `  ( k  +  1 ) ) }  C_  e ) )
392, 38mpancom 422 . 2  |-  ( F (Walks `  G ) P  ->  ( A. k  e.  ( 0..^ ( `  F
) ) { ( P `  k ) ,  ( P `  ( k  +  1 ) ) }  C_  ( I `  ( F `  k )
)  ->  A. k  e.  ( 0..^ ( `  F
) ) E. e  e.  ran  I { ( P `  k ) ,  ( P `  ( k  +  1 ) ) }  C_  e ) )
405, 39mpd 13 1  |-  ( F (Walks `  G ) P  ->  A. k  e.  ( 0..^ ( `  F
) ) E. e  e.  ran  I { ( P `  k ) ,  ( P `  ( k  +  1 ) ) }  C_  e )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398   E.wex 1541    e. wcel 2202   A.wral 2511   E.wrex 2512   _Vcvv 2803    C_ wss 3201   {cpr 3674   class class class wbr 4093   ran crn 4732   -->wf 5329   ` cfv 5333  (class class class)co 6028   0cc0 8092   1c1 8093    + caddc 8095   ...cfz 10305  ..^cfzo 10439  ♯chash 11100  Vtxcvtx 15953  iEdgciedg 15954  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-wlks 16259
This theorem is referenced by:  wlkvtxedg  16304
  Copyright terms: Public domain W3C validator