The completeness theorem of first-order logic states:
If $\Phi\models\phi$, then $\Phi\vdash\phi$.
Assume that I have a calculus $\vdash$ in mind for which I want to prove this completeness theorem. What properties should this calculus have?
Can you sketch the idea how to prove the completeness theorem?