FormalConjecturesTest/Util/Linters/CategoryLinter.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
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
15 declarations, 3 contain sorry, 0 declared as axioms
Imports (1)
- def
CategoryLinter.fooline 29 source - theorem
CategoryLinter.test_theoremA highly non-trivial theorem line 38 sourceSource documentation
A highly non-trivial theorem
theorem test_theorem : 1 + 1 = 2 := by …
- theorem
CategoryLinter.test_theorem_with_hypothesisA highly non-trivial theorem with a helpful hypothesis line 48 sourceSource documentation
A highly non-trivial theorem with a helpful hypothesis
theorem test_theorem_with_hypothesis (_ : True) : 1 + 1 = 2 := by …
- theorem
CategoryLinter.test_theorem_with_hypothesesA highly non-trivial theorem with two helpful hypotheses line 58 sourceSource documentation
A highly non-trivial theorem with two helpful hypotheses
theorem test_theorem_with_hypotheses (_ : True) (_ : False): 1 + 1 = 2 := by …
- lemma
CategoryLinter.test_lemmaline 68 source - example
CategoryLinter.(example at line 77)line 77 source - theorem
CategoryLinter.test_theorem_with_docstringA highly non-trivial theorem with a helpful hypothesis line 88 sourceSource documentation
A highly non-trivial theorem with a helpful hypothesis
theorem test_theorem_with_docstring : 1 + 1 = 2 := by …
- lemma
CategoryLinter.test_lemma_sorry_freeline 98 source - example
CategoryLinter.(example at line 106)line 106 source - theorem
CategoryLinter.test_private_sorry_freeline 116 source - theorem
CategoryLinter.test_theorem_matchA highly non-trivial theorem proved by cases line 127 sourceSource documentation
A highly non-trivial theorem proved by cases
theorem test_theorem_match : ∀ l : List Nat, l = l | [] => rfl | _ :: _ => rfl #guard_msgs in @[category research open]
- theorem
CategoryLinter.test_2sorry line 133 sourcedepends on sorry (Lean reported 3 error(s) in this file) what this means
Statement uses:
Eq,Nat,HAdd.hAdd,OfNat.ofNatProof uses:
sorryAx,Lean.Name,Bool.false,Lean.Name.num,Lean.Name.str,Lean.Name.anonymous6 instances, coercions and auxiliary constants left out.
Tactic trace: 1 steps
Open to load the checked before-and-after goal states.
- theorem
CategoryLinter.test_1sorry line 139 sourcedepends on sorry (Lean reported 3 error(s) in this file) what this means
Statement uses:
Eq,Nat,HAdd.hAdd,OfNat.ofNatProof uses:
sorryAx,Lean.Name,Bool.false,Lean.Name.num,Lean.Name.str,Lean.Name.anonymous6 instances, coercions and auxiliary constants left out.
Tactic trace: 1 steps
Open to load the checked before-and-after goal states.
- theorem
CategoryLinter.test_3sorry line 145 sourcedepends on sorry (Lean reported 3 error(s) in this file) what this means
Statement uses:
Eq,Nat,HAdd.hAdd,OfNat.ofNatProof uses:
sorryAx,Lean.Name,Bool.false,Lean.Name.num,Lean.Name.str,Lean.Name.anonymous6 instances, coercions and auxiliary constants left out.
Tactic trace: 1 steps
Open to load the checked before-and-after goal states.
- theorem
CategoryLinter.test_duplicate_categoryline 155 source