I have a symmetric matrix $A$ and I have managed to show that all eigenvalues of $A$ lie in $[-c,c]$. I want to prove that the operator norm of $A$ is less than $c$ i.e. $||A||\leq c$.
I could prove that this norm is less than $c^2$ as follows :
From the hypothesis, we have that $cI-A\succeq 0$ and $cI+A\succeq 0$ since the hypothesis states that $-cx^Tx\leq x^TAx\leq cx^Tx$. Now $(cI-A)(cI+A)=(cI+A)(cI-A)=c^2I-A^2\succeq 0$.
So, $x^TA^2x\leq c^2 x^Tx\implies ||Ax||^2\leq c^2 ||x||^2$.
However I don't see how to get the bound of $c$.
Your $\preceq$s are backwards. The hypothesis implies that $cI-A$ and $cI+A$ are both positive semidefinite, not negative semidefinite. So their product is also positive semidefinite, and this gives you the inequality $x^T A^2 x \le c^2 x^T x$. Since $x^T A^2 x = x^T A^T A x = (Ax)^T (Ax) = \|Ax\|^2$, this implies $\|Ax\|^2 \le c^2 \|x\|^2$ as desired. (What you wrote seemed to have lost some squares.)
The conclusion $\|Ax\| \ge c^2 \|x|$ (or even $\|Ax\|^2 \ge c^2 \|x\|^2$ is clearly wrong, as you can see by taking $A$ to be the zero matrix.