| 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 4092 | . . 3 ⊢ (𝐴 ⊆ (𝐵 ∖ {𝐶}) → 𝐴 ⊆ 𝐵) | |
| 2 | reldisj 4407 | . . . 4 ⊢ (𝐴 ⊆ 𝐵 → ((𝐴 ∩ {𝐶}) = ∅ ↔ 𝐴 ⊆ (𝐵 ∖ {𝐶}))) | |
| 3 | 2 | bicomd 223 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ⊆ (𝐵 ∖ {𝐶}) ↔ (𝐴 ∩ {𝐶}) = ∅)) |
| 4 | 1, 3 | biadanii 822 | . 2 ⊢ (𝐴 ⊆ (𝐵 ∖ {𝐶}) ↔ (𝐴 ⊆ 𝐵 ∧ (𝐴 ∩ {𝐶}) = ∅)) |
| 5 | disjsn 4670 | . . 3 ⊢ ((𝐴 ∩ {𝐶}) = ∅ ↔ ¬ 𝐶 ∈ 𝐴) | |
| 6 | 5 | anbi2i 624 | . 2 ⊢ ((𝐴 ⊆ 𝐵 ∧ (𝐴 ∩ {𝐶}) = ∅) ↔ (𝐴 ⊆ 𝐵 ∧ ¬ 𝐶 ∈ 𝐴)) |
| 7 | 4, 6 | bitri 275 | 1 ⊢ (𝐴 ⊆ (𝐵 ∖ {𝐶}) ↔ (𝐴 ⊆ 𝐵 ∧ ¬ 𝐶 ∈ 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∖ cdif 3900 ∩ cin 3902 ⊆ wss 3903 ∅c0 4287 {csn 4582 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-v 3444 df-dif 3906 df-in 3910 df-ss 3920 df-nul 4288 df-sn 4583 |
| This theorem is referenced by: naddcllem 8616 isdomn6 20664 imadrhmcl 20747 isdrng4 33395 drngmxidl 33576 esplyind 33758 assafld 33821 logdivsqrle 34834 elsetrecslem 50087 |
| Copyright terms: Public domain | W3C validator |