let G1, G2 be _Graph; :: thesis: for F being PGraphMapping of G1,G2 st F is one-to-one & F is onto holds
G2 .allConnectedSG() c= rng ((SG2SGFunc F) | (G1 .allConnectedSG()))

let F be PGraphMapping of G1,G2; :: thesis: ( F is one-to-one & F is onto implies G2 .allConnectedSG() c= rng ((SG2SGFunc F) | (G1 .allConnectedSG())) )
assume A1: ( F is one-to-one & F is onto ) ; :: thesis: G2 .allConnectedSG() c= rng ((SG2SGFunc F) | (G1 .allConnectedSG()))
set f = (SG2SGFunc F) | (G1 .allConnectedSG());
A2: dom ((SG2SGFunc F) | (G1 .allConnectedSG())) = G1 .allConnectedSG() by FUNCT_2:def 1;
now :: thesis: for x being object st x in G2 .allConnectedSG() holds
x in rng ((SG2SGFunc F) | (G1 .allConnectedSG()))
end;
hence G2 .allConnectedSG() c= rng ((SG2SGFunc F) | (G1 .allConnectedSG())) by TARSKI:def 3; :: thesis: verum