fact: Record ring_morphism : Prop := mk_ring_morph { morph_z : 〚 zX 〛= zY; morph_o : 〚 oX 〛= oY; morph_plus : forall x y, 〚 pX x y 〛= pY 〚 x 〛〚 y 〛; morph_mult : forall x y, 〚 mX x y 〛= mY 〚 x 〛〚 y 〛; morph_opp : forall x, 〚 oppX x 〛= oppY 〚 x 〛; }.
imports: Arith ZArith Undecidability.Shared.Libs.DLW.Utils(utils_tac gcd prime binomial sums)