proposition: Lemma thead_negB n : forall b (p:BITS n), thead (negB (cons_tuple b p)) = b.
proof: Proof. move => b p. by destruct b. Qed.
imports: HB(structures) mathcomp.ssreflect.ssreflect mathcomp(ssrfun ssrbool eqtype ssrnat seq fintype tuple zmodp div) ssrextra.tuple ssrextra.nat spec spec.properties operations mathcomp(ssralg)