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

assume A3:
for x being Element of dom GF holds GF . x is Tree-like
; :: thesis: GF is Tree-like assume A1:
GF is Tree-like
; :: thesis: for x being Element of dom GF holds GF . x is Tree-like

let x be Element of dom GF; :: thesis: GF . x is Tree-like

consider G being _Graph such that

A2: ( GF . x = G & G is Tree-like ) by A1;

thus GF . x is Tree-like by A2; :: thesis: verum

end;let x be Element of dom GF; :: thesis: GF . x is Tree-like

consider G being _Graph such that

A2: ( GF . x = G & G is Tree-like ) by A1;

thus GF . x is Tree-like by A2; :: thesis: verum

let x be object ; :: according to GLIB_002:def 14 :: thesis: ( x in dom GF implies ex G being _Graph st

( GF . x = G & G is Tree-like ) )

assume x in dom GF ; :: thesis: ex G being _Graph st

( GF . x = G & G is Tree-like )

then reconsider y = x as Element of dom GF ;

take GF . y ; :: thesis: ( GF . x = GF . y & GF . y is Tree-like )

thus ( GF . x = GF . y & GF . y is Tree-like ) by A3; :: thesis: verum