reformatting

src/plta/PandP.lagda

@@ -854,6 +854,7 @@ When our evaluator returns a term `N`, it will either give evidence that
 `N` is a value or indicate that it ran out of gas.
 \begin{code}
 data Finished (N : Term) : Set where
+
    done :
        Value N
        ----------
@@ -1214,7 +1215,8 @@ Show that if a term is well-typed it is not stuck,
 and that any descendant of a well-typed term is also well-typed.
 Combine these results to show `wttdgs`. 
 
-<div class="hidden">
+Answer:
+
 If a term is well-typed, it does not get stuck.
 \begin{code}
 unstuck : ∀ {M A}
@@ -1246,7 +1248,6 @@ wttdgs′ : ∀ {M N A}
   → ¬ (Stuck N)
 wttdgs′ ⊢M M⟶*N  =  unstuck (preserve* ⊢M M⟶*N)
 \end{code}
-</div>
 
 
 #### Exercise: `progress-preservation`