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