proposition: Lemma no_infinite_ret (E : Type -> Type) (A : Type) (t: itree E A) (a : A) : any_infinite t -> t ≈ Ret a -> False.
proof: Proof. intros H HContra. rewrite HContra in H. pinversion H. Qed.
imports: Coq(Setoid Morphisms RelationClasses) Paco(paco) ITree(Axioms Basics Core.ITreeDefinition Eq.Eqit Eq.Shallow)