superprime_onehundrednine
plain-language theorem explainer
The declaration verifies that both 109 and 29 are prime numbers. It would be cited when confirming base cases for prime-indexed constructions inside arithmetic-function developments. The proof reduces to a single native_decide tactic that evaluates the primality predicates by direct computation.
Claim. Both $109$ and $29$ are prime numbers.
background
The module supplies lightweight wrappers around Mathlib arithmetic functions, beginning with the Möbius function. The local Prime abbreviation is the transparent alias for Nat.Prime. Upstream results include the structural is theorems from OptionAEmpiricalProgram, SimplicialLedger, and MockThetaPhantom, which supply the surrounding hypothesis-discharge pattern used across the repository.
proof idea
The proof is a one-line wrapper that applies the native_decide tactic to the conjunction of the two primality statements.
why it matters
This supplies a concrete prime-pair verification required for superprime indexing in the arithmetic-functions layer. It fills a base-case slot in the NumberTheory.Primes hierarchy without feeding any downstream theorems. No open scaffolding or paper proposition is directly referenced.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.