proposition: Lemma mOrd_inclusion: forall M N, MultisetGT R' M N -> MultisetGT R M N.
proof: Proof. intros M N M_N. inversion M_N. exists X Y Z; trivial. intros. destruct (H2 y); trivial. exists x; trivial. apply R'sub; trivial. Qed.
imports: Coq(Transitive_Closure Compare_dec Relations Permutation Setoid Morphisms Basics Lia) CoLoR(RelExtras MultisetTheory ListPermutation MultisetCore ListExtras AccUtil LogicUtil)