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

At: dfs member 2
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. s3: traversal(the_graph)
8. i1: Vertices(the_graph)
9. j: Vertices(the_graph)
10. i1-the_graph- > j
11. paren(Vertices(the_graph);s2)
12. paren(Vertices(the_graph);s3)
13. (inl(j) s2) (inl(j) s1) (inr(j) s1)
14. (inl(i1) s3) (inl(i1) s2 @ s1) (inr(i1) s2 @ s1)
(inl(i1) s3 @ s2) (inl(i1) s1) (inr(i1) s1)
By: All (RWO Thm* x:T, l1,l2:T List. (x l1 @ l2) (x l1) (x l2))
Generated subgoal:

114. (inl(i1) s3) (inl(i1) s2) (inl(i1) s1) (inr(i1) s2) (inr(i1) s1)
(inl(i1) s3) (inl(i1) s2) (inl(i1) s1) (inr(i1) s1)		2 steps

About:
listunioninlinruniverseorall

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