Description: If there is at least one walk in the graph, all walks are in the universal class of ordered pairs. (Contributed by AV, 2-Jan-2021)
Ref | Expression | ||
---|---|---|---|
Assertion | wlkvv |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | wlkn0 | ||
2 | 2ndnpr | ||
3 | 2 | necon1ai | |
4 | 1 3 | syl |