proposition: Lemma expln_wf : forall e (err : type_error), expln e err -> wf e.
proof: Proof. simple induction 1; intros; auto with coc arith. inversion_clear H1. apply typ_wf with t (Srt s); auto with coc arith. apply typ_wf with m at_; auto with coc arith. cut (wf (t :: e0)); intros. inversion_clear H1. apply typ_wf with t (Srt s); auto with coc arith. apply typ_wf with m (Srt kind); auto with coc arith. apply typ_wf with m t; auto with coc arith. apply typ_wf with m t; auto with coc arith. apply typ_wf with v tv; auto with coc arith. Qed.
imports: Termes Conv Types Strong_Norm Conv_Dec