let G be _Graph; for e, x1, y1, x2, y2 being set st e Joins x1,y1,G & e Joins x2,y2,G & not ( x1 = x2 & y1 = y2 ) holds
( x1 = y2 & y1 = x2 )
let e, x1, y1, x2, y2 be set ; ( e Joins x1,y1,G & e Joins x2,y2,G & not ( x1 = x2 & y1 = y2 ) implies ( x1 = y2 & y1 = x2 ) )
assume that
A1:
e Joins x1,y1,G
and
A2:
e Joins x2,y2,G
; ( ( x1 = x2 & y1 = y2 ) or ( x1 = y2 & y1 = x2 ) )
set S = (the_Source_of G) . e;
set T = (the_Target_of G) . e;
hence
( ( x1 = x2 & y1 = y2 ) or ( x1 = y2 & y1 = x2 ) )
; verum