let G1, G2 be _Graph; :: thesis: ( G1 == G2 & G1 is finite-ecolorable implies G2 is finite-ecolorable )
assume A1: ( G1 == G2 & G1 is finite-ecolorable ) ; :: thesis: G2 is finite-ecolorable
then consider n being Nat such that
A2: G1 is n -ecolorable ;
G2 is n -ecolorable by A1, A2, Th103;
hence G2 is finite-ecolorable ; :: thesis: verum