proposition: Lemma Forall2_rev : forall P r s, Forall2 P r s -> Forall2 P (rev r) (rev s).
proof: Proof. Proof using. Hint Resolve Forall2_last. intros P r. induction r; introv M; inverts M; rew_listx~. Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibOperation LibProd LibOption LibNat LibInt LibWf LibMonoid LibRelation)