Definition tempD' := (fun Q i v => `(eq v) (eval_id i) :: Q).Definition localD' := (fun Q i tv => `(eq (snd tv)) (eval_var i (fst tv)) :: Q).Definition LocalD_app (T1: PTree.t val) (T2: PTree.t (type * val)) (Q: list (environ -> Prop)) :=
  (PTree.fold tempD' T1 nil) ++
 (PTree.fold localD' T2 nil) ++ Q.

Lemma LocalD_app_eq : forall t1 t2 q, LocalD t1 t2 q = LocalD_app t1 t2 q.