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

Theorem mrerintcl 17550
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 4918 . . . 4 (𝑆 = ∅ → (𝑋 𝑆) = 𝑋)
21adantl 482 . . 3 (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶) ∧ 𝑆 = ∅) → (𝑋 𝑆) = 𝑋)
3 mre1cl 17547 . . . 4 (𝐶 ∈ (Moore‘𝑋) → 𝑋𝐶)
43ad2antrr 732 . . 3 (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶) ∧ 𝑆 = ∅) → 𝑋𝐶)
52, 4eqeltrd 2839 . 2 (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶) ∧ 𝑆 = ∅) → (𝑋 𝑆) ∈ 𝐶)
6 simp2 1143 . . . . . 6 ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶𝑆 ≠ ∅) → 𝑆𝐶)
7 mresspw 17545 . . . . . . 7 (𝐶 ∈ (Moore‘𝑋) → 𝐶 ⊆ 𝒫 𝑋)
873ad2ant1 1139 . . . . . 6 ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶𝑆 ≠ ∅) → 𝐶 ⊆ 𝒫 𝑋)
96, 8sstrd 3925 . . . . 5 ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶𝑆 ≠ ∅) → 𝑆 ⊆ 𝒫 𝑋)
10 simp3 1144 . . . . 5 ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶𝑆 ≠ ∅) → 𝑆 ≠ ∅)
11 rintn0 5038 . . . . 5 ((𝑆 ⊆ 𝒫 𝑋𝑆 ≠ ∅) → (𝑋 𝑆) = 𝑆)
129, 10, 11syl2anc 590 . . . 4 ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶𝑆 ≠ ∅) → (𝑋 𝑆) = 𝑆)
13 mreintcl 17548 . . . 4 ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶𝑆 ≠ ∅) → 𝑆𝐶)
1412, 13eqeltrd 2839 . . 3 ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶𝑆 ≠ ∅) → (𝑋 𝑆) ∈ 𝐶)
15143expa 1124 . 2 (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶) ∧ 𝑆 ≠ ∅) → (𝑋 𝑆) ∈ 𝐶)
165, 15pm2.61dane 3021 1 ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶) → (𝑋 𝑆) ∈ 𝐶)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  w3a 1092   = wceq 1547  wcel 2119  wne 2934  cin 3882  wss 3883  c0 4261  𝒫 cpw 4529   cint 4877  cfv 6485  Moorecmre 17535
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-int 4878  df-br 5073  df-opab 5135  df-mpt 5154  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-iota 6441  df-fun 6487  df-fv 6493  df-mre 17539
This theorem is referenced by:  mreacs  17615  topmtcl  36591
  Copyright terms: Public domain W3C validator