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

Theorem neiint 20718
Description: An intuitive definition of a neighborhood in terms of interior. (Contributed by Szymon Jaroszewicz, 18-Dec-2007.) (Revised by Mario Carneiro, 11-Nov-2013.)
Hypothesis
Ref Expression
neifval.1 𝑋 = 𝐽
Assertion
Ref Expression
neiint ((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) → (𝑁 ∈ ((nei‘𝐽)‘𝑆) ↔ 𝑆 ⊆ ((int‘𝐽)‘𝑁)))

Proof of Theorem neiint
Dummy variable 𝑣 is distinct from all other variables.
StepHypRef Expression
1 neifval.1 . . . . 5 𝑋 = 𝐽
21isnei 20717 . . . 4 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (𝑁 ∈ ((nei‘𝐽)‘𝑆) ↔ (𝑁𝑋 ∧ ∃𝑣𝐽 (𝑆𝑣𝑣𝑁))))
323adant3 1074 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) → (𝑁 ∈ ((nei‘𝐽)‘𝑆) ↔ (𝑁𝑋 ∧ ∃𝑣𝐽 (𝑆𝑣𝑣𝑁))))
433anibar 1222 . 2 ((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) → (𝑁 ∈ ((nei‘𝐽)‘𝑆) ↔ ∃𝑣𝐽 (𝑆𝑣𝑣𝑁)))
5 simprrl 800 . . . . 5 (((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) ∧ (𝑣𝐽 ∧ (𝑆𝑣𝑣𝑁))) → 𝑆𝑣)
61ssntr 20672 . . . . . . 7 (((𝐽 ∈ Top ∧ 𝑁𝑋) ∧ (𝑣𝐽𝑣𝑁)) → 𝑣 ⊆ ((int‘𝐽)‘𝑁))
763adantl2 1211 . . . . . 6 (((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) ∧ (𝑣𝐽𝑣𝑁)) → 𝑣 ⊆ ((int‘𝐽)‘𝑁))
87adantrrl 756 . . . . 5 (((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) ∧ (𝑣𝐽 ∧ (𝑆𝑣𝑣𝑁))) → 𝑣 ⊆ ((int‘𝐽)‘𝑁))
95, 8sstrd 3578 . . . 4 (((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) ∧ (𝑣𝐽 ∧ (𝑆𝑣𝑣𝑁))) → 𝑆 ⊆ ((int‘𝐽)‘𝑁))
109rexlimdvaa 3014 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) → (∃𝑣𝐽 (𝑆𝑣𝑣𝑁) → 𝑆 ⊆ ((int‘𝐽)‘𝑁)))
11 simpl1 1057 . . . . . 6 (((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) ∧ 𝑆 ⊆ ((int‘𝐽)‘𝑁)) → 𝐽 ∈ Top)
12 simpl3 1059 . . . . . 6 (((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) ∧ 𝑆 ⊆ ((int‘𝐽)‘𝑁)) → 𝑁𝑋)
131ntropn 20663 . . . . . 6 ((𝐽 ∈ Top ∧ 𝑁𝑋) → ((int‘𝐽)‘𝑁) ∈ 𝐽)
1411, 12, 13syl2anc 691 . . . . 5 (((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) ∧ 𝑆 ⊆ ((int‘𝐽)‘𝑁)) → ((int‘𝐽)‘𝑁) ∈ 𝐽)
15 simpr 476 . . . . 5 (((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) ∧ 𝑆 ⊆ ((int‘𝐽)‘𝑁)) → 𝑆 ⊆ ((int‘𝐽)‘𝑁))
161ntrss2 20671 . . . . . 6 ((𝐽 ∈ Top ∧ 𝑁𝑋) → ((int‘𝐽)‘𝑁) ⊆ 𝑁)
1711, 12, 16syl2anc 691 . . . . 5 (((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) ∧ 𝑆 ⊆ ((int‘𝐽)‘𝑁)) → ((int‘𝐽)‘𝑁) ⊆ 𝑁)
18 sseq2 3590 . . . . . . 7 (𝑣 = ((int‘𝐽)‘𝑁) → (𝑆𝑣𝑆 ⊆ ((int‘𝐽)‘𝑁)))
19 sseq1 3589 . . . . . . 7 (𝑣 = ((int‘𝐽)‘𝑁) → (𝑣𝑁 ↔ ((int‘𝐽)‘𝑁) ⊆ 𝑁))
2018, 19anbi12d 743 . . . . . 6 (𝑣 = ((int‘𝐽)‘𝑁) → ((𝑆𝑣𝑣𝑁) ↔ (𝑆 ⊆ ((int‘𝐽)‘𝑁) ∧ ((int‘𝐽)‘𝑁) ⊆ 𝑁)))
2120rspcev 3282 . . . . 5 ((((int‘𝐽)‘𝑁) ∈ 𝐽 ∧ (𝑆 ⊆ ((int‘𝐽)‘𝑁) ∧ ((int‘𝐽)‘𝑁) ⊆ 𝑁)) → ∃𝑣𝐽 (𝑆𝑣𝑣𝑁))
2214, 15, 17, 21syl12anc 1316 . . . 4 (((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) ∧ 𝑆 ⊆ ((int‘𝐽)‘𝑁)) → ∃𝑣𝐽 (𝑆𝑣𝑣𝑁))
2322ex 449 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) → (𝑆 ⊆ ((int‘𝐽)‘𝑁) → ∃𝑣𝐽 (𝑆𝑣𝑣𝑁)))
2410, 23impbid 201 . 2 ((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) → (∃𝑣𝐽 (𝑆𝑣𝑣𝑁) ↔ 𝑆 ⊆ ((int‘𝐽)‘𝑁)))
254, 24bitrd 267 1 ((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) → (𝑁 ∈ ((nei‘𝐽)‘𝑆) ↔ 𝑆 ⊆ ((int‘𝐽)‘𝑁)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 195  wa 383  w3a 1031   = wceq 1475  wcel 1977  wrex 2897  wss 3540   cuni 4372  cfv 5804  Topctop 20517  intcnt 20631  neicnei 20711
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-top 20521  df-ntr 20634  df-nei 20712
This theorem is referenced by:  opnnei  20734  topssnei  20738  iscnp4  20877  llycmpkgen2  21163  flimopn  21589  fclsneii  21631  fcfnei  21649  limcflf  23451  neiin  31497
  Copyright terms: Public domain W3C validator