proposition: Lemma xorBB n : forall x, xorB (n:=n) x x = #0.
proof: Proof. by rewrite /xorB; 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