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

At: dfl-traversal-consl 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. j: Vertices(the_graph)
8. (inr(j) [inl(i) / s])
L-the_graph- > *j

By:
RWO Thm* l:T List, a,x:T. (x [a / l]) x = a (x l) -1
THEN
Analyze -1


Generated subgoals:

18. inr(j) = inl(i) Vertices(the_graph)+Vertices(the_graph)
L-the_graph- > *j
1 step
 
28. (inr(j) s)
L-the_graph- > *j
1 step

About:
listconsunioninlinruniverseequalorall

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