(**************)
(* Singletons *)
(**************)
Definition single (b : bool) := bit b empty.
(*********************)
(* Parities of words *)
(*********************)
Inductive odd : word -> Prop :=
even_odd : forall w : word, even w -> forall b : bool, odd (bit b w)
with even : word -> Prop :=
| even_empty : even empty
| odd_even : forall w : word, odd w -> forall b : bool, even (bit b w).
Hint Resolve odd_even even_empty even_odd.

Lemma inv_odd : forall (w : word) (b : bool), odd (bit b w) -> even w.