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

Theorem isnrm2 21102
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 21080 . . 3 (𝐽 ∈ Nrm → 𝐽 ∈ Top)
2 nrmsep2 21100 . . . . . 6 ((𝐽 ∈ Nrm ∧ (𝑐 ∈ (Clsd‘𝐽) ∧ 𝑑 ∈ (Clsd‘𝐽) ∧ (𝑐𝑑) = ∅)) → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅))
323exp2 1282 . . . . 5 (𝐽 ∈ Nrm → (𝑐 ∈ (Clsd‘𝐽) → (𝑑 ∈ (Clsd‘𝐽) → ((𝑐𝑑) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅)))))
43impd 447 . . . 4 (𝐽 ∈ Nrm → ((𝑐 ∈ (Clsd‘𝐽) ∧ 𝑑 ∈ (Clsd‘𝐽)) → ((𝑐𝑑) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅))))
54ralrimivv 2966 . . 3 (𝐽 ∈ Nrm → ∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐𝑑) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅)))
61, 5jca 554 . 2 (𝐽 ∈ Nrm → (𝐽 ∈ Top ∧ ∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐𝑑) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅))))
7 simpl 473 . . 3 ((𝐽 ∈ Top ∧ ∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐𝑑) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅))) → 𝐽 ∈ Top)
8 eqid 2621 . . . . . . . . . . 11 𝐽 = 𝐽
98opncld 20777 . . . . . . . . . 10 ((𝐽 ∈ Top ∧ 𝑥𝐽) → ( 𝐽𝑥) ∈ (Clsd‘𝐽))
109adantr 481 . . . . . . . . 9 (((𝐽 ∈ Top ∧ 𝑥𝐽) ∧ 𝑐 ∈ (Clsd‘𝐽)) → ( 𝐽𝑥) ∈ (Clsd‘𝐽))
11 ineq2 3792 . . . . . . . . . . . 12 (𝑑 = ( 𝐽𝑥) → (𝑐𝑑) = (𝑐 ∩ ( 𝐽𝑥)))
1211eqeq1d 2623 . . . . . . . . . . 11 (𝑑 = ( 𝐽𝑥) → ((𝑐𝑑) = ∅ ↔ (𝑐 ∩ ( 𝐽𝑥)) = ∅))
13 ineq2 3792 . . . . . . . . . . . . . 14 (𝑑 = ( 𝐽𝑥) → (((cls‘𝐽)‘𝑜) ∩ 𝑑) = (((cls‘𝐽)‘𝑜) ∩ ( 𝐽𝑥)))
1413eqeq1d 2623 . . . . . . . . . . . . 13 (𝑑 = ( 𝐽𝑥) → ((((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅ ↔ (((cls‘𝐽)‘𝑜) ∩ ( 𝐽𝑥)) = ∅))
1514anbi2d 739 . . . . . . . . . . . 12 (𝑑 = ( 𝐽𝑥) → ((𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅) ↔ (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ ( 𝐽𝑥)) = ∅)))
1615rexbidv 3047 . . . . . . . . . . 11 (𝑑 = ( 𝐽𝑥) → (∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅) ↔ ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ ( 𝐽𝑥)) = ∅)))
1712, 16imbi12d 334 . . . . . . . . . 10 (𝑑 = ( 𝐽𝑥) → (((𝑐𝑑) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅)) ↔ ((𝑐 ∩ ( 𝐽𝑥)) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ ( 𝐽𝑥)) = ∅))))
1817rspcv 3295 . . . . . . . . 9 (( 𝐽𝑥) ∈ (Clsd‘𝐽) → (∀𝑑 ∈ (Clsd‘𝐽)((𝑐𝑑) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅)) → ((𝑐 ∩ ( 𝐽𝑥)) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ ( 𝐽𝑥)) = ∅))))
1910, 18syl 17 . . . . . . . 8 (((𝐽 ∈ Top ∧ 𝑥𝐽) ∧ 𝑐 ∈ (Clsd‘𝐽)) → (∀𝑑 ∈ (Clsd‘𝐽)((𝑐𝑑) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅)) → ((𝑐 ∩ ( 𝐽𝑥)) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ ( 𝐽𝑥)) = ∅))))
20 inssdif0 3927 . . . . . . . . . 10 ((𝑐 𝐽) ⊆ 𝑥 ↔ (𝑐 ∩ ( 𝐽𝑥)) = ∅)
218cldss 20773 . . . . . . . . . . . . 13 (𝑐 ∈ (Clsd‘𝐽) → 𝑐 𝐽)
2221adantl 482 . . . . . . . . . . . 12 (((𝐽 ∈ Top ∧ 𝑥𝐽) ∧ 𝑐 ∈ (Clsd‘𝐽)) → 𝑐 𝐽)
23 df-ss 3574 . . . . . . . . . . . 12 (𝑐 𝐽 ↔ (𝑐 𝐽) = 𝑐)
2422, 23sylib 208 . . . . . . . . . . 11 (((𝐽 ∈ Top ∧ 𝑥𝐽) ∧ 𝑐 ∈ (Clsd‘𝐽)) → (𝑐 𝐽) = 𝑐)
2524sseq1d 3617 . . . . . . . . . 10 (((𝐽 ∈ Top ∧ 𝑥𝐽) ∧ 𝑐 ∈ (Clsd‘𝐽)) → ((𝑐 𝐽) ⊆ 𝑥𝑐𝑥))
2620, 25syl5bbr 274 . . . . . . . . 9 (((𝐽 ∈ Top ∧ 𝑥𝐽) ∧ 𝑐 ∈ (Clsd‘𝐽)) → ((𝑐 ∩ ( 𝐽𝑥)) = ∅ ↔ 𝑐𝑥))
27 inssdif0 3927 . . . . . . . . . . . 12 ((((cls‘𝐽)‘𝑜) ∩ 𝐽) ⊆ 𝑥 ↔ (((cls‘𝐽)‘𝑜) ∩ ( 𝐽𝑥)) = ∅)
28 simpll 789 . . . . . . . . . . . . . . 15 (((𝐽 ∈ Top ∧ 𝑥𝐽) ∧ 𝑐 ∈ (Clsd‘𝐽)) → 𝐽 ∈ Top)
29 elssuni 4440 . . . . . . . . . . . . . . 15 (𝑜𝐽𝑜 𝐽)
308clsss3 20803 . . . . . . . . . . . . . . 15 ((𝐽 ∈ Top ∧ 𝑜 𝐽) → ((cls‘𝐽)‘𝑜) ⊆ 𝐽)
3128, 29, 30syl2an 494 . . . . . . . . . . . . . 14 ((((𝐽 ∈ Top ∧ 𝑥𝐽) ∧ 𝑐 ∈ (Clsd‘𝐽)) ∧ 𝑜𝐽) → ((cls‘𝐽)‘𝑜) ⊆ 𝐽)
32 df-ss 3574 . . . . . . . . . . . . . 14 (((cls‘𝐽)‘𝑜) ⊆ 𝐽 ↔ (((cls‘𝐽)‘𝑜) ∩ 𝐽) = ((cls‘𝐽)‘𝑜))
3331, 32sylib 208 . . . . . . . . . . . . 13 ((((𝐽 ∈ Top ∧ 𝑥𝐽) ∧ 𝑐 ∈ (Clsd‘𝐽)) ∧ 𝑜𝐽) → (((cls‘𝐽)‘𝑜) ∩ 𝐽) = ((cls‘𝐽)‘𝑜))
3433sseq1d 3617 . . . . . . . . . . . 12 ((((𝐽 ∈ Top ∧ 𝑥𝐽) ∧ 𝑐 ∈ (Clsd‘𝐽)) ∧ 𝑜𝐽) → ((((cls‘𝐽)‘𝑜) ∩ 𝐽) ⊆ 𝑥 ↔ ((cls‘𝐽)‘𝑜) ⊆ 𝑥))
3527, 34syl5bbr 274 . . . . . . . . . . 11 ((((𝐽 ∈ Top ∧ 𝑥𝐽) ∧ 𝑐 ∈ (Clsd‘𝐽)) ∧ 𝑜𝐽) → ((((cls‘𝐽)‘𝑜) ∩ ( 𝐽𝑥)) = ∅ ↔ ((cls‘𝐽)‘𝑜) ⊆ 𝑥))
3635anbi2d 739 . . . . . . . . . 10 ((((𝐽 ∈ Top ∧ 𝑥𝐽) ∧ 𝑐 ∈ (Clsd‘𝐽)) ∧ 𝑜𝐽) → ((𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ ( 𝐽𝑥)) = ∅) ↔ (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥)))
3736rexbidva 3044 . . . . . . . . 9 (((𝐽 ∈ Top ∧ 𝑥𝐽) ∧ 𝑐 ∈ (Clsd‘𝐽)) → (∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ ( 𝐽𝑥)) = ∅) ↔ ∃𝑜𝐽 (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥)))
3826, 37imbi12d 334 . . . . . . . 8 (((𝐽 ∈ Top ∧ 𝑥𝐽) ∧ 𝑐 ∈ (Clsd‘𝐽)) → (((𝑐 ∩ ( 𝐽𝑥)) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ ( 𝐽𝑥)) = ∅)) ↔ (𝑐𝑥 → ∃𝑜𝐽 (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥))))
3919, 38sylibd 229 . . . . . . 7 (((𝐽 ∈ Top ∧ 𝑥𝐽) ∧ 𝑐 ∈ (Clsd‘𝐽)) → (∀𝑑 ∈ (Clsd‘𝐽)((𝑐𝑑) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅)) → (𝑐𝑥 → ∃𝑜𝐽 (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥))))
4039ralimdva 2958 . . . . . 6 ((𝐽 ∈ Top ∧ 𝑥𝐽) → (∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐𝑑) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅)) → ∀𝑐 ∈ (Clsd‘𝐽)(𝑐𝑥 → ∃𝑜𝐽 (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥))))
41 elin 3780 . . . . . . . . . 10 (𝑐 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥) ↔ (𝑐 ∈ (Clsd‘𝐽) ∧ 𝑐 ∈ 𝒫 𝑥))
42 selpw 4143 . . . . . . . . . . 11 (𝑐 ∈ 𝒫 𝑥𝑐𝑥)
4342anbi2i 729 . . . . . . . . . 10 ((𝑐 ∈ (Clsd‘𝐽) ∧ 𝑐 ∈ 𝒫 𝑥) ↔ (𝑐 ∈ (Clsd‘𝐽) ∧ 𝑐𝑥))
4441, 43bitri 264 . . . . . . . . 9 (𝑐 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥) ↔ (𝑐 ∈ (Clsd‘𝐽) ∧ 𝑐𝑥))
4544imbi1i 339 . . . . . . . 8 ((𝑐 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥) → ∃𝑜𝐽 (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥)) ↔ ((𝑐 ∈ (Clsd‘𝐽) ∧ 𝑐𝑥) → ∃𝑜𝐽 (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥)))
46 impexp 462 . . . . . . . 8 (((𝑐 ∈ (Clsd‘𝐽) ∧ 𝑐𝑥) → ∃𝑜𝐽 (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥)) ↔ (𝑐 ∈ (Clsd‘𝐽) → (𝑐𝑥 → ∃𝑜𝐽 (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥))))
4745, 46bitri 264 . . . . . . 7 ((𝑐 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥) → ∃𝑜𝐽 (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥)) ↔ (𝑐 ∈ (Clsd‘𝐽) → (𝑐𝑥 → ∃𝑜𝐽 (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥))))
4847ralbii2 2974 . . . . . 6 (∀𝑐 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥)∃𝑜𝐽 (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥) ↔ ∀𝑐 ∈ (Clsd‘𝐽)(𝑐𝑥 → ∃𝑜𝐽 (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥)))
4940, 48syl6ibr 242 . . . . 5 ((𝐽 ∈ Top ∧ 𝑥𝐽) → (∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐𝑑) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅)) → ∀𝑐 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥)∃𝑜𝐽 (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥)))
5049ralrimdva 2965 . . . 4 (𝐽 ∈ Top → (∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐𝑑) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅)) → ∀𝑥𝐽𝑐 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥)∃𝑜𝐽 (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥)))
5150imp 445 . . 3 ((𝐽 ∈ Top ∧ ∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐𝑑) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅))) → ∀𝑥𝐽𝑐 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥)∃𝑜𝐽 (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥))
52 isnrm 21079 . . 3 (𝐽 ∈ Nrm ↔ (𝐽 ∈ Top ∧ ∀𝑥𝐽𝑐 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥)∃𝑜𝐽 (𝑐𝑜 ∧ ((cls‘𝐽)‘𝑜) ⊆ 𝑥)))
537, 51, 52sylanbrc 697 . 2 ((𝐽 ∈ Top ∧ ∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐𝑑) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅))) → 𝐽 ∈ Nrm)
546, 53impbii 199 1 (𝐽 ∈ Nrm ↔ (𝐽 ∈ Top ∧ ∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐𝑑) = ∅ → ∃𝑜𝐽 (𝑐𝑜 ∧ (((cls‘𝐽)‘𝑜) ∩ 𝑑) = ∅))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384   = wceq 1480  wcel 1987  wral 2908  wrex 2909  cdif 3557  cin 3559  wss 3560  c0 3897  𝒫 cpw 4136   cuni 4409  cfv 5857  Topctop 20638  Clsdccld 20760  clsccl 20762  Nrmcnrm 21054
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-rep 4741  ax-sep 4751  ax-nul 4759  ax-pow 4813  ax-pr 4877  ax-un 6914
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2913  df-rex 2914  df-reu 2915  df-rab 2917  df-v 3192  df-sbc 3423  df-csb 3520  df-dif 3563  df-un 3565  df-in 3567  df-ss 3574  df-nul 3898  df-if 4065  df-pw 4138  df-sn 4156  df-pr 4158  df-op 4162  df-uni 4410  df-int 4448  df-iun 4494  df-iin 4495  df-br 4624  df-opab 4684  df-mpt 4685  df-id 4999  df-xp 5090  df-rel 5091  df-cnv 5092  df-co 5093  df-dm 5094  df-rn 5095  df-res 5096  df-ima 5097  df-iota 5820  df-fun 5859  df-fn 5860  df-f 5861  df-f1 5862  df-fo 5863  df-f1o 5864  df-fv 5865  df-top 20639  df-cld 20763  df-cls 20765  df-nrm 21061
This theorem is referenced by:  isnrm3  21103
  Copyright terms: Public domain W3C validator