(35steps total)
PrintForm
Definitions
Lemmas
mb
event
system
7
Sections
EventSystems
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At:
spanner-root-exists
T
:(Id
),
to
,
from
:(|
T
|
(IdLnk List)),
f
:(Edge(
T
)
).
bi-tree(
T
;
to
;
from
)
spanner(
f
;
T
;
to
;
from
)
(
i
:|
T
|. spanner-root(
f
;
T
;
to
;
from
;
i
))
By:
Repeat (Analyze 0 THENA Complete Auto)
THEN
AssertBY bi-graph(
T
;
to
;
from
) (Analyze -1)
Generated subgoal:
1
1.
T
: Id
2.
to
: |
T
|
(IdLnk List)
3.
from
: |
T
|
(IdLnk List)
4.
f
: Edge(
T
)
5. bi-tree(
T
;
to
;
from
)
6. bi-graph(
T
;
to
;
from
)
7. spanner(
f
;
T
;
to
;
from
)
i
:|
T
|. spanner-root(
f
;
T
;
to
;
from
;
i
)
34
steps
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
(35steps total)
PrintForm
Definitions
Lemmas
mb
event
system
7
Sections
EventSystems
Doc