fact: Variable (X Y : Type) (m1 : X -> X -> X) (u1 : X) (m2 : Y -> Y -> Y) (u2 : Y) (H1 : monoid_theory m1 u1) (H2 : monoid_theory m2 u2) (phi : X -> Y) (Hphi1 : phi u1 = u2) (Hphi2 : forall x y, phi (m1 x y) = m2 (phi x) (phi y)).
imports: List Arith ZArith Lia Undecidability.Shared.Libs.DLW.Utils(utils_tac utils_list binomial)