Please check if I miss anything!
Suppose that $(k_n\mid n\in\mathbb N)$ is a decreasing sequence in $\mathbb N$ (i.e. if $n\leq m$, then $k_n\geq k_m$). Then $(k_n\mid n\in\mathbb N)$ is eventually constant (i.e. there exists $N\in\mathbb N$ such that if $m\geq N$ then $k_m=k_N$).
Proof:
Assume the contrary: $(k_n\mid n\in\mathbb N)$ is not eventually constant. Thus, for all $n\in\mathbb N$, there exists $m\in \mathbb N$ such that $n<m$ and $k_n>k_m$. Let $C(n)=\min\{m\in\mathbb N\mid n<m$ and $k_n>k_m\}$. Define $C^{n}$ as $\underbrace{C \circ \dots \circ C}_{n\:\text{times}}$.
We generate sequence $(h_n\mid n\in\mathbb N)$ as follows: $h_0=k_0$ and $h_n=k_{C^{n}(0)}$. It is easy to prove that $(h_n\mid n\in\mathbb N)$ is strictly decreasing. Thus there is an infinite number of elements from sequence $(h_n\mid n\in\mathbb N)$ that are less than $h_0$. This contradicts the fact that the set $\{m\in\mathbb N\mid m<h_0\}$ is finite.
Thus $(k_n\mid n\in\mathbb N)$ is eventually constant. $\tag*{$\blacksquare$}$
Here is a simpler proof.
Let $A = \{ k_n : n\in\mathbb N\} \subseteq \mathbb N$. Then $A$ is nonempty and so has a minimum element, $k_N$. Then, for $m \ge N$, we have $k_N \ge k_m$ because the sequence is decreasing and $k_m \ge k_N$ because $k_N$ is the minimum value. Therefore, $k_m = k_N$ for all $m \ge N$.