Support of a codeword in a binary linear code proof
If a codeword of weight 3 existed whose support was a subset of a codeword of weight 4, then you must have a codeword of weight 1 (since the difference of codewords is also a code word).

A codeword of weight 1 has one 1 and the rest zeros. Now, can you show that these don't exist?