proposition: Lemma unfold_interp : forall {E F R} {f : E ~> itree F} (t : itree E R), interp f t ≈ (_interp f (observe t)).
proof: Proof. intros; rewrite <- ITree.Interp.InterpFacts.unfold_interp. 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)