let G1, G2 be _Graph; :: thesis: for F being PGraphMapping of G1,G2
for X, Y being Subset of (the_Vertices_of G1) st F is total holds
(F _E) .: (G1 .edgesBetween (X,Y)) c= G2 .edgesBetween (((F _V) .: X),((F _V) .: Y))

let F be PGraphMapping of G1,G2; :: thesis: for X, Y being Subset of (the_Vertices_of G1) st F is total holds
(F _E) .: (G1 .edgesBetween (X,Y)) c= G2 .edgesBetween (((F _V) .: X),((F _V) .: Y))

let X, Y be Subset of (the_Vertices_of G1); :: thesis: ( F is total implies (F _E) .: (G1 .edgesBetween (X,Y)) c= G2 .edgesBetween (((F _V) .: X),((F _V) .: Y)) )
assume A1: F is total ; :: thesis: (F _E) .: (G1 .edgesBetween (X,Y)) c= G2 .edgesBetween (((F _V) .: X),((F _V) .: Y))
set f = (F _E) | (G1 .edgesBetween (X,Y));
A2: dom ((F _E) | (G1 .edgesBetween (X,Y))) = (dom (F _E)) /\ (G1 .edgesBetween (X,Y)) by RELAT_1:61
.= (the_Edges_of G1) /\ (G1 .edgesBetween (X,Y)) by A1, GLIB_010:def 11
.= G1 .edgesBetween (X,Y) by XBOOLE_1:28 ;
for y being object st y in rng ((F _E) | (G1 .edgesBetween (X,Y))) holds
y in G2 .edgesBetween (((F _V) .: X),((F _V) .: Y))
proof
let y be object ; :: thesis: ( y in rng ((F _E) | (G1 .edgesBetween (X,Y))) implies y in G2 .edgesBetween (((F _V) .: X),((F _V) .: Y)) )
assume y in rng ((F _E) | (G1 .edgesBetween (X,Y))) ; :: thesis: y in G2 .edgesBetween (((F _V) .: X),((F _V) .: Y))
then consider x being object such that
A3: ( x in dom ((F _E) | (G1 .edgesBetween (X,Y))) & ((F _E) | (G1 .edgesBetween (X,Y))) . x = y ) by FUNCT_1:def 3;
set v = (the_Source_of G1) . x;
set w = (the_Target_of G1) . x;
A4: x SJoins X,Y,G1 by A2, A3, GLIB_000:def 30;
per cases then ( ( (the_Source_of G1) . x in X & (the_Target_of G1) . x in Y ) or ( (the_Source_of G1) . x in Y & (the_Target_of G1) . x in X ) ) by GLIB_000:def 15;
suppose A5: ( (the_Source_of G1) . x in X & (the_Target_of G1) . x in Y ) ; :: thesis: y in G2 .edgesBetween (((F _V) .: X),((F _V) .: Y))
end;
suppose A10: ( (the_Source_of G1) . x in Y & (the_Target_of G1) . x in X ) ; :: thesis: y in G2 .edgesBetween (((F _V) .: X),((F _V) .: Y))
end;
end;
end;
then rng ((F _E) | (G1 .edgesBetween (X,Y))) c= G2 .edgesBetween (((F _V) .: X),((F _V) .: Y)) by TARSKI:def 3;
hence (F _E) .: (G1 .edgesBetween (X,Y)) c= G2 .edgesBetween (((F _V) .: X),((F _V) .: Y)) by RELAT_1:115; :: thesis: verum