| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 2trlond | Structured version Visualization version GIF version | ||
| Description: A trail of length 2 from one vertex to another, different vertex via a third vertex. (Contributed by Alexander van der Vekens, 6-Dec-2017.) (Revised by AV, 30-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 |
|---|---|
| 2trlond | ⊢ (𝜑 → 𝐹(𝐴(TrailsOn‘𝐺)𝐶)𝑃) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2wlkd.p | . . 3 ⊢ 𝑃 = 〈“𝐴𝐵𝐶”〉 | |
| 2 | 2wlkd.f | . . 3 ⊢ 𝐹 = 〈“𝐽𝐾”〉 | |
| 3 | 2wlkd.s | . . 3 ⊢ (𝜑 → (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) | |
| 4 | 2wlkd.n | . . 3 ⊢ (𝜑 → (𝐴 ≠ 𝐵 ∧ 𝐵 ≠ 𝐶)) | |
| 5 | 2wlkd.e | . . 3 ⊢ (𝜑 → ({𝐴, 𝐵} ⊆ (𝐼‘𝐽) ∧ {𝐵, 𝐶} ⊆ (𝐼‘𝐾))) | |
| 6 | 2wlkd.v | . . 3 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 7 | 2wlkd.i | . . 3 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 8 | 1, 2, 3, 4, 5, 6, 7 | 2wlkond 30556 | . 2 ⊢ (𝜑 → 𝐹(𝐴(WalksOn‘𝐺)𝐶)𝑃) |
| 9 | 2trld.n | . . 3 ⊢ (𝜑 → 𝐽 ≠ 𝐾) | |
| 10 | 1, 2, 3, 4, 5, 6, 7, 9 | 2trld 30557 | . 2 ⊢ (𝜑 → 𝐹(Trails‘𝐺)𝑃) |
| 11 | 3 | simp1d 1160 | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
| 12 | 3 | simp3d 1162 | . . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑉) |
| 13 | s2cli 15059 | . . . . 5 ⊢ 〈“𝐽𝐾”〉 ∈ Word V | |
| 14 | 2, 13 | eqeltri 2860 | . . . 4 ⊢ 𝐹 ∈ Word V |
| 15 | 14 | a1i 11 | . . 3 ⊢ (𝜑 → 𝐹 ∈ Word V) |
| 16 | s3cli 15060 | . . . . 5 ⊢ 〈“𝐴𝐵𝐶”〉 ∈ Word V | |
| 17 | 1, 16 | eqeltri 2860 | . . . 4 ⊢ 𝑃 ∈ Word V |
| 18 | 17 | a1i 11 | . . 3 ⊢ (𝜑 → 𝑃 ∈ Word V) |
| 19 | 6 | istrlson 30319 | . . 3 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) ∧ (𝐹 ∈ Word V ∧ 𝑃 ∈ Word V)) → (𝐹(𝐴(TrailsOn‘𝐺)𝐶)𝑃 ↔ (𝐹(𝐴(WalksOn‘𝐺)𝐶)𝑃 ∧ 𝐹(Trails‘𝐺)𝑃))) |
| 20 | 11, 12, 15, 18, 19 | syl22anc 852 | . 2 ⊢ (𝜑 → (𝐹(𝐴(TrailsOn‘𝐺)𝐶)𝑃 ↔ (𝐹(𝐴(WalksOn‘𝐺)𝐶)𝑃 ∧ 𝐹(Trails‘𝐺)𝑃))) |
| 21 | 8, 10, 20 | mpbir2and 726 | 1 ⊢ (𝜑 → 𝐹(𝐴(TrailsOn‘𝐺)𝐶)𝑃) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 Vcvv 3454 ⊆ wss 3900 {cpr 4590 class class class wbr 5106 ‘cfv 6558 (class class class)co 7443 Word cword 14685 〈“cs2 15020 〈“cs3 15021 Vtxcvtx 29604 iEdgciedg 29605 WalksOncwlkson 30208 Trailsctrls 30303 TrailsOnctrlson 30304 |
| 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 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 ax-cnex 11283 ax-resscn 11284 ax-1cn 11285 ax-icn 11286 ax-addcl 11287 ax-addrcl 11288 ax-mulcl 11289 ax-mulrcl 11290 ax-mulcom 11291 ax-addass 11292 ax-mulass 11293 ax-distr 11294 ax-i2m1 11295 ax-1ne0 11296 ax-1rid 11297 ax-rnegex 11298 ax-rrecex 11299 ax-cnre 11300 ax-pre-lttri 11301 ax-pre-lttrn 11302 ax-pre-ltadd 11303 ax-pre-mulgt0 11304 |
| 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 4839 df-uni 4871 df-int 4911 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6322 df-ord 6383 df-on 6384 df-lim 6385 df-suc 6386 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-riota 7400 df-ov 7446 df-oprab 7447 df-mpo 7448 df-om 7902 df-1st 8025 df-2nd 8026 df-frecs 8327 df-wrecs 8358 df-recs 8407 df-rdg 8446 df-1o 8504 df-er 8745 df-map 8877 df-en 9002 df-dom 9003 df-sdom 9004 df-fin 9005 df-card 10047 df-pnf 11372 df-mnf 11373 df-xr 11374 df-ltxr 11375 df-le 11376 df-sub 11570 df-neg 11571 df-nn 12363 df-2 12432 df-3 12433 df-n0 12634 df-z 12721 df-uz 12993 df-fz 13667 df-fzo 13816 df-hash 14502 df-word 14686 df-concat 14743 df-s1 14770 df-s2 15027 df-s3 15028 df-wlks 30210 df-wlkson 30211 df-trls 30305 df-trlson 30306 |
| This theorem is used by: 2pthond 30561 |
| Copyright terms: Public domain | W3C validator |