proposition: Lemma le_meet_intpartn sh1 sh2 : (meet_intpartn sh1 sh2 <= sh1)%O.
proof: Proof. apply/partdomP => i; case: (ltnP i d.+1) => [Hi| /ltnW Hi]. by rewrite sumn_take_part_fromtuple // nth_parttuple_minn // geq_minl. by rewrite !take_intpartn_over // !sumn_intpartn. Qed.
imports: HB(structures) mathcomp(all_ssreflect) mathcomp(div ssralg ssrint ssrnum binomial) tools combclass sorted ordtype