A proof of the extended Duval's conjecture (Q557916)

A word \(u\) is said to be bordered iff there exists a nonempty word \(r\), \(r\neq u\), which is both prefix and suffix of \(u\). There is given a short and elementary proof of the following stronger version of Duval's conjecture. Let \(u\) be an unbordered word, and \(v\) a word of length \(|u|-1\), such that \(v\) is not a prefix of \(u\). Then \(uv\) contains an unbordered word of length at least \(|u|+1\).