let V be set ; :: thesis: for G2 being _Graph
for c being Cardinal
for v being object
for G1 being addAdjVertexAll of G2,v,V st G2 is c -vcolorable holds
G1 is c +` 1 -vcolorable

let G2 be _Graph; :: thesis: for c being Cardinal
for v being object
for G1 being addAdjVertexAll of G2,v,V st G2 is c -vcolorable holds
G1 is c +` 1 -vcolorable

let c be Cardinal; :: thesis: for v being object
for G1 being addAdjVertexAll of G2,v,V st G2 is c -vcolorable holds
G1 is c +` 1 -vcolorable

let v be object ; :: thesis: for G1 being addAdjVertexAll of G2,v,V st G2 is c -vcolorable holds
G1 is c +` 1 -vcolorable

let G1 be addAdjVertexAll of G2,v,V; :: thesis: ( G2 is c -vcolorable implies G1 is c +` 1 -vcolorable )
assume A1: G2 is c -vcolorable ; :: thesis: G1 is c +` 1 -vcolorable
per cases ( ( not v in the_Vertices_of G2 & V c= the_Vertices_of G2 ) or v in the_Vertices_of G2 or not V c= the_Vertices_of G2 ) ;
suppose A2: ( not v in the_Vertices_of G2 & V c= the_Vertices_of G2 ) ; :: thesis: G1 is c +` 1 -vcolorable
consider f2 being VColoring of G2 such that
A3: ( f2 is proper & card (rng f2) c= c ) by A1;
set h = v .--> (rng f2);
set f1 = f2 +* (v .--> (rng f2));
reconsider f1 = f2 +* (v .--> (rng f2)) as VColoring of G1 by A2, Th7;
not rng f2 in rng f2 ;
then A4: f1 is proper by A2, A3, Th25;
(rng f2) \/ (rng (v .--> (rng f2))) = (rng f2) \/ (rng {[v,(rng f2)]}) by FUNCT_4:82
.= (rng f2) \/ {(rng f2)} by RELAT_1:9 ;
then A5: card (rng f1) c= card ((rng f2) \/ {(rng f2)}) by FUNCT_4:17, CARD_1:11;
card ((rng f2) \/ {(rng f2)}) c= (card (rng f2)) +` (card {(rng f2)}) by CARD_2:34;
then card ((rng f2) \/ {(rng f2)}) c= (card (rng f2)) +` 1 by CARD_1:30;
then A6: card (rng f1) c= (card (rng f2)) +` 1 by A5, XBOOLE_1:1;
(card (rng f2)) +` 1 c= c +` 1 by A3, CARD_2:84;
hence G1 is c +` 1 -vcolorable by A4, A6, XBOOLE_1:1; :: thesis: verum
end;
suppose ( v in the_Vertices_of G2 or not V c= the_Vertices_of G2 ) ; :: thesis: G1 is c +` 1 -vcolorable
end;
end;