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

Theorem riincld 21646
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 4996 . . . 4 (𝐴 = ∅ → (𝑋 𝑥𝐴 𝐵) = 𝑋)
21adantl 484 . . 3 (((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) ∧ 𝐴 = ∅) → (𝑋 𝑥𝐴 𝐵) = 𝑋)
3 clscld.1 . . . . 5 𝑋 = 𝐽
43topcld 21637 . . . 4 (𝐽 ∈ Top → 𝑋 ∈ (Clsd‘𝐽))
54ad2antrr 724 . . 3 (((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) ∧ 𝐴 = ∅) → 𝑋 ∈ (Clsd‘𝐽))
62, 5eqeltrd 2913 . 2 (((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) ∧ 𝐴 = ∅) → (𝑋 𝑥𝐴 𝐵) ∈ (Clsd‘𝐽))
74ad2antrr 724 . . 3 (((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) ∧ 𝐴 ≠ ∅) → 𝑋 ∈ (Clsd‘𝐽))
8 simpr 487 . . . 4 (((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) ∧ 𝐴 ≠ ∅) → 𝐴 ≠ ∅)
9 simplr 767 . . . 4 (((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) ∧ 𝐴 ≠ ∅) → ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽))
10 iincld 21641 . . . 4 ((𝐴 ≠ ∅ ∧ ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) → 𝑥𝐴 𝐵 ∈ (Clsd‘𝐽))
118, 9, 10syl2anc 586 . . 3 (((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) ∧ 𝐴 ≠ ∅) → 𝑥𝐴 𝐵 ∈ (Clsd‘𝐽))
12 incld 21645 . . 3 ((𝑋 ∈ (Clsd‘𝐽) ∧ 𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) → (𝑋 𝑥𝐴 𝐵) ∈ (Clsd‘𝐽))
137, 11, 12syl2anc 586 . 2 (((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) ∧ 𝐴 ≠ ∅) → (𝑋 𝑥𝐴 𝐵) ∈ (Clsd‘𝐽))
146, 13pm2.61dane 3104 1 ((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) → (𝑋 𝑥𝐴 𝐵) ∈ (Clsd‘𝐽))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1533  wcel 2110  wne 3016  wral 3138  cin 3934  c0 4290   cuni 4831   ciin 4912  cfv 6349  Topctop 21495  Clsdccld 21618
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5195  ax-nul 5202  ax-pow 5258  ax-pr 5321  ax-un 7455
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3772  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4561  df-pr 4563  df-op 4567  df-uni 4832  df-int 4869  df-iun 4913  df-iin 4914  df-br 5059  df-opab 5121  df-mpt 5139  df-id 5454  df-xp 5555  df-rel 5556  df-cnv 5557  df-co 5558  df-dm 5559  df-iota 6308  df-fun 6351  df-fn 6352  df-fv 6357  df-top 21496  df-cld 21621
This theorem is referenced by:  ptcld  22215  csscld  23846
  Copyright terms: Public domain W3C validator