The soundness theorem is a famous theorem in logic that goes like this:
If $\Gamma \vdash \phi$, then $\Gamma \vDash \phi$.
It's supposed to follow readily from Lemma 3.2.3 from Moerdijk/Van Oosten's Sets, Models and Proofs:
Lemma 3.2.3 Suppose $T$ is an $L$-labelled proof tree with unmarked assumptions $\phi_1,\ldots,\phi_n$ and conclusion $\psi$; let $u_1,\ldots,u_k$ be a list of all varialbes that are free in at least one of $\phi_1,\ldots,\phi_n,\psi$. Then for every $L$-structure $M$ and any $k$-tuple $m_1,\ldots,m_k$ of elements of $M$, we have:
If for all $i, 1\le i\le n, M \models\phi_i[m_1/u_1,\ldots,m_k/u_k]$, then $M \models\psi[m_1/u_1,\ldots,m_k/u_k]$.
Can anyone explain to me why that is?
The soundness property of a logical calculus means that if a formula $\phi$ is derivable form the set $\Gamma$ of premises (or assumptions) :
then $\phi$ is a logical consequence of the premises in $\Gamma$, according to the semantics suitable for that calculus :
The application of the said Lemma is roughly this; let $\Gamma = \{ \varphi_1, \ldots, \varphi_n \}$ the set of assumptions and let $\psi$ the conclusion of the derivation (the proof tree) [see page 81 of your lecture notes].
We assume that, for any structure $M$ "suitable" for the language $L$ [see page 42 of your lecture notes], the premises are all true (or satisfied) in $M$ : $M \vDash \varphi_i$ [see page 43].
The rules of the calculus are defined exactly in a way to be sound, i.e. such that if the premises of the rules are true (in a strucutre $M$) so is the conclusion [this is the gist of the proof of the Lemma, page 88, where some rules are treated in detail].
Thus, any step in the derivation "transfer" truth from the previous one and thus, if all the premises in $\Gamma$ are true in $M$, so is the conclusion $\psi$ : $M \vDash \psi$.
But this is exactly the definition of logical consequence : $\Gamma \vDash \psi$ [see page 50].
See e.g :