-Assume otherwise. Then there are some pairs $\mathsf{(t,u)}$ that violate this lemma. \r
-Take a specific $\mathsf{(t,u)}$ such that $\mathsf{s_u}$ is minimized and \r
-$\mathsf{s_t}$ is maximized for this choice of $\mathsf{s_u}$.\r
+Assume that there are some pairs of messages $\mathsf{(t,u)}$ that violate this lemma. \r
+Take a specific $\mathsf{(t,u)}$ such that $\mathsf{s_u}$ is minimized, and \r
+$\mathsf{s_t}$ is maximized for this choice of $\mathsf{s_u}$. We will show that $\mathsf{C}$\r
+cannot receive both $\mathsf{t}$ and $\mathsf{u}$ without throwing an error.\r