Project Euler # 52 Permuted multiples in Python
For the umpteenth time, do not write

if not digits1 == digits2:
    return False
return True


Do write

return digits1 == digits2

The magic number 125000 must be explained. Preferably in the code, not in comments.
Seven levels of indentation should be immediately seen as a big bright red flag, style wise. At least fold it into the loop.
Seven levels of indentation should be immediately seen as a big bright red flag, algorithm wise. How would you approach a question asking for 16, rather than 6, multiples? As a side note, if you continue with PE, you have a chance to encounter it.
Expanding on the bullet above, please take my advice and study some math. This problem does have a nice solution. Ponder on the fact that \$142857 * 7 = 1000000 - 1\$. An Euler's generalization of Fermat's Little theorem is a must. PE is very fond of it.

And stop brute forcing.