proposition: Lemma subst_steps s t sigma: s >* t -> sigma • s >* sigma • t.
proof: Proof. induction 1; eauto using subst_step. Qed.
imports: Undecidability.HOU(calculus.prelim calculus.terms calculus.syntax std.std) Morphisms Lia FinFun