Rank | Theorem | Name |
2 | Thm* G:(Id  ), to,from:(|G| (IdLnk List)), l:Edge(G).
Thm* bi-graph(G;to;from)  inverse(l) Edge(G) | [bi-graph-inv_wf] |
cites the following: |
1 | Thm* G:(Id  ), to,from:(|G| (IdLnk List)), l:Edge(G).
Thm* bi-graph(G;to;from)  lnk-inv(l) Edge(G) | [inv-is-edge] |