Suppose that $V= P \ \cup Q \ \cup R $. Leaving out the trivial case where one subspace contains the other one, we consider the following case:
$P-Q \neq \emptyset, Q-P \neq \emptyset,Q-R\neq \emptyset, R-Q\neq \emptyset,P-R\neq \emptyset, R-P\neq \emptyset $, i.e. each subspace contains elements, unavailable to the other ones.
We take $p \in P\setminus Q\cup R, q\in Q\setminus P\ \cup R$. Now, we consider the elements $p+q$ and $p+(-q)$. Evidently the two aforementioned elements can neither be in $P$ nor in $Q$ [ $\because $ if in $P$, $(p+q)+(-p)=q \in P$, contradiction. Similar argument for the other one] . Since, the union of the three subspaces make up the entire vector space, both of them must be in $R$. Now, $(p+q)+(p+(-q))=2p\in R$. As $R$ is a real subspace, $\frac{1}{2}(2p)=p\in R$, a contradiction.
Therefore, one of them must be $V$.
Is the proof correct?