Nuprl - graph_1_3 LEMMAs for topsort_DASH

Rank	Theorem	Name
20	Thm* 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)	[topsort-exists]
cites
19	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))	[topsort-properties]