diff --git a/docs/algebra.tex b/docs/algebra.tex
index dc5dfad27eb2011bd0a28a0838f11621c43a2ad1..dc8bdead2a4ecf03b35cda890b1889420fca2241 100644
--- a/docs/algebra.tex
+++ b/docs/algebra.tex
@@ -90,10 +90,9 @@ Completeness is necessary to take fixed-points.
 \begin{thm}[Banach's fixed-point]
 \label{thm:banach}
 Given an inhabited COFE $\ofe$ and a contractive function $f : \ofe \to \ofe$, there exists a unique fixed-point $\fixp_T f$ such that $f(\fixp_T f) = \fixp_T f$.
+Moreover, this theorem also holds if $f$ is just non-expansive, and $f^k$ is contractive for an arbitrary $k$.
 \end{thm}
 
-The above theorem also holds if $f^k$ is contractive for an arbitrary $k$.
-
 \begin{thm}[America and Rutten~\cite{America-Rutten:JCSS89,birkedal:metric-space}]
 \label{thm:america_rutten}
 Let $1$ be the discrete COFE on the unit type: $1 \eqdef \Delta \{ () \}$.
diff --git a/docs/program-logic.tex b/docs/program-logic.tex
index de5055c1d1a8b110d2967a5f00f5ea8ee6636289..7e7f2e000434ef5f18b616831edf1fdea6bb9105 100644
--- a/docs/program-logic.tex
+++ b/docs/program-logic.tex
@@ -36,7 +36,7 @@ Furthermore, since the $\iFunc_i$ are locally contractive, so is $\textdom{ResF}
 
 Now we can write down the recursive domain equation:
 \[ \iPreProp \cong \UPred(\textdom{ResF}(\iPreProp, \iPreProp)) \]
-Here, $\iPreProp$ is a COFE defined as the fixed-point of a locally contractive bifunctor, which exists by \thmref{thm:america_rutten}.
+Here, $\iPreProp$ is a COFE defined as the fixed-point of a locally contractive bifunctor, which exists and is unique up to isomorphism by \thmref{thm:america_rutten}.
 We do not need to consider how the object $\iPreProp$ is constructed, we only need the isomorphism, given by:
 \begin{align*}
   \Res &\eqdef \textdom{ResF}(\iPreProp, \iPreProp) \\