Try this, which is not as slick as it might be.

Since $F_n\gt 0$, $0\lt x_n \lt 1$

Using the Fibonacci relationship $x_n=\cfrac {F_n}{F_n+F_{n-1}}=\cfrac 1{1+x_{n-1}}$

$$x_n-x_{n-1}=\cfrac 1{1+x_{n-1}}-\cfrac 1{1+x_{n-2}}=-\cfrac {x_{n-1}-x_{n-2}}{(1+x_{n-1})(1+x_{n-2})}$$

In the case that $x_{n-1}\gt x_{n-2}$ we have $x_n-x_{n-1}\lt 0$ and $$x_{n}-x_{n-1}\gt x_{n-2}-x_{n-1}; x_{n-1}\gt x_n\gt x_{n-2}$$

In the case that $x_{n-1}\lt x_{n-2}$ we have $x_{n-1}\lt x_{n}\lt x_{n-2}$.

We also have $|x_n-x_{n-1}|\lt|x_{n-1}- x_{n-2}|$ (we can prove $\lt \frac 12 |x_{n-1}- x_{n-2}|$ once we know the $x_i$ are all $\ge \frac 12$)

If the Fibonacci sequence is indexed so that the terms are $1,1,2,3,5\dots$ then $x_1=1, x_2=0.5 \dots$ and $x_1\gt x_2$ and we have $x_1\gt x_3\gt x_5\gt x_7 \dots \gt x_{2n+1} \gt x_{2n}$ and also $x_2\lt x_4\lt x_6\dots \lt x_{2n}\lt x_{2n-1}$.

The odd terms are decreasing and bounded below, the even terms are increasing and bounded above, and the absolute value of the difference between odd and even goes to zero. It follows tha the two sequences (odd and even) tend separately to a limit and that limit must be the same for both. This is a special case of a theorem on convergence of continued fractions.

Note this is done without identifying what the limit is (when dealing with general continued fractions, you don't know).