According to comments, it seems that here several questions arise from a single statement.
Why is the probability of a tie zero? (assuming independent continuous variables).
In a continuous random variable individual results have zero probability. Only measurable sets (for example intervals) have non zero probability.
The probability of a tie is the probability of the second random variable yielding the same value than the first one. That would be the probability of a single value and therefore it would be zero.
If random variables were discrete, some individual values would have non zero probability and therefore the probability of a tie would be greather than zero.
The requeriment of the two random variables being independent is needed because two non independent continuous variables could have discrete conditional probabilities. For example, if both variables yielded always the same result they would be continuous but ties would have probability 1.
If continuous random variables have 0 probability for individual points, how does an ordering makes sense?
In continuous random variables, individual points have zero probability, but intervals have probabilities larger than zero.
For example, for uniform random variable in [0, 1], any point (for example 0.4, 0.45 or 0.5) has zero probability but the interval [0.4, 0.5] has 10% probability.
Furthermore, two one-side unbounded intervals $(-\infty,x)$ and $(x,+\infty)$ have probabilities different than zero and that probabilities sum 1, that is, the probability of the whole real line $(-\infty,+\infty)$.
When two iid continuous variables $X_1$ and $X_2$ are considered, $X_1=X_2$ has probability zero, as seen as a realization of the second variable it's just a point. However $X_1<X_2$ nad $X_1>X_2$ have probabilities larger than zero and they sum up to 1.
How this makes all orderings equally likely?
The source cited by the OP sees it as rather evident.
The idea behind the symmetry reasoning is that there is no reason to think that $X_1<X_2$ is more likely than $X_1>X_2$ or vice-versa, because we could even change the names of $X_1$ and $X_2$ without changing anything.
This can be generalised to ordering of $n$ iid variables.
The book uses the fact that orderings with ties have probability zero, the only cases with probability different than zero are orderings without ties, all of them with the same probability. Now you just need to count how many of such orderings exist (permutations of n elements) and divide 1 between the number of orderings to get the probability of each one.