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

Theorem intcld 7677
Description: The intersection of a set of closed sets is closed.
Assertion
Ref Expression
intcld |- ((J e. Top /\ A =/= (/) /\ A (_ (Clsd` J)) -> |^|A e. (Clsd` J))

Proof of Theorem intcld
StepHypRef Expression
1 iincld 7676 . . 3 |- ((J e. Top /\ A =/= (/) /\ A.x e. A x e. (Clsd` J)) -> |^|_x e. A x e. (Clsd` J))
2 dfss3 2062 . . 3 |- (A (_ (Clsd` J) <-> A.x e. A x e. (Clsd` J))
31, 2syl3an3b 866 . 2 |- ((J e. Top /\ A =/= (/) /\ A (_ (Clsd` J)) -> |^|_x e. A x e. (Clsd` J))
4 intiin 2606 . 2 |- |^|A = |^|_x e. A x
53, 4syl5eqel 1555 1 |- ((J e. Top /\ A =/= (/) /\ A (_ (Clsd` J)) -> |^|A e. (Clsd` J))
Colors of variables: wff set class
Syntax hints:   -> wi 3   /\ w3a 777   e. wcel 960   =/= wne 1588  A.wral 1648   (_ wss 2050  (/)c0 2283  |^|cint 2537  |^|_ciin 2571  ` cfv 3188  Topctop 7590  Clsdccld 7657
This theorem is referenced by:  clscld 7680
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-9 967  ax-10 968  ax-11 969  ax-12 970  ax-13 971  ax-14 972  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462  ax-sep 2708  ax-pow 2748  ax-pr 2785  ax-un 2872
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3an 779  df-ex 983  df-sb 1174  df-eu 1384  df-mo 1385  df-clab 1467  df-cleq 1472  df-clel 1475  df-ne 1590  df-ral 1652  df-rex 1653  df-rab 1655  df-v 1815  df-sbc 1945  df-csb 2005  df-dif 2052  df-un 2053  df-in 2054  df-ss 2056  df-nul 2284  df-pw 2406  df-sn 2416  df-pr 2417  df-op 2420  df-uni 2508  df-int 2538  df-iun 2572  df-iin 2573  df-br 2625  df-opab 2672  df-id 2841  df-xp 3190  df-rel 3191  df-cnv 3192  df-co 3193  df-dm 3194  df-rn 3195  df-res 3196  df-ima 3197  df-fun 3198  df-fv 3204  df-top 7594  df-cld 7660
Copyright terms: Public domain