Commit 2026-10-28 01:55 7e722502
View on Github →feat(Data/Nat/Prime): add divisibility lemma and golf proof (#45283)
Add Nat.exists_prime_dvd_and_dvd_div: if m ∣ n and m ≠ n, then there is a prime number p ∣ n such that m ∣ n / p. This is used to golf the proof of orderOf_eq_of_pow_and_pow_div_prime and to remove the unnecessary hypothesis hn : 0 < n. Two callers are updated accordingly. The file OrderOfElement.lean is now under 1500 lines, so the longFile linter override is removed.
I used Claude to help me debug the initial CI failure (longFile linter being the culprit) and I also incorporated some golfing suggestions made by it.