Theorem mrerintcl 17671

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

Step	Hyp	Ref	Expression
1		rint0 4955	. . . 4 ⊢ (𝑆 = ∅ → (𝑋 ∩ ∩ 𝑆) = 𝑋)
2	1	adantl 487	. . 3 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆 ⊆ 𝐶) ∧ 𝑆 = ∅) → (𝑋 ∩ ∩ 𝑆) = 𝑋)
3		mre1cl 17668	. . . 4 ⊢ (𝐶 ∈ (Moore‘𝑋) → 𝑋 ∈ 𝐶)
4	3	ad2antrr 739	. . 3 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆 ⊆ 𝐶) ∧ 𝑆 = ∅) → 𝑋 ∈ 𝐶)
5	2, 4	eqeltrd 2865	. 2 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆 ⊆ 𝐶) ∧ 𝑆 = ∅) → (𝑋 ∩ ∩ 𝑆) ∈ 𝐶)
6		simp2 1155	. . . . . 6 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆 ⊆ 𝐶 ∧ 𝑆 ≠ ∅) → 𝑆 ⊆ 𝐶)
7		mresspw 17666	. . . . . . 7 ⊢ (𝐶 ∈ (Moore‘𝑋) → 𝐶 ⊆ 𝒫 𝑋)
8	7	3ad2ant1 1151	. . . . . 6 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆 ⊆ 𝐶 ∧ 𝑆 ≠ ∅) → 𝐶 ⊆ 𝒫 𝑋)
9	6, 8	sstrd 3948	. . . . 5 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆 ⊆ 𝐶 ∧ 𝑆 ≠ ∅) → 𝑆 ⊆ 𝒫 𝑋)
10		simp3 1156	. . . . 5 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆 ⊆ 𝐶 ∧ 𝑆 ≠ ∅) → 𝑆 ≠ ∅)
11		rintn0 5077	. . . . 5 ⊢ ((𝑆 ⊆ 𝒫 𝑋 ∧ 𝑆 ≠ ∅) → (𝑋 ∩ ∩ 𝑆) = ∩ 𝑆)
12	9, 10, 11	syl2anc 596	. . . 4 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆 ⊆ 𝐶 ∧ 𝑆 ≠ ∅) → (𝑋 ∩ ∩ 𝑆) = ∩ 𝑆)
13		mreintcl 17669	. . . 4 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆 ⊆ 𝐶 ∧ 𝑆 ≠ ∅) → ∩ 𝑆 ∈ 𝐶)
14	12, 13	eqeltrd 2865	. . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆 ⊆ 𝐶 ∧ 𝑆 ≠ ∅) → (𝑋 ∩ ∩ 𝑆) ∈ 𝐶)
15	14	3expa 1136	. 2 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆 ⊆ 𝐶) ∧ 𝑆 ≠ ∅) → (𝑋 ∩ ∩ 𝑆) ∈ 𝐶)
16	5, 15	pm2.61dane 3047	1 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑆 ⊆ 𝐶) → (𝑋 ∩ ∩ 𝑆) ∈ 𝐶)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146   ≠ wne 2960   ∩ cin 3905   ⊆ wss 3906  ∅c0 4286  𝒫 cpw 4564  ∩ cint 4914  ‘cfv 6540  Moorecmre 17656

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-int 4915  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-iota 6496  df-fun 6542  df-fv 6548  df-mre 17660

This theorem is used by:  mreacs  17736  topmtcl  36931