(11steps total) PrintForm Definitions Lemmas graph 1 3 Sections Graphs Doc

At: dfs-connect 3 2 1

1. the_graph: Graph
2. the_obj: GraphObject(the_graph)
3. s: traversal(the_graph)
4. i: Vertices(the_graph)
5. s1: traversal(the_graph)
6. s2: traversal(the_graph)
7. i1: Vertices(the_graph)
8. (inl(i1) s1)
9. (inr(i1) s1)
10. j:Vertices(the_graph). (inr(j) s2) i1-the_graph- > *j
11. j: Vertices(the_graph)
12. inr(j) = inr(i1) Vertices(the_graph)+Vertices(the_graph)
i1-the_graph- > *j

By: Subst (j = i1) 0

Generated subgoals:

1 j = i11 step
 
2 i1-the_graph- > *i11 step

About:
unioninlinrequalimpliesall

(11steps total) PrintForm Definitions Lemmas graph 1 3 Sections Graphs Doc