let G1, G2 be _Graph; :: thesis: for F being directed PGraphMapping of G1,G2
for X, Y being Subset of () st F is weak_SG-embedding holds
card (G1 .edgesDBetween (X,Y)) c= card (G2 .edgesDBetween (((F _V) .: X),((F _V) .: Y)))

let F be directed PGraphMapping of G1,G2; :: thesis: for X, Y being Subset of () st F is weak_SG-embedding holds
card (G1 .edgesDBetween (X,Y)) c= card (G2 .edgesDBetween (((F _V) .: X),((F _V) .: Y)))

let X, Y be Subset of (); :: thesis: ( F is weak_SG-embedding implies card (G1 .edgesDBetween (X,Y)) c= card (G2 .edgesDBetween (((F _V) .: X),((F _V) .: Y))) )
assume A1: F is weak_SG-embedding ; :: thesis: card (G1 .edgesDBetween (X,Y)) c= card (G2 .edgesDBetween (((F _V) .: X),((F _V) .: Y)))
set f = (F _E) | (G1 .edgesDBetween (X,Y));
A2: dom ((F _E) | (G1 .edgesDBetween (X,Y))) = (dom (F _E)) /\ (G1 .edgesDBetween (X,Y)) by RELAT_1:61
.= () /\ (G1 .edgesDBetween (X,Y)) by
.= G1 .edgesDBetween (X,Y) by XBOOLE_1:28 ;
for y being object st y in rng ((F _E) | (G1 .edgesDBetween (X,Y))) holds
y in G2 .edgesDBetween (((F _V) .: X),((F _V) .: Y))
proof
let y be object ; :: thesis: ( y in rng ((F _E) | (G1 .edgesDBetween (X,Y))) implies y in G2 .edgesDBetween (((F _V) .: X),((F _V) .: Y)) )
assume y in rng ((F _E) | (G1 .edgesDBetween (X,Y))) ; :: thesis: y in G2 .edgesDBetween (((F _V) .: X),((F _V) .: Y))
then consider x being object such that
A3: ( x in dom ((F _E) | (G1 .edgesDBetween (X,Y))) & ((F _E) | (G1 .edgesDBetween (X,Y))) . x = y ) by FUNCT_1:def 3;
set v = () . x;
set w = () . x;
A4: x DSJoins X,Y,G1 by ;
then A5: ( (the_Source_of G1) . x in X & () . x in Y ) by GLIB_000:def 16;
then ( (the_Source_of G1) . x in the_Vertices_of G1 & () . x in the_Vertices_of G1 ) ;
then A6: ( (the_Source_of G1) . x in dom (F _V) & () . x in dom (F _V) ) by ;
A7: x in the_Edges_of G1 by ;
then A8: x in dom (F _E) by ;
x DJoins () . x,() . x,G1 by ;
then (F _E) . x DJoins (F _V) . (() . x),(F _V) . (() . x),G2 by ;
then A9: y DJoins (F _V) . (() . x),(F _V) . (() . x),G2 by ;
( (F _V) . (() . x) in (F _V) .: X & (F _V) . (() . x) in (F _V) .: Y ) by ;
then y DSJoins (F _V) .: X,(F _V) .: Y,G2 by ;
hence y in G2 .edgesDBetween (((F _V) .: X),((F _V) .: Y)) by GLIB_000:def 31; :: thesis: verum
end;
then A10: rng ((F _E) | (G1 .edgesDBetween (X,Y))) c= G2 .edgesDBetween (((F _V) .: X),((F _V) .: Y)) by TARSKI:def 3;
(F _E) | (G1 .edgesDBetween (X,Y)) is one-to-one by ;
hence card (G1 .edgesDBetween (X,Y)) c= card (G2 .edgesDBetween (((F _V) .: X),((F _V) .: Y))) by ; :: thesis: verum