| 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 4681 | . 2 ⊢ (∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃𝑦{𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = {𝑦}) | |
| 2 | df-reu 3367 | . 2 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
| 3 | df-rab 3414 | . . . 4 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} | |
| 4 | 3 | eqeq1i 2766 | . . 3 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑦} ↔ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = {𝑦}) |
| 5 | 4 | exbii 1867 | . 2 ⊢ (∃𝑦{𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑦} ↔ ∃𝑦{𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = {𝑦}) |
| 6 | 1, 2, 5 | 3bitr4i 305 | 1 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑦{𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑦}) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 208 ∧ wa 399 = wceq 1559 ∃wex 1798 ∈ wcel 2141 ∃!weu 2594 {cab 2739 ∃!wreu 3364 {crab 3413 {csn 4579 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-tru 1562 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-reu 3367 df-rab 3414 df-sn 4580 |
| This theorem is referenced by: reuen1 9001 cshwrepswhash1 17129 frcond3 30428 vdgn1frgrv2 30455 ddemeas 34494 fineqvnttrclselem1 35378 fineqvnttrclselem2 35379 wevgblacfn 35415 |
| Copyright terms: Public domain | W3C validator |