proposition: Lemma cons_eq_nil_inv : forall x l, x::l = nil -> False.
proof: Proof. Proof using. auto_false. Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibOperation LibProd LibOption LibNat LibInt LibWf LibMonoid LibRelation)