proposition: Lemma union_intpartnE : val union_intpartn = sort geq (l ++ k).
proof: Proof. by rewrite /= merge_sortedE. Qed.
imports: HB(structures) mathcomp(all_ssreflect) mathcomp(div ssralg ssrint ssrnum binomial) tools combclass sorted ordtype