theorem Th65: :: GLIB_015:65

for S being vertex-disjoint GraphUnionSet
for G being GraphUnion of S holds G .componentSet() = union { (H .componentSet()) where H is Element of S : verum }