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 G2 being [Weighted] [VLabeled] inducedSubgraph of G,V,E st
( G2 is weight-inheriting & G2 is vlabel-inheriting )

consider X being [Weighted] [VLabeled] inducedSubgraph of G,V,E;
set W = (the_Weight_of G) | (the_Edges_of X);
dom (the_Weight_of G) = the_Edges_of G by PARTFUN1:def 4;
then dom ((the_Weight_of G) | (the_Edges_of X)) = the_Edges_of X by RELAT_1:91;
then reconsider W = (the_Weight_of G) | (the_Edges_of X) as ManySortedSet of the_Edges_of X by PARTFUN1:def 4;
set G1 = X .set (WeightSelector,W);
set VL = (the_VLabel_of G) | (the_Vertices_of (X .set (WeightSelector,W)));
reconsider VL9 = (the_VLabel_of G) | (the_Vertices_of (X .set (WeightSelector,W))) as PartFunc of (dom ((the_VLabel_of G) | (the_Vertices_of (X .set (WeightSelector,W))))),(rng ((the_VLabel_of G) | (the_Vertices_of (X .set (WeightSelector,W))))) by RELSET_1:11;
reconsider VL9 = VL9 as PartFunc of (the_Vertices_of (X .set (WeightSelector,W))),(rng ((the_VLabel_of G) | (the_Vertices_of (X .set (WeightSelector,W))))) by RELAT_1:87, RELSET_1:13;
set G2 = (X .set (WeightSelector,W)) .set (VLabelSelector,VL9);
A2: (X .set (WeightSelector,W)) .set (VLabelSelector,VL9) == X .set (WeightSelector,W) by Lm3;
X == X .set (WeightSelector,W) by Lm3;
then A3: (X .set (WeightSelector,W)) .set (VLabelSelector,VL9) == X by A2, GLIB_000:88;
then (X .set (WeightSelector,W)) .set (VLabelSelector,VL9) is Subgraph of X by GLIB_000:90;
then reconsider G2 = (X .set (WeightSelector,W)) .set (VLabelSelector,VL9) as Subgraph of G by GLIB_000:46;
A4: the_Vertices_of G2 = the_Vertices_of X by A3, GLIB_000:def 36
.= V by A1, GLIB_000:def 39 ;
the_Edges_of G2 = the_Edges_of X by A3, GLIB_000:def 36
.= E by A1, GLIB_000:def 39 ;
then reconsider G2 = G2 as [Weighted] [VLabeled] inducedSubgraph of G,V,E by A1, A4, GLIB_000:def 39;
take G2 = G2; :: thesis: ( G2 is weight-inheriting & G2 is vlabel-inheriting )
the_Weight_of G2 = (X .set (WeightSelector,W)) . WeightSelector by GLIB_000:12
.= W by GLIB_000:11
.= (the_Weight_of G) | (the_Edges_of G2) by A3, GLIB_000:def 36 ;
hence G2 is weight-inheriting by Def10; :: thesis: G2 is vlabel-inheriting
the_VLabel_of G2 = (the_VLabel_of G) | (the_Vertices_of (X .set (WeightSelector,W))) by GLIB_000:11
.= (the_VLabel_of G) | (the_Vertices_of G2) by A2, GLIB_000:def 36 ;
hence G2 is vlabel-inheriting by Def12; :: thesis: verum

end;

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

reconsider GG = G as Subgraph of G by GLIB_000:43;
reconsider GG = GG as [Weighted] [VLabeled] inducedSubgraph of G,V,E by A5, GLIB_000:def 39;
take GG = GG; :: thesis: ( GG is weight-inheriting & GG is vlabel-inheriting )
dom (the_Weight_of G) = the_Edges_of G by PARTFUN1:def 4;
then the_Weight_of G = (the_Weight_of G) | (the_Edges_of G) by RELAT_1:98;
hence GG is weight-inheriting by Def10; :: 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 [Weighted] [VLabeled] inducedSubgraph of G,V,E st
( b₁ is weight-inheriting & b₁ is vlabel-inheriting ) ; :: thesis: verum