now

per cases ( ( V is non empty Subset of & E c= G .edgesBetween V ) or not V is non empty Subset of or not E c= G .edgesBetween V ) ;

suppose A1: ( V is non empty Subset of & E c= G .edgesBetween V ) ; :: thesis: ex GG being [VLabeled] inducedSubgraph of G,V,E st GG is vlabel-inheriting

consider X being [VLabeled] inducedSubgraph of G,V,E;
set VL = (the_VLabel_of G) | (the_Vertices_of X);
reconsider VL' = (the_VLabel_of G) | (the_Vertices_of X) as PartFunc of , by RELSET_1:11;
reconsider VL' = VL' as PartFunc of , by RELAT_1:87, RELSET_1:13;
set GG = X .set VLabelSelector ,VL';
A2: X .set VLabelSelector ,VL' == X by Lm3;
then X .set VLabelSelector ,VL' is Subgraph of X by GLIB_000:90;
then reconsider GG = X .set VLabelSelector ,VL' as Subgraph of G by GLIB_000:46;
A3: the_Vertices_of GG = the_Vertices_of X by A2, GLIB_000:def 36
.= V by A1, GLIB_000:def 39 ;
the_Edges_of GG = the_Edges_of X by A2, GLIB_000:def 36
.= E by A1, GLIB_000:def 39 ;
then reconsider GG = GG as [VLabeled] inducedSubgraph of G,V,E by A1, A3, GLIB_000:def 39;
take GG = GG; :: thesis: GG is vlabel-inheriting
the_VLabel_of GG = (the_VLabel_of G) | (the_Vertices_of X) by GLIB_000:11
.= (the_VLabel_of G) | (the_Vertices_of GG) by A2, GLIB_000:def 36 ;
hence GG is vlabel-inheriting by Def12; :: thesis: verum

end;

suppose A4: ( not V is non empty Subset of or not E c= G .edgesBetween V ) ; :: thesis: ex GG being [VLabeled] inducedSubgraph of G,V,E st GG is vlabel-inheriting

reconsider GG = G as Subgraph of G by GLIB_000:43;
reconsider GG = GG as [VLabeled] inducedSubgraph of G,V,E by A4, GLIB_000:def 39;
take GG = GG; :: thesis: GG is vlabel-inheriting
dom (the_VLabel_of G) c= the_Vertices_of G by Lm2;
then the_VLabel_of G = (the_VLabel_of G) | (the_Vertices_of G) by RELAT_1:97;
hence GG is vlabel-inheriting by Def12; :: thesis: verum

end;

end;

end;

hence ex b₁ being [VLabeled] inducedSubgraph of G,V,E st b₁ is vlabel-inheriting ; :: thesis: verum