proposition: Lemma refineFun_refl {fDom : list Type} {fCod : Type} : forall (fDef : funType fDom fCod), refineFun fDef fDef.
proof: Proof. induction fDom; simpl; intros. - reflexivity. - eauto. 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