No more commas

cplusplus · tkoeppe · Nov 8, 2023 · Nov 9, 2023 · Nov 9, 2023 · c8e01c1c534da6b408b5a7d7dc05f619eae62798
commit c8e01c1c534da6b408b5a7d7dc05f619eae62798
diff --git a/source/expressions.tex b/source/expressions.tex
@@ -550,14 +550,14 @@
 \pnum
 An expression $E$ can be
 \defnx{implicitly converted}{conversion!implicit} to a type \tcode{T} if and only if the
-declaration \tcode{T t=$E$;} is well-formed, for some invented
+declaration \tcode{T t=$E$;} is well-formed for some invented
 variable \tcode{t}\iref{dcl.init}.

 \pnum
 Certain language constructs require that an expression be converted to a Boolean
 value. An expression $E$ appearing in such a context is said to be
 \defnx{contextually converted to \tcode{bool}}{conversion!contextual to \tcode{bool}} and is well-formed if and only if
-the declaration \tcode{\keyword{bool} t($E$);} is well-formed, for some invented
+the declaration \tcode{\keyword{bool} t($E$);} is well-formed for some invented
 variable \tcode{t}\iref{dcl.init}.

 \pnum