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

At: dfs-connect 4
1. the_graph: Graph
2. the_obj: GraphObject(the_graph)
3. s: traversal(the_graph)
4. i: Vertices(the_graph)
5. s':traversal(the_graph). (j:Vertices(the_graph). (inr(j) s') i-the_graph- > *j) & l_disjoint(Vertices(the_graph)+Vertices(the_graph);s';s) & no_repeats(Vertices(the_graph)+Vertices(the_graph);s') & paren(Vertices(the_graph);s') & dfs(the_obj;s;i) = (s' @ s)
s':traversal(the_graph). (j:Vertices(the_graph). (inr(j) s') i-the_graph- > *j) & dfs(the_obj;s;i) = (s' @ s)
By:
ParallelOp -1
THEN
EasyHyp
Generated subgoals:

None

About:
unioninrequalimpliesandallexists

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