is_m_number_of_dvd
If n is an M-number and d divides n, then d is an M-number.
Statement
theorem is_m_number_of_dvd {n d : ℕ} (h : is_m_number n) (hd : d ∣ n) : is_m_number d- Source
- arXiv:2610.37512, Section 6
- Verified
- 29 Oct 2026
- Axioms
propext- Built on 1
- is_m_numberA natural number n is an M-number if for every prime p, p^p does not divide n.
Read back from the Lean
For all natural numbers $n$ and $d$, if $n$ is an m-number and $d$ divides $n$, then $d$ is an m-number.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
To show that any divisor d of an M-number n is also an M-number, we check the definition: for any prime p, p^p cannot divide d. If p^p were to divide d, then by transitivity of divisibility it would also divide n, contradicting the assumption that n is an M-number.
d is an M-number.
By definition, d is an M-number if for every prime p, p^p does not divide d. Given a prime p and assuming for contradiction that p^p ∣ d, transitivity of divisibility (dvd_trans) combined with d ∣ n implies that p^p ∣ n. This directly contradicts the assumption that n is an M-number.
uses
dvd_transtheorem is_m_number_of_dvd {n d : ℕ} (h : is_m_number n) (hd : d ∣ n) : is_m_number d := fun p hp hpd => h p hp (dvd_trans hpd hd)
dvd_trans- Divisibility is transitive: if a ∣ b and b ∣ c, then a ∣ c.
Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
/-- Any divisor of an M-number is also an M-number. -/theorem is_m_number_of_dvd {n d : ℕ} (h : is_m_number n) (hd : d ∣ n) : is_m_number d := fun p hp hpd => h p hp (dvd_trans hpd hd)