Description: In a graph with two vertices and an edge connecting these two vertices, to go from one vertex to the other vertex via this edge is a walk. The two vertices need not be distinct (in the case of a loop). (Contributed by AV, 22-Jan-2021) (Revised by AV, 23-Mar-2021)
Ref | Expression | ||
---|---|---|---|
Hypotheses | 1wlkd.p | |
|
1wlkd.f | |
||
1wlkd.x | |
||
1wlkd.y | |
||
1wlkd.l | |
||
1wlkd.j | |
||
1wlkd.v | |
||
1wlkd.i | |
||
Assertion | 1wlkd | |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 1wlkd.p | |
|
2 | 1wlkd.f | |
|
3 | 1wlkd.x | |
|
4 | 1wlkd.y | |
|
5 | 1wlkd.l | |
|
6 | 1wlkd.j | |
|
7 | 1wlkd.v | |
|
8 | 1wlkd.i | |
|
9 | 1 2 3 4 5 6 | 1wlkdlem3 | |
10 | 1 2 3 4 | 1wlkdlem1 | |
11 | 1 2 3 4 5 6 | 1wlkdlem4 | |
12 | 7 | 1vgrex | |
13 | 7 8 | iswlkg | |
14 | 3 12 13 | 3syl | |
15 | 9 10 11 14 | mpbir3and | |