Theorem cldmreon 23322

Description: The closed sets of a topology over a set are a Moore collection over the same set. (Contributed by Stefan O'Rear, 31-Jan-2015.)

Assertion

Ref	Expression
cldmreon	⊢ (𝐽 ∈ (TopOn‘𝐵) → (Clsd‘𝐽) ∈ (Moore‘𝐵))

Proof of Theorem cldmreon

Step	Hyp	Ref	Expression
1		topontop 23141	. . 3 ⊢ (𝐽 ∈ (TopOn‘𝐵) → 𝐽 ∈ Top)
2		eqid 2760	. . . 4 ⊢ ∪ 𝐽 = ∪ 𝐽
3	2	cldmre 23306	. . 3 ⊢ (𝐽 ∈ Top → (Clsd‘𝐽) ∈ (Moore‘∪ 𝐽))
4	1, 3	syl 18	. 2 ⊢ (𝐽 ∈ (TopOn‘𝐵) → (Clsd‘𝐽) ∈ (Moore‘∪ 𝐽))
5		toponuni 23142	. . 3 ⊢ (𝐽 ∈ (TopOn‘𝐵) → 𝐵 = ∪ 𝐽)
6	5	fveq2d 6883	. 2 ⊢ (𝐽 ∈ (TopOn‘𝐵) → (Moore‘𝐵) = (Moore‘∪ 𝐽))
7	4, 6	eleqtrrd 2863	1 ⊢ (𝐽 ∈ (TopOn‘𝐵) → (Clsd‘𝐽) ∈ (Moore‘𝐵))

This proof depends on syntax axioms:   → wi 4   ∈ wcel 2145  ∪ cuni 4867  ‘cfv 6533  Moorecmre 17669  Topctop 23121  TopOnctopon 23138  Clsdccld 23244

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737

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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-iin 4954  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6489  df-fun 6535  df-fn 6536  df-fv 6541  df-mre 17673  df-top 23122  df-topon 23139  df-cld 23247

This theorem is used by:  iscldtop  23323  clduni  49830