proposition: Lemma gtA_comp: forall a, comp_eqA (gtA a).
proof: Proof. intros a b c bc. apply gtA_morph. refl. hyp. Qed.
imports: Coq(Transitive_Closure Compare_dec Relations Permutation Setoid Morphisms Basics Lia) CoLoR(RelExtras MultisetTheory ListPermutation MultisetCore ListExtras AccUtil LogicUtil)