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

Theorem iunopn 22813
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 4978 . . 3 (∀𝑥𝐴 𝐵𝐽 𝑥𝐴 𝐵 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵})
21adantl 481 . 2 ((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵𝐽) → 𝑥𝐴 𝐵 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵})
3 uniiunlem 4034 . . . 4 (∀𝑥𝐴 𝐵𝐽 → (∀𝑥𝐴 𝐵𝐽 ↔ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ⊆ 𝐽))
43ibi 267 . . 3 (∀𝑥𝐴 𝐵𝐽 → {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ⊆ 𝐽)
5 uniopn 22812 . . 3 ((𝐽 ∈ Top ∧ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ⊆ 𝐽) → {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ∈ 𝐽)
64, 5sylan2 593 . 2 ((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵𝐽) → {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ∈ 𝐽)
72, 6eqeltrd 2831 1 ((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵𝐽) → 𝑥𝐴 𝐵𝐽)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  wcel 2111  {cab 2709  wral 3047  wrex 3056  wss 3897   cuni 4856   ciun 4939  Topctop 22808
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-sep 5232
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-ex 1781  df-nf 1785  df-sb 2068  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-in 3904  df-ss 3914  df-pw 4549  df-uni 4857  df-iun 4941  df-top 22809
This theorem is referenced by:  iincld  22954  tgcn  23167  kgentopon  23453  xkococnlem  23574  qtoptop2  23614  zcld  24729  metnrmlem2  24776  cnambfre  37718
  Copyright terms: Public domain W3C validator