simple induction args; simpl in |- *; intros; auto with arith pts.
apply whnf_head_normal; auto with arith pts.
apply H; intros.
simpl in |- *; auto with arith pts.
discriminate.
Qed.
Let f1 (a : approx) :=
match a with
| (e, (t, args)) => existS (fun _ => value) (e, app_list args t) (e, t)
end.
Definition whnf_ord (x y : approx) :=
lexprod value (fun _ => value) (R_exp beta) (fun _ => subterm)
(f1 x) (f1 y).

Lemma beta_app_list_ctxt :
forall (l : list term) (e : env) (u v : term),
ctxt beta e u v -> ctxt beta e (app_list l u) (app_list l v).