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

Theorem reusn 4648
 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 4646 . 2 (∃!𝑥(𝑥𝐴𝜑) ↔ ∃𝑦{𝑥 ∣ (𝑥𝐴𝜑)} = {𝑦})
2 df-reu 3140 . 2 (∃!𝑥𝐴 𝜑 ↔ ∃!𝑥(𝑥𝐴𝜑))
3 df-rab 3142 . . . 4 {𝑥𝐴𝜑} = {𝑥 ∣ (𝑥𝐴𝜑)}
43eqeq1i 2829 . . 3 ({𝑥𝐴𝜑} = {𝑦} ↔ {𝑥 ∣ (𝑥𝐴𝜑)} = {𝑦})
54exbii 1849 . 2 (∃𝑦{𝑥𝐴𝜑} = {𝑦} ↔ ∃𝑦{𝑥 ∣ (𝑥𝐴𝜑)} = {𝑦})
61, 2, 53bitr4i 306 1 (∃!𝑥𝐴 𝜑 ↔ ∃𝑦{𝑥𝐴𝜑} = {𝑦})
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 209   ∧ wa 399   = wceq 1538  ∃wex 1781   ∈ wcel 2115  ∃!weu 2654  {cab 2802  ∃!wreu 3135  {crab 3137  {csn 4550 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 1971  ax-7 2016  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2179  ax-ext 2796 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-mo 2624  df-eu 2655  df-clab 2803  df-cleq 2817  df-reu 3140  df-rab 3142  df-sn 4551 This theorem is referenced by:  reuen1  8576  cshwrepswhash1  16438  frcond3  28063  vdgn1frgrv2  28090  ddemeas  31580
 Copyright terms: Public domain W3C validator