let G be _Graph; :: thesis: for v being Vertex of G holds
( v .edgesIn() = (the_Target_of G) " {v} & v .edgesOut() = (the_Source_of G) " {v} )

let v be Vertex of G; :: thesis: ( v .edgesIn() = (the_Target_of G) " {v} & v .edgesOut() = (the_Source_of G) " {v} )
now :: thesis: for e being object holds
( ( e in v .edgesIn() implies e in (the_Target_of G) " {v} ) & ( e in (the_Target_of G) " {v} implies e in v .edgesIn() ) )
end;
hence v .edgesIn() = (the_Target_of G) " {v} by TARSKI:2; :: thesis: v .edgesOut() = (the_Source_of G) " {v}
now :: thesis: for e being object holds
( ( e in v .edgesOut() implies e in (the_Source_of G) " {v} ) & ( e in (the_Source_of G) " {v} implies e in v .edgesOut() ) )
end;
hence v .edgesOut() = (the_Source_of G) " {v} by TARSKI:2; :: thesis: verum