proposition: Lemma compl0 : ~` \bot = \top :> L.
proof: Proof. by rewrite complE diffx0. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)