proposition: Lemma pAlphaEqTransEauto: forall {G : CFGV} {vc : VarSym G} (s : GSym G) (a b c : Pattern s), pAlphaEq vc a b -> pAlphaEq vc b c -> pAlphaEq vc a c.
proof: Proof. introns Hyp. pose proof (@alphaEqTransitive G vc) as Hpr. repnd. unfold transRel in Hpr1. eauto. Qed.
imports: AlphaEquality SwapProps Eqdep_dec