Fix the set X and the binary operation ∗. For n∈N let P(n) be the assertion: for every map a:[n]→X there is exactly one map σ:[n]→X satisfying the two displayed conditions of the statement for that n. Let A be the set of all n∈N for which P(n) holds. We show A=N by Principle of Induction for the Natural Numbers.
We use throughout the following facts about initial segments and the order on N: 1∈[n] for every n, [1]={1}, and [S(n)]=[n]∪{S(n)} with S(n)∈/[n], by claims 1, 2 and 3 of Basic Properties of Initial Segments of the Natural Numbers; and m<S(m) together with the transitivity of the order, by claims 5 and 1 of Properties of the Order on the Natural Numbers. In particular, if S(m)∈[n], that is S(m)≤n, then m<S(m)≤n gives m≤n, so m∈[n].
Base case. Let a:[1]→X. Since [1]={1}, a map σ:[1]→X is determined by the single value σ(1), and the first condition says exactly that this value is a1. The second condition is vacuous: if S(m)∈[1]={1} then S(m)=1, contradicting the requirement in the definition of the natural numbers that 1 is not a successor. Hence there is exactly one such σ, and 1∈A.
Induction step. Suppose n∈A, and let a:[S(n)]→X be given. Write a′ for the restriction of a to [n], which is defined because [n]⊆[S(n)]. By P(n) there is exactly one map σ′:[n]→X with σ′(1)=a1 and σ′(S(m))=σ′(m)∗aS(m) for every m with S(m)∈[n].
Existence. Since [S(n)]=[n]∪{S(n)} and S(n)∈/[n], there is a well-defined map σ:[S(n)]→X given by
σ(k)=σ′(k)(k∈[n]),σ(S(n))=σ′(n)∗aS(n),
where σ′(n) is defined because n∈[n]. As 1∈[n] we get σ(1)=σ′(1)=a1. Now let m∈N with S(m)∈[S(n)]. Then either S(m)∈[n] or S(m)=S(n). In the first case m∈[n] as noted above, so
σ(S(m))=σ′(S(m))=σ′(m)∗aS(m)=σ(m)∗aS(m).
In the second case m=n by the injectivity of S, and
σ(S(n))=σ′(n)∗aS(n)=σ(n)∗aS(n).
Thus σ satisfies both conditions for S(n).
Uniqueness. Let τ:[S(n)]→X also satisfy both conditions for S(n), and let τ′ be its restriction to [n]. Then τ′(1)=τ(1)=a1. If m satisfies S(m)∈[n], then also S(m)∈[S(n)] and m∈[n], so
τ′(S(m))=τ(S(m))=τ(m)∗aS(m)=τ′(m)∗aS(m).
Hence τ′ satisfies the two conditions for n, and the uniqueness part of P(n) gives τ′=σ′. Finally S(n)∈[S(n)] and
τ(S(n))=τ(n)∗aS(n)=τ′(n)∗aS(n)=σ′(n)∗aS(n)=σ(S(n)).
Since [S(n)]=[n]∪{S(n)}, we conclude τ=σ. Therefore P(S(n)) holds and S(n)∈A.
By the principle of induction, A=N, which is the assertion of the lemma.