Proof using.
intros P J s unP.
induction unP.
- apply E0; assumption.
- apply E_next; assumption.
Qed.
(* release facts *)

Lemma release_Cons :
forall (x: T) (s: infseq T) J P,
release J P (Cons x s) -> P (Cons x s) /\ (J (Cons x s) \/ release J P s).