proposition: Lemma refine_trivial_pick : forall A (x : A), refine {y | x = y} (ret x).
proof: Proof. implement. Qed.
imports: Fiat.ADTNotation.BuildADT Fiat.ADTNotation.BuildComputationalADT Fiat.ADTNotation.BuildADTSig Fiat.ADTRefinement.GeneralRefinements Fiat.Common.ilist Fiat.ADTRefinement.BuildADTRefinements.HoneRepresentation Fiat.ADT.ComputationalADT Fiat.ADTRefinement.GeneralBuildADTRefinements Fiat.ADT.ComputationalADT Fiat.ADTRefinement.GeneralBuildADTRefinements Coq.Bool.Bool Coq.ZArith.ZArith