induction n; intuition; simpl in *.
auto.
Qed.
(* TODO: remove oneVector and replace it with Bvect_true *)
Fixpoint oneVector(n : nat) : Bvector n :=
match n with
| 0 => Vector.nil bool
| S n' => Vector.cons _ true _ (oneVector n')
end.

(* Specifications: *)
Theorem shiftOut_oneList : forall (n : nat),
shiftOut (oneList n) n = Some (oneVector n, nil).