I encountered this problem when studying Uwe Schoning's Logic for Computer Scientists. At the moment, I simply don't seem to think the statement makes sense. What I've tried is to suppose that it is not the case that "either $F$ is unsatisfiable or that $G$ is a tautology (or both)", and see what happens. Well, this means that $F$ is satisfiable and $G$ is not a tautology. But this doesn't seem to give the contradiction that $\models (F \rightarrow G)$ doesn't hold. For instance, because $F \rightarrow G \equiv \neg{F} \lor G$, can't I just find $F$ and $G$ such that whenever $F$ is true, $G$ is true, and whenever $F$ is false, $G$ is false? This doesn't seem to require $F$ to be unsatisfiable or $G$ to be a tautology.
Or perhaps there is something I've missed. Many thanks to anyone who could offer a proof for the problem.
By the way, the follow-up question to this problem is to explain why the assumption that $F$ and $G$ share no common atomic formulas is necessary. I also don't really know how to explain this, seeing that I haven't made any headways in solving the previous problem. Appreciate any answer to this follow-up question as well.