DiscreteMath
Sections
DiscrMathExt
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Rank
Theorem
Name
3
Thm*
k
:
,
P
:{
P
:(
k
Prop)|
i
:
k
.
P
(
i
) }.
Thm*
(
i
:
k
. Dec(
P
(
i
)))
(
{
i
:
k
|
P
(
i
) & (
j
:
i
.
P
(
j
)) })
[least_exists]
cites the following:
2
Thm*
(
x
:
T
. Dec(
E
(
x
)))
(
f
:(
T
).
x
:
T
.
f
(
x
)
E
(
x
))
[dec_pred_iff_some_boolfun]
0
Thm*
k
:
,
p
:{
p
:(
k
)|
i
:
k
.
p
(
i
) }.
Thm*
(least
i
:
.
p
(
i
))
{
i
:
k
|
p
(
i
) & (
j
:
i
.
p
(
j
)) }
[least_characterized]
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
DiscreteMath
Sections
DiscrMathExt
Doc