Gro-Tsen is just defining x<n> recursively. "by induction" there doesn't mean "proof by induction".

Prove it for the base case (x<1> = x), then assume it works for n-1, and show it works for the nth case.