DiscreteMath
Sections
DiscrMathExt
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Rank
Theorem
Name
2
Thm*
e
:(
B
B
).
Thm*
IsEqFun(
B
;
e
)
(
a
:
,
f
:(
a
onto
B
),
y
:
B
.
f
(least
x
:
. (
f
(
x
))
e
y
) =
y
)
[nsub_surj_least_preimage_works_gen]
cites the following:
1
Thm*
k
:
,
p
:{
p
:(
k
)|
i
:
k
.
p
(
i
) }.
p
(least
i
:
.
p
(
i
))
[least_satisfies]
1
Thm*
k
:
,
p
:{
p
:(
k
)|
i
:
k
.
p
(
i
) }. (least
i
:
.
p
(
i
))
k
[least_wf]
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
DiscreteMath
Sections
DiscrMathExt
Doc