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