proposition: Lemma Exists_rev : forall P l, Exists P l -> Exists P (rev l).
proof: Proof. Proof using. introv E. induction l. { auto. } { rew_list. rewrite Exists_last_eq. inverts* E. } Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibOperation LibProd LibOption LibNat LibInt LibWf LibMonoid LibRelation)