Union of Connected Sets with Non-Empty Intersections is Connected/Corollary/Proof 2

Proof
Let $\ds H = B \cup \bigcup \AA$

that $H$ is not connected.

That is, that $H$ is disconnected.

We have that:
 * $\forall C \in \AA: B \cap C \ne \O$

Thus:
 * $\exists x \in H: x \in B \cap C$

From the definition of disconnected, there exist separated sets $U, V$ whose union is $H$.

So:
 * $\forall s \in S: s \in U \lor s \in V$

$s \in V$.

Then $H, V$ serve as separated sets whose union is a cover for $\family {A_\alpha}_{\alpha \mathop \in I}$.

Note that the disconnection is valid as:
 * $\exists x \in U \cap \family {A_\alpha}_{\alpha \mathop \in I}$

As $s \in V$, it follows that the $\family {A_\alpha}_{\alpha \mathop \in I}$ are disconnected.

From this contradiction it follows that $s \notin V$.

Hence $s \in U$.

This holds for arbitrary $s \in H$.

Hence:
 * $H \subseteq U$

But as $U$ and $V$ are separated, $U \cap H$ is empty, as required per the definition of a disconnected set.

This contradicts our deduction that $H \subseteq U$.

Hence the sets $U, V$ are not separated sets in $H$.

Thus $H$ is connected in $T$.