There are several solutions to the proof $P(A\cup B)=P(A)\cup P(B)\rightarrow A\subseteq B\vee A\supseteq B$ already, however I would like to see if mine is correct:
Proof through contradiction:
Let us assume $A\nsubseteq B\vee A\nsupseteq B$ such that $a\in A\wedge a\notin B, b\in B\wedge b\notin A$.
However, this is impossible as $a,b\in P(A\cup B)=a,b\in P(A)\vee a,b\in P(B)$ and therefore, $P(A\cup B)=P(A)\cup P(B)\rightarrow A\subseteq B\vee A\supseteq B \blacksquare$
Does this proof work? If not, Why?