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 47672
Description: Lemma for iscnrm3 47673. 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 483 . . . . 5 ((𝑠 = 𝐶𝑡 = 𝐷) → 𝑠 = 𝐶)
2 simpr 485 . . . . . 6 ((𝑠 = 𝐶𝑡 = 𝐷) → 𝑡 = 𝐷)
32fveq2d 6895 . . . . 5 ((𝑠 = 𝐶𝑡 = 𝐷) → ((cls‘𝐽)‘𝑡) = ((cls‘𝐽)‘𝐷))
41, 3ineq12d 4213 . . . 4 ((𝑠 = 𝐶𝑡 = 𝐷) → (𝑠 ∩ ((cls‘𝐽)‘𝑡)) = (𝐶 ∩ ((cls‘𝐽)‘𝐷)))
54eqeq1d 2734 . . 3 ((𝑠 = 𝐶𝑡 = 𝐷) → ((𝑠 ∩ ((cls‘𝐽)‘𝑡)) = ∅ ↔ (𝐶 ∩ ((cls‘𝐽)‘𝐷)) = ∅))
61fveq2d 6895 . . . . 5 ((𝑠 = 𝐶𝑡 = 𝐷) → ((cls‘𝐽)‘𝑠) = ((cls‘𝐽)‘𝐶))
76, 2ineq12d 4213 . . . 4 ((𝑠 = 𝐶𝑡 = 𝐷) → (((cls‘𝐽)‘𝑠) ∩ 𝑡) = (((cls‘𝐽)‘𝐶) ∩ 𝐷))
87eqeq1d 2734 . . 3 ((𝑠 = 𝐶𝑡 = 𝐷) → ((((cls‘𝐽)‘𝑠) ∩ 𝑡) = ∅ ↔ (((cls‘𝐽)‘𝐶) ∩ 𝐷) = ∅))
95, 8anbi12d 631 . 2 ((𝑠 = 𝐶𝑡 = 𝐷) → (((𝑠 ∩ ((cls‘𝐽)‘𝑡)) = ∅ ∧ (((cls‘𝐽)‘𝑠) ∩ 𝑡) = ∅) ↔ ((𝐶 ∩ ((cls‘𝐽)‘𝐷)) = ∅ ∧ (((cls‘𝐽)‘𝐶) ∩ 𝐷) = ∅)))
101sseq1d 4013 . . . 4 ((𝑠 = 𝐶𝑡 = 𝐷) → (𝑠𝑛𝐶𝑛))
112sseq1d 4013 . . . 4 ((𝑠 = 𝐶𝑡 = 𝐷) → (𝑡𝑚𝐷𝑚))
1210, 113anbi12d 1437 . . 3 ((𝑠 = 𝐶𝑡 = 𝐷) → ((𝑠𝑛𝑡𝑚 ∧ (𝑛𝑚) = ∅) ↔ (𝐶𝑛𝐷𝑚 ∧ (𝑛𝑚) = ∅)))
13122rexbidv 3219 . 2 ((𝑠 = 𝐶𝑡 = 𝐷) → (∃𝑛𝐽𝑚𝐽 (𝑠𝑛𝑡𝑚 ∧ (𝑛𝑚) = ∅) ↔ ∃𝑛𝐽𝑚𝐽 (𝐶𝑛𝐷𝑚 ∧ (𝑛𝑚) = ∅)))
14 iscnrm3llem1 47670 . 2 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → (𝐶 ∈ 𝒫 𝐽𝐷 ∈ 𝒫 𝐽))
15 simp1 1136 . . . 4 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → 𝐽 ∈ Top)
16 eqidd 2733 . . . 4 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → 𝐽 = 𝐽)
17 simp21 1206 . . . . 5 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → 𝑍 ∈ 𝒫 𝐽)
1817elpwid 4611 . . . 4 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → 𝑍 𝐽)
19 eqidd 2733 . . . 4 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → (𝐽t 𝑍) = (𝐽t 𝑍))
20 simp22 1207 . . . 4 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → 𝐶 ∈ (Clsd‘(𝐽t 𝑍)))
21 simp3 1138 . . . 4 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → (𝐶𝐷) = ∅)
22 simp23 1208 . . . 4 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → 𝐷 ∈ (Clsd‘(𝐽t 𝑍)))
2315, 16, 18, 19, 20, 21, 22restclssep 47636 . . 3 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → ((𝐶 ∩ ((cls‘𝐽)‘𝐷)) = ∅ ∧ (((cls‘𝐽)‘𝐶) ∩ 𝐷) = ∅))
24 iscnrm3llem2 47671 . . 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 47658 1 (𝐽 ∈ Top → (∀𝑠 ∈ 𝒫 𝐽𝑡 ∈ 𝒫 𝐽(((𝑠 ∩ ((cls‘𝐽)‘𝑡)) = ∅ ∧ (((cls‘𝐽)‘𝑠) ∩ 𝑡) = ∅) → ∃𝑛𝐽𝑚𝐽 (𝑠𝑛𝑡𝑚 ∧ (𝑛𝑚) = ∅)) → ((𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) → ((𝐶𝐷) = ∅ → ∃𝑙 ∈ (𝐽t 𝑍)∃𝑘 ∈ (𝐽t 𝑍)(𝐶𝑙𝐷𝑘 ∧ (𝑙𝑘) = ∅)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  w3a 1087   = wceq 1541  wcel 2106  wral 3061  wrex 3070  cin 3947  wss 3948  c0 4322  𝒫 cpw 4602   cuni 4908  cfv 6543  (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 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-rep 5285  ax-sep 5299  ax-nul 5306  ax-pow 5363  ax-pr 5427  ax-un 7727
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3377  df-rab 3433  df-v 3476  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-pss 3967  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-int 4951  df-iun 4999  df-iin 5000  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5574  df-eprel 5580  df-po 5588  df-so 5589  df-fr 5631  df-we 5633  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  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  47673
  Copyright terms: Public domain W3C validator