fill-sorry

Community

Iteratively prove Lean lemmas.

Authorjeffrey-dot-li
Version1.0.0
Installs0

System Documentation

What problem does it solve?

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.

Core Features & Use Cases

  • Iterative Proof Generation: Gradually proves sorry'd lemmas by applying tactics and checking the goal state.
  • LSP Integration: Leverages Lean's Language Server Protocol for real-time feedback and goal analysis.
  • Use Case: When faced with a complex mathematical lemma in Lean that contains a sorry placeholder, this Skill can systematically work towards a full proof.

Quick Start

Use the fill-sorry skill to prove the lemma at the current cursor position.

Dependency Matrix

Required Modules

None required

Components

references

💻 Claude Code Installation

Recommended: Let Claude install automatically. Simply copy and paste the text below to Claude Code.

Please help me install this Skill:
Name: fill-sorry
Download link: https://github.com/jeffrey-dot-li/lean-homology/archive/main.zip#fill-sorry

Please download this .zip file, extract it, and install it in the .claude/skills/ directory.
View Source Repository

Agent Skills Search Helper

Install a tiny helper to your Agent, search and equip skill from 223,000+ vetted skills library on demand.