let G1, G2 be _Graph; :: thesis: ( G1 == G2 & G1 is Cycle-like implies G2 is Cycle-like )
assume G1 == G2 ; :: thesis: ( not G1 is Cycle-like or G2 is Cycle-like )
then consider F being PGraphMapping of G1,G2 such that
A1: ( F = id G1 & F is Disomorphism ) by GLIBPRE0:75;
thus ( not G1 is Cycle-like or G2 is Cycle-like ) by A1, Th48; :: thesis: verum