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

Theorem iscnrm3l 47671
Description: Lemma for iscnrm3 47672. Given a topology 𝐽, if two separated sets can be separated by open neighborhoods, then all subspaces of the topology 𝐽 are normal, i.e., two disjoint closed sets can be separated by open neighborhoods. (Contributed by Zhi Wang, 5-Sep-2024.)
Assertion
Ref Expression
iscnrm3l (𝐽 ∈ Top → (∀𝑠 ∈ 𝒫 𝐽𝑡 ∈ 𝒫 𝐽(((𝑠 ∩ ((cls‘𝐽)‘𝑡)) = ∅ ∧ (((cls‘𝐽)‘𝑠) ∩ 𝑡) = ∅) → ∃𝑛𝐽𝑚𝐽 (𝑠𝑛𝑡𝑚 ∧ (𝑛𝑚) = ∅)) → ((𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) → ((𝐶𝐷) = ∅ → ∃𝑙 ∈ (𝐽t 𝑍)∃𝑘 ∈ (𝐽t 𝑍)(𝐶𝑙𝐷𝑘 ∧ (𝑙𝑘) = ∅)))))
Distinct variable groups:   𝐶,𝑘,𝑙,𝑚,𝑛   𝐷,𝑘,𝑙,𝑚,𝑛   𝑘,𝐽,𝑙,𝑚,𝑛   𝑘,𝑍,𝑙,𝑚,𝑛   𝐶,𝑠,𝑡,𝑚,𝑛   𝐷,𝑠,𝑡   𝐽,𝑠,𝑡
Allowed substitution hints:   𝑍(𝑡,𝑠)

