Nuprl - Proof: bi-graph-from wf 1 1 1 1

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: bi-graph-from wf 1 1 1 1

1. G : Id

2. to : |G|

(IdLnk List)
3. from : |G|

(IdLnk List)
4. bi-graph(G;to;from)
5. x : |G|
6. v : IdLnk List
7. from(x) = v

Edge(G) List

By:	Assert (lv.(l from(x)))

Generated subgoals:

1   (lv.(l  from(x)))
1 step

2 8. (lv.(l  from(x)))
  v  Edge(G) List
5 steps

About:

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html

1	(lv.(l from(x)))	1 step
2	8. (lv.(l from(x))) v Edge(G) List	5 steps