(28steps total) PrintForm Definitions Lemmas graph 1 2 Sections Graphs Doc

At: connect-iff 2

1. the_graph: Graph
2. x,y:Vertices(the_graph). Dec(x = y)
3. x: Vertices(the_graph)
4. y: Vertices(the_graph)
5. x = y (z:Vertices(the_graph). z = x & x-the_graph- > z & z-the_graph- > *y)
x-the_graph- > *y

By: SplitOrHyps

Generated subgoals:

15. x = y
x-the_graph- > *y
1 step
 
25. z:Vertices(the_graph). z = x & x-the_graph- > z & z-the_graph- > *y
x-the_graph- > *y
1 step

About:
decidableequalandorallexists

(28steps total) PrintForm Definitions Lemmas graph 1 2 Sections Graphs Doc