Theorem uni0b 3917

Description: The union of a set is empty iff the set is included in the singleton of the empty set. (Contributed by NM, 12-Sep-2004.)

Assertion

Ref	Expression
uni0b	|- (U.A = (/) <-> A C_ {(/)})

Proof of Theorem uni0b

Dummy variables x y are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elsn 3749	. . 3 |- (x e. {(/)} <-> x = (/))
2	1	ralbii 2639	. 2 |- (A.x e. A x e. {(/)} <-> A.x e. A x = (/))
3		dfss3 3264	. 2 |- (A C_ {(/)} <-> A.x e. A x e. {(/)})
4		neq0 3561	. . . 4 |- (-. U.A = (/) <-> E.y y e. U.A)
5		rexcom4 2879	. . . . 5 |- (E.x e. A E.y y e. x <-> E.yE.x e. A y e. x)
6		neq0 3561	. . . . . 6 |- (-. x = (/) <-> E.y y e. x)
7	6	rexbii 2640	. . . . 5 |- (E.x e. A -. x = (/) <-> E.x e. A E.y y e. x)
8		eluni2 3896	. . . . . 6 |- (y e. U.A <-> E.x e. A y e. x)
9	8	exbii 1582	. . . . 5 |- (E.y y e. U.A <-> E.yE.x e. A y e. x)
10	5, 7, 9	3bitr4ri 269	. . . 4 |- (E.y y e. U.A <-> E.x e. A -. x = (/))
11		rexnal 2626	. . . 4 |- (E.x e. A -. x = (/) <-> -. A.x e. A x = (/))
12	4, 10, 11	3bitri 262	. . 3 |- (-. U.A = (/) <-> -. A.x e. A x = (/))
13	12	con4bii 288	. 2 |- (U.A = (/) <-> A.x e. A x = (/))
14	2, 3, 13	3bitr4ri 269	1 |- (U.A = (/) <-> A C_ {(/)})

Syntax hints:  -. wn 3   <-> wb 176  E.wex 1541   = wceq 1642   e. wcel 1710  A.wral 2615  E.wrex 2616   C_ wss 3258  (/)c0 3551  {csn 3738  U.cuni 3892

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334

This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2479  df-ne 2519  df-ral 2620  df-rex 2621  df-v 2862  df-nin 3212  df-compl 3213  df-in 3214  df-dif 3216  df-ss 3260  df-nul 3552  df-sn 3742  df-uni 3893

This theorem is referenced by:  uni0c  3918  uni0  3919