proposition: Theorem uncurry_works : forall {X Y Z} (x : X) (y : Y) (f : X -> Y -> Z), uncurry f (x, y) = f x y.
proof: Proof. reflexivity. Qed.
imports: Coq.Lists.List Category.Lib Category.Theory.Coq.Functor Category.Theory.Coq.Functor.Proofs Category.Theory.Coq.Tuple Category.Theory.Functor