[guided]Fix a deterministic horizon $T\in\mathbb{N}$. We introduce an auxiliary starting state at time $-T$ whose only purpose is to test what the stored update maps would do to a stationary chain. Let $(S,2^S,\pi)$ be the finite probability space with mass function $\pi$, and define $(\Omega_T,\mathcal{F}_T,\mathbb{P}_T)$ by $\Omega_T=\Omega\times S$, $\mathcal{F}_T=\mathcal{F}\otimes 2^S$, and $\mathbb{P}_T=\mathbb{P}\otimes\pi$. Let $q_T:\Omega_T\to\Omega$ be the projection $q_T(\omega,z)=\omega$; the original maps, $\tau$, and $Y$ are henceforth their pullbacks along $q_T$. Define
\begin{align*}
Z_T:\Omega_T \to S
\end{align*}
by $Z_T(\omega,z)=z$. Then $Z_T$ is independent of $F_{-T},F_{-T+1},\dots,F_{-1}$ and satisfies
\begin{align*}
\mathbb{P}_T(Z_T=x)=\pi(x)
\end{align*}
for every $x\in S$. The product extension does not change the law of the stored maps or of the CFTP output; it only supplies an independent stationary initial state.
Define
\begin{align*}
X_{T,k}:\Omega_T \to S
\end{align*}
for $k=-T,-T+1,\dots,0$ as follows. Set $X_{T,-T}=Z_T$, and for each $k=-T,\dots,-1$ set
\begin{align*}
X_{T,k+1}=F_k(X_{T,k}).
\end{align*}
Thus $X_{T,0}=\Phi_{-T,0}(Z_T)$.
We now verify that this auxiliary process has transition matrix $P$. Fix $k\in\{-T,\dots,-1\}$. The random variable $X_{T,k}$ depends only on $Z_T,F_{-T},\dots,F_{k-1}$, while the map $F_k$ is independent of all these random objects. Hence $X_{T,k}$ is independent of $F_k$. For every $y\in S$, partitioning over the possible values $x\in S$ of $X_{T,k}$ gives
\begin{align*}
\mathbb{P}_T(X_{T,k+1}=y)=\sum_{x\in S}\mathbb{P}_T(X_{T,k}=x)\mathbb{P}_T(F_k(x)=y).
\end{align*}
The hypothesis on the random maps says exactly that
\begin{align*}
\mathbb{P}_T(F_k(x)=y)=P(x,y)
\end{align*}
for every $x,y\in S$.
Now use induction. At time $-T$, the law of $X_{T,-T}$ is $\pi$ by construction. If $X_{T,k}$ has law $\pi$, then the preceding formula gives
\begin{align*}
\mathbb{P}_T(X_{T,k+1}=y)=\sum_{x\in S}\pi(x)P(x,y).
\end{align*}
The stationarity condition for $\pi$ says that this last sum is $\pi(y)$. Therefore $X_{T,k+1}$ also has law $\pi$. Induction from $k=-T$ to $k=0$ proves
\begin{align*}
\mathbb{P}_T(X_{T,0}=y)=\pi(y)
\end{align*}
for every $y\in S$.[/guided]