Prove specified sorry'd lemmas iteratively in Lean using LSP tools.
npx skills add https://github.com/jeffrey-dot-li/lean-homology --skill fill-sorry
Please help me install this Agent Skill. Skill: fill-sorry Source: https://github.com/jeffrey-dot-li/lean-homology/tree/main/.claude/skills/fill-sorry Command: npx skills add https://github.com/jeffrey-dot-li/lean-homology --skill fill-sorry
This Skill automates the process of proving lemmas in Lean, a theorem proving language, by iteratively applying tactics and using LSP tools to guide the proof.
sorry'd lemmas by applying tactics and checking the goal state.sorry placeholder, this Skill can systematically work towards a full proof.Use the fill-sorry skill to prove the lemma at the current cursor position.
High-intent search queries and answers about installing and using this skill.
Proving Lean lemmas iteratively involves applying tactics and analyzing the goal state to replace sorry placeholders. The process uses LSP tools for real-time feedback, systematically working towards a full formal verification proof.
Lean LSP integration provides real-time feedback and goal state analysis during tactic application. This enables systematic proof completion by iteratively checking goals until the formal verification lemma is fully proven.
Yes, a Lean environment with LSP support is required to prove lemmas iteratively. The process depends on Language Server Protocol tools to analyze goal states and apply tactics for automated formal verification proof completion.
Targeting specific Lean lemma statements for automated proof completion is supported by analyzing the goal state at the current cursor position. The process applies tactics iteratively to the specified sorry'd lemma to achieve formal verification.
Automated Lean tactic application for formal verification requires adherence to proof extraction principles for modularity. Complex mathematical lemmas need systematic iterative work, and the process depends entirely on a functional Lean LSP environment.
my04337Plan and pre-validate Lean 4 proof strategies before theorem proving.
r-irbeExtract formal Lean 4 requirements from informal documents with source traceability.
jrh13Automate HOL Light theorem proving with MCP tools for goal setting and tactic application.
jeffrey-dot-liGenerate Lean theorem and lemma skeletons with placeholder proofs.