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() c= v1 .edgesIn() & v2 .edgesOut() c= v1 .edgesOut() & v2 .edgesInOut() c= v1 .edgesInOut() )

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() c= v1 .edgesIn() & v2 .edgesOut() c= v1 .edgesOut() & v2 .edgesInOut() c= v1 .edgesInOut() )

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

let v2 be Vertex of G2; :: thesis: ( v1 = v2 implies ( v2 .edgesIn() c= v1 .edgesIn() & v2 .edgesOut() c= v1 .edgesOut() & v2 .edgesInOut() c= v1 .edgesInOut() ) )
assume A1: v1 = v2 ; :: thesis: ( v2 .edgesIn() c= v1 .edgesIn() & v2 .edgesOut() c= v1 .edgesOut() & v2 .edgesInOut() c= v1 .edgesInOut() )
now :: thesis: for x being object st x in v2 .edgesIn() holds
x in v1 .edgesIn()
end;
hence v2 .edgesIn() c= v1 .edgesIn() ; :: thesis: ( v2 .edgesOut() c= v1 .edgesOut() & v2 .edgesInOut() c= v1 .edgesInOut() )
now :: thesis: for x being object st x in v2 .edgesOut() holds
x in v1 .edgesOut()
end;
hence v2 .edgesOut() c= v1 .edgesOut() ; :: thesis: v2 .edgesInOut() c= v1 .edgesInOut()
now :: thesis: for x being object st x in v2 .edgesInOut() holds
x in v1 .edgesInOut()
let x be object ; :: thesis: ( x in v2 .edgesInOut() implies x in v1 .edgesInOut() )
assume A6: x in v2 .edgesInOut() ; :: thesis: x in v1 .edgesInOut()
then ( (the_Source_of G2) . x = v2 or (the_Target_of G2) . x = v2 ) by Th61;
then A7: ( (the_Source_of G1) . x = v1 or (the_Target_of G1) . x = v1 ) by A1, A6, Def32;
x in the_Edges_of G2 by A6;
hence x in v1 .edgesInOut() by A7, Th61; :: thesis: verum
end;
hence v2 .edgesInOut() c= v1 .edgesInOut() ; :: thesis: verum