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) Avoid df-clel , ax-8 . (Revised by Gino Giotto, 30-Aug-2024) (Proof shortened by SN, 8-Sep-2024)

Ref Expression
Assertion ab0 x | φ = x ¬ φ

Proof

Step Hyp Ref Expression
1 abbi x φ x | φ = x |
2 nbfal ¬ φ φ
3 2 albii x ¬ φ x φ
4 dfnul4 = x |
5 4 eqeq2i x | φ = x | φ = x |
6 1 3 5 3bitr4ri x | φ = x ¬ φ