proposition: Lemma swapLVarSwitch : forall {G : CFGV} {vc : VarSym G} (sub: list (vType vc))(sw : Swapping vc), swapLVar sw sub = swapLVar (ALSwitch sw) sub.
proof: Proof. induction sub; cpx. intros. simpl. f_equal; cpx. apply swapVarSwitch. Qed.
imports: Swap AssociationList Eqdep_dec