(10steps total)
Remark
PrintForm
Definitions
Lemmas
DiscreteMath
Sections
DiscrMathExt
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At:
least
characterized2
1
1
1.
p
:
2.
i
:
3.
p
(
i
)
(least
i
:
.
p
(
i
))
{
i
:
|
p
(
i
) & (
j
:
.
j
<
i
p
(
j
)) }
By:
Inst:
Thm*
k
:
,
p
:{
p
:(
k
)|
i
:
k
.
p
(
i
) }.
Thm*
(least
i
:
.
p
(
i
))
{
i
:
k
|
p
(
i
) & (
j
:
i
.
p
(
j
)) }
on
[
i
+1 |
p
]
Generated subgoals:
1
p
{
p
:(
(
i
+1)
)|
i
:
(
i
+1).
p
(
i
) }
2
steps
2
4. (least
i
:
.
p
(
i
))
{
i
:
(
i
+1)|
p
(
i
) & (
j
:
i
.
p
(
j
)) }
(least
i
:
.
p
(
i
))
{
i
:
|
p
(
i
) & (
j
:
.
j
<
i
p
(
j
)) }
5
steps
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
(10steps total)
Remark
PrintForm
Definitions
Lemmas
DiscreteMath
Sections
DiscrMathExt
Doc