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

Theorem r0cld 24057
Description: The analogue of the T1 axiom (singletons are closed) for an R0 space. In an R0 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
StepHypRef Expression
1 kqval.2 . . . . . 6 𝐹 = (𝑥 ∈ 𝑋 ↦ {𝑦 ∈ 𝐽 ∣ 𝑥 ∈ 𝑦})
21kqffn 24044 . . . . 5 (𝐽 ∈ (TopOn‘𝑋) → 𝐹 Fn 𝑋)
323ad2ant1 1151 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) → 𝐹 Fn 𝑋)
4 fncnvima2 7060 . . . 4 (𝐹 Fn 𝑋 → (◡𝐹 “ {(𝐹‘𝐴)}) = {𝑧 ∈ 𝑋 ∣ (𝐹‘𝑧) ∈ {(𝐹‘𝐴)}})
53, 4syl 18 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) → (◡𝐹 “ {(𝐹‘𝐴)}) = {𝑧 ∈ 𝑋 ∣ (𝐹‘𝑧) ∈ {(𝐹‘𝐴)}})
6 fvex 6898 . . . . . 6 (𝐹‘𝑧) ∈ V
76elsn 4598 . . . . 5 ((𝐹‘𝑧) ∈ {(𝐹‘𝐴)} ↔ (𝐹‘𝑧) = (𝐹‘𝐴))
8 simpl1 1210 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) ∧ 𝑧 ∈ 𝑋) → 𝐽 ∈ (TopOn‘𝑋))
9 simpr 490 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) ∧ 𝑧 ∈ 𝑋) → 𝑧 ∈ 𝑋)
10 simpl3 1212 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) ∧ 𝑧 ∈ 𝑋) → 𝐴 ∈ 𝑋)
111kqfeq 24043 . . . . . . 7 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑧 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → ((𝐹‘𝑧) = (𝐹‘𝐴) ↔ ∀𝑦 ∈ 𝐽 (𝑧 ∈ 𝑦 ↔ 𝐴 ∈ 𝑦)))
12 eleq2w 2844 . . . . . . . . 9 (𝑦 = 𝑜 → (𝑧 ∈ 𝑦 ↔ 𝑧 ∈ 𝑜))
13 eleq2w 2844 . . . . . . . . 9 (𝑦 = 𝑜 → (𝐴 ∈ 𝑦 ↔ 𝐴 ∈ 𝑜))
1412, 13bibi12d 348 . . . . . . . 8 (𝑦 = 𝑜 → ((𝑧 ∈ 𝑦 ↔ 𝐴 ∈ 𝑦) ↔ (𝑧 ∈ 𝑜 ↔ 𝐴 ∈ 𝑜)))
1514cbvralvw 3240 . . . . . . 7 (∀𝑦 ∈ 𝐽 (𝑧 ∈ 𝑦 ↔ 𝐴 ∈ 𝑦) ↔ ∀𝑜 ∈ 𝐽 (𝑧 ∈ 𝑜 ↔ 𝐴 ∈ 𝑜))
1611, 15bitrdi 290 . . . . . 6 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑧 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → ((𝐹‘𝑧) = (𝐹‘𝐴) ↔ ∀𝑜 ∈ 𝐽 (𝑧 ∈ 𝑜 ↔ 𝐴 ∈ 𝑜)))
178, 9, 10, 16syl3anc 1398 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) ∧ 𝑧 ∈ 𝑋) → ((𝐹‘𝑧) = (𝐹‘𝐴) ↔ ∀𝑜 ∈ 𝐽 (𝑧 ∈ 𝑜 ↔ 𝐴 ∈ 𝑜)))
187, 17bitrid 286 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) ∧ 𝑧 ∈ 𝑋) → ((𝐹‘𝑧) ∈ {(𝐹‘𝐴)} ↔ ∀𝑜 ∈ 𝐽 (𝑧 ∈ 𝑜 ↔ 𝐴 ∈ 𝑜)))
1918rabbidva 3418 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) → {𝑧 ∈ 𝑋 ∣ (𝐹‘𝑧) ∈ {(𝐹‘𝐴)}} = {𝑧 ∈ 𝑋 ∣ ∀𝑜 ∈ 𝐽 (𝑧 ∈ 𝑜 ↔ 𝐴 ∈ 𝑜)})
205, 19eqtrd 2795 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) → (◡𝐹 “ {(𝐹‘𝐴)}) = {𝑧 ∈ 𝑋 ∣ ∀𝑜 ∈ 𝐽 (𝑧 ∈ 𝑜 ↔ 𝐴 ∈ 𝑜)})
211kqid 24047 . . . 4 (𝐽 ∈ (TopOn‘𝑋) → 𝐹 ∈ (𝐽 Cn (KQ‘𝐽)))
22213ad2ant1 1151 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) → 𝐹 ∈ (𝐽 Cn (KQ‘𝐽)))
23 simp2 1155 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) → (KQ‘𝐽) ∈ Fre)
24 simp3 1156 . . . . . 6 ((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ 𝑋)
25 fnfvelrn 7080 . . . . . 6 ((𝐹 Fn 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐹‘𝐴) ∈ ran 𝐹)
263, 24, 25syl2anc 596 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) → (𝐹‘𝐴) ∈ ran 𝐹)
271kqtopon 24046 . . . . . . 7 (𝐽 ∈ (TopOn‘𝑋) → (KQ‘𝐽) ∈ (TopOn‘ran 𝐹))
28273ad2ant1 1151 . . . . . 6 ((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) → (KQ‘𝐽) ∈ (TopOn‘ran 𝐹))
29 toponuni 23232 . . . . . 6 ((KQ‘𝐽) ∈ (TopOn‘ran 𝐹) → ran 𝐹 = ∪ (KQ‘𝐽))
3028, 29syl 18 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) → ran 𝐹 = ∪ (KQ‘𝐽))
3126, 30eleqtrd 2862 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) → (𝐹‘𝐴) ∈ ∪ (KQ‘𝐽))
32 eqid 2760 . . . . 5 ∪ (KQ‘𝐽) = ∪ (KQ‘𝐽)
3332t1sncld 23644 . . . 4 (((KQ‘𝐽) ∈ Fre ∧ (𝐹‘𝐴) ∈ ∪ (KQ‘𝐽)) → {(𝐹‘𝐴)} ∈ (Clsd‘(KQ‘𝐽)))
3423, 31, 33syl2anc 596 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) → {(𝐹‘𝐴)} ∈ (Clsd‘(KQ‘𝐽)))
35 cnclima 23586 . . 3 ((𝐹 ∈ (𝐽 Cn (KQ‘𝐽)) ∧ {(𝐹‘𝐴)} ∈ (Clsd‘(KQ‘𝐽))) → (◡𝐹 “ {(𝐹‘𝐴)}) ∈ (Clsd‘𝐽))
3622, 34, 35syl2anc 596 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) → (◡𝐹 “ {(𝐹‘𝐴)}) ∈ (Clsd‘𝐽))
3720, 36eqeltrrd 2861 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre ∧ 𝐴 ∈ 𝑋) → {𝑧 ∈ 𝑋 ∣ ∀𝑜 ∈ 𝐽 (𝑧 ∈ 𝑜 ↔ 𝐴 ∈ 𝑜)} ∈ (Clsd‘𝐽))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ∀wral 3076  {crab 3412  {csn 4583  ∪ cuni 4866   ↦ cmpt 5185  ◡ccnv 5649  ran crn 5651   “ cima 5653   Fn wfn 6533  ‘cfv 6538  (class class class)co 7420  TopOnctopon 23228  Clsdccld 23334   Cn ccn 23542  Frect1 23625  KQckq 24012
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-map 8849  df-qtop 17679  df-top 23212  df-topon 23229  df-cld 23337  df-cn 23545  df-t1 23632  df-kq 24013
This theorem is used by:  nrmr0reg  24068
  Copyright terms: Public domain W3C validator