proposition: Lemma mord_acc : forall M, (forall x, x in M -> AccA x) -> AccM M.
proof: Proof. intros; unfold AccM. apply Acc_eq_rel with clos_transM_RedLt. split. apply (proj2 lt_as_red a b). apply (proj1 lt_as_red a b). unfold clos_transM_RedLt; apply Transitive_Closure.Acc_clos_trans. apply mred_acc; trivial. Qed.
imports: Coq(Transitive_Closure Compare_dec Relations Permutation Setoid Morphisms Basics Lia) CoLoR(RelExtras MultisetTheory ListPermutation MultisetCore ListExtras AccUtil LogicUtil)