proposition: Lemma last_eq_nil_inv : forall a l, l & a = nil -> False.
proof: Proof. Proof using. introv E. induction l; rew_list; false. Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibOperation LibProd LibOption LibNat LibInt LibWf LibMonoid LibRelation)