| 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 4756 | . . 3 ⊢ (𝑋 ∈ 𝐴 → {𝑋} ⊆ 𝐴) | |
| 2 | 1 | sscond 4103 | . 2 ⊢ (𝑋 ∈ 𝐴 → (𝐵 ∖ 𝐴) ⊆ (𝐵 ∖ {𝑋})) |
| 3 | 2 | sselda 3940 | 1 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ (𝐵 ∖ 𝐴)) → 𝑌 ∈ (𝐵 ∖ {𝑋})) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∈ wcel 2146 ∖ cdif 3905 {csn 4594 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2738 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2745 df-cleq 2758 df-clel 2841 df-v 3460 df-dif 3911 df-ss 3925 df-sn 4595 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |