proposition: Lemma refineFun_antisym {fDom : list Type} {fCod : Type} : forall (x y : funType fDom fCod), refineFun x y -> refineFun y x -> refineEquivFun x y.
proof: Proof. unfold refineEquivFun; intuition. 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