Is an NP-hardness proof of an NP-hard problem considered a contribution?
There are venues that are interested by elegant proofs of existing results, see for instance the Symposium on Simplicity in Algorithms.

So yes, in some cases an elegant proof can be considered as a contribution, especially if it offers new insights.