Limits of finite sequences aren't terribly interesting. That said, finite sequences do qualify as nets, and the usual definition of the limit of a net gives you that the limit is the last element of the sequence. See also the answers to Can a sequence be called convergent/divergent if it has finite number of terms? and linked question(s).
Under these definitions, the sequence $\mathbf X:(1,2,3,4)\mapsto(6,7,8,9)$ converges to $\mathbf x=9$, while the sequence $\mathbf X' :(1,2,3)\mapsto(6,7,8)$ converges to $8$. So IF we're willing to call this $\mathbf X'$ a subsequence of $\mathbf X$, then you're right, a subsequence of a finite sequence need not converge to the same limit!
There is no contradiction with the theorem stated in Bartle's textbook, because (I assume) that book only considers infinite sequences.
All that said, the theorem can be generalized to arbitrary nets, including finite sequences! There are two slightly different ways to do it.
(1) If a net converges to a point $\mathbf x$, then any cofinal subnet also converges to $\mathbf x$. This theorem doesn't apply to our example, as $\mathbf X'$ is not a subnet of $\mathbf X$, because its index set $(1,2,3)$ is not cofinal in $(1,2,3,4)$, because it doesn't include the maximum index $4$.
(2) Even better, if a net converges to a point $\mathbf x$, then any reindexed subnet also converges to $\mathbf x$. This is more like what Bartle is doing, considering a subsequence of $(x_n)$ to be a reindexing like $(x_{n_k})$. If you go back to the definition of a subsequence, you'll see a condition like "the reindexing sequence $(n_k)$ must eventually be $\geq M$ for all $M$". In the context of a finite index set for $(x_n)$, that means that $n_k$ must include the maximum index. Again, in our case that's $4$.
Given (1) and (2), we may find it more convenient to define subsequences of finite sequences such that $\mathbf X'$ is not a subsequence of $\mathbf X$ at all!