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