Complex sentence: \\ mathsf_0 proves that the least upper bound has a binary expansion, and because of the 2i in the construction this binary expansion is unique (it cannot end with infinitely many 1's).
Split into simpler sentences: \\ mathsf_0 proves that the least upper bound has a binary expansion. We may thus assume that the binary expansion is unique (it cannot end with infinitely many 1's).