(* Counterexample to Fact 5.2 *)

(* Specifications: *)
Lemma evaluates_bound : ~ forall s t n, s ▷ t -> bound n s = true -> bound n t = true.
Lemma bound_subst s t k : bound (S k) s = true -> bound k t = true -> bound k (subst s k t) = true.
Lemma evaluates_closed s t : s ▷ t -> closed s -> closed t.
Lemma app_eva s t : eva (s t) -> eva s /\ eva t.
Lemma F_eva s t : eva (F s t) <-> eva s /\ eva t.
Lemma F_correct s t : lam s -> lam t -> F s t ▷ t.
Lemma eva_Omega : ~ eva Omega.
Lemma eva_D s : ~ eva (D s).
Lemma evaluates_D s v : D s ▷ v <-> False.
Reserved Notation "s '≻' t" (at level 50).