(8steps total)
PrintForm
Definitions
Lemmas
well
fnd
Sections
StandardLIB
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At:
wellfounded
functionality
wrt
iff
T1
,
T2
:Type,
r1
:(
T1
T1
Prop),
r2
:(
T2
T2
Prop).
T1
=
T2
(
x
,
y
:
T1
.
r1
(
x
,
y
)
r2
(
x
,
y
))
(WellFnd{i}(
T1
;
x
,
y
.
r1
(
x
,
y
))
WellFnd{i}(
T2
;
x
,
y
.
r2
(
x
,
y
)))
By:
UnivCD
Generated subgoal:
1
1.
T1
: Type
2.
T2
: Type
3.
r1
:
T1
T1
Prop
4.
r2
:
T2
T2
Prop
5.
T1
=
T2
6.
x
,
y
:
T1
.
r1
(
x
,
y
)
r2
(
x
,
y
)
WellFnd{i}(
T1
;
x
,
y
.
r1
(
x
,
y
))
WellFnd{i}(
T2
;
x
,
y
.
r2
(
x
,
y
))
7
steps
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
(8steps total)
PrintForm
Definitions
Lemmas
well
fnd
Sections
StandardLIB
Doc