Equivalence of Definitions of Palindrome

Proof
The proof proceeds by strong induction on the length of a string.

For all $n \in \N$, let $\map P n$ be the proposition:
 * Every palindrome $S_n$ of length $n$ is a palindrome by definition $1$ it been generated by definition $2$.

Basis for the Induction
$\map P 0$ is the case:
 * Every palindrome $S_0$ of length $0$ is a palindrome by definition $1$ it been generated by definition $2$.

By definition $2$ of a palindrome:
 * $(1): \quad$ The null string $\epsilon$ is a palindrome.

This is the only string of length $0$.

$\epsilon$ is seen vacuously to be a palindrome by definition $1$.

Thus $\map P 0$ is seen to hold.

$\map P 1$ is the case:
 * Every palindrome $S_1$ of length $n$ is a palindrome by definition $1$ it been generated by definition $2$.

Let $a$ be an arbitrary symbol.

By definition $2$ of a palindrome:
 * $(2): \quad$ If $a$ is a symbol, then the string $a$ is a palindrome.

But the string $a$ consisting just of symbol $a$ reads the same backwards as forwards.

Thus $\map P 1$ is seen to hold.

We use $\map P 0$ and $\map P 1$ together to form the basis for the induction.

Induction Hypothesis
Now it needs to be shown that if $\map P j$ is true, for all $j$ such that $0 \le j \le k$, then it logically follows that $\map P {k + 1}$ is true.

This is the induction hypothesis:
 * Every palindrome $S_k$ of length $k$ is a palindrome by definition $1$ it been generated by definition $2$.

from which it is to be shown that:
 * Every palindrome $S_{k + 1}$ of length $k + 1$ is a palindrome by definition $1$ it been generated by definition $2$.

Induction Step
This is the induction step:

So $\map P k \implies \map P {k + 1}$ and the result follows by the Second Principle of Mathematical Induction.

Therefore:
 * For all $n \in \N$: every palindrome $S_n$ of length $n$ is a palindrome by definition $1$ it been generated by definition $2$.