intros a b; apply eqA_trans with (y := plusA (invA (multA a b)) A0); auto.
apply eqA_trans with (y := plusA A0 (invA (multA a b))); auto.
apply eqA_trans with (y := plusA (multA A0 b) (invA (multA a b))); auto.
apply
eqA_trans with (y := plusA (multA (plusA a (invA a)) b) (invA (multA a b)));
auto.
apply
eqA_trans
with (y := plusA (plusA (multA a b) (multA (invA a) b)) (invA (multA a b)));
auto.
apply
eqA_trans
with (y := plusA (plusA (multA (invA a) b) (multA a b)) (invA (multA a b)));
auto.
apply
eqA_trans
with (y := plusA (multA (invA a) b) (plusA (multA a b) (invA (multA a b))));
auto.
apply eqA_trans with (y := plusA (multA (invA a) b) A0); auto.
apply plusA_eqA_comp with (1 := cs); auto.
apply multA_dist_r.
Qed.
Hint Resolve multA_invA_com_l.

(* Specifications: *)
Theorem multA_invA_com_r :
forall a b : A, eqA (multA a (invA b)) (invA (multA a b)).