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

Theorem iunopn 23124
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 4988 . . 3 (∀𝑥𝐴 𝐵𝐽 𝑥𝐴 𝐵 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵})
21adantl 487 . 2 ((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵𝐽) → 𝑥𝐴 𝐵 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵})
3 uniiunlem 4035 . . . 4 (∀𝑥𝐴 𝐵𝐽 → (∀𝑥𝐴 𝐵𝐽 ↔ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ⊆ 𝐽))
43ibi 270 . . 3 (∀𝑥𝐴 𝐵𝐽 → {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ⊆ 𝐽)
5 uniopn 23123 . . 3 ((𝐽 ∈ Top ∧ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ⊆ 𝐽) → {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ∈ 𝐽)
64, 5sylan2 605 . 2 ((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵𝐽) → {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ∈ 𝐽)
72, 6eqeltrd 2860 1 ((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵𝐽) → 𝑥𝐴 𝐵𝐽)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2145  {cab 2738  wral 3076  wrex 3086  wss 3899   cuni 4867   ciun 4951  Topctop 23119
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-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-in 3906  df-ss 3916  df-pw 4559  df-uni 4868  df-iun 4953  df-top 23120
This theorem is used by:  iincld  23265  tgcn  23478  kgentopon  23765  xkococnlem  23886  qtoptop2  23926  zcld  25041  metnrmlem2  25088  cnambfre  38418
  Copyright terms: Public domain W3C validator