let G be _Graph; ( G is loopless iff for v, e being object holds not e DSJoins {v},{v},G )
hereby ( ( for v, e being object holds not e DSJoins {v},{v},G ) implies G is loopless )
assume A1:
G is
loopless
;
for v, e being object holds not e DSJoins {v},{v},Glet v be
object ;
for e being object holds not e DSJoins {v},{v},Ggiven e being
object such that A2:
e DSJoins {v},
{v},
G
;
contradiction
e SJoins {v},
{v},
G
by A2;
hence
contradiction
by A1, Th137;
verum
end;
assume A3:
for v, e being object holds not e DSJoins {v},{v},G
; G is loopless
for v, e being object holds not e SJoins {v},{v},G
hence
G is loopless
by Th137; verum