At:
topsort-exists
For any graph
the_obj:GraphObject(the_graph). L:V List. (non-trivial-loop-free(the_graph) topsorted(the_graph;L)) & (i:V. (i L)) & no_repeats(V;L)
By:
Auto
THEN
InstConcl [topsort(the_obj)]
THEN
Inst
Thm* For any graph
the_obj:GraphObject(the_graph). (non-trivial-loop-free(the_graph) topsorted(the_graph;topsort(the_obj))) & (i:V. (i topsort(the_obj))) & no_repeats(V;topsort(the_obj))
[the_graph;the_obj]
Generated subgoals: