apply preuve_compilation.
intros e V ML_n s C Trad_n hab CV Eq.
inversion_clear ML_n.
exists (val (int n)).
split.
exact (Eqnum n).
inversion_clear Trad_n.
intro s0.
exact (QUO s0 CV (int n)).
Qed.
(*****************************************************************************)
(*               Case where E is a predefinite operator                      *)
(*****************************************************************************)

Lemma Proof_op : forall c : OP, compilation (op c).
intro c.