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

Theorem neiint 22998
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 22997 . . . 4 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (𝑁 ∈ ((nei‘𝐽)‘𝑆) ↔ (𝑁𝑋 ∧ ∃𝑣𝐽 (𝑆𝑣𝑣𝑁))))
323adant3 1132 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) → (𝑁 ∈ ((nei‘𝐽)‘𝑆) ↔ (𝑁𝑋 ∧ ∃𝑣𝐽 (𝑆𝑣𝑣𝑁))))
433anibar 1330 . 2 ((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) → (𝑁 ∈ ((nei‘𝐽)‘𝑆) ↔ ∃𝑣𝐽 (𝑆𝑣𝑣𝑁)))
5 simprrl 780 . . . . 5 (((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) ∧ (𝑣𝐽 ∧ (𝑆𝑣𝑣𝑁))) → 𝑆𝑣)
61ssntr 22952 . . . . . . 7 (((𝐽 ∈ Top ∧ 𝑁𝑋) ∧ (𝑣𝐽𝑣𝑁)) → 𝑣 ⊆ ((int‘𝐽)‘𝑁))
763adantl2 1168 . . . . . 6 (((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) ∧ (𝑣𝐽𝑣𝑁)) → 𝑣 ⊆ ((int‘𝐽)‘𝑁))
87adantrrl 724 . . . . 5 (((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) ∧ (𝑣𝐽 ∧ (𝑆𝑣𝑣𝑁))) → 𝑣 ⊆ ((int‘𝐽)‘𝑁))
95, 8sstrd 3960 . . . 4 (((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) ∧ (𝑣𝐽 ∧ (𝑆𝑣𝑣𝑁))) → 𝑆 ⊆ ((int‘𝐽)‘𝑁))
109rexlimdvaa 3136 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) → (∃𝑣𝐽 (𝑆𝑣𝑣𝑁) → 𝑆 ⊆ ((int‘𝐽)‘𝑁)))
11 simpl1 1192 . . . . . 6 (((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) ∧ 𝑆 ⊆ ((int‘𝐽)‘𝑁)) → 𝐽 ∈ Top)
12 simpl3 1194 . . . . . 6 (((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) ∧ 𝑆 ⊆ ((int‘𝐽)‘𝑁)) → 𝑁𝑋)
131ntropn 22943 . . . . . 6 ((𝐽 ∈ Top ∧ 𝑁𝑋) → ((int‘𝐽)‘𝑁) ∈ 𝐽)
1411, 12, 13syl2anc 584 . . . . 5 (((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) ∧ 𝑆 ⊆ ((int‘𝐽)‘𝑁)) → ((int‘𝐽)‘𝑁) ∈ 𝐽)
15 simpr 484 . . . . 5 (((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) ∧ 𝑆 ⊆ ((int‘𝐽)‘𝑁)) → 𝑆 ⊆ ((int‘𝐽)‘𝑁))
161ntrss2 22951 . . . . . 6 ((𝐽 ∈ Top ∧ 𝑁𝑋) → ((int‘𝐽)‘𝑁) ⊆ 𝑁)
1711, 12, 16syl2anc 584 . . . . 5 (((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) ∧ 𝑆 ⊆ ((int‘𝐽)‘𝑁)) → ((int‘𝐽)‘𝑁) ⊆ 𝑁)
18 sseq2 3976 . . . . . . 7 (𝑣 = ((int‘𝐽)‘𝑁) → (𝑆𝑣𝑆 ⊆ ((int‘𝐽)‘𝑁)))
19 sseq1 3975 . . . . . . 7 (𝑣 = ((int‘𝐽)‘𝑁) → (𝑣𝑁 ↔ ((int‘𝐽)‘𝑁) ⊆ 𝑁))
2018, 19anbi12d 632 . . . . . 6 (𝑣 = ((int‘𝐽)‘𝑁) → ((𝑆𝑣𝑣𝑁) ↔ (𝑆 ⊆ ((int‘𝐽)‘𝑁) ∧ ((int‘𝐽)‘𝑁) ⊆ 𝑁)))
2120rspcev 3591 . . . . 5 ((((int‘𝐽)‘𝑁) ∈ 𝐽 ∧ (𝑆 ⊆ ((int‘𝐽)‘𝑁) ∧ ((int‘𝐽)‘𝑁) ⊆ 𝑁)) → ∃𝑣𝐽 (𝑆𝑣𝑣𝑁))
2214, 15, 17, 21syl12anc 836 . . . 4 (((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) ∧ 𝑆 ⊆ ((int‘𝐽)‘𝑁)) → ∃𝑣𝐽 (𝑆𝑣𝑣𝑁))
2322ex 412 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) → (𝑆 ⊆ ((int‘𝐽)‘𝑁) → ∃𝑣𝐽 (𝑆𝑣𝑣𝑁)))
2410, 23impbid 212 . 2 ((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) → (∃𝑣𝐽 (𝑆𝑣𝑣𝑁) ↔ 𝑆 ⊆ ((int‘𝐽)‘𝑁)))
254, 24bitrd 279 1 ((𝐽 ∈ Top ∧ 𝑆𝑋𝑁𝑋) → (𝑁 ∈ ((nei‘𝐽)‘𝑆) ↔ 𝑆 ⊆ ((int‘𝐽)‘𝑁)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1540  wcel 2109  wrex 3054  wss 3917   cuni 4874  cfv 6514  Topctop 22787  intcnt 22911  neicnei 22991
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5237  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-top 22788  df-ntr 22914  df-nei 22992
This theorem is referenced by:  opnnei  23014  topssnei  23018  iscnp4  23157  llycmpkgen2  23444  flimopn  23869  fclsneii  23911  fcfnei  23929  limcflf  25789  neiin  36327  cnneiima  48909
  Copyright terms: Public domain W3C validator