prime_fourhundredseventynine
plain-language theorem explainer
479 is established as a prime number. Number theorists working with Möbius functions or prime-based arithmetic calculations would cite this concrete instance. The proof is a single native decision step that computationally verifies the predicate.
Claim. $479$ is a prime number.
background
The module supplies lightweight wrappers around Mathlib arithmetic functions, beginning with the Möbius function μ. Statements remain minimal to support later Dirichlet inversion layers. The Prime predicate is the standard natural-number primality relation, kept as a transparent alias.
proof idea
Term-mode proof consisting of one native_decide application that directly evaluates the primality predicate for this fixed integer.
why it matters
The declaration supplies a verified prime fact inside the arithmetic-functions module, supporting potential Möbius applications on primes as indicated by sibling declarations. It forms part of the number-theory scaffolding without direct reference to the forcing chain, RCL, or phi-ladder. No downstream uses are recorded.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.