let G be _Graph; :: thesis: for V being non empty one-to-one ManySortedSet of the_Vertices_of G
for E being one-to-one ManySortedSet of the_Edges_of G
for e, v, w being object st e Joins v,w,G holds
E . e Joins V . v,V . w, replaceVerticesEdges (V,E)
let V be non empty one-to-one ManySortedSet of the_Vertices_of G; :: thesis: for E being one-to-one ManySortedSet of the_Edges_of G
for e, v, w being object st e Joins v,w,G holds
E . e Joins V . v,V . w, replaceVerticesEdges (V,E)
let E be one-to-one ManySortedSet of the_Edges_of G; :: thesis: for e, v, w being object st e Joins v,w,G holds
E . e Joins V . v,V . w, replaceVerticesEdges (V,E)
let e, v, w be object ; :: thesis: ( e Joins v,w,G implies E . e Joins V . v,V . w, replaceVerticesEdges (V,E) )
assume e Joins v,w,G ; :: thesis: E . e Joins V . v,V . w, replaceVerticesEdges (V,E)
per cases then ( e DJoins v,w,G or e DJoins w,v,G ) by GLIB_000:16;
suppose e DJoins v,w,G ; :: thesis: E . e Joins V . v,V . w, replaceVerticesEdges (V,E)
then E . e DJoins V . v,V . w, replaceVerticesEdges (V,E) by Th4;
hence E . e Joins V . v,V . w, replaceVerticesEdges (V,E) by GLIB_000:16; :: thesis: verum
end;
suppose e DJoins w,v,G ; :: thesis: E . e Joins V . v,V . w, replaceVerticesEdges (V,E)
then E . e DJoins V . w,V . v, replaceVerticesEdges (V,E) by Th4;
hence E . e Joins V . v,V . w, replaceVerticesEdges (V,E) by GLIB_000:16; :: thesis: verum
end;
end;