Description: The sequence of vertices of a walk cannot be empty, i.e. a walk always consists of at least one vertex. (Contributed by Alexander van der Vekens, 19-Jul-2018) (Revised by AV, 2-Jan-2021)
Ref | Expression | ||
---|---|---|---|
Assertion | wlkn0 | |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid | |
|
2 | 1 | wlkp | |
3 | fdm | |
|
4 | 3 | eqcomd | |
5 | 2 4 | syl | |
6 | wlkcl | |
|
7 | elnn0uz | |
|
8 | fzn0 | |
|
9 | 7 8 | sylbb2 | |
10 | 6 9 | syl | |
11 | 5 10 | eqnetrrd | |
12 | frel | |
|
13 | 2 12 | syl | |
14 | reldm0 | |
|
15 | 14 | necon3bid | |
16 | 13 15 | syl | |
17 | 11 16 | mpbird | |