![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > 1pthd | 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. 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, 3-Dec-2017.) (Revised by AV, 22-Jan-2021.) (Revised by AV, 23-Mar-2021.) (Proof shortened by AV, 30-Oct-2021.) |
Ref | Expression |
---|---|
1wlkd.p | ⊢ 𝑃 = 〈“𝑋𝑌”〉 |
1wlkd.f | ⊢ 𝐹 = 〈“𝐽”〉 |
1wlkd.x | ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
1wlkd.y | ⊢ (𝜑 → 𝑌 ∈ 𝑉) |
1wlkd.l | ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → (𝐼‘𝐽) = {𝑋}) |
1wlkd.j | ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → {𝑋, 𝑌} ⊆ (𝐼‘𝐽)) |
1wlkd.v | ⊢ 𝑉 = (Vtx‘𝐺) |
1wlkd.i | ⊢ 𝐼 = (iEdg‘𝐺) |
Ref | Expression |
---|---|
1pthd | ⊢ (𝜑 → 𝐹(Paths‘𝐺)𝑃) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 1wlkd.p | . . 3 ⊢ 𝑃 = 〈“𝑋𝑌”〉 | |
2 | 1wlkd.f | . . 3 ⊢ 𝐹 = 〈“𝐽”〉 | |
3 | 1wlkd.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
4 | 1wlkd.y | . . 3 ⊢ (𝜑 → 𝑌 ∈ 𝑉) | |
5 | 1wlkd.l | . . 3 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → (𝐼‘𝐽) = {𝑋}) | |
6 | 1wlkd.j | . . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → {𝑋, 𝑌} ⊆ (𝐼‘𝐽)) | |
7 | 1wlkd.v | . . 3 ⊢ 𝑉 = (Vtx‘𝐺) | |
8 | 1wlkd.i | . . 3 ⊢ 𝐼 = (iEdg‘𝐺) | |
9 | 1, 2, 3, 4, 5, 6, 7, 8 | 1trld 27927 | . 2 ⊢ (𝜑 → 𝐹(Trails‘𝐺)𝑃) |
10 | simpr 488 | . . 3 ⊢ ((𝜑 ∧ 𝐹(Trails‘𝐺)𝑃) → 𝐹(Trails‘𝐺)𝑃) | |
11 | 1, 2 | 1pthdlem1 27920 | . . . 4 ⊢ Fun ◡(𝑃 ↾ (1..^(♯‘𝐹))) |
12 | 11 | a1i 11 | . . 3 ⊢ ((𝜑 ∧ 𝐹(Trails‘𝐺)𝑃) → Fun ◡(𝑃 ↾ (1..^(♯‘𝐹)))) |
13 | 1, 2 | 1pthdlem2 27921 | . . . 4 ⊢ ((𝑃 “ {0, (♯‘𝐹)}) ∩ (𝑃 “ (1..^(♯‘𝐹)))) = ∅ |
14 | 13 | a1i 11 | . . 3 ⊢ ((𝜑 ∧ 𝐹(Trails‘𝐺)𝑃) → ((𝑃 “ {0, (♯‘𝐹)}) ∩ (𝑃 “ (1..^(♯‘𝐹)))) = ∅) |
15 | ispth 27512 | . . 3 ⊢ (𝐹(Paths‘𝐺)𝑃 ↔ (𝐹(Trails‘𝐺)𝑃 ∧ Fun ◡(𝑃 ↾ (1..^(♯‘𝐹))) ∧ ((𝑃 “ {0, (♯‘𝐹)}) ∩ (𝑃 “ (1..^(♯‘𝐹)))) = ∅)) | |
16 | 10, 12, 14, 15 | syl3anbrc 1340 | . 2 ⊢ ((𝜑 ∧ 𝐹(Trails‘𝐺)𝑃) → 𝐹(Paths‘𝐺)𝑃) |
17 | 9, 16 | mpdan 686 | 1 ⊢ (𝜑 → 𝐹(Paths‘𝐺)𝑃) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ≠ wne 2987 ∩ cin 3880 ⊆ wss 3881 ∅c0 4243 {csn 4525 {cpr 4527 class class class wbr 5030 ◡ccnv 5518 ↾ cres 5521 “ cima 5522 Fun wfun 6318 ‘cfv 6324 (class class class)co 7135 0cc0 10526 1c1 10527 ..^cfzo 13028 ♯chash 13686 〈“cs1 13940 〈“cs2 14194 Vtxcvtx 26789 iEdgciedg 26790 Trailsctrls 27480 Pathscpths 27501 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-ifp 1059 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-oadd 8089 df-er 8272 df-map 8391 df-pm 8392 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-card 9352 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-2 11688 df-n0 11886 df-z 11970 df-uz 12232 df-fz 12886 df-fzo 13029 df-hash 13687 df-word 13858 df-concat 13914 df-s1 13941 df-s2 14201 df-wlks 27389 df-trls 27482 df-pths 27505 |
This theorem is referenced by: 1pthond 27929 upgr1pthd 27934 |
Copyright terms: Public domain | W3C validator |