proposition: Lemma pure_typing_K'I {Gamma M N t}: pure_typing Gamma M t -> pure_typable Gamma N -> pure_typing Gamma (K' M N) t.
proof: Proof. move=> HM [tN HtN]. apply: (pure_typing_pure_app_simpleI (s := tN)); last done. apply: pure_typing_pure_abs_simpleI. apply: pure_typing_ren_pure_term; [by eassumption | done]. Qed.
imports: List Lia Relation_Definitions Relation_Operators Operators_Properties Undecidability.SystemF.SysF Undecidability.SystemF.Autosubst.syntax Undecidability.SystemF.Autosubst.unscoped Undecidability.SystemF.Util(Facts poly_type_facts pure_term_facts term_facts typing_facts iipc2_facts pure_typing_facts) ssreflect ssrbool ssrfun