Metamath Proof Explorer

Theorem umgrwwlks2on

Description: A walk of length 2 between two vertices as word in a multigraph. This theorem would also hold for pseudographs, but to prove this the cases A = B and/or B = C must be considered separately. (Contributed by Alexander van der Vekens, 18-Feb-2018) (Revised by AV, 12-May-2021)

Ref Expression
Hypotheses s3wwlks2on.v ⊢ 𝑉 = ( Vtx ‘ 𝐺 )
usgrwwlks2on.e ⊢ 𝐸 = ( Edg ‘ 𝐺 )
Assertion umgrwwlks2on ( ( 𝐺 ∈ UMGraph ∧ ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) ) → ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ∈ ( 𝐴 ( 2 WWalksNOn 𝐺 ) 𝐶 ) ↔ ( { 𝐴 , 𝐵 } ∈ 𝐸 ∧ { 𝐵 , 𝐶 } ∈ 𝐸 ) ) )

Proof

Step Hyp Ref Expression
1 s3wwlks2on.v ⊢ 𝑉 = ( Vtx ‘ 𝐺 )
2 usgrwwlks2on.e ⊢ 𝐸 = ( Edg ‘ 𝐺 )
3 umgrupgr ⊢ ( 𝐺 ∈ UMGraph → 𝐺 ∈ UPGraph )
4 3 adantr ⊢ ( ( 𝐺 ∈ UMGraph ∧ ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) ) → 𝐺 ∈ UPGraph )
5 simp1 ⊢ ( ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) → 𝐴 ∈ 𝑉 )
6 5 adantl ⊢ ( ( 𝐺 ∈ UMGraph ∧ ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) ) → 𝐴 ∈ 𝑉 )
7 simpr3 ⊢ ( ( 𝐺 ∈ UMGraph ∧ ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) ) → 𝐶 ∈ 𝑉 )
8 1 s3wwlks2on ⊢ ( ( 𝐺 ∈ UPGraph ∧ 𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) → ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ∈ ( 𝐴 ( 2 WWalksNOn 𝐺 ) 𝐶 ) ↔ ∃ 𝑓 ( 𝑓 ( Walks ‘ 𝐺 ) ⟨“ 𝐴 𝐵 𝐶 ”⟩ ∧ ( ♯ ‘ 𝑓 ) = 2 ) ) )
9 4 6 7 8 syl3anc ⊢ ( ( 𝐺 ∈ UMGraph ∧ ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) ) → ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ∈ ( 𝐴 ( 2 WWalksNOn 𝐺 ) 𝐶 ) ↔ ∃ 𝑓 ( 𝑓 ( Walks ‘ 𝐺 ) ⟨“ 𝐴 𝐵 𝐶 ”⟩ ∧ ( ♯ ‘ 𝑓 ) = 2 ) ) )
10 eqid ⊢ ( iEdg ‘ 𝐺 ) = ( iEdg ‘ 𝐺 )
11 1 10 upgr2wlk ⊢ ( 𝐺 ∈ UPGraph → ( ( 𝑓 ( Walks ‘ 𝐺 ) ⟨“ 𝐴 𝐵 𝐶 ”⟩ ∧ ( ♯ ‘ 𝑓 ) = 2 ) ↔ ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) ∧ ⟨“ 𝐴 𝐵 𝐶 ”⟩ : ( 0 ... 2 ) ⟶ 𝑉 ∧ ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) = { ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 0 ) , ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 1 ) } ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) = { ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 1 ) , ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 2 ) } ) ) ) )
12 3 11 syl ⊢ ( 𝐺 ∈ UMGraph → ( ( 𝑓 ( Walks ‘ 𝐺 ) ⟨“ 𝐴 𝐵 𝐶 ”⟩ ∧ ( ♯ ‘ 𝑓 ) = 2 ) ↔ ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) ∧ ⟨“ 𝐴 𝐵 𝐶 ”⟩ : ( 0 ... 2 ) ⟶ 𝑉 ∧ ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) = { ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 0 ) , ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 1 ) } ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) = { ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 1 ) , ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 2 ) } ) ) ) )
13 12 adantr ⊢ ( ( 𝐺 ∈ UMGraph ∧ ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) ) → ( ( 𝑓 ( Walks ‘ 𝐺 ) ⟨“ 𝐴 𝐵 𝐶 ”⟩ ∧ ( ♯ ‘ 𝑓 ) = 2 ) ↔ ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) ∧ ⟨“ 𝐴 𝐵 𝐶 ”⟩ : ( 0 ... 2 ) ⟶ 𝑉 ∧ ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) = { ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 0 ) , ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 1 ) } ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) = { ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 1 ) , ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 2 ) } ) ) ) )
14 s3fv0 ⊢ ( 𝐴 ∈ 𝑉 → ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 0 ) = 𝐴 )
15 14 3ad2ant1 ⊢ ( ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) → ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 0 ) = 𝐴 )
16 s3fv1 ⊢ ( 𝐵 ∈ 𝑉 → ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 1 ) = 𝐵 )
17 16 3ad2ant2 ⊢ ( ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) → ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 1 ) = 𝐵 )
18 15 17 preq12d ⊢ ( ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) → { ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 0 ) , ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 1 ) } = { 𝐴 , 𝐵 } )
19 18 eqeq2d ⊢ ( ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) → ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) = { ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 0 ) , ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 1 ) } ↔ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) = { 𝐴 , 𝐵 } ) )
20 s3fv2 ⊢ ( 𝐶 ∈ 𝑉 → ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 2 ) = 𝐶 )
21 20 3ad2ant3 ⊢ ( ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) → ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 2 ) = 𝐶 )
22 17 21 preq12d ⊢ ( ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) → { ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 1 ) , ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 2 ) } = { 𝐵 , 𝐶 } )
23 22 eqeq2d ⊢ ( ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) → ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) = { ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 1 ) , ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 2 ) } ↔ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) = { 𝐵 , 𝐶 } ) )
24 19 23 anbi12d ⊢ ( ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) → ( ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) = { ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 0 ) , ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 1 ) } ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) = { ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 1 ) , ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 2 ) } ) ↔ ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) = { 𝐴 , 𝐵 } ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) = { 𝐵 , 𝐶 } ) ) )
25 24 adantl ⊢ ( ( 𝐺 ∈ UMGraph ∧ ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) ) → ( ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) = { ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 0 ) , ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 1 ) } ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) = { ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 1 ) , ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 2 ) } ) ↔ ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) = { 𝐴 , 𝐵 } ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) = { 𝐵 , 𝐶 } ) ) )
26 25 3anbi3d ⊢ ( ( 𝐺 ∈ UMGraph ∧ ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) ) → ( ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) ∧ ⟨“ 𝐴 𝐵 𝐶 ”⟩ : ( 0 ... 2 ) ⟶ 𝑉 ∧ ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) = { ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 0 ) , ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 1 ) } ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) = { ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 1 ) , ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 2 ) } ) ) ↔ ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) ∧ ⟨“ 𝐴 𝐵 𝐶 ”⟩ : ( 0 ... 2 ) ⟶ 𝑉 ∧ ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) = { 𝐴 , 𝐵 } ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) = { 𝐵 , 𝐶 } ) ) ) )
27 umgruhgr ⊢ ( 𝐺 ∈ UMGraph → 𝐺 ∈ UHGraph )
28 10 uhgrfun ⊢ ( 𝐺 ∈ UHGraph → Fun ( iEdg ‘ 𝐺 ) )
29 fdmrn ⊢ ( Fun ( iEdg ‘ 𝐺 ) ↔ ( iEdg ‘ 𝐺 ) : dom ( iEdg ‘ 𝐺 ) ⟶ ran ( iEdg ‘ 𝐺 ) )
30 simpr ⊢ ( ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) ∧ ( iEdg ‘ 𝐺 ) : dom ( iEdg ‘ 𝐺 ) ⟶ ran ( iEdg ‘ 𝐺 ) ) → ( iEdg ‘ 𝐺 ) : dom ( iEdg ‘ 𝐺 ) ⟶ ran ( iEdg ‘ 𝐺 ) )
31 id ⊢ ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) → 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) )
32 0elpr01 ⊢ 0 ∈ { 0 , 1 }
33 fzo0to2pr ⊢ ( 0 ..^ 2 ) = { 0 , 1 }
34 32 33 eleqtrri ⊢ 0 ∈ ( 0 ..^ 2 )
35 34 a1i ⊢ ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) → 0 ∈ ( 0 ..^ 2 ) )
36 31 35 ffvelcdmd ⊢ ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) → ( 𝑓 ‘ 0 ) ∈ dom ( iEdg ‘ 𝐺 ) )
37 36 adantr ⊢ ( ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) ∧ ( iEdg ‘ 𝐺 ) : dom ( iEdg ‘ 𝐺 ) ⟶ ran ( iEdg ‘ 𝐺 ) ) → ( 𝑓 ‘ 0 ) ∈ dom ( iEdg ‘ 𝐺 ) )
38 30 37 ffvelcdmd ⊢ ( ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) ∧ ( iEdg ‘ 𝐺 ) : dom ( iEdg ‘ 𝐺 ) ⟶ ran ( iEdg ‘ 𝐺 ) ) → ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) ∈ ran ( iEdg ‘ 𝐺 ) )
39 1elpr01 ⊢ 1 ∈ { 0 , 1 }
40 39 33 eleqtrri ⊢ 1 ∈ ( 0 ..^ 2 )
41 40 a1i ⊢ ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) → 1 ∈ ( 0 ..^ 2 ) )
42 31 41 ffvelcdmd ⊢ ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) → ( 𝑓 ‘ 1 ) ∈ dom ( iEdg ‘ 𝐺 ) )
43 42 adantr ⊢ ( ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) ∧ ( iEdg ‘ 𝐺 ) : dom ( iEdg ‘ 𝐺 ) ⟶ ran ( iEdg ‘ 𝐺 ) ) → ( 𝑓 ‘ 1 ) ∈ dom ( iEdg ‘ 𝐺 ) )
44 30 43 ffvelcdmd ⊢ ( ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) ∧ ( iEdg ‘ 𝐺 ) : dom ( iEdg ‘ 𝐺 ) ⟶ ran ( iEdg ‘ 𝐺 ) ) → ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) ∈ ran ( iEdg ‘ 𝐺 ) )
45 38 44 jca ⊢ ( ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) ∧ ( iEdg ‘ 𝐺 ) : dom ( iEdg ‘ 𝐺 ) ⟶ ran ( iEdg ‘ 𝐺 ) ) → ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) ∈ ran ( iEdg ‘ 𝐺 ) ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) ∈ ran ( iEdg ‘ 𝐺 ) ) )
46 45 ex ⊢ ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) → ( ( iEdg ‘ 𝐺 ) : dom ( iEdg ‘ 𝐺 ) ⟶ ran ( iEdg ‘ 𝐺 ) → ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) ∈ ran ( iEdg ‘ 𝐺 ) ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) ∈ ran ( iEdg ‘ 𝐺 ) ) ) )
47 46 3ad2ant1 ⊢ ( ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) ∧ ⟨“ 𝐴 𝐵 𝐶 ”⟩ : ( 0 ... 2 ) ⟶ 𝑉 ∧ ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) = { 𝐴 , 𝐵 } ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) = { 𝐵 , 𝐶 } ) ) → ( ( iEdg ‘ 𝐺 ) : dom ( iEdg ‘ 𝐺 ) ⟶ ran ( iEdg ‘ 𝐺 ) → ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) ∈ ran ( iEdg ‘ 𝐺 ) ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) ∈ ran ( iEdg ‘ 𝐺 ) ) ) )
48 47 com12 ⊢ ( ( iEdg ‘ 𝐺 ) : dom ( iEdg ‘ 𝐺 ) ⟶ ran ( iEdg ‘ 𝐺 ) → ( ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) ∧ ⟨“ 𝐴 𝐵 𝐶 ”⟩ : ( 0 ... 2 ) ⟶ 𝑉 ∧ ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) = { 𝐴 , 𝐵 } ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) = { 𝐵 , 𝐶 } ) ) → ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) ∈ ran ( iEdg ‘ 𝐺 ) ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) ∈ ran ( iEdg ‘ 𝐺 ) ) ) )
49 29 48 sylbi ⊢ ( Fun ( iEdg ‘ 𝐺 ) → ( ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) ∧ ⟨“ 𝐴 𝐵 𝐶 ”⟩ : ( 0 ... 2 ) ⟶ 𝑉 ∧ ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) = { 𝐴 , 𝐵 } ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) = { 𝐵 , 𝐶 } ) ) → ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) ∈ ran ( iEdg ‘ 𝐺 ) ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) ∈ ran ( iEdg ‘ 𝐺 ) ) ) )
50 27 28 49 3syl ⊢ ( 𝐺 ∈ UMGraph → ( ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) ∧ ⟨“ 𝐴 𝐵 𝐶 ”⟩ : ( 0 ... 2 ) ⟶ 𝑉 ∧ ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) = { 𝐴 , 𝐵 } ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) = { 𝐵 , 𝐶 } ) ) → ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) ∈ ran ( iEdg ‘ 𝐺 ) ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) ∈ ran ( iEdg ‘ 𝐺 ) ) ) )
51 50 imp ⊢ ( ( 𝐺 ∈ UMGraph ∧ ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) ∧ ⟨“ 𝐴 𝐵 𝐶 ”⟩ : ( 0 ... 2 ) ⟶ 𝑉 ∧ ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) = { 𝐴 , 𝐵 } ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) = { 𝐵 , 𝐶 } ) ) ) → ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) ∈ ran ( iEdg ‘ 𝐺 ) ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) ∈ ran ( iEdg ‘ 𝐺 ) ) )
52 eqcom ⊢ ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) = { 𝐴 , 𝐵 } ↔ { 𝐴 , 𝐵 } = ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) )
53 52 birani ⊢ ( ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) = { 𝐴 , 𝐵 } ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) = { 𝐵 , 𝐶 } ) → { 𝐴 , 𝐵 } = ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) )
54 53 3ad2ant3 ⊢ ( ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) ∧ ⟨“ 𝐴 𝐵 𝐶 ”⟩ : ( 0 ... 2 ) ⟶ 𝑉 ∧ ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) = { 𝐴 , 𝐵 } ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) = { 𝐵 , 𝐶 } ) ) → { 𝐴 , 𝐵 } = ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) )
55 54 adantl ⊢ ( ( 𝐺 ∈ UMGraph ∧ ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) ∧ ⟨“ 𝐴 𝐵 𝐶 ”⟩ : ( 0 ... 2 ) ⟶ 𝑉 ∧ ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) = { 𝐴 , 𝐵 } ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) = { 𝐵 , 𝐶 } ) ) ) → { 𝐴 , 𝐵 } = ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) )
56 edgval ⊢ ( Edg ‘ 𝐺 ) = ran ( iEdg ‘ 𝐺 )
57 2 56 eqtri ⊢ 𝐸 = ran ( iEdg ‘ 𝐺 )
58 57 a1i ⊢ ( ( 𝐺 ∈ UMGraph ∧ ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) ∧ ⟨“ 𝐴 𝐵 𝐶 ”⟩ : ( 0 ... 2 ) ⟶ 𝑉 ∧ ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) = { 𝐴 , 𝐵 } ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) = { 𝐵 , 𝐶 } ) ) ) → 𝐸 = ran ( iEdg ‘ 𝐺 ) )
59 55 58 eleq12d ⊢ ( ( 𝐺 ∈ UMGraph ∧ ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) ∧ ⟨“ 𝐴 𝐵 𝐶 ”⟩ : ( 0 ... 2 ) ⟶ 𝑉 ∧ ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) = { 𝐴 , 𝐵 } ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) = { 𝐵 , 𝐶 } ) ) ) → ( { 𝐴 , 𝐵 } ∈ 𝐸 ↔ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) ∈ ran ( iEdg ‘ 𝐺 ) ) )
60 eqcom ⊢ ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) = { 𝐵 , 𝐶 } ↔ { 𝐵 , 𝐶 } = ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) )
61 60 bilani ⊢ ( ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) = { 𝐴 , 𝐵 } ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) = { 𝐵 , 𝐶 } ) → { 𝐵 , 𝐶 } = ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) )
62 61 3ad2ant3 ⊢ ( ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) ∧ ⟨“ 𝐴 𝐵 𝐶 ”⟩ : ( 0 ... 2 ) ⟶ 𝑉 ∧ ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) = { 𝐴 , 𝐵 } ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) = { 𝐵 , 𝐶 } ) ) → { 𝐵 , 𝐶 } = ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) )
63 62 adantl ⊢ ( ( 𝐺 ∈ UMGraph ∧ ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) ∧ ⟨“ 𝐴 𝐵 𝐶 ”⟩ : ( 0 ... 2 ) ⟶ 𝑉 ∧ ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) = { 𝐴 , 𝐵 } ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) = { 𝐵 , 𝐶 } ) ) ) → { 𝐵 , 𝐶 } = ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) )
64 63 58 eleq12d ⊢ ( ( 𝐺 ∈ UMGraph ∧ ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) ∧ ⟨“ 𝐴 𝐵 𝐶 ”⟩ : ( 0 ... 2 ) ⟶ 𝑉 ∧ ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) = { 𝐴 , 𝐵 } ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) = { 𝐵 , 𝐶 } ) ) ) → ( { 𝐵 , 𝐶 } ∈ 𝐸 ↔ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) ∈ ran ( iEdg ‘ 𝐺 ) ) )
65 59 64 anbi12d ⊢ ( ( 𝐺 ∈ UMGraph ∧ ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) ∧ ⟨“ 𝐴 𝐵 𝐶 ”⟩ : ( 0 ... 2 ) ⟶ 𝑉 ∧ ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) = { 𝐴 , 𝐵 } ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) = { 𝐵 , 𝐶 } ) ) ) → ( ( { 𝐴 , 𝐵 } ∈ 𝐸 ∧ { 𝐵 , 𝐶 } ∈ 𝐸 ) ↔ ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) ∈ ran ( iEdg ‘ 𝐺 ) ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) ∈ ran ( iEdg ‘ 𝐺 ) ) ) )
66 51 65 mpbird ⊢ ( ( 𝐺 ∈ UMGraph ∧ ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) ∧ ⟨“ 𝐴 𝐵 𝐶 ”⟩ : ( 0 ... 2 ) ⟶ 𝑉 ∧ ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) = { 𝐴 , 𝐵 } ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) = { 𝐵 , 𝐶 } ) ) ) → ( { 𝐴 , 𝐵 } ∈ 𝐸 ∧ { 𝐵 , 𝐶 } ∈ 𝐸 ) )
67 66 ex ⊢ ( 𝐺 ∈ UMGraph → ( ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) ∧ ⟨“ 𝐴 𝐵 𝐶 ”⟩ : ( 0 ... 2 ) ⟶ 𝑉 ∧ ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) = { 𝐴 , 𝐵 } ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) = { 𝐵 , 𝐶 } ) ) → ( { 𝐴 , 𝐵 } ∈ 𝐸 ∧ { 𝐵 , 𝐶 } ∈ 𝐸 ) ) )
68 67 adantr ⊢ ( ( 𝐺 ∈ UMGraph ∧ ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) ) → ( ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) ∧ ⟨“ 𝐴 𝐵 𝐶 ”⟩ : ( 0 ... 2 ) ⟶ 𝑉 ∧ ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) = { 𝐴 , 𝐵 } ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) = { 𝐵 , 𝐶 } ) ) → ( { 𝐴 , 𝐵 } ∈ 𝐸 ∧ { 𝐵 , 𝐶 } ∈ 𝐸 ) ) )
69 26 68 sylbid ⊢ ( ( 𝐺 ∈ UMGraph ∧ ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) ) → ( ( 𝑓 : ( 0 ..^ 2 ) ⟶ dom ( iEdg ‘ 𝐺 ) ∧ ⟨“ 𝐴 𝐵 𝐶 ”⟩ : ( 0 ... 2 ) ⟶ 𝑉 ∧ ( ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 0 ) ) = { ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 0 ) , ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 1 ) } ∧ ( ( iEdg ‘ 𝐺 ) ‘ ( 𝑓 ‘ 1 ) ) = { ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 1 ) , ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ‘ 2 ) } ) ) → ( { 𝐴 , 𝐵 } ∈ 𝐸 ∧ { 𝐵 , 𝐶 } ∈ 𝐸 ) ) )
70 13 69 sylbid ⊢ ( ( 𝐺 ∈ UMGraph ∧ ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) ) → ( ( 𝑓 ( Walks ‘ 𝐺 ) ⟨“ 𝐴 𝐵 𝐶 ”⟩ ∧ ( ♯ ‘ 𝑓 ) = 2 ) → ( { 𝐴 , 𝐵 } ∈ 𝐸 ∧ { 𝐵 , 𝐶 } ∈ 𝐸 ) ) )
71 70 exlimdv ⊢ ( ( 𝐺 ∈ UMGraph ∧ ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) ) → ( ∃ 𝑓 ( 𝑓 ( Walks ‘ 𝐺 ) ⟨“ 𝐴 𝐵 𝐶 ”⟩ ∧ ( ♯ ‘ 𝑓 ) = 2 ) → ( { 𝐴 , 𝐵 } ∈ 𝐸 ∧ { 𝐵 , 𝐶 } ∈ 𝐸 ) ) )
72 2 umgr2wlk ⊢ ( ( 𝐺 ∈ UMGraph ∧ { 𝐴 , 𝐵 } ∈ 𝐸 ∧ { 𝐵 , 𝐶 } ∈ 𝐸 ) → ∃ 𝑓 ∃ 𝑝 ( 𝑓 ( Walks ‘ 𝐺 ) 𝑝 ∧ ( ♯ ‘ 𝑓 ) = 2 ∧ ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) ) )
73 wlklenvp1 ⊢ ( 𝑓 ( Walks ‘ 𝐺 ) 𝑝 → ( ♯ ‘ 𝑝 ) = ( ( ♯ ‘ 𝑓 ) + 1 ) )
74 oveq1 ⊢ ( ( ♯ ‘ 𝑓 ) = 2 → ( ( ♯ ‘ 𝑓 ) + 1 ) = ( 2 + 1 ) )
75 2p1e3 ⊢ ( 2 + 1 ) = 3
76 74 75 eqtrdi ⊢ ( ( ♯ ‘ 𝑓 ) = 2 → ( ( ♯ ‘ 𝑓 ) + 1 ) = 3 )
77 76 adantr ⊢ ( ( ( ♯ ‘ 𝑓 ) = 2 ∧ ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) ) → ( ( ♯ ‘ 𝑓 ) + 1 ) = 3 )
78 73 77 sylan9eq ⊢ ( ( 𝑓 ( Walks ‘ 𝐺 ) 𝑝 ∧ ( ( ♯ ‘ 𝑓 ) = 2 ∧ ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) ) ) → ( ♯ ‘ 𝑝 ) = 3 )
79 eqcom ⊢ ( 𝐴 = ( 𝑝 ‘ 0 ) ↔ ( 𝑝 ‘ 0 ) = 𝐴 )
80 eqcom ⊢ ( 𝐵 = ( 𝑝 ‘ 1 ) ↔ ( 𝑝 ‘ 1 ) = 𝐵 )
81 eqcom ⊢ ( 𝐶 = ( 𝑝 ‘ 2 ) ↔ ( 𝑝 ‘ 2 ) = 𝐶 )
82 79 80 81 3anbi123i ⊢ ( ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) ↔ ( ( 𝑝 ‘ 0 ) = 𝐴 ∧ ( 𝑝 ‘ 1 ) = 𝐵 ∧ ( 𝑝 ‘ 2 ) = 𝐶 ) )
83 82 bilani ⊢ ( ( ( ♯ ‘ 𝑓 ) = 2 ∧ ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) ) → ( ( 𝑝 ‘ 0 ) = 𝐴 ∧ ( 𝑝 ‘ 1 ) = 𝐵 ∧ ( 𝑝 ‘ 2 ) = 𝐶 ) )
84 83 adantl ⊢ ( ( 𝑓 ( Walks ‘ 𝐺 ) 𝑝 ∧ ( ( ♯ ‘ 𝑓 ) = 2 ∧ ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) ) ) → ( ( 𝑝 ‘ 0 ) = 𝐴 ∧ ( 𝑝 ‘ 1 ) = 𝐵 ∧ ( 𝑝 ‘ 2 ) = 𝐶 ) )
85 78 84 jca ⊢ ( ( 𝑓 ( Walks ‘ 𝐺 ) 𝑝 ∧ ( ( ♯ ‘ 𝑓 ) = 2 ∧ ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) ) ) → ( ( ♯ ‘ 𝑝 ) = 3 ∧ ( ( 𝑝 ‘ 0 ) = 𝐴 ∧ ( 𝑝 ‘ 1 ) = 𝐵 ∧ ( 𝑝 ‘ 2 ) = 𝐶 ) ) )
86 1 wlkpwrd ⊢ ( 𝑓 ( Walks ‘ 𝐺 ) 𝑝 → 𝑝 ∈ Word 𝑉 )
87 76 eqeq2d ⊢ ( ( ♯ ‘ 𝑓 ) = 2 → ( ( ♯ ‘ 𝑝 ) = ( ( ♯ ‘ 𝑓 ) + 1 ) ↔ ( ♯ ‘ 𝑝 ) = 3 ) )
88 87 adantl ⊢ ( ( 𝑝 ∈ Word 𝑉 ∧ ( ♯ ‘ 𝑓 ) = 2 ) → ( ( ♯ ‘ 𝑝 ) = ( ( ♯ ‘ 𝑓 ) + 1 ) ↔ ( ♯ ‘ 𝑝 ) = 3 ) )
89 simp1 ⊢ ( ( 𝑝 ∈ Word 𝑉 ∧ ( ♯ ‘ 𝑝 ) = 3 ∧ ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) ) → 𝑝 ∈ Word 𝑉 )
90 oveq2 ⊢ ( ( ♯ ‘ 𝑝 ) = 3 → ( 0 ..^ ( ♯ ‘ 𝑝 ) ) = ( 0 ..^ 3 ) )
91 fzo0to3tp ⊢ ( 0 ..^ 3 ) = { 0 , 1 , 2 }
92 90 91 eqtrdi ⊢ ( ( ♯ ‘ 𝑝 ) = 3 → ( 0 ..^ ( ♯ ‘ 𝑝 ) ) = { 0 , 1 , 2 } )
93 c0ex ⊢ 0 ∈ V
94 93 tpid1 ⊢ 0 ∈ { 0 , 1 , 2 }
95 eleq2 ⊢ ( ( 0 ..^ ( ♯ ‘ 𝑝 ) ) = { 0 , 1 , 2 } → ( 0 ∈ ( 0 ..^ ( ♯ ‘ 𝑝 ) ) ↔ 0 ∈ { 0 , 1 , 2 } ) )
96 94 95 mpbiri ⊢ ( ( 0 ..^ ( ♯ ‘ 𝑝 ) ) = { 0 , 1 , 2 } → 0 ∈ ( 0 ..^ ( ♯ ‘ 𝑝 ) ) )
97 wrdsymbcl ⊢ ( ( 𝑝 ∈ Word 𝑉 ∧ 0 ∈ ( 0 ..^ ( ♯ ‘ 𝑝 ) ) ) → ( 𝑝 ‘ 0 ) ∈ 𝑉 )
98 96 97 sylan2 ⊢ ( ( 𝑝 ∈ Word 𝑉 ∧ ( 0 ..^ ( ♯ ‘ 𝑝 ) ) = { 0 , 1 , 2 } ) → ( 𝑝 ‘ 0 ) ∈ 𝑉 )
99 1eltp012 ⊢ 1 ∈ { 0 , 1 , 2 }
100 eleq2 ⊢ ( ( 0 ..^ ( ♯ ‘ 𝑝 ) ) = { 0 , 1 , 2 } → ( 1 ∈ ( 0 ..^ ( ♯ ‘ 𝑝 ) ) ↔ 1 ∈ { 0 , 1 , 2 } ) )
101 99 100 mpbiri ⊢ ( ( 0 ..^ ( ♯ ‘ 𝑝 ) ) = { 0 , 1 , 2 } → 1 ∈ ( 0 ..^ ( ♯ ‘ 𝑝 ) ) )
102 wrdsymbcl ⊢ ( ( 𝑝 ∈ Word 𝑉 ∧ 1 ∈ ( 0 ..^ ( ♯ ‘ 𝑝 ) ) ) → ( 𝑝 ‘ 1 ) ∈ 𝑉 )
103 101 102 sylan2 ⊢ ( ( 𝑝 ∈ Word 𝑉 ∧ ( 0 ..^ ( ♯ ‘ 𝑝 ) ) = { 0 , 1 , 2 } ) → ( 𝑝 ‘ 1 ) ∈ 𝑉 )
104 2ex ⊢ 2 ∈ V
105 104 tpid3 ⊢ 2 ∈ { 0 , 1 , 2 }
106 eleq2 ⊢ ( ( 0 ..^ ( ♯ ‘ 𝑝 ) ) = { 0 , 1 , 2 } → ( 2 ∈ ( 0 ..^ ( ♯ ‘ 𝑝 ) ) ↔ 2 ∈ { 0 , 1 , 2 } ) )
107 105 106 mpbiri ⊢ ( ( 0 ..^ ( ♯ ‘ 𝑝 ) ) = { 0 , 1 , 2 } → 2 ∈ ( 0 ..^ ( ♯ ‘ 𝑝 ) ) )
108 wrdsymbcl ⊢ ( ( 𝑝 ∈ Word 𝑉 ∧ 2 ∈ ( 0 ..^ ( ♯ ‘ 𝑝 ) ) ) → ( 𝑝 ‘ 2 ) ∈ 𝑉 )
109 107 108 sylan2 ⊢ ( ( 𝑝 ∈ Word 𝑉 ∧ ( 0 ..^ ( ♯ ‘ 𝑝 ) ) = { 0 , 1 , 2 } ) → ( 𝑝 ‘ 2 ) ∈ 𝑉 )
110 98 103 109 3jca ⊢ ( ( 𝑝 ∈ Word 𝑉 ∧ ( 0 ..^ ( ♯ ‘ 𝑝 ) ) = { 0 , 1 , 2 } ) → ( ( 𝑝 ‘ 0 ) ∈ 𝑉 ∧ ( 𝑝 ‘ 1 ) ∈ 𝑉 ∧ ( 𝑝 ‘ 2 ) ∈ 𝑉 ) )
111 92 110 sylan2 ⊢ ( ( 𝑝 ∈ Word 𝑉 ∧ ( ♯ ‘ 𝑝 ) = 3 ) → ( ( 𝑝 ‘ 0 ) ∈ 𝑉 ∧ ( 𝑝 ‘ 1 ) ∈ 𝑉 ∧ ( 𝑝 ‘ 2 ) ∈ 𝑉 ) )
112 111 3adant3 ⊢ ( ( 𝑝 ∈ Word 𝑉 ∧ ( ♯ ‘ 𝑝 ) = 3 ∧ ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) ) → ( ( 𝑝 ‘ 0 ) ∈ 𝑉 ∧ ( 𝑝 ‘ 1 ) ∈ 𝑉 ∧ ( 𝑝 ‘ 2 ) ∈ 𝑉 ) )
113 eleq1 ⊢ ( 𝐴 = ( 𝑝 ‘ 0 ) → ( 𝐴 ∈ 𝑉 ↔ ( 𝑝 ‘ 0 ) ∈ 𝑉 ) )
114 113 3ad2ant1 ⊢ ( ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) → ( 𝐴 ∈ 𝑉 ↔ ( 𝑝 ‘ 0 ) ∈ 𝑉 ) )
115 eleq1 ⊢ ( 𝐵 = ( 𝑝 ‘ 1 ) → ( 𝐵 ∈ 𝑉 ↔ ( 𝑝 ‘ 1 ) ∈ 𝑉 ) )
116 115 3ad2ant2 ⊢ ( ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) → ( 𝐵 ∈ 𝑉 ↔ ( 𝑝 ‘ 1 ) ∈ 𝑉 ) )
117 eleq1 ⊢ ( 𝐶 = ( 𝑝 ‘ 2 ) → ( 𝐶 ∈ 𝑉 ↔ ( 𝑝 ‘ 2 ) ∈ 𝑉 ) )
118 117 3ad2ant3 ⊢ ( ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) → ( 𝐶 ∈ 𝑉 ↔ ( 𝑝 ‘ 2 ) ∈ 𝑉 ) )
119 114 116 118 3anbi123d ⊢ ( ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) → ( ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) ↔ ( ( 𝑝 ‘ 0 ) ∈ 𝑉 ∧ ( 𝑝 ‘ 1 ) ∈ 𝑉 ∧ ( 𝑝 ‘ 2 ) ∈ 𝑉 ) ) )
120 119 3ad2ant3 ⊢ ( ( 𝑝 ∈ Word 𝑉 ∧ ( ♯ ‘ 𝑝 ) = 3 ∧ ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) ) → ( ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) ↔ ( ( 𝑝 ‘ 0 ) ∈ 𝑉 ∧ ( 𝑝 ‘ 1 ) ∈ 𝑉 ∧ ( 𝑝 ‘ 2 ) ∈ 𝑉 ) ) )
121 112 120 mpbird ⊢ ( ( 𝑝 ∈ Word 𝑉 ∧ ( ♯ ‘ 𝑝 ) = 3 ∧ ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) ) → ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) )
122 89 121 jca ⊢ ( ( 𝑝 ∈ Word 𝑉 ∧ ( ♯ ‘ 𝑝 ) = 3 ∧ ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) ) → ( 𝑝 ∈ Word 𝑉 ∧ ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) ) )
123 122 3exp ⊢ ( 𝑝 ∈ Word 𝑉 → ( ( ♯ ‘ 𝑝 ) = 3 → ( ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) → ( 𝑝 ∈ Word 𝑉 ∧ ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) ) ) ) )
124 123 adantr ⊢ ( ( 𝑝 ∈ Word 𝑉 ∧ ( ♯ ‘ 𝑓 ) = 2 ) → ( ( ♯ ‘ 𝑝 ) = 3 → ( ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) → ( 𝑝 ∈ Word 𝑉 ∧ ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) ) ) ) )
125 88 124 sylbid ⊢ ( ( 𝑝 ∈ Word 𝑉 ∧ ( ♯ ‘ 𝑓 ) = 2 ) → ( ( ♯ ‘ 𝑝 ) = ( ( ♯ ‘ 𝑓 ) + 1 ) → ( ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) → ( 𝑝 ∈ Word 𝑉 ∧ ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) ) ) ) )
126 125 impancom ⊢ ( ( 𝑝 ∈ Word 𝑉 ∧ ( ♯ ‘ 𝑝 ) = ( ( ♯ ‘ 𝑓 ) + 1 ) ) → ( ( ♯ ‘ 𝑓 ) = 2 → ( ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) → ( 𝑝 ∈ Word 𝑉 ∧ ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) ) ) ) )
127 126 impd ⊢ ( ( 𝑝 ∈ Word 𝑉 ∧ ( ♯ ‘ 𝑝 ) = ( ( ♯ ‘ 𝑓 ) + 1 ) ) → ( ( ( ♯ ‘ 𝑓 ) = 2 ∧ ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) ) → ( 𝑝 ∈ Word 𝑉 ∧ ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) ) ) )
128 86 73 127 syl2anc ⊢ ( 𝑓 ( Walks ‘ 𝐺 ) 𝑝 → ( ( ( ♯ ‘ 𝑓 ) = 2 ∧ ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) ) → ( 𝑝 ∈ Word 𝑉 ∧ ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) ) ) )
129 128 imp ⊢ ( ( 𝑓 ( Walks ‘ 𝐺 ) 𝑝 ∧ ( ( ♯ ‘ 𝑓 ) = 2 ∧ ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) ) ) → ( 𝑝 ∈ Word 𝑉 ∧ ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) ) )
130 eqwrds3 ⊢ ( ( 𝑝 ∈ Word 𝑉 ∧ ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) ) → ( 𝑝 = ⟨“ 𝐴 𝐵 𝐶 ”⟩ ↔ ( ( ♯ ‘ 𝑝 ) = 3 ∧ ( ( 𝑝 ‘ 0 ) = 𝐴 ∧ ( 𝑝 ‘ 1 ) = 𝐵 ∧ ( 𝑝 ‘ 2 ) = 𝐶 ) ) ) )
131 129 130 syl ⊢ ( ( 𝑓 ( Walks ‘ 𝐺 ) 𝑝 ∧ ( ( ♯ ‘ 𝑓 ) = 2 ∧ ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) ) ) → ( 𝑝 = ⟨“ 𝐴 𝐵 𝐶 ”⟩ ↔ ( ( ♯ ‘ 𝑝 ) = 3 ∧ ( ( 𝑝 ‘ 0 ) = 𝐴 ∧ ( 𝑝 ‘ 1 ) = 𝐵 ∧ ( 𝑝 ‘ 2 ) = 𝐶 ) ) ) )
132 85 131 mpbird ⊢ ( ( 𝑓 ( Walks ‘ 𝐺 ) 𝑝 ∧ ( ( ♯ ‘ 𝑓 ) = 2 ∧ ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) ) ) → 𝑝 = ⟨“ 𝐴 𝐵 𝐶 ”⟩ )
133 132 breq2d ⊢ ( ( 𝑓 ( Walks ‘ 𝐺 ) 𝑝 ∧ ( ( ♯ ‘ 𝑓 ) = 2 ∧ ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) ) ) → ( 𝑓 ( Walks ‘ 𝐺 ) 𝑝 ↔ 𝑓 ( Walks ‘ 𝐺 ) ⟨“ 𝐴 𝐵 𝐶 ”⟩ ) )
134 133 biimpd ⊢ ( ( 𝑓 ( Walks ‘ 𝐺 ) 𝑝 ∧ ( ( ♯ ‘ 𝑓 ) = 2 ∧ ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) ) ) → ( 𝑓 ( Walks ‘ 𝐺 ) 𝑝 → 𝑓 ( Walks ‘ 𝐺 ) ⟨“ 𝐴 𝐵 𝐶 ”⟩ ) )
135 134 ex ⊢ ( 𝑓 ( Walks ‘ 𝐺 ) 𝑝 → ( ( ( ♯ ‘ 𝑓 ) = 2 ∧ ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) ) → ( 𝑓 ( Walks ‘ 𝐺 ) 𝑝 → 𝑓 ( Walks ‘ 𝐺 ) ⟨“ 𝐴 𝐵 𝐶 ”⟩ ) ) )
136 135 pm2.43a ⊢ ( 𝑓 ( Walks ‘ 𝐺 ) 𝑝 → ( ( ( ♯ ‘ 𝑓 ) = 2 ∧ ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) ) → 𝑓 ( Walks ‘ 𝐺 ) ⟨“ 𝐴 𝐵 𝐶 ”⟩ ) )
137 136 3impib ⊢ ( ( 𝑓 ( Walks ‘ 𝐺 ) 𝑝 ∧ ( ♯ ‘ 𝑓 ) = 2 ∧ ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) ) → 𝑓 ( Walks ‘ 𝐺 ) ⟨“ 𝐴 𝐵 𝐶 ”⟩ )
138 137 adantl ⊢ ( ( ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) ∧ ( 𝑓 ( Walks ‘ 𝐺 ) 𝑝 ∧ ( ♯ ‘ 𝑓 ) = 2 ∧ ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) ) ) → 𝑓 ( Walks ‘ 𝐺 ) ⟨“ 𝐴 𝐵 𝐶 ”⟩ )
139 simpr2 ⊢ ( ( ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) ∧ ( 𝑓 ( Walks ‘ 𝐺 ) 𝑝 ∧ ( ♯ ‘ 𝑓 ) = 2 ∧ ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) ) ) → ( ♯ ‘ 𝑓 ) = 2 )
140 138 139 jca ⊢ ( ( ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) ∧ ( 𝑓 ( Walks ‘ 𝐺 ) 𝑝 ∧ ( ♯ ‘ 𝑓 ) = 2 ∧ ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) ) ) → ( 𝑓 ( Walks ‘ 𝐺 ) ⟨“ 𝐴 𝐵 𝐶 ”⟩ ∧ ( ♯ ‘ 𝑓 ) = 2 ) )
141 140 ex ⊢ ( ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) → ( ( 𝑓 ( Walks ‘ 𝐺 ) 𝑝 ∧ ( ♯ ‘ 𝑓 ) = 2 ∧ ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) ) → ( 𝑓 ( Walks ‘ 𝐺 ) ⟨“ 𝐴 𝐵 𝐶 ”⟩ ∧ ( ♯ ‘ 𝑓 ) = 2 ) ) )
142 141 exlimdv ⊢ ( ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) → ( ∃ 𝑝 ( 𝑓 ( Walks ‘ 𝐺 ) 𝑝 ∧ ( ♯ ‘ 𝑓 ) = 2 ∧ ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) ) → ( 𝑓 ( Walks ‘ 𝐺 ) ⟨“ 𝐴 𝐵 𝐶 ”⟩ ∧ ( ♯ ‘ 𝑓 ) = 2 ) ) )
143 142 eximdv ⊢ ( ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) → ( ∃ 𝑓 ∃ 𝑝 ( 𝑓 ( Walks ‘ 𝐺 ) 𝑝 ∧ ( ♯ ‘ 𝑓 ) = 2 ∧ ( 𝐴 = ( 𝑝 ‘ 0 ) ∧ 𝐵 = ( 𝑝 ‘ 1 ) ∧ 𝐶 = ( 𝑝 ‘ 2 ) ) ) → ∃ 𝑓 ( 𝑓 ( Walks ‘ 𝐺 ) ⟨“ 𝐴 𝐵 𝐶 ”⟩ ∧ ( ♯ ‘ 𝑓 ) = 2 ) ) )
144 72 143 syl5com ⊢ ( ( 𝐺 ∈ UMGraph ∧ { 𝐴 , 𝐵 } ∈ 𝐸 ∧ { 𝐵 , 𝐶 } ∈ 𝐸 ) → ( ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) → ∃ 𝑓 ( 𝑓 ( Walks ‘ 𝐺 ) ⟨“ 𝐴 𝐵 𝐶 ”⟩ ∧ ( ♯ ‘ 𝑓 ) = 2 ) ) )
145 144 3expib ⊢ ( 𝐺 ∈ UMGraph → ( ( { 𝐴 , 𝐵 } ∈ 𝐸 ∧ { 𝐵 , 𝐶 } ∈ 𝐸 ) → ( ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) → ∃ 𝑓 ( 𝑓 ( Walks ‘ 𝐺 ) ⟨“ 𝐴 𝐵 𝐶 ”⟩ ∧ ( ♯ ‘ 𝑓 ) = 2 ) ) ) )
146 145 com23 ⊢ ( 𝐺 ∈ UMGraph → ( ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) → ( ( { 𝐴 , 𝐵 } ∈ 𝐸 ∧ { 𝐵 , 𝐶 } ∈ 𝐸 ) → ∃ 𝑓 ( 𝑓 ( Walks ‘ 𝐺 ) ⟨“ 𝐴 𝐵 𝐶 ”⟩ ∧ ( ♯ ‘ 𝑓 ) = 2 ) ) ) )
147 146 imp ⊢ ( ( 𝐺 ∈ UMGraph ∧ ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) ) → ( ( { 𝐴 , 𝐵 } ∈ 𝐸 ∧ { 𝐵 , 𝐶 } ∈ 𝐸 ) → ∃ 𝑓 ( 𝑓 ( Walks ‘ 𝐺 ) ⟨“ 𝐴 𝐵 𝐶 ”⟩ ∧ ( ♯ ‘ 𝑓 ) = 2 ) ) )
148 71 147 impbid ⊢ ( ( 𝐺 ∈ UMGraph ∧ ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) ) → ( ∃ 𝑓 ( 𝑓 ( Walks ‘ 𝐺 ) ⟨“ 𝐴 𝐵 𝐶 ”⟩ ∧ ( ♯ ‘ 𝑓 ) = 2 ) ↔ ( { 𝐴 , 𝐵 } ∈ 𝐸 ∧ { 𝐵 , 𝐶 } ∈ 𝐸 ) ) )
149 9 148 bitrd ⊢ ( ( 𝐺 ∈ UMGraph ∧ ( 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ) ) → ( ⟨“ 𝐴 𝐵 𝐶 ”⟩ ∈ ( 𝐴 ( 2 WWalksNOn 𝐺 ) 𝐶 ) ↔ ( { 𝐴 , 𝐵 } ∈ 𝐸 ∧ { 𝐵 , 𝐶 } ∈ 𝐸 ) ) )