Rank | Theorem | Name |
3 | Thm* For any graph
( x,y:V. Dec(x = y))  ( x,y:V. x-the_graph- > *y  x = y ( z:V. z = x & x-the_graph- > z & z-the_graph- > *y)) | [connect-iff] |
cites |
2 | Thm* For any graph
p:V List. 1 < ||p||  path(the_graph;p)  path(the_graph;tl(p)) | [path-tl] |
0 | Thm* l:A List. ||l|| 1  ||tl(l)|| = ||l||-1  | [length_tl] |
1 | Thm* as:A List, n: (||as||-1). tl(as)[n] = as[(n+1)] | [select_tl] |
1 | Thm* L:T List, x:T. null(L)  last([x / L]) = last(L) | [last_cons] |