reserve G for _Graph;
reserve V for non empty set, E for Relation of V;

theorem Th79:
  for v being Vertex of createGraph(V,E) holds {v}|`E = v.edgesIn()
proof
  let v be Vertex of createGraph(V,E);
  thus {v}|`E = createGraph(V,E).edgesInto({v}) by Th75
    .= v.edgesIn() by GLIB_000:def 38;
end;
