To show that two sets $A$ and $B$ contain the same elements, i.e. that $A=B$, it is often convenient to show the equivalent statement $A\subseteq B$ and $B \subseteq A$, so let us do that.
Let $O$ be the union of all the sets in $\mathscr F$. By properties 1 and 3, $\Omega \in \mathscr F$ and, thus, $\Omega \subseteq O$, which proves the first inclusion.
For the second inclusion, it suffices to show that if $A_i\in \Omega, \forall i \in \mathcal I$, for some index set $\mathcal I$, then $\cup_i A_i \subseteq \Omega$. This is so because $O$ is defined as the union of elements of $\mathscr F$ which are all subsets of $\Omega$ by definition.
I find it illuminating to think about what it would mean if this was not true. Namely, there would exist a point in the union that is not in $\Omega$. But if such a point is in the union, it must, by definition, also be in one of the sets in the union, and all of these are subsets of $\Omega$ so this cannot be. We conclude $O\subseteq \Omega$.
Some notes on this proof:
In the comments @whuber expressed the view that the second inclusion is immediate from the definition of a union of subsets. I don't disagree with this view, but have often found the above thought exercise useful and it does, as far as I can tell, constitute a valid proof of the assertion so I leave it in.