proposition: Lemma complE t : compl t = diff \top t.
proof: Proof. by apply: eq_from_tnth => i; rewrite tnth_compl tnth_diff complE tnth_nseq. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)