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

Theorem nllyi 23410
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 23404 . . . 4 (𝐽 ∈ 𝑛-Locally 𝐴 ↔ (𝐽 ∈ Top ∧ ∀𝑥𝐽𝑦𝑥𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥)(𝐽t 𝑢) ∈ 𝐴))
21simprbi 496 . . 3 (𝐽 ∈ 𝑛-Locally 𝐴 → ∀𝑥𝐽𝑦𝑥𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥)(𝐽t 𝑢) ∈ 𝐴)
3 pweq 4565 . . . . . . 7 (𝑥 = 𝑈 → 𝒫 𝑥 = 𝒫 𝑈)
43ineq2d 4169 . . . . . 6 (𝑥 = 𝑈 → (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥) = (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑈))
54rexeqdv 3294 . . . . 5 (𝑥 = 𝑈 → (∃𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥)(𝐽t 𝑢) ∈ 𝐴 ↔ ∃𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑈)(𝐽t 𝑢) ∈ 𝐴))
65raleqbi1dv 3305 . . . 4 (𝑥 = 𝑈 → (∀𝑦𝑥𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥)(𝐽t 𝑢) ∈ 𝐴 ↔ ∀𝑦𝑈𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑈)(𝐽t 𝑢) ∈ 𝐴))
76rspccva 3572 . . 3 ((∀𝑥𝐽𝑦𝑥𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥)(𝐽t 𝑢) ∈ 𝐴𝑈𝐽) → ∀𝑦𝑈𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑈)(𝐽t 𝑢) ∈ 𝐴)
82, 7sylan 580 . 2 ((𝐽 ∈ 𝑛-Locally 𝐴𝑈𝐽) → ∀𝑦𝑈𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑈)(𝐽t 𝑢) ∈ 𝐴)
9 elin 3914 . . . . . . 7 (𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑈) ↔ (𝑢 ∈ ((nei‘𝐽)‘{𝑦}) ∧ 𝑢 ∈ 𝒫 𝑈))
10 sneq 4587 . . . . . . . . . 10 (𝑦 = 𝑃 → {𝑦} = {𝑃})
1110fveq2d 6835 . . . . . . . . 9 (𝑦 = 𝑃 → ((nei‘𝐽)‘{𝑦}) = ((nei‘𝐽)‘{𝑃}))
1211eleq2d 2819 . . . . . . . 8 (𝑦 = 𝑃 → (𝑢 ∈ ((nei‘𝐽)‘{𝑦}) ↔ 𝑢 ∈ ((nei‘𝐽)‘{𝑃})))
13 velpw 4556 . . . . . . . . 9 (𝑢 ∈ 𝒫 𝑈𝑢𝑈)
1413a1i 11 . . . . . . . 8 (𝑦 = 𝑃 → (𝑢 ∈ 𝒫 𝑈𝑢𝑈))
1512, 14anbi12d 632 . . . . . . 7 (𝑦 = 𝑃 → ((𝑢 ∈ ((nei‘𝐽)‘{𝑦}) ∧ 𝑢 ∈ 𝒫 𝑈) ↔ (𝑢 ∈ ((nei‘𝐽)‘{𝑃}) ∧ 𝑢𝑈)))
169, 15bitrid 283 . . . . . 6 (𝑦 = 𝑃 → (𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑈) ↔ (𝑢 ∈ ((nei‘𝐽)‘{𝑃}) ∧ 𝑢𝑈)))
1716anbi1d 631 . . . . 5 (𝑦 = 𝑃 → ((𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑈) ∧ (𝐽t 𝑢) ∈ 𝐴) ↔ ((𝑢 ∈ ((nei‘𝐽)‘{𝑃}) ∧ 𝑢𝑈) ∧ (𝐽t 𝑢) ∈ 𝐴)))
18 anass 468 . . . . 5 (((𝑢 ∈ ((nei‘𝐽)‘{𝑃}) ∧ 𝑢𝑈) ∧ (𝐽t 𝑢) ∈ 𝐴) ↔ (𝑢 ∈ ((nei‘𝐽)‘{𝑃}) ∧ (𝑢𝑈 ∧ (𝐽t 𝑢) ∈ 𝐴)))
1917, 18bitrdi 287 . . . 4 (𝑦 = 𝑃 → ((𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑈) ∧ (𝐽t 𝑢) ∈ 𝐴) ↔ (𝑢 ∈ ((nei‘𝐽)‘{𝑃}) ∧ (𝑢𝑈 ∧ (𝐽t 𝑢) ∈ 𝐴))))
2019rexbidv2 3153 . . 3 (𝑦 = 𝑃 → (∃𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑈)(𝐽t 𝑢) ∈ 𝐴 ↔ ∃𝑢 ∈ ((nei‘𝐽)‘{𝑃})(𝑢𝑈 ∧ (𝐽t 𝑢) ∈ 𝐴)))
2120rspccva 3572 . 2 ((∀𝑦𝑈𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑈)(𝐽t 𝑢) ∈ 𝐴𝑃𝑈) → ∃𝑢 ∈ ((nei‘𝐽)‘{𝑃})(𝑢𝑈 ∧ (𝐽t 𝑢) ∈ 𝐴))
228, 21stoic3 1777 1 ((𝐽 ∈ 𝑛-Locally 𝐴𝑈𝐽𝑃𝑈) → ∃𝑢 ∈ ((nei‘𝐽)‘{𝑃})(𝑢𝑈 ∧ (𝐽t 𝑢) ∈ 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1541  wcel 2113  wral 3048  wrex 3057  cin 3897  wss 3898  𝒫 cpw 4551  {csn 4577  cfv 6489  (class class class)co 7355  t crest 17331  Topctop 22828  neicnei 23032  𝑛-Locally cnlly 23400
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2705
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2712  df-cleq 2725  df-clel 2808  df-ral 3049  df-rex 3058  df-rab 3397  df-v 3439  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4283  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-br 5096  df-iota 6445  df-fv 6497  df-ov 7358  df-nlly 23402
This theorem is referenced by:  nlly2i  23411  llycmpkgen  23487
  Copyright terms: Public domain W3C validator