(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)) ik & k < j)
i,j,k:. (k upto(i;j)) ik & k < j

By:
UnivCD
THEN
Decide (ij)


Generated subgoals:

12. i:
3. j:
4. k:
5. ij
(k upto(i;j)) ik & k < j
1 step
 
22. i:
3. j:
4. k:
5. ij
(k upto(i;j)) ik & k < j
3 steps

About:
intsubtractless_thanequalimpliesandall

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