proposition: Lemma Forall2_swap_eq : forall P r s, Forall2 P r s = Forall2 (fun b a => P a b) s r.
proof: Proof. Proof using. intros. extens. iff M. { applys* Forall2_swap. } { applys* Forall2_swap_inv. } Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibOperation LibProd LibOption LibNat LibInt LibWf LibMonoid LibRelation)