(11steps total)
PrintForm
Definitions
Lemmas
graph
1
1
Sections
Graphs
Doc
At:
no
repeats
upto
i,j:
. no_repeats(
;upto(i;j))
By:
Assert (
d,i,j:
. j-i = d
no_repeats(
;upto(i;j)))
Generated subgoals:
1
d,i,j:
. j-i = d
no_repeats(
;upto(i;j))
6
steps
 
2
1.
d,i,j:
. j-i = d
no_repeats(
;upto(i;j))
i,j:
. no_repeats(
;upto(i;j))
4
steps
About:
(11steps total)
PrintForm
Definitions
Lemmas
graph
1
1
Sections
Graphs
Doc