Generalize graphs over their node content

Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
2026-06-24 16:02:49 -05:00
parent 9ab43b34ef
commit a721a8be8b
2 changed files with 47 additions and 24 deletions
--- a/lean/Spa/Language/Properties.lean
+++ b/lean/Spa/Language/Properties.lean
@@ -226,7 +226,7 @@ theorem Graph.wrap_predecessors_eq_nil (g : Graph) (idx : (Graph.wrap g).Index)
    (Graph.wrap g).predecessors idx = [] := by
  rw [Graph.wrap_inputs, List.mem_singleton] at h
  subst h
-  rw [Graph.predecessors, List.filter_eq_nil_iff]
+  rw [GGraph.predecessors, List.filter_eq_nil_iff]
  intro idx' _
  simpa using not_mem_edges_castAdd_link (g₂ := g ⤳ Graph.singleton []) 0 idx'