Nuprl - Proof: dfs-connect 2

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

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. j@0:Vertices(the_graph). (inr(j@0) s2) j-the_graph- > *j@0
14. j:Vertices(the_graph). (inr(j) s3) i1-the_graph- > *j
15. j1: Vertices(the_graph)
16. (inr(j1) s3 @ s2)

i1-the_graph- > *j1

By: RWO Thm* x:T, l1,l2:T List. (x l1 @ l2) (x l1) (x l2) -1 THEN Analyze -1 THEN EasyHyp

Generated subgoal:

1 16. (inr(j1) s2)
i1-the_graph- > *j1 1 step

About:

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