 Section formula for a grid neighbourhood

Let $A_j\subseteq [k{]}^{d-1}$ be the section of $A\subseteq [k{]}^d$ with one coordinate fixed at $j$, and put $A_0=A_{k+1}=\varnothing$. The corresponding section of its closed graph neighbourhood isAfter coordinate compression, the three sets on the right are nested initial simplicial segments. Their union therefore has the largest of their three cardinalities, which is no larger than the original union.