the plain Component of G in G .allComponents() by Th189;
hence not G .allComponents() is empty ; :: thesis: ( G .allComponents() is vertex-disjoint & G .allComponents() is edge-disjoint & G .allComponents() is \/-tolerating & G .allComponents() is plain & G .allComponents() is connected )
now :: thesis: for G1, G2 being _Graph st G1 in G .allComponents() & G2 in G .allComponents() & G1 <> G2 holds
the_Vertices_of G1 misses the_Vertices_of G2
end;
hence G .allComponents() is vertex-disjoint by GLIB_015:def 18; :: thesis: ( G .allComponents() is edge-disjoint & G .allComponents() is \/-tolerating & G .allComponents() is plain & G .allComponents() is connected )
hence G .allComponents() is edge-disjoint ; :: thesis: ( G .allComponents() is \/-tolerating & G .allComponents() is plain & G .allComponents() is connected )
thus ( G .allComponents() is \/-tolerating & G .allComponents() is plain ) ; :: thesis: G .allComponents() is connected
for H being _Graph st H in G .allComponents() holds
H is connected by Th189;
hence G .allComponents() is connected by GLIB_014:def 9; :: thesis: verum