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 49615
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 2769 . . 3 𝐽 = 𝐽
21iscnrm 23449 . 2 (𝐽 ∈ CNrm ↔ (𝐽 ∈ Top ∧ ∀𝑧 ∈ 𝒫 𝐽(𝐽t 𝑧) ∈ Nrm))
3 iscnrm3lem1 49597 . . . . 5 (𝐽 ∈ Top → (∀𝑧 ∈ 𝒫 𝐽𝑐 ∈ (Clsd‘(𝐽t 𝑧))∀𝑑 ∈ (Clsd‘(𝐽t 𝑧))((𝑐𝑑) = ∅ → ∃𝑙 ∈ (𝐽t 𝑧)∃𝑘 ∈ (𝐽t 𝑧)(𝑐𝑙𝑑𝑘 ∧ (𝑙𝑘) = ∅)) ↔ ∀𝑧 ∈ 𝒫 𝐽((𝐽t 𝑧) ∈ Top ∧ ∀𝑐 ∈ (Clsd‘(𝐽t 𝑧))∀𝑑 ∈ (Clsd‘(𝐽t 𝑧))((𝑐𝑑) = ∅ → ∃𝑙 ∈ (𝐽t 𝑧)∃𝑘 ∈ (𝐽t 𝑧)(𝑐𝑙𝑑𝑘 ∧ (𝑙𝑘) = ∅)))))
4 isnrm3 23485 . . . . . 6 ((𝐽t 𝑧) ∈ Nrm ↔ ((𝐽t 𝑧) ∈ Top ∧ ∀𝑐 ∈ (Clsd‘(𝐽t 𝑧))∀𝑑 ∈ (Clsd‘(𝐽t 𝑧))((𝑐𝑑) = ∅ → ∃𝑙 ∈ (𝐽t 𝑧)∃𝑘 ∈ (𝐽t 𝑧)(𝑐𝑙𝑑𝑘 ∧ (𝑙𝑘) = ∅))))
54ralbii 3117 . . . . 5 (∀𝑧 ∈ 𝒫 𝐽(𝐽t 𝑧) ∈ Nrm ↔ ∀𝑧 ∈ 𝒫 𝐽((𝐽t 𝑧) ∈ Top ∧ ∀𝑐 ∈ (Clsd‘(𝐽t 𝑧))∀𝑑 ∈ (Clsd‘(𝐽t 𝑧))((𝑐𝑑) = ∅ → ∃𝑙 ∈ (𝐽t 𝑧)∃𝑘 ∈ (𝐽t 𝑧)(𝑐𝑙𝑑𝑘 ∧ (𝑙𝑘) = ∅))))
63, 5bitr4di 292 . . . 4 (𝐽 ∈ Top → (∀𝑧 ∈ 𝒫 𝐽𝑐 ∈ (Clsd‘(𝐽t 𝑧))∀𝑑 ∈ (Clsd‘(𝐽t 𝑧))((𝑐𝑑) = ∅ → ∃𝑙 ∈ (𝐽t 𝑧)∃𝑘 ∈ (𝐽t 𝑧)(𝑐𝑙𝑑𝑘 ∧ (𝑙𝑘) = ∅)) ↔ ∀𝑧 ∈ 𝒫 𝐽(𝐽t 𝑧) ∈ Nrm))
7 iscnrm3r 49611 . . . . 5 (𝐽 ∈ Top → (∀𝑧 ∈ 𝒫 𝐽𝑐 ∈ (Clsd‘(𝐽t 𝑧))∀𝑑 ∈ (Clsd‘(𝐽t 𝑧))((𝑐𝑑) = ∅ → ∃𝑙 ∈ (𝐽t 𝑧)∃𝑘 ∈ (𝐽t 𝑧)(𝑐𝑙𝑑𝑘 ∧ (𝑙𝑘) = ∅)) → ((𝑠 ∈ 𝒫 𝐽𝑡 ∈ 𝒫 𝐽) → (((𝑠 ∩ ((cls‘𝐽)‘𝑡)) = ∅ ∧ (((cls‘𝐽)‘𝑠) ∩ 𝑡) = ∅) → ∃𝑛𝐽𝑚𝐽 (𝑠𝑛𝑡𝑚 ∧ (𝑛𝑚) = ∅)))))
8 iscnrm3l 49614 . . . . 5 (𝐽 ∈ Top → (∀𝑠 ∈ 𝒫 𝐽𝑡 ∈ 𝒫 𝐽(((𝑠 ∩ ((cls‘𝐽)‘𝑡)) = ∅ ∧ (((cls‘𝐽)‘𝑠) ∩ 𝑡) = ∅) → ∃𝑛𝐽𝑚𝐽 (𝑠𝑛𝑡𝑚 ∧ (𝑛𝑚) = ∅)) → ((𝑧 ∈ 𝒫 𝐽𝑐 ∈ (Clsd‘(𝐽t 𝑧)) ∧ 𝑑 ∈ (Clsd‘(𝐽t 𝑧))) → ((𝑐𝑑) = ∅ → ∃𝑙 ∈ (𝐽t 𝑧)∃𝑘 ∈ (𝐽t 𝑧)(𝑐𝑙𝑑𝑘 ∧ (𝑙𝑘) = ∅)))))
97, 8iscnrm3lem2 49598 . . . 4 (𝐽 ∈ Top → (∀𝑧 ∈ 𝒫 𝐽𝑐 ∈ (Clsd‘(𝐽t 𝑧))∀𝑑 ∈ (Clsd‘(𝐽t 𝑧))((𝑐𝑑) = ∅ → ∃𝑙 ∈ (𝐽t 𝑧)∃𝑘 ∈ (𝐽t 𝑧)(𝑐𝑙𝑑𝑘 ∧ (𝑙𝑘) = ∅)) ↔ ∀𝑠 ∈ 𝒫 𝐽𝑡 ∈ 𝒫 𝐽(((𝑠 ∩ ((cls‘𝐽)‘𝑡)) = ∅ ∧ (((cls‘𝐽)‘𝑠) ∩ 𝑡) = ∅) → ∃𝑛𝐽𝑚𝐽 (𝑠𝑛𝑡𝑚 ∧ (𝑛𝑚) = ∅))))
106, 9bitr3d 284 . . 3 (𝐽 ∈ Top → (∀𝑧 ∈ 𝒫 𝐽(𝐽t 𝑧) ∈ Nrm ↔ ∀𝑠 ∈ 𝒫 𝐽𝑡 ∈ 𝒫 𝐽(((𝑠 ∩ ((cls‘𝐽)‘𝑡)) = ∅ ∧ (((cls‘𝐽)‘𝑠) ∩ 𝑡) = ∅) → ∃𝑛𝐽𝑚𝐽 (𝑠𝑛𝑡𝑚 ∧ (𝑛𝑚) = ∅))))
1110pm5.32i 584 . 2 ((𝐽 ∈ Top ∧ ∀𝑧 ∈ 𝒫 𝐽(𝐽t 𝑧) ∈ Nrm) ↔ (𝐽 ∈ Top ∧ ∀𝑠 ∈ 𝒫 𝐽𝑡 ∈ 𝒫 𝐽(((𝑠 ∩ ((cls‘𝐽)‘𝑡)) = ∅ ∧ (((cls‘𝐽)‘𝑠) ∩ 𝑡) = ∅) → ∃𝑛𝐽𝑚𝐽 (𝑠𝑛𝑡𝑚 ∧ (𝑛𝑚) = ∅))))
122, 11bitri 278 1 (𝐽 ∈ CNrm ↔ (𝐽 ∈ Top ∧ ∀𝑠 ∈ 𝒫 𝐽𝑡 ∈ 𝒫 𝐽(((𝑠 ∩ ((cls‘𝐽)‘𝑡)) = ∅ ∧ (((cls‘𝐽)‘𝑠) ∩ 𝑡) = ∅) → ∃𝑛𝐽𝑚𝐽 (𝑠𝑛𝑡𝑚 ∧ (𝑛𝑚) = ∅))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  w3a 1101   = wceq 1567  wcel 2149  wral 3085  wrex 3095  cin 3912  wss 3913  c0 4294  𝒫 cpw 4567   cuni 4876  cfv 6537  (class class class)co 7411  t crest 17473  Topctop 23019  Clsdccld 23142  clsccl 23144  Nrmcnrm 23436  CNrmccnrm 23437
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5242  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-int 4917  df-iun 4962  df-iin 4963  df-br 5114  df-opab 5178  df-mpt 5197  df-tr 5223  df-id 5557  df-eprel 5562  df-po 5570  df-so 5571  df-fr 5615  df-we 5617  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7414  df-oprab 7415  df-mpo 7416  df-om 7863  df-1st 7986  df-2nd 7987  df-en 8944  df-fin 8947  df-fi 9371  df-rest 17475  df-topgen 17496  df-top 23020  df-topon 23037  df-bases 23072  df-cld 23145  df-cls 23147  df-nrm 23443  df-cnrm 23444
This theorem is referenced by:  iscnrm3v  49616  iscnrm4  49617
  Copyright terms: Public domain W3C validator