| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > difsnpss | Structured version Visualization version GIF version | ||
| Description: (𝐵 ∖ {𝐴}) is a proper subclass of 𝐵 if and only if 𝐴 is a member of 𝐵. (Contributed by David Moews, 1-May-2017.) |
| Ref | Expression |
|---|---|
| difsnpss | ⊢ (𝐴 ∈ 𝐵 ↔ (𝐵 ∖ {𝐴}) ⊊ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | notnotb 318 | . 2 ⊢ (𝐴 ∈ 𝐵 ↔ ¬ ¬ 𝐴 ∈ 𝐵) | |
| 2 | difss 4083 | . . . 4 ⊢ (𝐵 ∖ {𝐴}) ⊆ 𝐵 | |
| 3 | 2 | biantrur 540 | . . 3 ⊢ ((𝐵 ∖ {𝐴}) ≠ 𝐵 ↔ ((𝐵 ∖ {𝐴}) ⊆ 𝐵 ∧ (𝐵 ∖ {𝐴}) ≠ 𝐵)) |
| 4 | difsnb 4769 | . . . 4 ⊢ (¬ 𝐴 ∈ 𝐵 ↔ (𝐵 ∖ {𝐴}) = 𝐵) | |
| 5 | 4 | necon3bbii 3002 | . . 3 ⊢ (¬ ¬ 𝐴 ∈ 𝐵 ↔ (𝐵 ∖ {𝐴}) ≠ 𝐵) |
| 6 | df-pss 3919 | . . 3 ⊢ ((𝐵 ∖ {𝐴}) ⊊ 𝐵 ↔ ((𝐵 ∖ {𝐴}) ⊆ 𝐵 ∧ (𝐵 ∖ {𝐴}) ≠ 𝐵)) | |
| 7 | 3, 5, 6 | 3bitr4i 306 | . 2 ⊢ (¬ ¬ 𝐴 ∈ 𝐵 ↔ (𝐵 ∖ {𝐴}) ⊊ 𝐵) |
| 8 | 1, 7 | bitri 278 | 1 ⊢ (𝐴 ∈ 𝐵 ↔ (𝐵 ∖ {𝐴}) ⊊ 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ↔ wb 209 ∧ wa 401 ∈ wcel 2145 ≠ wne 2955 ∖ cdif 3896 ⊆ wss 3899 ⊊ wpss 3900 {csn 4584 |
| 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 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-v 3452 df-dif 3902 df-ss 3916 df-pss 3919 df-sn 4585 |
| This theorem is used by: marypha1lem 9406 infpss 10221 ominf4 10317 mrieqv2d 17730 |
| Copyright terms: Public domain | W3C validator |