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

Theorem riincld 20658
Description: An indexed relative intersection of closed sets is closed. (Contributed by Stefan O'Rear, 22-Feb-2015.)
Hypothesis
Ref Expression
clscld.1 𝑋 = 𝐽
Assertion
Ref Expression
riincld ((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) → (𝑋 𝑥𝐴 𝐵) ∈ (Clsd‘𝐽))
Distinct variable groups:   𝑥,𝐽   𝑥,𝑋   𝑥,𝐴
Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem riincld
StepHypRef Expression
1 riin0 4530 . . . 4 (𝐴 = ∅ → (𝑋 𝑥𝐴 𝐵) = 𝑋)
21adantl 481 . . 3 (((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) ∧ 𝐴 = ∅) → (𝑋 𝑥𝐴 𝐵) = 𝑋)
3 clscld.1 . . . . 5 𝑋 = 𝐽
43topcld 20649 . . . 4 (𝐽 ∈ Top → 𝑋 ∈ (Clsd‘𝐽))
54ad2antrr 758 . . 3 (((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) ∧ 𝐴 = ∅) → 𝑋 ∈ (Clsd‘𝐽))
62, 5eqeltrd 2688 . 2 (((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) ∧ 𝐴 = ∅) → (𝑋 𝑥𝐴 𝐵) ∈ (Clsd‘𝐽))
74ad2antrr 758 . . 3 (((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) ∧ 𝐴 ≠ ∅) → 𝑋 ∈ (Clsd‘𝐽))
8 simpr 476 . . . 4 (((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) ∧ 𝐴 ≠ ∅) → 𝐴 ≠ ∅)
9 simplr 788 . . . 4 (((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) ∧ 𝐴 ≠ ∅) → ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽))
10 iincld 20653 . . . 4 ((𝐴 ≠ ∅ ∧ ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) → 𝑥𝐴 𝐵 ∈ (Clsd‘𝐽))
118, 9, 10syl2anc 691 . . 3 (((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) ∧ 𝐴 ≠ ∅) → 𝑥𝐴 𝐵 ∈ (Clsd‘𝐽))
12 incld 20657 . . 3 ((𝑋 ∈ (Clsd‘𝐽) ∧ 𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) → (𝑋 𝑥𝐴 𝐵) ∈ (Clsd‘𝐽))
137, 11, 12syl2anc 691 . 2 (((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) ∧ 𝐴 ≠ ∅) → (𝑋 𝑥𝐴 𝐵) ∈ (Clsd‘𝐽))
146, 13pm2.61dane 2869 1 ((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) → (𝑋 𝑥𝐴 𝐵) ∈ (Clsd‘𝐽))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383   = wceq 1475  wcel 1977  wne 2780  wral 2896  cin 3539  c0 3874   cuni 4372   ciin 4456  cfv 5804  Topctop 20517  Clsdccld 20630
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-iin 4458  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-iota 5768  df-fun 5806  df-fn 5807  df-fv 5812  df-top 20521  df-cld 20633
This theorem is referenced by:  ptcld  21226  csscld  22856
  Copyright terms: Public domain W3C validator