How would you formally justify this? Or is it just notationally obvious? (As opposed to 'conceptually' obvious, which is never an excuse in mathematics.)
Edit: For some $c \geq 0$
$\text{sup} \ \{ c \cdot f(x): \text{some domain of $x$} \}$ = $c \cdot \text{sup} \ \{f(x): \text{same domain of $x$} \}$
To illustrate what I mean, consider $\text{sup}\ \{ 1, 5\} = 5$ which however conceptually obvious can still be proven.
Suppose otherwise, if $\text{sup}\ \{ 1, 5\} < 5$, then the supremum is less than an element of set. A contradiction. If $\text{sup}\ \{1, 5\} > 5$, then there exists the number 5 less than the supremum which nonetheless is an upper bound of the set. A contradiction.
But I'm not sure how I would 'prove' my original assertion.