| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > eupthiswlk | Structured version Visualization version GIF version | ||
| Description: An Eulerian path is a walk. (Contributed by AV, 6-Apr-2021.) |
| Ref | Expression |
|---|---|
| eupthiswlk | ⊢ (𝐹(EulerPaths‘𝐺)𝑃 → 𝐹(Walks‘𝐺)𝑃) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eupthistrl 30869 | . 2 ⊢ (𝐹(EulerPaths‘𝐺)𝑃 → 𝐹(Trails‘𝐺)𝑃) | |
| 2 | trliswlk 30337 | . 2 ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹(Walks‘𝐺)𝑃) | |
| 3 | 1, 2 | syl 18 | 1 ⊢ (𝐹(EulerPaths‘𝐺)𝑃 → 𝐹(Walks‘𝐺)𝑃) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 class class class wbr 5108 ‘cfv 6566 Walkscwlks 30234 Trailsctrls 30330 EulerPathsceupth 30855 |
| 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-sep 5255 ax-nul 5266 ax-pr 5398 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 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-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-fo 6572 df-fv 6574 df-ov 7454 df-wlks 30237 df-trls 30332 df-eupth 30856 |
| This theorem is used by: eupthpf 30871 eupthp1 30874 eupth2eucrct 30875 eupth2lem3 30894 eupth2lems 30896 eupth2 30897 eucrct2eupth1 30902 |
| Copyright terms: Public domain | W3C validator |