Theorem eusn 2450

Description: Another way to express existential uniqueness of a wff: its class abstraction is a singleton.

Assertion

Ref	Expression
eusn	|- (E!xph <-> E.x{x | ph} = {x})

Proof of Theorem eusn

Step	Hyp	Ref	Expression
1		abeq1 1572	. . . 4 |- ({x | ph} = {y} <-> A.x(ph <-> x e. {y}))
2		elsn 2425	. . . . . 6 |- (x e. {y} <-> x = y)
3	2	bibi2i 610	. . . . 5 |- ((ph <-> x e. {y}) <-> (ph <-> x = y))
4	3	albii 1001	. . . 4 |- (A.x(ph <-> x e. {y}) <-> A.x(ph <-> x = y))
5	1, 4	bitr 173	. . 3 |- ({x | ph} = {y} <-> A.x(ph <-> x = y))
6	5	exbii 1053	. 2 |- (E.y{x | ph} = {y} <-> E.yA.x(ph <-> x = y))
7		ax-17 973	. . 3 |- ({x | ph} = {x} -> A.y{x | ph} = {x})
8		hbab1 1469	. . . 4 |- (y e. {x | ph} -> A.x y e. {x | ph})
9		ax-17 973	. . . 4 |- (z e. {y} -> A.x z e. {y})
10	8, 9	hbeq 1568	. . 3 |- ({x | ph} = {y} -> A.x{x | ph} = {y})
11		sneq 2421	. . . 4 |- (x = y -> {x} = {y})
12	11	eqeq2d 1489	. . 3 |- (x = y -> ({x | ph} = {x} <-> {x | ph} = {y}))
13	7, 10, 12	cbvex 1168	. 2 |- (E.x{x | ph} = {x} <-> E.y{x | ph} = {y})
14		df-eu 1384	. 2 |- (E!xph <-> E.yA.x(ph <-> x = y))
15	6, 13, 14	3bitr4r 184	1 |- (E!xph <-> E.x{x | ph} = {x})

Syntax hints:   <-> wb 146  A.wal 956   = wceq 958   e. wcel 960  E.wex 982  E!weu 1382  {cab 1466  {csn 2413

This theorem is referenced by:  euuni 2887  reucl 2891  reusn 2898  args 3434  mapsn 4351

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-10 968  ax-12 970  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462

This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 983  df-sb 1174  df-eu 1384  df-clab 1467  df-cleq 1472  df-clel 1475  df-sn 2416

Copyright terms: Public domain