let G1 be _Graph; :: thesis: for E being Subset of (the_Edges_of G1)
for G2 being reverseEdgeDirections of G1,E holds
( G1 tolerates G2 iff E c= G1 .loops() )

let E be Subset of (the_Edges_of G1); :: thesis: for G2 being reverseEdgeDirections of G1,E holds
( G1 tolerates G2 iff E c= G1 .loops() )

let G2 be reverseEdgeDirections of G1,E; :: thesis: ( G1 tolerates G2 iff E c= G1 .loops() )
hereby :: thesis: ( E c= G1 .loops() implies G1 tolerates G2 ) end;
assume A5: E c= G1 .loops() ; :: thesis: G1 tolerates G2
now :: thesis: for e, v1, w1, v2, w2 being object st e DJoins v1,w1,G1 & e DJoins v2,w2,G2 holds
( v1 = v2 & w1 = w2 )
let e, v1, w1, v2, w2 be object ; :: thesis: ( e DJoins v1,w1,G1 & e DJoins v2,w2,G2 implies ( b2 = b4 & b3 = b5 ) )
assume A6: ( e DJoins v1,w1,G1 & e DJoins v2,w2,G2 ) ; :: thesis: ( b2 = b4 & b3 = b5 )
per cases ( e in E or not e in E ) ;
suppose A7: e in E ; :: thesis: ( b2 = b4 & b3 = b5 )
then consider u being object such that
A8: e DJoins u,u,G1 by A5, GLIB_009:45;
A9: ( v1 = u & w1 = u ) by A6, A8, GLIB_000:125;
e DJoins w1,v1,G2 by A6, A7, GLIB_007:7;
hence ( v1 = v2 & w1 = w2 ) by A6, A9, GLIB_000:125; :: thesis: verum
end;
suppose not e in E ; :: thesis: ( b2 = b4 & b3 = b5 )
then e DJoins v1,w1,G2 by A6, GLIB_007:8;
hence ( v1 = v2 & w1 = w2 ) by A6, GLIB_000:125; :: thesis: verum
end;
end;
end;
hence G1 tolerates G2 by Th17; :: thesis: verum