1. G : Id
2. to : |G|(IdLnk List)
3. from : |G|(IdLnk List)
4. i : |G|
5. bi-graph(G;to;from)
  to(i)  Edge(G) List

By:	Assert (to  |G|(Edge(G) List))

1	to  |G|(Edge(G) List)	9 steps
2	6. to  |G|(Edge(G) List)   to(i)  Edge(G) List	Auto

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