| 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 4747 | . 2 ⊢ (𝐴 ∈ (V ∖ {𝐵}) ↔ (𝐴 ∈ V ∧ 𝐴 ≠ 𝐵)) | |
| 2 | elex 3476 | . . 3 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V) | |
| 3 | 2 | biantrurd 540 | . 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ≠ 𝐵 ↔ (𝐴 ∈ V ∧ 𝐴 ≠ 𝐵))) |
| 4 | 1, 3 | bitr4id 292 | 1 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ (V ∖ {𝐵}) ↔ 𝐴 ≠ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∈ wcel 2143 ≠ wne 2958 Vcvv 3455 ∖ cdif 3902 {csn 4583 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-ext 2735 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-tru 1564 df-ex 1801 df-sb 2092 df-clab 2742 df-cleq 2755 df-clel 2838 df-ne 2959 df-v 3457 df-dif 3908 df-sn 4584 |
| This theorem is referenced by: cnvimadfsn 8153 |
| Copyright terms: Public domain | W3C validator |