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

Theorem uni0c 4895
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
StepHypRef Expression
1 uni0b 4894 . 2 ( 𝐴 = ∅ ↔ 𝐴 ⊆ {∅})
2 dfss3 3928 . 2 (𝐴 ⊆ {∅} ↔ ∀𝑥𝐴 𝑥 ∈ {∅})
3 velsn 4601 . . 3 (𝑥 ∈ {∅} ↔ 𝑥 = ∅)
43ralbii 3111 . 2 (∀𝑥𝐴 𝑥 ∈ {∅} ↔ ∀𝑥𝐴 𝑥 = ∅)
51, 2, 43bitri 300 1 ( 𝐴 = ∅ ↔ ∀𝑥𝐴 𝑥 = ∅)
Colors of variables: wff setvar class
Syntax hints:  wb 209   = wceq 1563  wcel 2145  wral 3079  wss 3907  c0 4288  {csn 4585   cuni 4867
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-11 2194  ax-ext 2737
This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1566  df-fal 1576  df-ex 1803  df-sb 2094  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3080  df-rex 3090  df-v 3459  df-dif 3910  df-ss 3924  df-nul 4289  df-sn 4586  df-uni 4868
This theorem is referenced by:  fin1a2lem13  10384  ssdifidllem  21441  fctop  23118  cctop  23120  ssmxidllem  33668
  Copyright terms: Public domain W3C validator