Theorem reusn 4684

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

Step	Hyp	Ref	Expression
1		euabsn2 4682	. 2 ⊢ (∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃𝑦{𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = {𝑦})
2		df-reu 3366	. 2 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
3		df-rab 3413	. . . 4 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)}
4	3	eqeq1i 2765	. . 3 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑦} ↔ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = {𝑦})
5	4	exbii 1880	. 2 ⊢ (∃𝑦{𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑦} ↔ ∃𝑦{𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = {𝑦})
6	1, 2, 5	3bitr4i 306	1 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑦{𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑦})

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2144  ∃!weu 2593  {cab 2738  ∃!wreu 3363  {crab 3412  {csn 4584

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-reu 3366  df-rab 3413  df-sn 4585

This theorem is used by:  reuen1  9058  cshwrepswhash1  17287  frcond3  30877  vdgn1frgrv2  30904  ddemeas  34917  fineqvnttrclselem1  35847  fineqvnttrclselem2  35848  wevgblacfn  35960