proposition: Lemma complE x : compl x = diff \top x.
proof: Proof. by congr pair; rewrite complE. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)