IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At:
bi-tree-diameter111111 1. T : Id 2. to : |T|(IdLnk List)
3. from : |T|(IdLnk List)
4. bi-graph(T;to;from)
5. i,j:|T|.
5. p:Edge(T) List.
5. lconnects(p;i;j) & (q:Edge(T) List. lconnects(q;i;j) q = p)
6. L : |T| List
7. i:|T|. (iL)
8. |T|
9. p : Edge(T) List
10. lpath(p)
11. ||p||||L||
12. i:|T|i@0:i@0<||L|| & i = L[i@0]
13. (n:||p||, m:n. source(p[m]) = source(p[n]))
h:(||p|||T|). Inj(||p||; |T|; h)