proposition: Lemma xorBN : forall n (b : BITS n), xorB b (ones n) = invB b.
proof: Proof. by rewrite /xorB/invB => n; lift_op_t n. 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