theorem Th68: :: GLIB_015:68

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