Theorem difrab0eq 4426

Description: If the difference between the restricting class of a restricted class abstraction and the restricted class abstraction is empty, the restricting class is equal to this restricted class abstraction. (Contributed by Alexander van der Vekens, 31-Dec-2017.)

Assertion

Ref	Expression
difrab0eq	⊢ ((𝑉 ∖ {𝑥 ∈ 𝑉 ∣ 𝜑}) = ∅ ↔ 𝑉 = {𝑥 ∈ 𝑉 ∣ 𝜑})

Distinct variable group:   𝑥,𝑉

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem difrab0eq

Step	Hyp	Ref	Expression
1		ssdif0 4317	. 2 ⊢ (𝑉 ⊆ {𝑥 ∈ 𝑉 ∣ 𝜑} ↔ (𝑉 ∖ {𝑥 ∈ 𝑉 ∣ 𝜑}) = ∅)
2		ssrabeq 4035	. 2 ⊢ (𝑉 ⊆ {𝑥 ∈ 𝑉 ∣ 𝜑} ↔ 𝑉 = {𝑥 ∈ 𝑉 ∣ 𝜑})
3	1, 2	bitr3i 280	1 ⊢ ((𝑉 ∖ {𝑥 ∈ 𝑉 ∣ 𝜑}) = ∅ ↔ 𝑉 = {𝑥 ∈ 𝑉 ∣ 𝜑})

This proof depends on syntax axioms:   ↔ wb 209   = wceq 1570  {crab 3414   ∖ cdif 3899   ⊆ wss 3902  ∅c0 4282

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-rab 3415  df-v 3455  df-dif 3905  df-ss 3919  df-nul 4283

This theorem is used by:  frgrregorufr0  30790