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

Theorem iunn0 5033
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 3298 . . 3 (∃𝑥𝐴𝑦 𝑦𝐵 ↔ ∃𝑦𝑥𝐴 𝑦𝐵)
2 eliun 4962 . . . 4 (𝑦 𝑥𝐴 𝐵 ↔ ∃𝑥𝐴 𝑦𝐵)
32exbii 1875 . . 3 (∃𝑦 𝑦 𝑥𝐴 𝐵 ↔ ∃𝑦𝑥𝐴 𝑦𝐵)
41, 3bitr4i 281 . 2 (∃𝑥𝐴𝑦 𝑦𝐵 ↔ ∃𝑦 𝑦 𝑥𝐴 𝐵)
5 n0 4313 . . 3 (𝐵 ≠ ∅ ↔ ∃𝑦 𝑦𝐵)
65rexbii 3118 . 2 (∃𝑥𝐴 𝐵 ≠ ∅ ↔ ∃𝑥𝐴𝑦 𝑦𝐵)
7 n0 4313 . 2 ( 𝑥𝐴 𝐵 ≠ ∅ ↔ ∃𝑦 𝑦 𝑥𝐴 𝐵)
84, 6, 73bitr4i 306 1 (∃𝑥𝐴 𝐵 ≠ ∅ ↔ 𝑥𝐴 𝐵 ≠ ∅)
Colors of variables: wff setvar class
Syntax hints:  wb 209  wex 1806  wcel 2149  wne 2964  wrex 3095  c0 4292   ciun 4958
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-11 2198  ax-ext 2741
This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ne 2965  df-rex 3096  df-v 3463  df-dif 3914  df-nul 4293  df-iun 4960
This theorem is referenced by:  fsuppmapnn0fiubex  14028  lbsextlem2  21261
  Copyright terms: Public domain W3C validator