(*
Definition word_inv : Elt -> Word :=
  [e:Elt]
    (<Word>Case e of
        (* natural *) [n:nat]nil
        (* couple  *) [a:Elt][b:Elt]nil
	(* up      *) [e:Ensf]nil
	(* word    *) [w:Word]w
    end ).
*)

Definition word_inv (e : Elt) : Word :=
  match e with
  | word w => w
  | _ => nil
  end.

Lemma word_word_inv : forall a b : Word, word a = word b -> a = b.