The idea of the proof: If there were such a formula of the language of \(F\), an easy application of the Diagonalization Lemma to its negation would result in the paradoxical sentence \(L\) (for “Liar”; see the Liar paradox)), such that: