How I can prove this inequality in $\mathbb{R}^n$?
$$\langle x,y \rangle (\lVert x \rVert + \lVert y \rVert) \leq \lVert x \rVert \lVert y \rVert \lVert x+y \rVert.$$
Intuitively it is true, because it means that
$$\cos\theta\leq\dfrac{\lVert x+y\rVert}{\lVert x\rVert+\lVert y\rVert},$$
where $\theta$ is the angle between $x$ and $y$, but I can prove this algebraically.
$\langle x,y\rangle(\lVert x\rVert+\lVert y\rVert)\leq\lVert x\rVert\lVert y\rVert\lVert x+y\rVert\;.$
Proof:
$\langle x,y\rangle(\lVert x\rVert+\lVert y\rVert)=\lVert x\rVert\langle x,y\rangle+\lVert y\rVert\langle x,y\rangle\le$
$\underset{\overbrace{\text{Cauchy–Schwarz inequality}}}{\le}\lVert x\rVert^2\lVert y\rVert+\lVert y\rVert\langle x,y\rangle=$
$\underset{\overbrace{\lVert x\rVert^2=\langle x,x\rangle}}{=}\lVert y\rVert\left(\langle x,x\rangle+\langle x,y\rangle\right)=$
$\underset{\overbrace{\text{Bilinearity of scalar product}}}{=}\lVert y\rVert\langle x,x+y\rangle\le$
$\underset{\overbrace{\text{Cauchy–Schwarz inequality}}}{\le}\lVert x\rVert\lVert y\rVert\lVert x+y\rVert\;.$