proposition: Lemma bind_ret_r : forall {E R} (s : itree E R), ITree.bind s (fun x => Ret x) ≈ s.
proof: Proof. intros; rewrite ITree.Eq.Eqit.bind_ret_r; reflexivity. Qed.
imports: Coq(Setoid Morphisms) ITree(Eq.Shallow) ITree.Core.ITreeDefinition ITree.Basics.Basics ITree.Indexed.Sum ITree.Interp.Interp ITree.Interp.Recursion ITree(Eq.Eqit Eq.UpToTaus Interp.InterpFacts Interp.RecursionFacts)