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

Theorem eupth2lem3lem6fi 16453
Description: If an edge (not a loop) is added to a trail, the degree of vertices not being end vertices of this edge remains odd if it was odd before (regarding the subgraphs induced by the involved trails). Remark: This seems to be not valid for hyperedges joining more vertices than  ( P ` 
0 ) and  ( P `
 N ): if there is a third vertex in the edge, and this vertex is already contained in the trail, then the degree of this vertex could be affected by this edge! (Contributed by Mario Carneiro, 8-Apr-2015.) (Revised by AV, 25-Feb-2021.)
Hypotheses
Ref Expression
trlsegvdeg.v  |-  V  =  (Vtx `  G )
trlsegvdeg.i  |-  I  =  (iEdg `  G )
trlsegvdeg.f  |-  ( ph  ->  Fun  I )
trlsegvdeg.n  |-  ( ph  ->  N  e.  ( 0..^ ( `  F )
) )
trlsegvdeg.u  |-  ( ph  ->  U  e.  V )
trlsegvdeg.w  |-  ( ph  ->  F (Trails `  G
) P )
trlsegvdeg.vx  |-  ( ph  ->  (Vtx `  X )  =  V )
trlsegvdeg.vy  |-  ( ph  ->  (Vtx `  Y )  =  V )
trlsegvdeg.vz  |-  ( ph  ->  (Vtx `  Z )  =  V )
trlsegvdeg.ix  |-  ( ph  ->  (iEdg `  X )  =  ( I  |`  ( F " ( 0..^ N ) ) ) )
trlsegvdeg.iy  |-  ( ph  ->  (iEdg `  Y )  =  { <. ( F `  N ) ,  ( I `  ( F `
 N ) )
>. } )
trlsegvdeg.iz  |-  ( ph  ->  (iEdg `  Z )  =  ( I  |`  ( F " ( 0 ... N ) ) ) )
eupth2lem3lem6fi.g  |-  ( ph  ->  G  e. UPGraph )
eupth2lem3lem6fi.v  |-  ( ph  ->  V  e.  Fin )
eupth2lem3lem6fi.o  |-  ( ph  ->  { x  e.  V  |  -.  2  ||  (
(VtxDeg `  X ) `  x ) }  =  if ( ( P ` 
0 )  =  ( P `  N ) ,  (/) ,  { ( P `  0 ) ,  ( P `  N ) } ) )
eupth2lem3lem6fi.e  |-  ( ph  ->  ( I `  ( F `  N )
)  =  { ( P `  N ) ,  ( P `  ( N  +  1
) ) } )
Assertion
Ref Expression
eupth2lem3lem6fi  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  ( -.  2  ||  ( ( (VtxDeg `  X ) `  U )  +  ( (VtxDeg `  Y ) `  U ) )  <->  U  e.  if ( ( P ` 
0 )  =  ( P `  ( N  +  1 ) ) ,  (/) ,  { ( P `  0 ) ,  ( P `  ( N  +  1
) ) } ) ) )
Distinct variable groups:    x, U    x, V    x, X
Allowed substitution hints:    ph( x)    P( x)    F( x)    G( x)    I( x)    N( x)    Y( x)    Z( x)

Proof of Theorem eupth2lem3lem6fi
StepHypRef Expression
1 trlsegvdeg.iy . . . . . . . 8  |-  ( ph  ->  (iEdg `  Y )  =  { <. ( F `  N ) ,  ( I `  ( F `
 N ) )
>. } )
213ad2ant1 1045 . . . . . . 7  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  (iEdg `  Y )  =  { <. ( F `  N
) ,  ( I `
 ( F `  N ) ) >. } )
3 trlsegvdeg.vy . . . . . . . 8  |-  ( ph  ->  (Vtx `  Y )  =  V )
433ad2ant1 1045 . . . . . . 7  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  (Vtx `  Y )  =  V )
5 trlsegvdeg.w . . . . . . . . . 10  |-  ( ph  ->  F (Trails `  G
) P )
6 trlsegvdeg.i . . . . . . . . . . 11  |-  I  =  (iEdg `  G )
76trlf1 16370 . . . . . . . . . 10  |-  ( F (Trails `  G ) P  ->  F : ( 0..^ ( `  F
) ) -1-1-> dom  I
)
8 f1f 5572 . . . . . . . . . 10  |-  ( F : ( 0..^ ( `  F ) ) -1-1-> dom  I  ->  F : ( 0..^ ( `  F
) ) --> dom  I
)
95, 7, 83syl 17 . . . . . . . . 9  |-  ( ph  ->  F : ( 0..^ ( `  F )
) --> dom  I )
10 trlsegvdeg.n . . . . . . . . 9  |-  ( ph  ->  N  e.  ( 0..^ ( `  F )
) )
119, 10ffvelcdmd 5812 . . . . . . . 8  |-  ( ph  ->  ( F `  N
)  e.  dom  I
)
12113ad2ant1 1045 . . . . . . 7  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  ( F `  N )  e.  dom  I )
13 trlsegvdeg.u . . . . . . . 8  |-  ( ph  ->  U  e.  V )
14133ad2ant1 1045 . . . . . . 7  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  U  e.  V )
15 eupth2lem3lem6fi.v . . . . . . . 8  |-  ( ph  ->  V  e.  Fin )
16153ad2ant1 1045 . . . . . . 7  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  V  e.  Fin )
17 trlsegvdeg.v . . . . . . . . 9  |-  V  =  (Vtx `  G )
1813, 3eleqtrrd 2312 . . . . . . . . . 10  |-  ( ph  ->  U  e.  (Vtx `  Y ) )
19 df-vtx 15996 . . . . . . . . . . 11  |- Vtx  =  ( g  e.  _V  |->  if ( g  e.  ( _V  X.  _V ) ,  ( 1st `  g
) ,  ( Base `  g ) ) )
2019mptrcl 5759 . . . . . . . . . 10  |-  ( U  e.  (Vtx `  Y
)  ->  Y  e.  _V )
2118, 20syl 14 . . . . . . . . 9  |-  ( ph  ->  Y  e.  _V )
22 trlsegvdeg.f . . . . . . . . . . . 12  |-  ( ph  ->  Fun  I )
2322funfnd 5382 . . . . . . . . . . 11  |-  ( ph  ->  I  Fn  dom  I
)
24 fnressn 5869 . . . . . . . . . . 11  |-  ( ( I  Fn  dom  I  /\  ( F `  N
)  e.  dom  I
)  ->  ( I  |` 
{ ( F `  N ) } )  =  { <. ( F `  N ) ,  ( I `  ( F `  N ) ) >. } )
2523, 11, 24syl2anc 411 . . . . . . . . . 10  |-  ( ph  ->  ( I  |`  { ( F `  N ) } )  =  { <. ( F `  N
) ,  ( I `
 ( F `  N ) ) >. } )
261, 25eqtr4d 2268 . . . . . . . . 9  |-  ( ph  ->  (iEdg `  Y )  =  ( I  |`  { ( F `  N ) } ) )
27 eupth2lem3lem6fi.g . . . . . . . . 9  |-  ( ph  ->  G  e. UPGraph )
2817, 6, 21, 3, 26, 27upgrspan 16261 . . . . . . . 8  |-  ( ph  ->  Y  e. UPGraph )
29283ad2ant1 1045 . . . . . . 7  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  Y  e. UPGraph )
30 funfvex 5686 . . . . . . . . 9  |-  ( ( Fun  I  /\  ( F `  N )  e.  dom  I )  -> 
( I `  ( F `  N )
)  e.  _V )
3122, 11, 30syl2anc 411 . . . . . . . 8  |-  ( ph  ->  ( I `  ( F `  N )
)  e.  _V )
32313ad2ant1 1045 . . . . . . 7  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  (
I `  ( F `  N ) )  e. 
_V )
33 eupth2lem3lem6fi.e . . . . . . . . 9  |-  ( ph  ->  ( I `  ( F `  N )
)  =  { ( P `  N ) ,  ( P `  ( N  +  1
) ) } )
34 simpl 109 . . . . . . . . . . . . . 14  |-  ( ( U  =/=  ( P `
 N )  /\  U  =/=  ( P `  ( N  +  1
) ) )  ->  U  =/=  ( P `  N ) )
3534adantl 277 . . . . . . . . . . . . 13  |-  ( ( ( P `  N
)  =/=  ( P `
 ( N  + 
1 ) )  /\  ( U  =/=  ( P `  N )  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  U  =/=  ( P `  N
) )
36 simpr 110 . . . . . . . . . . . . . 14  |-  ( ( U  =/=  ( P `
 N )  /\  U  =/=  ( P `  ( N  +  1
) ) )  ->  U  =/=  ( P `  ( N  +  1
) ) )
3736adantl 277 . . . . . . . . . . . . 13  |-  ( ( ( P `  N
)  =/=  ( P `
 ( N  + 
1 ) )  /\  ( U  =/=  ( P `  N )  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  U  =/=  ( P `  ( N  +  1 ) ) )
3835, 37nelprd 3714 . . . . . . . . . . . 12  |-  ( ( ( P `  N
)  =/=  ( P `
 ( N  + 
1 ) )  /\  ( U  =/=  ( P `  N )  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  -.  U  e.  { ( P `  N ) ,  ( P `  ( N  +  1
) ) } )
39 df-nel 2508 . . . . . . . . . . . 12  |-  ( U  e/  { ( P `
 N ) ,  ( P `  ( N  +  1 ) ) }  <->  -.  U  e.  { ( P `  N ) ,  ( P `  ( N  +  1 ) ) } )
4038, 39sylibr 134 . . . . . . . . . . 11  |-  ( ( ( P `  N
)  =/=  ( P `
 ( N  + 
1 ) )  /\  ( U  =/=  ( P `  N )  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  U  e/  { ( P `  N ) ,  ( P `  ( N  +  1 ) ) } )
41 neleq2 2512 . . . . . . . . . . 11  |-  ( ( I `  ( F `
 N ) )  =  { ( P `
 N ) ,  ( P `  ( N  +  1 ) ) }  ->  ( U  e/  ( I `  ( F `  N ) )  <->  U  e/  { ( P `  N ) ,  ( P `  ( N  +  1
) ) } ) )
4240, 41imbitrrid 156 . . . . . . . . . 10  |-  ( ( I `  ( F `
 N ) )  =  { ( P `
 N ) ,  ( P `  ( N  +  1 ) ) }  ->  (
( ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  U  e/  ( I `  ( F `  N )
) ) )
4342expd 258 . . . . . . . . 9  |-  ( ( I `  ( F `
 N ) )  =  { ( P `
 N ) ,  ( P `  ( N  +  1 ) ) }  ->  (
( P `  N
)  =/=  ( P `
 ( N  + 
1 ) )  -> 
( ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) )  ->  U  e/  ( I `  ( F `  N )
) ) ) )
4433, 43syl 14 . . . . . . . 8  |-  ( ph  ->  ( ( P `  N )  =/=  ( P `  ( N  +  1 ) )  ->  ( ( U  =/=  ( P `  N )  /\  U  =/=  ( P `  ( N  +  1 ) ) )  ->  U  e/  ( I `  ( F `  N )
) ) ) )
45443imp 1220 . . . . . . 7  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  U  e/  ( I `  ( F `  N )
) )
462, 4, 12, 14, 16, 29, 32, 451hevtxdg0fi 16289 . . . . . 6  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  (
(VtxDeg `  Y ) `  U )  =  0 )
4746oveq2d 6065 . . . . 5  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  (
( (VtxDeg `  X
) `  U )  +  ( (VtxDeg `  Y ) `  U
) )  =  ( ( (VtxDeg `  X
) `  U )  +  0 ) )
48 trlsegvdeg.vx . . . . . . . . 9  |-  ( ph  ->  (Vtx `  X )  =  V )
49 trlsegvdeg.vz . . . . . . . . 9  |-  ( ph  ->  (Vtx `  Z )  =  V )
50 trlsegvdeg.ix . . . . . . . . 9  |-  ( ph  ->  (iEdg `  X )  =  ( I  |`  ( F " ( 0..^ N ) ) ) )
51 trlsegvdeg.iz . . . . . . . . 9  |-  ( ph  ->  (iEdg `  Z )  =  ( I  |`  ( F " ( 0 ... N ) ) ) )
5217, 6, 22, 10, 13, 5, 48, 3, 49, 50, 1, 51, 27, 15eupth2lem3lem1fi 16450 . . . . . . . 8  |-  ( ph  ->  ( (VtxDeg `  X
) `  U )  e.  NN0 )
5352nn0cnd 9551 . . . . . . 7  |-  ( ph  ->  ( (VtxDeg `  X
) `  U )  e.  CC )
5453addridd 8418 . . . . . 6  |-  ( ph  ->  ( ( (VtxDeg `  X ) `  U
)  +  0 )  =  ( (VtxDeg `  X ) `  U
) )
55543ad2ant1 1045 . . . . 5  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  (
( (VtxDeg `  X
) `  U )  +  0 )  =  ( (VtxDeg `  X
) `  U )
)
5647, 55eqtrd 2265 . . . 4  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  (
( (VtxDeg `  X
) `  U )  +  ( (VtxDeg `  Y ) `  U
) )  =  ( (VtxDeg `  X ) `  U ) )
5756breq2d 4120 . . 3  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  (
2  ||  ( (
(VtxDeg `  X ) `  U )  +  ( (VtxDeg `  Y ) `  U ) )  <->  2  ||  ( (VtxDeg `  X ) `  U ) ) )
5857notbid 673 . 2  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  ( -.  2  ||  ( ( (VtxDeg `  X ) `  U )  +  ( (VtxDeg `  Y ) `  U ) )  <->  -.  2  ||  ( (VtxDeg `  X
) `  U )
) )
59 fveq2 5669 . . . . . . . 8  |-  ( x  =  U  ->  (
(VtxDeg `  X ) `  x )  =  ( (VtxDeg `  X ) `  U ) )
6059breq2d 4120 . . . . . . 7  |-  ( x  =  U  ->  (
2  ||  ( (VtxDeg `  X ) `  x
)  <->  2  ||  (
(VtxDeg `  X ) `  U ) ) )
6160notbid 673 . . . . . 6  |-  ( x  =  U  ->  ( -.  2  ||  ( (VtxDeg `  X ) `  x
)  <->  -.  2  ||  ( (VtxDeg `  X ) `  U ) ) )
6261elrab3 2973 . . . . 5  |-  ( U  e.  V  ->  ( U  e.  { x  e.  V  |  -.  2  ||  ( (VtxDeg `  X ) `  x
) }  <->  -.  2  ||  ( (VtxDeg `  X
) `  U )
) )
6313, 62syl 14 . . . 4  |-  ( ph  ->  ( U  e.  {
x  e.  V  |  -.  2  ||  ( (VtxDeg `  X ) `  x
) }  <->  -.  2  ||  ( (VtxDeg `  X
) `  U )
) )
64 eupth2lem3lem6fi.o . . . . 5  |-  ( ph  ->  { x  e.  V  |  -.  2  ||  (
(VtxDeg `  X ) `  x ) }  =  if ( ( P ` 
0 )  =  ( P `  N ) ,  (/) ,  { ( P `  0 ) ,  ( P `  N ) } ) )
6564eleq2d 2302 . . . 4  |-  ( ph  ->  ( U  e.  {
x  e.  V  |  -.  2  ||  ( (VtxDeg `  X ) `  x
) }  <->  U  e.  if ( ( P ` 
0 )  =  ( P `  N ) ,  (/) ,  { ( P `  0 ) ,  ( P `  N ) } ) ) )
6663, 65bitr3d 190 . . 3  |-  ( ph  ->  ( -.  2  ||  ( (VtxDeg `  X ) `  U )  <->  U  e.  if ( ( P ` 
0 )  =  ( P `  N ) ,  (/) ,  { ( P `  0 ) ,  ( P `  N ) } ) ) )
67663ad2ant1 1045 . 2  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  ( -.  2  ||  ( (VtxDeg `  X ) `  U
)  <->  U  e.  if ( ( P ` 
0 )  =  ( P `  N ) ,  (/) ,  { ( P `  0 ) ,  ( P `  N ) } ) ) )
68343ad2ant3 1047 . . . . . . 7  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  U  =/=  ( P `  N
) )
69363ad2ant3 1047 . . . . . . 7  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  U  =/=  ( P `  ( N  +  1 ) ) )
7068, 692thd 175 . . . . . 6  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  ( U  =/=  ( P `  N )  <->  U  =/=  ( P `  ( N  +  1 ) ) ) )
71 neeq1 2425 . . . . . . 7  |-  ( U  =  ( P ` 
0 )  ->  ( U  =/=  ( P `  N )  <->  ( P `  0 )  =/=  ( P `  N
) ) )
72 neeq1 2425 . . . . . . 7  |-  ( U  =  ( P ` 
0 )  ->  ( U  =/=  ( P `  ( N  +  1
) )  <->  ( P `  0 )  =/=  ( P `  ( N  +  1 ) ) ) )
7371, 72bibi12d 235 . . . . . 6  |-  ( U  =  ( P ` 
0 )  ->  (
( U  =/=  ( P `  N )  <->  U  =/=  ( P `  ( N  +  1
) ) )  <->  ( ( P `  0 )  =/=  ( P `  N
)  <->  ( P ` 
0 )  =/=  ( P `  ( N  +  1 ) ) ) ) )
7470, 73syl5ibcom 155 . . . . 5  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  ( U  =  ( P `  0 )  -> 
( ( P ` 
0 )  =/=  ( P `  N )  <->  ( P `  0 )  =/=  ( P `  ( N  +  1
) ) ) ) )
7574pm5.32rd 451 . . . 4  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  (
( ( P ` 
0 )  =/=  ( P `  N )  /\  U  =  ( P `  0 )
)  <->  ( ( P `
 0 )  =/=  ( P `  ( N  +  1 ) )  /\  U  =  ( P `  0
) ) ) )
7668neneqd 2433 . . . . . . 7  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  -.  U  =  ( P `  N ) )
77 biorf 752 . . . . . . 7  |-  ( -.  U  =  ( P `
 N )  -> 
( U  =  ( P `  0 )  <-> 
( U  =  ( P `  N )  \/  U  =  ( P `  0 ) ) ) )
7876, 77syl 14 . . . . . 6  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  ( U  =  ( P `  0 )  <->  ( U  =  ( P `  N )  \/  U  =  ( P ` 
0 ) ) ) )
79 orcom 736 . . . . . 6  |-  ( ( U  =  ( P `
 N )  \/  U  =  ( P `
 0 ) )  <-> 
( U  =  ( P `  0 )  \/  U  =  ( P `  N ) ) )
8078, 79bitrdi 196 . . . . 5  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  ( U  =  ( P `  0 )  <->  ( U  =  ( P ` 
0 )  \/  U  =  ( P `  N ) ) ) )
8180anbi2d 464 . . . 4  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  (
( ( P ` 
0 )  =/=  ( P `  N )  /\  U  =  ( P `  0 )
)  <->  ( ( P `
 0 )  =/=  ( P `  N
)  /\  ( U  =  ( P ` 
0 )  \/  U  =  ( P `  N ) ) ) ) )
8269neneqd 2433 . . . . . . 7  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  -.  U  =  ( P `  ( N  +  1 ) ) )
83 biorf 752 . . . . . . 7  |-  ( -.  U  =  ( P `
 ( N  + 
1 ) )  -> 
( U  =  ( P `  0 )  <-> 
( U  =  ( P `  ( N  +  1 ) )  \/  U  =  ( P `  0 ) ) ) )
8482, 83syl 14 . . . . . 6  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  ( U  =  ( P `  0 )  <->  ( U  =  ( P `  ( N  +  1
) )  \/  U  =  ( P ` 
0 ) ) ) )
85 orcom 736 . . . . . 6  |-  ( ( U  =  ( P `
 ( N  + 
1 ) )  \/  U  =  ( P `
 0 ) )  <-> 
( U  =  ( P `  0 )  \/  U  =  ( P `  ( N  +  1 ) ) ) )
8684, 85bitrdi 196 . . . . 5  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  ( U  =  ( P `  0 )  <->  ( U  =  ( P ` 
0 )  \/  U  =  ( P `  ( N  +  1
) ) ) ) )
8786anbi2d 464 . . . 4  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  (
( ( P ` 
0 )  =/=  ( P `  ( N  +  1 ) )  /\  U  =  ( P `  0 ) )  <->  ( ( P `
 0 )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =  ( P ` 
0 )  \/  U  =  ( P `  ( N  +  1
) ) ) ) ) )
8875, 81, 873bitr3d 218 . . 3  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  (
( ( P ` 
0 )  =/=  ( P `  N )  /\  ( U  =  ( P `  0 )  \/  U  =  ( P `  N ) ) )  <->  ( ( P `  0 )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =  ( P ` 
0 )  \/  U  =  ( P `  ( N  +  1
) ) ) ) ) )
89 eupth2lem1 16440 . . . 4  |-  ( U  e.  V  ->  ( U  e.  if (
( P `  0
)  =  ( P `
 N ) ,  (/) ,  { ( P `
 0 ) ,  ( P `  N
) } )  <->  ( ( P `  0 )  =/=  ( P `  N
)  /\  ( U  =  ( P ` 
0 )  \/  U  =  ( P `  N ) ) ) ) )
9014, 89syl 14 . . 3  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  ( U  e.  if (
( P `  0
)  =  ( P `
 N ) ,  (/) ,  { ( P `
 0 ) ,  ( P `  N
) } )  <->  ( ( P `  0 )  =/=  ( P `  N
)  /\  ( U  =  ( P ` 
0 )  \/  U  =  ( P `  N ) ) ) ) )
91 eupth2lem1 16440 . . . 4  |-  ( U  e.  V  ->  ( U  e.  if (
( P `  0
)  =  ( P `
 ( N  + 
1 ) ) ,  (/) ,  { ( P `
 0 ) ,  ( P `  ( N  +  1 ) ) } )  <->  ( ( P `  0 )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =  ( P ` 
0 )  \/  U  =  ( P `  ( N  +  1
) ) ) ) ) )
9214, 91syl 14 . . 3  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  ( U  e.  if (
( P `  0
)  =  ( P `
 ( N  + 
1 ) ) ,  (/) ,  { ( P `
 0 ) ,  ( P `  ( N  +  1 ) ) } )  <->  ( ( P `  0 )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =  ( P ` 
0 )  \/  U  =  ( P `  ( N  +  1
) ) ) ) ) )
9388, 90, 923bitr4d 220 . 2  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  ( U  e.  if (
( P `  0
)  =  ( P `
 N ) ,  (/) ,  { ( P `
 0 ) ,  ( P `  N
) } )  <->  U  e.  if ( ( P ` 
0 )  =  ( P `  ( N  +  1 ) ) ,  (/) ,  { ( P `  0 ) ,  ( P `  ( N  +  1
) ) } ) ) )
9458, 67, 933bitrd 214 1  |-  ( (
ph  /\  ( P `  N )  =/=  ( P `  ( N  +  1 ) )  /\  ( U  =/=  ( P `  N
)  /\  U  =/=  ( P `  ( N  +  1 ) ) ) )  ->  ( -.  2  ||  ( ( (VtxDeg `  X ) `  U )  +  ( (VtxDeg `  Y ) `  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    /\ wa 104    <-> wb 105    \/ wo 716    /\ w3a 1005    = wceq 1398    e. wcel 2203    =/= wne 2412    e/ wnel 2507   {crab 2524   _Vcvv 2812   (/)c0 3507   ifcif 3619   {csn 3688   {cpr 3689   <.cop 3691   class class class wbr 4108    X. cxp 4746   dom cdm 4748    |` cres 4750   "cima 4751   Fun wfun 5345    Fn wfn 5346   -->wf 5347   -1-1->wf1 5348   ` cfv 5351  (class class class)co 6049   1stc1st 6331   Fincfn 6974   0cc0 8123   1c1 8124    + caddc 8126   2c2 9284   ...cfz 10338  ..^cfzo 10472  ♯chash 11133    || cdvds 12466   Basecbs 13201  Vtxcvtx 15994  iEdgciedg 15995  UPGraphcupgr 16073  VtxDegcvtxdg 16268  Trailsctrls 16362
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 2205  ax-14 2206  ax-ext 2214  ax-coll 4224  ax-sep 4227  ax-nul 4235  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-iinf 4709  ax-cnex 8214  ax-resscn 8215  ax-1cn 8216  ax-1re 8217  ax-icn 8218  ax-addcl 8219  ax-addrcl 8220  ax-mulcl 8221  ax-addcom 8223  ax-mulcom 8224  ax-addass 8225  ax-mulass 8226  ax-distr 8227  ax-i2m1 8228  ax-0lt1 8229  ax-1rid 8230  ax-0id 8231  ax-rnegex 8232  ax-cnre 8234  ax-pre-ltirr 8235  ax-pre-ltwlin 8236  ax-pre-lttrn 8237  ax-pre-apti 8238  ax-pre-ltadd 8239
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 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2814  df-sbc 3042  df-csb 3138  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-nul 3508  df-if 3620  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-iun 3992  df-br 4109  df-opab 4171  df-mpt 4172  df-tr 4208  df-id 4413  df-iord 4486  df-on 4488  df-ilim 4489  df-suc 4491  df-iom 4712  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-f1 5356  df-fo 5357  df-f1o 5358  df-fv 5359  df-riota 6002  df-ov 6052  df-oprab 6053  df-mpo 6054  df-1st 6333  df-2nd 6334  df-recs 6535  df-frec 6621  df-1o 6646  df-2o 6647  df-er 6766  df-map 6883  df-en 6975  df-dom 6976  df-fin 6977  df-pnf 8306  df-mnf 8307  df-xr 8308  df-ltxr 8309  df-le 8310  df-sub 8442  df-neg 8443  df-inn 9234  df-2 9292  df-3 9293  df-4 9294  df-5 9295  df-6 9296  df-7 9297  df-8 9298  df-9 9299  df-n0 9493  df-z 9574  df-dec 9706  df-uz 9850  df-xadd 10102  df-fz 10339  df-fzo 10473  df-ihash 11134  df-word 11218  df-ndx 13204  df-slot 13205  df-base 13207  df-edgf 15987  df-vtx 15996  df-iedg 15997  df-edg 16040  df-uhgrm 16051  df-upgren 16075  df-subgr 16236  df-vtxdg 16269  df-wlks 16300  df-trls 16363
This theorem is referenced by:  eupth2lem3lem7fi  16456
  Copyright terms: Public domain W3C validator