| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 2pthd | Structured version Visualization version GIF version | ||
| Description: A path of length 2 from one vertex to another vertex via a third vertex. (Contributed by Alexander van der Vekens, 6-Dec-2017.) (Revised by AV, 24-Jan-2021.) (Revised by AV, 24-Mar-2021.) |
| Ref | Expression |
|---|---|
| 2wlkd.p | ⊢ 𝑃 = 〈“𝐴𝐵𝐶”〉 |
| 2wlkd.f | ⊢ 𝐹 = 〈“𝐽𝐾”〉 |
| 2wlkd.s | ⊢ (𝜑 → (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) |
| 2wlkd.n | ⊢ (𝜑 → (𝐴 ≠ 𝐵 ∧ 𝐵 ≠ 𝐶)) |
| 2wlkd.e | ⊢ (𝜑 → ({𝐴, 𝐵} ⊆ (𝐼‘𝐽) ∧ {𝐵, 𝐶} ⊆ (𝐼‘𝐾))) |
| 2wlkd.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| 2wlkd.i | ⊢ 𝐼 = (iEdg‘𝐺) |
| 2trld.n | ⊢ (𝜑 → 𝐽 ≠ 𝐾) |
| Ref | Expression |
|---|---|
| 2pthd | ⊢ (𝜑 → 𝐹(Paths‘𝐺)𝑃) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2wlkd.p | . . . 4 ⊢ 𝑃 = 〈“𝐴𝐵𝐶”〉 | |
| 2 | s3cli 15074 | . . . 4 ⊢ 〈“𝐴𝐵𝐶”〉 ∈ Word V | |
| 3 | 1, 2 | eqeltri 2860 | . . 3 ⊢ 𝑃 ∈ Word V |
| 4 | 3 | a1i 11 | . 2 ⊢ (𝜑 → 𝑃 ∈ Word V) |
| 5 | 2wlkd.f | . . . . 5 ⊢ 𝐹 = 〈“𝐽𝐾”〉 | |
| 6 | 5 | fveq2i 6919 | . . . 4 ⊢ (♯‘𝐹) = (♯‘〈“𝐽𝐾”〉) |
| 7 | s2len 15082 | . . . 4 ⊢ (♯‘〈“𝐽𝐾”〉) = 2 | |
| 8 | 6, 7 | eqtri 2786 | . . 3 ⊢ (♯‘𝐹) = 2 |
| 9 | 3m1e2 12510 | . . 3 ⊢ (3 − 1) = 2 | |
| 10 | 1 | fveq2i 6919 | . . . . 5 ⊢ (♯‘𝑃) = (♯‘〈“𝐴𝐵𝐶”〉) |
| 11 | s3len 15088 | . . . . 5 ⊢ (♯‘〈“𝐴𝐵𝐶”〉) = 3 | |
| 12 | 10, 11 | eqtr2i 2787 | . . . 4 ⊢ 3 = (♯‘𝑃) |
| 13 | 12 | oveq1i 7461 | . . 3 ⊢ (3 − 1) = ((♯‘𝑃) − 1) |
| 14 | 8, 9, 13 | 3eqtr2i 2792 | . 2 ⊢ (♯‘𝐹) = ((♯‘𝑃) − 1) |
| 15 | 2wlkd.s | . . 3 ⊢ (𝜑 → (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) | |
| 16 | 2wlkd.n | . . 3 ⊢ (𝜑 → (𝐴 ≠ 𝐵 ∧ 𝐵 ≠ 𝐶)) | |
| 17 | 1, 5, 15, 16 | 2pthdlem1 30576 | . 2 ⊢ (𝜑 → ∀𝑘 ∈ (0..^(♯‘𝑃))∀𝑗 ∈ (1..^(♯‘𝐹))(𝑘 ≠ 𝑗 → (𝑃‘𝑘) ≠ (𝑃‘𝑗))) |
| 18 | eqid 2763 | . 2 ⊢ (♯‘𝐹) = (♯‘𝐹) | |
| 19 | 2wlkd.e | . . 3 ⊢ (𝜑 → ({𝐴, 𝐵} ⊆ (𝐼‘𝐽) ∧ {𝐵, 𝐶} ⊆ (𝐼‘𝐾))) | |
| 20 | 2wlkd.v | . . 3 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 21 | 2wlkd.i | . . 3 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 22 | 2trld.n | . . 3 ⊢ (𝜑 → 𝐽 ≠ 𝐾) | |
| 23 | 1, 5, 15, 16, 19, 20, 21, 22 | 2trld 30584 | . 2 ⊢ (𝜑 → 𝐹(Trails‘𝐺)𝑃) |
| 24 | 4, 14, 17, 18, 23 | pthd 30412 | 1 ⊢ (𝜑 → 𝐹(Paths‘𝐺)𝑃) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 Vcvv 3454 ⊆ wss 3900 {cpr 4590 class class class wbr 5108 ‘cfv 6566 (class class class)co 7451 1c1 11240 − cmin 11580 2c2 12437 3c3 12438 ♯chash 14515 Word cword 14699 〈“cs2 15034 〈“cs3 15035 Vtxcvtx 29631 iEdgciedg 29632 Pathscpths 30352 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-ifp 1079 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-er 8755 df-map 8887 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-card 10057 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-2 12445 df-3 12446 df-n0 12647 df-z 12734 df-uz 13006 df-fz 13680 df-fzo 13829 df-hash 14516 df-word 14700 df-concat 14757 df-s1 14784 df-s2 15041 df-s3 15042 df-wlks 30237 df-trls 30332 df-pths 30356 |
| This theorem is used by: 2cycld 30802 |
| Copyright terms: Public domain | W3C validator |