By continuous first order logic I mean first order logic but replace truth values taking on 0 or 1 with the compact set [0,1].
Is continuous first order logic strong enough to make statements about all subsets? Example: every bounded non-empty subset has a supremum.
Is there some trick where this can be done?
Continuous logic (as described in http://math.univ-lyon1.fr/~begnac/articles/mtfms.pdf, for example) does not allow you to make statements about arbitrary subsets. There are (at least) two ways that this is true:
You mentioned order-completeness in the question. Often you can't even put an ordering into the language (you would have to put the distance to the ordering as a predicate instead, and then uniform continuity requirements will impose some compatibility between the ordering and the metric).
On the other hand, metric completeness (every Cauchy sequence converges) is definitely not expressible in continuous logic. Indeed, if you have any metric structure $\mathcal{M}$ where the underlying metric space $(M, d)$ is incomplete*, and let $\overline{\mathcal{M}}$ be the (unique, up to isomorphism) extension of $\mathcal{M}$ based on the metric completion of $(M, d)$, then $\mathcal{M} \preceq \overline{\mathcal{M}}$.
*: Usually the term "metric structure" is reserved for structures based on complete metric spaces, so I'm abusing the name a little bit here. I hope the meaning is clear enough.