Definitions
hol
num
Sections
HOLlib
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Some definitions of interest.
decidable
Def
Dec(
P
) ==
P
P
Thm*
A
:Prop. Dec(
A
)
Prop
nat
Def
== {
i
:
| 0
i
}
Thm*
Type
Thm*
S
not
Def
A
==
A
False
Thm*
A
:Prop. (
A
)
Prop
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Definitions
hol
num
Sections
HOLlib
Doc
P
A:Prop. Dec(A) 
Prop
== {i:
| 0
i } Type SA == A 
FalseA:Prop. (A) Prop PA:Prop. Dec(A) Prop == {i:| 0i } Type SA == A FalseA:Prop. (A) Prop
