proposition: Lemma Forall2_nil_eq : forall P, Forall2 P nil nil = True.
proof: Proof. Proof using. intros. extens. iff M. { inverts* M. } { auto. } Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibOperation LibProd LibOption LibNat LibInt LibWf LibMonoid LibRelation)