proposition: Lemma refine_eq_ret : forall {A} (a a': A), a = a' -> refineEquiv (ret a) (ret a').
proof: Proof. intros; subst; reflexivity. Qed.
imports: Coq.Strings.String Coq.Sets.Ensembles Coq.Bool.Bool Fiat.Common Fiat.Common.BoolFacts Fiat.Common.LogicFacts Fiat.Computation.Core Fiat.Computation.Monad Fiat.Computation.SetoidMorphisms Fiat.Computation.Refinements.Tactics