(14steps total)
PrintForm
Definitions
Lemmas
IteratedBinops
Sections
DiscrMathExt
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At:
iter
nat
prod
one
iff
factors
one
1
1
1
1.
a
:
k
:
,
b
:
,
e
:({
a
..
b
}
).
b
-
a
=
k
((
i
:{
a
..
b
}.
e
(
i
)) = 1
(And
i
:{
a
..
b
}.
e
(
i
) = 1))
By:
NatInd Concl THEN UnivCD
Generated subgoals:
1
2.
b
:
3.
e
: {
a
..
b
}
4.
b
-
a
= 0
(
i
:{
a
..
b
}.
e
(
i
)) = 1
(And
i
:{
a
..
b
}.
e
(
i
) = 1)
2
steps
2
2.
k
:
3. 0<
k
4.
b
:
,
e
:({
a
..
b
}
).
4.
b
-
a
=
k
-1
((
i
:{
a
..
b
}.
e
(
i
)) = 1
(And
i
:{
a
..
b
}.
e
(
i
) = 1))
5.
b
:
6.
e
: {
a
..
b
}
7.
b
-
a
=
k
(
i
:{
a
..
b
}.
e
(
i
)) = 1
(And
i
:{
a
..
b
}.
e
(
i
) = 1)
3
steps
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
(14steps total)
PrintForm
Definitions
Lemmas
IteratedBinops
Sections
DiscrMathExt
Doc