proposition: Lemma pure_typing_ren_pure_term {Gamma Delta M t} (ξ : nat -> nat) : pure_typing Gamma M t -> (forall n s, nth_error Gamma n = Some s -> nth_error Delta (ξ n) = Some s) -> pure_typing Delta (ren_pure_term ξ M) t.
proof: Proof. move=> /pure_typing_to_typing [P] [->] /typing_ren_term H /H{H} /typing_to_pure_typing. by rewrite erase_ren_term. 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) ssreflect ssrbool ssrfun