(4steps total)
PrintForm
Definitions
Lemmas
DiscreteMath
Sections
DiscrMathExt
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At:
set
functionality
wrt
one
one
corr
n
pred2
1
1.
A
: Type
2.
B
:
A
Prop
3.
B'
:
A
Prop
4.
x
:
A
.
B
(
x
)
B'
(
x
)
{
x
:
A
|
B
(
x
) } ~ {
x
:
A
|
B'
(
x
) }
By:
Use:[
f
:= Id]
BackThru:
Thm*
Bij(
A
;
A'
;
f
)
Thm*
Thm*
(
x
:
A
.
B
(
x
)
B'
(
f
(
x
)))
({
x
:
A
|
B
(
x
) } ~ {
x
:
A'
|
B'
(
x
) })
Generated subgoals:
1
Bij(
A
;
A
; Id)
1
step
2
x
:
A
.
B
(
x
)
B'
(Id(
x
))
1
step
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
(4steps total)
PrintForm
Definitions
Lemmas
DiscreteMath
Sections
DiscrMathExt
Doc