![]() |
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 4722 | . 2 ⊢ (∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃𝑦{𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = {𝑦}) | |
2 | df-reu 3369 | . 2 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
3 | df-rab 3425 | . . . 4 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} | |
4 | 3 | eqeq1i 2729 | . . 3 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑦} ↔ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = {𝑦}) |
5 | 4 | exbii 1842 | . 2 ⊢ (∃𝑦{𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑦} ↔ ∃𝑦{𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = {𝑦}) |
6 | 1, 2, 5 | 3bitr4i 303 | 1 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑦{𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑦}) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∧ wa 395 = wceq 1533 ∃wex 1773 ∈ wcel 2098 ∃!weu 2554 {cab 2701 ∃!wreu 3366 {crab 3424 {csn 4621 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2695 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-tru 1536 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2526 df-eu 2555 df-clab 2702 df-cleq 2716 df-reu 3369 df-rab 3425 df-sn 4622 |
This theorem is referenced by: reuen1 9022 cshwrepswhash1 17041 frcond3 30016 vdgn1frgrv2 30043 ddemeas 33753 |
Copyright terms: Public domain | W3C validator |