Gödel's completeness theorem:  A (first order) sentence $\varphi$ is provable from the axioms $\Sigma$ iff  it holds in every model of $\Sigma$:  $$ \Sigma \vdash \varphi \Leftrightarrow \Sigma \vDash \varphi$$