Theorems / mh_sets_921469
Mathlib held-out
Sets · easy
theorem lg_target {p : ℕ} (hp : Nat.Prime p) : (p ^ 2).divisors = {p ^ 2, p, 1} := by- Mathlib declaration
- Nat.Prime.divisors_sq
- Held-out module
- Mathlib.Data.Finset.NatDivisors
- Banned modules (itself + downstream)
- 1
- Reference proof premises (reachable / held-out)
- 9 / 0
Traces
Each configuration's full record: what was retrieved, what the model wrote, what Lean said back.
No configuration has attempted this theorem yet.
Reference proof
Mathlib's own source for this declaration, shown for comparison. It may use lemmas the prover is not allowed to use.
lemma Nat.Prime.divisors_sq {p : ℕ} (hp : p.Prime) : (p ^ 2).divisors = {p ^ 2, p, 1} := by
simp [divisors_prime_pow hp, range_add_one]