proposition: Lemma closed_t_1_W : allfv_poly_type (gt n_W) t_1_W.
proof: Proof. rewrite /n_W -lock. by apply: poly_var_boundP. Qed.
imports: List Lia Undecidability.SystemF.SysF Undecidability.SystemF.Autosubst.syntax Undecidability.SystemF.Util(Facts poly_type_facts pure_term_facts term_facts typing_facts pure_typing_facts pure_typable_prenex) ssreflect ssrbool ssrfun