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

At: vertex-subset-properties 1 1 1

1. the_graph: Graph
2. the_obj: GraphObject(the_graph)
3. P: Vertices(the_graph)
4. x,y:Vertices(the_graph). the_obj.eq(x,y) x = y
5. T:Type, s:T, x:Vertices(the_graph), f:(TVertices(the_graph)T). L:Vertices(the_graph) List. (y:Vertices(the_graph). x-the_graph- > y (y L)) & the_obj.eacc(f,s,x) = list_accum(s',x'.f(s',x');s;L)
6. T:Type, s:T, f:(TVertices(the_graph)T). L:Vertices(the_graph) List. no_repeats(Vertices(the_graph);L) & (y:Vertices(the_graph). (y L)) & the_obj.vacc(f,s) = list_accum(s',x'.f(s',x');s;L)
7. L: Vertices(the_graph) List
8. no_repeats(Vertices(the_graph);L)
9. y:Vertices(the_graph). (y L)
no_repeats(Vertices(the_graph);filter(P;L))

By: BackThru Thm* P:(T), l:T List. no_repeats(T;l) no_repeats(T;filter(P;l))

Generated subgoals:

None

About:
listboolassertapplyfunctionuniverseequalimpliesandallexists

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