(9steps total) PrintForm Definitions Lemmas graph 1 2 Sections Graphs Doc

At: path-tl

For any graph p:V List. 1 < ||p|| path(the_graph;p) path(the_graph;tl(p))

By: Auto

Generated subgoal:

11. the_graph: Graph
2. p: Vertices(the_graph) List
3. 1 < ||p||
4. path(the_graph;p)
path(the_graph;tl(p))
8 steps

About:
listnatural_numberless_thanimpliesall

(9steps total) PrintForm Definitions Lemmas graph 1 2 Sections Graphs Doc