(3steps total)
PrintForm
Definitions
Lemmas
NuprlPrimitives
Sections
NuprlLIB
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At:
sfa
doc
bool
vs
decidable
fun
1
1.
A
: Type
2.
P
:
A
Prop
3.
x
:
A
. Dec(
P
(
x
))
f
:(
A
).
x
:
A
.
P
(
x
)
f
(
x
)
By:
Inst:
Thm*
Q
:(
A
B
Prop). (
x
:
A
.
y
:
B
.
Q
(
x
,
y
))
(
f
:(
A
B
).
x
:
A
.
Q
(
x
,
f
(
x
)))
Using:[
B
:=
|
Q
(
x
,
b
):=
P
(
x
)
b
]
Generated subgoal:
1
4.
x
:
A
y
:
.
P
(
x
)
y
1
step
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
(3steps total)
PrintForm
Definitions
Lemmas
NuprlPrimitives
Sections
NuprlLIB
Doc