I need some help.
Quoted from Elliott Mendelson's book, "Real numbers will have to be defined in such a way that, not only are the ordinary arithmetic operations of addition, subtraction, multiplication, and division (by a nonzero number) performable, but also such that every distance of a point on the line from the origin corresponds to some real number, and, vice versa, every real number corresponds to some distance. (Positive real numbers are to correspond to distances from the origin of points to the right of the origin, and negative real numbers to distances from the origin of points to the left of the origin.)"
The author then gives the definition of a cut in an ordered field, as an ordered pair (A,B) of subsets A and B of F such that, 1) A and B are nonempty; 2) A ∪ B = F; 3) x∈A and y∈B implies x < y.
Then the author gave the definition that an ordered field is complete when there are no gaps, that is for every cut (A,B), either A has a maximum element or B has a minimum element.
My question is, by creating a complete ordered field, how is it that I'll be able to do the following, "every distance of a point on the line from the origin corresponds to some real number, and, vice versa, every real number corresponds to some distance ..." as mentioned by the author using the complete ordered field?