let G be _Graph; :: thesis: for v, e, w being object
for H being addEdge of G,v,e,w st ex e0 being object st e0 DJoins v,w,G holds
VertexDomRel H = VertexDomRel G

let v, e, w be object ; :: thesis: for H being addEdge of G,v,e,w st ex e0 being object st e0 DJoins v,w,G holds
VertexDomRel H = VertexDomRel G

let H be addEdge of G,v,e,w; :: thesis: ( ex e0 being object st e0 DJoins v,w,G implies VertexDomRel H = VertexDomRel G )
given e0 being object such that A1: e0 DJoins v,w,G ; :: thesis: VertexDomRel H = VertexDomRel G
per cases ( ( v in the_Vertices_of G & w in the_Vertices_of G & not e in the_Edges_of G ) or not v in the_Vertices_of G or not w in the_Vertices_of G or e in the_Edges_of G ) ;
suppose A2: ( v in the_Vertices_of G & w in the_Vertices_of G & not e in the_Edges_of G ) ; :: thesis: VertexDomRel H = VertexDomRel G
end;
suppose ( not v in the_Vertices_of G or not w in the_Vertices_of G or e in the_Edges_of G ) ; :: thesis: VertexDomRel H = VertexDomRel G
end;
end;