proposition: Lemma refineFunEquiv_unCurry (fDom : list Type) {fCod : Type} : forall (f : funType fDom fCod), refineEquivFun f (Curry _ (unCurry _ f)).
proof: Proof. induction fDom; simpl. - split; simpl; intros; apply PreOrder_Reflexive. - simpl in *; split; simpl; intros. + eapply (IHfDom (f t)). + eapply (IHfDom (f t)). Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Coq.Sets.Ensembles Coq.ZArith.ZArith Coq.Classes.Morphisms Coq.Classes.SetoidTactics Fiat.Computation Fiat.Computation.SetoidMorphisms Coq.Logic.FunctionalExtensionality