Triangle embedding lemma for regular pairs

If the three pairs among vertex sets $A,B,C$ are $\epsilon$-regular and each has density at least $2\epsilon$, where $0<\epsilon <1/2$, then the graph contains a triangle with one vertex in each set.