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

Theorem iunn0 5024
Description: There is a nonempty class in an indexed collection 𝐵(𝑥) iff the indexed union of them is nonempty. (Contributed by NM, 15-Oct-2003.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
Assertion
Ref Expression
iunn0 (∃𝑥 ∈ 𝐴 𝐵 ≠ ∅ ↔ ∪ 𝑥 ∈ 𝐴 𝐵 ≠ ∅)
Distinct variable group:   𝑥,𝐴
Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem iunn0
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 rexcom4 3289 . . 3 (∃𝑥 ∈ 𝐴 ∃𝑦 𝑦 ∈ 𝐵 ↔ ∃𝑦∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵)
2 eliun 4954 . . . 4 (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵)
32exbii 1880 . . 3 (∃𝑦 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑦∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵)
41, 3bitr4i 281 . 2 (∃𝑥 ∈ 𝐴 ∃𝑦 𝑦 ∈ 𝐵 ↔ ∃𝑦 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐵)
5 n0 4299 . . 3 (𝐵 ≠ ∅ ↔ ∃𝑦 𝑦 ∈ 𝐵)
65rexbii 3109 . 2 (∃𝑥 ∈ 𝐴 𝐵 ≠ ∅ ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 𝑦 ∈ 𝐵)
7 n0 4299 . 2 (∪ 𝑥 ∈ 𝐴 𝐵 ≠ ∅ ↔ ∃𝑦 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐵)
84, 6, 73bitr4i 306 1 (∃𝑥 ∈ 𝐴 𝐵 ≠ ∅ ↔ ∪ 𝑥 ∈ 𝐴 𝐵 ≠ ∅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209  ∃wex 1811   ∈ wcel 2144   ≠ wne 2955  ∃wrex 3086  ∅c0 4278  ∪ ciun 4950
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-11 2193  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-rex 3087  df-v 3452  df-dif 4047  df-nul 4279  df-iun 4952
This theorem is used by:  fsuppmapnn0fiubex  14135  lbsextlem2  21437
  Copyright terms: Public domain W3C validator