Mathlib v4.30 source proposition Nat.Prime.pred_pos

Identifier: F:ml430-nat-prime-pred-pos-4e67ac4c
Proof route: kernel-lean
External status: proved
Axiom footprint: Empty

Recorded description

The proposition declared as `Nat.Prime.pred_pos` in the pinned Mathlib v4.30 source.

Formal statement

∀ {p : ℕ}, Nat.Prime p → 0 < p.pred

Dependencies

The graph shows direct ledger edges. Follow a node to open its artifact page.

4 direct dependencies 0 direct dependents

Evidence

kernel-Nat.prime_pred_pos

Kind: kernel-term
Status: checked

Supports: ∀ {p : ℕ}, Nat.Prime p → 0 < p.pred

Checker command

test "$(cargo run -q -p axeyum-lean-kernel --example nat_theorem_inventory -- prime_pred_pos 2>/dev/null | grep -Ec '^Nat\.prime_pred_pos[[:space:]]')" -ge 1

Evidence notes

`build_nat_prelude` admits `Nat.prime_pred_pos` through the trusted `Kernel::add_declaration` gate, which re-checks the proof term against the stated type, so producing this row at all is a machine-checked proof. `nat_theorem_inventory` exits non-zero for a name that does not exist, and the `grep -c` count (tested `-ge 1`, not piped into `grep -q`) requires the admitted declaration to actually be printed. Primality is spelled inline (`2 ≤ p ∧ ∀ d, d ∣ p → d = 1 ∨ d = p`) rather than through a named `Nat.Prime` predicate. `2 ≤ p` transports along `p = succ (pred p)` (`pos_implies_succ_pred`, `finite.rs`, applied to a prime's own positivity witness) to `2 ≤ succ (pred p)`, then `le_of_succ_le_succ` strips one `succ`, leaving `1 ≤ pred p`, defeq to the goal `0 < pred p`.

footprint-Nat.prime_pred_pos

Kind: exhaustive-enumeration
Status: checked

Supports: axiom_footprint: [] -- the Nat prelude's trusted surface is empty

Checker command

cargo run -q -p axeyum-lean-kernel --example nat_axiom_inventory -- --require-axiom-free nat

Evidence notes

`nat_axiom_inventory --require-axiom-free nat` enumerates the built Nat environment and exits non-zero unless it admits no Axiom, Opaque or Quotient declaration (measured: axiom=0 opaque=0 quotient=0). A theorem cannot depend on a trusted declaration the environment does not contain, so an empty trusted surface bounds every individual theorem's footprint by [].

Provenance

{
  "date": "2026-08-18",
  "established_by": "not established in this ledger",
  "source": "statement-only extraction of `Nat.Prime.pred_pos` from Mathlib v4.30.0; no proof value was exposed",
  "prior_art": [
    {
      "who": "the Mathlib contributors",
      "what": "the theorem declaration `Nat.Prime.pred_pos`",
      "where": "mathlib4 commit c5ea00351c28e24afc9f0f84379aa41082b1188f (v4.30.0)",
      "year": 2026,
      "attribution": "the proposition was read from the pinned statement-only inventory; the proof term and tactic trace were not consulted"
    }
  ]
}