| 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 3665 and eueq 3666. (Proof shortened by BJ, 24-Sep-2022.) |
| Ref | Expression |
|---|---|
| eueq | ⊢ (𝐴 ∈ V ↔ ∃!𝑥 𝑥 = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | moeq 3665 | . . 3 ⊢ ∃*𝑥 𝑥 = 𝐴 | |
| 2 | 1 | biantru 539 | . 2 ⊢ (∃𝑥 𝑥 = 𝐴 ↔ (∃𝑥 𝑥 = 𝐴 ∧ ∃*𝑥 𝑥 = 𝐴)) |
| 3 | isset 3465 | . 2 ⊢ (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴) | |
| 4 | df-eu 2595 | . 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 2145 ∃*wmo 2563 ∃!weu 2594 Vcvv 3451 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2733 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-v 3453 |
| This theorem is used by: eueqi 3667 reuhypd 5381 mptfnf 6666 mptfng 6670 upxp 23919 iotasbc 45359 sprval 48502 |
| Copyright terms: Public domain | W3C validator |