proposition: Fact Young_meetUl : @left_distributive 'YL 'YL Order.meet Order.join.
proof: Proof. move=> p q r; apply/eqP/intpart_eqP => i. by rewrite !(nth_meet_Young, nth_join_Young) minn_maxl. Qed.
imports: HB(structures) mathcomp(all_ssreflect) mathcomp(div ssralg ssrint ssrnum binomial) tools combclass sorted ordtype