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

At: no repeats upto 2 1
1. d,i,j:. j-i = d no_repeats(;upto(i;j))
2. i:
3. j:
4. ij
no_repeats(;upto(i;j))
By: InstHyp [j-i;i;j] 1
Generated subgoals:

None

About:
intsubtractequalimpliesall

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