Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ntrneik3 Structured version   Visualization version   GIF version

Theorem ntrneik3 39956
Description: The intersection of interiors of any pair is a subset of the interior of the intersection if and only if the intersection of any two neighborhoods of a point is also a neighborhood. (Contributed by RP, 19-Jun-2021.)
Hypotheses
Ref Expression
ntrnei.o 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗𝑚 𝑖) ↦ (𝑙𝑗 ↦ {𝑚𝑖𝑙 ∈ (𝑘𝑚)})))
ntrnei.f 𝐹 = (𝒫 𝐵𝑂𝐵)
ntrnei.r (𝜑𝐼𝐹𝑁)
Assertion
Ref Expression
ntrneik3 (𝜑 → (∀𝑠 ∈ 𝒫 𝐵𝑡 ∈ 𝒫 𝐵((𝐼𝑠) ∩ (𝐼𝑡)) ⊆ (𝐼‘(𝑠𝑡)) ↔ ∀𝑥𝐵𝑠 ∈ 𝒫 𝐵𝑡 ∈ 𝒫 𝐵((𝑠 ∈ (𝑁𝑥) ∧ 𝑡 ∈ (𝑁𝑥)) → (𝑠𝑡) ∈ (𝑁𝑥))))
Distinct variable groups:   𝐵,𝑖,𝑗,𝑘,𝑙,𝑚,𝑠,𝑡,𝑥   𝑘,𝐼,𝑙,𝑚,𝑥   𝜑,𝑖,𝑗,𝑘,𝑙,𝑠,𝑡,𝑥
Allowed substitution hints:   𝜑(𝑚)   𝐹(𝑥,𝑡,𝑖,𝑗,𝑘,𝑚,𝑠,𝑙)   𝐼(𝑡,𝑖,𝑗,𝑠)   𝑁(𝑥,𝑡,𝑖,𝑗,𝑘,𝑚,𝑠,𝑙)   𝑂(𝑥,𝑡,𝑖,𝑗,𝑘,𝑚,𝑠,𝑙)

