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 3920 . 2 (𝐴 ⊆ {∅} ↔ ∀𝑥𝐴 𝑥 ∈ {∅})
3 velsn 4600 . . 3 (𝑥 ∈ {∅} ↔ 𝑥 = ∅)
43ralbii 3108 . 2 (∀𝑥𝐴 𝑥 ∈ {∅} ↔ ∀𝑥𝐴 𝑥 = ∅)
51, 2, 43bitri 300 1 ( 𝐴 = ∅ ↔ ∀𝑥𝐴 𝑥 = ∅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wb 209   = wceq 1570  wcel 2145  wral 3076  wss 3899  c0 4279  {csn 4584   cuni 4867
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-11 2194  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-v 3452  df-dif 3902  df-ss 3916  df-nul 4280  df-sn 4585  df-uni 4868
This theorem is used by:  fin1a2lem13  10414  ssdifidllem  21547  fctop  23229  cctop  23231  ssmxidllem  33876
  Copyright terms: Public domain W3C validator