MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  isnrm2 Structured version   Visualization version   GIF version

Theorem isnrm2 23589
Description: An alternate characterization of normality. This is the important property in the proof of Urysohn's lemma. (Contributed by Jeff Hankins, 1-Feb-2010.) (Proof shortened by Mario Carneiro, 24-Aug-2015.)
Assertion
Ref Expression
isnrm2 (𝐽 ∈ Nrm ↔ (𝐽 ∈ Top ∧ ∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐𝑑) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅))))
Distinct variable group:   𝑐,𝑑,𝑜,𝐽

Proof of Theorem isnrm2
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 nrmtop 23567 . . 3 (𝐽 ∈ Nrm → 𝐽 ∈ Top)
2 nrmsep2 23587 . . . . . 6 ((𝐽 ∈ Nrm ∧ (𝑐 ∈ (Clsd‘𝐽) ∧ 𝑑 ∈ (Clsd‘𝐽) ∧ (𝑐𝑑) = ∅)) → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅))
323exp2 1373 . . . . 5 (𝐽 ∈ Nrm → (𝑐 ∈ (Clsd‘𝐽) → (𝑑 ∈ (Clsd‘𝐽) → ((𝑐𝑑) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅)))))
43impd 416 . . . 4 (𝐽 ∈ Nrm → ((𝑐 ∈ (Clsd‘𝐽) ∧ 𝑑 ∈ (Clsd‘𝐽)) → ((𝑐𝑑) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅))))
54ralrimivv 3205 . . 3 (𝐽 ∈ Nrm → ∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐𝑑) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅)))
61, 5jca 521 . 2 (𝐽 ∈ Nrm → (𝐽 ∈ Top ∧ ∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐𝑑) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅))))
7 simpl 488 . . 3 ((𝐽 ∈ Top ∧ ∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐𝑑) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅))) → 𝐽 ∈ Top)
8 eqid 2762 . . . . . . . . . . 11 𝐽 = 𝐽
98opncld 23264 . . . . . . . . . 10 ((𝐽 ∈ Top ∧ 𝑥𝐽) → ( 𝐽𝑥) ∈ (Clsd‘𝐽))
109adantr 486 . . . . . . . . 9 (((𝐽 ∈ Top ∧ 𝑥𝐽) ∧ 𝑐 ∈ (Clsd‘𝐽)) → ( 𝐽𝑥) ∈ (Clsd‘𝐽))
11 ineq2 4163 . . . . . . . . . . . 12 (𝑑 = ( 𝐽𝑥) → (𝑐𝑑) = (𝑐 ∩ ( 𝐽𝑥)))
1211eqeq1d 2764 . . . . . . . . . . 11 (𝑑 = ( 𝐽𝑥) → ((𝑐𝑑) = ∅ ↔ (𝑐 ∩ ( 𝐽𝑥)) = ∅))
13 ineq2 4163 . . . . . . . . . . . . . 14 (𝑑 = ( 𝐽𝑥) → (((cls‘𝐽)‘𝑜) ∩ 𝑑) = (((cls‘𝐽)‘𝑜) ∩ ( 𝐽𝑥)))
1413eqeq1d 2764 . . . . . . . . . . . . 13 (𝑑 = ( 𝐽𝑥) → ((((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅ ↔ (((cls‘𝐽)‘𝑜) ∩ ( 𝐽𝑥)) = ∅))
1514anbi2d 642 . . . . . . . . . . . 12 (𝑑 = ( 𝐽𝑥) → ((𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅) ↔ (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ ( 𝐽𝑥)) = ∅)))
1615rexbidv 3188 . . . . . . . . . . 11 (𝑑 = ( 𝐽𝑥) → (∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅) ↔ ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ ( 𝐽𝑥)) = ∅)))
1712, 16imbi12d 347 . . . . . . . . . 10 (𝑑 = ( 𝐽𝑥) → (((𝑐𝑑) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅)) ↔ ((𝑐 ∩ ( 𝐽𝑥)) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ ( 𝐽𝑥)) = ∅))))
1817rspcv 3575 . . . . . . . . 9 (( 𝐽𝑥) ∈ (Clsd‘𝐽) → (∀𝑑 ∈ (Clsd‘𝐽)((𝑐𝑑) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅)) → ((𝑐 ∩ ( 𝐽𝑥)) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ ( 𝐽𝑥)) = ∅))))
1910, 18syl 18 . . . . . . . 8 (((𝐽 ∈ Top ∧ 𝑥𝐽) ∧ 𝑐 ∈ (Clsd‘𝐽)) → (∀𝑑 ∈ (Clsd‘𝐽)((𝑐𝑑) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅)) → ((𝑐 ∩ ( 𝐽𝑥)) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ ( 𝐽𝑥)) = ∅))))
20 inssdif0 4325 . . . . . . . . . 10 ((𝑐 𝐽) ⊆ 𝑥 ↔ (𝑐 ∩ ( 𝐽𝑥)) = ∅)
218cldss 23260 . . . . . . . . . . . . 13 (𝑐 ∈ (Clsd‘𝐽) → 𝑐 𝐽)
2221adantl 487 . . . . . . . . . . . 12 (((𝐽 ∈ Top ∧ 𝑥𝐽) ∧ 𝑐 ∈ (Clsd‘𝐽)) → 𝑐 𝐽)
23 dfss2 3920 . . . . . . . . . . . 12 (𝑐 𝐽 ↔ (𝑐 𝐽) = 𝑐)
2422, 23sylib 221 . . . . . . . . . . 11 (((𝐽 ∈ Top ∧ 𝑥𝐽) ∧ 𝑐 ∈ (Clsd‘𝐽)) → (𝑐 𝐽) = 𝑐)
2524sseq1d 3965 . . . . . . . . . 10 (((𝐽 ∈ Top ∧ 𝑥𝐽) ∧ 𝑐 ∈ (Clsd‘𝐽)) → ((𝑐 𝐽) ⊆ 𝑥𝑐𝑥))
2620, 25bitr3id 288 . . . . . . . . 9 (((𝐽 ∈ Top ∧ 𝑥𝐽) ∧ 𝑐 ∈ (Clsd‘𝐽)) → ((𝑐 ∩ ( 𝐽𝑥)) = ∅ ↔ 𝑐𝑥))
27 inssdif0 4325 . . . . . . . . . . . 12 ((((cls‘𝐽)‘𝑜) ∩ 𝐽) ⊆ 𝑥 ↔ (((cls‘𝐽)‘𝑜) ∩ ( 𝐽𝑥)) = ∅)
28 simpll 779 . . . . . . . . . . . . . . 15 (((𝐽 ∈ Top ∧ 𝑥𝐽) ∧ 𝑐 ∈ (Clsd‘𝐽)) → 𝐽 ∈ Top)
29 elssuni 4902 . . . . . . . . . . . . . . 15 (𝑜𝐽𝑜 𝐽)
308clsss3 23290 . . . . . . . . . . . . . . 15 ((𝐽 ∈ Top ∧ 𝑜 𝐽) → ((cls‘𝐽)‘𝑜) ⊆ 𝐽)
3128, 29, 30syl2an 608 . . . . . . . . . . . . . 14 ((((𝐽 ∈ Top ∧ 𝑥𝐽) ∧ 𝑐 ∈ (Clsd‘𝐽)) ∧ 𝑜𝐽) → ((cls‘𝐽)‘𝑜) ⊆ 𝐽)
32 dfss2 3920 . . . . . . . . . . . . . 14 (((cls‘𝐽)‘𝑜) ⊆ 𝐽 ↔ (((cls‘𝐽)‘𝑜) ∩ 𝐽) = ((cls‘𝐽)‘𝑜))
3331, 32sylib 221 . . . . . . . . . . . . 13 ((((𝐽 ∈ Top ∧ 𝑥𝐽) ∧ 𝑐 ∈ (Clsd‘𝐽)) ∧ 𝑜𝐽) → (((cls‘𝐽)‘𝑜) ∩ 𝐽) = ((cls‘𝐽)‘𝑜))
3433sseq1d 3965 . . . . . . . . . . . 12 ((((𝐽 ∈ Top ∧ 𝑥𝐽) ∧ 𝑐 ∈ (Clsd‘𝐽)) ∧ 𝑜𝐽) → ((((cls‘𝐽)‘𝑜) ∩ 𝐽) ⊆ 𝑥 ↔ ((cls‘𝐽)‘𝑜) ⊆ 𝑥))
3527, 34bitr3id 288 . . . . . . . . . . 11 ((((𝐽 ∈ Top ∧ 𝑥𝐽) ∧ 𝑐 ∈ (Clsd‘𝐽)) ∧ 𝑜𝐽) → ((((cls‘𝐽)‘𝑜) ∩ ( 𝐽𝑥)) = ∅ ↔ ((cls‘𝐽)‘𝑜) ⊆ 𝑥))
3635anbi2d 642 . . . . . . . . . 10 ((((𝐽 ∈ Top ∧ 𝑥𝐽) ∧ 𝑐 ∈ (Clsd‘𝐽)) ∧ 𝑜𝐽) → ((𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ ( 𝐽𝑥)) = ∅) ↔ (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥)))
3736rexbidva 3186 . . . . . . . . 9 (((𝐽 ∈ Top ∧ 𝑥𝐽) ∧ 𝑐 ∈ (Clsd‘𝐽)) → (∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ ( 𝐽𝑥)) = ∅) ↔ ∃𝑜𝐽 (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥)))
3826, 37imbi12d 347 . . . . . . . 8 (((𝐽 ∈ Top ∧ 𝑥𝐽) ∧ 𝑐 ∈ (Clsd‘𝐽)) → (((𝑐 ∩ ( 𝐽𝑥)) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ ( 𝐽𝑥)) = ∅)) ↔ (𝑐𝑥 → ∃𝑜𝐽 (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥))))
3919, 38sylibd 242 . . . . . . 7 (((𝐽 ∈ Top ∧ 𝑥𝐽) ∧ 𝑐 ∈ (Clsd‘𝐽)) → (∀𝑑 ∈ (Clsd‘𝐽)((𝑐𝑑) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅)) → (𝑐𝑥 → ∃𝑜𝐽 (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥))))
4039ralimdva 3176 . . . . . 6 ((𝐽 ∈ Top ∧ 𝑥𝐽) → (∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐𝑑) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅)) → ∀𝑐 ∈ (Clsd‘𝐽)(𝑐𝑥 → ∃𝑜𝐽 (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥))))
41 elin 3918 . . . . . . . . . 10 (𝑐 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥) ↔ (𝑐 ∈ (Clsd‘𝐽) ∧ 𝑐 ∈ 𝒫 𝑥))
42 velpw 4565 . . . . . . . . . . 11 (𝑐 ∈ 𝒫 𝑥𝑐𝑥)
4342anbi2i 635 . . . . . . . . . 10 ((𝑐 ∈ (Clsd‘𝐽) ∧ 𝑐 ∈ 𝒫 𝑥) ↔ (𝑐 ∈ (Clsd‘𝐽) ∧ 𝑐𝑥))
4441, 43bitri 278 . . . . . . . . 9 (𝑐 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥) ↔ (𝑐 ∈ (Clsd‘𝐽) ∧ 𝑐𝑥))
4544imbi1i 352 . . . . . . . 8 ((𝑐 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥) → ∃𝑜𝐽 (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥)) ↔ ((𝑐 ∈ (Clsd‘𝐽) ∧ 𝑐𝑥) → ∃𝑜𝐽 (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥)))
46 impexp 456 . . . . . . . 8 (((𝑐 ∈ (Clsd‘𝐽) ∧ 𝑐𝑥) → ∃𝑜𝐽 (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥)) ↔ (𝑐 ∈ (Clsd‘𝐽) → (𝑐𝑥 → ∃𝑜𝐽 (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥))))
4745, 46bitri 278 . . . . . . 7 ((𝑐 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥) → ∃𝑜𝐽 (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥)) ↔ (𝑐 ∈ (Clsd‘𝐽) → (𝑐𝑥 → ∃𝑜𝐽 (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥))))
4847ralbii2 3106 . . . . . 6 (∀𝑐 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥)∃𝑜𝐽 (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥) ↔ ∀𝑐 ∈ (Clsd‘𝐽)(𝑐𝑥 → ∃𝑜𝐽 (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥)))
4940, 48imbitrrdi 255 . . . . 5 ((𝐽 ∈ Top ∧ 𝑥𝐽) → (∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐𝑑) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅)) → ∀𝑐 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥)∃𝑜𝐽 (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥)))
5049ralrimdva 3164 . . . 4 (𝐽 ∈ Top → (∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐𝑑) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅)) → ∀𝑥𝐽𝑐 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥)∃𝑜𝐽 (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥)))
5150imp 412 . . 3 ((𝐽 ∈ Top ∧ ∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐𝑑) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅))) → ∀𝑥𝐽𝑐 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥)∃𝑜𝐽 (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥))
52 isnrm 23566 . . 3 (𝐽 ∈ Nrm ↔ (𝐽 ∈ Top ∧ ∀𝑥𝐽𝑐 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥)∃𝑜𝐽 (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥)))
537, 51, 52sylanbrc 595 . 2 ((𝐽 ∈ Top ∧ ∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐𝑑) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅))) → 𝐽 ∈ Nrm)
546, 53impbii 212 1 (𝐽 ∈ Nrm ↔ (𝐽 ∈ Top ∧ ∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐𝑑) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wcel 2145  wral 3078  wrex 3088  cdif 3899  cin 3901  wss 3902  c0 4282  𝒫 cpw 4560   cuni 4870  cfv 6537  Topctop 23124  Clsdccld 23247  clsccl 23249  Nrmcnrm 23541
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740
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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-int 4911  df-iun 4956  df-iin 4957  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  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-top 23125  df-cld 23250  df-cls 23252  df-nrm 23548
This theorem is used by:  isnrm3  23590
  Copyright terms: Public domain W3C validator