Theorem ab0 4386

Description: The class of sets verifying a property is the empty class if and only if that property is a contradiction. See also abn0 4391 (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 2939). (Contributed by BJ, 19-Mar-2021.) Avoid df-clel 2814, ax-8 2108. (Revised by GG, 30-Aug-2024.) (Proof shortened by SN, 8-Sep-2024.)

Assertion

Ref	Expression
ab0	⊢ ({𝑥 ∣ 𝜑} = ∅ ↔ ∀𝑥 ¬ 𝜑)

Proof of Theorem ab0

Step	Hyp	Ref	Expression
1		abbib 2809	. 2 ⊢ ({𝑥 ∣ 𝜑} = {𝑥 ∣ ⊥} ↔ ∀𝑥(𝜑 ↔ ⊥))
2		dfnul4 4341	. . 3 ⊢ ∅ = {𝑥 ∣ ⊥}
3	2	eqeq2i 2748	. 2 ⊢ ({𝑥 ∣ 𝜑} = ∅ ↔ {𝑥 ∣ 𝜑} = {𝑥 ∣ ⊥})
4		nbfal 1552	. . 3 ⊢ (¬ 𝜑 ↔ (𝜑 ↔ ⊥))
5	4	albii 1816	. 2 ⊢ (∀𝑥 ¬ 𝜑 ↔ ∀𝑥(𝜑 ↔ ⊥))
6	1, 3, 5	3bitr4i 303	1 ⊢ ({𝑥 ∣ 𝜑} = ∅ ↔ ∀𝑥 ¬ 𝜑)

Syntax hints:  ¬ wn 3   ↔ wb 206  ∀wal 1535   = wceq 1537  ⊥wfal 1549  {cab 2712  ∅c0 4339

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-clab 2713  df-cleq 2727  df-dif 3966  df-nul 4340

This theorem is referenced by:  dfnf5  4388  abn0  4391  rab0  4392  rabeq0  4394  sticksstones22  42150