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

At: dfl-traversal-consl 3 2

1. the_graph: Graph
2. L: Vertices(the_graph) List
3. i: Vertices(the_graph)
4. s: traversal(the_graph)
5. (inr(i) s)
6. dfl-traversal(the_graph;L;s)
7. i@0: Vertices(the_graph)
8. u: Vertices(the_graph)+Vertices(the_graph)
9. v: (Vertices(the_graph)+Vertices(the_graph)) List
10. s2: traversal(the_graph)
11. j:Vertices(the_graph). i@0-the_graph- > *j non-trivial-loop(the_graph;j)
12. inl(i) = u
13. s = (v @ [inl(i@0) / s2]) traversal(the_graph)
L-the_graph- > *i@0

By: AllHyps (h.(Analyze h) THEN (InstHyp [i@0;v;s2] h+1) THEN (Reduce 0))

Generated subgoals:

None

About:
listconsunioninlinrequalimpliesall

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