(18steps total)
PrintForm
Definitions
Lemmas
graph
1
1
Sections
Graphs
Doc
At:
member
upto
2
1.
d,i,j:
. j-i = d
(
k:
. (k
upto(i;j))
i
k & k < j)
i,j,k:
. (k
upto(i;j))
i
k & k < j
By:
UnivCD
THEN
Decide (i
j)
Generated subgoals:
1
2.
i:
3.
j:
4.
k:
5.
i
j
(k
upto(i;j))
i
k & k < j
1
step
 
2
2.
i:
3.
j:
4.
k:
5.
i
j
(k
upto(i;j))
i
k & k < j
3
steps
About:
(18steps total)
PrintForm
Definitions
Lemmas
graph
1
1
Sections
Graphs
Doc