Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > umgr2adedgwlk | Structured version Visualization version GIF version |
Description: In a multigraph, two adjacent edges form a walk of length 2. (Contributed by Alexander van der Vekens, 18-Feb-2018.) (Revised by AV, 29-Jan-2021.) |
Ref | Expression |
---|---|
umgr2adedgwlk.e | ⊢ 𝐸 = (Edg‘𝐺) |
umgr2adedgwlk.i | ⊢ 𝐼 = (iEdg‘𝐺) |
umgr2adedgwlk.f | ⊢ 𝐹 = 〈“𝐽𝐾”〉 |
umgr2adedgwlk.p | ⊢ 𝑃 = 〈“𝐴𝐵𝐶”〉 |
umgr2adedgwlk.g | ⊢ (𝜑 → 𝐺 ∈ UMGraph) |
umgr2adedgwlk.a | ⊢ (𝜑 → ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸)) |
umgr2adedgwlk.j | ⊢ (𝜑 → (𝐼‘𝐽) = {𝐴, 𝐵}) |
umgr2adedgwlk.k | ⊢ (𝜑 → (𝐼‘𝐾) = {𝐵, 𝐶}) |
Ref | Expression |
---|---|
umgr2adedgwlk | ⊢ (𝜑 → (𝐹(Walks‘𝐺)𝑃 ∧ (♯‘𝐹) = 2 ∧ (𝐴 = (𝑃‘0) ∧ 𝐵 = (𝑃‘1) ∧ 𝐶 = (𝑃‘2)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | umgr2adedgwlk.p | . . 3 ⊢ 𝑃 = 〈“𝐴𝐵𝐶”〉 | |
2 | umgr2adedgwlk.f | . . 3 ⊢ 𝐹 = 〈“𝐽𝐾”〉 | |
3 | umgr2adedgwlk.g | . . . . . 6 ⊢ (𝜑 → 𝐺 ∈ UMGraph) | |
4 | umgr2adedgwlk.a | . . . . . 6 ⊢ (𝜑 → ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸)) | |
5 | 3anass 1091 | . . . . . 6 ⊢ ((𝐺 ∈ UMGraph ∧ {𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸) ↔ (𝐺 ∈ UMGraph ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸))) | |
6 | 3, 4, 5 | sylanbrc 585 | . . . . 5 ⊢ (𝜑 → (𝐺 ∈ UMGraph ∧ {𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸)) |
7 | umgr2adedgwlk.e | . . . . . 6 ⊢ 𝐸 = (Edg‘𝐺) | |
8 | 7 | umgr2adedgwlklem 27725 | . . . . 5 ⊢ ((𝐺 ∈ UMGraph ∧ {𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸) → ((𝐴 ≠ 𝐵 ∧ 𝐵 ≠ 𝐶) ∧ (𝐴 ∈ (Vtx‘𝐺) ∧ 𝐵 ∈ (Vtx‘𝐺) ∧ 𝐶 ∈ (Vtx‘𝐺)))) |
9 | 6, 8 | syl 17 | . . . 4 ⊢ (𝜑 → ((𝐴 ≠ 𝐵 ∧ 𝐵 ≠ 𝐶) ∧ (𝐴 ∈ (Vtx‘𝐺) ∧ 𝐵 ∈ (Vtx‘𝐺) ∧ 𝐶 ∈ (Vtx‘𝐺)))) |
10 | 9 | simprd 498 | . . 3 ⊢ (𝜑 → (𝐴 ∈ (Vtx‘𝐺) ∧ 𝐵 ∈ (Vtx‘𝐺) ∧ 𝐶 ∈ (Vtx‘𝐺))) |
11 | 9 | simpld 497 | . . 3 ⊢ (𝜑 → (𝐴 ≠ 𝐵 ∧ 𝐵 ≠ 𝐶)) |
12 | ssid 3991 | . . . . 5 ⊢ {𝐴, 𝐵} ⊆ {𝐴, 𝐵} | |
13 | umgr2adedgwlk.j | . . . . 5 ⊢ (𝜑 → (𝐼‘𝐽) = {𝐴, 𝐵}) | |
14 | 12, 13 | sseqtrrid 4022 | . . . 4 ⊢ (𝜑 → {𝐴, 𝐵} ⊆ (𝐼‘𝐽)) |
15 | ssid 3991 | . . . . 5 ⊢ {𝐵, 𝐶} ⊆ {𝐵, 𝐶} | |
16 | umgr2adedgwlk.k | . . . . 5 ⊢ (𝜑 → (𝐼‘𝐾) = {𝐵, 𝐶}) | |
17 | 15, 16 | sseqtrrid 4022 | . . . 4 ⊢ (𝜑 → {𝐵, 𝐶} ⊆ (𝐼‘𝐾)) |
18 | 14, 17 | jca 514 | . . 3 ⊢ (𝜑 → ({𝐴, 𝐵} ⊆ (𝐼‘𝐽) ∧ {𝐵, 𝐶} ⊆ (𝐼‘𝐾))) |
19 | eqid 2823 | . . 3 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
20 | umgr2adedgwlk.i | . . 3 ⊢ 𝐼 = (iEdg‘𝐺) | |
21 | 1, 2, 10, 11, 18, 19, 20 | 2wlkd 27717 | . 2 ⊢ (𝜑 → 𝐹(Walks‘𝐺)𝑃) |
22 | 2 | fveq2i 6675 | . . . 4 ⊢ (♯‘𝐹) = (♯‘〈“𝐽𝐾”〉) |
23 | s2len 14253 | . . . 4 ⊢ (♯‘〈“𝐽𝐾”〉) = 2 | |
24 | 22, 23 | eqtri 2846 | . . 3 ⊢ (♯‘𝐹) = 2 |
25 | 24 | a1i 11 | . 2 ⊢ (𝜑 → (♯‘𝐹) = 2) |
26 | s3fv0 14255 | . . . . 5 ⊢ (𝐴 ∈ (Vtx‘𝐺) → (〈“𝐴𝐵𝐶”〉‘0) = 𝐴) | |
27 | s3fv1 14256 | . . . . 5 ⊢ (𝐵 ∈ (Vtx‘𝐺) → (〈“𝐴𝐵𝐶”〉‘1) = 𝐵) | |
28 | s3fv2 14257 | . . . . 5 ⊢ (𝐶 ∈ (Vtx‘𝐺) → (〈“𝐴𝐵𝐶”〉‘2) = 𝐶) | |
29 | 26, 27, 28 | 3anim123i 1147 | . . . 4 ⊢ ((𝐴 ∈ (Vtx‘𝐺) ∧ 𝐵 ∈ (Vtx‘𝐺) ∧ 𝐶 ∈ (Vtx‘𝐺)) → ((〈“𝐴𝐵𝐶”〉‘0) = 𝐴 ∧ (〈“𝐴𝐵𝐶”〉‘1) = 𝐵 ∧ (〈“𝐴𝐵𝐶”〉‘2) = 𝐶)) |
30 | 10, 29 | syl 17 | . . 3 ⊢ (𝜑 → ((〈“𝐴𝐵𝐶”〉‘0) = 𝐴 ∧ (〈“𝐴𝐵𝐶”〉‘1) = 𝐵 ∧ (〈“𝐴𝐵𝐶”〉‘2) = 𝐶)) |
31 | 1 | fveq1i 6673 | . . . . . 6 ⊢ (𝑃‘0) = (〈“𝐴𝐵𝐶”〉‘0) |
32 | 31 | eqeq2i 2836 | . . . . 5 ⊢ (𝐴 = (𝑃‘0) ↔ 𝐴 = (〈“𝐴𝐵𝐶”〉‘0)) |
33 | eqcom 2830 | . . . . 5 ⊢ (𝐴 = (〈“𝐴𝐵𝐶”〉‘0) ↔ (〈“𝐴𝐵𝐶”〉‘0) = 𝐴) | |
34 | 32, 33 | bitri 277 | . . . 4 ⊢ (𝐴 = (𝑃‘0) ↔ (〈“𝐴𝐵𝐶”〉‘0) = 𝐴) |
35 | 1 | fveq1i 6673 | . . . . . 6 ⊢ (𝑃‘1) = (〈“𝐴𝐵𝐶”〉‘1) |
36 | 35 | eqeq2i 2836 | . . . . 5 ⊢ (𝐵 = (𝑃‘1) ↔ 𝐵 = (〈“𝐴𝐵𝐶”〉‘1)) |
37 | eqcom 2830 | . . . . 5 ⊢ (𝐵 = (〈“𝐴𝐵𝐶”〉‘1) ↔ (〈“𝐴𝐵𝐶”〉‘1) = 𝐵) | |
38 | 36, 37 | bitri 277 | . . . 4 ⊢ (𝐵 = (𝑃‘1) ↔ (〈“𝐴𝐵𝐶”〉‘1) = 𝐵) |
39 | 1 | fveq1i 6673 | . . . . . 6 ⊢ (𝑃‘2) = (〈“𝐴𝐵𝐶”〉‘2) |
40 | 39 | eqeq2i 2836 | . . . . 5 ⊢ (𝐶 = (𝑃‘2) ↔ 𝐶 = (〈“𝐴𝐵𝐶”〉‘2)) |
41 | eqcom 2830 | . . . . 5 ⊢ (𝐶 = (〈“𝐴𝐵𝐶”〉‘2) ↔ (〈“𝐴𝐵𝐶”〉‘2) = 𝐶) | |
42 | 40, 41 | bitri 277 | . . . 4 ⊢ (𝐶 = (𝑃‘2) ↔ (〈“𝐴𝐵𝐶”〉‘2) = 𝐶) |
43 | 34, 38, 42 | 3anbi123i 1151 | . . 3 ⊢ ((𝐴 = (𝑃‘0) ∧ 𝐵 = (𝑃‘1) ∧ 𝐶 = (𝑃‘2)) ↔ ((〈“𝐴𝐵𝐶”〉‘0) = 𝐴 ∧ (〈“𝐴𝐵𝐶”〉‘1) = 𝐵 ∧ (〈“𝐴𝐵𝐶”〉‘2) = 𝐶)) |
44 | 30, 43 | sylibr 236 | . 2 ⊢ (𝜑 → (𝐴 = (𝑃‘0) ∧ 𝐵 = (𝑃‘1) ∧ 𝐶 = (𝑃‘2))) |
45 | 21, 25, 44 | 3jca 1124 | 1 ⊢ (𝜑 → (𝐹(Walks‘𝐺)𝑃 ∧ (♯‘𝐹) = 2 ∧ (𝐴 = (𝑃‘0) ∧ 𝐵 = (𝑃‘1) ∧ 𝐶 = (𝑃‘2)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ≠ wne 3018 ⊆ wss 3938 {cpr 4571 class class class wbr 5068 ‘cfv 6357 0cc0 10539 1c1 10540 2c2 11695 ♯chash 13693 〈“cs2 14205 〈“cs3 14206 Vtxcvtx 26783 iEdgciedg 26784 Edgcedg 26834 UMGraphcumgr 26868 Walkscwlks 27380 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 ax-pre-mulgt0 10616 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-ifp 1058 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rmo 3148 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-int 4879 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-om 7583 df-1st 7691 df-2nd 7692 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-1o 8104 df-oadd 8108 df-er 8291 df-map 8410 df-en 8512 df-dom 8513 df-sdom 8514 df-fin 8515 df-dju 9332 df-card 9370 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-sub 10874 df-neg 10875 df-nn 11641 df-2 11703 df-3 11704 df-n0 11901 df-z 11985 df-uz 12247 df-fz 12896 df-fzo 13037 df-hash 13694 df-word 13865 df-concat 13925 df-s1 13952 df-s2 14212 df-s3 14213 df-edg 26835 df-umgr 26870 df-wlks 27383 |
This theorem is referenced by: umgr2adedgwlkonALT 27728 umgr2wlk 27730 |
Copyright terms: Public domain | W3C validator |