proposition: Lemma cp_var : forall P, cp_aeq P -> cp_neutral P -> forall x, P (Var x).
proof: Proof. intros P p1 p4 x. change (P (apps (Var x) Vnil)). apply cp_var_app_sn; fo. Qed.
imports: Coq(Morphisms Basics) CoLoR(RelUtil VecUtil VecOrd LogicUtil SN SetUtil)