LWG4464 [alg.merge] Wording tweaks

Fixes US 163-262 (C++26 CD).

Author: burblebee

source/algorithms.tex

@@ -10101,12 +10101,12 @@
   \tcode{proj2} be \tcode{identity\{\}},
   for the overloads with no parameters by those names;
 \item
-  $E(\tcode{e1}, \tcode{e1})$ be \tcode{bool(invoke(comp, invoke(proj2, e2), invoke(proj1, e1)))};
+  $E$ be \tcode{bool(invoke(comp, invoke(proj2, e2), invoke(proj1, e1)))};
 \item
   $K$ be the smallest integer in \range{0}{last1 - first1}
   such that for the element \tcode{e1} in the position \tcode{first1 + $K$}
   there are at least $N - K$ elements \tcode{e2}
-  in \range{first2}{last2} for which $E(\tcode{e1}, \tcode{e1})$ holds,
+  in \range{first2}{last2} for which $E$ holds,
   and be equal to \tcode{last1 - first1}
   if no such integer exists.
   \begin{note}
@@ -10131,7 +10131,7 @@
 If \tcode{e1} is an element of \range{first1}{last1} and
 \tcode{e2} of \range{first2}{last2},
 \tcode{e2} is copied into the output range before \tcode{e1}
-if and only if $E(\tcode{e1}, \tcode{e1})$ is \tcode{true}.
+if and only if $E$ is \tcode{true}.
 
 \pnum
 \returns