theorem Th69: :: GLIB_015:69

for S being vertex-disjoint GraphUnionSet
for G being GraphUnion of S st S is connected holds
card S = G .numComponents()