proposition: Lemma zip_with_cons_inv l k z lC : zip_with f l k = z :: lC → ∃ x y l' k', z = f x y ∧ lC = zip_with f l' k' ∧ l = x :: l' ∧ k = y :: k'.
proof: Proof. intros. destruct l, k; simplify_eq/=; repeat eexists. Qed.
imports: stdpp(options)