The high level idea of the proof is that, we construct a hypergraph from a subset without any length formula_22 arithmetic progression, then use graph removal lemma to show that this graph cannot have too many hyperedges, which in turn shows that the original subset cannot be too big.