let G2 be _Graph; :: thesis: for v being object
for V being Subset of (the_Vertices_of G2)
for G1 being addAdjVertexAll of G2,v,V st not v in the_Vertices_of G2 holds
( ( G2 is locally-finite & V is finite ) iff G1 is locally-finite )

let v be object ; :: thesis: for V being Subset of (the_Vertices_of G2)
for G1 being addAdjVertexAll of G2,v,V st not v in the_Vertices_of G2 holds
( ( G2 is locally-finite & V is finite ) iff G1 is locally-finite )

let V be Subset of (the_Vertices_of G2); :: thesis: for G1 being addAdjVertexAll of G2,v,V st not v in the_Vertices_of G2 holds
( ( G2 is locally-finite & V is finite ) iff G1 is locally-finite )

let G1 be addAdjVertexAll of G2,v,V; :: thesis: ( not v in the_Vertices_of G2 implies ( ( G2 is locally-finite & V is finite ) iff G1 is locally-finite ) )
assume A1: not v in the_Vertices_of G2 ; :: thesis: ( ( G2 is locally-finite & V is finite ) iff G1 is locally-finite )
hereby :: thesis: ( G1 is locally-finite implies ( G2 is locally-finite & V is finite ) ) end;
assume A4: G1 is locally-finite ; :: thesis: ( G2 is locally-finite & V is finite )
G2 is Subgraph of G1 by GLIB_006:57;
hence G2 is locally-finite by A4; :: thesis: V is finite
reconsider w = v as Vertex of G1 by A1, GLIB_007:50;
w .degree() is finite by A4;
then card V is finite by A1, GLIBPRE0:55;
hence V is finite ; :: thesis: verum