(3steps total)
PrintForm
Definitions
Lemmas
IteratedBinops
Sections
DiscrMathExt
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At:
factorial
tail
via
iter
zero
1
1.
m
:
2.
k
:
3.
k
<
m
(
i
:{
k
-
m
..
k
}.
i
+1) = 0
By:
(
i
:{
k
-
m
..
k
}.
i
+1) = 0 Asserted
THENA
BackThru:
Thm*
(
i
:{
a
..
b
}.
e
(
i
) = 0)
(
i
:{
a
..
b
}.
e
(
i
)) = 0
Generated subgoal:
1
i
:{(
k
-
m
)..
k
}.
i
+1 = 0
1
step
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
(3steps total)
PrintForm
Definitions
Lemmas
IteratedBinops
Sections
DiscrMathExt
Doc
(
i:{k-m..k
}. i+1) = 0 
( i:{k-m..k}. i+1) = 0 i:{k-m..k}. i+1) = 0 Asserted
i:{a..b}. e(i) = 0) 
( i:{a..b}. e(i)) = 0 i:{(k-m)..k}. i+1 = 0
