Definition nf : poly A0 eqA ltM -> list (poly A0 eqA ltM) -> poly A0 eqA ltM.

Theorem nf_irreducible : forall (p : poly A0 eqA ltM) (aP : list (poly A0 eqA ltM)), irreducible A A0 A1 eqA invA minusA multA divA eqA_dec n ltM ltM_dec aP (s2p A A0 eqA n ltM (nf p aP)).