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

Theorem riincld 23053
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 5081 . . . 4 (𝐴 = ∅ → (𝑋 𝑥𝐴 𝐵) = 𝑋)
21adantl 481 . . 3 (((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) ∧ 𝐴 = ∅) → (𝑋 𝑥𝐴 𝐵) = 𝑋)
3 clscld.1 . . . . 5 𝑋 = 𝐽
43topcld 23044 . . . 4 (𝐽 ∈ Top → 𝑋 ∈ (Clsd‘𝐽))
54ad2antrr 726 . . 3 (((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) ∧ 𝐴 = ∅) → 𝑋 ∈ (Clsd‘𝐽))
62, 5eqeltrd 2840 . 2 (((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) ∧ 𝐴 = ∅) → (𝑋 𝑥𝐴 𝐵) ∈ (Clsd‘𝐽))
74ad2antrr 726 . . 3 (((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) ∧ 𝐴 ≠ ∅) → 𝑋 ∈ (Clsd‘𝐽))
8 simpr 484 . . . 4 (((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) ∧ 𝐴 ≠ ∅) → 𝐴 ≠ ∅)
9 simplr 768 . . . 4 (((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) ∧ 𝐴 ≠ ∅) → ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽))
10 iincld 23048 . . . 4 ((𝐴 ≠ ∅ ∧ ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) → 𝑥𝐴 𝐵 ∈ (Clsd‘𝐽))
118, 9, 10syl2anc 584 . . 3 (((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) ∧ 𝐴 ≠ ∅) → 𝑥𝐴 𝐵 ∈ (Clsd‘𝐽))
12 incld 23052 . . 3 ((𝑋 ∈ (Clsd‘𝐽) ∧ 𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) → (𝑋 𝑥𝐴 𝐵) ∈ (Clsd‘𝐽))
137, 11, 12syl2anc 584 . 2 (((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) ∧ 𝐴 ≠ ∅) → (𝑋 𝑥𝐴 𝐵) ∈ (Clsd‘𝐽))
146, 13pm2.61dane 3028 1 ((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵 ∈ (Clsd‘𝐽)) → (𝑋 𝑥𝐴 𝐵) ∈ (Clsd‘𝐽))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1539  wcel 2107  wne 2939  wral 3060  cin 3949  c0 4332   cuni 4906   ciin 4991  cfv 6560  Topctop 22900  Clsdccld 23025
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2707  ax-sep 5295  ax-nul 5305  ax-pow 5364  ax-pr 5431  ax-un 7756
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2728  df-clel 2815  df-nfc 2891  df-ne 2940  df-ral 3061  df-rex 3070  df-rab 3436  df-v 3481  df-dif 3953  df-un 3955  df-in 3957  df-ss 3967  df-nul 4333  df-if 4525  df-pw 4601  df-sn 4626  df-pr 4628  df-op 4632  df-uni 4907  df-int 4946  df-iun 4992  df-iin 4993  df-br 5143  df-opab 5205  df-mpt 5225  df-id 5577  df-xp 5690  df-rel 5691  df-cnv 5692  df-co 5693  df-dm 5694  df-iota 6513  df-fun 6562  df-fn 6563  df-fv 6568  df-top 22901  df-cld 23028
This theorem is referenced by:  ptcld  23622  csscld  25284
  Copyright terms: Public domain W3C validator