QuantumInfo.ForMathlib.Tactic.Commutes
Tactic for `Commute`
This tactic uses `aesop` to discharge goals relating to the `Commute` relation. It mostly tries to do straightforward recursion on expressions, along with some basic normalization of ring operations.
2 declarations
The `commutes` tactic for proving
The tactic `commutes` is designed to automatically discharge goals involving the `Commute` proposition, , for elements in a ring or algebra. It utilizes `aesop` to perform structural recursion on the expressions and applies basic normalization of ring operations to establish if two elements commute.
The `commutes?` tactic for generating proof scripts of commutativity goals
The tactic `commutes?` is a variant of the `commutes` tactic used to discharge goals involving the `Commute` relation (). Unlike the standard version, this variant generates and suggests a proof script that the user can use to replace the tactic call.
