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

Theorem reusn 4659
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 4657 . 2 (∃!𝑥(𝑥𝐴𝜑) ↔ ∃𝑦{𝑥 ∣ (𝑥𝐴𝜑)} = {𝑦})
2 df-reu 3345 . 2 (∃!𝑥𝐴 𝜑 ↔ ∃!𝑥(𝑥𝐴𝜑))
3 df-rab 3392 . . . 4 {𝑥𝐴𝜑} = {𝑥 ∣ (𝑥𝐴𝜑)}
43eqeq1i 2744 . . 3 ({𝑥𝐴𝜑} = {𝑦} ↔ {𝑥 ∣ (𝑥𝐴𝜑)} = {𝑦})
54exbii 1855 . 2 (∃𝑦{𝑥𝐴𝜑} = {𝑦} ↔ ∃𝑦{𝑥 ∣ (𝑥𝐴𝜑)} = {𝑦})
61, 2, 53bitr4i 304 1 (∃!𝑥𝐴 𝜑 ↔ ∃𝑦{𝑥𝐴𝜑} = {𝑦})
Colors of variables: wff setvar class
Syntax hints:  wb 207  wa 396   = wceq 1547  wex 1786  wcel 2119  ∃!weu 2572  {cab 2717  ∃!wreu 3342  {crab 3391  {csn 4555
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-tru 1550  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-reu 3345  df-rab 3392  df-sn 4556
This theorem is referenced by:  reuen1  8963  cshwrepswhash1  17064  frcond3  30357  vdgn1frgrv2  30384  ddemeas  34420  fineqvnttrclselem1  35302  fineqvnttrclselem2  35303  wevgblacfn  35337
  Copyright terms: Public domain W3C validator