Proof of Theorem iscnrm3l
StepHypRef Expression
1 simpl 481 . . . . 5 ((𝑠 = 𝐶𝑡 = 𝐷) → 𝑠 = 𝐶)
2 simpr 483 . . . . . 6 ((𝑠 = 𝐶𝑡 = 𝐷) → 𝑡 = 𝐷)
32fveq2d 6894 . . . . 5 ((𝑠 = 𝐶𝑡 = 𝐷) → ((cls‘𝐽)‘𝑡) = ((cls‘𝐽)‘𝐷))
41, 3ineq12d 4212 . . . 4 ((𝑠 = 𝐶𝑡 = 𝐷) → (𝑠 ∩ ((cls‘𝐽)‘𝑡)) = (𝐶 ∩ ((cls‘𝐽)‘𝐷)))
54eqeq1d 2732 . . 3 ((𝑠 = 𝐶𝑡 = 𝐷) → ((𝑠 ∩ ((cls‘𝐽)‘𝑡)) = ∅ ↔ (𝐶 ∩ ((cls‘𝐽)‘𝐷)) = ∅))
61fveq2d 6894 . . . . 5 ((𝑠 = 𝐶𝑡 = 𝐷) → ((cls‘𝐽)‘𝑠) = ((cls‘𝐽)‘𝐶))
76, 2ineq12d 4212 . . . 4 ((𝑠 = 𝐶𝑡 = 𝐷) → (((cls‘𝐽)‘𝑠) ∩ 𝑡) = (((cls‘𝐽)‘𝐶) ∩ 𝐷))
87eqeq1d 2732 . . 3 ((𝑠 = 𝐶𝑡 = 𝐷) → ((((cls‘𝐽)‘𝑠) ∩ 𝑡) = ∅ ↔ (((cls‘𝐽)‘𝐶) ∩ 𝐷) = ∅))
95, 8anbi12d 629 . 2 ((𝑠 = 𝐶𝑡 = 𝐷) → (((𝑠 ∩ ((cls‘𝐽)‘𝑡)) = ∅ ∧ (((cls‘𝐽)‘𝑠) ∩ 𝑡) = ∅) ↔ ((𝐶 ∩ ((cls‘𝐽)‘𝐷)) = ∅ ∧ (((cls‘𝐽)‘𝐶) ∩ 𝐷) = ∅)))
101sseq1d 4012 . . . 4 ((𝑠 = 𝐶𝑡 = 𝐷) → (𝑠𝑛𝐶𝑛))
112sseq1d 4012 . . . 4 ((𝑠 = 𝐶𝑡 = 𝐷) → (𝑡𝑚𝐷𝑚))
1210, 113anbi12d 1435 . . 3 ((𝑠 = 𝐶𝑡 = 𝐷) → ((𝑠𝑛𝑡𝑚 ∧ (𝑛𝑚) = ∅) ↔ (𝐶𝑛𝐷𝑚 ∧ (𝑛𝑚) = ∅)))
13122rexbidv 3217 . 2 ((𝑠 = 𝐶𝑡 = 𝐷) → (∃𝑛𝐽𝑚𝐽 (𝑠𝑛𝑡𝑚 ∧ (𝑛𝑚) = ∅) ↔ ∃𝑛𝐽𝑚𝐽 (𝐶𝑛𝐷𝑚 ∧ (𝑛𝑚) = ∅)))
14 iscnrm3llem1 47669 . 2 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → (𝐶 ∈ 𝒫 𝐽𝐷 ∈ 𝒫 𝐽))
15 simp1 1134 . . . 4 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → 𝐽 ∈ Top)
16 eqidd 2731 . . . 4 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → 𝐽 = 𝐽)
17 simp21 1204 . . . . 5 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → 𝑍 ∈ 𝒫 𝐽)
1817elpwid 4610 . . . 4 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → 𝑍 𝐽)
19 eqidd 2731 . . . 4 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → (𝐽t 𝑍) = (𝐽t 𝑍))
20 simp22 1205 . . . 4 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → 𝐶 ∈ (Clsd‘(𝐽t 𝑍)))
21 simp3 1136 . . . 4 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → (𝐶𝐷) = ∅)
22 simp23 1206 . . . 4 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → 𝐷 ∈ (Clsd‘(𝐽t 𝑍)))
2315, 16, 18, 19, 20, 21, 22restclssep 47635 . . 3 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → ((𝐶 ∩ ((cls‘𝐽)‘𝐷)) = ∅ ∧ (((cls‘𝐽)‘𝐶) ∩ 𝐷) = ∅))
24 iscnrm3llem2 47670 . . 3 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → (∃𝑛𝐽𝑚𝐽 (𝐶𝑛𝐷𝑚 ∧ (𝑛𝑚) = ∅) → ∃𝑙 ∈ (𝐽t 𝑍)∃𝑘 ∈ (𝐽t 𝑍)(𝐶𝑙𝐷𝑘 ∧ (𝑙𝑘) = ∅)))
2523, 24embantd 59 . 2 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → ((((𝐶 ∩ ((cls‘𝐽)‘𝐷)) = ∅ ∧ (((cls‘𝐽)‘𝐶) ∩ 𝐷) = ∅) → ∃𝑛𝐽𝑚𝐽 (𝐶𝑛𝐷𝑚 ∧ (𝑛𝑚) = ∅)) → ∃𝑙 ∈ (𝐽t 𝑍)∃𝑘 ∈ (𝐽t 𝑍)(𝐶𝑙𝐷𝑘 ∧ (𝑙𝑘) = ∅)))
269, 13, 14, 25iscnrm3lem5 47657 1 (𝐽 ∈ Top → (∀𝑠 ∈ 𝒫 𝐽𝑡 ∈ 𝒫 𝐽(((𝑠 ∩ ((cls‘𝐽)‘𝑡)) = ∅ ∧ (((cls‘𝐽)‘𝑠) ∩ 𝑡) = ∅) → ∃𝑛𝐽𝑚𝐽 (𝑠𝑛𝑡𝑚 ∧ (𝑛𝑚) = ∅)) → ((𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) → ((𝐶𝐷) = ∅ → ∃𝑙 ∈ (𝐽t 𝑍)∃𝑘 ∈ (𝐽t 𝑍)(𝐶𝑙𝐷𝑘 ∧ (𝑙𝑘) = ∅)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 394  w3a 1085   = wceq 1539  wcel 2104  wral 3059  wrex 3068  cin 3946  wss 3947  c0 4321  𝒫 cpw 4601   cuni 4907  cfv 6542  (class class class)co 7411  t crest 17370  Topctop 22615  Clsdccld 22740  clsccl 22742
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-11 2152  ax-12 2169  ax-ext 2701  ax-rep 5284  ax-sep 5298  ax-nul 5305  ax-pow 5362  ax-pr 5426  ax-un 7727
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2532  df-eu 2561  df-clab 2708  df-cleq 2722  df-clel 2808  df-nfc 2883  df-ne 2939  df-ral 3060  df-rex 3069  df-reu 3375  df-rab 3431  df-v 3474  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-int 4950  df-iun 4998  df-iin 4999  df-br 5148  df-opab 5210  df-mpt 5231  df-tr 5265  df-id 5573  df-eprel 5579  df-po 5587  df-so 5588  df-fr 5630  df-we 5632  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-ord 6366  df-on 6367  df-lim 6368  df-suc 6369  df-iota 6494  df-fun 6544  df-fn 6545  df-f 6546  df-f1 6547  df-fo 6548  df-f1o 6549  df-fv 6550  df-ov 7414  df-oprab 7415  df-mpo 7416  df-om 7858  df-1st 7977  df-2nd 7978  df-en 8942  df-fin 8945  df-fi 9408  df-rest 17372  df-topgen 17393  df-top 22616  df-topon 22633  df-bases 22669  df-cld 22743  df-cls 22745
This theorem is referenced by:  iscnrm3  47672
  Copyright terms: Public domain W3C validator