proposition: Lemma setKIC B A : A :|: (A :&: B) = A.
proof: Proof. by rewrite setIC setKI. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)