![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > difrab0eq | Structured version Visualization version GIF version |
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.) |
Ref | Expression |
---|---|
difrab0eq | ⊢ ((𝑉 ∖ {𝑥 ∈ 𝑉 ∣ 𝜑}) = ∅ ↔ 𝑉 = {𝑥 ∈ 𝑉 ∣ 𝜑}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssdif0 4366 | . 2 ⊢ (𝑉 ⊆ {𝑥 ∈ 𝑉 ∣ 𝜑} ↔ (𝑉 ∖ {𝑥 ∈ 𝑉 ∣ 𝜑}) = ∅) | |
2 | ssrabeq 4081 | . 2 ⊢ (𝑉 ⊆ {𝑥 ∈ 𝑉 ∣ 𝜑} ↔ 𝑉 = {𝑥 ∈ 𝑉 ∣ 𝜑}) | |
3 | 1, 2 | bitr3i 276 | 1 ⊢ ((𝑉 ∖ {𝑥 ∈ 𝑉 ∣ 𝜑}) = ∅ ↔ 𝑉 = {𝑥 ∈ 𝑉 ∣ 𝜑}) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 = wceq 1534 {crab 3419 ∖ cdif 3944 ⊆ wss 3947 ∅c0 4325 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-ext 2697 |
This theorem depends on definitions: df-bi 206 df-an 395 df-tru 1537 df-fal 1547 df-ex 1775 df-sb 2061 df-clab 2704 df-cleq 2718 df-clel 2803 df-rab 3420 df-v 3464 df-dif 3950 df-ss 3964 df-nul 4326 |
This theorem is referenced by: frgrregorufr0 30260 |
Copyright terms: Public domain | W3C validator |