theorem rappeq1d (_G: wff) (_F1 _F2: set) (x: nat): $ _G -> _F1 == _F2 $ > $ _G -> _F1 @' x == _F2 @' x $;
_G -> _F1 == _F2
_G -> x = x
_G -> _F1 @' x == _F2 @' x