Technical Lean evidence record
Checked Artifact: Rice's Theorem (mathlib)
Proof Atlas collected build, no-sorry, axiom, and clean-source evidence directly from the pinned upstream declaration.
ProofAtlas record
What has been checked
These states distinguish upstream identity, local reproduction, review, and Atlas acceptance. This page is part of the public, read-only Mathlib landmark collection.
Mechanical evidence
- Declaration checked
ComputablePred.rice- Module
Mathlib.Computability.Halting- Source file checked
Mathlib/Computability/Halting.lean- Package commit
5e932f97dd25535344f80f9dd8da3aab83df0fe6- Build
- passed · transcript retained
- Unfinished proof steps
- None found by the recorded no-sorry scan
- Axiom closure
- Classical.choice, Quot.sound, propext
- Clean collection provenance
- Recorded
Evidence boundary
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 is evidence for the exact formal statement only. It does not establish novelty, transfer a historical acceptance decision, or authorize publication.