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

At: no repeats upto 2 2 1
1. d,i,j:. j-i = d no_repeats(;upto(i;j))
2. i:
3. j:
4. ij
5. ji
no_repeats(;nil)
By: ObviousConcl
Generated subgoals:

None

About:
nilintsubtractequalimpliesall

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