![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > 3spthd | 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.) (Proof shortened by AV, 30-Oct-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 |
---|---|
3spthd | ⊢ (𝜑 → 𝐹(SPaths‘𝐺)𝑃) |
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 | 3trld 29290 | . 2 ⊢ (𝜑 → 𝐹(Trails‘𝐺)𝑃) |
10 | simpr 485 | . . 3 ⊢ ((𝜑 ∧ 𝐹(Trails‘𝐺)𝑃) → 𝐹(Trails‘𝐺)𝑃) | |
11 | 3spthd.n | . . . . . . . . 9 ⊢ (𝜑 → 𝐴 ≠ 𝐷) | |
12 | df-3an 1089 | . . . . . . . . . . 11 ⊢ ((𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐴 ≠ 𝐷) ↔ ((𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶) ∧ 𝐴 ≠ 𝐷)) | |
13 | 12 | simplbi2 501 | . . . . . . . . . 10 ⊢ ((𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶) → (𝐴 ≠ 𝐷 → (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐴 ≠ 𝐷))) |
14 | 13 | 3ad2ant1 1133 | . . . . . . . . 9 ⊢ (((𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶) ∧ (𝐵 ≠ 𝐶 ∧ 𝐵 ≠ 𝐷) ∧ 𝐶 ≠ 𝐷) → (𝐴 ≠ 𝐷 → (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐴 ≠ 𝐷))) |
15 | 11, 14 | mpan9 507 | . . . . . . . 8 ⊢ ((𝜑 ∧ ((𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶) ∧ (𝐵 ≠ 𝐶 ∧ 𝐵 ≠ 𝐷) ∧ 𝐶 ≠ 𝐷)) → (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐴 ≠ 𝐷)) |
16 | simpr2 1195 | . . . . . . . 8 ⊢ ((𝜑 ∧ ((𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶) ∧ (𝐵 ≠ 𝐶 ∧ 𝐵 ≠ 𝐷) ∧ 𝐶 ≠ 𝐷)) → (𝐵 ≠ 𝐶 ∧ 𝐵 ≠ 𝐷)) | |
17 | simpr3 1196 | . . . . . . . 8 ⊢ ((𝜑 ∧ ((𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶) ∧ (𝐵 ≠ 𝐶 ∧ 𝐵 ≠ 𝐷) ∧ 𝐶 ≠ 𝐷)) → 𝐶 ≠ 𝐷) | |
18 | 15, 16, 17 | 3jca 1128 | . . . . . . 7 ⊢ ((𝜑 ∧ ((𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶) ∧ (𝐵 ≠ 𝐶 ∧ 𝐵 ≠ 𝐷) ∧ 𝐶 ≠ 𝐷)) → ((𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐴 ≠ 𝐷) ∧ (𝐵 ≠ 𝐶 ∧ 𝐵 ≠ 𝐷) ∧ 𝐶 ≠ 𝐷)) |
19 | 4, 18 | mpdan 685 | . . . . . 6 ⊢ (𝜑 → ((𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐴 ≠ 𝐷) ∧ (𝐵 ≠ 𝐶 ∧ 𝐵 ≠ 𝐷) ∧ 𝐶 ≠ 𝐷)) |
20 | funcnvs4 14848 | . . . . . 6 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉)) ∧ ((𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐴 ≠ 𝐷) ∧ (𝐵 ≠ 𝐶 ∧ 𝐵 ≠ 𝐷) ∧ 𝐶 ≠ 𝐷)) → Fun ◡〈“𝐴𝐵𝐶𝐷”〉) | |
21 | 3, 19, 20 | syl2anc 584 | . . . . 5 ⊢ (𝜑 → Fun ◡〈“𝐴𝐵𝐶𝐷”〉) |
22 | 21 | adantr 481 | . . . 4 ⊢ ((𝜑 ∧ 𝐹(Trails‘𝐺)𝑃) → Fun ◡〈“𝐴𝐵𝐶𝐷”〉) |
23 | 1 | a1i 11 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐹(Trails‘𝐺)𝑃) → 𝑃 = 〈“𝐴𝐵𝐶𝐷”〉) |
24 | 23 | cnveqd 5867 | . . . . 5 ⊢ ((𝜑 ∧ 𝐹(Trails‘𝐺)𝑃) → ◡𝑃 = ◡〈“𝐴𝐵𝐶𝐷”〉) |
25 | 24 | funeqd 6559 | . . . 4 ⊢ ((𝜑 ∧ 𝐹(Trails‘𝐺)𝑃) → (Fun ◡𝑃 ↔ Fun ◡〈“𝐴𝐵𝐶𝐷”〉)) |
26 | 22, 25 | mpbird 256 | . . 3 ⊢ ((𝜑 ∧ 𝐹(Trails‘𝐺)𝑃) → Fun ◡𝑃) |
27 | isspth 28846 | . . 3 ⊢ (𝐹(SPaths‘𝐺)𝑃 ↔ (𝐹(Trails‘𝐺)𝑃 ∧ Fun ◡𝑃)) | |
28 | 10, 26, 27 | sylanbrc 583 | . 2 ⊢ ((𝜑 ∧ 𝐹(Trails‘𝐺)𝑃) → 𝐹(SPaths‘𝐺)𝑃) |
29 | 9, 28 | mpdan 685 | 1 ⊢ (𝜑 → 𝐹(SPaths‘𝐺)𝑃) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ≠ wne 2939 ⊆ wss 3944 {cpr 4624 class class class wbr 5141 ◡ccnv 5668 Fun wfun 6526 ‘cfv 6532 〈“cs3 14775 〈“cs4 14776 Vtxcvtx 28121 iEdgciedg 28122 Trailsctrls 28812 SPathscspths 28835 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2702 ax-rep 5278 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7708 ax-cnex 11148 ax-resscn 11149 ax-1cn 11150 ax-icn 11151 ax-addcl 11152 ax-addrcl 11153 ax-mulcl 11154 ax-mulrcl 11155 ax-mulcom 11156 ax-addass 11157 ax-mulass 11158 ax-distr 11159 ax-i2m1 11160 ax-1ne0 11161 ax-1rid 11162 ax-rnegex 11163 ax-rrecex 11164 ax-cnre 11165 ax-pre-lttri 11166 ax-pre-lttrn 11167 ax-pre-ltadd 11168 ax-pre-mulgt0 11169 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-ifp 1062 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-reu 3376 df-rab 3432 df-v 3475 df-sbc 3774 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3963 df-nul 4319 df-if 4523 df-pw 4598 df-sn 4623 df-pr 4625 df-tp 4627 df-op 4629 df-uni 4902 df-int 4944 df-iun 4992 df-br 5142 df-opab 5204 df-mpt 5225 df-tr 5259 df-id 5567 df-eprel 5573 df-po 5581 df-so 5582 df-fr 5624 df-we 5626 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-pred 6289 df-ord 6356 df-on 6357 df-lim 6358 df-suc 6359 df-iota 6484 df-fun 6534 df-fn 6535 df-f 6536 df-f1 6537 df-fo 6538 df-f1o 6539 df-fv 6540 df-riota 7349 df-ov 7396 df-oprab 7397 df-mpo 7398 df-om 7839 df-1st 7957 df-2nd 7958 df-frecs 8248 df-wrecs 8279 df-recs 8353 df-rdg 8392 df-1o 8448 df-er 8686 df-map 8805 df-en 8923 df-dom 8924 df-sdom 8925 df-fin 8926 df-card 9916 df-pnf 11232 df-mnf 11233 df-xr 11234 df-ltxr 11235 df-le 11236 df-sub 11428 df-neg 11429 df-nn 12195 df-2 12257 df-3 12258 df-4 12259 df-n0 12455 df-z 12541 df-uz 12805 df-fz 13467 df-fzo 13610 df-hash 14273 df-word 14447 df-concat 14503 df-s1 14528 df-s2 14781 df-s3 14782 df-s4 14783 df-wlks 28721 df-trls 28814 df-spths 28839 |
This theorem is referenced by: 3spthond 29295 |
Copyright terms: Public domain | W3C validator |