Say we have a nonnegative $n \times m$ matrix $\mathbf{A}$, and we compute a $k$-rank SVD (singular value decomposition) so that $\mathbf{A} = \mathbf{U}\mathbf{\Sigma}\mathbf{V}^\top$. Then, $\mathbf{U}$ is $n \times k$, $\mathbf{\Sigma}$ is $k \times k$ and $\mathbf{V}^\top$ is $k \times m$.
We can then write the $k$-dimensional projection of $\mathbf{A}$ as $\mathbf{A}_{proj} = \mathbf{U}\mathbf{\Sigma}$.
How can we show that the $2$-norm of the $i$th row vector in $\mathbf{A}_{proj}$ is bounded by the $2$-norm of the corresponding $i$th row vector in $\mathbf{A}$? That is, can we show the following?
$$\|\mathbf{A}_{{proj}_i}\|_2 \leq \|\mathbf{A}_i\|_2$$
I am able to see these results empirically, but am unsure how to go about proving it. Thanks in advance for any help!