x
L2.L1-G- > *x)t:Graph. Vertices(t) Type
e:Type(e
vv)Top Type{i'}
l2 == 
l:T List. l2 = (l1 @ l)T:Type, l1,l2:T List. l1 l2 Prop| Some definitions of interest. | |
| list-list-connect | Def L1-G- > *L2 == (xL2.L1-G- > *x) |
| gr_v | Def Vertices(t) == 1of(t) |
| Thm* t:Graph. Vertices(t) Type | |
| graph | Def Graph == v:Typee:Type(evv)Top |
| Thm* Graph Type{i'} | |
| iseg | Def l1 l2 == l:T List. l2 = (l1 @ l) |
| Thm* T:Type, l1,l2:T List. l1 l2 Prop |
About:
 |  |  |  |  |  |
 |  |  |  |  |
 |