proposition: Lemma refineFun_AbsR_unCurry' {oldRep newRep} (AbsR : oldRep -> newRep -> Prop) {fDom : list Type} {fCod : Type} : forall (fDef : funType fDom (oldRep * fCod)) (fDef' : funType fDom (newRep * fCod)), refineFun_AbsR' _ _ AbsR (unCurry _ fDef) (unCurry _ fDef') -> refineFun_AbsR' _ _ AbsR fDef fDef'.
proof: Proof. induction fDom; simpl. - intros; eapply (H tt). - intros. eapply IHfDom; eauto. simpl; intros. eapply (H (t, t0)). Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Fiat.ADT Fiat.ADTNotation Fiat.Computation.FixComp Coq.ZArith.ZArith Coq.Arith.PeanoNat Fiat.Common.Frame Fiat.ADTRefinement Fiat.ADTRefinement.BuildADTRefinements