| 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 14847 | . . . 4 ⊢ 〈“𝐴𝐵𝐶”〉 ∈ Word V | |
| 3 | 1, 2 | eqeltri 2824 | . . 3 ⊢ 𝑃 ∈ Word V |
| 4 | 3 | a1i 11 | . 2 ⊢ (𝜑 → 𝑃 ∈ Word V) |
| 5 | 2wlkd.f | . . . . 5 ⊢ 𝐹 = 〈“𝐽𝐾”〉 | |
| 6 | 5 | fveq2i 6861 | . . . 4 ⊢ (♯‘𝐹) = (♯‘〈“𝐽𝐾”〉) |
| 7 | s2len 14855 | . . . 4 ⊢ (♯‘〈“𝐽𝐾”〉) = 2 | |
| 8 | 6, 7 | eqtri 2752 | . . 3 ⊢ (♯‘𝐹) = 2 |
| 9 | 3m1e2 12309 | . . 3 ⊢ (3 − 1) = 2 | |
| 10 | 1 | fveq2i 6861 | . . . . 5 ⊢ (♯‘𝑃) = (♯‘〈“𝐴𝐵𝐶”〉) |
| 11 | s3len 14860 | . . . . 5 ⊢ (♯‘〈“𝐴𝐵𝐶”〉) = 3 | |
| 12 | 10, 11 | eqtr2i 2753 | . . . 4 ⊢ 3 = (♯‘𝑃) |
| 13 | 12 | oveq1i 7397 | . . 3 ⊢ (3 − 1) = ((♯‘𝑃) − 1) |
| 14 | 8, 9, 13 | 3eqtr2i 2758 | . 2 ⊢ (♯‘𝐹) = ((♯‘𝑃) − 1) |
| 15 | 2wlkd.s | . . 3 ⊢ (𝜑 → (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) | |
| 16 | 2wlkd.n | . . 3 ⊢ (𝜑 → (𝐴 ≠ 𝐵 ∧ 𝐵 ≠ 𝐶)) | |
| 17 | 1, 5, 15, 16 | 2pthdlem1 29860 | . 2 ⊢ (𝜑 → ∀𝑘 ∈ (0..^(♯‘𝑃))∀𝑗 ∈ (1..^(♯‘𝐹))(𝑘 ≠ 𝑗 → (𝑃‘𝑘) ≠ (𝑃‘𝑗))) |
| 18 | eqid 2729 | . 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 29868 | . 2 ⊢ (𝜑 → 𝐹(Trails‘𝐺)𝑃) |
| 24 | 4, 14, 17, 18, 23 | pthd 29699 | 1 ⊢ (𝜑 → 𝐹(Paths‘𝐺)𝑃) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 Vcvv 3447 ⊆ wss 3914 {cpr 4591 class class class wbr 5107 ‘cfv 6511 (class class class)co 7387 1c1 11069 − cmin 11405 2c2 12241 3c3 12242 ♯chash 14295 Word cword 14478 〈“cs2 14807 〈“cs3 14808 Vtxcvtx 28923 iEdgciedg 28924 Pathscpths 29640 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5234 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-ifp 1063 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-tp 4594 df-op 4596 df-uni 4872 df-int 4911 df-iun 4957 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-riota 7344 df-ov 7390 df-oprab 7391 df-mpo 7392 df-om 7843 df-1st 7968 df-2nd 7969 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-rdg 8378 df-1o 8434 df-er 8671 df-map 8801 df-en 8919 df-dom 8920 df-sdom 8921 df-fin 8922 df-card 9892 df-pnf 11210 df-mnf 11211 df-xr 11212 df-ltxr 11213 df-le 11214 df-sub 11407 df-neg 11408 df-nn 12187 df-2 12249 df-3 12250 df-n0 12443 df-z 12530 df-uz 12794 df-fz 13469 df-fzo 13616 df-hash 14296 df-word 14479 df-concat 14536 df-s1 14561 df-s2 14814 df-s3 14815 df-wlks 29527 df-trls 29620 df-pths 29644 |
| This theorem is referenced by: 2cycld 35125 |
| Copyright terms: Public domain | W3C validator |