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

At: no repeats upto 2

1. d,i,j:. j-i = d no_repeats(;upto(i;j))
i,j:. no_repeats(;upto(i;j))

By:
RepeatFor 2 (Analyze 0)
THEN
Decide (ij)


Generated subgoals:

12. i:
3. j:
4. ij
no_repeats(;upto(i;j))
1 step
 
22. i:
3. j:
4. ij
no_repeats(;upto(i;j))
2 steps

About:
intsubtractequalimpliesall

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