prime_threehundredsixtyseven
plain-language theorem explainer
367 is established as prime. Number theorists working with arithmetic functions cite this concrete fact when handling small primes in Möbius calculations or related Dirichlet steps. The proof is a direct term that invokes native_decide for computational verification.
Claim. $367$ is a prime number.
background
The module supplies lightweight wrappers around Mathlib arithmetic functions, beginning with the Möbius function μ. Statements remain minimal until basic interfaces stabilize for later inversion work. The Prime predicate is the transparent alias for Nat.Prime. Upstream dependencies include interface structures from foundation and game-theory modules whose 'is' declarations serve as collision-free or tautological markers rather than substantive lemmas for this check.
proof idea
The proof is a one-line term that applies native_decide to the primality statement for 367.
why it matters
This supplies a verified small-prime fact inside the arithmetic-functions scaffolding. It supports downstream Möbius and big-Omega definitions even though no explicit used_by edges are recorded. The placement aligns with the number-theory layer that feeds the broader Recognition Science chain, though it touches none of the T5–T8 landmarks directly.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.