proposition: Lemma rev_eq_nil_inv : forall l, rev l = nil -> l = nil.
proof: Proof. Proof using. intros l. destruct l; rew_list; intros. { auto. } { false* last_eq_nil_inv. } Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibOperation LibProd LibOption LibNat LibInt LibWf LibMonoid LibRelation)