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

Theorem eupth2lem3fi 16597
Description: Lemma for eupth2fi 16600. (Contributed by Mario Carneiro, 8-Apr-2015.) (Revised by AV, 26-Feb-2021.)
Hypotheses
Ref Expression
eupth2.v  |-  V  =  (Vtx `  G )
eupth2.i  |-  I  =  (iEdg `  G )
eupth2fi.g  |-  ( ph  ->  G  e. UMGraph )
eupth2.f  |-  ( ph  ->  Fun  I )
eupth2.p  |-  ( ph  ->  F (EulerPaths `  G
) P )
eupth2fi.fi  |-  ( ph  ->  V  e.  Fin )
eupth2.h  |-  H  = 
<. V ,  ( I  |`  ( F " (
0..^ N ) ) ) >.
eupth2.x  |-  X  = 
<. V ,  ( I  |`  ( F " (
0..^ ( N  + 
1 ) ) ) ) >.
eupth2.n  |-  ( ph  ->  N  e.  NN0 )
eupth2.l  |-  ( ph  ->  ( N  +  1 )  <_  ( `  F
) )
eupth2.u  |-  ( ph  ->  U  e.  V )
eupth2.o  |-  ( ph  ->  { x  e.  V  |  -.  2  ||  (
(VtxDeg `  H ) `  x ) }  =  if ( ( P ` 
0 )  =  ( P `  N ) ,  (/) ,  { ( P `  0 ) ,  ( P `  N ) } ) )
Assertion
Ref Expression
eupth2lem3fi  |-  ( ph  ->  ( -.  2  ||  ( (VtxDeg `  X ) `  U )  <->  U  e.  if ( ( P ` 
0 )  =  ( P `  ( N  +  1 ) ) ,  (/) ,  { ( P `  0 ) ,  ( P `  ( N  +  1
) ) } ) ) )
Distinct variable groups:    x, H    x, U    x, V
Allowed substitution hints:    ph( x)    P( x)    F( x)    G( x)    I( x)    N( x)    X( x)

Proof of Theorem eupth2lem3fi
Dummy variable  k is distinct from all other variables.
StepHypRef Expression
1 eupth2.v . 2  |-  V  =  (Vtx `  G )
2 eupth2.i . 2  |-  I  =  (iEdg `  G )
3 eupth2.f . 2  |-  ( ph  ->  Fun  I )
4 eupth2.n . . 3  |-  ( ph  ->  N  e.  NN0 )
5 eupth2.p . . . 4  |-  ( ph  ->  F (EulerPaths `  G
) P )
6 eupthiswlk 16576 . . . 4  |-  ( F (EulerPaths `  G ) P  ->  F (Walks `  G ) P )
7 wlkcl 16453 . . . 4  |-  ( F (Walks `  G ) P  ->  ( `  F )  e.  NN0 )
85, 6, 73syl 17 . . 3  |-  ( ph  ->  ( `  F )  e.  NN0 )
9 eupth2.l . . 3  |-  ( ph  ->  ( N  +  1 )  <_  ( `  F
) )
10 nn0p1elfzo 10543 . . 3  |-  ( ( N  e.  NN0  /\  ( `  F )  e. 
NN0  /\  ( N  +  1 )  <_ 
( `  F ) )  ->  N  e.  ( 0..^ ( `  F
) ) )
114, 8, 9, 10syl3anc 1274 . 2  |-  ( ph  ->  N  e.  ( 0..^ ( `  F )
) )
12 eupth2.u . 2  |-  ( ph  ->  U  e.  V )
13 eupthistrl 16575 . . 3  |-  ( F (EulerPaths `  G ) P  ->  F (Trails `  G ) P )
145, 13syl 14 . 2  |-  ( ph  ->  F (Trails `  G
) P )
15 eupth2.h . . . 4  |-  H  = 
<. V ,  ( I  |`  ( F " (
0..^ N ) ) ) >.
1615fveq2i 5678 . . 3  |-  (Vtx `  H )  =  (Vtx
`  <. V ,  ( I  |`  ( F " ( 0..^ N ) ) ) >. )
17 eupth2fi.fi . . . . 5  |-  ( ph  ->  V  e.  Fin )
1817elexd 2829 . . . 4  |-  ( ph  ->  V  e.  _V )
19 eupth2fi.g . . . . . . 7  |-  ( ph  ->  G  e. UMGraph )
20 iedgex 16140 . . . . . . 7  |-  ( G  e. UMGraph  ->  (iEdg `  G
)  e.  _V )
2119, 20syl 14 . . . . . 6  |-  ( ph  ->  (iEdg `  G )  e.  _V )
222, 21eqeltrid 2321 . . . . 5  |-  ( ph  ->  I  e.  _V )
23 resexg 5083 . . . . 5  |-  ( I  e.  _V  ->  (
I  |`  ( F "
( 0..^ N ) ) )  e.  _V )
2422, 23syl 14 . . . 4  |-  ( ph  ->  ( I  |`  ( F " ( 0..^ N ) ) )  e. 
_V )
25 opvtxfv 16143 . . . 4  |-  ( ( V  e.  _V  /\  ( I  |`  ( F
" ( 0..^ N ) ) )  e. 
_V )  ->  (Vtx ` 
<. V ,  ( I  |`  ( F " (
0..^ N ) ) ) >. )  =  V )
2618, 24, 25syl2anc 411 . . 3  |-  ( ph  ->  (Vtx `  <. V , 
( I  |`  ( F " ( 0..^ N ) ) ) >.
)  =  V )
2716, 26eqtrid 2279 . 2  |-  ( ph  ->  (Vtx `  H )  =  V )
28 eupthv 16567 . . . . . . . 8  |-  ( F (EulerPaths `  G ) P  ->  ( G  e. 
_V  /\  F  e.  _V  /\  P  e.  _V ) )
295, 28syl 14 . . . . . . 7  |-  ( ph  ->  ( G  e.  _V  /\  F  e.  _V  /\  P  e.  _V )
)
3029simp2d 1037 . . . . . 6  |-  ( ph  ->  F  e.  _V )
31 fvexg 5694 . . . . . 6  |-  ( ( F  e.  _V  /\  N  e.  NN0 )  -> 
( F `  N
)  e.  _V )
3230, 4, 31syl2anc 411 . . . . 5  |-  ( ph  ->  ( F `  N
)  e.  _V )
33 fvexg 5694 . . . . . 6  |-  ( ( I  e.  _V  /\  ( F `  N )  e.  _V )  -> 
( I `  ( F `  N )
)  e.  _V )
3422, 32, 33syl2anc 411 . . . . 5  |-  ( ph  ->  ( I `  ( F `  N )
)  e.  _V )
35 opexg 4349 . . . . 5  |-  ( ( ( F `  N
)  e.  _V  /\  ( I `  ( F `  N )
)  e.  _V )  -> 
<. ( F `  N
) ,  ( I `
 ( F `  N ) ) >.  e.  _V )
3632, 34, 35syl2anc 411 . . . 4  |-  ( ph  -> 
<. ( F `  N
) ,  ( I `
 ( F `  N ) ) >.  e.  _V )
37 snexg 4302 . . . 4  |-  ( <.
( F `  N
) ,  ( I `
 ( F `  N ) ) >.  e.  _V  ->  { <. ( F `  N ) ,  ( I `  ( F `  N ) ) >. }  e.  _V )
3836, 37syl 14 . . 3  |-  ( ph  ->  { <. ( F `  N ) ,  ( I `  ( F `
 N ) )
>. }  e.  _V )
39 opvtxfv 16143 . . 3  |-  ( ( V  e.  _V  /\  {
<. ( F `  N
) ,  ( I `
 ( F `  N ) ) >. }  e.  _V )  ->  (Vtx `  <. V ,  { <. ( F `  N ) ,  ( I `  ( F `
 N ) )
>. } >. )  =  V )
4018, 38, 39syl2anc 411 . 2  |-  ( ph  ->  (Vtx `  <. V ,  { <. ( F `  N ) ,  ( I `  ( F `
 N ) )
>. } >. )  =  V )
41 eupth2.x . . . 4  |-  X  = 
<. V ,  ( I  |`  ( F " (
0..^ ( N  + 
1 ) ) ) ) >.
4241fveq2i 5678 . . 3  |-  (Vtx `  X )  =  (Vtx
`  <. V ,  ( I  |`  ( F " ( 0..^ ( N  +  1 ) ) ) ) >. )
43 resexg 5083 . . . . 5  |-  ( I  e.  _V  ->  (
I  |`  ( F "
( 0..^ ( N  +  1 ) ) ) )  e.  _V )
4422, 43syl 14 . . . 4  |-  ( ph  ->  ( I  |`  ( F " ( 0..^ ( N  +  1 ) ) ) )  e. 
_V )
45 opvtxfv 16143 . . . 4  |-  ( ( V  e.  _V  /\  ( I  |`  ( F
" ( 0..^ ( N  +  1 ) ) ) )  e. 
_V )  ->  (Vtx ` 
<. V ,  ( I  |`  ( F " (
0..^ ( N  + 
1 ) ) ) ) >. )  =  V )
4618, 44, 45syl2anc 411 . . 3  |-  ( ph  ->  (Vtx `  <. V , 
( I  |`  ( F " ( 0..^ ( N  +  1 ) ) ) ) >.
)  =  V )
4742, 46eqtrid 2279 . 2  |-  ( ph  ->  (Vtx `  X )  =  V )
4815fveq2i 5678 . . 3  |-  (iEdg `  H )  =  (iEdg `  <. V ,  ( I  |`  ( F " ( 0..^ N ) ) ) >. )
49 opiedgfv 16146 . . . 4  |-  ( ( V  e.  _V  /\  ( I  |`  ( F
" ( 0..^ N ) ) )  e. 
_V )  ->  (iEdg ` 
<. V ,  ( I  |`  ( F " (
0..^ N ) ) ) >. )  =  ( I  |`  ( F " ( 0..^ N ) ) ) )
5018, 24, 49syl2anc 411 . . 3  |-  ( ph  ->  (iEdg `  <. V , 
( I  |`  ( F " ( 0..^ N ) ) ) >.
)  =  ( I  |`  ( F " (
0..^ N ) ) ) )
5148, 50eqtrid 2279 . 2  |-  ( ph  ->  (iEdg `  H )  =  ( I  |`  ( F " ( 0..^ N ) ) ) )
52 opiedgfv 16146 . . 3  |-  ( ( V  e.  _V  /\  {
<. ( F `  N
) ,  ( I `
 ( F `  N ) ) >. }  e.  _V )  ->  (iEdg `  <. V ,  { <. ( F `  N ) ,  ( I `  ( F `
 N ) )
>. } >. )  =  { <. ( F `  N
) ,  ( I `
 ( F `  N ) ) >. } )
5318, 38, 52syl2anc 411 . 2  |-  ( ph  ->  (iEdg `  <. V ,  { <. ( F `  N ) ,  ( I `  ( F `
 N ) )
>. } >. )  =  { <. ( F `  N
) ,  ( I `
 ( F `  N ) ) >. } )
5441fveq2i 5678 . . . 4  |-  (iEdg `  X )  =  (iEdg `  <. V ,  ( I  |`  ( F " ( 0..^ ( N  +  1 ) ) ) ) >. )
55 opiedgfv 16146 . . . . 5  |-  ( ( V  e.  _V  /\  ( I  |`  ( F
" ( 0..^ ( N  +  1 ) ) ) )  e. 
_V )  ->  (iEdg ` 
<. V ,  ( I  |`  ( F " (
0..^ ( N  + 
1 ) ) ) ) >. )  =  ( I  |`  ( F " ( 0..^ ( N  +  1 ) ) ) ) )
5618, 44, 55syl2anc 411 . . . 4  |-  ( ph  ->  (iEdg `  <. V , 
( I  |`  ( F " ( 0..^ ( N  +  1 ) ) ) ) >.
)  =  ( I  |`  ( F " (
0..^ ( N  + 
1 ) ) ) ) )
5754, 56eqtrid 2279 . . 3  |-  ( ph  ->  (iEdg `  X )  =  ( I  |`  ( F " ( 0..^ ( N  +  1 ) ) ) ) )
584nn0zd 9716 . . . . . 6  |-  ( ph  ->  N  e.  ZZ )
59 fzval3 10571 . . . . . . 7  |-  ( N  e.  ZZ  ->  (
0 ... N )  =  ( 0..^ ( N  +  1 ) ) )
6059eqcomd 2240 . . . . . 6  |-  ( N  e.  ZZ  ->  (
0..^ ( N  + 
1 ) )  =  ( 0 ... N
) )
6158, 60syl 14 . . . . 5  |-  ( ph  ->  ( 0..^ ( N  +  1 ) )  =  ( 0 ... N ) )
6261imaeq2d 5106 . . . 4  |-  ( ph  ->  ( F " (
0..^ ( N  + 
1 ) ) )  =  ( F "
( 0 ... N
) ) )
6362reseq2d 5043 . . 3  |-  ( ph  ->  ( I  |`  ( F " ( 0..^ ( N  +  1 ) ) ) )  =  ( I  |`  ( F " ( 0 ... N ) ) ) )
6457, 63eqtrd 2267 . 2  |-  ( ph  ->  (iEdg `  X )  =  ( I  |`  ( F " ( 0 ... N ) ) ) )
65 eupth2.o . 2  |-  ( ph  ->  { x  e.  V  |  -.  2  ||  (
(VtxDeg `  H ) `  x ) }  =  if ( ( P ` 
0 )  =  ( P `  N ) ,  (/) ,  { ( P `  0 ) ,  ( P `  N ) } ) )
66 2fveq3 5680 . . . 4  |-  ( k  =  N  ->  (
I `  ( F `  k ) )  =  ( I `  ( F `  N )
) )
67 fveq2 5675 . . . . 5  |-  ( k  =  N  ->  ( P `  k )  =  ( P `  N ) )
68 fvoveq1 6081 . . . . 5  |-  ( k  =  N  ->  ( P `  ( k  +  1 ) )  =  ( P `  ( N  +  1
) ) )
6967, 68preq12d 3781 . . . 4  |-  ( k  =  N  ->  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) }  =  { ( P `  N ) ,  ( P `  ( N  +  1 ) ) } )
7066, 69eqeq12d 2249 . . 3  |-  ( k  =  N  ->  (
( I `  ( F `  k )
)  =  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) }  <->  ( I `  ( F `  N
) )  =  {
( P `  N
) ,  ( P `
 ( N  + 
1 ) ) } ) )
71 umgrupgr 16233 . . . . 5  |-  ( G  e. UMGraph  ->  G  e. UPGraph )
7219, 71syl 14 . . . 4  |-  ( ph  ->  G  e. UPGraph )
735, 6syl 14 . . . 4  |-  ( ph  ->  F (Walks `  G
) P )
742upgrwlkedg 16482 . . . 4  |-  ( ( G  e. UPGraph  /\  F (Walks `  G ) P )  ->  A. k  e.  ( 0..^ ( `  F
) ) ( I `
 ( F `  k ) )  =  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) } )
7572, 73, 74syl2anc 411 . . 3  |-  ( ph  ->  A. k  e.  ( 0..^ ( `  F
) ) ( I `
 ( F `  k ) )  =  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) } )
7670, 75, 11rspcdva 2928 . 2  |-  ( ph  ->  ( I `  ( F `  N )
)  =  { ( P `  N ) ,  ( P `  ( N  +  1
) ) } )
771, 2, 3, 11, 12, 14, 27, 40, 47, 51, 53, 64, 19, 17, 65, 76eupth2lem3lem7fi 16595 1  |-  ( ph  ->  ( -.  2  ||  ( (VtxDeg `  X ) `  U )  <->  U  e.  if ( ( P ` 
0 )  =  ( P `  ( N  +  1 ) ) ,  (/) ,  { ( P `  0 ) ,  ( P `  ( N  +  1
) ) } ) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 105    /\ w3a 1005    = wceq 1398    e. wcel 2205   A.wral 2522   {crab 2526   _Vcvv 2815   (/)c0 3512   ifcif 3624   {csn 3694   {cpr 3695   <.cop 3697   class class class wbr 4114    |` cres 4756   "cima 4757   Fun wfun 5351   ` cfv 5357  (class class class)co 6058   Fincfn 6988   0cc0 8143   1c1 8144    + caddc 8146    <_ cle 8325   2c2 9305   NN0cn0 9513   ZZcz 9594   ...cfz 10361  ..^cfzo 10498  ♯chash 11163    || cdvds 12498  Vtxcvtx 16133  iEdgciedg 16134  UPGraphcupgr 16212  UMGraphcumgr 16213  VtxDegcvtxdg 16407  Walkscwlks 16438  Trailsctrls 16501  EulerPathsceupth 16563
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-mulrcl 8242  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-precex 8253  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-apti 8258  ax-pre-ltadd 8259  ax-pre-mulgt0 8260  ax-pre-mulext 8261  ax-arch 8262
This theorem depends on definitions:  df-bi 117  df-stab 839  df-dc 843  df-ifp 987  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-xor 1421  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-rmo 2530  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-po 4422  df-iso 4423  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-irdg 6614  df-frec 6635  df-1o 6660  df-2o 6661  df-oadd 6664  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-reap 8866  df-ap 8873  df-div 8964  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-q 9970  df-rp 10005  df-xadd 10125  df-fz 10362  df-fzo 10499  df-fl 10654  df-mod 10709  df-seqfrec 10834  df-exp 10925  df-ihash 11164  df-word 11250  df-cj 11552  df-re 11553  df-im 11554  df-rsqrt 11708  df-abs 11709  df-dvds 12499  df-ndx 13299  df-slot 13300  df-base 13302  df-edgf 16126  df-vtx 16135  df-iedg 16136  df-edg 16179  df-uhgrm 16190  df-ushgrm 16191  df-upgren 16214  df-umgren 16215  df-uspgren 16276  df-subgr 16375  df-vtxdg 16408  df-wlks 16439  df-trls 16502  df-eupth 16564
This theorem is referenced by:  eupth2lemsfi  16599
  Copyright terms: Public domain W3C validator