proposition: Lemma Forall2_cons_inv : forall P r s x y, Forall2 P (x::r) (y::s) -> P x y /\ Forall2 P r s.
proof: Proof. Proof using. introv E. rewrite~ Forall2_cons_eq in E. Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibOperation LibProd LibOption LibNat LibInt LibWf LibMonoid LibRelation)