proposition: Lemma tau_eutt : forall (t : itree E R), Tau t ≈ t.
proof: Proof. intros. rewrite ITree.Eq.Eqit.tau_eutt. 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)