| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > umgr2adedgwlkon | Structured version Visualization version GIF version | ||
| Description: In a multigraph, two adjacent edges form a walk between two vertices. (Contributed by Alexander van der Vekens, 18-Feb-2018.) (Revised by AV, 30-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 |
|---|---|
| umgr2adedgwlkon | ⊢ (𝜑 → 𝐹(𝐴(WalksOn‘𝐺)𝐶)𝑃) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | umgr2adedgwlk.p | . 2 ⊢ 𝑃 = 〈“𝐴𝐵𝐶”〉 | |
| 2 | umgr2adedgwlk.f | . 2 ⊢ 𝐹 = 〈“𝐽𝐾”〉 | |
| 3 | umgr2adedgwlk.g | . . . . 5 ⊢ (𝜑 → 𝐺 ∈ UMGraph) | |
| 4 | umgr2adedgwlk.a | . . . . 5 ⊢ (𝜑 → ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸)) | |
| 5 | 3anass 1112 | . . . . 5 ⊢ ((𝐺 ∈ UMGraph ∧ {𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸) ↔ (𝐺 ∈ UMGraph ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸))) | |
| 6 | 3, 4, 5 | sylanbrc 595 | . . . 4 ⊢ (𝜑 → (𝐺 ∈ UMGraph ∧ {𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸)) |
| 7 | umgr2adedgwlk.e | . . . . 5 ⊢ 𝐸 = (Edg‘𝐺) | |
| 8 | 7 | umgr2adedgwlklem 30592 | . . . 4 ⊢ ((𝐺 ∈ UMGraph ∧ {𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸) → ((𝐴 ≠ 𝐵 ∧ 𝐵 ≠ 𝐶) ∧ (𝐴 ∈ (Vtx‘𝐺) ∧ 𝐵 ∈ (Vtx‘𝐺) ∧ 𝐶 ∈ (Vtx‘𝐺)))) |
| 9 | 6, 8 | syl 18 | . . 3 ⊢ (𝜑 → ((𝐴 ≠ 𝐵 ∧ 𝐵 ≠ 𝐶) ∧ (𝐴 ∈ (Vtx‘𝐺) ∧ 𝐵 ∈ (Vtx‘𝐺) ∧ 𝐶 ∈ (Vtx‘𝐺)))) |
| 10 | 9 | simprd 501 | . 2 ⊢ (𝜑 → (𝐴 ∈ (Vtx‘𝐺) ∧ 𝐵 ∈ (Vtx‘𝐺) ∧ 𝐶 ∈ (Vtx‘𝐺))) |
| 11 | 9 | simpld 500 | . 2 ⊢ (𝜑 → (𝐴 ≠ 𝐵 ∧ 𝐵 ≠ 𝐶)) |
| 12 | ssid 3934 | . . . 4 ⊢ {𝐴, 𝐵} ⊆ {𝐴, 𝐵} | |
| 13 | umgr2adedgwlk.j | . . . 4 ⊢ (𝜑 → (𝐼‘𝐽) = {𝐴, 𝐵}) | |
| 14 | 12, 13 | sseqtrrid 3955 | . . 3 ⊢ (𝜑 → {𝐴, 𝐵} ⊆ (𝐼‘𝐽)) |
| 15 | ssid 3934 | . . . 4 ⊢ {𝐵, 𝐶} ⊆ {𝐵, 𝐶} | |
| 16 | umgr2adedgwlk.k | . . . 4 ⊢ (𝜑 → (𝐼‘𝐾) = {𝐵, 𝐶}) | |
| 17 | 15, 16 | sseqtrrid 3955 | . . 3 ⊢ (𝜑 → {𝐵, 𝐶} ⊆ (𝐼‘𝐾)) |
| 18 | 14, 17 | jca 521 | . 2 ⊢ (𝜑 → ({𝐴, 𝐵} ⊆ (𝐼‘𝐽) ∧ {𝐵, 𝐶} ⊆ (𝐼‘𝐾))) |
| 19 | eqid 2766 | . 2 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 20 | umgr2adedgwlk.i | . 2 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 21 | 1, 2, 10, 11, 18, 19, 20 | 2wlkond 30585 | 1 ⊢ (𝜑 → 𝐹(𝐴(WalksOn‘𝐺)𝐶)𝑃) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1104 = wceq 1572 ∈ wcel 2150 ≠ wne 2962 ⊆ wss 3899 {cpr 4589 class class class wbr 5107 ‘cfv 6565 (class class class)co 7450 〈“cs2 15033 〈“cs3 15034 Vtxcvtx 29633 iEdgciedg 29634 Edgcedg 29684 UMGraphcumgr 29718 WalksOncwlkson 30237 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-rep 5237 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 ax-cnex 11294 ax-resscn 11295 ax-1cn 11296 ax-icn 11297 ax-addcl 11298 ax-addrcl 11299 ax-mulcl 11300 ax-mulrcl 11301 ax-mulcom 11302 ax-addass 11303 ax-mulass 11304 ax-distr 11305 ax-i2m1 11306 ax-1ne0 11307 ax-1rid 11308 ax-rnegex 11309 ax-rrecex 11310 ax-cnre 11311 ax-pre-lttri 11312 ax-pre-lttrn 11313 ax-pre-ltadd 11314 ax-pre-mulgt0 11315 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-ifp 1080 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-nel 3069 df-ral 3084 df-rex 3094 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4840 df-uni 4872 df-int 4912 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5552 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5610 df-we 5612 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-pred 6329 df-ord 6390 df-on 6391 df-lim 6392 df-suc 6393 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-om 7911 df-1st 8034 df-2nd 8035 df-frecs 8336 df-wrecs 8367 df-recs 8416 df-rdg 8455 df-1o 8513 df-oadd 8517 df-er 8754 df-map 8886 df-en 9011 df-dom 9012 df-sdom 9013 df-fin 9014 df-dju 10018 df-card 10056 df-pnf 11383 df-mnf 11384 df-xr 11385 df-ltxr 11386 df-le 11387 df-sub 11581 df-neg 11582 df-nn 12375 df-2 12444 df-3 12445 df-n0 12646 df-z 12733 df-uz 13005 df-fz 13679 df-fzo 13828 df-hash 14515 df-word 14699 df-concat 14756 df-s1 14783 df-s2 15040 df-s3 15041 df-edg 29685 df-umgr 29720 df-wlks 30239 df-wlkson 30240 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |