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

Theorem nllyi 23632
Description: The property of an n-locally 𝐴 topological space. (Contributed by Mario Carneiro, 2-Mar-2015.)
Assertion
Ref Expression
nllyi ((𝐽 ∈ 𝑛-Locally 𝐴𝑈𝐽𝑃𝑈) → ∃𝑢 ∈ ((nei‘𝐽)‘{𝑃})(𝑢𝑈 ∧ (𝐽t 𝑢) ∈ 𝐴))
Distinct variable groups:   𝑢,𝐴   𝑢,𝑃   𝑢,𝑈   𝑢,𝐽

Proof of Theorem nllyi
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 isnlly 23626 . . . 4 (𝐽 ∈ 𝑛-Locally 𝐴 ↔ (𝐽 ∈ Top ∧ ∀𝑥𝐽𝑦𝑥𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥)(𝐽t 𝑢) ∈ 𝐴))
21simprbi 502 . . 3 (𝐽 ∈ 𝑛-Locally 𝐴 → ∀𝑥𝐽𝑦𝑥𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥)(𝐽t 𝑢) ∈ 𝐴)
3 pweq 4576 . . . . . . 7 (𝑥 = 𝑈 → 𝒫 𝑥 = 𝒫 𝑈)
43ineq2d 4173 . . . . . 6 (𝑥 = 𝑈 → (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥) = (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑈))
54rexeqdv 3324 . . . . 5 (𝑥 = 𝑈 → (∃𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥)(𝐽t 𝑢) ∈ 𝐴 ↔ ∃𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑈)(𝐽t 𝑢) ∈ 𝐴))
65raleqbi1dv 3333 . . . 4 (𝑥 = 𝑈 → (∀𝑦𝑥𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥)(𝐽t 𝑢) ∈ 𝐴 ↔ ∀𝑦𝑈𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑈)(𝐽t 𝑢) ∈ 𝐴))
76rspccva 3580 . . 3 ((∀𝑥𝐽𝑦𝑥𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥)(𝐽t 𝑢) ∈ 𝐴𝑈𝐽) → ∀𝑦𝑈𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑈)(𝐽t 𝑢) ∈ 𝐴)
82, 7sylan 591 . 2 ((𝐽 ∈ 𝑛-Locally 𝐴𝑈𝐽) → ∀𝑦𝑈𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑈)(𝐽t 𝑢) ∈ 𝐴)
9 elin 3921 . . . . . . 7 (𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑈) ↔ (𝑢 ∈ ((nei‘𝐽)‘{𝑦}) ∧ 𝑢 ∈ 𝒫 𝑈))
10 sneq 4599 . . . . . . . . . 10 (𝑦 = 𝑃 → {𝑦} = {𝑃})
1110fveq2d 6885 . . . . . . . . 9 (𝑦 = 𝑃 → ((nei‘𝐽)‘{𝑦}) = ((nei‘𝐽)‘{𝑃}))
1211eleq2d 2849 . . . . . . . 8 (𝑦 = 𝑃 → (𝑢 ∈ ((nei‘𝐽)‘{𝑦}) ↔ 𝑢 ∈ ((nei‘𝐽)‘{𝑃})))
13 velpw 4567 . . . . . . . . 9 (𝑢 ∈ 𝒫 𝑈𝑢𝑈)
1413a1i 11 . . . . . . . 8 (𝑦 = 𝑃 → (𝑢 ∈ 𝒫 𝑈𝑢𝑈))
1512, 14anbi12d 643 . . . . . . 7 (𝑦 = 𝑃 → ((𝑢 ∈ ((nei‘𝐽)‘{𝑦}) ∧ 𝑢 ∈ 𝒫 𝑈) ↔ (𝑢 ∈ ((nei‘𝐽)‘{𝑃}) ∧ 𝑢𝑈)))
169, 15bitrid 286 . . . . . 6 (𝑦 = 𝑃 → (𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑈) ↔ (𝑢 ∈ ((nei‘𝐽)‘{𝑃}) ∧ 𝑢𝑈)))
1716anbi1d 642 . . . . 5 (𝑦 = 𝑃 → ((𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑈) ∧ (𝐽t 𝑢) ∈ 𝐴) ↔ ((𝑢 ∈ ((nei‘𝐽)‘{𝑃}) ∧ 𝑢𝑈) ∧ (𝐽t 𝑢) ∈ 𝐴)))
18 anass 473 . . . . 5 (((𝑢 ∈ ((nei‘𝐽)‘{𝑃}) ∧ 𝑢𝑈) ∧ (𝐽t 𝑢) ∈ 𝐴) ↔ (𝑢 ∈ ((nei‘𝐽)‘{𝑃}) ∧ (𝑢𝑈 ∧ (𝐽t 𝑢) ∈ 𝐴)))
1917, 18bitrdi 290 . . . 4 (𝑦 = 𝑃 → ((𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑈) ∧ (𝐽t 𝑢) ∈ 𝐴) ↔ (𝑢 ∈ ((nei‘𝐽)‘{𝑃}) ∧ (𝑢𝑈 ∧ (𝐽t 𝑢) ∈ 𝐴))))
2019rexbidv2 3185 . . 3 (𝑦 = 𝑃 → (∃𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑈)(𝐽t 𝑢) ∈ 𝐴 ↔ ∃𝑢 ∈ ((nei‘𝐽)‘{𝑃})(𝑢𝑈 ∧ (𝐽t 𝑢) ∈ 𝐴)))
2120rspccva 3580 . 2 ((∀𝑦𝑈𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑈)(𝐽t 𝑢) ∈ 𝐴𝑃𝑈) → ∃𝑢 ∈ ((nei‘𝐽)‘{𝑃})(𝑢𝑈 ∧ (𝐽t 𝑢) ∈ 𝐴))
228, 21stoic3 1806 1 ((𝐽 ∈ 𝑛-Locally 𝐴𝑈𝐽𝑃𝑈) → ∃𝑢 ∈ ((nei‘𝐽)‘{𝑃})(𝑢𝑈 ∧ (𝐽t 𝑢) ∈ 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  w3a 1103   = wceq 1570  wcel 2143  wral 3079  wrex 3089  cin 3904  wss 3905  𝒫 cpw 4562  {csn 4589  cfv 6536  (class class class)co 7410  t crest 17468  Topctop 23050  neicnei 23254  𝑛-Locally cnlly 23622
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-iota 6492  df-fv 6544  df-ov 7413  df-nlly 23624
This theorem is referenced by:  nlly2i  23633  llycmpkgen  23709
  Copyright terms: Public domain W3C validator