theorem repeateq1d (_G: wff) (_a1 _a2 n: nat): $ _G -> _a1 = _a2 $ > $ _G -> repeat _a1 n = repeat _a2 n $;
_G -> _a1 = _a2
_G -> n = n
_G -> repeat _a1 n = repeat _a2 n