[guided]The only non-mechanical part of the construction is proving that two arbitrary cells determine exactly one line. Let the two distinct points be
\begin{align*}
(r,c),(r',c') \in S \times S.
\end{align*}
If $r=r'$, then both points are in the row line $R_r$. Since the points are distinct, $c \neq c'$. They cannot share a column line. They also cannot share a symbol line $M_{k,a}$, because in the fixed row $r$ of the Latin square $L_k$, each symbol occurs exactly once. Equivalently, the map $S \to S$ given by $d \mapsto L_k(r,d)$ is bijective, so $L_k(r,c) \neq L_k(r,c')$. Hence the row line is the unique line through the two points.
If $c=c'$, the same argument with columns gives the unique line $K_c$. For every $k$, the map $S \to S$ given by $s \mapsto L_k(s,c)$ is bijective, so two different rows in the same column cannot have the same $L_k$-symbol.
Now suppose $r \neq r'$ and $c \neq c'$. A row line cannot contain both points, and a column line cannot contain both points. Therefore a common line, if it exists, must be one of the symbol lines. For a fixed $k$, the two points lie on the same $k$-symbol line precisely when
\begin{align*}
L_k(r,c)=L_k(r',c').
\end{align*}
First we prove uniqueness. Suppose two distinct indices $i$ and $j$ both worked. Then
\begin{align*}
L_i(r,c)&=L_i(r',c'), &
L_j(r,c)&=L_j(r',c').
\end{align*}
Thus the orthogonality map $S \times S \to S \times S$ given by $(s,d) \mapsto (L_i(s,d),L_j(s,d))$ would send the two distinct cells $(r,c)$ and $(r',c')$ to the same ordered pair. This contradicts the definition of orthogonality, which says that this map is bijective. Hence at most one symbol class can contain a common line through the two points.
It remains to prove existence. Fix the first point $(r,c)$ and look along row $r'$. For each Latin square $L_k$, the row map $S \to S$ given by $d \mapsto L_k(r',d)$ is bijective. Therefore there is a unique element $d_k \in S$ such that
\begin{align*}
L_k(r',d_k)=L_k(r,c).
\end{align*}
This means that $(r',d_k)$ is the unique point in row $r'$ lying on the same $k$-symbol line as $(r,c)$. Also define $d_\infty:=c$, which is the unique element of row $r'$ lying on the same column line as $(r,c)$.
We claim that
\begin{align*}
d_1,\dots,d_{n-1},d_\infty
\end{align*}
are pairwise distinct. If $d_i=d_j$ for $i \neq j$, then the two cells $(r,c)$ and $(r',d_i)$ have the same $L_i$-symbol and the same $L_j$-symbol. Orthogonality of $L_i$ and $L_j$ would force $(r,c)=(r',d_i)$, contradicting $r \neq r'$. If $d_k=d_\infty=c$, then $(r,c)$ and $(r',c)$ lie in the same column and have the same $L_k$-symbol. But in column $c$, the map $S \to S$ given by $s \mapsto L_k(s,c)$ is bijective, so two distinct rows cannot give the same symbol. This again contradicts $r \neq r'$.
There are $n$ elements listed and $|S|=n$, so they exhaust $S$. Since $c' \neq c=d_\infty$, the element $c'$ must equal exactly one of $d_1,\dots,d_{n-1}$. Thus there is a unique $k$ such that $c'=d_k$, and then
\begin{align*}
L_k(r',c')=L_k(r',d_k)=L_k(r,c).
\end{align*}
Therefore $(r,c)$ and $(r',c')$ lie on the symbol line $M_{k,L_k(r,c)}$. Combining existence and uniqueness, the two points determine exactly one line.[/guided]