(18steps total)
PrintForm
Definitions
Lemmas
graph
1
1
Sections
Graphs
Doc
At:
member
upto
1
d,i,j:
. j-i = d
(
k:
. (k
upto(i;j))
i
k & k < j)
By:
InductionOnNat
Generated subgoals:
1
i,j:
. j-i = 0
(
k:
. (k
upto(i;j))
i
k & k < j)
2
steps
 
2
1.
d:
2.
0 < d
3.
i,j:
. j-i = d-1
(
k:
. (k
upto(i;j))
i
k & k < j)
i,j:
. j-i = d
(
k:
. (k
upto(i;j))
i
k & k < j)
9
steps
About:
(18steps total)
PrintForm
Definitions
Lemmas
graph
1
1
Sections
Graphs
Doc