proposition: Lemma nil_eq_last_inv : forall a l, nil = l & a -> False.
proof: Proof. Proof using. intros. apply* last_eq_nil_inv. Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibOperation LibProd LibOption LibNat LibInt LibWf LibMonoid LibRelation)