1.1 --- a/doc-src/Nitpick/nitpick.tex	Mon Dec 07 12:21:15 2009 +0100
     1.2 +++ b/doc-src/Nitpick/nitpick.tex	Mon Dec 07 13:40:45 2009 +0100
     1.3 @@ -1517,15 +1517,13 @@
     1.4  \hbox{}\qquad Free variables: \nopagebreak \\
     1.5  \hbox{}\qquad\qquad $t = N~a_3~1~\Lambda~\Lambda$ \\
     1.6  \hbox{}\qquad\qquad $x = a_4$ \\[2\smallskipamount]
     1.7 -Hint: Maybe you forgot a type constraint?
     1.8  \postw
     1.9  
    1.10 -It's hard to see why this is a counterexample. The hint is of no help here. To
    1.11 -improve readability, we will restrict the theorem to \textit{nat}, so that we
    1.12 -don't need to look up the value of the $\textit{op}~{<}$ constant to find out
    1.13 -which element is smaller than the other. In addition, we will tell Nitpick to
    1.14 -display the value of $\textit{insort}~t~x$ using the \textit{eval} option. This
    1.15 -gives
    1.16 +It's hard to see why this is a counterexample. To improve readability, we will
    1.17 +restrict the theorem to \textit{nat}, so that we don't need to look up the value
    1.18 +of the $\textit{op}~{<}$ constant to find out which element is smaller than the
    1.19 +other. In addition, we will tell Nitpick to display the value of
    1.20 +$\textit{insort}~t~x$ using the \textit{eval} option. This gives
    1.21  
    1.22  \prew
    1.23  \textbf{theorem} \textit{wf\_insort\_nat}:\kern.4em ``$\textit{wf}~t\,\Longrightarrow\, \textit{wf}~(\textit{insort}~t~(x\Colon\textit{nat}))$'' \\