proposition: Lemma ordertyping_step n Gamma s A: Gamma ⊢(n) s : A -> Gamma ⊢(S n) s: A.
proof: Proof. induction 1; eauto. Qed.
imports: List Arith Lia Undecidability.HOU(std.std) Undecidability.HOU.calculus(prelim terms syntax semantics typing)