Theorem umgr2adedgwlkonALT 26843

Description: Alternate proof for umgr2adedgwlkon 26842, using umgr2adedgwlk 26841, but with a much longer proof! In a multigraph, two adjacent edges form a walk between two (different) vertices. (Contributed by Alexander van der Vekens, 18-Feb-2018.) (Revised by AV, 30-Jan-2021.) (Proof modification is discouraged.) (New usage is discouraged.)

Hypotheses

Ref	Expression
umgr2adedgwlk.e	|- E = (Edg ` G )
umgr2adedgwlk.i	|- I = (iEdg ` G )
umgr2adedgwlk.f	|- F = <" J K ">
umgr2adedgwlk.p	|- P = <" A B C ">
umgr2adedgwlk.g	|- ( ph -> G e. UMGraph )
umgr2adedgwlk.a	|- ( ph -> ( { A , B } e. E /\ { B , C } e. E ) )
umgr2adedgwlk.j	|- ( ph -> ( I ` J ) = { A , B } )
umgr2adedgwlk.k	|- ( ph -> ( I ` K ) = { B , C } )

Assertion

Ref	Expression
umgr2adedgwlkonALT	|- ( ph -> F ( A (WalksOn ` G ) C ) P )

Proof of Theorem umgr2adedgwlkonALT

Step	Hyp	Ref	Expression
1		umgr2adedgwlk.e	. . . 4 |- E = (Edg ` G )
2		umgr2adedgwlk.i	. . . 4 |- I = (iEdg ` G )
3		umgr2adedgwlk.f	. . . 4 |- F = <" J K ">
4		umgr2adedgwlk.p	. . . 4 |- P = <" A B C ">
5		umgr2adedgwlk.g	. . . 4 |- ( ph -> G e. UMGraph )
6		umgr2adedgwlk.a	. . . 4 |- ( ph -> ( { A , B } e. E /\ { B , C } e. E ) )
7		umgr2adedgwlk.j	. . . 4 |- ( ph -> ( I ` J ) = { A , B } )
8		umgr2adedgwlk.k	. . . 4 |- ( ph -> ( I ` K ) = { B , C } )
9	1, 2, 3, 4, 5, 6, 7, 8	umgr2adedgwlk 26841	. . 3 |- ( ph -> ( F (Walks ` G ) P /\ ( # ` F ) = 2 /\ ( A = ( P ` 0 ) /\ B = ( P ` 1 ) /\ C = ( P ` 2 ) ) ) )
10		simp1 1061	. . . 4 |- ( ( F (Walks ` G ) P /\ ( # ` F ) = 2 /\ ( A = ( P ` 0 ) /\ B = ( P ` 1 ) /\ C = ( P ` 2 ) ) ) -> F (Walks ` G ) P )
11		id 22	. . . . . . 7 |- ( ( P ` 0 ) = A -> ( P ` 0 ) = A )
12	11	eqcoms 2630	. . . . . 6 |- ( A = ( P ` 0 ) -> ( P ` 0 ) = A )
13	12	3ad2ant1 1082	. . . . 5 |- ( ( A = ( P ` 0 ) /\ B = ( P ` 1 ) /\ C = ( P ` 2 ) ) -> ( P ` 0 ) = A )
14	13	3ad2ant3 1084	. . . 4 |- ( ( F (Walks ` G ) P /\ ( # ` F ) = 2 /\ ( A = ( P ` 0 ) /\ B = ( P ` 1 ) /\ C = ( P ` 2 ) ) ) -> ( P ` 0 ) = A )
15		fveq2 6191	. . . . . . . . . . . 12 |- ( 2 = ( # ` F ) -> ( P ` 2 ) = ( P ` ( # ` F ) ) )
16	15	eqcoms 2630	. . . . . . . . . . 11 |- ( ( # ` F ) = 2 -> ( P ` 2 ) = ( P ` ( # ` F ) ) )
17	16	eqeq1d 2624	. . . . . . . . . 10 |- ( ( # ` F ) = 2 -> ( ( P ` 2 ) = C <-> ( P ` ( # ` F ) ) = C ) )
18	17	biimpcd 239	. . . . . . . . 9 |- ( ( P ` 2 ) = C -> ( ( # ` F ) = 2 -> ( P ` ( # ` F ) ) = C ) )
19	18	eqcoms 2630	. . . . . . . 8 |- ( C = ( P ` 2 ) -> ( ( # ` F ) = 2 -> ( P ` ( # ` F ) ) = C ) )
20	19	3ad2ant3 1084	. . . . . . 7 |- ( ( A = ( P ` 0 ) /\ B = ( P ` 1 ) /\ C = ( P ` 2 ) ) -> ( ( # ` F ) = 2 -> ( P ` ( # ` F ) ) = C ) )
21	20	com12 32	. . . . . 6 |- ( ( # ` F ) = 2 -> ( ( A = ( P ` 0 ) /\ B = ( P ` 1 ) /\ C = ( P ` 2 ) ) -> ( P ` ( # ` F ) ) = C ) )
22	21	a1i 11	. . . . 5 |- ( F (Walks ` G ) P -> ( ( # ` F ) = 2 -> ( ( A = ( P ` 0 ) /\ B = ( P ` 1 ) /\ C = ( P ` 2 ) ) -> ( P ` ( # ` F ) ) = C ) ) )
23	22	3imp 1256	. . . 4 |- ( ( F (Walks ` G ) P /\ ( # ` F ) = 2 /\ ( A = ( P ` 0 ) /\ B = ( P ` 1 ) /\ C = ( P ` 2 ) ) ) -> ( P ` ( # ` F ) ) = C )
24	10, 14, 23	3jca 1242	. . 3 |- ( ( F (Walks ` G ) P /\ ( # ` F ) = 2 /\ ( A = ( P ` 0 ) /\ B = ( P ` 1 ) /\ C = ( P ` 2 ) ) ) -> ( F (Walks ` G ) P /\ ( P ` 0 ) = A /\ ( P ` ( # ` F ) ) = C ) )
25	9, 24	syl 17	. 2 |- ( ph -> ( F (Walks ` G ) P /\ ( P ` 0 ) = A /\ ( P ` ( # ` F ) ) = C ) )
26		3anass 1042	. . . . . 6 |- ( ( G e. UMGraph /\ { A , B } e. E /\ { B , C } e. E ) <-> ( G e. UMGraph /\ ( { A , B } e. E /\ { B , C } e. E ) ) )
27	5, 6, 26	sylanbrc 698	. . . . 5 |- ( ph -> ( G e. UMGraph /\ { A , B } e. E /\ { B , C } e. E ) )
28	1	umgr2adedgwlklem 26840	. . . . 5 |- ( ( G e. UMGraph /\ { A , B } e. E /\ { B , C } e. E ) -> ( ( A =/= B /\ B =/= C ) /\ ( A e. (Vtx ` G ) /\ B e. (Vtx ` G ) /\ C e. (Vtx ` G ) ) ) )
29		3simpb 1059	. . . . . 6 |- ( ( A e. (Vtx ` G ) /\ B e. (Vtx ` G ) /\ C e. (Vtx ` G ) ) -> ( A e. (Vtx ` G ) /\ C e. (Vtx ` G ) ) )
30	29	adantl 482	. . . . 5 |- ( ( ( A =/= B /\ B =/= C ) /\ ( A e. (Vtx ` G ) /\ B e. (Vtx ` G ) /\ C e. (Vtx ` G ) ) ) -> ( A e. (Vtx ` G ) /\ C e. (Vtx ` G ) ) )
31	27, 28, 30	3syl 18	. . . 4 |- ( ph -> ( A e. (Vtx ` G ) /\ C e. (Vtx ` G ) ) )
32		3anass 1042	. . . 4 |- ( ( G e. UMGraph /\ A e. (Vtx ` G ) /\ C e. (Vtx ` G ) ) <-> ( G e. UMGraph /\ ( A e. (Vtx ` G ) /\ C e. (Vtx ` G ) ) ) )
33	5, 31, 32	sylanbrc 698	. . 3 |- ( ph -> ( G e. UMGraph /\ A e. (Vtx ` G ) /\ C e. (Vtx ` G ) ) )
34		s2cli 13625	. . . . 5 |- <" J K "> e. Word _V
35	3, 34	eqeltri 2697	. . . 4 |- F e. Word _V
36		s3cli 13626	. . . . 5 |- <" A B C "> e. Word _V
37	4, 36	eqeltri 2697	. . . 4 |- P e. Word _V
38	35, 37	pm3.2i 471	. . 3 |- ( F e. Word _V /\ P e. Word _V )
39		id 22	. . . . . 6 |- ( ( A e. (Vtx ` G ) /\ C e. (Vtx ` G ) ) -> ( A e. (Vtx ` G ) /\ C e. (Vtx ` G ) ) )
40	39	3adant1 1079	. . . . 5 |- ( ( G e. UMGraph /\ A e. (Vtx ` G ) /\ C e. (Vtx ` G ) ) -> ( A e. (Vtx ` G ) /\ C e. (Vtx ` G ) ) )
41	40	anim1i 592	. . . 4 |- ( ( ( G e. UMGraph /\ A e. (Vtx ` G ) /\ C e. (Vtx ` G ) ) /\ ( F e. Word _V /\ P e. Word _V ) ) -> ( ( A e. (Vtx ` G ) /\ C e. (Vtx ` G ) ) /\ ( F e. Word _V /\ P e. Word _V ) ) )
42		eqid 2622	. . . . 5 |- (Vtx ` G ) = (Vtx ` G )
43	42	iswlkon 26553	. . . 4 |- ( ( ( A e. (Vtx ` G ) /\ C e. (Vtx ` G ) ) /\ ( F e. Word _V /\ P e. Word _V ) ) -> ( F ( A (WalksOn ` G ) C ) P <-> ( F (Walks ` G ) P /\ ( P ` 0 ) = A /\ ( P ` ( # ` F ) ) = C ) ) )
44	41, 43	syl 17	. . 3 |- ( ( ( G e. UMGraph /\ A e. (Vtx ` G ) /\ C e. (Vtx ` G ) ) /\ ( F e. Word _V /\ P e. Word _V ) ) -> ( F ( A (WalksOn ` G ) C ) P <-> ( F (Walks ` G ) P /\ ( P ` 0 ) = A /\ ( P ` ( # ` F ) ) = C ) ) )
45	33, 38, 44	sylancl 694	. 2 |- ( ph -> ( F ( A (WalksOn ` G ) C ) P <-> ( F (Walks ` G ) P /\ ( P ` 0 ) = A /\ ( P ` ( # ` F ) ) = C ) ) )
46	25, 45	mpbird 247	1 |- ( ph -> F ( A (WalksOn ` G ) C ) P )

Syntax hints:   -> wi 4   <-> wb 196   /\ wa 384   /\ w3a 1037   = wceq 1483   e. wcel 1990   =/= wne 2794   _Vcvv 3200   {cpr 4179   class class class wbr 4653   ` cfv 5888  (class class class)co 6650   0cc0 9936   1c1 9937   2c2 11070   #chash 13117  Word cword 13291   <"cs2 13586   <"cs3 13587  Vtxcvtx 25874  iEdgciedg 25875  Edgcedg 25939   UMGraph cumgr 25976  Walkscwlks 26492  WalksOncwlkson 26493

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-cnex 9992  ax-resscn 9993  ax-1cn 9994  ax-icn 9995  ax-addcl 9996  ax-addrcl 9997  ax-mulcl 9998  ax-mulrcl 9999  ax-mulcom 10000  ax-addass 10001  ax-mulass 10002  ax-distr 10003  ax-i2m1 10004  ax-1ne0 10005  ax-1rid 10006  ax-rnegex 10007  ax-rrecex 10008  ax-cnre 10009  ax-pre-lttri 10010  ax-pre-lttrn 10011  ax-pre-ltadd 10012  ax-pre-mulgt0 10013

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-ifp 1013  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-nel 2898  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-int 4476  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-riota 6611  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-om 7066  df-1st 7168  df-2nd 7169  df-wrecs 7407  df-recs 7468  df-rdg 7506  df-1o 7560  df-oadd 7564  df-er 7742  df-map 7859  df-pm 7860  df-en 7956  df-dom 7957  df-sdom 7958  df-fin 7959  df-card 8765  df-cda 8990  df-pnf 10076  df-mnf 10077  df-xr 10078  df-ltxr 10079  df-le 10080  df-sub 10268  df-neg 10269  df-nn 11021  df-2 11079  df-3 11080  df-n0 11293  df-z 11378  df-uz 11688  df-fz 12327  df-fzo 12466  df-hash 13118  df-word 13299  df-concat 13301  df-s1 13302  df-s2 13593  df-s3 13594  df-edg 25940  df-umgr 25978  df-wlks 26495  df-wlkson 26496

This theorem is referenced by: (None)