![]() |
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 4811 | . 2 ⊢ (𝐴 ∈ (V ∖ {𝐵}) ↔ (𝐴 ∈ V ∧ 𝐴 ≠ 𝐵)) | |
2 | elex 3509 | . . 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 206 ∧ wa 395 ∈ wcel 2108 ≠ wne 2946 Vcvv 3488 ∖ cdif 3973 {csn 4648 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2711 |
This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1540 df-ex 1778 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-ne 2947 df-v 3490 df-dif 3979 df-sn 4649 |
This theorem is referenced by: cnvimadfsn 8213 |
Copyright terms: Public domain | W3C validator |