induction lsa1; intuition.
simpl in H.
intuition; subst.
repeat rewrite app_nil_l.
trivial.
unfold compMap in H.
fold compMap in H.
repeat simp_in_support.
repeat rewrite <- app_comm_cons.
unfold compMap.
fold compMap.
eapply getSupport_In_Seq; eauto.
eapply getSupport_In_Seq; eauto.
simpl; intuition.
Qed.

Lemma list_pred_single :
forall (A : Set) (P : A -> A -> Prop) (lsa : list A),
(forall a, In a lsa -> P a a) ->
list_pred P lsa lsa.