I have proved the following lemma:
If is a prime number and are subsets of and , , then when .
With that lemma I'm trying to prove the following:
If and if for all . Let us now define , for .
By repeating process with the lemma I need to conclude:
But I have some difficulties proving that... I could have proved only the inequality: