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

Theorem iunn0 4732
 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 3365 . . 3 (∃𝑥𝐴𝑦 𝑦𝐵 ↔ ∃𝑦𝑥𝐴 𝑦𝐵)
2 eliun 4676 . . . 4 (𝑦 𝑥𝐴 𝐵 ↔ ∃𝑥𝐴 𝑦𝐵)
32exbii 1923 . . 3 (∃𝑦 𝑦 𝑥𝐴 𝐵 ↔ ∃𝑦𝑥𝐴 𝑦𝐵)
41, 3bitr4i 267 . 2 (∃𝑥𝐴𝑦 𝑦𝐵 ↔ ∃𝑦 𝑦 𝑥𝐴 𝐵)
5 n0 4074 . . 3 (𝐵 ≠ ∅ ↔ ∃𝑦 𝑦𝐵)
65rexbii 3179 . 2 (∃𝑥𝐴 𝐵 ≠ ∅ ↔ ∃𝑥𝐴𝑦 𝑦𝐵)
7 n0 4074 . 2 ( 𝑥𝐴 𝐵 ≠ ∅ ↔ ∃𝑦 𝑦 𝑥𝐴 𝐵)
84, 6, 73bitr4i 292 1 (∃𝑥𝐴 𝐵 ≠ ∅ ↔ 𝑥𝐴 𝐵 ≠ ∅)
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 196  ∃wex 1853   ∈ wcel 2139   ≠ wne 2932  ∃wrex 3051  ∅c0 4058  ∪ ciun 4672 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ne 2933  df-ral 3055  df-rex 3056  df-v 3342  df-dif 3718  df-nul 4059  df-iun 4674 This theorem is referenced by:  fsuppmapnn0fiubex  13006  lbsextlem2  19381
 Copyright terms: Public domain W3C validator