| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > eldifeldifsn | Structured version Visualization version GIF version | ||
| Description: An element of a difference set is an element of the difference with a singleton. (Contributed by AV, 2-Jan-2022.) |
| Ref | Expression |
|---|---|
| eldifeldifsn | ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ (𝐵 ∖ 𝐴)) → 𝑌 ∈ (𝐵 ∖ {𝑋})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | snssi 4745 | . . 3 ⊢ (𝑋 ∈ 𝐴 → {𝑋} ⊆ 𝐴) | |
| 2 | 1 | sscond 4082 | . 2 ⊢ (𝑋 ∈ 𝐴 → (𝐵 ∖ 𝐴) ⊆ (𝐵 ∖ {𝑋})) |
| 3 | 2 | sselda 3908 | 1 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ (𝐵 ∖ 𝐴)) → 𝑌 ∈ (𝐵 ∖ {𝑋})) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∈ wcel 2144 ∖ cdif 4045 {csn 4583 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1572 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-v 3452 df-ss 3896 df-dif 4047 df-sn 4584 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |