let c be Cardinal; :: thesis: for G2 being non edgeless _Graph
for v, e, w being object
for G1 being addAdjVertex of G2,v,e,w holds
( G1 is c -vcolorable iff G2 is c -vcolorable )

let G2 be non edgeless _Graph; :: thesis: for v, e, w being object
for G1 being addAdjVertex of G2,v,e,w holds
( G1 is c -vcolorable iff G2 is c -vcolorable )

let v, e, w be object ; :: thesis: for G1 being addAdjVertex of G2,v,e,w holds
( G1 is c -vcolorable iff G2 is c -vcolorable )

let G1 be addAdjVertex of G2,v,e,w; :: thesis: ( G1 is c -vcolorable iff G2 is c -vcolorable )
hereby :: thesis: ( G2 is c -vcolorable implies G1 is c -vcolorable ) end;
assume A2: G2 is c -vcolorable ; :: thesis: G1 is c -vcolorable
per cases ( ( not e in the_Edges_of G2 & v in the_Vertices_of G2 & not w in the_Vertices_of G2 ) or ( not e in the_Edges_of G2 & not v in the_Vertices_of G2 & w in the_Vertices_of G2 ) or ( not ( not e in the_Edges_of G2 & v in the_Vertices_of G2 & not w in the_Vertices_of G2 ) & not ( not e in the_Edges_of G2 & not v in the_Vertices_of G2 & w in the_Vertices_of G2 ) ) ) ;
end;