red in |- *; intros.
generalize H.
elim H0.
simple induction 1.
simple induction 1; simpl in |- *; intros.
inversion_clear H3.
elim H5 with T M; auto with arith pts.
red in |- *; red in |- *; intros.
inversion_clear H5.
red in |- *; red in |- *; intros.
inversion_clear H5.
red in |- *; red in |- *; intros.
generalize H2.
inversion_clear H5.
intros.
generalize H4.
inversion_clear H5; simpl in |- *; intros.
inversion_clear H5.
generalize H7.
inversion_clear H6.
simpl in |- *; intros.
inversion_clear H5.
elim H9 with T0 M0; auto with arith pts.
inversion_clear H5.
elim H8 with M0 M; auto with arith pts.
inversion_clear H5.
elim H8 with T M0; auto with arith pts.
red in |- *; red in |- *; intros.
generalize H4.
inversion_clear H5; simpl in |- *; intros.
inversion_clear H5.
elim H7 with T M; auto with arith pts.
red in |- *; red in |- *; intros.
inversion_clear H5.
red in |- *; red in |- *; intros.
inversion_clear H5.
red in |- *; red in |- *; intros.
generalize H1.
inversion_clear H2; simpl in |- *; intros.
inversion_clear H2.
elim H4 with T M; auto with arith pts.
intros.
apply H4.
apply beta_red_whnf with e x; auto with arith pts.
Qed.

(* Specifications: *)
Lemma whnf_app_list :
forall (args : list term) (e : env) (t : term),
whnf_beta t ->
(forall A M : term, t <> Abs A M) -> head_normal beta e (app_list args t).