Reason: Initial publication: claims 1 and 2 read off from the definition of the operator norm, and the operation bounds verified pointwise.
Proof
Throughout, ∥⋅∥ denotes the norm of a vector of V and ∥⋅∥op the operator norm of a bounded linear operator on V. We use repeatedly the following fact: if x,y,c are real numbers with x≤y and 0≤c, then 0≤c(y−x)=cy−cx by the second order axiom of Ordered Field, so cx≤cy; we call this multiplying an inequality by a nonnegative number.
Claims 1 and 2. By Existence and Uniqueness of the Operator Norm the number ∥T∥op is the operator norm of T, so by that definition it is a bound for T and satisfies ∥T∥op≤C for every bound C for T. That it is a bound says precisely that 0≤∥T∥op and ∥T(u)∥≤∥T∥op∥u∥ for every u∈V, which is claim 1; the second property is claim 2.
Since 0≤∥S∥op and 0≤∥T∥op by claim 1, we get 0≤∥S∥op+∥T∥op, so this number is a bound for S+T; in particular S+T is bounded, and claim 2 applied to S+T gives ∥S+T∥op≤∥S∥op+∥T∥op.
Scalar multiple. For u∈V, by absolute homogeneity of the norm and claim 1, multiplying by the nonnegative number ∣λ∣,
∥(λT)(u)∥=∣λ∣∥T(u)∥≤∣λ∣∥T∥op∥u∥,
and 0≤∣λ∣∥T∥op, so this number is a bound for λT; hence λT is bounded and ∥λT∥op≤∣λ∣∥T∥op by claim 2.
For the reverse inequality, first suppose λ=0. Then ∥(λT)(u)∥=∣0∣∥T(u)∥=0=0⋅∥u∥ for every u, so 0 is a bound for λT and claim 2 gives ∥λT∥op≤0; with 0≤∥λT∥op from claim 1 and antisymmetry, ∥λT∥op=0=∣λ∣∥T∥op. Now suppose λ=0. Applying the inequality just proved to the scalar λ−1 and the bounded operator λT, and using λ−1(λT)=T, which holds because λ−1(λT(u))=(λ−1λ)T(u)=T(u) by the vector space axioms,
∥T∥op≤∣λ−1∣∥λT∥op.
Multiplying by the nonnegative number ∣λ∣ and using ∣λ∣∣λ−1∣=∣λλ−1∣=∣1∣=1, by claim 4 and claim 8 of Properties of Complex Conjugation and Modulus, gives ∣λ∣∥T∥op≤∥λT∥op. Antisymmetry now yields ∥λT∥op=∣λ∣∥T∥op.
Product. For u∈V, applying claim 1 to S at the vector T(u), and then multiplying ∥T(u)∥≤∥T∥op∥u∥ by the nonnegative number ∥S∥op,
∥(ST)(u)∥=S(T(u))≤∥S∥op∥T(u)∥≤∥S∥op∥T∥op∥u∥.
Since 0≤∥S∥op∥T∥op by claim 1 and the second order axiom, this number is a bound for ST; hence ST is bounded and claim 2 gives ∥ST∥op≤∥S∥op∥T∥op.