Nuprl - Proof: edge-from 2 1 2 1 1

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: edge-from 2 1 2 1 1

1. G : Id

2. to : |G|

(IdLnk List)
3. from : |G|

(IdLnk List)
4. e : IdLnk
5. i : |G|
6. (e

from(i))
7. bi-graph(G;to;from)
8. e

Edge(G)
9.

i:|G|.
9. (

to(i).destination(l) = i
9. & G(source(l))
9. & (l

from(source(l)))
9. & (lnk-inv(l)

from(i)))
9. & (

from(i).source(l) = i
9. & & G(destination(l))
9. & & (l

to(destination(l)))
9. & & (lnk-inv(l)

to(i)))
10. (

to(i).destination(l) = i
10. & G(source(l))
10. & (l

from(source(l)))
10. & (lnk-inv(l)

from(i)))
11.

l:IdLnk.
11. (l

from(i))
11.

11. source(l) = i
11. & G(destination(l))
11. & (l

to(destination(l)))
11. & (lnk-inv(l)

to(i))
12. source(e) = i
13. G(destination(e))
14. (e

to(destination(e)))
15. (lnk-inv(e)

to(i))

from(source(e)))

By:	HypSubst' -4 0 THEN DupHyp 6

Generated subgoal:

1 16. (e from(i))
(e from(i))
1 step

About:

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