Theorem uni0c 3913

Description: The union of a set is empty iff all of its members are empty. (Contributed by NM, 16-Aug-2006.)

Assertion

Ref	Expression
uni0c	⊢ (∪ 𝐴 = ∅ ↔ ∀𝑥 ∈ 𝐴 𝑥 = ∅)

Distinct variable group:   𝑥,𝐴

Proof of Theorem uni0c

Step	Hyp	Ref	Expression
1		uni0b 3912	. 2 ⊢ (∪ 𝐴 = ∅ ↔ 𝐴 ⊆ {∅})
2		dfss3 3213	. 2 ⊢ (𝐴 ⊆ {∅} ↔ ∀𝑥 ∈ 𝐴 𝑥 ∈ {∅})
3		velsn 3683	. . 3 ⊢ (𝑥 ∈ {∅} ↔ 𝑥 = ∅)
4	3	ralbii 2536	. 2 ⊢ (∀𝑥 ∈ 𝐴 𝑥 ∈ {∅} ↔ ∀𝑥 ∈ 𝐴 𝑥 = ∅)
5	1, 2, 4	3bitri 206	1 ⊢ (∪ 𝐴 = ∅ ↔ ∀𝑥 ∈ 𝐴 𝑥 = ∅)

Syntax hints:   ↔ wb 105   = wceq 1395   ∈ wcel 2200  ∀wral 2508   ⊆ wss 3197  ∅c0 3491  {csn 3666  ∪ cuni 3887

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211

This theorem depends on definitions:  df-bi 117  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-dif 3199  df-in 3203  df-ss 3210  df-nul 3492  df-sn 3672  df-uni 3888

This theorem is referenced by: (None)