بنقرة واحدة
refactor
Improve an existing working proof for structural clarity, succinctness, or reusability.
التثبيت باستخدام Codex أو Claude انسخ هذا Prompt والصقه في Codex أو Claude أو مساعد آخر ليراجع صفحة Skill ويثبّتها لك.
القائمة
Improve an existing working proof for structural clarity, succinctness, or reusability.
التثبيت باستخدام Codex أو Claude انسخ هذا Prompt والصقه في Codex أو Claude أو مساعد آخر ليراجع صفحة Skill ويثبّتها لك.
استنادا إلى تصنيف SOC المهني
Prove a specific sorry'd lemma iteratively using Lean LSP tools.
Improve Claude Code workflow by updating assistants.md, skills, memory, or CLAUDE.md.
Fix warnings line by line and bring code into compliance with Mathlib style standards.
Draft sorry'd theorem/lemma structure for a larger result from a proof sketch.
Fill a sorry one step at a time, directed by the user.
Read and discuss proofs, strategies, or math concepts without making any edits.
| name | refactor |
| description | Improve an existing working proof for structural clarity, succinctness, or reusability. |
Improve the structure of an existing working proof: extract lemmas, simplify proof flow, improve naming, add documentation.
Target: $ARGUMENTS
lean_goal at key positions to confirm what each tactic achieves.lean_diagnostic_messages severity="error".lemma. See the "decompose, then compose" principle in assistants.md.simp only [...], omega, decide, aesop, etc. where the result is stable and readable.have blocks, collapse unnecessary calc chains./-- ... -/ doc comments on theorems and key lemmas.simp only [...] over bare simp — more stable and explicit./clean for that.