proposition: Lemma finite_non_interactive : forall X (t: itree void1 X), all_finite t <-> any_finite t.
proof: Proof. split; induction 1; cbn in *; first [now destruct e | 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)