Theorem r0cld 23906

Description: The analogue of the T₁ axiom (singletons are closed) for an R₀ space. In an R₀ space the set of all points topologically indistinguishable from 𝐴 is closed. (Contributed by Mario Carneiro, 25-Aug-2015.)

Hypothesis

Ref	Expression
kqval.2	⊢ 𝐹 = (𝑥 ∈ 𝑋 ↦ {𝑦 ∈ 𝐽 ∣ 𝑥 ∈ 𝑦})

Assertion

Ref	Expression
r0cld	⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) → {𝑧 ∈ 𝑋 ∣ ∀𝑜 ∈ 𝐽 (𝑧 ∈ 𝑜 ↔ 𝐴 ∈ 𝑜)} ∈ (Clsd‘𝐽))

Distinct variable groups:   𝑥,𝑜,𝑦,𝑧,𝐴   𝑜,𝐽,𝑥,𝑦,𝑧   𝑜,𝐹,𝑧   𝑜,𝑋,𝑥,𝑦,𝑧

Allowed substitution hints:   𝐹(𝑥, 𝑦)

Proof of Theorem r0cld

Step	Hyp	Ref	Expression
1		kqval.2	. . . . . 6 ⊢ 𝐹 = (𝑥 ∈ 𝑋 ↦ {𝑦 ∈ 𝐽 ∣ 𝑥 ∈ 𝑦})
2	1	kqffn 23893	. . . . 5 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐹 Fn 𝑋)
3	2	3ad2ant1 1150	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) → 𝐹 Fn 𝑋)
4		fncnvima2 7056	. . . 4 ⊢ (𝐹 Fn 𝑋 → (◡𝐹 “ {(𝐹‘𝐴)}) = {𝑧 ∈ 𝑋 ∣ (𝐹‘𝑧) ∈ {(𝐹‘𝐴)}})
5	3, 4	syl 18	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) → (◡𝐹 “ {(𝐹‘𝐴)}) = {𝑧 ∈ 𝑋 ∣ (𝐹‘𝑧) ∈ {(𝐹‘𝐴)}})
6		fvex 6894	. . . . . 6 ⊢ (𝐹‘𝑧) ∈ V
7	6	elsn 4603	. . . . 5 ⊢ ((𝐹‘𝑧) ∈ {(𝐹‘𝐴)} ↔ (𝐹‘𝑧) = (𝐹‘𝐴))
8		simpl1 1209	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) ∧ 𝑧 ∈ 𝑋) → 𝐽 ∈ (TopOn‘𝑋))
9		simpr 489	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) ∧ 𝑧 ∈ 𝑋) → 𝑧 ∈ 𝑋)
10		simpl3 1211	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) ∧ 𝑧 ∈ 𝑋) → 𝐴 ∈ 𝑋)
11	1	kqfeq 23892	. . . . . . 7 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑧 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → ((𝐹‘𝑧) = (𝐹‘𝐴) ↔ ∀𝑦 ∈ 𝐽 (𝑧 ∈ 𝑦 ↔ 𝐴 ∈ 𝑦)))
12		eleq2w 2846	. . . . . . . . 9 ⊢ (𝑦 = 𝑜 → (𝑧 ∈ 𝑦 ↔ 𝑧 ∈ 𝑜))
13		eleq2w 2846	. . . . . . . . 9 ⊢ (𝑦 = 𝑜 → (𝐴 ∈ 𝑦 ↔ 𝐴 ∈ 𝑜))
14	12, 13	bibi12d 348	. . . . . . . 8 ⊢ (𝑦 = 𝑜 → ((𝑧 ∈ 𝑦 ↔ 𝐴 ∈ 𝑦) ↔ (𝑧 ∈ 𝑜 ↔ 𝐴 ∈ 𝑜)))
15	14	cbvralvw 3242	. . . . . . 7 ⊢ (∀𝑦 ∈ 𝐽 (𝑧 ∈ 𝑦 ↔ 𝐴 ∈ 𝑦) ↔ ∀𝑜 ∈ 𝐽 (𝑧 ∈ 𝑜 ↔ 𝐴 ∈ 𝑜))
16	11, 15	bitrdi 290	. . . . . 6 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑧 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → ((𝐹‘𝑧) = (𝐹‘𝐴) ↔ ∀𝑜 ∈ 𝐽 (𝑧 ∈ 𝑜 ↔ 𝐴 ∈ 𝑜)))
17	8, 9, 10, 16	syl3anc 1397	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) ∧ 𝑧 ∈ 𝑋) → ((𝐹‘𝑧) = (𝐹‘𝐴) ↔ ∀𝑜 ∈ 𝐽 (𝑧 ∈ 𝑜 ↔ 𝐴 ∈ 𝑜)))
18	7, 17	bitrid 286	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) ∧ 𝑧 ∈ 𝑋) → ((𝐹‘𝑧) ∈ {(𝐹‘𝐴)} ↔ ∀𝑜 ∈ 𝐽 (𝑧 ∈ 𝑜 ↔ 𝐴 ∈ 𝑜)))
19	18	rabbidva 3421	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) → {𝑧 ∈ 𝑋 ∣ (𝐹‘𝑧) ∈ {(𝐹‘𝐴)}} = {𝑧 ∈ 𝑋 ∣ ∀𝑜 ∈ 𝐽 (𝑧 ∈ 𝑜 ↔ 𝐴 ∈ 𝑜)})
20	5, 19	eqtrd 2797	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) → (◡𝐹 “ {(𝐹‘𝐴)}) = {𝑧 ∈ 𝑋 ∣ ∀𝑜 ∈ 𝐽 (𝑧 ∈ 𝑜 ↔ 𝐴 ∈ 𝑜)})
21	1	kqid 23896	. . . 4 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐹 ∈ (𝐽 Cn (KQ‘𝐽)))
22	21	3ad2ant1 1150	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) → 𝐹 ∈ (𝐽 Cn (KQ‘𝐽)))
23		simp2 1154	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) → (KQ‘𝐽) ∈ Fre)
24		simp3 1155	. . . . . 6 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ 𝑋)
25		fnfvelrn 7075	. . . . . 6 ⊢ ((𝐹 Fn 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐹‘𝐴) ∈ ran 𝐹)
26	3, 24, 25	syl2anc 595	. . . . 5 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) → (𝐹‘𝐴) ∈ ran 𝐹)
27	1	kqtopon 23895	. . . . . . 7 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (KQ‘𝐽) ∈ (TopOn‘ran 𝐹))
28	27	3ad2ant1 1150	. . . . . 6 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) → (KQ‘𝐽) ∈ (TopOn‘ran 𝐹))
29		toponuni 23082	. . . . . 6 ⊢ ((KQ‘𝐽) ∈ (TopOn‘ran 𝐹) → ran 𝐹 = ∪ (KQ‘𝐽))
30	28, 29	syl 18	. . . . 5 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) → ran 𝐹 = ∪ (KQ‘𝐽))
31	26, 30	eleqtrd 2864	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) → (𝐹‘𝐴) ∈ ∪ (KQ‘𝐽))
32		eqid 2762	. . . . 5 ⊢ ∪ (KQ‘𝐽) = ∪ (KQ‘𝐽)
33	32	t1sncld 23494	. . . 4 ⊢ (((KQ‘𝐽) ∈ Fre ∧ (𝐹‘𝐴) ∈ ∪ (KQ‘𝐽)) → {(𝐹‘𝐴)} ∈ (Clsd‘(KQ‘𝐽)))
34	23, 31, 33	syl2anc 595	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) → {(𝐹‘𝐴)} ∈ (Clsd‘(KQ‘𝐽)))
35		cnclima 23436	. . 3 ⊢ ((𝐹 ∈ (𝐽 Cn (KQ‘𝐽)) ∧ {(𝐹‘𝐴)} ∈ (Clsd‘(KQ‘𝐽))) → (◡𝐹 “ {(𝐹‘𝐴)}) ∈ (Clsd‘𝐽))
36	22, 34, 35	syl2anc 595	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) → (◡𝐹 “ {(𝐹‘𝐴)}) ∈ (Clsd‘𝐽))
37	20, 36	eqeltrrd 2863	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) → {𝑧 ∈ 𝑋 ∣ ∀𝑜 ∈ 𝐽 (𝑧 ∈ 𝑜 ↔ 𝐴 ∈ 𝑜)} ∈ (Clsd‘𝐽))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1102   = wceq 1569   ∈ wcel 2142  ∀wral 3078  {crab 3415  {csn 4588  ∪ cuni 4871   ↦ cmpt 5191  ^◡ccnv 5659  ran crn 5661   “ cima 5663   Fn wfn 6531  ‘cfv 6536  (class class class)co 7412  TopOnctopon 23078  Clsdccld 23184   Cn ccn 23392  Frect1 23475  KQckq 23861

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-rep 5237  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-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  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-iun 4957  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-rn 5671  df-res 5672  df-ima 5673  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7415  df-oprab 7416  df-mpo 7417  df-map 8824  df-qtop 17567  df-top 23062  df-topon 23079  df-cld 23187  df-cn 23395  df-t1 23482  df-kq 23862

This theorem is used by:  nrmr0reg  23917