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

Theorem uni0c 4942
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 4941 . 2 ( 𝐴 = ∅ ↔ 𝐴 ⊆ {∅})
2 dfss3 3987 . 2 (𝐴 ⊆ {∅} ↔ ∀𝑥𝐴 𝑥 ∈ {∅})
3 velsn 4650 . . 3 (𝑥 ∈ {∅} ↔ 𝑥 = ∅)
43ralbii 3093 . 2 (∀𝑥𝐴 𝑥 ∈ {∅} ↔ ∀𝑥𝐴 𝑥 = ∅)
51, 2, 43bitri 297 1 ( 𝐴 = ∅ ↔ ∀𝑥𝐴 𝑥 = ∅)
Colors of variables: wff setvar class
Syntax hints:  wb 206   = wceq 1539  wcel 2108  wral 3061  wss 3966  c0 4342  {csn 4634   cuni 4915
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-11 2157  ax-ext 2708
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1542  df-fal 1552  df-ex 1779  df-sb 2065  df-clab 2715  df-cleq 2729  df-clel 2816  df-ral 3062  df-rex 3071  df-v 3483  df-dif 3969  df-ss 3983  df-nul 4343  df-sn 4635  df-uni 4916
This theorem is referenced by:  fin1a2lem13  10459  fctop  23036  cctop  23038  ssdifidllem  33496  ssmxidllem  33513
  Copyright terms: Public domain W3C validator