proposition: Lemma Forall2_rev_eq : forall P r s, Forall2 P r s = Forall2 P (rev r) (rev s).
proof: Proof. Proof using. intros. extens. iff M. { applys~ Forall2_rev. } { rewrite <- (rev_rev r). rewrite <- (rev_rev s). applys~ Forall2_rev. } Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibOperation LibProd LibOption LibNat LibInt LibWf LibMonoid LibRelation)