Lean verification record

Checked Artifact: Rice's Theorem (mathlib)

Proof Atlas collected build, no-sorry, axiom, and clean-source evidence directly from the pinned upstream declaration.

Verification result

The recorded Lean checks passed

Build replaypassed with retained transcript
Unfinished stepsNone found
Source identityPinned commit and file recorded
Dependency profileAxiom closure recorded

Reproducibility details

What the checker recorded

Declaration checked: ComputablePred.rice
Module: Mathlib.Computability.Halting
Source file checked: Mathlib/Computability/Halting.lean
Package commit: 5e932f97dd25535344f80f9dd8da3aab83df0fe6
Build transcript: passed · retained with this record
Unfinished proof steps: None found by the recorded no-sorry scan
Axiom closure: Classical.choice, Quot.sound, propext
Collection provenance: Clean source state recorded

ProofAtlas record

What has been checked

Upstream indexedPinned source bytes verified locally

Locally reproducedExact upstream declaration replayed

Reviewed pageCurrent public presentation reviewed

Accepted Atlas resultNot recorded for the preferred artifact

Mathlib is the source of the theorem; the local Lean replay and page review are separate.

Evidence boundary

Exact formal statement only

This target indexes Mathlib's implication form of Rice's theorem. For a semantic property C of partial functions, assume program-code membership through eval is computable. If one partial-recursive f belongs to C, then every partial-recursive g belongs to C. It is specific to Mathlib's partial-function and program-code model and does not classify arbitrary syntactic code properties or all noncomputable semantic properties.

This checker record does not establish novelty, transfer a historical acceptance decision, or authorize publication.