Nuprl - Proof: topsortl-properties 2

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

1. the_graph: Graph
2. the_obj: GraphObject(the_graph)
3. L: Vertices(the_graph) List
4. i:Vertices(the_graph). (i L)
5. paren(Vertices(the_graph);dfsl(the_obj;L))
6. no_repeats(Vertices(the_graph)+Vertices(the_graph);dfsl(the_obj;L))
7. dfsl-traversal(the_graph;L;dfsl(the_obj;L))
8. i:Vertices(the_graph). (i L) (inr(i) dfsl(the_obj;L)) & (inl(i) dfsl(the_obj;L))

(i:Vertices(the_graph). (i topsortl(the_obj;L))) & no_repeats(Vertices(the_graph);topsortl(the_obj;L))

By: Auto

Generated subgoals:

1 9. i: Vertices(the_graph)
(i topsortl(the_obj;L)) 1 step

2 no_repeats(Vertices(the_graph);topsortl(the_obj;L)) 1 step

About:

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

1	9. `i:` `Vertices(the_graph)` `(i topsortl(the_obj;L))`	1 step

2	`no_repeats(Vertices(the_graph);topsortl(the_obj;L))`	1 step