proposition: Lemma pBndngVars_swap : forall {G : CFGV} {vc : VarSym G}, ( (forall (gs : GSym G) (t : Term gs), True) * (forall (g : GSym G) (ph : Pattern g) s, pBndngVars vc (pSwap ph s) = swapLVar s (pBndngVars vc ph)) * (forall (lgs : list (bool * GSym G)) (m : Mixture lgs) s, mBndngVars vc (mSwap m s) = swapLVar s (mBndngVars vc m)) ).
proof: Proof. intros. GInduction; auto; introv; allsimpl; DDeqs; auto. introv P M; introv. rewrite swapLVar_app. apply app_if; auto. Qed.
imports: Swap AssociationList Eqdep_dec