let V be non empty set ; for E being Relation of V holds
( E is antisymmetric iff createGraph (V,E) is non-multi )
let E be Relation of V; ( E is antisymmetric iff createGraph (V,E) is non-multi )
set G0 = createGraph (V,E);
hereby ( createGraph (V,E) is non-multi implies E is antisymmetric )
assume
E is
antisymmetric
;
createGraph (V,E) is non-multi then A1:
E is_antisymmetric_in field E
by RELAT_2:def 12;
assume
not
createGraph (
V,
E) is
non-multi
;
contradictionthen consider e1,
e2,
v,
w being
object such that A2:
(
e1 Joins v,
w,
createGraph (
V,
E) &
e2 Joins v,
w,
createGraph (
V,
E) &
e1 <> e2 )
by GLIB_000:def 20;
(
e1 in the_Edges_of (createGraph (V,E)) &
e2 in the_Edges_of (createGraph (V,E)) )
by A2, GLIB_000:def 13;
then A3:
(
e1 in E &
e2 in E )
;
per cases
( ( e1 DJoins v,w, createGraph (V,E) & e2 DJoins v,w, createGraph (V,E) ) or ( e1 DJoins v,w, createGraph (V,E) & e2 DJoins w,v, createGraph (V,E) ) or ( e1 DJoins w,v, createGraph (V,E) & e2 DJoins v,w, createGraph (V,E) ) or ( e1 DJoins w,v, createGraph (V,E) & e2 DJoins w,v, createGraph (V,E) ) )
by A2, GLIB_000:16;
end;
end;
assume
createGraph (V,E) is non-multi
; E is antisymmetric
then
VertexDomRel (createGraph (V,E)) is antisymmetric
;
hence
E is antisymmetric
; verum