| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 2spthd | Structured version Visualization version GIF version | ||
| Description: A simple path of length 2 from one vertex to another, different vertex via a third vertex. (Contributed by Alexander van der Vekens, 1-Feb-2018.) (Revised by AV, 24-Jan-2021.) (Revised by AV, 24-Mar-2021.) (Proof shortened by AV, 30-Oct-2021.) |
| Ref | Expression |
|---|---|
| 2wlkd.p | ⊢ 𝑃 = 〈“𝐴𝐵𝐶”〉 |
| 2wlkd.f | ⊢ 𝐹 = 〈“𝐽𝐾”〉 |
| 2wlkd.s | ⊢ (𝜑 → (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) |
| 2wlkd.n | ⊢ (𝜑 → (𝐴 ≠ 𝐵 ∧ 𝐵 ≠ 𝐶)) |
| 2wlkd.e | ⊢ (𝜑 → ({𝐴, 𝐵} ⊆ (𝐼‘𝐽) ∧ {𝐵, 𝐶} ⊆ (𝐼‘𝐾))) |
| 2wlkd.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| 2wlkd.i | ⊢ 𝐼 = (iEdg‘𝐺) |
| 2trld.n | ⊢ (𝜑 → 𝐽 ≠ 𝐾) |
| 2spthd.n | ⊢ (𝜑 → 𝐴 ≠ 𝐶) |
| Ref | Expression |
|---|---|
| 2spthd | ⊢ (𝜑 → 𝐹(SPaths‘𝐺)𝑃) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2wlkd.p | . . 3 ⊢ 𝑃 = 〈“𝐴𝐵𝐶”〉 | |
| 2 | 2wlkd.f | . . 3 ⊢ 𝐹 = 〈“𝐽𝐾”〉 | |
| 3 | 2wlkd.s | . . 3 ⊢ (𝜑 → (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) | |
| 4 | 2wlkd.n | . . 3 ⊢ (𝜑 → (𝐴 ≠ 𝐵 ∧ 𝐵 ≠ 𝐶)) | |
| 5 | 2wlkd.e | . . 3 ⊢ (𝜑 → ({𝐴, 𝐵} ⊆ (𝐼‘𝐽) ∧ {𝐵, 𝐶} ⊆ (𝐼‘𝐾))) | |
| 6 | 2wlkd.v | . . 3 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 7 | 2wlkd.i | . . 3 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 8 | 2trld.n | . . 3 ⊢ (𝜑 → 𝐽 ≠ 𝐾) | |
| 9 | 1, 2, 3, 4, 5, 6, 7, 8 | 2trld 30228 | . 2 ⊢ (𝜑 → 𝐹(Trails‘𝐺)𝑃) |
| 10 | 2spthd.n | . . . . 5 ⊢ (𝜑 → 𝐴 ≠ 𝐶) | |
| 11 | 3anan32 1111 | . . . . 5 ⊢ ((𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶) ↔ ((𝐴 ≠ 𝐵 ∧ 𝐵 ≠ 𝐶) ∧ 𝐴 ≠ 𝐶)) | |
| 12 | 4, 10, 11 | sylanbrc 594 | . . . 4 ⊢ (𝜑 → (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) |
| 13 | funcnvs3 14951 | . . . 4 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) → Fun ◡〈“𝐴𝐵𝐶”〉) | |
| 14 | 3, 12, 13 | syl2anc 595 | . . 3 ⊢ (𝜑 → Fun ◡〈“𝐴𝐵𝐶”〉) |
| 15 | 1 | a1i 11 | . . . . 5 ⊢ (𝜑 → 𝑃 = 〈“𝐴𝐵𝐶”〉) |
| 16 | 15 | cnveqd 5862 | . . . 4 ⊢ (𝜑 → ◡𝑃 = ◡〈“𝐴𝐵𝐶”〉) |
| 17 | 16 | funeqd 6559 | . . 3 ⊢ (𝜑 → (Fun ◡𝑃 ↔ Fun ◡〈“𝐴𝐵𝐶”〉)) |
| 18 | 14, 17 | mpbird 260 | . 2 ⊢ (𝜑 → Fun ◡𝑃) |
| 19 | isspth 30012 | . 2 ⊢ (𝐹(SPaths‘𝐺)𝑃 ↔ (𝐹(Trails‘𝐺)𝑃 ∧ Fun ◡𝑃)) | |
| 20 | 9, 18, 19 | sylanbrc 594 | 1 ⊢ (𝜑 → 𝐹(SPaths‘𝐺)𝑃) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 ⊆ wss 3913 {cpr 4596 class class class wbr 5113 ◡ccnv 5661 Fun wfun 6531 ‘cfv 6537 〈“cs2 14878 〈“cs3 14879 Vtxcvtx 29287 iEdgciedg 29288 Trailsctrls 29979 SPathscspths 30001 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11156 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-ifp 1077 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-tp 4599 df-op 4601 df-uni 4877 df-int 4917 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-1o 8453 df-er 8694 df-map 8826 df-en 8944 df-dom 8945 df-sdom 8946 df-fin 8947 df-card 9925 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-nn 12234 df-2 12303 df-3 12304 df-n0 12505 df-z 12592 df-uz 12863 df-fz 13536 df-fzo 13683 df-hash 14367 df-word 14551 df-concat 14608 df-s1 14634 df-s2 14885 df-s3 14886 df-wlks 29890 df-trls 29981 df-spths 30005 |
| This theorem is referenced by: 2pthond 30232 umgr2adedgspth 30238 |
| Copyright terms: Public domain | W3C validator |