intros.
pattern (X1 d) at 2 in |- *.
elim Lem3.
elim Lem4.
elim Lem5.
elim Lem6.
elim Lem7.
elim Lem8.
elim Lem9.
elim Lem10.
elim Lem11.
elim A4.
elim A5.
elim A5.
apply refl_equal.
Qed.

Theorem Lem13 :
forall d : D,
seq (ia Frame c2 (Tuple e1 d))
(enc H
(mer (seq (Tn_d d e1) (S i))
(mer
(seq
(alt (seq (ia one int i) (ia Frame s3 (Tuple e1 d)))
(seq (ia one int i) (ia Frame s3 lce)))
(K i)) (mer (L i) (seq (Rn e0) (R i)))))) =
Y1 d.