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

Theorem mrerintcl 17528
Description: The relative intersection of a set of closed sets is closed. (Contributed by Stefan O'Rear, 3-Apr-2015.)
Assertion
Ref Expression
mrerintcl ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶) → (𝑋 𝑆) ∈ 𝐶)

Proof of Theorem mrerintcl
StepHypRef Expression
1 rint0 4945 . . . 4 (𝑆 = ∅ → (𝑋 𝑆) = 𝑋)
21adantl 481 . . 3 (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶) ∧ 𝑆 = ∅) → (𝑋 𝑆) = 𝑋)
3 mre1cl 17525 . . . 4 (𝐶 ∈ (Moore‘𝑋) → 𝑋𝐶)
43ad2antrr 727 . . 3 (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶) ∧ 𝑆 = ∅) → 𝑋𝐶)
52, 4eqeltrd 2837 . 2 (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶) ∧ 𝑆 = ∅) → (𝑋 𝑆) ∈ 𝐶)
6 simp2 1138 . . . . . 6 ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶𝑆 ≠ ∅) → 𝑆𝐶)
7 mresspw 17523 . . . . . . 7 (𝐶 ∈ (Moore‘𝑋) → 𝐶 ⊆ 𝒫 𝑋)
873ad2ant1 1134 . . . . . 6 ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶𝑆 ≠ ∅) → 𝐶 ⊆ 𝒫 𝑋)
96, 8sstrd 3946 . . . . 5 ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶𝑆 ≠ ∅) → 𝑆 ⊆ 𝒫 𝑋)
10 simp3 1139 . . . . 5 ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶𝑆 ≠ ∅) → 𝑆 ≠ ∅)
11 rintn0 5066 . . . . 5 ((𝑆 ⊆ 𝒫 𝑋𝑆 ≠ ∅) → (𝑋 𝑆) = 𝑆)
129, 10, 11syl2anc 585 . . . 4 ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶𝑆 ≠ ∅) → (𝑋 𝑆) = 𝑆)
13 mreintcl 17526 . . . 4 ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶𝑆 ≠ ∅) → 𝑆𝐶)
1412, 13eqeltrd 2837 . . 3 ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶𝑆 ≠ ∅) → (𝑋 𝑆) ∈ 𝐶)
15143expa 1119 . 2 (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶) ∧ 𝑆 ≠ ∅) → (𝑋 𝑆) ∈ 𝐶)
165, 15pm2.61dane 3020 1 ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶) → (𝑋 𝑆) ∈ 𝐶)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087   = wceq 1542  wcel 2114  wne 2933  cin 3902  wss 3903  c0 4287  𝒫 cpw 4556   cint 4904  cfv 6500  Moorecmre 17513
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4905  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-iota 6456  df-fun 6502  df-fv 6508  df-mre 17517
This theorem is referenced by:  mreacs  17593  topmtcl  36576
  Copyright terms: Public domain W3C validator