Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 1pthond | Structured version Visualization version GIF version |
Description: In a graph with two vertices and an edge connecting these two vertices, to go from one vertex to the other vertex via this edge is a path from one of these vertices to the other vertex. The two vertices need not be distinct (in the case of a loop) - in this case, however, the path is not a simple path. (Contributed by Alexander van der Vekens, 4-Dec-2017.) (Revised by AV, 22-Jan-2021.) (Revised by AV, 23-Mar-2021.) |
Ref | Expression |
---|---|
1wlkd.p | ⊢ 𝑃 = 〈“𝑋𝑌”〉 |
1wlkd.f | ⊢ 𝐹 = 〈“𝐽”〉 |
1wlkd.x | ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
1wlkd.y | ⊢ (𝜑 → 𝑌 ∈ 𝑉) |
1wlkd.l | ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → (𝐼‘𝐽) = {𝑋}) |
1wlkd.j | ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → {𝑋, 𝑌} ⊆ (𝐼‘𝐽)) |
1wlkd.v | ⊢ 𝑉 = (Vtx‘𝐺) |
1wlkd.i | ⊢ 𝐼 = (iEdg‘𝐺) |
Ref | Expression |
---|---|
1pthond | ⊢ (𝜑 → 𝐹(𝑋(PathsOn‘𝐺)𝑌)𝑃) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 1wlkd.p | . . . . 5 ⊢ 𝑃 = 〈“𝑋𝑌”〉 | |
2 | 1wlkd.f | . . . . 5 ⊢ 𝐹 = 〈“𝐽”〉 | |
3 | 1wlkd.x | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
4 | 1wlkd.y | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝑉) | |
5 | 1wlkd.l | . . . . 5 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → (𝐼‘𝐽) = {𝑋}) | |
6 | 1wlkd.j | . . . . 5 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → {𝑋, 𝑌} ⊆ (𝐼‘𝐽)) | |
7 | 1wlkd.v | . . . . 5 ⊢ 𝑉 = (Vtx‘𝐺) | |
8 | 1wlkd.i | . . . . 5 ⊢ 𝐼 = (iEdg‘𝐺) | |
9 | 1, 2, 3, 4, 5, 6, 7, 8 | 1wlkd 27922 | . . . 4 ⊢ (𝜑 → 𝐹(Walks‘𝐺)𝑃) |
10 | 1 | fveq1i 6673 | . . . . . 6 ⊢ (𝑃‘0) = (〈“𝑋𝑌”〉‘0) |
11 | s2fv0 14251 | . . . . . 6 ⊢ (𝑋 ∈ 𝑉 → (〈“𝑋𝑌”〉‘0) = 𝑋) | |
12 | 10, 11 | syl5eq 2870 | . . . . 5 ⊢ (𝑋 ∈ 𝑉 → (𝑃‘0) = 𝑋) |
13 | 3, 12 | syl 17 | . . . 4 ⊢ (𝜑 → (𝑃‘0) = 𝑋) |
14 | 2 | fveq2i 6675 | . . . . . . 7 ⊢ (♯‘𝐹) = (♯‘〈“𝐽”〉) |
15 | s1len 13962 | . . . . . . 7 ⊢ (♯‘〈“𝐽”〉) = 1 | |
16 | 14, 15 | eqtri 2846 | . . . . . 6 ⊢ (♯‘𝐹) = 1 |
17 | 1, 16 | fveq12i 6678 | . . . . 5 ⊢ (𝑃‘(♯‘𝐹)) = (〈“𝑋𝑌”〉‘1) |
18 | s2fv1 14252 | . . . . . 6 ⊢ (𝑌 ∈ 𝑉 → (〈“𝑋𝑌”〉‘1) = 𝑌) | |
19 | 4, 18 | syl 17 | . . . . 5 ⊢ (𝜑 → (〈“𝑋𝑌”〉‘1) = 𝑌) |
20 | 17, 19 | syl5eq 2870 | . . . 4 ⊢ (𝜑 → (𝑃‘(♯‘𝐹)) = 𝑌) |
21 | wlkv 27396 | . . . . . . 7 ⊢ (𝐹(Walks‘𝐺)𝑃 → (𝐺 ∈ V ∧ 𝐹 ∈ V ∧ 𝑃 ∈ V)) | |
22 | 3simpc 1146 | . . . . . . 7 ⊢ ((𝐺 ∈ V ∧ 𝐹 ∈ V ∧ 𝑃 ∈ V) → (𝐹 ∈ V ∧ 𝑃 ∈ V)) | |
23 | 9, 21, 22 | 3syl 18 | . . . . . 6 ⊢ (𝜑 → (𝐹 ∈ V ∧ 𝑃 ∈ V)) |
24 | 3, 4, 23 | jca31 517 | . . . . 5 ⊢ (𝜑 → ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) ∧ (𝐹 ∈ V ∧ 𝑃 ∈ V))) |
25 | 7 | iswlkon 27441 | . . . . 5 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) ∧ (𝐹 ∈ V ∧ 𝑃 ∈ V)) → (𝐹(𝑋(WalksOn‘𝐺)𝑌)𝑃 ↔ (𝐹(Walks‘𝐺)𝑃 ∧ (𝑃‘0) = 𝑋 ∧ (𝑃‘(♯‘𝐹)) = 𝑌))) |
26 | 24, 25 | syl 17 | . . . 4 ⊢ (𝜑 → (𝐹(𝑋(WalksOn‘𝐺)𝑌)𝑃 ↔ (𝐹(Walks‘𝐺)𝑃 ∧ (𝑃‘0) = 𝑋 ∧ (𝑃‘(♯‘𝐹)) = 𝑌))) |
27 | 9, 13, 20, 26 | mpbir3and 1338 | . . 3 ⊢ (𝜑 → 𝐹(𝑋(WalksOn‘𝐺)𝑌)𝑃) |
28 | 1, 2, 3, 4, 5, 6, 7, 8 | 1trld 27923 | . . 3 ⊢ (𝜑 → 𝐹(Trails‘𝐺)𝑃) |
29 | 7 | istrlson 27490 | . . . 4 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) ∧ (𝐹 ∈ V ∧ 𝑃 ∈ V)) → (𝐹(𝑋(TrailsOn‘𝐺)𝑌)𝑃 ↔ (𝐹(𝑋(WalksOn‘𝐺)𝑌)𝑃 ∧ 𝐹(Trails‘𝐺)𝑃))) |
30 | 24, 29 | syl 17 | . . 3 ⊢ (𝜑 → (𝐹(𝑋(TrailsOn‘𝐺)𝑌)𝑃 ↔ (𝐹(𝑋(WalksOn‘𝐺)𝑌)𝑃 ∧ 𝐹(Trails‘𝐺)𝑃))) |
31 | 27, 28, 30 | mpbir2and 711 | . 2 ⊢ (𝜑 → 𝐹(𝑋(TrailsOn‘𝐺)𝑌)𝑃) |
32 | 1, 2, 3, 4, 5, 6, 7, 8 | 1pthd 27924 | . 2 ⊢ (𝜑 → 𝐹(Paths‘𝐺)𝑃) |
33 | 3 | adantl 484 | . . . . . . 7 ⊢ (((𝐹 ∈ V ∧ 𝑃 ∈ V) ∧ 𝜑) → 𝑋 ∈ 𝑉) |
34 | 4 | adantl 484 | . . . . . . 7 ⊢ (((𝐹 ∈ V ∧ 𝑃 ∈ V) ∧ 𝜑) → 𝑌 ∈ 𝑉) |
35 | simpl 485 | . . . . . . 7 ⊢ (((𝐹 ∈ V ∧ 𝑃 ∈ V) ∧ 𝜑) → (𝐹 ∈ V ∧ 𝑃 ∈ V)) | |
36 | 33, 34, 35 | jca31 517 | . . . . . 6 ⊢ (((𝐹 ∈ V ∧ 𝑃 ∈ V) ∧ 𝜑) → ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) ∧ (𝐹 ∈ V ∧ 𝑃 ∈ V))) |
37 | 36 | ex 415 | . . . . 5 ⊢ ((𝐹 ∈ V ∧ 𝑃 ∈ V) → (𝜑 → ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) ∧ (𝐹 ∈ V ∧ 𝑃 ∈ V)))) |
38 | 21, 22, 37 | 3syl 18 | . . . 4 ⊢ (𝐹(Walks‘𝐺)𝑃 → (𝜑 → ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) ∧ (𝐹 ∈ V ∧ 𝑃 ∈ V)))) |
39 | 9, 38 | mpcom 38 | . . 3 ⊢ (𝜑 → ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) ∧ (𝐹 ∈ V ∧ 𝑃 ∈ V))) |
40 | 7 | ispthson 27525 | . . 3 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) ∧ (𝐹 ∈ V ∧ 𝑃 ∈ V)) → (𝐹(𝑋(PathsOn‘𝐺)𝑌)𝑃 ↔ (𝐹(𝑋(TrailsOn‘𝐺)𝑌)𝑃 ∧ 𝐹(Paths‘𝐺)𝑃))) |
41 | 39, 40 | syl 17 | . 2 ⊢ (𝜑 → (𝐹(𝑋(PathsOn‘𝐺)𝑌)𝑃 ↔ (𝐹(𝑋(TrailsOn‘𝐺)𝑌)𝑃 ∧ 𝐹(Paths‘𝐺)𝑃))) |
42 | 31, 32, 41 | mpbir2and 711 | 1 ⊢ (𝜑 → 𝐹(𝑋(PathsOn‘𝐺)𝑌)𝑃) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ≠ wne 3018 Vcvv 3496 ⊆ wss 3938 {csn 4569 {cpr 4571 class class class wbr 5068 ‘cfv 6357 (class class class)co 7158 0cc0 10539 1c1 10540 ♯chash 13693 〈“cs1 13951 〈“cs2 14205 Vtxcvtx 26783 iEdgciedg 26784 Walkscwlks 27380 WalksOncwlkson 27381 Trailsctrls 27474 TrailsOnctrlson 27475 Pathscpths 27495 PathsOncpthson 27497 |
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-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-pm 8411 df-en 8512 df-dom 8513 df-sdom 8514 df-fin 8515 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-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-wlks 27383 df-wlkson 27384 df-trls 27476 df-trlson 27477 df-pths 27499 df-pthson 27501 |
This theorem is referenced by: upgr1pthond 27931 lppthon 27932 1pthon2v 27934 |
Copyright terms: Public domain | W3C validator |