reserve G, G1, G2 for _Graph, H for Subgraph of G;

theorem Th16:
  for G being non edgeless _Graph, e being Edge of G, e0,v,w being object
  st e0 Joins v,w,createGraph(e) holds e0 = e
proof
  let G be non edgeless _Graph, e be Edge of G, e0,v,w be object;
  assume e0 Joins v,w,createGraph(e);
  then e0 DJoins v,w,createGraph(e) or e0 DJoins w,v,createGraph(e)
    by GLIB_000:16;
  hence thesis by Th15;
end;
