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

Theorem mrerintcl 17644
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 4953 . . . 4 (𝑆 = ∅ → (𝑋 𝑆) = 𝑋)
21adantl 486 . . 3 (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶) ∧ 𝑆 = ∅) → (𝑋 𝑆) = 𝑋)
3 mre1cl 17641 . . . 4 (𝐶 ∈ (Moore‘𝑋) → 𝑋𝐶)
43ad2antrr 738 . . 3 (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶) ∧ 𝑆 = ∅) → 𝑋𝐶)
52, 4eqeltrd 2863 . 2 (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶) ∧ 𝑆 = ∅) → (𝑋 𝑆) ∈ 𝐶)
6 simp2 1155 . . . . . 6 ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶𝑆 ≠ ∅) → 𝑆𝐶)
7 mresspw 17639 . . . . . . 7 (𝐶 ∈ (Moore‘𝑋) → 𝐶 ⊆ 𝒫 𝑋)
873ad2ant1 1151 . . . . . 6 ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶𝑆 ≠ ∅) → 𝐶 ⊆ 𝒫 𝑋)
96, 8sstrd 3947 . . . . 5 ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶𝑆 ≠ ∅) → 𝑆 ⊆ 𝒫 𝑋)
10 simp3 1156 . . . . 5 ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶𝑆 ≠ ∅) → 𝑆 ≠ ∅)
11 rintn0 5075 . . . . 5 ((𝑆 ⊆ 𝒫 𝑋𝑆 ≠ ∅) → (𝑋 𝑆) = 𝑆)
129, 10, 11syl2anc 595 . . . 4 ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶𝑆 ≠ ∅) → (𝑋 𝑆) = 𝑆)
13 mreintcl 17642 . . . 4 ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶𝑆 ≠ ∅) → 𝑆𝐶)
1412, 13eqeltrd 2863 . . 3 ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶𝑆 ≠ ∅) → (𝑋 𝑆) ∈ 𝐶)
15143expa 1136 . 2 (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶) ∧ 𝑆 ≠ ∅) → (𝑋 𝑆) ∈ 𝐶)
165, 15pm2.61dane 3045 1 ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆𝐶) → (𝑋 𝑆) ∈ 𝐶)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  w3a 1103   = wceq 1570  wcel 2143  wne 2958  cin 3904  wss 3905  c0 4286  𝒫 cpw 4562   cint 4912  cfv 6536  Moorecmre 17629
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-int 4913  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-iota 6492  df-fun 6538  df-fv 6544  df-mre 17633
This theorem is referenced by:  mreacs  17709  topmtcl  36874
  Copyright terms: Public domain W3C validator