Proof of Theorem ntrneik3
StepHypRef Expression
1 dfss3 3882 . . . . . 6 (((𝐼𝑠) ∩ (𝐼𝑡)) ⊆ (𝐼‘(𝑠𝑡)) ↔ ∀𝑥 ∈ ((𝐼𝑠) ∩ (𝐼𝑡))𝑥 ∈ (𝐼‘(𝑠𝑡)))
2 ntrnei.o . . . . . . . . . . . . . 14 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗𝑚 𝑖) ↦ (𝑙𝑗 ↦ {𝑚𝑖𝑙 ∈ (𝑘𝑚)})))
3 ntrnei.f . . . . . . . . . . . . . 14 𝐹 = (𝒫 𝐵𝑂𝐵)
4 ntrnei.r . . . . . . . . . . . . . 14 (𝜑𝐼𝐹𝑁)
52, 3, 4ntrneiiex 39936 . . . . . . . . . . . . 13 (𝜑𝐼 ∈ (𝒫 𝐵𝑚 𝒫 𝐵))
6 elmapi 8283 . . . . . . . . . . . . 13 (𝐼 ∈ (𝒫 𝐵𝑚 𝒫 𝐵) → 𝐼:𝒫 𝐵⟶𝒫 𝐵)
75, 6syl 17 . . . . . . . . . . . 12 (𝜑𝐼:𝒫 𝐵⟶𝒫 𝐵)
87ffvelrnda 6721 . . . . . . . . . . 11 ((𝜑𝑠 ∈ 𝒫 𝐵) → (𝐼𝑠) ∈ 𝒫 𝐵)
98elpwid 4469 . . . . . . . . . 10 ((𝜑𝑠 ∈ 𝒫 𝐵) → (𝐼𝑠) ⊆ 𝐵)
10 ssinss1 4138 . . . . . . . . . 10 ((𝐼𝑠) ⊆ 𝐵 → ((𝐼𝑠) ∩ (𝐼𝑡)) ⊆ 𝐵)
119, 10syl 17 . . . . . . . . 9 ((𝜑𝑠 ∈ 𝒫 𝐵) → ((𝐼𝑠) ∩ (𝐼𝑡)) ⊆ 𝐵)
1211adantr 481 . . . . . . . 8 (((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → ((𝐼𝑠) ∩ (𝐼𝑡)) ⊆ 𝐵)
13 ralss 3962 . . . . . . . 8 (((𝐼𝑠) ∩ (𝐼𝑡)) ⊆ 𝐵 → (∀𝑥 ∈ ((𝐼𝑠) ∩ (𝐼𝑡))𝑥 ∈ (𝐼‘(𝑠𝑡)) ↔ ∀𝑥𝐵 (𝑥 ∈ ((𝐼𝑠) ∩ (𝐼𝑡)) → 𝑥 ∈ (𝐼‘(𝑠𝑡)))))
1412, 13syl 17 . . . . . . 7 (((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (∀𝑥 ∈ ((𝐼𝑠) ∩ (𝐼𝑡))𝑥 ∈ (𝐼‘(𝑠𝑡)) ↔ ∀𝑥𝐵 (𝑥 ∈ ((𝐼𝑠) ∩ (𝐼𝑡)) → 𝑥 ∈ (𝐼‘(𝑠𝑡)))))
15 elin 4094 . . . . . . . . . 10 (𝑥 ∈ ((𝐼𝑠) ∩ (𝐼𝑡)) ↔ (𝑥 ∈ (𝐼𝑠) ∧ 𝑥 ∈ (𝐼𝑡)))
164ad3antrrr 726 . . . . . . . . . . . 12 ((((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥𝐵) → 𝐼𝐹𝑁)
17 simpr 485 . . . . . . . . . . . 12 ((((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥𝐵) → 𝑥𝐵)
18 simpllr 772 . . . . . . . . . . . 12 ((((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥𝐵) → 𝑠 ∈ 𝒫 𝐵)
192, 3, 16, 17, 18ntrneiel 39941 . . . . . . . . . . 11 ((((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥𝐵) → (𝑥 ∈ (𝐼𝑠) ↔ 𝑠 ∈ (𝑁𝑥)))
20 simplr 765 . . . . . . . . . . . 12 ((((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥𝐵) → 𝑡 ∈ 𝒫 𝐵)
212, 3, 16, 17, 20ntrneiel 39941 . . . . . . . . . . 11 ((((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥𝐵) → (𝑥 ∈ (𝐼𝑡) ↔ 𝑡 ∈ (𝑁𝑥)))
2219, 21anbi12d 630 . . . . . . . . . 10 ((((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥𝐵) → ((𝑥 ∈ (𝐼𝑠) ∧ 𝑥 ∈ (𝐼𝑡)) ↔ (𝑠 ∈ (𝑁𝑥) ∧ 𝑡 ∈ (𝑁𝑥))))
2315, 22syl5bb 284 . . . . . . . . 9 ((((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥𝐵) → (𝑥 ∈ ((𝐼𝑠) ∩ (𝐼𝑡)) ↔ (𝑠 ∈ (𝑁𝑥) ∧ 𝑡 ∈ (𝑁𝑥))))
242, 3, 4ntrneibex 39933 . . . . . . . . . . . 12 (𝜑𝐵 ∈ V)
2524ad3antrrr 726 . . . . . . . . . . 11 ((((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥𝐵) → 𝐵 ∈ V)
2618elpwid 4469 . . . . . . . . . . . 12 ((((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥𝐵) → 𝑠𝐵)
27 ssinss1 4138 . . . . . . . . . . . 12 (𝑠𝐵 → (𝑠𝑡) ⊆ 𝐵)
2826, 27syl 17 . . . . . . . . . . 11 ((((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥𝐵) → (𝑠𝑡) ⊆ 𝐵)
2925, 28sselpwd 5126 . . . . . . . . . 10 ((((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥𝐵) → (𝑠𝑡) ∈ 𝒫 𝐵)
302, 3, 16, 17, 29ntrneiel 39941 . . . . . . . . 9 ((((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥𝐵) → (𝑥 ∈ (𝐼‘(𝑠𝑡)) ↔ (𝑠𝑡) ∈ (𝑁𝑥)))
3123, 30imbi12d 346 . . . . . . . 8 ((((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥𝐵) → ((𝑥 ∈ ((𝐼𝑠) ∩ (𝐼𝑡)) → 𝑥 ∈ (𝐼‘(𝑠𝑡))) ↔ ((𝑠 ∈ (𝑁𝑥) ∧ 𝑡 ∈ (𝑁𝑥)) → (𝑠𝑡) ∈ (𝑁𝑥))))
3231ralbidva 3163 . . . . . . 7 (((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (∀𝑥𝐵 (𝑥 ∈ ((𝐼𝑠) ∩ (𝐼𝑡)) → 𝑥 ∈ (𝐼‘(𝑠𝑡))) ↔ ∀𝑥𝐵 ((𝑠 ∈ (𝑁𝑥) ∧ 𝑡 ∈ (𝑁𝑥)) → (𝑠𝑡) ∈ (𝑁𝑥))))
3314, 32bitrd 280 . . . . . 6 (((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (∀𝑥 ∈ ((𝐼𝑠) ∩ (𝐼𝑡))𝑥 ∈ (𝐼‘(𝑠𝑡)) ↔ ∀𝑥𝐵 ((𝑠 ∈ (𝑁𝑥) ∧ 𝑡 ∈ (𝑁𝑥)) → (𝑠𝑡) ∈ (𝑁𝑥))))
341, 33syl5bb 284 . . . . 5 (((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (((𝐼𝑠) ∩ (𝐼𝑡)) ⊆ (𝐼‘(𝑠𝑡)) ↔ ∀𝑥𝐵 ((𝑠 ∈ (𝑁𝑥) ∧ 𝑡 ∈ (𝑁𝑥)) → (𝑠𝑡) ∈ (𝑁𝑥))))
3534ralbidva 3163 . . . 4 ((𝜑𝑠 ∈ 𝒫 𝐵) → (∀𝑡 ∈ 𝒫 𝐵((𝐼𝑠) ∩ (𝐼𝑡)) ⊆ (𝐼‘(𝑠𝑡)) ↔ ∀𝑡 ∈ 𝒫 𝐵𝑥𝐵 ((𝑠 ∈ (𝑁𝑥) ∧ 𝑡 ∈ (𝑁𝑥)) → (𝑠𝑡) ∈ (𝑁𝑥))))
36 ralcom 3315 . . . 4 (∀𝑡 ∈ 𝒫 𝐵𝑥𝐵 ((𝑠 ∈ (𝑁𝑥) ∧ 𝑡 ∈ (𝑁𝑥)) → (𝑠𝑡) ∈ (𝑁𝑥)) ↔ ∀𝑥𝐵𝑡 ∈ 𝒫 𝐵((𝑠 ∈ (𝑁𝑥) ∧ 𝑡 ∈ (𝑁𝑥)) → (𝑠𝑡) ∈ (𝑁𝑥)))
3735, 36syl6bb 288 . . 3 ((𝜑𝑠 ∈ 𝒫 𝐵) → (∀𝑡 ∈ 𝒫 𝐵((𝐼𝑠) ∩ (𝐼𝑡)) ⊆ (𝐼‘(𝑠𝑡)) ↔ ∀𝑥𝐵𝑡 ∈ 𝒫 𝐵((𝑠 ∈ (𝑁𝑥) ∧ 𝑡 ∈ (𝑁𝑥)) → (𝑠𝑡) ∈ (𝑁𝑥))))
3837ralbidva 3163 . 2 (𝜑 → (∀𝑠 ∈ 𝒫 𝐵𝑡 ∈ 𝒫 𝐵((𝐼𝑠) ∩ (𝐼𝑡)) ⊆ (𝐼‘(𝑠𝑡)) ↔ ∀𝑠 ∈ 𝒫 𝐵𝑥𝐵𝑡 ∈ 𝒫 𝐵((𝑠 ∈ (𝑁𝑥) ∧ 𝑡 ∈ (𝑁𝑥)) → (𝑠𝑡) ∈ (𝑁𝑥))))
39 ralcom 3315 . 2 (∀𝑠 ∈ 𝒫 𝐵𝑥𝐵𝑡 ∈ 𝒫 𝐵((𝑠 ∈ (𝑁𝑥) ∧ 𝑡 ∈ (𝑁𝑥)) → (𝑠𝑡) ∈ (𝑁𝑥)) ↔ ∀𝑥𝐵𝑠 ∈ 𝒫 𝐵𝑡 ∈ 𝒫 𝐵((𝑠 ∈ (𝑁𝑥) ∧ 𝑡 ∈ (𝑁𝑥)) → (𝑠𝑡) ∈ (𝑁𝑥)))
4038, 39syl6bb 288 1 (𝜑 → (∀𝑠 ∈ 𝒫 𝐵𝑡 ∈ 𝒫 𝐵((𝐼𝑠) ∩ (𝐼𝑡)) ⊆ (𝐼‘(𝑠𝑡)) ↔ ∀𝑥𝐵𝑠 ∈ 𝒫 𝐵𝑡 ∈ 𝒫 𝐵((𝑠 ∈ (𝑁𝑥) ∧ 𝑡 ∈ (𝑁𝑥)) → (𝑠𝑡) ∈ (𝑁𝑥))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396   = wceq 1522  wcel 2081  wral 3105  {crab 3109  Vcvv 3437  cin 3862  wss 3863  𝒫 cpw 4457   class class class wbr 4966  cmpt 5045  wf 6226  cfv 6230  (class class class)co 7021  cmpo 7023  𝑚 cmap 8261
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1777  ax-4 1791  ax-5 1888  ax-6 1947  ax-7 1992  ax-8 2083  ax-9 2091  ax-10 2112  ax-11 2126  ax-12 2141  ax-13 2344  ax-ext 2769  ax-rep 5086  ax-sep 5099  ax-nul 5106  ax-pow 5162  ax-pr 5226  ax-un 7324
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 843  df-3an 1082  df-tru 1525  df-ex 1762  df-nf 1766  df-sb 2043  df-mo 2576  df-eu 2612  df-clab 2776  df-cleq 2788  df-clel 2863  df-nfc 2935  df-ne 2985  df-ral 3110  df-rex 3111  df-reu 3112  df-rab 3114  df-v 3439  df-sbc 3710  df-csb 3816  df-dif 3866  df-un 3868  df-in 3870  df-ss 3878  df-nul 4216  df-if 4386  df-pw 4459  df-sn 4477  df-pr 4479  df-op 4483  df-uni 4750  df-iun 4831  df-br 4967  df-opab 5029  df-mpt 5046  df-id 5353  df-xp 5454  df-rel 5455  df-cnv 5456  df-co 5457  df-dm 5458  df-rn 5459  df-res 5460  df-ima 5461  df-iota 6194  df-fun 6232  df-fn 6233  df-f 6234  df-f1 6235  df-fo 6236  df-f1o 6237  df-fv 6238  df-ov 7024  df-oprab 7025  df-mpo 7026  df-1st 7550  df-2nd 7551  df-map 8263
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator