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) to(i))  source(e) = i) | [edge-inv-to] |
cites the following: |
1 | Thm* G:(Id  ), to,from:(|G| (IdLnk List)), e:Edge(G), i:|G|.
Thm* bi-graph(G;to;from)  ((e to(i))  destination(e) = i) | [edge-to] |
0 | Thm* l:IdLnk. destination(lnk-inv(l)) = source(l) | [ldst-inv] |