diff --git a/docs/constructions.tex b/docs/constructions.tex
index 6f30b9712f7002ab6319da78ad3de0753f44d91e..e11c63bbf8395ca3d2a4ab8e454f9ea803733b16 100644
--- a/docs/constructions.tex
+++ b/docs/constructions.tex
@@ -32,7 +32,7 @@ We start by defining the COFE of \emph{step-indexed propositions}: For every ste
   X \nequiv{n} Y \eqdef{}& \All m \leq n. m \in X \Lra m \in Y
 \end{align*}
 Notice that with this notion of $\SProp$ is already hidden in the validity predicate $\mval_n$ of a CMRA:
-We could equivalently require every CRMA to define $\mval_{-}(-) : \monoid \nfn \SProp$, replacing \ruleref{cmra-valid-ne} and \ruleref{cmra-valid-mono}.
+We could equivalently require every CMRA to define $\mval_{-}(-) : \monoid \nfn \SProp$, replacing \ruleref{cmra-valid-ne} and \ruleref{cmra-valid-mono}.
 
 Now we can rewrite $\UPred(\monoid)$ as monotone step-indexed predicates over $\monoid$, where the definition of a ``monotone'' function here is a little funny.
 \begin{align*}