| 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 4098 | . . . 4 ⊢ (𝐵 ∖ {𝐴}) ⊆ 𝐵 | |
| 3 | 2 | biantrur 539 | . . 3 ⊢ ((𝐵 ∖ {𝐴}) ≠ 𝐵 ↔ ((𝐵 ∖ {𝐴}) ⊆ 𝐵 ∧ (𝐵 ∖ {𝐴}) ≠ 𝐵)) |
| 4 | difsnb 4778 | . . . 4 ⊢ (¬ 𝐴 ∈ 𝐵 ↔ (𝐵 ∖ {𝐴}) = 𝐵) | |
| 5 | 4 | necon3bbii 3011 | . . 3 ⊢ (¬ ¬ 𝐴 ∈ 𝐵 ↔ (𝐵 ∖ {𝐴}) ≠ 𝐵) |
| 6 | df-pss 3933 | . . 3 ⊢ ((𝐵 ∖ {𝐴}) ⊊ 𝐵 ↔ ((𝐵 ∖ {𝐴}) ⊆ 𝐵 ∧ (𝐵 ∖ {𝐴}) ≠ 𝐵)) | |
| 7 | 3, 5, 6 | 3bitr4i 306 | . 2 ⊢ (¬ ¬ 𝐴 ∈ 𝐵 ↔ (𝐵 ∖ {𝐴}) ⊊ 𝐵) |
| 8 | 1, 7 | bitri 278 | 1 ⊢ (𝐴 ∈ 𝐵 ↔ (𝐵 ∖ {𝐴}) ⊊ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ↔ wb 209 ∧ wa 400 ∈ wcel 2149 ≠ wne 2964 ∖ cdif 3910 ⊆ wss 3913 ⊊ wpss 3914 {csn 4594 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-tru 1570 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-ne 2965 df-v 3465 df-dif 3916 df-ss 3930 df-pss 3933 df-sn 4595 |
| This theorem is referenced by: marypha1lem 9393 infpss 10199 ominf4 10296 mrieqv2d 17695 |
| Copyright terms: Public domain | W3C validator |