What problem does it solve?
Lean 4 proofs that merely compile are often fragile, unreadable, and impossible to maintain across Mathlib upgrades. This Skill provides a complete methodology for designing definitions and theorem statements first, building compiling sorry skeletons, and filling proofs with structured, linter-verified tactics.
Core Features & Use Cases
- Top-down design workflow: Design definitions and their API lemmas (ext, simp, coercion, injectivity) before proving anything, using sorry skeletons that compile so work can be parallelized across contributors or agents.
- Structured proof style: Enforces calc blocks, focused goal dots, honest show statements, have/suffices skeletons, and correct simp discipline (unsqueezed terminal simp, squeezed non-terminal simp).
- Mechanical verification: Gates unproved obligations via Lean.collectAxioms instead of grep, configures project-appropriate linter profiles in CI, and guides writing custom @[env_linter] checks for project-specific conventions.
- Use Case: A team formalizing a cryptographic protocol in Lean 4 uses this Skill to state all theorems as compiling sorry stubs, assign stubs to individual contributors, and enforce a CI gate that fails on any sorryAx or unexpected axiom.
Quick Start
Ask the assistant to help write or review a Lean 4 proof using Mathlib conventions, starting from a compiling sorry skeleton of the target theorem.