[guided]The purpose of this step is to justify that terms may be evaluated before or after passing to the reduced product. Fix $a_1,\dots,a_n \in \prod_{i \in I} M_i$. Let $\bigsqcup_{i \in I} M_i$ denote the disjoint union of the underlying sets of the structures $M_i$; this gives a single codomain for coordinatewise maps $b: I \to \bigsqcup_{i \in I} M_i$ whose $i$-th value lies in $M_i$. For an $L$-term $t(x_1,\dots,x_n)$, define its coordinatewise evaluation
\begin{align*}
t_a : I &\to \bigsqcup_{i \in I} M_i \\
i &\mapsto t^{M_i}((a_1)_i,\dots,(a_n)_i).
\end{align*}
This is an element of $\prod_{i \in I} M_i$, because for each $i \in I$ the value $t^{M_i}((a_1)_i,\dots,(a_n)_i)$ lies in $M_i$. We prove by induction on the construction of the term $t$ that
\begin{align*}
t^M([a_1]_{\mathcal F},\dots,[a_n]_{\mathcal F}) = [t_a]_{\mathcal F}.
\end{align*}
First suppose $t=x_j$ for some $j \in \{1,\dots,n\}$. The coordinatewise evaluation of $x_j$ is precisely the sequence $a_j$, since
\begin{align*}
t_a(i) = (a_j)_i
\end{align*}
for every $i \in I$. Therefore
\begin{align*}
t^M([a_1]_{\mathcal F},\dots,[a_n]_{\mathcal F})
=
[a_j]_{\mathcal F}
=
[t_a]_{\mathcal F}.
\end{align*}
Next suppose $t$ is a constant symbol $c$. In the reduced product, the interpretation of $c$ is defined as the equivalence class of the sequence
\begin{align*}
c_* : I &\to \bigsqcup_{i \in I} M_i \\
i &\mapsto c^{M_i}.
\end{align*}
The coordinatewise value $t_a$ is exactly this same sequence $c_*$. Hence
\begin{align*}
t^M = [c_*]_{\mathcal F} = [t_a]_{\mathcal F}.
\end{align*}
Finally suppose $t=f(s_1,\dots,s_m)$, where $f$ is an $m$-ary function symbol. The induction hypothesis applies to each smaller term $s_k$, so for every $k \in \{1,\dots,m\}$,
\begin{align*}
s_k^M([a_1]_{\mathcal F},\dots,[a_n]_{\mathcal F})
=
[(s_k)_a]_{\mathcal F},
\end{align*}
where
\begin{align*}
(s_k)_a : I &\to \bigsqcup_{i \in I} M_i \\
i &\mapsto s_k^{M_i}((a_1)_i,\dots,(a_n)_i).
\end{align*}
Now apply the definition of the reduced-product interpretation of the function symbol $f$. It says that $f^M$ acts on equivalence classes by applying $f^{M_i}$ at each coordinate. Thus
\begin{align*}
t^M([a_1]_{\mathcal F},\dots,[a_n]_{\mathcal F})
&=
f^M([(s_1)_a]_{\mathcal F},\dots,[(s_m)_a]_{\mathcal F}) \\
&=
[b]_{\mathcal F},
\end{align*}
where
\begin{align*}
b : I &\to \bigsqcup_{i \in I} M_i \\
i &\mapsto f^{M_i}((s_1)_a(i),\dots,(s_m)_a(i)).
\end{align*}
For each coordinate $i \in I$, substituting the definitions of the sequences $(s_k)_a$ gives
\begin{align*}
b_i
=
f^{M_i}\bigl(s_1^{M_i}((a_1)_i,\dots,(a_n)_i),\dots,s_m^{M_i}((a_1)_i,\dots,(a_n)_i)\bigr).
\end{align*}
This is exactly the recursive definition of the value of the term $f(s_1,\dots,s_m)$ in $M_i$, so
\begin{align*}
b_i = t^{M_i}((a_1)_i,\dots,(a_n)_i)=t_a(i)
\end{align*}
for every $i \in I$. Therefore $b=t_a$, and hence
\begin{align*}
t^M([a_1]_{\mathcal F},\dots,[a_n]_{\mathcal F}) = [t_a]_{\mathcal F}.
\end{align*}[/guided]