Rank | Theorem | Name |
2 | Thm* G:(Id  ), to,from:(|G| (IdLnk List)), e:Edge(G), i:|G|.
Thm* bi-graph(G;to;from)  ((inverse(e) from(i))  destination(e) = i) | [edge-inv-from] |
cites the following: |
1 | Thm* G:(Id  ), to,from:(|G| (IdLnk List)), e:Edge(G), i:|G|.
Thm* bi-graph(G;to;from)  ((e from(i))  source(e) = i) | [edge-from] |
0 | Thm* l:IdLnk. source(lnk-inv(l)) = destination(l) | [lsrc-inv] |