| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > reusn | Structured version Visualization version GIF version | ||
| Description: A way to express restricted existential uniqueness of a wff: its restricted class abstraction is a singleton. (Contributed by NM, 30-May-2006.) (Proof shortened by Mario Carneiro, 14-Nov-2016.) |
| Ref | Expression |
|---|---|
| reusn | ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑦{𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑦}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | euabsn2 4669 | . 2 ⊢ (∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃𝑦{𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = {𝑦}) | |
| 2 | df-reu 3343 | . 2 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
| 3 | df-rab 3390 | . . . 4 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} | |
| 4 | 3 | eqeq1i 2741 | . . 3 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑦} ↔ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = {𝑦}) |
| 5 | 4 | exbii 1850 | . 2 ⊢ (∃𝑦{𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑦} ↔ ∃𝑦{𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = {𝑦}) |
| 6 | 1, 2, 5 | 3bitr4i 303 | 1 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑦{𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑦}) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 = wceq 1542 ∃wex 1781 ∈ wcel 2114 ∃!weu 2568 {cab 2714 ∃!wreu 3340 {crab 3389 {csn 4567 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-tru 1545 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-reu 3343 df-rab 3390 df-sn 4568 |
| This theorem is referenced by: reuen1 8973 cshwrepswhash1 17073 frcond3 30339 vdgn1frgrv2 30366 ddemeas 34380 fineqvnttrclselem1 35265 fineqvnttrclselem2 35266 wevgblacfn 35291 |
| Copyright terms: Public domain | W3C validator |