| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > eueq | Structured version Visualization version GIF version | ||
| Description: A class is a set if and only if there exists a unique set equal to it. (Contributed by NM, 25-Nov-1994.) Shorten combined proofs of moeq 3668 and eueq 3669. (Proof shortened by BJ, 24-Sep-2022.) |
| Ref | Expression |
|---|---|
| eueq | ⊢ (𝐴 ∈ V ↔ ∃!𝑥 𝑥 = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | moeq 3668 | . . 3 ⊢ ∃*𝑥 𝑥 = 𝐴 | |
| 2 | 1 | biantru 539 | . 2 ⊢ (∃𝑥 𝑥 = 𝐴 ↔ (∃𝑥 𝑥 = 𝐴 ∧ ∃*𝑥 𝑥 = 𝐴)) |
| 3 | isset 3468 | . 2 ⊢ (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴) | |
| 4 | df-eu 2597 | . 2 ⊢ (∃!𝑥 𝑥 = 𝐴 ↔ (∃𝑥 𝑥 = 𝐴 ∧ ∃*𝑥 𝑥 = 𝐴)) | |
| 5 | 2, 3, 4 | 3bitr4i 306 | 1 ⊢ (𝐴 ∈ V ↔ ∃!𝑥 𝑥 = 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 = wceq 1570 ∃wex 1812 ∈ wcel 2147 ∃*wmo 2565 ∃!weu 2596 Vcvv 3454 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-v 3456 |
| This theorem is used by: eueqi 3670 reuhypd 5385 mptfnf 6696 mptfng 6700 upxp 23972 iotasbc 45594 sprval 48766 |
| Copyright terms: Public domain | W3C validator |