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

At: member upto 2 1
1. d,i,j:. j-i = d (k:. (k upto(i;j)) ik & k < j)
2. i:
3. j:
4. k:
5. ij
(k upto(i;j)) ik & k < j
By:
InstHyp [j-i;i;j;k] 1
THEN
Trivial
Generated subgoals:

None

About:
intsubtractless_thanequalimpliesandall

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