Theorem bj-ab0 37916

Description: The class of sets verifying a falsity is the empty set (closed form of abf 4363). (Contributed by BJ, 24-Jul-2019.) (Proof modification is discouraged.)

Assertion

Ref	Expression
bj-ab0	⊢ (∀𝑥 ¬ 𝜑 → {𝑥 ∣ 𝜑} = ∅)

Proof of Theorem bj-ab0

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		stdpc4 2104	. . . 4 ⊢ (∀𝑥 ¬ 𝜑 → [𝑦 / 𝑥] ¬ 𝜑)
2		sbn1 2143	. . . 4 ⊢ ([𝑦 / 𝑥] ¬ 𝜑 → ¬ [𝑦 / 𝑥]𝜑)
3	1, 2	syl 18	. . 3 ⊢ (∀𝑥 ¬ 𝜑 → ¬ [𝑦 / 𝑥]𝜑)
4		df-clab 2739	. . 3 ⊢ (𝑦 ∈ {𝑥 ∣ 𝜑} ↔ [𝑦 / 𝑥]𝜑)
5	3, 4	sylnibr 332	. 2 ⊢ (∀𝑥 ¬ 𝜑 → ¬ 𝑦 ∈ {𝑥 ∣ 𝜑})
6	5	eq0rdv 4364	1 ⊢ (∀𝑥 ¬ 𝜑 → {𝑥 ∣ 𝜑} = ∅)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4  ∀wal 1567   = wceq 1569  [wsb 2098   ∈ wcel 2144  {cab 2738  ∅c0 4277

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-dif 4046  df-nul 4278

This theorem is used by:  bj-abf  37917  bj-csbprc  37918