![]() |
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 4785 | . 2 ⊢ (𝐴 ∈ (V ∖ {𝐵}) ↔ (𝐴 ∈ V ∧ 𝐴 ≠ 𝐵)) | |
2 | elex 3487 | . . 3 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V) | |
3 | 2 | biantrurd 532 | . 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ≠ 𝐵 ↔ (𝐴 ∈ V ∧ 𝐴 ≠ 𝐵))) |
4 | 1, 3 | bitr4id 290 | 1 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ (V ∖ {𝐵}) ↔ 𝐴 ≠ 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∈ wcel 2098 ≠ wne 2934 Vcvv 3468 ∖ cdif 3940 {csn 4623 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-ext 2697 |
This theorem depends on definitions: df-bi 206 df-an 396 df-tru 1536 df-ex 1774 df-sb 2060 df-clab 2704 df-cleq 2718 df-clel 2804 df-ne 2935 df-v 3470 df-dif 3946 df-sn 4624 |
This theorem is referenced by: cnvimadfsn 8157 |
Copyright terms: Public domain | W3C validator |