now
per cases ( ( V is non empty Subset of (the_Vertices_of G) & E c= G .edgesBetween V ) or not V is non empty Subset of (the_Vertices_of G) or not E c= G .edgesBetween V ) ;
suppose A1: ( V is non empty Subset of (the_Vertices_of G) & E c= G .edgesBetween V ) ; :: thesis: ex GG being [VLabeled] inducedSubgraph of G,V,E st GG is vlabel-inheriting
end;
end;
end;
hence ex b1 being [VLabeled] inducedSubgraph of G,V,E st b1 is vlabel-inheriting ; :: thesis: verum