| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > eldifvsn | Structured version Visualization version GIF version | ||
| Description: A set is an element of the universal class excluding a singleton iff it is not the singleton element. (Contributed by AV, 7-Apr-2019.) |
| Ref | Expression |
|---|---|
| eldifvsn | ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ (V ∖ {𝐵}) ↔ 𝐴 ≠ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eldifsn 4748 | . 2 ⊢ (𝐴 ∈ (V ∖ {𝐵}) ↔ (𝐴 ∈ V ∧ 𝐴 ≠ 𝐵)) | |
| 2 | elex 3475 | . . 3 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V) | |
| 3 | 2 | biantrurd 542 | . 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ≠ 𝐵 ↔ (𝐴 ∈ V ∧ 𝐴 ≠ 𝐵))) |
| 4 | 1, 3 | bitr4id 293 | 1 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ (V ∖ {𝐵}) ↔ 𝐴 ≠ 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∈ wcel 2146 ≠ wne 2959 Vcvv 3454 ∖ cdif 4048 {csn 4588 |
| 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 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1572 df-ex 1812 df-sb 2101 df-clab 2742 df-cleq 2755 df-clel 2839 df-ne 2960 df-v 3456 df-dif 4050 df-sn 4589 |
| This theorem is used by: cnvimadfsn 8203 |
| Copyright terms: Public domain | W3C validator |