Definition: A nonzero element $a$ of a commutative ring $R$ is said to divide an element $b\in R$ (notation: $a\mid b$) if there exists $x\in R$ such that $ax= b$.
Let $R$ be a commutative ring with identity and $f\in R[x]$. Then $c\in R$ is a root of $f$ if and only if $x - c$ divides $f$.
Sketch of proof: We have $f(x) = q(x)(x - c)+f(c)$ by Corollary 6.3. If $x - c\mid f(x)$, then $h(x)(x - c) = f(x) = q(x)(x - c) +f(c)$ with $h\in R[x]$, whence $(h(x) - q(x))(x - c) = f(c)$. Since $R$ is commutative, Corollary 5.6 (with $\varphi = 1_R$) implies $f(c) = (h(c) - q(c))(c - c) = 0$. Commutativity is not required for the converse; use Corollary 6.3.
Author claims that commutativity is not needed to show: $c\in R$ is root of $f$$\implies$$x-c$ divides $f$. If we don’t assume $R$ to be commutative, then $R[x]$ may not be commutative as well. And the notion of divides don’t make sense. Am I missing some subtlety?
Author given proof of, $x-c$ divides $f$ $\implies$ $c\in R$ is root of $f$, is not optimised (see here). I have not written corollary 6.3 because it is in the first sentence of proof.