Theorem cldmreon 23262

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 23081	. . 3 ⊢ (𝐽 ∈ (TopOn‘𝐵) → 𝐽 ∈ Top)
2		eqid 2762	. . . 4 ⊢ ∪ 𝐽 = ∪ 𝐽
3	2	cldmre 23246	. . 3 ⊢ (𝐽 ∈ Top → (Clsd‘𝐽) ∈ (Moore‘∪ 𝐽))
4	1, 3	syl 18	. 2 ⊢ (𝐽 ∈ (TopOn‘𝐵) → (Clsd‘𝐽) ∈ (Moore‘∪ 𝐽))
5		toponuni 23082	. . 3 ⊢ (𝐽 ∈ (TopOn‘𝐵) → 𝐵 = ∪ 𝐽)
6	5	fveq2d 6885	. 2 ⊢ (𝐽 ∈ (TopOn‘𝐵) → (Moore‘𝐵) = (Moore‘∪ 𝐽))
7	4, 6	eleqtrrd 2865	1 ⊢ (𝐽 ∈ (TopOn‘𝐵) → (Clsd‘𝐽) ∈ (Moore‘𝐵))

This proof depends on syntax axioms:   → wi 4   ∈ wcel 2142  ∪ cuni 4871  ‘cfv 6536  Moorecmre 17640  Topctop 23061  TopOnctopon 23078  Clsdccld 23184

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-int 4912  df-iun 4957  df-iin 4958  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-iota 6492  df-fun 6538  df-fn 6539  df-fv 6544  df-mre 17644  df-top 23062  df-topon 23079  df-cld 23187

This theorem is used by:  iscldtop  23263  clduni  49707