proposition: Lemma any_finite_bind_inv_left : forall {E R S} (t : itree E R) (k : R -> itree E S), any_finite (t >>= k) -> any_finite t.
proof: Proof. intros; eapply any_finite_bind_inv; eauto. Qed.
imports: ITree(ITree Basics.Utils Eq.Eqit Interp.TranslateFacts Leaf) ITree.Events(Nondeterminism Exception) Paco(paco) Coq(Morphisms Basics Program.Equality)