Completeness theorem in propositional logic implies the compactness theorem

Question

I would like some help with proving the compactness theorem in propositional logic using the completeness theorem, that is: Given that every wff is a tautology iff it is a theorem, prove that a set $\Sigma$ of wff is satisfiable iff it is finitely satisfiable.