proposition: Lemma general_omega_infinite (A:Type) : forall (a:A) (u v:LList A), Infinite (general_omega v (LCons a u)).
proof: Proof. intros a; cofix H. simple destruct v. - rewrite general_omega_LNil_LCons; split; auto. - intros a0 l; autorewrite with llists using auto with llists. Qed.
imports: Arith List RelationClasses