| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 3spthond | Structured version Visualization version GIF version | ||
| Description: A simple path of length 3 from one vertex to another, different vertex via a third vertex. (Contributed by AV, 10-Feb-2021.) (Revised by AV, 24-Mar-2021.) |
| Ref | Expression |
|---|---|
| 3wlkd.p | ⊢ 𝑃 = 〈“𝐴𝐵𝐶𝐷”〉 |
| 3wlkd.f | ⊢ 𝐹 = 〈“𝐽𝐾𝐿”〉 |
| 3wlkd.s | ⊢ (𝜑 → ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉))) |
| 3wlkd.n | ⊢ (𝜑 → ((𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶) ∧ (𝐵 ≠ 𝐶 ∧ 𝐵 ≠ 𝐷) ∧ 𝐶 ≠ 𝐷)) |
| 3wlkd.e | ⊢ (𝜑 → ({𝐴, 𝐵} ⊆ (𝐼‘𝐽) ∧ {𝐵, 𝐶} ⊆ (𝐼‘𝐾) ∧ {𝐶, 𝐷} ⊆ (𝐼‘𝐿))) |
| 3wlkd.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| 3wlkd.i | ⊢ 𝐼 = (iEdg‘𝐺) |
| 3trld.n | ⊢ (𝜑 → (𝐽 ≠ 𝐾 ∧ 𝐽 ≠ 𝐿 ∧ 𝐾 ≠ 𝐿)) |
| 3spthd.n | ⊢ (𝜑 → 𝐴 ≠ 𝐷) |
| Ref | Expression |
|---|---|
| 3spthond | ⊢ (𝜑 → 𝐹(𝐴(SPathsOn‘𝐺)𝐷)𝑃) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 3wlkd.p | . . 3 ⊢ 𝑃 = 〈“𝐴𝐵𝐶𝐷”〉 | |
| 2 | 3wlkd.f | . . 3 ⊢ 𝐹 = 〈“𝐽𝐾𝐿”〉 | |
| 3 | 3wlkd.s | . . 3 ⊢ (𝜑 → ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉))) | |
| 4 | 3wlkd.n | . . 3 ⊢ (𝜑 → ((𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶) ∧ (𝐵 ≠ 𝐶 ∧ 𝐵 ≠ 𝐷) ∧ 𝐶 ≠ 𝐷)) | |
| 5 | 3wlkd.e | . . 3 ⊢ (𝜑 → ({𝐴, 𝐵} ⊆ (𝐼‘𝐽) ∧ {𝐵, 𝐶} ⊆ (𝐼‘𝐾) ∧ {𝐶, 𝐷} ⊆ (𝐼‘𝐿))) | |
| 6 | 3wlkd.v | . . 3 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 7 | 3wlkd.i | . . 3 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 8 | 3trld.n | . . 3 ⊢ (𝜑 → (𝐽 ≠ 𝐾 ∧ 𝐽 ≠ 𝐿 ∧ 𝐾 ≠ 𝐿)) | |
| 9 | 1, 2, 3, 4, 5, 6, 7, 8 | 3trlond 30661 | . 2 ⊢ (𝜑 → 𝐹(𝐴(TrailsOn‘𝐺)𝐷)𝑃) |
| 10 | 3spthd.n | . . 3 ⊢ (𝜑 → 𝐴 ≠ 𝐷) | |
| 11 | 1, 2, 3, 4, 5, 6, 7, 8, 10 | 3spthd 30664 | . 2 ⊢ (𝜑 → 𝐹(SPaths‘𝐺)𝑃) |
| 12 | 3 | simplld 780 | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
| 13 | 3 | simprrd 786 | . . 3 ⊢ (𝜑 → 𝐷 ∈ 𝑉) |
| 14 | s3cli 14956 | . . . . . 6 ⊢ 〈“𝐽𝐾𝐿”〉 ∈ Word V | |
| 15 | 2, 14 | eqeltri 2858 | . . . . 5 ⊢ 𝐹 ∈ Word V |
| 16 | s4cli 14957 | . . . . . 6 ⊢ 〈“𝐴𝐵𝐶𝐷”〉 ∈ Word V | |
| 17 | 1, 16 | eqeltri 2858 | . . . . 5 ⊢ 𝑃 ∈ Word V |
| 18 | 15, 17 | pm3.2i 476 | . . . 4 ⊢ (𝐹 ∈ Word V ∧ 𝑃 ∈ Word V) |
| 19 | 18 | a1i 11 | . . 3 ⊢ (𝜑 → (𝐹 ∈ Word V ∧ 𝑃 ∈ Word V)) |
| 20 | 6 | isspthson 30216 | . . 3 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉) ∧ (𝐹 ∈ Word V ∧ 𝑃 ∈ Word V)) → (𝐹(𝐴(SPathsOn‘𝐺)𝐷)𝑃 ↔ (𝐹(𝐴(TrailsOn‘𝐺)𝐷)𝑃 ∧ 𝐹(SPaths‘𝐺)𝑃))) |
| 21 | 12, 13, 19, 20 | syl21anc 851 | . 2 ⊢ (𝜑 → (𝐹(𝐴(SPathsOn‘𝐺)𝐷)𝑃 ↔ (𝐹(𝐴(TrailsOn‘𝐺)𝐷)𝑃 ∧ 𝐹(SPaths‘𝐺)𝑃))) |
| 22 | 9, 11, 21 | mpbir2and 726 | 1 ⊢ (𝜑 → 𝐹(𝐴(SPathsOn‘𝐺)𝐷)𝑃) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ≠ wne 2957 Vcvv 3453 ⊆ wss 3902 {cpr 4589 class class class wbr 5107 ‘cfv 6537 (class class class)co 7417 Word cword 14582 〈“cs3 14917 〈“cs4 14918 Vtxcvtx 29461 iEdgciedg 29462 TrailsOnctrlson 30161 SPathscspths 30183 SPathsOncspthson 30185 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 ax-cnex 11184 ax-resscn 11185 ax-1cn 11186 ax-icn 11187 ax-addcl 11188 ax-addrcl 11189 ax-mulcl 11190 ax-mulrcl 11191 ax-mulcom 11192 ax-addass 11193 ax-mulass 11194 ax-distr 11195 ax-i2m1 11196 ax-1ne0 11197 ax-1rid 11198 ax-rnegex 11199 ax-rrecex 11200 ax-cnre 11201 ax-pre-lttri 11202 ax-pre-lttrn 11203 ax-pre-ltadd 11204 ax-pre-mulgt0 11205 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4594 df-uni 4871 df-int 4911 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 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 7374 df-ov 7420 df-oprab 7421 df-mpo 7422 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-er 8700 df-map 8832 df-en 8957 df-dom 8958 df-sdom 8959 df-fin 8960 df-card 9948 df-pnf 11273 df-mnf 11274 df-xr 11275 df-ltxr 11276 df-le 11277 df-sub 11471 df-neg 11472 df-nn 12262 df-2 12331 df-3 12332 df-4 12333 df-n0 12533 df-z 12620 df-uz 12892 df-fz 13566 df-fzo 13714 df-hash 14399 df-word 14583 df-lsw 14632 df-concat 14640 df-s1 14667 df-s2 14923 df-s3 14924 df-s4 14925 df-wlks 30067 df-wlkson 30068 df-trls 30162 df-trlson 30163 df-spths 30187 df-spthson 30189 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |