| 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 14942 | . . . 4 ⊢ 〈“𝐴𝐵𝐶”〉 ∈ Word V | |
| 3 | 1, 2 | eqeltri 2861 | . . 3 ⊢ 𝑃 ∈ Word V |
| 4 | 3 | a1i 11 | . 2 ⊢ (𝜑 → 𝑃 ∈ Word V) |
| 5 | 2wlkd.f | . . . . 5 ⊢ 𝐹 = 〈“𝐽𝐾”〉 | |
| 6 | 5 | fveq2i 6888 | . . . 4 ⊢ (♯‘𝐹) = (♯‘〈“𝐽𝐾”〉) |
| 7 | s2len 14950 | . . . 4 ⊢ (♯‘〈“𝐽𝐾”〉) = 2 | |
| 8 | 6, 7 | eqtri 2788 | . . 3 ⊢ (♯‘𝐹) = 2 |
| 9 | 3m1e2 12383 | . . 3 ⊢ (3 − 1) = 2 | |
| 10 | 1 | fveq2i 6888 | . . . . 5 ⊢ (♯‘𝑃) = (♯‘〈“𝐴𝐵𝐶”〉) |
| 11 | s3len 14955 | . . . . 5 ⊢ (♯‘〈“𝐴𝐵𝐶”〉) = 3 | |
| 12 | 10, 11 | eqtr2i 2789 | . . . 4 ⊢ 3 = (♯‘𝑃) |
| 13 | 12 | oveq1i 7429 | . . 3 ⊢ (3 − 1) = ((♯‘𝑃) − 1) |
| 14 | 8, 9, 13 | 3eqtr2i 2794 | . 2 ⊢ (♯‘𝐹) = ((♯‘𝑃) − 1) |
| 15 | 2wlkd.s | . . 3 ⊢ (𝜑 → (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) | |
| 16 | 2wlkd.n | . . 3 ⊢ (𝜑 → (𝐴 ≠ 𝐵 ∧ 𝐵 ≠ 𝐶)) | |
| 17 | 1, 5, 15, 16 | 2pthdlem1 30346 | . 2 ⊢ (𝜑 → ∀𝑘 ∈ (0..^(♯‘𝑃))∀𝑗 ∈ (1..^(♯‘𝐹))(𝑘 ≠ 𝑗 → (𝑃‘𝑘) ≠ (𝑃‘𝑗))) |
| 18 | eqid 2765 | . 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 30354 | . 2 ⊢ (𝜑 → 𝐹(Trails‘𝐺)𝑃) |
| 24 | 4, 14, 17, 18, 23 | pthd 30182 | 1 ⊢ (𝜑 → 𝐹(Paths‘𝐺)𝑃) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ≠ wne 2960 Vcvv 3457 ⊆ wss 3906 {cpr 4593 class class class wbr 5111 ‘cfv 6540 (class class class)co 7419 1c1 11116 − cmin 11456 2c2 12310 3c3 12311 ♯chash 14384 Word cword 14568 〈“cs2 14902 〈“cs3 14903 Vtxcvtx 29401 iEdgciedg 29402 Pathscpths 30122 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-cnex 11171 ax-resscn 11172 ax-1cn 11173 ax-icn 11174 ax-addcl 11175 ax-addrcl 11176 ax-mulcl 11177 ax-mulrcl 11178 ax-mulcom 11179 ax-addass 11180 ax-mulass 11181 ax-distr 11182 ax-i2m1 11183 ax-1ne0 11184 ax-1rid 11185 ax-rnegex 11186 ax-rrecex 11187 ax-cnre 11188 ax-pre-lttri 11189 ax-pre-lttrn 11190 ax-pre-ltadd 11191 ax-pre-mulgt0 11192 |
| 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 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-tp 4596 df-op 4598 df-uni 4875 df-int 4915 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7869 df-1st 7992 df-2nd 7993 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-er 8700 df-map 8832 df-en 8950 df-dom 8951 df-sdom 8952 df-fin 8953 df-card 9941 df-pnf 11260 df-mnf 11261 df-xr 11262 df-ltxr 11263 df-le 11264 df-sub 11458 df-neg 11459 df-nn 12249 df-2 12318 df-3 12319 df-n0 12520 df-z 12607 df-uz 12879 df-fz 13552 df-fzo 13700 df-hash 14385 df-word 14569 df-concat 14626 df-s1 14653 df-s2 14909 df-s3 14910 df-wlks 30007 df-trls 30102 df-pths 30126 |
| This theorem is used by: 2cycld 30572 |
| Copyright terms: Public domain | W3C validator |