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 46134
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 2738 . . 3 𝐽 = 𝐽
21iscnrm 22382 . 2 (𝐽 ∈ CNrm ↔ (𝐽 ∈ Top ∧ ∀𝑧 ∈ 𝒫 𝐽(𝐽t 𝑧) ∈ Nrm))
3 iscnrm3lem1 46115 . . . . 5 (𝐽 ∈ Top → (∀𝑧 ∈ 𝒫 𝐽𝑐 ∈ (Clsd‘(𝐽t 𝑧))∀𝑑 ∈ (Clsd‘(𝐽t 𝑧))((𝑐𝑑) = ∅ → ∃𝑙 ∈ (𝐽t 𝑧)∃𝑘 ∈ (𝐽t 𝑧)(𝑐𝑙𝑑𝑘 ∧ (𝑙𝑘) = ∅)) ↔ ∀𝑧 ∈ 𝒫 𝐽((𝐽t 𝑧) ∈ Top ∧ ∀𝑐 ∈ (Clsd‘(𝐽t 𝑧))∀𝑑 ∈ (Clsd‘(𝐽t 𝑧))((𝑐𝑑) = ∅ → ∃𝑙 ∈ (𝐽t 𝑧)∃𝑘 ∈ (𝐽t 𝑧)(𝑐𝑙𝑑𝑘 ∧ (𝑙𝑘) = ∅)))))
4 isnrm3 22418 . . . . . 6 ((𝐽t 𝑧) ∈ Nrm ↔ ((𝐽t 𝑧) ∈ Top ∧ ∀𝑐 ∈ (Clsd‘(𝐽t 𝑧))∀𝑑 ∈ (Clsd‘(𝐽t 𝑧))((𝑐𝑑) = ∅ → ∃𝑙 ∈ (𝐽t 𝑧)∃𝑘 ∈ (𝐽t 𝑧)(𝑐𝑙𝑑𝑘 ∧ (𝑙𝑘) = ∅))))
54ralbii 3090 . . . . 5 (∀𝑧 ∈ 𝒫 𝐽(𝐽t 𝑧) ∈ Nrm ↔ ∀𝑧 ∈ 𝒫 𝐽((𝐽t 𝑧) ∈ Top ∧ ∀𝑐 ∈ (Clsd‘(𝐽t 𝑧))∀𝑑 ∈ (Clsd‘(𝐽t 𝑧))((𝑐𝑑) = ∅ → ∃𝑙 ∈ (𝐽t 𝑧)∃𝑘 ∈ (𝐽t 𝑧)(𝑐𝑙𝑑𝑘 ∧ (𝑙𝑘) = ∅))))
63, 5bitr4di 288 . . . 4 (𝐽 ∈ Top → (∀𝑧 ∈ 𝒫 𝐽𝑐 ∈ (Clsd‘(𝐽t 𝑧))∀𝑑 ∈ (Clsd‘(𝐽t 𝑧))((𝑐𝑑) = ∅ → ∃𝑙 ∈ (𝐽t 𝑧)∃𝑘 ∈ (𝐽t 𝑧)(𝑐𝑙𝑑𝑘 ∧ (𝑙𝑘) = ∅)) ↔ ∀𝑧 ∈ 𝒫 𝐽(𝐽t 𝑧) ∈ Nrm))
7 iscnrm3r 46130 . . . . 5 (𝐽 ∈ Top → (∀𝑧 ∈ 𝒫 𝐽𝑐 ∈ (Clsd‘(𝐽t 𝑧))∀𝑑 ∈ (Clsd‘(𝐽t 𝑧))((𝑐𝑑) = ∅ → ∃𝑙 ∈ (𝐽t 𝑧)∃𝑘 ∈ (𝐽t 𝑧)(𝑐𝑙𝑑𝑘 ∧ (𝑙𝑘) = ∅)) → ((𝑠 ∈ 𝒫 𝐽𝑡 ∈ 𝒫 𝐽) → (((𝑠 ∩ ((cls‘𝐽)‘𝑡)) = ∅ ∧ (((cls‘𝐽)‘𝑠) ∩ 𝑡) = ∅) → ∃𝑛𝐽𝑚𝐽 (𝑠𝑛𝑡𝑚 ∧ (𝑛𝑚) = ∅)))))
8 iscnrm3l 46133 . . . . 5 (𝐽 ∈ Top → (∀𝑠 ∈ 𝒫 𝐽𝑡 ∈ 𝒫 𝐽(((𝑠 ∩ ((cls‘𝐽)‘𝑡)) = ∅ ∧ (((cls‘𝐽)‘𝑠) ∩ 𝑡) = ∅) → ∃𝑛𝐽𝑚𝐽 (𝑠𝑛𝑡𝑚 ∧ (𝑛𝑚) = ∅)) → ((𝑧 ∈ 𝒫 𝐽𝑐 ∈ (Clsd‘(𝐽t 𝑧)) ∧ 𝑑 ∈ (Clsd‘(𝐽t 𝑧))) → ((𝑐𝑑) = ∅ → ∃𝑙 ∈ (𝐽t 𝑧)∃𝑘 ∈ (𝐽t 𝑧)(𝑐𝑙𝑑𝑘 ∧ (𝑙𝑘) = ∅)))))
97, 8iscnrm3lem2 46116 . . . 4 (𝐽 ∈ Top → (∀𝑧 ∈ 𝒫 𝐽𝑐 ∈ (Clsd‘(𝐽t 𝑧))∀𝑑 ∈ (Clsd‘(𝐽t 𝑧))((𝑐𝑑) = ∅ → ∃𝑙 ∈ (𝐽t 𝑧)∃𝑘 ∈ (𝐽t 𝑧)(𝑐𝑙𝑑𝑘 ∧ (𝑙𝑘) = ∅)) ↔ ∀𝑠 ∈ 𝒫 𝐽𝑡 ∈ 𝒫 𝐽(((𝑠 ∩ ((cls‘𝐽)‘𝑡)) = ∅ ∧ (((cls‘𝐽)‘𝑠) ∩ 𝑡) = ∅) → ∃𝑛𝐽𝑚𝐽 (𝑠𝑛𝑡𝑚 ∧ (𝑛𝑚) = ∅))))
106, 9bitr3d 280 . . 3 (𝐽 ∈ Top → (∀𝑧 ∈ 𝒫 𝐽(𝐽t 𝑧) ∈ Nrm ↔ ∀𝑠 ∈ 𝒫 𝐽𝑡 ∈ 𝒫 𝐽(((𝑠 ∩ ((cls‘𝐽)‘𝑡)) = ∅ ∧ (((cls‘𝐽)‘𝑠) ∩ 𝑡) = ∅) → ∃𝑛𝐽𝑚𝐽 (𝑠𝑛𝑡𝑚 ∧ (𝑛𝑚) = ∅))))
1110pm5.32i 574 . 2 ((𝐽 ∈ Top ∧ ∀𝑧 ∈ 𝒫 𝐽(𝐽t 𝑧) ∈ Nrm) ↔ (𝐽 ∈ Top ∧ ∀𝑠 ∈ 𝒫 𝐽𝑡 ∈ 𝒫 𝐽(((𝑠 ∩ ((cls‘𝐽)‘𝑡)) = ∅ ∧ (((cls‘𝐽)‘𝑠) ∩ 𝑡) = ∅) → ∃𝑛𝐽𝑚𝐽 (𝑠𝑛𝑡𝑚 ∧ (𝑛𝑚) = ∅))))
122, 11bitri 274 1 (𝐽 ∈ CNrm ↔ (𝐽 ∈ Top ∧ ∀𝑠 ∈ 𝒫 𝐽𝑡 ∈ 𝒫 𝐽(((𝑠 ∩ ((cls‘𝐽)‘𝑡)) = ∅ ∧ (((cls‘𝐽)‘𝑠) ∩ 𝑡) = ∅) → ∃𝑛𝐽𝑚𝐽 (𝑠𝑛𝑡𝑚 ∧ (𝑛𝑚) = ∅))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395  w3a 1085   = wceq 1539  wcel 2108  wral 3063  wrex 3064  cin 3882  wss 3883  c0 4253  𝒫 cpw 4530   cuni 4836  cfv 6418  (class class class)co 7255  t crest 17048  Topctop 21950  Clsdccld 22075  clsccl 22077  Nrmcnrm 22369  CNrmccnrm 22370
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-int 4877  df-iun 4923  df-iin 4924  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-ov 7258  df-oprab 7259  df-mpo 7260  df-om 7688  df-1st 7804  df-2nd 7805  df-en 8692  df-fin 8695  df-fi 9100  df-rest 17050  df-topgen 17071  df-top 21951  df-topon 21968  df-bases 22004  df-cld 22078  df-cls 22080  df-nrm 22376  df-cnrm 22377
This theorem is referenced by:  iscnrm3v  46135  iscnrm4  46136
  Copyright terms: Public domain W3C validator