palindromic_prime_sevenhundredeightyseven
plain-language theorem explainer
787 is asserted to be prime. Number theorists working with arithmetic functions or Möbius inversion may cite this concrete case for examples. The proof is a one-line computational check via native decision that confirms the primality predicate holds.
Claim. The integer 787 is a prime number.
background
The module supplies lightweight wrappers around Mathlib arithmetic functions, beginning with the Möbius function μ. Local conventions keep statements minimal ahead of Dirichlet algebra and inversion layers. The Prime predicate is the transparent alias for Nat.Prime supplied by the Basic submodule.
proof idea
The proof is a one-line term wrapper that applies native_decide to discharge the primality claim directly.
why it matters
This supplies a specific prime instance inside the arithmetic functions file. It supports sibling facts such as mobius_prime and mobius_apply_of_squarefree by providing a verified prime argument. No parent theorems depend on it, and it remains isolated from Recognition Science forcing chains or constants.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.