let G be _Graph; :: thesis: for X being set st X /\ (the_Vertices_of G) = {} holds
( G .edgesInto X = {} & G .edgesOutOf X = {} & G .edgesInOut X = {} & G .edgesBetween X = {} )

let X be set ; :: thesis: ( X /\ (the_Vertices_of G) = {} implies ( G .edgesInto X = {} & G .edgesOutOf X = {} & G .edgesInOut X = {} & G .edgesBetween X = {} ) )
assume A1: X /\ (the_Vertices_of G) = {} ; :: thesis: ( G .edgesInto X = {} & G .edgesOutOf X = {} & G .edgesInOut X = {} & G .edgesBetween X = {} )
thus A2: G .edgesInto X = {} :: thesis: ( G .edgesOutOf X = {} & G .edgesInOut X = {} & G .edgesBetween X = {} )
proof end;
thus A5: G .edgesOutOf X = {} :: thesis: ( G .edgesInOut X = {} & G .edgesBetween X = {} )
proof end;
thus G .edgesInOut X = (G .edgesInto X) \/ (G .edgesOutOf X) by GLIB_000:def 28
.= {} by A2, A5 ; :: thesis: G .edgesBetween X = {}
thus G .edgesBetween X = (G .edgesInto X) /\ (G .edgesOutOf X) by GLIB_000:def 29
.= {} by A2 ; :: thesis: verum