[temp.constr.order] Clarify description of subsumption and ordering by constraints.

Author: zygoloid

source/templates.tex

@@ -1882,16 +1882,16 @@
 \end{example}%
 }.
 %
-Then, $P$ \defnx{subsumes}{constraint!subsumption} $Q$ if and only if
-\begin{itemize}
-\item for every disjunctive clause $P_i$ in the disjunctive normal
+Then, $P$ \defnx{subsumes}{constraint!subsumption} $Q$ if and only if,
+for every disjunctive clause $P_i$ in the disjunctive normal
 form of $P$, $P_i$ subsumes every conjunctive clause $Q_j$
 in the conjuctive normal form of $Q$, where
 
+\begin{itemize}
 \item
 a disjunctive clause $P_i$ subsumes a conjunctive clause $Q_j$ if and only
 if there exists an atomic constraint $P_{ia}$ in $P_i$ for which there exists
-an atomic constraint $Q_{jb}$ in $Q_j$ such that $P_{ia}$ subsumes $Q_{jb}$.
+an atomic constraint $Q_{jb}$ in $Q_j$ such that $P_{ia}$ subsumes $Q_{jb}$, and
 
 \item an atomic constraint $A$ subsumes another atomic constraint
 $B$ if and only if the $A$ and $B$ are identical using the
@@ -1926,9 +1926,9 @@
 %%% into the constraints before comparing them, otherwise they will be
 %%% referring to unrelated template parameters.
 \pnum
-When two declarations \tcode{D1} and \tcode{D2} are
-partially ordered by their associated constraints~(\ref{temp.constr.decl}),
-\tcode{D1} is \defn{at least as constrained} as \tcode{D2} if
+A declaration \tcode{D1} is
+\defn{at least as constrained} as
+a declaration \tcode{D2} if
 
 \begin{itemize}
 \item \tcode{D1} and \tcode{D2} are both constrained declarations and