fact: Definition ksupp_inj k (u1 : seq T1) (u2 : seq T2) := forall s1, s1 \is a k.-supp[R1, in_tuple u1] -> exists s2, (#|cover s1| == #|cover s2|) && (s2 \is a k.-supp[R2, in_tuple u2]).
imports: mathcomp(all_ssreflect) mathcomp(perm) sorted tools subseq partition tableau Schensted congr plactic ordcast ordtype