13 | Thm* For any graph
the_obj:GraphObject(the_graph), P:((V List) Traversal Prop). P(nil,nil)  ( L:V List, s:Traversal, i:V. paren(V;s)  no_repeats(V+V;s)  P(L,s)  P(L @ [i],dfs(the_obj;s;i)))  ( L:V List. paren(V;dfsl(the_obj;L)) & no_repeats(V+V;dfsl(the_obj;L)) & P(L,dfsl(the_obj;L))) | [dfsl-induction2] |