MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  reusn Structured version   Visualization version   GIF version

Theorem reusn 4680
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.)
Assertion
Ref Expression
reusn (∃!𝑥𝐴 𝜑 ↔ ∃𝑦{𝑥𝐴𝜑} = {𝑦})
Distinct variable groups:   𝑥,𝑦   𝜑,𝑦   𝑦,𝐴
Allowed substitution hints:   𝜑(𝑥)   𝐴(𝑥)

Proof of Theorem reusn
StepHypRef Expression
1 euabsn2 4678 . 2 (∃!𝑥(𝑥𝐴𝜑) ↔ ∃𝑦{𝑥 ∣ (𝑥𝐴𝜑)} = {𝑦})
2 df-reu 3347 . 2 (∃!𝑥𝐴 𝜑 ↔ ∃!𝑥(𝑥𝐴𝜑))
3 df-rab 3396 . . . 4 {𝑥𝐴𝜑} = {𝑥 ∣ (𝑥𝐴𝜑)}
43eqeq1i 2736 . . 3 ({𝑥𝐴𝜑} = {𝑦} ↔ {𝑥 ∣ (𝑥𝐴𝜑)} = {𝑦})
54exbii 1849 . 2 (∃𝑦{𝑥𝐴𝜑} = {𝑦} ↔ ∃𝑦{𝑥 ∣ (𝑥𝐴𝜑)} = {𝑦})
61, 2, 53bitr4i 303 1 (∃!𝑥𝐴 𝜑 ↔ ∃𝑦{𝑥𝐴𝜑} = {𝑦})
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395   = wceq 1541  wex 1780  wcel 2111  ∃!weu 2563  {cab 2709  ∃!wreu 3344  {crab 3395  {csn 4576
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1544  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-reu 3347  df-rab 3396  df-sn 4577
This theorem is referenced by:  reuen1  8948  cshwrepswhash1  17014  frcond3  30247  vdgn1frgrv2  30274  ddemeas  34247  fineqvnttrclselem1  35139  fineqvnttrclselem2  35140  wevgblacfn  35151
  Copyright terms: Public domain W3C validator