hereby :: thesis: ( ( for x being Element of dom GF holds GF . x is edgeless ) implies GF is edgeless )

assume A1: GF is edgeless ; :: thesis: for x being Element of dom GF holds GF . x is edgeless
let x be Element of dom GF; :: thesis: GF . x is edgeless
consider G being _Graph such that
A2: ( GF . x = G & G is edgeless ) by A1;
thus GF . x is edgeless by A2; :: thesis: verum

end;

assume A3: for x being Element of dom GF holds GF . x is edgeless ; :: thesis: GF is edgeless
let x be object ; :: according to GLIB_008:def 2 :: thesis: ( x in dom GF implies ex G being _Graph st
( GF . x = G & G is edgeless ) )
assume x in dom GF ; :: thesis: ex G being _Graph st
( GF . x = G & G is edgeless )
then reconsider y = x as Element of dom GF ;
take GF . y ; :: thesis: ( GF . x = GF . y & GF . y is edgeless )
thus ( GF . x = GF . y & GF . y is edgeless ) by A3; :: thesis: verum