(10steps total)
PrintForm
Definitions
Lemmas
DiscreteMath
Sections
DiscrMathExt
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At:
nonfin
eqv
unb
inf
iff
negnegelim
1
(
A
:Type.
Finite(
A
)
Unbounded(
A
))
(
P
:Prop.
P
P
)
By:
SimilarTo
Thm*
(
A
:Type.
Finite(
A
)
Unbounded(
A
))
(
D
:Type.
(
D
)
(
D
))
Generated subgoals:
1
1.
A
:Type.
Finite(
A
)
Unbounded(
A
)
A
:Type.
Finite(
A
)
Unbounded(
A
)
1
step
2
1.
A
:Type.
Finite(
A
)
Unbounded(
A
)
2.
D
:Type.
(
D
)
(
D
)
P
:Prop.
P
P
3
steps
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
(10steps total)
PrintForm
Definitions
Lemmas
DiscreteMath
Sections
DiscrMathExt
Doc