« first day (2893 days earlier)      last day (736 days later) » 

ConGovDeIn
ConGovDeIn
16:01
@ThomasKlimpel Well, I think you were right. Let’s say this statement: If two strings of terms of length $n$ are identical then each term $t_i$ and $t’_i$ are identical to one another
The statement is true for $n=1$, i.e., if $t$ and $t’$ are equivalent then obviously they are one and same term.
Let’s do induction: *assume that two strings of terms of length $n-1$ are term by term identical if the whole string is identical to the other*

Induction: adding the terms $t_n$ and $t’_n$ to the lists results in the same string, and all the terms except $t_n$ and $t’_n$ are identical (by hypothesis) therefore, $t_n$ must be identical to $t’_n$ else strings will have a *different* last symbol.
Is it fine? It seems to me this time.

« first day (2893 days earlier)      last day (736 days later) »