theorem sepeq2d (_G: wff) (n: nat) (_A1 _A2: set): $ _G -> _A1 == _A2 $ > $ _G -> sep n _A1 = sep n _A2 $;
_G -> n = n
_G -> _A1 == _A2
_G -> sep n _A1 = sep n _A2