Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > usgr2wspthons3 | Structured version Visualization version GIF version |
Description: A simple path of length 2 between two vertices represented as length 3 string corresponds to two adjacent edges in a simple graph. (Contributed by Alexander van der Vekens, 8-Mar-2018.) (Revised by AV, 17-May-2021.) (Proof shortened by AV, 16-Mar-2022.) |
Ref | Expression |
---|---|
usgr2wspthon0.v | ⊢ 𝑉 = (Vtx‘𝐺) |
usgr2wspthon0.e | ⊢ 𝐸 = (Edg‘𝐺) |
Ref | Expression |
---|---|
usgr2wspthons3 | ⊢ ((𝐺 ∈ USGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶) ↔ (𝐴 ≠ 𝐶 ∧ {𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 2nn 11886 | . . . . . . 7 ⊢ 2 ∈ ℕ | |
2 | ne0i 4239 | . . . . . . 7 ⊢ (〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶) → (𝐴(2 WSPathsNOn 𝐺)𝐶) ≠ ∅) | |
3 | wspthsnonn0vne 27973 | . . . . . . 7 ⊢ ((2 ∈ ℕ ∧ (𝐴(2 WSPathsNOn 𝐺)𝐶) ≠ ∅) → 𝐴 ≠ 𝐶) | |
4 | 1, 2, 3 | sylancr 590 | . . . . . 6 ⊢ (〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶) → 𝐴 ≠ 𝐶) |
5 | simplr 769 | . . . . . . . . 9 ⊢ (((𝐺 ∈ USGraph ∧ 𝐴 ≠ 𝐶) ∧ 〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶)) → 𝐴 ≠ 𝐶) | |
6 | wpthswwlks2on 28017 | . . . . . . . . . . 11 ⊢ ((𝐺 ∈ USGraph ∧ 𝐴 ≠ 𝐶) → (𝐴(2 WSPathsNOn 𝐺)𝐶) = (𝐴(2 WWalksNOn 𝐺)𝐶)) | |
7 | 6 | eleq2d 2819 | . . . . . . . . . 10 ⊢ ((𝐺 ∈ USGraph ∧ 𝐴 ≠ 𝐶) → (〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶) ↔ 〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WWalksNOn 𝐺)𝐶))) |
8 | 7 | biimpa 480 | . . . . . . . . 9 ⊢ (((𝐺 ∈ USGraph ∧ 𝐴 ≠ 𝐶) ∧ 〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶)) → 〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WWalksNOn 𝐺)𝐶)) |
9 | 5, 8 | jca 515 | . . . . . . . 8 ⊢ (((𝐺 ∈ USGraph ∧ 𝐴 ≠ 𝐶) ∧ 〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶)) → (𝐴 ≠ 𝐶 ∧ 〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WWalksNOn 𝐺)𝐶))) |
10 | 9 | exp31 423 | . . . . . . 7 ⊢ (𝐺 ∈ USGraph → (𝐴 ≠ 𝐶 → (〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶) → (𝐴 ≠ 𝐶 ∧ 〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WWalksNOn 𝐺)𝐶))))) |
11 | 10 | com13 88 | . . . . . 6 ⊢ (〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶) → (𝐴 ≠ 𝐶 → (𝐺 ∈ USGraph → (𝐴 ≠ 𝐶 ∧ 〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WWalksNOn 𝐺)𝐶))))) |
12 | 4, 11 | mpd 15 | . . . . 5 ⊢ (〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶) → (𝐺 ∈ USGraph → (𝐴 ≠ 𝐶 ∧ 〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WWalksNOn 𝐺)𝐶)))) |
13 | 12 | com12 32 | . . . 4 ⊢ (𝐺 ∈ USGraph → (〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶) → (𝐴 ≠ 𝐶 ∧ 〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WWalksNOn 𝐺)𝐶)))) |
14 | 7 | biimprd 251 | . . . . 5 ⊢ ((𝐺 ∈ USGraph ∧ 𝐴 ≠ 𝐶) → (〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WWalksNOn 𝐺)𝐶) → 〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶))) |
15 | 14 | expimpd 457 | . . . 4 ⊢ (𝐺 ∈ USGraph → ((𝐴 ≠ 𝐶 ∧ 〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WWalksNOn 𝐺)𝐶)) → 〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶))) |
16 | 13, 15 | impbid 215 | . . 3 ⊢ (𝐺 ∈ USGraph → (〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶) ↔ (𝐴 ≠ 𝐶 ∧ 〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WWalksNOn 𝐺)𝐶)))) |
17 | 16 | adantr 484 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶) ↔ (𝐴 ≠ 𝐶 ∧ 〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WWalksNOn 𝐺)𝐶)))) |
18 | usgrumgr 27242 | . . . . 5 ⊢ (𝐺 ∈ USGraph → 𝐺 ∈ UMGraph) | |
19 | usgr2wspthon0.v | . . . . . 6 ⊢ 𝑉 = (Vtx‘𝐺) | |
20 | usgr2wspthon0.e | . . . . . 6 ⊢ 𝐸 = (Edg‘𝐺) | |
21 | 19, 20 | umgrwwlks2on 28013 | . . . . 5 ⊢ ((𝐺 ∈ UMGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WWalksNOn 𝐺)𝐶) ↔ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸))) |
22 | 18, 21 | sylan 583 | . . . 4 ⊢ ((𝐺 ∈ USGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WWalksNOn 𝐺)𝐶) ↔ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸))) |
23 | 22 | anbi2d 632 | . . 3 ⊢ ((𝐺 ∈ USGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐴 ≠ 𝐶 ∧ 〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WWalksNOn 𝐺)𝐶)) ↔ (𝐴 ≠ 𝐶 ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸)))) |
24 | 3anass 1097 | . . 3 ⊢ ((𝐴 ≠ 𝐶 ∧ {𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸) ↔ (𝐴 ≠ 𝐶 ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸))) | |
25 | 23, 24 | bitr4di 292 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐴 ≠ 𝐶 ∧ 〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WWalksNOn 𝐺)𝐶)) ↔ (𝐴 ≠ 𝐶 ∧ {𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸))) |
26 | 17, 25 | bitrd 282 | 1 ⊢ ((𝐺 ∈ USGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶) ↔ (𝐴 ≠ 𝐶 ∧ {𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 ∧ w3a 1089 = wceq 1543 ∈ wcel 2110 ≠ wne 2935 ∅c0 4227 {cpr 4533 ‘cfv 6369 (class class class)co 7202 ℕcn 11813 2c2 11868 〈“cs3 14390 Vtxcvtx 27059 Edgcedg 27110 UMGraphcumgr 27144 USGraphcusgr 27212 WWalksNOn cwwlksnon 27883 WSPathsNOn cwwspthsnon 27885 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2706 ax-rep 5168 ax-sep 5181 ax-nul 5188 ax-pow 5247 ax-pr 5311 ax-un 7512 ax-ac2 10060 ax-cnex 10768 ax-resscn 10769 ax-1cn 10770 ax-icn 10771 ax-addcl 10772 ax-addrcl 10773 ax-mulcl 10774 ax-mulrcl 10775 ax-mulcom 10776 ax-addass 10777 ax-mulass 10778 ax-distr 10779 ax-i2m1 10780 ax-1ne0 10781 ax-1rid 10782 ax-rnegex 10783 ax-rrecex 10784 ax-cnre 10785 ax-pre-lttri 10786 ax-pre-lttrn 10787 ax-pre-ltadd 10788 ax-pre-mulgt0 10789 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-ifp 1064 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-mo 2537 df-eu 2566 df-clab 2713 df-cleq 2726 df-clel 2812 df-nfc 2882 df-ne 2936 df-nel 3040 df-ral 3059 df-rex 3060 df-reu 3061 df-rmo 3062 df-rab 3063 df-v 3403 df-sbc 3688 df-csb 3803 df-dif 3860 df-un 3862 df-in 3864 df-ss 3874 df-pss 3876 df-nul 4228 df-if 4430 df-pw 4505 df-sn 4532 df-pr 4534 df-tp 4536 df-op 4538 df-uni 4810 df-int 4850 df-iun 4896 df-br 5044 df-opab 5106 df-mpt 5125 df-tr 5151 df-id 5444 df-eprel 5449 df-po 5457 df-so 5458 df-fr 5498 df-se 5499 df-we 5500 df-xp 5546 df-rel 5547 df-cnv 5548 df-co 5549 df-dm 5550 df-rn 5551 df-res 5552 df-ima 5553 df-pred 6149 df-ord 6205 df-on 6206 df-lim 6207 df-suc 6208 df-iota 6327 df-fun 6371 df-fn 6372 df-f 6373 df-f1 6374 df-fo 6375 df-f1o 6376 df-fv 6377 df-isom 6378 df-riota 7159 df-ov 7205 df-oprab 7206 df-mpo 7207 df-om 7634 df-1st 7750 df-2nd 7751 df-wrecs 8036 df-recs 8097 df-rdg 8135 df-1o 8191 df-2o 8192 df-oadd 8195 df-er 8380 df-map 8499 df-pm 8500 df-en 8616 df-dom 8617 df-sdom 8618 df-fin 8619 df-dju 9500 df-card 9538 df-ac 9713 df-pnf 10852 df-mnf 10853 df-xr 10854 df-ltxr 10855 df-le 10856 df-sub 11047 df-neg 11048 df-nn 11814 df-2 11876 df-3 11877 df-n0 12074 df-xnn0 12146 df-z 12160 df-uz 12422 df-fz 13079 df-fzo 13222 df-hash 13880 df-word 14053 df-concat 14109 df-s1 14136 df-s2 14396 df-s3 14397 df-edg 27111 df-uhgr 27121 df-upgr 27145 df-umgr 27146 df-uspgr 27213 df-usgr 27214 df-wlks 27659 df-wlkson 27660 df-trls 27752 df-trlson 27753 df-pths 27775 df-spths 27776 df-pthson 27777 df-spthson 27778 df-wwlks 27886 df-wwlksn 27887 df-wwlksnon 27888 df-wspthsnon 27890 |
This theorem is referenced by: usgr2wspthon 28021 |
Copyright terms: Public domain | W3C validator |