[guided]We now explain why links in an order complex break into interval pieces. The vertices of $K=\Delta(\bar P)$ are the elements of $\bar P$, and the faces are finite chains. Hence a face
\begin{align*}
F=\{x_1,\dots,x_k\}, \qquad x_1<\cdots <x_k,
\end{align*}
cuts the poset into the intervals
\begin{align*}
(\hat{0},x_1),\ (x_1,x_2),\ \dots,\ (x_k,\hat{1}).
\end{align*}
To make the notation uniform, define $x_0:=\hat{0}$ and $x_{k+1}:=\hat{1}$, and write
\begin{align*}
I_j=(x_j,x_{j+1})
\end{align*}
for $0\le j\le k$.
A face $G$ lies in $\operatorname{link}_K F$ exactly when $G$ is disjoint from $F$ and $F\cup G$ is a face of $K$. Since faces of $K$ are chains, this means that every element of $G$ must be comparable with every element of $F$. Once the chain $x_1<\cdots <x_k$ is fixed, any element of $G$ has a unique position: it lies below $x_1$, above $x_k$, or between exactly one adjacent pair $x_j<x_{j+1}$. Thus $G$ decomposes uniquely as
\begin{align*}
G=G_0\cup G_1\cup\cdots\cup G_k,
\end{align*}
where $G_j$ is a chain in $I_j$.
Conversely, suppose we choose a face $G_j$ of $\Delta(I_j)$ for each $j$. This means that $G_j$ is a chain inside the interval $I_j$. Because every element of $I_j$ is less than every element of $I_m$ whenever $j<m$, the union
\begin{align*}
G_0\cup \{x_1\}\cup G_1\cup\cdots\cup \{x_k\}\cup G_k
\end{align*}
is a chain in $\bar P$. Therefore $G_0\cup\cdots\cup G_k$ is a face of the link of $F$. This two-sided construction is inverse on faces and preserves inclusions of faces, so it is a simplicial isomorphism
\begin{align*}
\operatorname{link}_{K}F \cong \Delta(I_0)*\Delta(I_1)*\cdots *\Delta(I_k).
\end{align*}
For $F=\varnothing$, the link of the empty face is the whole complex:
\begin{align*}
\operatorname{link}_{K}\varnothing=K=\Delta(\bar P)=\Delta((\hat{0},\hat{1})).
\end{align*}
This is the same interval decomposition with only the single interval $(\hat{0},\hat{1})$.[/guided]