Proof using.
intros. destruct h; auto.
Qed.

(* Specifications: *)
Lemma inputs_m_inl_read :
forall h l,
inputs_m ((h, inl Read) :: l) = inputs_m l.
Lemma list_destruct_last :
forall A (l : list A),
l = [] \/ exists l' x, l = l' ++ [x].