path-tactics

RwEq proofs in Lean can be automated using path tactics like path_auto, path_simp, and path_normalize from the ComputationalPaths library. path_auto discharges goals dominated by groupoid laws and cancellations; path_simp handles cleanup in larger proofs; path_normalize resolves definitional mismatches between sides.

Use path_auto for standalone RwEq goals involving groupoid laws, associativity, and cancellations. Use path_simp for minor cleanup steps inside larger proofs that are near completion, or path_normalize when proof sides differ only by definitional parenthesization.

Yes, path tactics support calc-style proof chains with explicit ÷ notation for clarity. You can write calc-based proofs and finish them with path_simp or path_auto, producing readable, step-by-step RwEq solutions.

path_auto handles standalone RwEq goals involving groupoid laws, cancellations, associativity reshaping, and longer proofs requiring unit-law cleanup and finalization steps through the ComputationalPaths.Path.Rewrite.PathTactic library.

You need to import the path tactic module from ComputationalPaths.Path.Rewrite.PathTactic library. After importing, path_auto, path_simp, and path_normalize are available for RwEq goals without additional configuration.

When RwEq proof sides differ only by definitional parenthesization, apply path_normalize to resolve the mismatch and normalize both sides to a common form.