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

Theorem iunn0 5029
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 3291 . . 3 (∃𝑥𝐴𝑦 𝑦𝐵 ↔ ∃𝑦𝑥𝐴 𝑦𝐵)
2 eliun 4958 . . . 4 (𝑦 𝑥𝐴 𝐵 ↔ ∃𝑥𝐴 𝑦𝐵)
32exbii 1881 . . 3 (∃𝑦 𝑦 𝑥𝐴 𝐵 ↔ ∃𝑦𝑥𝐴 𝑦𝐵)
41, 3bitr4i 281 . 2 (∃𝑥𝐴𝑦 𝑦𝐵 ↔ ∃𝑦 𝑦 𝑥𝐴 𝐵)
5 n0 4303 . . 3 (𝐵 ≠ ∅ ↔ ∃𝑦 𝑦𝐵)
65rexbii 3111 . 2 (∃𝑥𝐴 𝐵 ≠ ∅ ↔ ∃𝑥𝐴𝑦 𝑦𝐵)
7 n0 4303 . 2 ( 𝑥𝐴 𝐵 ≠ ∅ ↔ ∃𝑦 𝑦 𝑥𝐴 𝐵)
84, 6, 73bitr4i 306 1 (∃𝑥𝐴 𝐵 ≠ ∅ ↔ 𝑥𝐴 𝐵 ≠ ∅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wb 209  wex 1812  wcel 2145  wne 2957  wrex 3088  c0 4282   ciun 4954
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 2734
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 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-rex 3089  df-v 3455  df-dif 3905  df-nul 4283  df-iun 4956
This theorem is used by:  fsuppmapnn0fiubex  14058  lbsextlem2  21347
  Copyright terms: Public domain W3C validator