proposition: Theorem unification_conserve n: 1 <= n -> OU n X ⪯ U X.
proof: Proof. intros H; exists unification_conservative; split; eauto using unification_conservative_forward, unification_conservative_backward. Qed.
imports: PeanoNat Lia List Undecidability.HOU(calculus.calculus concon.conservativity_constants unification.higher_order_unification unification.systemunification unification.nth_order_unification)