proposition: Fact poly_var_bound_SUt0'_n_W : poly_var_bound SUt0' < n_W.
proof: Proof. rewrite /n_W /t_1_W /= -lock. by lia. 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