proposition: Lemma eta_normal: normal (eta s H).
proof: Proof. destruct eta_correct; eauto. Qed.
imports: Morphisms Setoid Undecidability.HOU(std.std) Undecidability.HOU.calculus(prelim terms syntax semantics confluence typing order normalisation)