MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  opnnei Structured version   Visualization version   GIF version
Theorem opnnei 22844
Description: A set is open iff it is a neighborhood of all of its points. (Contributed by Jeff Hankins, 15-Sep-2009.)
Assertion
Ref Expression
opnnei (𝐽 ∈ Top β†’ (𝑆 ∈ 𝐽 ↔ βˆ€π‘₯ ∈ 𝑆 𝑆 ∈ ((neiβ€˜π½)β€˜{π‘₯})))
Distinct variable groups:   π‘₯,𝐽   π‘₯,𝑆
Proof of Theorem opnnei
StepHypRef Expression
1 0opn 22626 . . . . 5 (𝐽 ∈ Top β†’ βˆ… ∈ 𝐽)
21adantr 481 . . . 4 ((𝐽 ∈ Top ∧ 𝑆 = βˆ…) β†’ βˆ… ∈ 𝐽)
3 eleq1 2821 . . . . 5 (𝑆 = βˆ… β†’ (𝑆 ∈ 𝐽 ↔ βˆ… ∈ 𝐽))
43adantl 482 . . . 4 ((𝐽 ∈ Top ∧ 𝑆 = βˆ…) β†’ (𝑆 ∈ 𝐽 ↔ βˆ… ∈ 𝐽))
52, 4mpbird 256 . . 3 ((𝐽 ∈ Top ∧ 𝑆 = βˆ…) β†’ 𝑆 ∈ 𝐽)
6 rzal 4508 . . . 4 (𝑆 = βˆ… β†’ βˆ€π‘₯ ∈ 𝑆 𝑆 ∈ ((neiβ€˜π½)β€˜{π‘₯}))
76adantl 482 . . 3 ((𝐽 ∈ Top ∧ 𝑆 = βˆ…) β†’ βˆ€π‘₯ ∈ 𝑆 𝑆 ∈ ((neiβ€˜π½)β€˜{π‘₯}))
85, 72thd 264 . 2 ((𝐽 ∈ Top ∧ 𝑆 = βˆ…) β†’ (𝑆 ∈ 𝐽 ↔ βˆ€π‘₯ ∈ 𝑆 𝑆 ∈ ((neiβ€˜π½)β€˜{π‘₯})))
9 opnneip 22843 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝑆 ∈ 𝐽 ∧ π‘₯ ∈ 𝑆) β†’ 𝑆 ∈ ((neiβ€˜π½)β€˜{π‘₯}))
1093expia 1121 . . . . . 6 ((𝐽 ∈ Top ∧ 𝑆 ∈ 𝐽) β†’ (π‘₯ ∈ 𝑆 β†’ 𝑆 ∈ ((neiβ€˜π½)β€˜{π‘₯})))
1110ralrimiv 3145 . . . . 5 ((𝐽 ∈ Top ∧ 𝑆 ∈ 𝐽) β†’ βˆ€π‘₯ ∈ 𝑆 𝑆 ∈ ((neiβ€˜π½)β€˜{π‘₯}))
1211ex 413 . . . 4 (𝐽 ∈ Top β†’ (𝑆 ∈ 𝐽 β†’ βˆ€π‘₯ ∈ 𝑆 𝑆 ∈ ((neiβ€˜π½)β€˜{π‘₯})))
1312adantr 481 . . 3 ((𝐽 ∈ Top ∧ Β¬ 𝑆 = βˆ…) β†’ (𝑆 ∈ 𝐽 β†’ βˆ€π‘₯ ∈ 𝑆 𝑆 ∈ ((neiβ€˜π½)β€˜{π‘₯})))
14 df-ne 2941 . . . . . 6 (𝑆 β‰  βˆ… ↔ Β¬ 𝑆 = βˆ…)
15 r19.2z 4494 . . . . . . 7 ((𝑆 β‰  βˆ… ∧ βˆ€π‘₯ ∈ 𝑆 𝑆 ∈ ((neiβ€˜π½)β€˜{π‘₯})) β†’ βˆƒπ‘₯ ∈ 𝑆 𝑆 ∈ ((neiβ€˜π½)β€˜{π‘₯}))
1615ex 413 . . . . . 6 (𝑆 β‰  βˆ… β†’ (βˆ€π‘₯ ∈ 𝑆 𝑆 ∈ ((neiβ€˜π½)β€˜{π‘₯}) β†’ βˆƒπ‘₯ ∈ 𝑆 𝑆 ∈ ((neiβ€˜π½)β€˜{π‘₯})))
1714, 16sylbir 234 . . . . 5 (Β¬ 𝑆 = βˆ… β†’ (βˆ€π‘₯ ∈ 𝑆 𝑆 ∈ ((neiβ€˜π½)β€˜{π‘₯}) β†’ βˆƒπ‘₯ ∈ 𝑆 𝑆 ∈ ((neiβ€˜π½)β€˜{π‘₯})))
18 eqid 2732 . . . . . . . 8 βˆͺ 𝐽 = βˆͺ 𝐽
1918neii1 22830 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝑆 ∈ ((neiβ€˜π½)β€˜{π‘₯})) β†’ 𝑆 βŠ† βˆͺ 𝐽)
2019ex 413 . . . . . 6 (𝐽 ∈ Top β†’ (𝑆 ∈ ((neiβ€˜π½)β€˜{π‘₯}) β†’ 𝑆 βŠ† βˆͺ 𝐽))
2120rexlimdvw 3160 . . . . 5 (𝐽 ∈ Top β†’ (βˆƒπ‘₯ ∈ 𝑆 𝑆 ∈ ((neiβ€˜π½)β€˜{π‘₯}) β†’ 𝑆 βŠ† βˆͺ 𝐽))
2217, 21sylan9r 509 . . . 4 ((𝐽 ∈ Top ∧ Β¬ 𝑆 = βˆ…) β†’ (βˆ€π‘₯ ∈ 𝑆 𝑆 ∈ ((neiβ€˜π½)β€˜{π‘₯}) β†’ 𝑆 βŠ† βˆͺ 𝐽))
2318ntrss2 22781 . . . . . . . . . . 11 ((𝐽 ∈ Top ∧ 𝑆 βŠ† βˆͺ 𝐽) β†’ ((intβ€˜π½)β€˜π‘†) βŠ† 𝑆)
2423adantr 481 . . . . . . . . . 10 (((𝐽 ∈ Top ∧ 𝑆 βŠ† βˆͺ 𝐽) ∧ βˆ€π‘₯ ∈ 𝑆 {π‘₯} βŠ† ((intβ€˜π½)β€˜π‘†)) β†’ ((intβ€˜π½)β€˜π‘†) βŠ† 𝑆)
25 vex 3478 . . . . . . . . . . . . 13 π‘₯ ∈ V
2625snss 4789 . . . . . . . . . . . 12 (π‘₯ ∈ ((intβ€˜π½)β€˜π‘†) ↔ {π‘₯} βŠ† ((intβ€˜π½)β€˜π‘†))
2726ralbii 3093 . . . . . . . . . . 11 (βˆ€π‘₯ ∈ 𝑆 π‘₯ ∈ ((intβ€˜π½)β€˜π‘†) ↔ βˆ€π‘₯ ∈ 𝑆 {π‘₯} βŠ† ((intβ€˜π½)β€˜π‘†))
28 dfss3 3970 . . . . . . . . . . . . 13 (𝑆 βŠ† ((intβ€˜π½)β€˜π‘†) ↔ βˆ€π‘₯ ∈ 𝑆 π‘₯ ∈ ((intβ€˜π½)β€˜π‘†))
2928biimpri 227 . . . . . . . . . . . 12 (βˆ€π‘₯ ∈ 𝑆 π‘₯ ∈ ((intβ€˜π½)β€˜π‘†) β†’ 𝑆 βŠ† ((intβ€˜π½)β€˜π‘†))
3029adantl 482 . . . . . . . . . . 11 (((𝐽 ∈ Top ∧ 𝑆 βŠ† βˆͺ 𝐽) ∧ βˆ€π‘₯ ∈ 𝑆 π‘₯ ∈ ((intβ€˜π½)β€˜π‘†)) β†’ 𝑆 βŠ† ((intβ€˜π½)β€˜π‘†))
3127, 30sylan2br 595 . . . . . . . . . 10 (((𝐽 ∈ Top ∧ 𝑆 βŠ† βˆͺ 𝐽) ∧ βˆ€π‘₯ ∈ 𝑆 {π‘₯} βŠ† ((intβ€˜π½)β€˜π‘†)) β†’ 𝑆 βŠ† ((intβ€˜π½)β€˜π‘†))
3224, 31eqssd 3999 . . . . . . . . 9 (((𝐽 ∈ Top ∧ 𝑆 βŠ† βˆͺ 𝐽) ∧ βˆ€π‘₯ ∈ 𝑆 {π‘₯} βŠ† ((intβ€˜π½)β€˜π‘†)) β†’ ((intβ€˜π½)β€˜π‘†) = 𝑆)
3332ex 413 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝑆 βŠ† βˆͺ 𝐽) β†’ (βˆ€π‘₯ ∈ 𝑆 {π‘₯} βŠ† ((intβ€˜π½)β€˜π‘†) β†’ ((intβ€˜π½)β€˜π‘†) = 𝑆))
3425snss 4789 . . . . . . . . . . . 12 (π‘₯ ∈ 𝑆 ↔ {π‘₯} βŠ† 𝑆)
35 sstr2 3989 . . . . . . . . . . . . . 14 ({π‘₯} βŠ† 𝑆 β†’ (𝑆 βŠ† βˆͺ 𝐽 β†’ {π‘₯} βŠ† βˆͺ 𝐽))
3635com12 32 . . . . . . . . . . . . 13 (𝑆 βŠ† βˆͺ 𝐽 β†’ ({π‘₯} βŠ† 𝑆 β†’ {π‘₯} βŠ† βˆͺ 𝐽))
3736adantl 482 . . . . . . . . . . . 12 ((𝐽 ∈ Top ∧ 𝑆 βŠ† βˆͺ 𝐽) β†’ ({π‘₯} βŠ† 𝑆 β†’ {π‘₯} βŠ† βˆͺ 𝐽))
3834, 37biimtrid 241 . . . . . . . . . . 11 ((𝐽 ∈ Top ∧ 𝑆 βŠ† βˆͺ 𝐽) β†’ (π‘₯ ∈ 𝑆 β†’ {π‘₯} βŠ† βˆͺ 𝐽))
3938imp 407 . . . . . . . . . 10 (((𝐽 ∈ Top ∧ 𝑆 βŠ† βˆͺ 𝐽) ∧ π‘₯ ∈ 𝑆) β†’ {π‘₯} βŠ† βˆͺ 𝐽)
4018neiint 22828 . . . . . . . . . . . 12 ((𝐽 ∈ Top ∧ {π‘₯} βŠ† βˆͺ 𝐽 ∧ 𝑆 βŠ† βˆͺ 𝐽) β†’ (𝑆 ∈ ((neiβ€˜π½)β€˜{π‘₯}) ↔ {π‘₯} βŠ† ((intβ€˜π½)β€˜π‘†)))
41403com23 1126 . . . . . . . . . . 11 ((𝐽 ∈ Top ∧ 𝑆 βŠ† βˆͺ 𝐽 ∧ {π‘₯} βŠ† βˆͺ 𝐽) β†’ (𝑆 ∈ ((neiβ€˜π½)β€˜{π‘₯}) ↔ {π‘₯} βŠ† ((intβ€˜π½)β€˜π‘†)))
42413expa 1118 . . . . . . . . . 10 (((𝐽 ∈ Top ∧ 𝑆 βŠ† βˆͺ 𝐽) ∧ {π‘₯} βŠ† βˆͺ 𝐽) β†’ (𝑆 ∈ ((neiβ€˜π½)β€˜{π‘₯}) ↔ {π‘₯} βŠ† ((intβ€˜π½)β€˜π‘†)))
4339, 42syldan 591 . . . . . . . . 9 (((𝐽 ∈ Top ∧ 𝑆 βŠ† βˆͺ 𝐽) ∧ π‘₯ ∈ 𝑆) β†’ (𝑆 ∈ ((neiβ€˜π½)β€˜{π‘₯}) ↔ {π‘₯} βŠ† ((intβ€˜π½)β€˜π‘†)))
4443ralbidva 3175 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝑆 βŠ† βˆͺ 𝐽) β†’ (βˆ€π‘₯ ∈ 𝑆 𝑆 ∈ ((neiβ€˜π½)β€˜{π‘₯}) ↔ βˆ€π‘₯ ∈ 𝑆 {π‘₯} βŠ† ((intβ€˜π½)β€˜π‘†)))
4518isopn3 22790 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝑆 βŠ† βˆͺ 𝐽) β†’ (𝑆 ∈ 𝐽 ↔ ((intβ€˜π½)β€˜π‘†) = 𝑆))
4633, 44, 453imtr4d 293 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝑆 βŠ† βˆͺ 𝐽) β†’ (βˆ€π‘₯ ∈ 𝑆 𝑆 ∈ ((neiβ€˜π½)β€˜{π‘₯}) β†’ 𝑆 ∈ 𝐽))
4746ex 413 . . . . . 6 (𝐽 ∈ Top β†’ (𝑆 βŠ† βˆͺ 𝐽 β†’ (βˆ€π‘₯ ∈ 𝑆 𝑆 ∈ ((neiβ€˜π½)β€˜{π‘₯}) β†’ 𝑆 ∈ 𝐽)))
4847com23 86 . . . . 5 (𝐽 ∈ Top β†’ (βˆ€π‘₯ ∈ 𝑆 𝑆 ∈ ((neiβ€˜π½)β€˜{π‘₯}) β†’ (𝑆 βŠ† βˆͺ 𝐽 β†’ 𝑆 ∈ 𝐽)))
4948adantr 481 . . . 4 ((𝐽 ∈ Top ∧ Β¬ 𝑆 = βˆ…) β†’ (βˆ€π‘₯ ∈ 𝑆 𝑆 ∈ ((neiβ€˜π½)β€˜{π‘₯}) β†’ (𝑆 βŠ† βˆͺ 𝐽 β†’ 𝑆 ∈ 𝐽)))
5022, 49mpdd 43 . . 3 ((𝐽 ∈ Top ∧ Β¬ 𝑆 = βˆ…) β†’ (βˆ€π‘₯ ∈ 𝑆 𝑆 ∈ ((neiβ€˜π½)β€˜{π‘₯}) β†’ 𝑆 ∈ 𝐽))
5113, 50impbid 211 . 2 ((𝐽 ∈ Top ∧ Β¬ 𝑆 = βˆ…) β†’ (𝑆 ∈ 𝐽 ↔ βˆ€π‘₯ ∈ 𝑆 𝑆 ∈ ((neiβ€˜π½)β€˜{π‘₯})))
528, 51pm2.61dan 811 1 (𝐽 ∈ Top β†’ (𝑆 ∈ 𝐽 ↔ βˆ€π‘₯ ∈ 𝑆 𝑆 ∈ ((neiβ€˜π½)β€˜{π‘₯})))
Colors of variables: wff setvar class
Syntax hints:  Β¬ wn 3   β†’ wi 4   ↔ wb 205   ∧ wa 396   = wceq 1541   ∈ wcel 2106   β‰  wne 2940  βˆ€wral 3061  βˆƒwrex 3070   βŠ† wss 3948  βˆ…c0 4322  {csn 4628  βˆͺ cuni 4908  β€˜cfv 6543  Topctop 22615  intcnt 22741  neicnei 22821
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-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-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-iun 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5574  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-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-top 22616  df-ntr 22744  df-nei 22822
This theorem is referenced by:  neiptopreu  22857  flimcf  23706
  Copyright terms: Public domain W3C validator