Prove that if $E \cap F \neq \emptyset \rightarrow E \cup F$ is connected.
I am trying to do it by contradiction.
Assume that $E \cup F$ is disconnected. Therefore, $\exists U, V$ open, such that
$$[(E \cup F) \cap U] \cap [(E \cup F) \cap V] = \emptyset$$ $$[(E \cup F) \cap U] \cup [(E \cup F) \cap V] = E\cup F$$ $$(E \cup F) \cap U \neq \emptyset$$ $$(E \cup F) \cap V \neq \emptyset$$
I am stuck with how to proceed.
If you correct your first line to ${}=\emptyset$ then you can proceed as follows: you also have $(E\cap U)\cap(E\cap V)=\emptyset$ and $(E\cap U)\cup(E\cap V)=E$, and similarly for $F$. As $E$ is connected you can deduce something about $E\cap U$ and $E\cap V$.