let G1 be _Graph; :: thesis: for G2 being Subgraph of G1
for v1 being Vertex of G1
for v2 being Vertex of G2 st v1 = v2 holds
( v2 .edgesIn() = (v1 .edgesIn()) /\ (the_Edges_of G2) & v2 .edgesOut() = (v1 .edgesOut()) /\ (the_Edges_of G2) & v2 .edgesInOut() = (v1 .edgesInOut()) /\ (the_Edges_of G2) )

let G2 be Subgraph of G1; :: thesis: for v1 being Vertex of G1
for v2 being Vertex of G2 st v1 = v2 holds
( v2 .edgesIn() = (v1 .edgesIn()) /\ (the_Edges_of G2) & v2 .edgesOut() = (v1 .edgesOut()) /\ (the_Edges_of G2) & v2 .edgesInOut() = (v1 .edgesInOut()) /\ (the_Edges_of G2) )

let v1 be Vertex of G1; :: thesis: for v2 being Vertex of G2 st v1 = v2 holds
( v2 .edgesIn() = (v1 .edgesIn()) /\ (the_Edges_of G2) & v2 .edgesOut() = (v1 .edgesOut()) /\ (the_Edges_of G2) & v2 .edgesInOut() = (v1 .edgesInOut()) /\ (the_Edges_of G2) )

let v2 be Vertex of G2; :: thesis: ( v1 = v2 implies ( v2 .edgesIn() = (v1 .edgesIn()) /\ (the_Edges_of G2) & v2 .edgesOut() = (v1 .edgesOut()) /\ (the_Edges_of G2) & v2 .edgesInOut() = (v1 .edgesInOut()) /\ (the_Edges_of G2) ) )
assume A1: v1 = v2 ; :: thesis: ( v2 .edgesIn() = (v1 .edgesIn()) /\ (the_Edges_of G2) & v2 .edgesOut() = (v1 .edgesOut()) /\ (the_Edges_of G2) & v2 .edgesInOut() = (v1 .edgesInOut()) /\ (the_Edges_of G2) )
now :: thesis: for x being object holds
( ( x in v2 .edgesIn() implies x in (v1 .edgesIn()) /\ (the_Edges_of G2) ) & ( x in (v1 .edgesIn()) /\ (the_Edges_of G2) implies x in v2 .edgesIn() ) )
end;
hence A5: v2 .edgesIn() = (v1 .edgesIn()) /\ (the_Edges_of G2) by TARSKI:2; :: thesis: ( v2 .edgesOut() = (v1 .edgesOut()) /\ (the_Edges_of G2) & v2 .edgesInOut() = (v1 .edgesInOut()) /\ (the_Edges_of G2) )
now :: thesis: for x being object holds
( ( x in v2 .edgesOut() implies x in (v1 .edgesOut()) /\ (the_Edges_of G2) ) & ( x in (v1 .edgesOut()) /\ (the_Edges_of G2) implies x in v2 .edgesOut() ) )
end;
hence A9: v2 .edgesOut() = (v1 .edgesOut()) /\ (the_Edges_of G2) by TARSKI:2; :: thesis: v2 .edgesInOut() = (v1 .edgesInOut()) /\ (the_Edges_of G2)
now :: thesis: for x being object holds
( ( x in (v1 .edgesInOut()) /\ (the_Edges_of G2) implies x in v2 .edgesInOut() ) & ( x in v2 .edgesInOut() implies x in (v1 .edgesInOut()) /\ (the_Edges_of G2) ) )
let x be object ; :: thesis: ( ( x in (v1 .edgesInOut()) /\ (the_Edges_of G2) implies x in v2 .edgesInOut() ) & ( x in v2 .edgesInOut() implies x in (v1 .edgesInOut()) /\ (the_Edges_of G2) ) )
hereby :: thesis: ( x in v2 .edgesInOut() implies x in (v1 .edgesInOut()) /\ (the_Edges_of G2) ) end;
assume A13: x in v2 .edgesInOut() ; :: thesis: x in (v1 .edgesInOut()) /\ (the_Edges_of G2)
now :: thesis: x in (v1 .edgesInOut()) /\ (the_Edges_of G2)end;
hence x in (v1 .edgesInOut()) /\ (the_Edges_of G2) ; :: thesis: verum
end;
hence v2 .edgesInOut() = (v1 .edgesInOut()) /\ (the_Edges_of G2) by TARSKI:2; :: thesis: verum