proposition: Lemma Peq_ok : forall P P', (P =? P') = true -> forall l, P@l == P'@ l.
proof: Proof. induction P;destruct P';simpl;intros ;try easy. - now apply ring_morphism_eq, Ceqb_eq. - specialize (IHP1 P'1). specialize (IHP2 P'2). simpl in IHP1, IHP2. destruct (Pos.compare_spec p p1); try discriminate; destruct (Pos.compare_spec p0 p2); try discriminate. destruct (Peq P2 P'1); try discriminate. subst; now rewrite IHP1, IHP2. Qed.
imports: Setoid BinList BinPos BinNat BinInt Ring_polynom Ncring