| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ssdifeq0 | GIF version | ||
| Description: A class is a subclass of itself subtracted from another iff it is the empty set. (Contributed by Steve Rodriguez, 20-Nov-2015.) |
| Ref | Expression |
|---|---|
| ssdifeq0 | ⊢ (𝐴 ⊆ (𝐵 ∖ 𝐴) ↔ 𝐴 = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | inidm 3372 | . . 3 ⊢ (𝐴 ∩ 𝐴) = 𝐴 | |
| 2 | ssdifin0 3532 | . . 3 ⊢ (𝐴 ⊆ (𝐵 ∖ 𝐴) → (𝐴 ∩ 𝐴) = ∅) | |
| 3 | 1, 2 | eqtr3id 2243 | . 2 ⊢ (𝐴 ⊆ (𝐵 ∖ 𝐴) → 𝐴 = ∅) |
| 4 | 0ss 3489 | . . 3 ⊢ ∅ ⊆ (𝐵 ∖ ∅) | |
| 5 | id 19 | . . . 4 ⊢ (𝐴 = ∅ → 𝐴 = ∅) | |
| 6 | difeq2 3275 | . . . 4 ⊢ (𝐴 = ∅ → (𝐵 ∖ 𝐴) = (𝐵 ∖ ∅)) | |
| 7 | 5, 6 | sseq12d 3214 | . . 3 ⊢ (𝐴 = ∅ → (𝐴 ⊆ (𝐵 ∖ 𝐴) ↔ ∅ ⊆ (𝐵 ∖ ∅))) |
| 8 | 4, 7 | mpbiri 168 | . 2 ⊢ (𝐴 = ∅ → 𝐴 ⊆ (𝐵 ∖ 𝐴)) |
| 9 | 3, 8 | impbii 126 | 1 ⊢ (𝐴 ⊆ (𝐵 ∖ 𝐴) ↔ 𝐴 = ∅) |
| Colors of variables: wff set class |
| Syntax hints: ↔ wb 105 = wceq 1364 ∖ cdif 3154 ∩ cin 3156 ⊆ wss 3157 ∅c0 3450 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-ext 2178 |
| This theorem depends on definitions: df-bi 117 df-tru 1367 df-nf 1475 df-sb 1777 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ral 2480 df-rab 2484 df-v 2765 df-dif 3159 df-in 3163 df-ss 3170 df-nul 3451 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |