| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > trliswlk | Structured version Visualization version GIF version | ||
| Description: A trail is a walk. (Contributed by Alexander van der Vekens, 20-Oct-2017.) (Revised by AV, 7-Jan-2021.) (Proof shortened by AV, 29-Oct-2021.) |
| Ref | Expression |
|---|---|
| trliswlk | ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹(Walks‘𝐺)𝑃) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | istrl 29949 | . 2 ⊢ (𝐹(Trails‘𝐺)𝑃 ↔ (𝐹(Walks‘𝐺)𝑃 ∧ Fun ◡𝐹)) | |
| 2 | 1 | simplbi 501 | 1 ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹(Walks‘𝐺)𝑃) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 class class class wbr 5104 ◡ccnv 5650 Fun wfun 6519 ‘cfv 6525 Walkscwlks 29851 Trailsctrls 29943 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5250 ax-nul 5260 ax-pr 5394 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3080 df-rex 3090 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-nul 4289 df-if 4484 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-br 5105 df-opab 5167 df-mpt 5186 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6481 df-fun 6527 df-fv 6533 df-wlks 29854 df-trls 29945 |
| This theorem is referenced by: trlreslem 29952 trlres 29953 trlontrl 29963 pthiswlk 29979 pthdivtx 29981 dfpth2 29983 pthdifv 29984 spthdifv 29987 spthdep 29988 pthdepisspth 29989 usgr2trlspth 30015 crctisclwlk 30048 crctiswlk 30050 crctcshlem3 30073 crctcshwlk 30076 eupthiswlk 30468 eupthres 30471 trlsegvdeglem1 30476 eucrctshift 30499 upgrimtrlslem1 48525 upgrimtrlslem2 48526 upgrimtrls 48527 |
| Copyright terms: Public domain | W3C validator |