AnswerLinterTest.lean`

Explanation legend Lean4 Domain Explanation Language (L4DEL)

L4DEL explanations are a separate layer. They do not change the Lean source. Intuition is explanatory prose; numbered items are a reading path; sources link the wording back to evidence.

L4DEL: Lean4 Domain Explanation Language

Annotation provenance. This overlay contains 10 curated AI-written annotations and 7190 mechanical source-derived annotations. They have not been human-reviewed as explanations; treat them as unverified and not mathematical authority. Retained generation history: The 71 original curated annotations were produced in a Claude Sonnet 5.5 session at medium effort; Claude Opus 5.5 is recorded in that session as the advisor model, not the direct author. The bulk source-derived expansion was generated mechanically from pinned source comments by tooling developed in a GPT-5.6 Sol session at ultra reasoning; GPT-5.6 Sol did not originate the quoted source prose. On 2026-10-17 the mechanically generated source-comment annotations of the Formal Conjectures, Carleson, FLT, PFR, CompFiles, Mathematics in Lean and Theorem Proving in Lean overlays were regenerated by the same generator after three corrections made in a Claude Sonnet 5.5 session: titles no longer cut a sentence inside mathematics or end on a dangling word, workflow markers are removed from the quoted prose, and declaration names follow the scanner's namespace resolution. The boilerplate step line was dropped, and comments that were only a row of dashes no longer yield annotations. No new prose was written and no human review is claimed.

Credit: The upstream authors and contributors retain credit for the project and mathematics. lean4-explainer only renders their pinned source and adds the separately disclosed explanation layer.

Project sources: Pinned project documentation, Formal Conjectures paper, arXiv v1

4 declarations, 3 contain sorry, 0 declared as axioms

Tests for the answer linter

This file contains test cases for the AnswerLinter, verifying that it correctly flags theorems with early arguments when answer(sorry) is the left-hand side of an iff, and does not flag theorems without answer(sorry) or without early arguments.

Imports (2)

theorem AnswerLinter.flagged_by_linter An exampe of what we want to lint against sorry line 46 source
Source documentation
An exampe of what we want to lint against

depends on sorry what this means
Statement uses: True, Nat, Iff, Eq, HAdd.hAdd, OfNat.ofNat
Proof uses: sorryAx, Lean.Name, Bool.false, Lean.Name.num, Lean.Name.str, Lean.Name.anonymous
6 instances, coercions and auxiliary constants left out.

Tactic trace: 1 steps
Open to load the checked before-and-after goal states.
```
theorem flagged_by_linter (h : True) (b : Nat) : answer(sorry) ↔ 1 + 1 = 2 := by
…
```
theorem AnswerLinter.not_flagged_no_answer_sorry An non-exampe: we want don't to lint against this case line 51 source
Source documentation
An non-exampe: we want don't to lint against this case

no axioms what this means
Statement uses: True, Nat, Eq, HAdd.hAdd, OfNat.ofNat
Proof uses: Eq.refl
6 instances, coercions and auxiliary constants left out.

Tactic trace: 1 steps
Open to load the checked before-and-after goal states.
```
theorem not_flagged_no_answer_sorry (_ : True) (_ : Nat) : 1 + 1 = 2 := by
…
```
theorem AnswerLinter.not_flagged_no_arguments An non-exampe: we want don't to lint against this case sorry line 56 source
Source documentation
An non-exampe: we want don't to lint against this case

depends on sorry what this means
Statement uses: Iff, True, Eq, Nat, HAdd.hAdd, OfNat.ofNat
Proof uses: sorryAx, Lean.Name, Bool.false, Lean.Name.num, Lean.Name.str, Lean.Name.anonymous
6 instances, coercions and auxiliary constants left out.

Tactic trace: 1 steps
Open to load the checked before-and-after goal states.
```
theorem not_flagged_no_arguments : answer(sorry) ↔ 1 + 1 = 2 := by
…
```
theorem AnswerLinter.not_flagged_non_prop_answer An non-exampe: here answer(sorry) is not a Prop, and not the entire left hand side of the iff sorry line 62 source
Source documentation
An non-exampe: here answer(sorry) is not a Prop, and not the entire left hand side of the iff.

depends on sorry what this means
Statement uses: True, Nat, Iff, Eq, sorryAx, Lean.Name, Bool.false, Lean.Name.num, Lean.Name.str, Lean.Name.anonymous, OfNat.ofNat, HAdd.hAdd
6 instances, coercions and auxiliary constants left out.

Tactic trace: 1 steps
Open to load the checked before-and-after goal states.
```
theorem not_flagged_non_prop_answer (h : True) (b : Nat) : answer(sorry) = 2 ↔ 1 + 1 = 2 := by
…
```