let G be _Graph; :: thesis: for a, b being Vertex of G st a <> b & not a,b are_adjacent holds
for S being VertexSeparator of a,b st S = {} holds
for W being Walk of G holds not W is_Walk_from a,b
let a, b be Vertex of G; :: thesis: ( a <> b & not a,b are_adjacent implies for S being VertexSeparator of a,b st S = {} holds
for W being Walk of G holds not W is_Walk_from a,b )
assume that
A1: a <> b and
A2: not a,b are_adjacent ; :: thesis: for S being VertexSeparator of a,b st S = {} holds
for W being Walk of G holds not W is_Walk_from a,b
let S be VertexSeparator of a,b; :: thesis: ( S = {} implies for W being Walk of G holds not W is_Walk_from a,b )
assume A3: S = {} ; :: thesis: for W being Walk of G holds not W is_Walk_from a,b
A4: the_Edges_of G c= G .edgesBetween (the_Vertices_of G) by GLIB_000:37;
A5: the_Vertices_of G c= the_Vertices_of G ;
consider G2 being removeVertices of G,S;
given W being Walk of G such that A6: W is_Walk_from a,b ; :: thesis: contradiction
the_Vertices_of G2 = the_Vertices_of G by A3, GLIB_000:def 39;
then A7: W .vertices() c= the_Vertices_of G2 ;
G2 is inducedSubgraph of G, the_Vertices_of G, the_Edges_of G by A3, GLIB_000:37;
then the_Edges_of G2 = the_Edges_of G by A5, A4, GLIB_000:def 39;
then W .edges() c= the_Edges_of G2 ;
then reconsider W2 = W as Walk of G2 by A7, GLIB_001:171;
W .last() = b by A6, GLIB_001:def 23;
then A8: W2 .last() = b ;
W .first() = a by A6, GLIB_001:def 23;
then W2 .first() = a ;
then W2 is_Walk_from a,b by A8, GLIB_001:def 23;
hence contradiction by A1, A2, Def8; :: thesis: verum