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

Theorem iunopn 22925
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 5053 . . 3 (∀𝑥𝐴 𝐵𝐽 𝑥𝐴 𝐵 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵})
21adantl 481 . 2 ((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵𝐽) → 𝑥𝐴 𝐵 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵})
3 uniiunlem 4110 . . . 4 (∀𝑥𝐴 𝐵𝐽 → (∀𝑥𝐴 𝐵𝐽 ↔ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ⊆ 𝐽))
43ibi 267 . . 3 (∀𝑥𝐴 𝐵𝐽 → {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ⊆ 𝐽)
5 uniopn 22924 . . 3 ((𝐽 ∈ Top ∧ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ⊆ 𝐽) → {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ∈ 𝐽)
64, 5sylan2 592 . 2 ((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵𝐽) → {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ∈ 𝐽)
72, 6eqeltrd 2844 1 ((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵𝐽) → 𝑥𝐴 𝐵𝐽)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1537  wcel 2108  {cab 2717  wral 3067  wrex 3076  wss 3976   cuni 4931   ciun 5015  Topctop 22920
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-ex 1778  df-nf 1782  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-in 3983  df-ss 3993  df-pw 4624  df-uni 4932  df-iun 5017  df-top 22921
This theorem is referenced by:  iincld  23068  tgcn  23281  kgentopon  23567  xkococnlem  23688  qtoptop2  23728  zcld  24854  metnrmlem2  24901  cnambfre  37628
  Copyright terms: Public domain W3C validator