let G be _Graph; ( G is non-multi iff EdgeAdjEqRel G = id (the_Edges_of G) )
hereby ( EdgeAdjEqRel G = id (the_Edges_of G) implies G is non-multi )
assume A1:
G is
non-multi
;
EdgeAdjEqRel G = id (the_Edges_of G)now for e1, e2 being object holds
( ( [e1,e2] in EdgeAdjEqRel G implies [e1,e2] in id (the_Edges_of G) ) & ( [e1,e2] in id (the_Edges_of G) implies [e1,e2] in EdgeAdjEqRel G ) )let e1,
e2 be
object ;
( ( [e1,e2] in EdgeAdjEqRel G implies [e1,e2] in id (the_Edges_of G) ) & ( [e1,e2] in id (the_Edges_of G) implies [e1,e2] in EdgeAdjEqRel G ) )hereby ( [e1,e2] in id (the_Edges_of G) implies [e1,e2] in EdgeAdjEqRel G )
assume
[e1,e2] in EdgeAdjEqRel G
;
[e1,e2] in id (the_Edges_of G)then consider v1,
v2 being
object such that A2:
(
e1 Joins v1,
v2,
G &
e2 Joins v1,
v2,
G )
by Def3;
A3:
e1 = e2
by A1, A2, GLIB_000:def 20;
(
e1 in the_Edges_of G &
e2 in the_Edges_of G )
by A2, GLIB_000:def 13;
hence
[e1,e2] in id (the_Edges_of G)
by A3, RELAT_1:def 10;
verum
end; assume
[e1,e2] in id (the_Edges_of G)
;
[e1,e2] in EdgeAdjEqRel Gthen A4:
(
e1 in the_Edges_of G &
e1 = e2 )
by RELAT_1:def 10;
now ex v1, v2 being object st
( e1 Joins v1,v2,G & e2 Joins v1,v2,G )reconsider v1 =
(the_Source_of G) . e1,
v2 =
(the_Target_of G) . e1 as
object ;
take v1 =
v1;
ex v2 being object st
( e1 Joins v1,v2,G & e2 Joins v1,v2,G )take v2 =
v2;
( e1 Joins v1,v2,G & e2 Joins v1,v2,G )thus
(
e1 Joins v1,
v2,
G &
e2 Joins v1,
v2,
G )
by A4, GLIB_000:def 13;
verum end; hence
[e1,e2] in EdgeAdjEqRel G
by Def3;
verum end; hence
EdgeAdjEqRel G = id (the_Edges_of G)
by RELAT_1:def 2;
verum
end;
assume A5:
EdgeAdjEqRel G = id (the_Edges_of G)
; G is non-multi
now for e1, e2, v1, v2 being object st e1 Joins v1,v2,G & e2 Joins v1,v2,G holds
e1 = e2let e1,
e2,
v1,
v2 be
object ;
( e1 Joins v1,v2,G & e2 Joins v1,v2,G implies e1 = e2 )assume
(
e1 Joins v1,
v2,
G &
e2 Joins v1,
v2,
G )
;
e1 = e2then
[e1,e2] in EdgeAdjEqRel G
by Def3;
hence
e1 = e2
by A5, RELAT_1:def 10;
verum end;
hence
G is non-multi
by GLIB_000:def 20; verum