intros k l; split; intros [y H].
- exists y...
- induction H as [a l eq|a l H IH].
+ destruct a as [k' y'].
exists y'...
+ destruct IH as [e H0].
exists e...
Qed.

Lemma Sort_In_cons_3 :
forall x l k e, Sort ((k,e)::l) -> In x l -> ~eq x k.