proposition: Lemma Leaf_finite : forall E R (t : itree E R) x, x ∈ t -> any_finite t.
proof: Proof. intros * FIN; induction FIN; rewrite itree_eta, H; eauto with itree. Qed.
imports: ITree(ITree Basics.Utils Eq.Eqit Interp.TranslateFacts Leaf) ITree.Events(Nondeterminism Exception) Paco(paco) Coq(Morphisms Basics Program.Equality)