Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > usgr2wspthon | Structured version Visualization version GIF version |
Description: A simple path of length 2 between two vertices corresponds to two adjacent edges in a simple graph. (Contributed by Alexander van der Vekens, 9-Mar-2018.) (Revised by AV, 17-May-2021.) |
Ref | Expression |
---|---|
usgr2wspthon0.v | ⊢ 𝑉 = (Vtx‘𝐺) |
usgr2wspthon0.e | ⊢ 𝐸 = (Edg‘𝐺) |
Ref | Expression |
---|---|
usgr2wspthon | ⊢ ((𝐺 ∈ USGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝑇 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶) ↔ ∃𝑏 ∈ 𝑉 ((𝑇 = 〈“𝐴𝑏𝐶”〉 ∧ 𝐴 ≠ 𝐶) ∧ ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝐶} ∈ 𝐸)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | usgrupgr 26953 | . . . 4 ⊢ (𝐺 ∈ USGraph → 𝐺 ∈ UPGraph) | |
2 | 1 | adantr 483 | . . 3 ⊢ ((𝐺 ∈ USGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐺 ∈ UPGraph) |
3 | simpl 485 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) → 𝐴 ∈ 𝑉) | |
4 | 3 | adantl 484 | . . 3 ⊢ ((𝐺 ∈ USGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐴 ∈ 𝑉) |
5 | simpr 487 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) → 𝐶 ∈ 𝑉) | |
6 | 5 | adantl 484 | . . 3 ⊢ ((𝐺 ∈ USGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐶 ∈ 𝑉) |
7 | usgr2wspthon0.v | . . . 4 ⊢ 𝑉 = (Vtx‘𝐺) | |
8 | 7 | elwspths2on 27724 | . . 3 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) → (𝑇 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶) ↔ ∃𝑏 ∈ 𝑉 (𝑇 = 〈“𝐴𝑏𝐶”〉 ∧ 〈“𝐴𝑏𝐶”〉 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶)))) |
9 | 2, 4, 6, 8 | syl3anc 1367 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝑇 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶) ↔ ∃𝑏 ∈ 𝑉 (𝑇 = 〈“𝐴𝑏𝐶”〉 ∧ 〈“𝐴𝑏𝐶”〉 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶)))) |
10 | simpl 485 | . . . . . . 7 ⊢ ((𝐺 ∈ USGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐺 ∈ USGraph) | |
11 | 10 | adantr 483 | . . . . . 6 ⊢ (((𝐺 ∈ USGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) ∧ 𝑏 ∈ 𝑉) → 𝐺 ∈ USGraph) |
12 | simplrl 775 | . . . . . 6 ⊢ (((𝐺 ∈ USGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) ∧ 𝑏 ∈ 𝑉) → 𝐴 ∈ 𝑉) | |
13 | simpr 487 | . . . . . 6 ⊢ (((𝐺 ∈ USGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) ∧ 𝑏 ∈ 𝑉) → 𝑏 ∈ 𝑉) | |
14 | simplrr 776 | . . . . . 6 ⊢ (((𝐺 ∈ USGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) ∧ 𝑏 ∈ 𝑉) → 𝐶 ∈ 𝑉) | |
15 | usgr2wspthon0.e | . . . . . . 7 ⊢ 𝐸 = (Edg‘𝐺) | |
16 | 7, 15 | usgr2wspthons3 27728 | . . . . . 6 ⊢ ((𝐺 ∈ USGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (〈“𝐴𝑏𝐶”〉 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶) ↔ (𝐴 ≠ 𝐶 ∧ {𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝐶} ∈ 𝐸))) |
17 | 11, 12, 13, 14, 16 | syl13anc 1368 | . . . . 5 ⊢ (((𝐺 ∈ USGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) ∧ 𝑏 ∈ 𝑉) → (〈“𝐴𝑏𝐶”〉 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶) ↔ (𝐴 ≠ 𝐶 ∧ {𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝐶} ∈ 𝐸))) |
18 | 17 | anbi2d 630 | . . . 4 ⊢ (((𝐺 ∈ USGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) ∧ 𝑏 ∈ 𝑉) → ((𝑇 = 〈“𝐴𝑏𝐶”〉 ∧ 〈“𝐴𝑏𝐶”〉 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶)) ↔ (𝑇 = 〈“𝐴𝑏𝐶”〉 ∧ (𝐴 ≠ 𝐶 ∧ {𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝐶} ∈ 𝐸)))) |
19 | anass 471 | . . . . 5 ⊢ (((𝑇 = 〈“𝐴𝑏𝐶”〉 ∧ 𝐴 ≠ 𝐶) ∧ ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝐶} ∈ 𝐸)) ↔ (𝑇 = 〈“𝐴𝑏𝐶”〉 ∧ (𝐴 ≠ 𝐶 ∧ ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝐶} ∈ 𝐸)))) | |
20 | 3anass 1091 | . . . . . . 7 ⊢ ((𝐴 ≠ 𝐶 ∧ {𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝐶} ∈ 𝐸) ↔ (𝐴 ≠ 𝐶 ∧ ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝐶} ∈ 𝐸))) | |
21 | 20 | bicomi 226 | . . . . . 6 ⊢ ((𝐴 ≠ 𝐶 ∧ ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝐶} ∈ 𝐸)) ↔ (𝐴 ≠ 𝐶 ∧ {𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝐶} ∈ 𝐸)) |
22 | 21 | anbi2i 624 | . . . . 5 ⊢ ((𝑇 = 〈“𝐴𝑏𝐶”〉 ∧ (𝐴 ≠ 𝐶 ∧ ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝐶} ∈ 𝐸))) ↔ (𝑇 = 〈“𝐴𝑏𝐶”〉 ∧ (𝐴 ≠ 𝐶 ∧ {𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝐶} ∈ 𝐸))) |
23 | 19, 22 | bitri 277 | . . . 4 ⊢ (((𝑇 = 〈“𝐴𝑏𝐶”〉 ∧ 𝐴 ≠ 𝐶) ∧ ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝐶} ∈ 𝐸)) ↔ (𝑇 = 〈“𝐴𝑏𝐶”〉 ∧ (𝐴 ≠ 𝐶 ∧ {𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝐶} ∈ 𝐸))) |
24 | 18, 23 | syl6bbr 291 | . . 3 ⊢ (((𝐺 ∈ USGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) ∧ 𝑏 ∈ 𝑉) → ((𝑇 = 〈“𝐴𝑏𝐶”〉 ∧ 〈“𝐴𝑏𝐶”〉 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶)) ↔ ((𝑇 = 〈“𝐴𝑏𝐶”〉 ∧ 𝐴 ≠ 𝐶) ∧ ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝐶} ∈ 𝐸)))) |
25 | 24 | rexbidva 3296 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (∃𝑏 ∈ 𝑉 (𝑇 = 〈“𝐴𝑏𝐶”〉 ∧ 〈“𝐴𝑏𝐶”〉 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶)) ↔ ∃𝑏 ∈ 𝑉 ((𝑇 = 〈“𝐴𝑏𝐶”〉 ∧ 𝐴 ≠ 𝐶) ∧ ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝐶} ∈ 𝐸)))) |
26 | 9, 25 | bitrd 281 | 1 ⊢ ((𝐺 ∈ USGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝑇 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶) ↔ ∃𝑏 ∈ 𝑉 ((𝑇 = 〈“𝐴𝑏𝐶”〉 ∧ 𝐴 ≠ 𝐶) ∧ ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝐶} ∈ 𝐸)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ≠ wne 3016 ∃wrex 3139 {cpr 4555 ‘cfv 6341 (class class class)co 7142 2c2 11679 〈“cs3 14189 Vtxcvtx 26767 Edgcedg 26818 UPGraphcupgr 26851 USGraphcusgr 26920 WSPathsNOn cwwspthsnon 27593 |
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 2793 ax-rep 5176 ax-sep 5189 ax-nul 5196 ax-pow 5252 ax-pr 5316 ax-un 7447 ax-ac2 9871 ax-cnex 10579 ax-resscn 10580 ax-1cn 10581 ax-icn 10582 ax-addcl 10583 ax-addrcl 10584 ax-mulcl 10585 ax-mulrcl 10586 ax-mulcom 10587 ax-addass 10588 ax-mulass 10589 ax-distr 10590 ax-i2m1 10591 ax-1ne0 10592 ax-1rid 10593 ax-rnegex 10594 ax-rrecex 10595 ax-cnre 10596 ax-pre-lttri 10597 ax-pre-lttrn 10598 ax-pre-ltadd 10599 ax-pre-mulgt0 10600 |
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-fal 1550 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3488 df-sbc 3764 df-csb 3872 df-dif 3927 df-un 3929 df-in 3931 df-ss 3940 df-pss 3942 df-nul 4280 df-if 4454 df-pw 4527 df-sn 4554 df-pr 4556 df-tp 4558 df-op 4560 df-uni 4825 df-int 4863 df-iun 4907 df-br 5053 df-opab 5115 df-mpt 5133 df-tr 5159 df-id 5446 df-eprel 5451 df-po 5460 df-so 5461 df-fr 5500 df-se 5501 df-we 5502 df-xp 5547 df-rel 5548 df-cnv 5549 df-co 5550 df-dm 5551 df-rn 5552 df-res 5553 df-ima 5554 df-pred 6134 df-ord 6180 df-on 6181 df-lim 6182 df-suc 6183 df-iota 6300 df-fun 6343 df-fn 6344 df-f 6345 df-f1 6346 df-fo 6347 df-f1o 6348 df-fv 6349 df-isom 6350 df-riota 7100 df-ov 7145 df-oprab 7146 df-mpo 7147 df-om 7567 df-1st 7675 df-2nd 7676 df-wrecs 7933 df-recs 7994 df-rdg 8032 df-1o 8088 df-2o 8089 df-oadd 8092 df-er 8275 df-map 8394 df-pm 8395 df-en 8496 df-dom 8497 df-sdom 8498 df-fin 8499 df-dju 9316 df-card 9354 df-ac 9528 df-pnf 10663 df-mnf 10664 df-xr 10665 df-ltxr 10666 df-le 10667 df-sub 10858 df-neg 10859 df-nn 11625 df-2 11687 df-3 11688 df-n0 11885 df-xnn0 11955 df-z 11969 df-uz 12231 df-fz 12883 df-fzo 13024 df-hash 13681 df-word 13852 df-concat 13908 df-s1 13935 df-s2 14195 df-s3 14196 df-edg 26819 df-uhgr 26829 df-upgr 26853 df-umgr 26854 df-uspgr 26921 df-usgr 26922 df-wlks 27367 df-wlkson 27368 df-trls 27460 df-trlson 27461 df-pths 27483 df-spths 27484 df-pthson 27485 df-spthson 27486 df-wwlks 27594 df-wwlksn 27595 df-wwlksnon 27596 df-wspthsnon 27598 |
This theorem is referenced by: fusgr2wsp2nb 28097 |
Copyright terms: Public domain | W3C validator |