Metamath Proof Explorer


Theorem opabf

Description: A class abstraction of a collection of ordered pairs with a negated wff is the empty set. (Contributed by Peter Mazsa, 21-Oct-2019) (Proof shortened by Thierry Arnoux, 18-Feb-2022)

Ref Expression
Hypothesis opabf.1 ¬φ
Assertion opabf xy|φ=

Proof

Step Hyp Ref Expression
1 opabf.1 ¬φ
2 1 gen2 xy¬φ
3 opab0 xy|φ=xy¬φ
4 2 3 mpbir xy|φ=