| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ssdifsn | Structured version Visualization version GIF version | ||
| Description: Subset of a set with an element removed. (Contributed by Emmett Weisz, 7-Jul-2021.) (Proof shortened by JJ, 31-May-2022.) |
| Ref | Expression |
|---|---|
| ssdifsn | ⊢ (𝐴 ⊆ (𝐵 ∖ {𝐶}) ↔ (𝐴 ⊆ 𝐵 ∧ ¬ 𝐶 ∈ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | difss2 4071 | . . 3 ⊢ (𝐴 ⊆ (𝐵 ∖ {𝐶}) → 𝐴 ⊆ 𝐵) | |
| 2 | reldisj 4384 | . . . 4 ⊢ (𝐴 ⊆ 𝐵 → ((𝐴 ∩ {𝐶}) = ∅ ↔ 𝐴 ⊆ (𝐵 ∖ {𝐶}))) | |
| 3 | 2 | bicomd 225 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ⊆ (𝐵 ∖ {𝐶}) ↔ (𝐴 ∩ {𝐶}) = ∅)) |
| 4 | 1, 3 | biadanii 828 | . 2 ⊢ (𝐴 ⊆ (𝐵 ∖ {𝐶}) ↔ (𝐴 ⊆ 𝐵 ∧ (𝐴 ∩ {𝐶}) = ∅)) |
| 5 | disjsn 4646 | . . 3 ⊢ ((𝐴 ∩ {𝐶}) = ∅ ↔ ¬ 𝐶 ∈ 𝐴) | |
| 6 | 5 | anbi2i 630 | . 2 ⊢ ((𝐴 ⊆ 𝐵 ∧ (𝐴 ∩ {𝐶}) = ∅) ↔ (𝐴 ⊆ 𝐵 ∧ ¬ 𝐶 ∈ 𝐴)) |
| 7 | 4, 6 | bitri 277 | 1 ⊢ (𝐴 ⊆ (𝐵 ∖ {𝐶}) ↔ (𝐴 ⊆ 𝐵 ∧ ¬ 𝐶 ∈ 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ↔ wb 208 ∧ wa 397 = wceq 1548 ∈ wcel 2121 ∖ cdif 3882 ∩ cin 3884 ⊆ wss 3885 ∅c0 4264 {csn 4558 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-ext 2713 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-tru 1551 df-fal 1561 df-ex 1788 df-sb 2075 df-clab 2720 df-cleq 2733 df-clel 2816 df-ral 3056 df-v 3435 df-dif 3888 df-in 3892 df-ss 3902 df-nul 4265 df-sn 4559 |
| This theorem is referenced by: naddcllem 8606 isdomn6 20690 imadrhmcl 20773 isdrng4 33383 drngmxidl 33564 esplyind 33771 assafld 33833 logdivsqrle 34846 elsetrecslem 50203 |
| Copyright terms: Public domain | W3C validator |