let G be _Graph; :: thesis: for v being Vertex of G holds
( v is isolated iff not v in (rng (the_Source_of G)) \/ (rng (the_Target_of G)) )

let v be Vertex of G; :: thesis: ( v is isolated iff not v in (rng (the_Source_of G)) \/ (rng (the_Target_of G)) )
hereby :: thesis: ( not v in (rng (the_Source_of G)) \/ (rng (the_Target_of G)) implies v is isolated ) end;
assume A4: not v in (rng (the_Source_of G)) \/ (rng (the_Target_of G)) ; :: thesis: v is isolated
assume not v is isolated ; :: thesis: contradiction
then v .edgesInOut() <> {} ;
then consider e being object such that
A5: e in v .edgesInOut() by XBOOLE_0:def 1;
A6: ( e in the_Edges_of G & ( (the_Source_of G) . e = v or (the_Target_of G) . e = v ) ) by A5, Th61;
per cases then ( (the_Source_of G) . e = v or (the_Target_of G) . e = v ) ;
end;