proposition: Lemma diffIK x y : (x `\` y) `&` y = \bot.
proof: Proof. by rewrite meetC diffKI. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)