Metamath Proof Explorer


Theorem sbnvOLD

Description: Obsolete version of sbn as of 8-Jul-2023. Substitution is not affected by negation. Version of sbn with a disjoint variable condition, not requiring ax-13 . (Contributed by Wolf Lammen, 18-Jan-2023) (Proof modification is discouraged.) (New usage is discouraged.)

Ref Expression
Assertion sbnvOLD y x ¬ φ ¬ y x φ

Proof

Step Hyp Ref Expression
1 exanali x x = y ¬ φ ¬ x x = y φ
2 sb5 y x ¬ φ x x = y ¬ φ
3 sb6 y x φ x x = y φ
4 3 notbii ¬ y x φ ¬ x x = y φ
5 1 2 4 3bitr4i y x ¬ φ ¬ y x φ