proposition: Lemma target_ord A: ord (target A) = 1.
proof: Proof. induction A; cbn; congruence. Qed.
imports: List Arith Lia Morphisms FinFun Undecidability.HOU(std.std) Undecidability.HOU.calculus(prelim terms syntax semantics equivalence typing order confluence)