HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem iunopn 8868
Description: The indexed union of a subset of a topology is an open set.
Assertion
Ref Expression
iunopn |- ((J e. Top /\ A.x e. A B e. J) -> U_x e. A B e. J)
Distinct variable groups:   x,A   x,J

Proof of Theorem iunopn
StepHypRef Expression
1 dfiun2g 3283 . . 3 |- (A.x e. A B e. J -> U_x e. A B = U.{y | E.x e. A y = B})
21adantl 424 . 2 |- ((J e. Top /\ A.x e. A B e. J) -> U_x e. A B = U.{y | E.x e. A y = B})
3 uniopn 8867 . . 3 |- ((J e. Top /\ {y | E.x e. A y = B} C_ J) -> U.{y | E.x e. A y = B} e. J)
4 uniiunlem 2693 . . . 4 |- (A.x e. A B e. J -> (A.x e. A B e. J <-> {y | E.x e. A y = B} C_ J))
54ibi 652 . . 3 |- (A.x e. A B e. J -> {y | E.x e. A y = B} C_ J)
63, 5sylan2 500 . 2 |- ((J e. Top /\ A.x e. A B e. J) -> U.{y | E.x e. A y = B} e. J)
72, 6eqeltrd 1971 1 |- ((J e. Top /\ A.x e. A B e. J) -> U_x e. A B e. J)
Colors of variables: wff set class
Syntax hints:   -> wi 3   /\ wa 240   = wceq 1298   e. wcel 1300  {cab 1871  A.wral 2105  E.wrex 2106   C_ wss 2593  U.cuni 3177  U_ciun 3255  Topctop 8857
This theorem is referenced by:  iincld 8955  cncnplem4 9054  uptx 10226  tpgprop2 14987
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-11 1309  ax-12 1310  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-16 1580  ax-11o 1588  ax-ext 1865  ax-sep 3438
This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242  df-ex 1327  df-sb 1536  df-clab 1872  df-cleq 1877  df-clel 1880  df-ral 2109  df-rex 2110  df-v 2294  df-sbc 2454  df-csb 2541  df-in 2603  df-ss 2605  df-pw 3035  df-uni 3178  df-iun 3257  df-top 8861
Copyright terms: Public domain