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

Theorem isnrm4 49768
Description: A topological space is normal iff any two disjoint closed sets are separated by neighborhoods. (Contributed by Zhi Wang, 1-Sep-2024.)
Assertion
Ref Expression
isnrm4 (𝐽 ∈ Nrm ↔ (𝐽 ∈ Top ∧ ∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐𝑑) = ∅ → ∃𝑥 ∈ ((nei‘𝐽)‘𝑐)∃𝑦 ∈ ((nei‘𝐽)‘𝑑)(𝑥𝑦) = ∅)))
Distinct variable group:   𝐽,𝑐,𝑑,𝑥,𝑦

Proof of Theorem isnrm4
StepHypRef Expression
1 isnrm3 23568 . 2 (𝐽 ∈ Nrm ↔ (𝐽 ∈ Top ∧ ∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐𝑑) = ∅ → ∃𝑥𝐽𝑦𝐽 (𝑐𝑥𝑑𝑦 ∧ (𝑥𝑦) = ∅))))
2 id 23 . . . . . 6 (𝐽 ∈ Top → 𝐽 ∈ Top)
32sepnsepo 49761 . . . . 5 (𝐽 ∈ Top → (∃𝑥 ∈ ((nei‘𝐽)‘𝑐)∃𝑦 ∈ ((nei‘𝐽)‘𝑑)(𝑥𝑦) = ∅ ↔ ∃𝑥𝐽𝑦𝐽 (𝑐𝑥𝑑𝑦 ∧ (𝑥𝑦) = ∅)))
43imbi2d 343 . . . 4 (𝐽 ∈ Top → (((𝑐𝑑) = ∅ → ∃𝑥 ∈ ((nei‘𝐽)‘𝑐)∃𝑦 ∈ ((nei‘𝐽)‘𝑑)(𝑥𝑦) = ∅) ↔ ((𝑐𝑑) = ∅ → ∃𝑥𝐽𝑦𝐽 (𝑐𝑥𝑑𝑦 ∧ (𝑥𝑦) = ∅))))
542ralbidv 3231 . . 3 (𝐽 ∈ Top → (∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐𝑑) = ∅ → ∃𝑥 ∈ ((nei‘𝐽)‘𝑐)∃𝑦 ∈ ((nei‘𝐽)‘𝑑)(𝑥𝑦) = ∅) ↔ ∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐𝑑) = ∅ → ∃𝑥𝐽𝑦𝐽 (𝑐𝑥𝑑𝑦 ∧ (𝑥𝑦) = ∅))))
65pm5.32i 585 . 2 ((𝐽 ∈ Top ∧ ∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐𝑑) = ∅ → ∃𝑥 ∈ ((nei‘𝐽)‘𝑐)∃𝑦 ∈ ((nei‘𝐽)‘𝑑)(𝑥𝑦) = ∅)) ↔ (𝐽 ∈ Top ∧ ∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐𝑑) = ∅ → ∃𝑥𝐽𝑦𝐽 (𝑐𝑥𝑑𝑦 ∧ (𝑥𝑦) = ∅))))
71, 6bitr4i 281 1 (𝐽 ∈ Nrm ↔ (𝐽 ∈ Top ∧ ∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐𝑑) = ∅ → ∃𝑥 ∈ ((nei‘𝐽)‘𝑐)∃𝑦 ∈ ((nei‘𝐽)‘𝑑)(𝑥𝑦) = ∅)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401  w3a 1103   = wceq 1570  wcel 2146  wral 3081  wrex 3091  cin 3905  wss 3906  c0 4286  cfv 6540  Topctop 23102  Clsdccld 23225  neicnei 23306  Nrmcnrm 23519
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-int 4915  df-iun 4960  df-iin 4961  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-top 23103  df-cld 23228  df-cls 23230  df-nei 23307  df-nrm 23526
This theorem is used by:  dfnrm3  49770
  Copyright terms: Public domain W3C validator