Proof verification: powers of a group element of finite order are distinct I'm finally attempting to conquer D&F (3rd ed) and I want to build good proof habits and fix mistakes early on. Here is the exercise (Ch. 1 ex. 32) and the following is my proof.
Prove that for $x \in G$, where $G$ is a group and $x$ has finite order $n$, all of $1, x, x^2, \ldots, x^{n-1}$ are distinct and deduce that $|x| \leq |G|$.
Proof. Let $a,b \in [0,n-1]\cap \mathbb{N}$ such that $x^a=x^b$. Then $1 = x^ax^{-a}=x^bx^{-a} = x^{b-a}$. Since $1 \leq a \lt n$ and $1 \leq b \lt n$, $b-a\lt n$. So $x^{b-a}=1 \implies b-a=0$ and $a=b$. Since $a$ and $b$ were arbitrarily chosen, $x^c$ is distinct for all $c \in [0,n-1] \cap \mathbb{N}$. We know $x^c\in G$ for all $c \in [0, n-1]\cap \mathbb{N}$ by definition of group closure, and $|[0,n-1]\cap \mathbb{N}|=n$. So $G$ contains at least $n$ elements, and $|x|\leq |G|$.
Is this a convincing proof? I feel like there might be some circular logic, and perhaps not enough detail. I was thinking of establishing that the elements form a cyclic group, and show this group is a subgroup of $G$. Any tips or comments would be greatly appreciated.
 A: Almost.
You assert $b-a < n$. I think you want to assume $b \ge a$ (without loss of generality) from the start, to make $b-a$ nonnegative as well. Otherwise you need to handle the case when it's not.
A: Logically, everything looks good, except for @Ethan's point.  If you are worried about circularity, make sure you understand why your statement “$x^{b-a} = 1 \implies b-a =0$” is true.
I think notations like 

Let $a,b\in[0,n-1] \cap \mathbb{N}$ such that $x^a = x^b$.

are a bit cumbersome.  Personally, I would rewrite the first sentence as 

Let $a$ and $b$ be integers such that $0 \leq a \leq b \leq n-1$ and $x^a = a^b$.

Or perhaps even

Suppose $x^a = x^b$ for some integers $a$ and $b$ with $0 \leq a\leq b\leq n-1$.

In essence, you want to show $x^a = x^b \implies a=b$, so writing the first sentence that way aligns the paragraph with that logical statement.
Having a higher density of symbols does not make a more mathematically sophisticated argument.
A: Your proof is perfectly fine. Good Job!
One remark: One prof of me uses the following convention: $[0:n] := [0, n] \cap \mathbb N$.
This is an elegant way to write such "discrete intervals" and makes proofs more readable. Just an idea of me. Maybe you want to use it :) 
A: I got confused when you brought $c$ into the mix.
Here is your proof with a lot of the argument removed. I don't think I have removed too much and it may be easier to follow.
Suppose the powers of $x$ are not all distinct. 
Then there exist $a,b \in [0,n-1]\cap \mathbb{N}$ such that $b>a$ and $x^b=x^a$.
This implies that $0\lt b-a<n$, and $1=x^ax^{-a}=x^bx^{-a} = x^{b-a}$.
Since the order of $x$ is $n$, $x^{b-a}=1$ implies $n\, |\, b-a$.
This is a contradiction, since no number greater than $0$ and less than $n$ can be divisible by $n$.
So the original supposition, that the powers of $x$ are not all distinct, leads to a contradiction and must therefore be false.
