(* * Copyright (c) 2009 Robert Dockins and Aquinas Hobor. * *)
(* Coq development: using indirection theory to model types in l-calculus *)
(* lam_ref_mach_lemmas.v: various boring lemmas about the machine *)
(* COERCIONS *)
(* DECIDABILTY *)
(* SUBSTITUTION *)

Lemma closed'_le : forall m n,
m <= n ->
forall e,
closed' m e ->
closed' n e.