prime_twohundredthirtynine
plain-language theorem explainer
239 is prime. Number theorists applying Möbius inversion or related arithmetic functions in the Recognition Science module would cite this fact for calculations involving 239. The verification proceeds by a direct computational check via the native_decide tactic.
Claim. $239$ is a prime number.
background
The module supplies lightweight wrappers around Mathlib arithmetic functions, starting with the Möbius function μ. The local setting keeps statements basic before layering Dirichlet algebra or inversion results. Prime is the transparent alias for the standard primality predicate on natural numbers, drawn from the Basic module.
proof idea
The proof is a one-line wrapper that applies the native_decide tactic to evaluate the Prime predicate on 239.
why it matters
This supplies a concrete primality instance inside the arithmetic functions module that supports Möbius footholds and related number-theoretic tools. No downstream theorems reference it yet. It sits alongside the framework's phi-ladder and eight-tick structures without direct linkage to the forcing chain or RCL.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.