palindromic_prime_threehundredseventythree
plain-language theorem explainer
The declaration asserts that 373 is prime in the natural numbers. Number theorists using small verified primes inside arithmetic-function wrappers would cite the fact for concrete base cases. The proof reduces the claim to a single native_decide call that performs the primality check by direct computation.
Claim. $373$ is a prime number.
background
The module supplies lightweight wrappers around Mathlib arithmetic functions, beginning with the Möbius function μ. The local setting keeps statements minimal so that Dirichlet inversion and related algebra can be added later once interfaces stabilize. The Prime identifier is the module-local transparent alias for Nat.Prime.
proof idea
The proof is a one-line wrapper that applies native_decide to discharge the primality predicate for the concrete numeral 373.
why it matters
The result supplies a verified small-prime datum inside the arithmetic-functions module. It supports any later number-theoretic constructions that rely on explicit primes before heavier Dirichlet machinery is introduced. No downstream uses are recorded, and the declaration does not touch the Recognition Science forcing chain or constants.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.