proposition: Lemma all_finite_Tau : forall E R t, all_finite t -> @all_finite E R (Tau t).
proof: Proof. intros; econstructor 2; [reflexivity | eauto]. Qed.
imports: ITree(ITree Basics.Utils Eq.Eqit Interp.TranslateFacts Leaf) ITree.Events(Nondeterminism Exception) Paco(paco) Coq(Morphisms Basics Program.Equality)