Theorem eupth2lem3lem7fi 16595

Description: Lemma for eupth2lem3fi 16597: Combining trlsegvdegfi 16588, eupth2lem3lem3fi 16591, eupth2lem3lem4fi 16594 and eupth2lem3lem6fi 16592. (Contributed by Mario Carneiro, 8-Apr-2015.) (Revised by AV, 27-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 ) ) ) )
eupth2lem3lem7fi.g	|- ( ph -> G e. UMGraph )
eupth2lem3lem7fi.v	|- ( ph -> V e. Fin )
eupth2lem3lem7fi.o	|- ( ph -> { x e. V | -. 2 || ( (VtxDeg ` X ) ` x ) } = if ( ( P ` 0 ) = ( P ` N ) , (/) , { ( P ` 0 ) , ( P ` N ) } ) )
eupth2lem3lem7fi.e	|- ( ph -> ( I ` ( F ` N ) ) = { ( P ` N ) , ( P ` ( N + 1 ) ) } )

Assertion

Ref	Expression
eupth2lem3lem7fi	|- ( ph -> ( -. 2 || ( (VtxDeg ` Z ) ` 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 eupth2lem3lem7fi

Step	Hyp	Ref	Expression
1		trlsegvdeg.v	. . . . 5 |- V = (Vtx ` G )
2		trlsegvdeg.i	. . . . 5 |- I = (iEdg ` G )
3		trlsegvdeg.f	. . . . 5 |- ( ph -> Fun I )
4		trlsegvdeg.n	. . . . 5 |- ( ph -> N e. ( 0..^ (♯ ` F ) ) )
5		trlsegvdeg.u	. . . . 5 |- ( ph -> U e. V )
6		trlsegvdeg.w	. . . . 5 |- ( ph -> F (Trails ` G ) P )
7		trlsegvdeg.vx	. . . . 5 |- ( ph -> (Vtx ` X ) = V )
8		trlsegvdeg.vy	. . . . 5 |- ( ph -> (Vtx ` Y ) = V )
9		trlsegvdeg.vz	. . . . 5 |- ( ph -> (Vtx ` Z ) = V )
10		trlsegvdeg.ix	. . . . 5 |- ( ph -> (iEdg ` X ) = ( I |` ( F " ( 0..^ N ) ) ) )
11		trlsegvdeg.iy	. . . . 5 |- ( ph -> (iEdg ` Y ) = { <. ( F ` N ) , ( I ` ( F ` N ) ) >. } )
12		trlsegvdeg.iz	. . . . 5 |- ( ph -> (iEdg ` Z ) = ( I |` ( F " ( 0 ... N ) ) ) )
13		eupth2lem3lem7fi.g	. . . . . 6 |- ( ph -> G e. UMGraph )
14		umgrupgr 16233	. . . . . 6 |- ( G e. UMGraph -> G e. UPGraph )
15	13, 14	syl 14	. . . . 5 |- ( ph -> G e. UPGraph )
16		eupth2lem3lem7fi.v	. . . . 5 |- ( ph -> V e. Fin )
17	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 15, 16	trlsegvdegfi 16588	. . . 4 |- ( ph -> ( (VtxDeg ` Z ) ` U ) = ( ( (VtxDeg ` X ) ` U ) + ( (VtxDeg ` Y ) ` U ) ) )
18	17	breq2d 4126	. . 3 |- ( ph -> ( 2 || ( (VtxDeg ` Z ) ` U ) <-> 2 || ( ( (VtxDeg ` X ) ` U ) + ( (VtxDeg ` Y ) ` U ) ) ) )
19	18	notbid 673	. 2 |- ( ph -> ( -. 2 || ( (VtxDeg ` Z ) ` U ) <-> -. 2 || ( ( (VtxDeg ` X ) ` U ) + ( (VtxDeg ` Y ) ` U ) ) ) )
20		eupth2lem3lem7fi.o	. . . 4 |- ( ph -> { x e. V | -. 2 || ( (VtxDeg ` X ) ` x ) } = if ( ( P ` 0 ) = ( P ` N ) , (/) , { ( P ` 0 ) , ( P ` N ) } ) )
21		eupth2lem3lem7fi.e	. . . . 5 |- ( ph -> ( I ` ( F ` N ) ) = { ( P ` N ) , ( P ` ( N + 1 ) ) } )
22		trliswlk 16507	. . . . . . . 8 |- ( F (Trails ` G ) P -> F (Walks ` G ) P )
23	1	wlkp 16455	. . . . . . . 8 |- ( F (Walks ` G ) P -> P : ( 0 ... (♯ ` F ) ) --> V )
24	6, 22, 23	3syl 17	. . . . . . 7 |- ( ph -> P : ( 0 ... (♯ ` F ) ) --> V )
25		elfzofz 10519	. . . . . . . 8 |- ( N e. ( 0..^ (♯ ` F ) ) -> N e. ( 0 ... (♯ ` F ) ) )
26	4, 25	syl 14	. . . . . . 7 |- ( ph -> N e. ( 0 ... (♯ ` F ) ) )
27	24, 26	ffvelcdmd 5818	. . . . . 6 |- ( ph -> ( P ` N ) e. V )
28		fzofzp1 10594	. . . . . . . 8 |- ( N e. ( 0..^ (♯ ` F ) ) -> ( N + 1 ) e. ( 0 ... (♯ ` F ) ) )
29	4, 28	syl 14	. . . . . . 7 |- ( ph -> ( N + 1 ) e. ( 0 ... (♯ ` F ) ) )
30	24, 29	ffvelcdmd 5818	. . . . . 6 |- ( ph -> ( P ` ( N + 1 ) ) e. V )
31		fidceq 7137	. . . . . 6 |- ( ( V e. Fin /\ ( P ` N ) e. V /\ ( P ` ( N + 1 ) ) e. V ) -> DECID ( P ` N ) = ( P ` ( N + 1 ) ) )
32	16, 27, 30, 31	syl3anc 1274	. . . . 5 |- ( ph -> DECID ( P ` N ) = ( P ` ( N + 1 ) ) )
33		ifpprsnssdc 3804	. . . . 5 |- ( ( ( I ` ( F ` N ) ) = { ( P ` N ) , ( P ` ( N + 1 ) ) } /\ DECID ( P ` N ) = ( P ` ( N + 1 ) ) ) -> if- ( ( P ` N ) = ( P ` ( N + 1 ) ) , ( I ` ( F ` N ) ) = { ( P ` N ) } , { ( P ` N ) , ( P ` ( N + 1 ) ) } C_ ( I ` ( F ` N ) ) ) )
34	21, 32, 33	syl2anc 411	. . . 4 |- ( ph -> if- ( ( P ` N ) = ( P ` ( N + 1 ) ) , ( I ` ( F ` N ) ) = { ( P ` N ) } , { ( P ` N ) , ( P ` ( N + 1 ) ) } C_ ( I ` ( F ` N ) ) ) )
35	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 15, 16, 20, 34	eupth2lem3lem3fi 16591	. . 3 |- ( ( ph /\ ( P ` N ) = ( P ` ( N + 1 ) ) ) -> ( -. 2 || ( ( (VtxDeg ` X ) ` U ) + ( (VtxDeg ` Y ) ` U ) ) <-> U e. if ( ( P ` 0 ) = ( P ` ( N + 1 ) ) , (/) , { ( P ` 0 ) , ( P ` ( N + 1 ) ) } ) ) )
36	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 20, 21	eupth2lem3lem5 16593	. . . . . 6 |- ( ph -> ( I ` ( F ` N ) ) e. ~P V )
37	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 16, 20, 34, 36	eupth2lem3lem4fi 16594	. . . . 5 |- ( ( 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 ) ) } ) ) )
38	37	3expa 1230	. . . 4 |- ( ( ( 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 ) ) } ) ) )
39		neanior 2501	. . . . 5 |- ( ( U =/= ( P ` N ) /\ U =/= ( P ` ( N + 1 ) ) ) <-> -. ( U = ( P ` N ) \/ U = ( P ` ( N + 1 ) ) ) )
40	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 15, 16, 20, 21	eupth2lem3lem6fi 16592	. . . . . 6 |- ( ( 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 ) ) } ) ) )
41	40	3expa 1230	. . . . 5 |- ( ( ( 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 ) ) } ) ) )
42	39, 41	sylan2br 288	. . . 4 |- ( ( ( 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 ) ) } ) ) )
43		fidceq 7137	. . . . . . . 8 |- ( ( V e. Fin /\ U e. V /\ ( P ` N ) e. V ) -> DECID U = ( P ` N ) )
44	16, 5, 27, 43	syl3anc 1274	. . . . . . 7 |- ( ph -> DECID U = ( P ` N ) )
45	44	adantr 276	. . . . . 6 |- ( ( ph /\ ( P ` N ) =/= ( P ` ( N + 1 ) ) ) -> DECID U = ( P ` N ) )
46		fidceq 7137	. . . . . . . 8 |- ( ( V e. Fin /\ U e. V /\ ( P ` ( N + 1 ) ) e. V ) -> DECID U = ( P ` ( N + 1 ) ) )
47	16, 5, 30, 46	syl3anc 1274	. . . . . . 7 |- ( ph -> DECID U = ( P ` ( N + 1 ) ) )
48	47	adantr 276	. . . . . 6 |- ( ( ph /\ ( P ` N ) =/= ( P ` ( N + 1 ) ) ) -> DECID U = ( P ` ( N + 1 ) ) )
49		dcor 944	. . . . . 6 |- (DECID U = ( P ` N ) -> (DECID U = ( P ` ( N + 1 ) ) -> DECID ( U = ( P ` N ) \/ U = ( P ` ( N + 1 ) ) ) ) )
50	45, 48, 49	sylc 62	. . . . 5 |- ( ( ph /\ ( P ` N ) =/= ( P ` ( N + 1 ) ) ) -> DECID ( U = ( P ` N ) \/ U = ( P ` ( N + 1 ) ) ) )
51		exmiddc 844	. . . . 5 |- (DECID ( U = ( P ` N ) \/ U = ( P ` ( N + 1 ) ) ) -> ( ( U = ( P ` N ) \/ U = ( P ` ( N + 1 ) ) ) \/ -. ( U = ( P ` N ) \/ U = ( P ` ( N + 1 ) ) ) ) )
52	50, 51	syl 14	. . . 4 |- ( ( ph /\ ( P ` N ) =/= ( P ` ( N + 1 ) ) ) -> ( ( U = ( P ` N ) \/ U = ( P ` ( N + 1 ) ) ) \/ -. ( U = ( P ` N ) \/ U = ( P ` ( N + 1 ) ) ) ) )
53	38, 42, 52	mpjaodan 806	. . 3 |- ( ( ph /\ ( P ` N ) =/= ( P ` ( N + 1 ) ) ) -> ( -. 2 || ( ( (VtxDeg ` X ) ` U ) + ( (VtxDeg ` Y ) ` U ) ) <-> U e. if ( ( P ` 0 ) = ( P ` ( N + 1 ) ) , (/) , { ( P ` 0 ) , ( P ` ( N + 1 ) ) } ) ) )
54		dcne 2425	. . . 4 |- (DECID ( P ` N ) = ( P ` ( N + 1 ) ) <-> ( ( P ` N ) = ( P ` ( N + 1 ) ) \/ ( P ` N ) =/= ( P ` ( N + 1 ) ) ) )
55	32, 54	sylib 122	. . 3 |- ( ph -> ( ( P ` N ) = ( P ` ( N + 1 ) ) \/ ( P ` N ) =/= ( P ` ( N + 1 ) ) ) )
56	35, 53, 55	mpjaodan 806	. 2 |- ( ph -> ( -. 2 || ( ( (VtxDeg ` X ) ` U ) + ( (VtxDeg ` Y ) ` U ) ) <-> U e. if ( ( P ` 0 ) = ( P ` ( N + 1 ) ) , (/) , { ( P ` 0 ) , ( P ` ( N + 1 ) ) } ) ) )
57	19, 56	bitrd 188	1 |- ( ph -> ( -. 2 || ( (VtxDeg ` Z ) ` U ) <-> U e. if ( ( P ` 0 ) = ( P ` ( N + 1 ) ) , (/) , { ( P ` 0 ) , ( P ` ( N + 1 ) ) } ) ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 716  DECID wdc 842  if-wif 986   = wceq 1398   e. wcel 2205   =/= wne 2414   {crab 2526   C_ wss 3214   (/)c0 3512   ifcif 3624   {csn 3694   {cpr 3695   <.cop 3697   class class class wbr 4114   |` cres 4756   "cima 4757   Fun wfun 5351   -->wf 5353   ` cfv 5357  (class class class)co 6058   Fincfn 6988   0cc0 8143   1c1 8144   + caddc 8146   2c2 9305   ...cfz 10361  ..^cfzo 10498  ♯chash 11163   || cdvds 12498  Vtxcvtx 16133  iEdgciedg 16134  UPGraphcupgr 16212  UMGraphcumgr 16213  VtxDegcvtxdg 16407  Walkscwlks 16438  Trailsctrls 16501

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

This theorem is referenced by:  eupth2lem3fi  16597