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