proposition: Lemma BVxor_id_r : forall n (v : Bvector n), BVxor n v (Bvect_false n) = v.
proof: Proof. induction n; intuition. rewrite (vector_0 v). unfold Bvect_false. simpl. trivial. destruct (vector_S v). destruct H. unfold Bvect_false. subst. simpl. rewrite IHn. rewrite xorb_false_r. trivial. Qed.
imports: FCF.StdNat List Bvector micromega.Lia FCF.EqDec FCF.Fold ZArith Permutation