If you're already comfortable with ultrafilters, the new proof of Elek and Szegedy ([on the arxiv][1]) derives this (and the more general simplex removal lemma for hypergraphs) from Lebesgue's "points of density" theorem. It's not an easy read, but it is a nice proof.


  [1]: http://arxiv.org/abs/0810.4062