Users' Mathboxes Mathbox for Zhi Wang < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  iscnrm3 Structured version   Visualization version   GIF version

Theorem iscnrm3 49139
Description: A completely normal topology is a topology in which two separated sets can be separated by open neighborhoods. (Contributed by Zhi Wang, 5-Sep-2024.)
Assertion
Ref Expression
iscnrm3 (𝐽 ∈ CNrm ↔ (𝐽 ∈ Top ∧ ∀𝑠 ∈ 𝒫 𝐽𝑡 ∈ 𝒫 𝐽(((𝑠 ∩ ((cls‘𝐽)‘𝑡)) = ∅ ∧ (((cls‘𝐽)‘𝑠) ∩ 𝑡) = ∅) → ∃𝑛𝐽𝑚𝐽 (𝑠𝑛𝑡𝑚 ∧ (𝑛𝑚) = ∅))))
Distinct variable group:   𝑚,𝐽,𝑛,𝑠,𝑡

Proof of Theorem iscnrm3
Dummy variables 𝑐 𝑑 𝑘 𝑙 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2734 . . 3 𝐽 = 𝐽
21iscnrm 23265 . 2 (𝐽 ∈ CNrm ↔ (𝐽 ∈ Top ∧ ∀𝑧 ∈ 𝒫 𝐽(𝐽t 𝑧) ∈ Nrm))
3 iscnrm3lem1 49121 . . . . 5 (𝐽 ∈ Top → (∀𝑧 ∈ 𝒫 𝐽𝑐 ∈ (Clsd‘(𝐽t 𝑧))∀𝑑 ∈ (Clsd‘(𝐽t 𝑧))((𝑐𝑑) = ∅ → ∃𝑙 ∈ (𝐽t 𝑧)∃𝑘 ∈ (𝐽t 𝑧)(𝑐𝑙𝑑𝑘 ∧ (𝑙𝑘) = ∅)) ↔ ∀𝑧 ∈ 𝒫 𝐽((𝐽t 𝑧) ∈ Top ∧ ∀𝑐 ∈ (Clsd‘(𝐽t 𝑧))∀𝑑 ∈ (Clsd‘(𝐽t 𝑧))((𝑐𝑑) = ∅ → ∃𝑙 ∈ (𝐽t 𝑧)∃𝑘 ∈ (𝐽t 𝑧)(𝑐𝑙𝑑𝑘 ∧ (𝑙𝑘) = ∅)))))
4 isnrm3 23301 . . . . . 6 ((𝐽t 𝑧) ∈ Nrm ↔ ((𝐽t 𝑧) ∈ Top ∧ ∀𝑐 ∈ (Clsd‘(𝐽t 𝑧))∀𝑑 ∈ (Clsd‘(𝐽t 𝑧))((𝑐𝑑) = ∅ → ∃𝑙 ∈ (𝐽t 𝑧)∃𝑘 ∈ (𝐽t 𝑧)(𝑐𝑙𝑑𝑘 ∧ (𝑙𝑘) = ∅))))
54ralbii 3080 . . . . 5 (∀𝑧 ∈ 𝒫 𝐽(𝐽t 𝑧) ∈ Nrm ↔ ∀𝑧 ∈ 𝒫 𝐽((𝐽t 𝑧) ∈ Top ∧ ∀𝑐 ∈ (Clsd‘(𝐽t 𝑧))∀𝑑 ∈ (Clsd‘(𝐽t 𝑧))((𝑐𝑑) = ∅ → ∃𝑙 ∈ (𝐽t 𝑧)∃𝑘 ∈ (𝐽t 𝑧)(𝑐𝑙𝑑𝑘 ∧ (𝑙𝑘) = ∅))))
63, 5bitr4di 289 . . . 4 (𝐽 ∈ Top → (∀𝑧 ∈ 𝒫 𝐽𝑐 ∈ (Clsd‘(𝐽t 𝑧))∀𝑑 ∈ (Clsd‘(𝐽t 𝑧))((𝑐𝑑) = ∅ → ∃𝑙 ∈ (𝐽t 𝑧)∃𝑘 ∈ (𝐽t 𝑧)(𝑐𝑙𝑑𝑘 ∧ (𝑙𝑘) = ∅)) ↔ ∀𝑧 ∈ 𝒫 𝐽(𝐽t 𝑧) ∈ Nrm))
7 iscnrm3r 49135 . . . . 5 (𝐽 ∈ Top → (∀𝑧 ∈ 𝒫 𝐽𝑐 ∈ (Clsd‘(𝐽t 𝑧))∀𝑑 ∈ (Clsd‘(𝐽t 𝑧))((𝑐𝑑) = ∅ → ∃𝑙 ∈ (𝐽t 𝑧)∃𝑘 ∈ (𝐽t 𝑧)(𝑐𝑙𝑑𝑘 ∧ (𝑙𝑘) = ∅)) → ((𝑠 ∈ 𝒫 𝐽𝑡 ∈ 𝒫 𝐽) → (((𝑠 ∩ ((cls‘𝐽)‘𝑡)) = ∅ ∧ (((cls‘𝐽)‘𝑠) ∩ 𝑡) = ∅) → ∃𝑛𝐽𝑚𝐽 (𝑠𝑛𝑡𝑚 ∧ (𝑛𝑚) = ∅)))))
8 iscnrm3l 49138 . . . . 5 (𝐽 ∈ Top → (∀𝑠 ∈ 𝒫 𝐽𝑡 ∈ 𝒫 𝐽(((𝑠 ∩ ((cls‘𝐽)‘𝑡)) = ∅ ∧ (((cls‘𝐽)‘𝑠) ∩ 𝑡) = ∅) → ∃𝑛𝐽𝑚𝐽 (𝑠𝑛𝑡𝑚 ∧ (𝑛𝑚) = ∅)) → ((𝑧 ∈ 𝒫 𝐽𝑐 ∈ (Clsd‘(𝐽t 𝑧)) ∧ 𝑑 ∈ (Clsd‘(𝐽t 𝑧))) → ((𝑐𝑑) = ∅ → ∃𝑙 ∈ (𝐽t 𝑧)∃𝑘 ∈ (𝐽t 𝑧)(𝑐𝑙𝑑𝑘 ∧ (𝑙𝑘) = ∅)))))
97, 8iscnrm3lem2 49122 . . . 4 (𝐽 ∈ Top → (∀𝑧 ∈ 𝒫 𝐽𝑐 ∈ (Clsd‘(𝐽t 𝑧))∀𝑑 ∈ (Clsd‘(𝐽t 𝑧))((𝑐𝑑) = ∅ → ∃𝑙 ∈ (𝐽t 𝑧)∃𝑘 ∈ (𝐽t 𝑧)(𝑐𝑙𝑑𝑘 ∧ (𝑙𝑘) = ∅)) ↔ ∀𝑠 ∈ 𝒫 𝐽𝑡 ∈ 𝒫 𝐽(((𝑠 ∩ ((cls‘𝐽)‘𝑡)) = ∅ ∧ (((cls‘𝐽)‘𝑠) ∩ 𝑡) = ∅) → ∃𝑛𝐽𝑚𝐽 (𝑠𝑛𝑡𝑚 ∧ (𝑛𝑚) = ∅))))
106, 9bitr3d 281 . . 3 (𝐽 ∈ Top → (∀𝑧 ∈ 𝒫 𝐽(𝐽t 𝑧) ∈ Nrm ↔ ∀𝑠 ∈ 𝒫 𝐽𝑡 ∈ 𝒫 𝐽(((𝑠 ∩ ((cls‘𝐽)‘𝑡)) = ∅ ∧ (((cls‘𝐽)‘𝑠) ∩ 𝑡) = ∅) → ∃𝑛𝐽𝑚𝐽 (𝑠𝑛𝑡𝑚 ∧ (𝑛𝑚) = ∅))))
1110pm5.32i 574 . 2 ((𝐽 ∈ Top ∧ ∀𝑧 ∈ 𝒫 𝐽(𝐽t 𝑧) ∈ Nrm) ↔ (𝐽 ∈ Top ∧ ∀𝑠 ∈ 𝒫 𝐽𝑡 ∈ 𝒫 𝐽(((𝑠 ∩ ((cls‘𝐽)‘𝑡)) = ∅ ∧ (((cls‘𝐽)‘𝑠) ∩ 𝑡) = ∅) → ∃𝑛𝐽𝑚𝐽 (𝑠𝑛𝑡𝑚 ∧ (𝑛𝑚) = ∅))))
122, 11bitri 275 1 (𝐽 ∈ CNrm ↔ (𝐽 ∈ Top ∧ ∀𝑠 ∈ 𝒫 𝐽𝑡 ∈ 𝒫 𝐽(((𝑠 ∩ ((cls‘𝐽)‘𝑡)) = ∅ ∧ (((cls‘𝐽)‘𝑠) ∩ 𝑡) = ∅) → ∃𝑛𝐽𝑚𝐽 (𝑠𝑛𝑡𝑚 ∧ (𝑛𝑚) = ∅))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1541  wcel 2113  wral 3049  wrex 3058  cin 3898  wss 3899  c0 4283  𝒫 cpw 4552   cuni 4861  cfv 6490  (class class class)co 7356  t crest 17338  Topctop 22835  Clsdccld 22958  clsccl 22960  Nrmcnrm 23252  CNrmccnrm 23253
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-rep 5222  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-int 4901  df-iun 4946  df-iin 4947  df-br 5097  df-opab 5159  df-mpt 5178  df-tr 5204  df-id 5517  df-eprel 5522  df-po 5530  df-so 5531  df-fr 5575  df-we 5577  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-ord 6318  df-on 6319  df-lim 6320  df-suc 6321  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-ov 7359  df-oprab 7360  df-mpo 7361  df-om 7807  df-1st 7931  df-2nd 7932  df-en 8882  df-fin 8885  df-fi 9312  df-rest 17340  df-topgen 17361  df-top 22836  df-topon 22853  df-bases 22888  df-cld 22961  df-cls 22963  df-nrm 23259  df-cnrm 23260
This theorem is referenced by:  iscnrm3v  49140  iscnrm4  49141
  Copyright terms: Public domain W3C validator