Metamath Proof Explorer


Theorem ab0

Description: The class of sets verifying a property is the empty class if and only if that property is a contradiction. See also abn0 (from which it could be proved using as many essential proof steps but one fewer syntactic step, at the cost of depending on df-ne ). (Contributed by BJ, 19-Mar-2021)

Ref Expression
Assertion ab0 x | φ = x ¬ φ

Proof

Step Hyp Ref Expression
1 nfab1 _ x x | φ
2 1 eq0f x | φ = x ¬ x x | φ
3 abid x x | φ φ
4 3 notbii ¬ x x | φ ¬ φ
5 4 albii x ¬ x x | φ x ¬ φ
6 2 5 bitri x | φ = x ¬ φ