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

Theorem iunopn 21505
Description: The indexed union of a subset of a topology is an open set. (Contributed by NM, 5-Oct-2006.)
Assertion
Ref Expression
iunopn ((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵𝐽) → 𝑥𝐴 𝐵𝐽)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐽
Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem iunopn
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 dfiun2g 4954 . . 3 (∀𝑥𝐴 𝐵𝐽 𝑥𝐴 𝐵 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵})
21adantl 484 . 2 ((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵𝐽) → 𝑥𝐴 𝐵 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵})
3 uniiunlem 4060 . . . 4 (∀𝑥𝐴 𝐵𝐽 → (∀𝑥𝐴 𝐵𝐽 ↔ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ⊆ 𝐽))
43ibi 269 . . 3 (∀𝑥𝐴 𝐵𝐽 → {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ⊆ 𝐽)
5 uniopn 21504 . . 3 ((𝐽 ∈ Top ∧ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ⊆ 𝐽) → {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ∈ 𝐽)
64, 5sylan2 594 . 2 ((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵𝐽) → {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ∈ 𝐽)
72, 6eqeltrd 2913 1 ((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵𝐽) → 𝑥𝐴 𝐵𝐽)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1533  wcel 2110  {cab 2799  wral 3138  wrex 3139  wss 3935   cuni 4837   ciun 4918  Topctop 21500
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5202
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-in 3942  df-ss 3951  df-pw 4540  df-uni 4838  df-iun 4920  df-top 21501
This theorem is referenced by:  iincld  21646  tgcn  21859  kgentopon  22145  xkococnlem  22266  qtoptop2  22306  zcld  23420  metnrmlem2  23467  cnambfre  34939
  Copyright terms: Public domain W3C validator