proposition: Lemma rpo_mul_permut0_right: forall rpo_infos l0 l1 l2, permut0 equiv l0 l1 -> rpo_mul (bb rpo_infos) l2 l0 -> rpo_mul (bb rpo_infos) l2 l1.
proof: Proof. intros. inversion H0. apply List_mul with a lg ls lc. trivial. apply permut0_trans with l0. apply equiv_equiv. apply permut0_sym. apply equiv_equiv. trivial. trivial. trivial. Qed.
imports: Coq(Bool Peano List PeanoNat) CoLoR(closure more_list equiv_list list_permut dickson) Coq(Relations Wellfounded Arith Wf_nat Recdef Program Morphisms Lia) CoLoR(term_spec term decidable_set ordered_set NatCompat)