let G be _Graph; :: thesis: for v, w being Vertex of G
for e being object
for H being addEdge of G,v,e,w st v,w are_adjacent holds
VertexAdjSymRel H = VertexAdjSymRel G

let v, w be Vertex of G; :: thesis: for e being object
for H being addEdge of G,v,e,w st v,w are_adjacent holds
VertexAdjSymRel H = VertexAdjSymRel G

let e be object ; :: thesis: for H being addEdge of G,v,e,w st v,w are_adjacent holds
VertexAdjSymRel H = VertexAdjSymRel G

let H be addEdge of G,v,e,w; :: thesis: ( v,w are_adjacent implies VertexAdjSymRel H = VertexAdjSymRel G )
assume v,w are_adjacent ; :: thesis: VertexAdjSymRel H = VertexAdjSymRel G
then consider e0 being object such that
A1: e0 Joins v,w,G by CHORD:def 3;
per cases ( not e in the_Edges_of G or e in the_Edges_of G ) ;
suppose A2: not e in the_Edges_of G ; :: thesis: VertexAdjSymRel H = VertexAdjSymRel G
end;
suppose e in the_Edges_of G ; :: thesis: VertexAdjSymRel H = VertexAdjSymRel G
end;
end;