Theorem: AutAction.compatibility' (UnitConjecture/Cocycle.lean)

State before:
A : Type u_2
B : Type u_1
inst✝² : AddGroup A
inst✝¹ : AddGroup B
α : A → B →+ B
inst✝ : AutAction α
⊢ ∀ {a a' : A} {b : B}, ↑(α a) (↑(α a') b) = ↑(α (a + a')) b
Tactic:
aesop (rule_sets [AutAction])
State after:
no goals