Given $a,b,c\geq 0$, then this following is true $$\min(a,b+c)\leq \min(a,b)+ \min(a,c)$$
I tried to prove it by using some cases, i.e.
Case 1: if $\,\,a\leq b \leq c\,\,$ and $\,\,a\leq c \leq b,\,\,$ it's clear that
\begin{align*}
\min(a,b+c)&\leq \min(a,b)+\min(a,c)\\
a &\leq a+a=2a
\end{align*}
Case 2: if $\,\,b\leq a\leq c\,\,$ and $\,\,c\leq a \leq b,\,\,$ we have
\begin{align*}
\min(a,b+c)&\leq \min(a,b)+\min(a,c)\\
a &\leq b+a
\end{align*}
and
\begin{align*}
\min(a,b+c)&\leq \min(a,b)+\min(a,c)\\
a &\leq a+c
\end{align*}
Case 3: $\,\,c\leq b\leq a\,\,$ and $\,\,b\leq c \leq a,\,\,$
I am not sure about this case, because although $a$ is the biggest from $b$ and $c$, it can satisfies $a\leq b+c$ or $b+c\leq a$. Is the third case must be done with two cases again? i.e for $a\leq b+c$ and $b+c\leq a$?
or there is another way to prove $\min(a,b+c)\leq \min(a,b)+ \min(a,c)$ for $a,b,c\geq 0$?
Any help will be appreciated. Thanks.